A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance - AGPIG Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance

Résumé

Given a digital curve and a maximum error, we propose an algorithm that computes a simplification of the curve such that the Fréchet distance between the original and the simplified curve is less than the error. The algorithm uses an approximation of the Fréchet distance, but a guarantee over the quality of the simplification is proved. Moreover, even if the theoretical complexity of the algorithm is in O(n log(n)), experiments show a linear behaviour in practice.
Fichier principal
Vignette du fichier
article_final.pdf (1.03 Mo) Télécharger le fichier
fast-track.pdf (38.95 Mo) Télécharger le fichier
poster.pdf (418.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Autre
Format : Autre

Dates et versions

hal-00643520 , version 1 (22-11-2011)

Identifiants

Citer

Isabelle Sivignon. A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance. DGCI 2011 - 16th IAPR International Conference on Discrete Geometry for Computer Imagery, Apr 2011, Nancy, France. pp.333-345, ⟨10.1007/978-3-642-19867-0_28⟩. ⟨hal-00643520⟩
332 Consultations
202 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More