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

全面介紹

Saved in:
書目詳細資料
Main Authors: Liu, Bangquan, Chen, Shuangmin, Xin, Shi-Qing, He, Ying, Liu, Zhen, Zhao, Jieyu
其他作者: School of Computer Science and Engineering
格式: Article
語言:English
出版: 2018
主題:
在線閱讀:https://hdl.handle.net/10356/89439
http://hdl.handle.net/10220/46218
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English