Abstract
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 is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Marshall Bern, David Eppstein, and John R. Gilbert. Provably Good Mesh Generation. Journal of Computer and System Sciences, 48(3):384–409, June 1994.
Siu-Wing Cheng and Tamal K. Dey. Quality meshing with weighted delaunay refinement. SIAM J. Comput., 33(1):69–93, 2003.
L. Paul Chew. Guaranteed-quality triangular meshes. Technical Report TR-89-983, Department of Computer Science, Cornell University, 1989.
L. Paul Chew. Guaranteed-Quality Delaunay Meshing in 3D. In Proceedings of the Thirteenth Annual Symposium on Computational Geometry, pages 391–393, Nice, France, June 1997. Association for Computing Machinery.
P. Callahan and S. Kosaraju. A decomposition of multi-dimensional point sets with applications to k-nearest-neighbors and n-body potential fields, 1992.
Siu-Wing Cheng and Sheung-Hung Poon. Graded Conforming Delaunay Tetrahedralization with Bounded Radius-Edge Ratio. In Proceedings of the Fourteenth Annual Symposium on Discrete Algorithms, pages 295–304, Baltimore, Maryland, January 2003. Society for Industrial and Applied Mathematics.
Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, and Noel Walkington. Smoothing and cleaning up slivers. In Proceedings of the 32th Annual ACM Symposium on Theory of Computing, pages 273–277, Portland, Oregon, 2000.
Jeff. Erickson. Nice point sets can have nasty delaunay triangulations. In Symposium on Computational Geometry, pages 96–105, 2001.
Benoit Hudson, Gary Miller, and Todd Phillips. Sparse Voronoi Refinement. Technical Report CMU-CS-06-132, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 2006.
Sariel Har-Peled and Alper Üngör. A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions. In Symposium on Computational Geometry, 2005.
Xiang-Yang Li. Generating well-shaped d-dimensional Delaunay meshes. Theor. Comput. Sci., 296(1):145–165, 2003.
Xiang-Yang Li and Shang-Hua Teng. Generating well-shaped Delaunay meshed in 3D. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 28–37. ACM Press, 2001.
Gary L. Miller. A time-eficient Delaunay Refinement algorithm. In Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 400–409, New Orleans, 2004.
Scott A. Mitchell. Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large Angles. In 34th Annual Symposium on Foundations of Computer Science, pages 583–591. IEEE Computer Society Press, 1993.
Gary L. Miller, Steven E. Pav, and Noel J. Walkington. Fully Incremental 3D Delaunay Refinement Mesh Generation. In Eleventh International Meshing Roundtable, pages 75–86, Ithaca, New York, September 2002. Sandia National Laboratories.
Gary L. Miller, Dafna Talmor, Shang-Hua Teng, Noel Walkington, and Han Wang. Control Volume Meshes Using Sphere Packing: Generation, Refinement and Coarsening. In Fifth International Meshing Roundtable, pages 47–61, Pittsburgh, Pennsylvania, October 1996.
Gary L. Miller, Dafna Talmor, and Shang-Hua Teng. Optimal coarsening of unstructured meshes. Journal of Algorithms, 31(1):29–65, Apr 1999.
Gary L. Miller, Dafna Talmor, Shang-Hua Teng, and Noel Walkington. A Delaunay based numerical method for three dimensions: generation, formulation, and partition. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 683–692, Las Vegas, May 1995. ACM.
Scott A. Mitchell and Stephen A. Vavasis. Quality mesh generation in higher dimensions. SIAM J. Comput., 29(4):1334–1370 (electronic), 2000.
Steven E. Pav and Noel J. Walkington. Robust Three Dimensional Delaunay Refinement. In Thirteenth International Meshing Roundtable, pages 145–156, Williamsburg, Virginia, September 2004. Sandia National Laboratories.
Jim Ruppert. A Delaunay Refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18(3):548–585, 1995. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (Austin, TX, 1993).
Jonathan Richard Shewchuk. Tetrahedral mesh generation by delaunay Refinement. In Proceedings of the Fourteenth Annual Symposium on Computational Geometry (Minneapolis, Minnesota), pages 86–95. ACM, June 1998.
Jonathan Richard Shewchuk. Constrained delaunay tetrahedralizations and provably good boundary recovery. In Eleventh International Meshing Roundtable, pages 193–204, Ithaca, New York, September 2002. Sandia National Laboratories.
Daniel Spielman, Shang-Hua Teng, and Alper Üngör. Parallel Delaunay Refinement: Algorithms and analyses. In Proceedings, 11th International Meshing Roundtable, pages 205–218. Sandia National Laboratories, September 15-18 2002.
Dafna Talmor. Well-Spaced Points for Numerical Methods. PhD thesis, Carnegie Mellon University, Pittsburgh, August 1997. CMU CS Tech Report CMU-CS-97-164.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Hudson, B., Miller, G., Phillips, T. (2006). Sparse Voronoi Refinement. In: Pébay, P.P. (eds) Proceedings of the 15th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-34958-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-34958-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34957-0
Online ISBN: 978-3-540-34958-7
eBook Packages: EngineeringEngineering (R0)