A 2D advancing-front Delaunay mesh refinement algorithm (Q2230400)

This article discusses a generalization of Chew's first algorithm for Delaunay mesh refinement. The approach relies on generating well-graded meshes by refining the planar straight line graph such that the lengths of the split segments are asymptotically proportional to the local feature size at the end points of the split segments. Further, the Steiner vertices are inserted in an advancing front manner in order to obtain a size-optimal, truly or constrained Delaunay mesh.