Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/89439
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, Bangquanen
dc.contributor.authorChen, Shuangminen
dc.contributor.authorXin, Shi-Qingen
dc.contributor.authorHe, Yingen
dc.contributor.authorLiu, Zhenen
dc.contributor.authorZhao, Jieyuen
dc.date.accessioned2018-10-04T02:07:35Zen
dc.date.accessioned2019-12-06T17:25:31Z-
dc.date.available2018-10-04T02:07:35Zen
dc.date.available2019-12-06T17:25:31Z-
dc.date.issued2017en
dc.identifier.citationLiu, B., Chen, S., Xin, S.-Q., He, Y., Liu, Z., & Zhao, J. (2017). An optimization-driven approach for computing geodesic paths on triangle meshes. Computer-Aided Design, 90105-112.en
dc.identifier.issn0010-4485en
dc.identifier.urihttps://hdl.handle.net/10356/89439-
dc.description.abstractThere are many application scenarios where we need to refine an initial path lying on a surface to be as short as possible. A typical way to solve this problem is to iteratively shorten one segment of the path at a time. As local approaches, they are conceptually simple and easy to implement, but they converge slowly and have poor performance on large scale models. In this paper, we develop an optimization driven approach to improve the performance of computing geodesic paths. We formulate the objective function as the total length and adopt the L-BFGS solver to minimize it. Computational results show that our method converges with super-linear rate, which significantly outperforms the existing methods. Moreover, our method is flexible to handle anisotropic metric, non-uniform density function, as well as additional user-specified constraints, such as coplanar geodesics and equally-spaced geodesic helical curves, which are challenging to the existing local methods.en
dc.format.extent8 p.en
dc.language.isoenen
dc.relation.ispartofseriesComputer-Aided 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 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.cad.2017.05.022].en
dc.subjectGeodesic Helical Curvesen
dc.subjectGeodesic Pathsen
dc.subjectDRNTU::Engineering::Computer science and engineeringen
dc.titleAn optimization-driven approach for computing geodesic paths on triangle meshesen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Science and Engineeringen
dc.identifier.doi10.1016/j.cad.2017.05.022en
dc.description.versionAccepted versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:SCSE Journal Articles
Files in This Item:
File Description SizeFormat 
An optimization-driven approach for computing geodesic paths on triangle meshes.pdf4.73 MBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 20

14
Updated on Jan 13, 2023

Web of ScienceTM
Citations 20

8
Updated on Jan 24, 2023

Page view(s)

379
Updated on Jan 27, 2023

Download(s) 50

137
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.