Compression and Querying of Arbitrary Geodesic Distances
- Publisher:
- SPRINGER INTERNATIONAL PUBLISHING AG
- Publication Type:
- Conference Proceeding
- Citation:
- International Conference on Image Analysis and Processing, 2015, 9279, pp. 282-293
- Issue Date:
- 2015
Closed Access
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
In this paper, we propose a novel method for accelerating the computation of geodesic distances over arbitrary manifold triangulated surfaces. The method is based on a preprocessing step where we build a data structure. This allows to store arbitrary complex distance metrics. We show that, by exploiting the precomputed data, the proposed method is significantly faster than the classical Dijkstra algorithm for the computation of point to point distances. Moreover, as we precompute exact geodesic distances, the proposed approach can be more accurate than state-of-the-art approximations.
Please use this identifier to cite or link to this item: