An optimization-driven approach for computing geodesic paths on triangle meshes

There 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 th...

Full description

Saved in:
Bibliographic Details
Main Authors: Liu, Bangquan, Chen, Shuangmin, Xin, Shi-Qing, He, Ying, Liu, Zhen, Zhao, Jieyu
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2018
Subjects:
Online Access:https://hdl.handle.net/10356/89439
http://hdl.handle.net/10220/46218
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English