An accuracy controllable and memory efficient method for computing high-quality geodesic distances on triangle meshes
This paper presents a new method for computing approximate geodesic distances and paths on triangle meshes. Our method combines two state-of-the-art discrete geodesic methods, which are discrete geodesic graphs (DGG) and vertex-oriented triangle propagation (VTP), so that it allows the user to speci...
Main Authors: | Adikusuma, Yohanes Yudhi, Du, Jie, Fang, Zheng, He, Ying |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/161756 |
Similar Items
-
An optimization-driven approach for computing geodesic paths on triangle meshes
by: Liu, Bangquan, et al.
Published: (2018) -
Efficient construction and simplification of Delaunay meshes
by: Liu, Yong-Jin, et al.
Published: (2018) -
Constructing intrinsic delaunay triangulations from the dual of geodesic voronoi diagrams
by: Liu, Yong-Jin, et al.
Published: (2018) -
Knot optimization for biharmonic B-splines on manifold triangle meshes
by: Hou, Fei, et al.
Published: (2018) -
Constructing self-supporting surfaces with planar quadrilateral elements
by: Ma, Long, et al.
Published: (2022)