An Analysis of Shewchuk's Delaunay Refinement Algorithm

Shewchuk’s Delaunay refinement algorithm is a simple scheme to efficiently tetrahedralize a 3D domain. The original analysis provided guarantees on termination and output edge lengths. However, the guarantees are weak and the time and space complexity are not fully covered. In this paper, we present a new analysis of this algorithm. The new analysis reduces… (More)