Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, Yong-Jinen
dc.contributor.authorFan, Dianen
dc.contributor.authorXu, Chun-Xuen
dc.contributor.authorHe, Yingen
dc.identifier.citationLiu, Y.-J., Fan, D., Xu, C.-X., & He, Y. (2017). Constructing intrinsic delaunay triangulations from the dual of geodesic voronoi diagrams. ACM Transactions on Graphics, 36(2), 15-.en
dc.description.abstractIntrinsic 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.en
dc.format.extent15 p.en
dc.relation.ispartofseriesACM Transactions on Graphicsen
dc.rights© 2017 Association for Computing Machinery. This is the author created version of a work that has been peer reviewed and accepted for publication by ACM Transactions on Graphics, Association for Computing Machinery. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [].en
dc.subjectIntrinsic Delaunay Triangulationen
dc.subjectGeodesic Voronoi Diagramen
dc.titleConstructing intrinsic delaunay triangulations from the dual of geodesic voronoi diagramsen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Science and Engineeringen
dc.description.versionAccepted versionen
item.fulltextWith Fulltext-
Appears in Collections:SCSE Journal Articles
Files in This Item:
File Description SizeFormat 
Constructing Intrinsic Delaunay Triangulations from the Dual of Geodesic Voronoi Diagrams.pdf13.58 MBAdobe PDFThumbnail

Citations 20

Updated on Nov 27, 2023

Web of ScienceTM
Citations 20

Updated on Oct 28, 2023

Page view(s) 50

Updated on Nov 30, 2023

Download(s) 50

Updated on Nov 30, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.