loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

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

ISBN: 978-989-758-089-5

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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 100.24.209.47

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Schwartz, W.; Rezende, P. and Pedrini, H. (2015). Faster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue.In Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2015) ISBN 978-989-758-089-5, pages 371-378. DOI: 10.5220/0005260903710378

@conference{visapp15,
author={William Robson Schwartz. and Pedro Jussieu Rezende. and Helio Pedrini.},
title={Faster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue},
booktitle={Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2015)},
year={2015},
pages={371-378},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005260903710378},
isbn={978-989-758-089-5},
}

TY - CONF

JO - Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2015)
TI - Faster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue
SN - 978-989-758-089-5
AU - Schwartz, W.
AU - Rezende, P.
AU - Pedrini, H.
PY - 2015
SP - 371
EP - 378
DO - 10.5220/0005260903710378

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.