一种任意复杂平面域三角化的健壮算法

A Robust Quality Triangulation Algorithm of Arbitrary Shaped Planar Domains

提出了一种新的广义交换算子 ,并且以广义交换算子为基础实现了任意复杂平面域的三角剖分算法 .该算法的特点有二 :整个算法的实现过程不会出现多边形的空腔 ,只需维护单一的三角形数据结构 ,数值稳定性高 ;

A fast two dimension constrained Delaunay triangulation algorithm was presented on the basis of general swap operators. This algorithm has two features. The whole implementation of this algorithm is robust because of its unifying data structure of triangle, and it can deal with arbitrary shaped planar domains.