Sparse Voronoi Refinement

We present a new algorithm, Sparse Voronoi Refinement, that produces a conformal Delaunay mesh in arbitrary dimension with guaranteed mesh size and quality. Our algorithm runs in output-sensitive time O(n log(L/s)+m), with constants depending only on dimension and on prescribed element shape quality bounds. For a large class of inputs, including integer coordinates, this matches the optimal time bound of Θ(n log n + m). Our new technique uses interleaving: we maintain a sparse mesh as we mix the recovery of input features with the addition of Steiner vertices for quality improvement. This technical report is the long version of an article [HMP06] presented at IMR 2006, and contains full proofs.

[1]  Gary L. Miller,et al.  Optimal Coarsening of Unstructured Meshes , 1999, J. Algorithms.

[2]  Sheung-Hung Poon,et al.  Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio , 2003, SODA '03.

[3]  Xiang-Yang Li,et al.  Smoothing and cleaning up slivers , 2000, STOC '00.

[4]  Xiang-Yang Li.  Generating Well-Shaped d-dimensional Delaunay Meshes , 2001, COCOON.

[5]  Gary L. Miller,et al.  Control Volume Meshes Using Sphere Packing , 1998, IRREGULAR.

[6]  L. Paul Chew,et al.  Guaranteed-quality Delaunay meshing in 3D (short version) , 1997, SCG '97.

[7]  Alper Üngör,et al.  A time-optimal delaunay refinement algorithm in two dimensions , 2005, SCG.

[8]  Alper Üngör,et al.  Parallel Delaunay Refinement: Algorithms and Analyses , 2002, Int. J. Comput. Geom. Appl..

[9]  Gary L. Miller,et al.  A time efficient Delaunay refinement algorithm , 2004, SODA '04.

[10]  Jonathan Richard Shewchuk,et al.  Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery , 2002, IMR.

[11]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[12]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[13]  Jeff Erickson,et al.  Nice Point Sets Can Have Nasty Delaunay Triangulations , 2001, SCG '01.

[14]  S. Teng,et al.  On the Radius-Edge Condition in the Control Volume Method , 1999 .

[15]  S. Rao Kosaraju,et al.  A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version) , 1992, STOC '92.

[16]  David Eppstein,et al.  Parallel Construction of Quadtrees and Quality Triangulations , 1993, WADS.

[17]  Noel Walkington,et al.  Robust Three Dimensional Delaunay Refinement , 2004, IMR.

[18]  Scott A. Mitchell,et al.  Quality Mesh Generation in Higher Dimensions , 2000, SIAM J. Comput..

[19]  David Eppstein,et al.  Parallel Construction of Quadtrees and Quality Triangulations , 1993, Int. J. Comput. Geom. Appl..

[20]  Xiang-Yang Li,et al.  Generating well-shaped Delaunay meshed in 3D , 2001, SODA '01.

[21]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[22]  Scott A. Mitchell.  Refining a triangulation of a planar straight-line graph to eliminate large angles , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[23]  Dafna Talmor,et al.  Well-Spaced Points for Numerical Methods , 1997 .

[24]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.

[25]  Tamal K. Dey,et al.  Quality meshing with weighted Delaunay refinement , 2002, SODA '02.

[26]  S. Rao Kosaraju,et al.  A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.

[27]  Gary L. Miller,et al.  A Delaunay based numerical method for three dimensions: generation, formulation, and partition , 1995, STOC '95.

[28]  Gary L. Miller,et al.  Fully Incremental 3D Delaunay Refinement Mesh Generation , 2002, IMR.