统一于NIP的多边形三角剖分算法  

AN ALGORITHM UNIFIED IN NONSELFINTERSECTIONPOLYGON FOR TRIANGULATING ANARBITRARY POLYGON

作　　者：陈向平 应道宁[2] 

机构地区：[1]扬州工学院 [2]浙江大学CAD/CAM中心

出　　处：《计算机学报》1989年第3期194-199,共6页Chinese Journal of Computers

摘　　要：本文提出一个简洁的、完整的、统一于非自交多边形(NIP)的多边形三角剖分算法,该算法分成两部分:其一是将任意多边形转化为非自交多边形;其二是非自交多边形的三角剖分。最后给出该算法在三维立体造型中的应用。This paper presents a concise and complete algorithm unified in non-relfintersection polygon for triangulating arbitrary polygon. The algorithm is divided into two parts: one is to convert an arbitrary polygon into nonselfintersection polygon and the Dther is to triangulate nonselfintersection polygon. One of the applications of the algorithm is worked out for solid modelling.

关 键 词：多边形 三角剖分算法 计算机图形学 

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