期刊文献+

NURBS求交算法——曲线部分 被引量:2

INTERSECTION ALGORITHM FOR NURBS CURVES
在线阅读 下载PDF
导出
摘要 NURBS曲线的R-Rect求交方法通过改变曲线凸包的形状而使得凸包与曲线贴得更近,减少曲线的细分次数,从而提高了计算速度.文中给出具体的实现过程、流程图和实例.经过实用系统的验证,这种求交算法具有稳定、可靠和速度快的特点.这种方法还可以非常方便地推广到曲面求交中去. R-Rect intersection algorithm for NURBS curve presented in this paper adopts oblique rectangle as the convex-box of the curve to make the convex -box and the curve closer. As a result, the curve sub-division number during the intersection is greatly reduced and the computing time is decreased. The concret realizing process is described and the flo-w diagram is illustrated. Having been used in a practical NURBS modeling system, the R-Rect intersection algorithm is stable, reliable and has high speed compared with other convex-box intersection algorithms. It is also easy to generalize the method to NURBS surface intersection.
出处 《西安工业学院学报》 1992年第4期11-17,共7页 Journal of Xi'an Institute of Technology
关键词 B-样条 凸包 求交 NURBS曲线 CAD B-splines convex-hulls Intersection NURBS curve
  • 相关文献

同被引文献5

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部