针对二维约束Delaunay网格生成中约束边恢复问题,提出了一个基于平面扫描策略的约束边恢复算法,证明其收敛性。给出了算法的计算复杂度,说明了算法能有效减少"相交测试"的次数。实现算法并用复杂算例验证了所得结论。
We present an edge recovery algorithm based on plane-sweeping scheme for 2D constrained Delaunay mesh generation and prove its correctness.We also give the asymptotic time complexity of the algorithm and prove that the algorithm will effiectively reduce the number of intersection test.At last,we demonstrate the performance of our algorithm though complicated example.