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.
Domaines
Traitement des images [eess.IV]
Fichier principal
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