Abstract
Intrinsic Delaunay triangulation (IDT) naturally generalizes Delaunay triangulation from R2 to curved surfaces. Due to many favorable properties, the IDT whose vertex set includes all mesh vertices is of particular interest in polygonal mesh processing. To date, the only way for constructing such IDT is the edge-flipping algorithm, which iteratively flips non-Delaunay edges to become locally Delaunay. Although this algorithm is conceptually simple and guarantees to terminate in finite steps, it has no known time complexity and may also produce triangulations containing faces with only two edges. This article develops a new method to obtain proper IDTs on manifold triangle meshes. We first compute a geodesic Voronoi diagram (GVD) by taking all mesh vertices as generators and then find its dual graph. The sufficient condition for the dual graph to be a proper triangulation is that all Voronoi cells satisfy the so-called closed ball property. To guarantee the closed ball property everywhere, a certain sampling criterion is required. For Voronoi cells that violate the closed ball property, we fix them by computing topologically safe regions, in which auxiliary sites can be added without changing the topology of the Voronoi diagram beyond them. Given a mesh with n vertices, we prove that by adding at most O(n) auxiliary sites, the computed GVD satisfies the closed ball property, and hence its dual graph is a proper IDT. Our method has a theoretical worst-case time complexity O(n2 + tnlog n), where t is the number of obtuse angles in the mesh. Computational results show that it empirically runs in linear time on real-world models.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, Constructing Intrinsic Delaunay Triangulations from the Dual of Geodesic Voronoi Diagrams
- Alexander I. Bobenko and Boris A. Springborn. 2007. A discrete Laplace-Beltrami operator for simplicial surfaces. Discrete and Computational Geometry 38, 4, 740--756. Google ScholarDigital Library
- Jean-Daniel Boissonnat, Ramsay Dyer, and Arijit Ghosh. 2013. Constructing intrinsic Delaunay triangulations of submanifolds. arXiv:1303.6493.Google Scholar
- Ramsay Dyer, Gert Vegter, and Mathijs Wintraecken. 2015. Riemannian simplices and triangulations. Geometriae Dedicata 179, 1, 91--138. Google ScholarCross Ref
- Ramsay Dyer, Hao Zhang, and Torsten Möller. 2007a. Delaunay mesh construction. In Proceedings of the Symposium on Geometry Processing (SGP’07). 273--282.Google Scholar
- Ramsay Dyer, Hao Zhang, and Torsten Möller. 2007b. Voronoi-Delaunay duality and Delaunay meshes. In Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling. 415--420. Google ScholarDigital Library
- Ramsay Dyer, Hao Zhang, and Torsten Möller. 2008. Surface sampling and the intrinsic Voronoi diagram. In Proceedings of the Symposium on Geometry Processing (SGP’08). 1393--1402. Google ScholarCross Ref
- Herbert Edelsbrunner and Ernst Peter Mücke. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9, 1, 66--104. Google ScholarDigital Library
- Herbert Edelsbrunner and Nimish R. Shah. 1997. Triangulating topological spaces. International Journal of Computational Geometry and Applications 7, 4, 365--378. Google ScholarCross Ref
- Matthew Fisher, Boris Springborn, Alexander I. Bobenko, and Peter Schröder. 2007. An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing. Computing 82, 2--3, 199--213. Google ScholarDigital Library
- C. Indermitte, Th. Liebling, M. Troyanov, and H. Clémençon. 2001. Voronoi diagrams on piecewise flat surfaces and an application to biological growth. Theoretical Computer Science 263, 1--2, 263--274. Google ScholarCross Ref
- Yong-Jin Liu. 2015. Semi-continuity of skeletons in 2-manifold and discrete Voronoi approximation. IEEE Transactions on Pattern Analysis and Machine Intelligence 37, 9, 1938--1944. Google ScholarCross Ref
- Yong-Jin Liu, Zhanqing Chen, and Kai Tang. 2011. Construction of iso-contours, bisectors, and Voronoi diagrams on triangulated surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence 33, 8, 1502--1517. Google ScholarDigital Library
- Yong-Jin Liu and Kai Tang. 2013. The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces. Information Processing Letters 113, 4, 132--136. Google ScholarDigital Library
- Yong-Jin Liu, Chunxu Xu, Dian Fan, and Ying He. 2015. Efficient construction and simplification of Delaunay meshes. ACM Transactions on Graphics 34, 6, 174. DOI:http://dx.doi.org/10.1145/2816795.2818076 Google ScholarDigital Library
- Joseph S. B. Mitchell, David M. Mount, and Christos H. Papadimitriou. 1987. The discrete geodesic problem. SIAM Journal on Computing 16, 4, 647--668. Google ScholarDigital Library
- Atsuyuki Okabe, Barry Boots, Kokichi Sugihara, and Sung-Nok Chiu. 2000. Spatial Tessellations: Concept and Applications of Voronoi Diagrams. Wiley. Google ScholarCross Ref
- Igor Rivin. 1994. Euclidean structures on simplicial surfaces and hyperbolic volume. Annals of Mathematics 139, 3, 553--580. Google ScholarCross Ref
- Chunxu Xu, Yong-Jin Liu, Qian Sun, Jinyan Li, and Ying He. 2014. Polyline-sourced geodesic Voronoi diagrams on triangle meshes. Computer Graphics Forum 33, 7, 161--170. Google ScholarDigital Library
- Chunxu Xu, Tuanfeng Y. Wang, Yong-Jin Liu, Ligang Liu, and Ying He. 2015. Fast wavefront propagation (FWP) for computing exact geodesic distances on meshes. IEEE Transactions on Visualization and Computer Graphics 21, 7, 822--834. Google ScholarCross Ref
- X. Ying, X. Wang, and Y. He. 2013. Saddle vertex graph (SVG): A novel solution to the discrete geodesic problem. ACM Transactions on Graphics 32, 6, Article No. 170. Google ScholarDigital Library
- Zichun Zhong, Xiaohu Guo, Wenping Wang, Bruno Lévy, Feng Sun, Yang Liu, and Weihua Mao. 2013. Particle-based anisotropic surface meshing. ACM Transactions on Graphics 32, 4, Article No. 99. Google ScholarDigital Library
Recommendations
Conforming weighted delaunay triangulations
Given a set of points together with a set of simplices we show how to compute weights associated with the points such that the weighted Delaunay triangulation of the point set contains the simplices, if possible. For a given triangulated surface, this ...
Efficient construction and simplification of Delaunay meshes
Delaunay meshes (DM) are a special type of triangle mesh where the local Delaunay condition holds everywhere. We present an efficient algorithm to convert an arbitrary manifold triangle mesh M into a Delaunay mesh. We show that the constructed DM has O(...
Voronoi-Delaunay duality and Delaunay meshes
SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modelingWe define a Delaunay mesh to be a manifold triangle mesh whose edges form an intrinsic Delaunay triangulation or iDT of its vertices, where the triangulated domain is the piecewise flat mesh surface. We show that meshes constructed from a smooth surface ...
Comments