总结并提出了一种通用点线面集Delaunay三角剖分与动态编辑的统一算法。可以实现离散点的Delaunay三角剖分,约束线、面的Delaunay三角剖分,任意多边形内带特征约束(包括点、线、面)的三角剖分,一般Delaunay三角剖分的外边界都是其离散点集的凸包,且内岛屿一般没有挖掉,本算法实现了Delaunay三角剖分时内、外边界的保界处理。 更多还原
【Abstract】 This paper summarizes and presents a kind of universal algorithm of generic points,lines and polygon Delaunay triangulation and dynamic editing.Discrete points,constrained line,polygon,polygon features with zone constraints(including point,line,polygon) Delaunay triangulation can be achieved.The outer boundary of Delaunay triangulation in general is the convex bumps of discrete points,and the inner islands generally do not dig out.The algorithm in process of the Delaunay triangulation,realized t... 更多还原