Computing constrained triangulation and Delaunay triangulation: a new algorithm
Zhou Jian-ming, Shao Ke-ran, Zhou Keding, Zhan Qionghua · IEEE Transactions on Magnetics · 1990
A novel algorithm for computing optimal constrained triangulation is presented which is equally applicable to 2-D and 3-D optimal constrained triangulation and Delaunay triangulation. This algorithm has no degenerate and near-degenerate problems. The same amount of time is needed to add a new point to an existing mesh of any element number provided that the element it belongs to has been predetermined, as in the self-adaptive finite-element analysis process. This algorithm has been applied to finite-element mesh generation. Test results are given.>