Bezier曲线曲面的环检测  

Loop Detection for Bezier Curves and Surfaces

作　　者：郑建民[1] 

机构地区：[1]浙江大学,421信箱杭州310027

出　　处：《计算机辅助设计与图形学学报》1992年第1期47-54,共8页Journal of Computer-Aided Design & Computer Graphics

摘　　要：近年来人们提出了一些检查曲面的交线是否构成闭环的算法,但它们的计算量都比较大。本文首先引进包围凸棱锥的概念,证明了一个保证两曲线段最多交于一点的条件,然后提出一些新的环检测方法。这些方法都比较简单,计算量省。Recently some loop detection methods in surface intersections are pre sented,but their speed are too slow. In this paper, a concept of bounding convex Py ramid is introduced and the conditions are Proved for guaranteeing that two curves cannot intersect more than one Point. Then new loop detection methods for Bezier curves and surfaces are ProPosed.

关 键 词：BEZIER 曲线 曲面 交线 环 CAGD 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]