New Results on LEPP-delaunay Algorithm for Quality Triangulations

In this paper, we provide proofs of termination and size-optimality of the LEPP-Delaunay algorithm, for the quality generation of triangulations. We first prove that the algorithm cannot insert points arbitrarily close to each other. We also show that the algorithm terminates, producing well-graded triangulations with internal angles greater than 25.66 degrees for geometries with input constrained angles of at least 30 degrees.