A fast algorithm for well-spaced points and approximate delaunay graphs

ABSTRACT

We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time O(2^O(d)(n log n + m)), where n is the input size, m is the output point set size, and d is the ambient dimension. The constants only depend on the desired element quality bounds.

To gain this new efficiency, the algorithm approximately maintains the Voronoi diagram of the current set of points by storing a superset of the Delaunay neighbors of each point. By retaining quality of the Voronoi diagram and avoiding the storage of the full Voronoi diagram, a simple exponential dependence on d is obtained in the running time. Thus, if one only wants the approximate neighbors structure of a refined Delaunay mesh conforming to a set of input points, the algorithm will return a size 2^O(d)m graph in 2^O(d)(n log n + m) expected time. If m is superlinear in n, then we can produce a hierarchically well-spaced superset of size 2^O(d)n in 2^O(d)n log n expected time.

References

1. Pierre Alliez, Laurent Rineau, Stéphane Tayeb, Jane Tournois, and Mariette Yvinec. 3D mesh generation. In CGAL User and Reference Manual. CGAL Editorial Board, 4.1 edition, 2012. http://www.cgal.org/Manual/4.1/doc_html/cgal_manual/packages.html#Pkg:Mesh_3.
2. Jean-Daniel Boissonnat, Olivier Devillers, and Samuel Hornus. Incremental construction of the Delaunay graph in medium dimension. In Annual Symposium on Computational Geometry, pages 208--216, 2009.
3. Siu-Wing Cheng, Tamal K. Dey, and Jonathan Richard Shewchuk. Delaunay Mesh Generation. CRC Press, 2012.
4. L. Paul Chew. Guaranteed-quality triangular meshes. Technical Report TR-89--983, Department of Computer Science, Cornell University, 1989.
5. Kenneth L. Clarkson. Building triangulations using epsilon-nets. In STOC: ACM Symposium on Theory of Computing, pages 326--335, 2006.
6. P. J. Green and R. Sibson. Computing Dirichlet tessellations in the plane. Computer Journal, 21(2):168--173, 1978.
7. Martin Grötschel, Lászlo Lovász, and Alexander Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, second edition edition, 1993.
8. Sariel Har-Peled and Manor Mendel. Fast construction of nets in low dimensional metrics, and their applications. SIAM Journal on Computing, 35(5):1148--1184, 2006.
9. 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 Carnegie Mellon University-CS-06--132.
10. Benoıt Hudson, Gary L. Miller, Steve Y. Oudot, and Donald R. Sheehy. Topological inference via meshing. In SOCG, pages 277--286, 2010.
11. Jirı Matousek. Lectures on Discrete Geometry. Springer-Verlag, 2002.
12. Gary L. Miller, Todd Phillips, and Donald R. Sheehy. Beating the spread: Time-optimal point meshing. In SOCG, pages 321--330, 2011.
13. Gary L. Miller, Donald R. Sheehy, and Ameya Velingker. A fast algorithm for well-spaced points and approximate Delaunay graphs. Research Report arXiv:1304.0524 {cs.CG}, April 2013. http://arxiv.org/abs/1304.0524.
14. Gary L. Miller, Dafna Talmor, Shang-Hua Teng, and Noel Walkington. On the radius-edge condition in the control volume method. SIAM J. on Numerical Analysis, 36(6):1690--1708, 1999.
15. Ernst P. Mücke, Isaac Saias, and Binhai Zhu. Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations. Comput. Geom, 12(1--2):63--83, 1999.
16. Jim Ruppert. A Delaunay refinement algorithm for quality $2$-dimensional mesh generation. J. Algorithms, 18(3):548--585, 1995.
17. Donald R. Sheehy. Mesh Generation and Geometric Persistent Homology. PhD thesis, Carnegie Mellon University, 2011.
18. Donald R. Sheehy. New Bounds on the Size of Optimal Meshes. Computer Graphics Forum, 31(5):1627--1635, 2012.
19. Jonathan Richard Shewchuk. Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator. In Applied Computational Geometry, volume 1148 of Lecture Notes in Computer Science, pages 203--222, 1996.
20. Hang Si. TetGen: A quality tetrahedral mesh generator and a 3D Delaunay triangulator. http://tetgen.org/, January 2011.

Index Terms

• Theory of computation

  • Randomness, geometry and discrete structures

    • Computational geometry