摘要
本文提出了一种适用于多连通的多边形区域的三角剖分和非连通的受限数据的三角剖分算法。该算法简洁、直观，采用翼边型数据结构，用Ｄｅｌａｕｎａｙ剖分方法实现。
The paper presents a new triangulation method suitable for both multiple connected polygonal domains and unconnected constrained data. This method is intuitive and simple, and is an extension of Delaunay triangulation. It is realized by the use of “wing-edge” data structure.
出处
《工程图学学报》
CSCD
1997年第2期85-91,共7页
Journal of Engineering Graphics
