A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance

  • Isabelle Sivignon
Conference paper

DOI: 10.1007/978-3-642-19867-0_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6607)
Cite this paper as:
Sivignon I. (2011) A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance. In: Debled-Rennesson I., Domenjoud E., Kerautret B., Even P. (eds) Discrete Geometry for Computer Imagery. DGCI 2011. Lecture Notes in Computer Science, vol 6607. Springer, Berlin, Heidelberg

Abstract

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 \(\mathcal{O}(n\log(n))\), experiments show a linear behaviour in practice.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Isabelle Sivignon
    • 1
  1. 1.gipsa-lab, CNRS, UMR 5216France

Personalised recommendations