Constant-time all-pairs geodesic distance query on triangle meshes
Computing discrete geodesics on polyhedral surfaces plays an important role in computer graphics. In contrast to the well-studied "single-source, all-destination" discrete geodesic problem, little progress has been reported to the all-pairs geodesic, i.e., computing the geodesic distance b...
Main Authors: | Xin, Shi-Qing, Ying, Xiang, He, Ying |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference Paper |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/96690 http://hdl.handle.net/10220/12996 |
Similar Items
-
An intrinsic algorithm for computing geodesic distance fields on triangle meshes with holes
by: Quynh, Dao Thi Phuong, et al.
Published: (2013) -
An optimization-driven approach for computing geodesic paths on triangle meshes
by: Liu, Bangquan, 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) -
Polyline-sourced geodesic voronoi diagrams on triangle meshes
by: Xu, Chunxu, et al.
Published: (2018) -
A global algorithm to compute defect-tolerant geodesic distance
by: Xin, Shi-Qing, et al.
Published: (2013)