Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/87204
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, Xiaoningen
dc.contributor.authorFang, Zhengen
dc.contributor.authorWu, Jiajunen
dc.contributor.authorXin, Shi-Qingen
dc.contributor.authorHe, Yingen
dc.date.accessioned2018-01-19T04:30:47Zen
dc.date.accessioned2019-12-06T16:37:11Z-
dc.date.available2018-01-19T04:30:47Zen
dc.date.available2019-12-06T16:37:11Z-
dc.date.issued2017en
dc.identifier.citationWang, X., Fang, Z., Wu, J., Xin, S.-Q., & He, Y. (2017). Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces. Computer Aided Geometric Design, 52-53, 262-284.en
dc.identifier.issn0167-8396en
dc.identifier.urihttps://hdl.handle.net/10356/87204-
dc.description.abstractWe present a new graph-based method, called discrete geodesic graph (DGG), to compute discrete geodesics in a divide-and-conquer manner. Let M be a manifold triangle mesh with n vertices and ε>0 the given accuracy parameter. Assume the vertices are uniformly distributed on the input mesh. We show that the DGG associated to M has O(n/sqrt(ε)) edges and the shortest path distances on the graph approximate geodesic distances on M with relative error O(ε). Computational results show that the actual error is less than 0.6ε on common models. Taking advantage of DGG's unique features, we develop a DGG-tailored label-correcting algorithm that computes geodesic distances in empirically linear time. With DGG, we can guarantee the computed distances are true distance metrics, which is highly desired in many applications. We observe that DGG significantly outperforms saddle vertex graph (SVG) – another graph based method for discrete geodesics – in terms of graph size, accuracy control and runtime performance.en
dc.description.sponsorshipMOE (Min. of Education, S’pore)en
dc.format.extent19 p.en
dc.language.isoenen
dc.relation.ispartofseriesComputer Aided Geometric Designen
dc.rights© 2017 Elsevier. This is the author created version of a work that has been peer reviewed and accepted for publication by Computer Aided Geometric Design, Elsevier. 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: [http://dx.doi.org/10.1016/j.cagd.2017.03.010].en
dc.subjectGeodesic Distancesen
dc.subjectPolyhedral Surfacesen
dc.titleDiscrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfacesen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Science and Engineeringen
dc.identifier.doi10.1016/j.cagd.2017.03.010en
dc.description.versionAccepted versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:SCSE Journal Articles
Files in This Item:
File Description SizeFormat 
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces.pdf9.65 MBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 20

21
Updated on Jan 23, 2023

Web of ScienceTM
Citations 20

13
Updated on Jan 22, 2023

Page view(s) 20

563
Updated on Jan 27, 2023

Download(s) 10

303
Updated on Jan 27, 2023

Google ScholarTM

Check

Altmetric


Plumx

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