Computing the fréchet distance between simple polygons in polynomial time

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 80-87

  Buchin, Kevin ^a   Buchin, Maike ^a   Wenk, Carola ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b Science Building   (United States)

Author keywords

Fr chet Distance; Shape Matching; Simple Polygons

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; POLYNOMIALS; TRIANGULATION;

FRÉCHET DISTANCE; HOMEOMORPHISMS; SHAPE MATCHING; SIMPLE POLYGONS;

COMPUTATIONAL METHODS;

EID: 33748061284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137870     Document Type: Conference Paper

References (12)

1. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. Ann. Math. Artif. Intell., 13:251-266, 1995.
2. H. Alt and M. Buchin. Semi-computability of the Fréchet distance between surfaces. In Proc. 21st European Workshop on Computational Geometry, pages 45-48, 2005.
3. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl., 5:75-91, 1995.
4. H. Alt and L. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 121-153. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1999.
5. H. Alt, C. Knauer, and C. Wenk. Comparison of distance measures for planar curves. Algorithmica, 38(1):45-58, 2004. Special Issue on Shape Algorithmics.
6. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6(5):485-524, 1991.
7. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
8. M. Fréchet. Sur la distance de deux surfaces, Ann. Soc. Polonaise Math., 3:4-19, 1924.
9. M. Godau, On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Freie Universität Berlin, Germany, 1998.
10. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan, Linear time algorithms for visibility and shortest path problems inside simple polygons. In Proc. 2nd Ann, Symp. on Computational Geometry, pages 1-13, New York, NY, USA, 1986. ACM Press.
11. T. Rado. Length and area. Amer. Math. Soc. Colloq. Publ. Vol. 30, New York, 1948.
12. R. Veltkamp and M. Hagedoorn. State-of-the-art in shape matching. In M. Lew, editor, Principles of Visual Information Retrieval. Springer, 2001.