Linear-size meshes
Presented at the Canadian Conference on Computational Geometry, 2008, in Montreal
We show how to adapt Delaunay refinement meshing technology to produce linear size Delaunay meshes of any input point set.
The new technique that makes this possible is the use of well-paced points, or those that can be ordered so that consecutive prefixes
have a bounded difference in local feature size.