A global algorithm to compute defect-tolerant geodesic distance
Computing geodesic distance on surfaces plays a critical role in digital geometry processing. However, due to its locally shortest nature, geodesic distance is highly sensitive to local geometrical and topological changes, diminishing its applications to real-world models which may contain various t...
Saved in:
Main Authors: | Xin, Shi-Qing, Quynh, Dao Thi Phuong, Ying, Xiang, He, Ying |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/97269 http://hdl.handle.net/10220/12096 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An intrinsic algorithm for computing geodesic distance fields on triangle meshes with holes
by: Quynh, Dao Thi Phuong, et al.
Published: (2013) -
Constant-time all-pairs geodesic distance query on triangle meshes
by: Xin, Shi-Qing, et al.
Published: (2013) -
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
by: Wang, Xiaoning, et al.
Published: (2018) -
Computing smooth quasi-geodesic distance field (QGDF) with quadratic programming
by: Cao, Luming, et al.
Published: (2021) -
Efficiently computing exact geodesic loops within finite steps
by: Xin, Shi-Qing, et al.
Published: (2013)