Advertisement

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

  • Isabelle Sivignon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6607)

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.

Keywords

Geographic Information System Negative Shift Theoretical Complexity Handwritten Document Polygonal Curve 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Abam, M.A., de Berg, M., Hachenberger, P., Zarei, A.: Streaming algorithms for line simplification. In: SoCG 2007, pp. 175–183. ACM, New York (2007)Google Scholar
  2. 2.
    Agarwal, P.K., Har-Peled, S., Mustafa, N.H., Wang, Y.: Near-linear time approximation algorithms for curve simplification. Algorithmica 42(3-4), 203–219 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry 5(1), 75–91 (1995)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Buzer, L.: Optimal simplification of polygonal chains for subpixel-accurate rendering. Comput. Geom. Theory Appl. 42(1), 45–59 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Chan, W.S., Chin, F.: Approximation of polygonal curves with minimum number of line segments. In: Ibaraki, T., Iwama, K., Yamashita, M., Inagaki, Y., Nishizeki, T. (eds.) ISAAC 1992. LNCS, vol. 650, pp. 378–387. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  6. 6.
    Driemel, A., Har-Peled, S., Wenk, C.: Approximating the fréchet distance for realistic curves in near linear time. In: SoCG 2010, pp. 365–374. ACM, New York (2010)Google Scholar
  7. 7.
    Godau, M.: A natural metric for curves—computing the distance for polygonal chains and approximation algorithms. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol. 480, pp. 127–136. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  8. 8.
    Imai, H., Iri, M.: Polygonal approximations of a curve: formulations and algorithms. In: Computational Morphology, pp. 71–86. Elsevier, Amsterdam (1988)Google Scholar
  9. 9.
  10. 10.
    Pelletier, S.: Computing the Fréchet distance between two polygonal curves, http://www.cim.mcgill.ca/~stephane/cs507/Project.html
  11. 11.
    Sriraghavendra, E., Karthik, K., Bhattacharyya, C.: Fréchet distance based approach for searching online handwritten documents. In: ICDAR 2007: Int. Conference on Document Analysis and Recognition, pp. 461–465. IEEE Computer Society, Los Alamitos (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

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

Personalised recommendations