Summary
The recent Sparse Voronoi Refinement (SVR) Algorithm for mesh generation has the fastest theoretical bounds for runtime and memory usage. We present a robust practical software implementation of the SVR for meshing a piecewise linear complex in 3 dimensions. Our software is competitive in runtime with state of the art freely available packages on generic inputs, and on pathological worse cases inputs, we show SVR indeed leverages its theoretical guarantees to produce vastly superior runtime and memory usage. The theoretical algorithm description of SVR leaves open several data structure design options, especially with regard to point location strategies. We show that proper strategic choices can greatly effect constant factors involved in runtime.
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 Gilbert. Provably good mesh generation. J. Comput. Syst. Sci., 48(3):384–409, 1994.
Daniel K. Blandford. Compact Data Structures with Fast Queries. PhD thesis, Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania, October 2005. CMU CS Tech Report CMU-CS-05-196.
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.
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.
Benoît Hudson, Gary Miller, and Todd Phillips. Sparse Voronoi Refinement. In Proceedings of the 15th International Meshing Roundtable, pages 339–356, Birmingham, Alabama, 2006. Long version available as Carnegie Mellon University Technical Report CMU-CS-06-132.
Benoît Hudson, Gary L. Miller, and Todd Phillips. Sparse Parallel Delaunay Refinement. In 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 339–347, San Diego, June 2007.
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 meshes in 3D. In SODA ’01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 28–37, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics.
Gary L. Miller. A time efficient Delaunay refinement algorithm. In SODA ’04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 400–409, Philadelphia, PA, USA, 2004. Society for Industrial and Applied Mathematics.
Gary L. Miller, Steven E. Pav, and Noel J. Walkington. Fully Incremental 3D [elaunay 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, and Noel Walkington. On the radius–edge condition in the control volume method. SIAM J. Numer. Anal., 36(6):1690–1708, 1999.
Scott A. Mitchell and Stephen A. Vavasis. Quality Mesh Generation in Higher Dimensions. SIAM Journal on Computing, 29(4):1334–1370, 2000.
Aleksandar Nanevski, Guy E. Blelloch, and Robert Harper. Automatic Generation of Staged Geometric Predicates. In International Conference on Functional Programming, pages 217–228, Florence, Italy, September 2001.
Jim Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18(3):548–585, 1995.
Jonathan Richard Shewchuk. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. Discrete & Computational Geometry, 18(3):305–363, October 1997.
Jonathan Richard Shewchuk. Tetrahedral Mesh Generation by Delaunay Refinement. In Proceedings of the Fourteenth Annual Symposium on Computational Geometry, pages 86–95, Minneapolis, Minnesota, June 1998. Association for Computing Machinery.
Jonathan Richard Shewchuk. Lecture notes on geometric robustness, 1999.
Jonathan R. Shewchuk. Pyramid, 2005. Personal communication.
Jonathan R. Shewchuk. Triangle, 2005. http://www.cs.cmu.edu/ quake/triangle.html.
Hang Si. On refinement of constrained Delaunay tetrahedralizations. In Proceedings of the 15th International Meshing Roundtable, 2006.
Hang Si. TetGen, 2007. tetgen.berlios.de.
Daniel Spielman, Shang-Hua Teng, and Alper Üngör. Parallel Delaunay refinement: Algorithms and analyses. IJCGA, 17:1–30, 2007.
Stephen A. Vavasis. QMG, 2000. http://www.cs.cornell.edu/home/vavasis/qmg-home.html.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acar, U.A., Hudson, B., Miller, G.L., Phillips, T. (2008). SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. In: Brewer, M.L., Marcum, D. (eds) Proceedings of the 16th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75103-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-75103-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75102-1
Online ISBN: 978-3-540-75103-8
eBook Packages: EngineeringEngineering (R0)