PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Aiello R., Banterle F., Pietroni N., Malomo L., Cignoni P., Scopigno R. Compression and querying of arbitrary geodesic distances. In: ICIAP 2015 - Image Analysis and Processing. 18th International Conference (Genoa, Italy, 7-11 September 2015). Proceedings, pp. 282 - 293. Vittorio Murino, Enrico Puppo (eds.). (Lecture Notes in Computer Science, vol. 9279). Springer Verlag, 2015.
 
 
Abstract
(English)
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 com- putation 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.
URL: http://link.springer.com/chapter/10.1007%2F978-3-319-23231-7_26
DOI: 10.1007/978-3-319-23231-7_26
Subject Geodesics
I.3.5 Computational Geometry and Object Modeling. Physically based modeling


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional