A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions

Sariel Har-Peled, Alper Ungor

We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes $O(n\log n+m)$ time, where $n$ is the…