Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces

Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces

We present a new graph-based method, called discrete geodesic graph (DGG), to compute discrete geodesics in a divide-and-conquer manner. Let M be a manifold triangle mesh with n vertices and ε>0 the given accuracy parameter. Assume the vertices are uniformly distributed on the input mesh. We show...

Full description

Bibliographic Details
Main Authors: Wang, Xiaoning, Fang, Zheng, Wu, Jiajun, Xin, Shi-Qing, He, Ying
Other Authors: School of Computer Science and Engineering
Format: Journal Article
Language:English
Published: 2018
Subjects:
Geodesic Distances
Polyhedral Surfaces
Online Access:https://hdl.handle.net/10356/87204
http://hdl.handle.net/10220/44328

Internet

https://hdl.handle.net/10356/87204
http://hdl.handle.net/10220/44328

Similar Items