Sciweavers

Share
SODA
2004
ACM

A time efficient Delaunay refinement algorithm

10 years 5 months ago
A time efficient Delaunay refinement algorithm
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic running time. The algorithm is based on the extremely popular Delaunay refinement algorithm of Ruppert. We know of no prior refinement algorithm with an analyzed subquadratic time bound. For many natural classes of meshing problems, our time bounds are comparable to know bounds for quadtree methods.
Gary L. Miller
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where SODA
Authors Gary L. Miller
Comments (0)
books