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 |
---|---|
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 |
Similar Items
-
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
by: Wang, Xiaoning, et al.
Published: (2018) -
An accuracy controllable and memory efficient method for computing high-quality geodesic distances on triangle meshes
by: Adikusuma, Yohanes Yudhi, et al.
Published: (2022) -
Fast wavefront propagation (FWP) for computing exact geodesic distances on meshes
by: Xu, Chunxu, et al.
Published: (2018) -
Lightweight preprocessing and fast query of geodesic distance via proximity graph
by: Xin, Shiqing, et al.
Published: (2019) -
Constructing intrinsic delaunay triangulations from the dual of geodesic voronoi diagrams
by: Liu, Yong-Jin, et al.
Published: (2018)