Localized Delaunay Refinement for Sampling and Meshing
Loading...
Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The technique of Delaunay renement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one lacuna that limits its application. It does not scale well with the mesh size. As the sample point set grows, the Delaunay triangulation starts stressing the available memory space which ultimately stalls any effective progress. A natural solution to the problem is to maintain the point set in clusters and run the renement on each individual cluster. However, this needs a careful point insertion strategy and a balanced coordination among the neighboring clusters to ensure consistency across individual meshes. We design an octtree based localized Delaunay refinement method for meshing surfaces in three dimensions which meets these goals. We prove that the algorithm terminates and provide guarantees about structural properties of the output mesh. Experimental results show that the method can avoid memory thrashing while computing large meshes and thus scales much better than the standard Delaunay refinement method.
Description
@article{10.1111:j.1467-8659.2010.01781.x,
journal = {Computer Graphics Forum},
title = {{Localized Delaunay Refinement for Sampling and Meshing}},
author = {Tamal K. Dey and Joshua A. Levine and Andrew Slatton},
year = {2010},
publisher = {},
DOI = {10.1111/j.1467-8659.2010.01781.x}
}