Authors:
William Robson Schwartz
1
;
Pedro Jussieu Rezende
2
and
Helio Pedrini
2
Affiliations:
1
Universidade Federal de Minas Gerais, Brazil
;
2
Institute of Computing and University of Campinas, Brazil
Keyword(s):
Geodesic Paths, Shortest Geodesic Distance, Shortest Path, Dijkstra’s Algorithm, Bucketing Data Structure.
Related
Ontology
Subjects/Areas/Topics:
Computer Vision, Visualization and Computer Graphics
;
Image and Video Analysis
;
Shape Representation and Matching
Abstract:
Computing shortest geodesic paths is a crucial problem in several application areas, including robotics, medical imaging, terrain navigation and computational geometry. This type of computation on triangular meshes helps to solve different tasks, such as mesh watermarking, shape classification and mesh parametrization. In this work, a priority queue based on a bucketing structure is applied to speed up graph-based methods that approximates shortest geodesic paths on polyhedra. Initially, the problem is stated, some of its properties are discussed and a review of relevant methods is presented. Finally, we describe the proposed method and show several results and comparisons that confirm its benefits.