摘要
本文认为,在传统的参数曲面分割求交算法中,由于近似多边形存在厚度,因此不能用简单的方法计算近似多边形的交线。文章提出了一种改进的算法,该算法以整体的观点考察多边形的面、边、点之间的关系,把两多边形之间的求交放到全体多边形中去考虑,从而避免了两参数曲面的交线出现裂缝、丢失或增多的现象。实践证明,这种改进算法是可靠的。
In the traditional divide algorithm for intersection of two parameter surfaces, it is impossible to simply calculate the intersection of polygons approxi mated from divided surfaces because of the, thickness of the polygons. An improving algorithm is presented which has eliminated some unreasonable phenomena, such as intersection segments lost, by considering the relationship among faces, edges and vertices of polygons in global view, and by computing the intersection of any two polygons under environment of all polygons. It has been proved by experiments that the algorithm is robust.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
1991年第1期29-34,共6页
Journal of Computer-Aided Design & Computer Graphics