Fast wavefront propagation (FWP) for computing exact geodesic distances on meshes
Computing geodesic distances on triangle meshes is a fundamental problem in computational geometry and computer graphics. To date, two notable classes of algorithms, the Mitchell-Mount-Papadimitriou (MMP) algorithm and the Chen-Han (CH) algorithm, have been proposed. Although these algorithms can co...
Saved in:
Main Authors: | Xu, Chunxu, Wang, Tuanfeng Y., Liu, Yong-Jin, Liu, Ligang, He, Ying |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/80804 http://hdl.handle.net/10220/45015 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Parallelizing discrete geodesic algorithms with perfect efficiency
by: Ying, Xiang, et al.
Published: (2021) -
An accuracy controllable and memory efficient method for computing high-quality geodesic distances on triangle meshes
by: Adikusuma, Yohanes Yudhi, et al.
Published: (2022) -
An optimization-driven approach for computing geodesic paths on triangle meshes
by: Liu, Bangquan, et al.
Published: (2018) -
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
by: Wang, Xiaoning, et al.
Published: (2018) -
Lightweight preprocessing and fast query of geodesic distance via proximity graph
by: Xin, Shiqing, et al.
Published: (2019)