Computing the Fréchet distance between simple polygons

Computational Geometry: Theory and Applications

Volumn 41, Issue 1-2, 2008, Pages 2-20

  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

EID: 84867934894     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2007.08.003     Document Type: Conference Paper

References (20)

1. H. Alt, B. Behrends, and J. Blömer Approximate matching of polygonal shapes Annals of Mathematics and Artificial Intelligence 13 1995 251 266
2. H. Alt, M. Buchin, Semi-computability of the Fréchet distance between surfaces, in: Proc. 21st European Workshop on Computational Geometry, 2005, pp. 45-48
3. H. Alt, and M. Buchin Can we compute the similarity between surfaces? http://arxiv.org/abs/cs.CG/0703011 2007
4. H. Alt, and M. Godau Computing the Fréchet distance between two polygonal curves International Journal of Computational Geometry and Applications 5 1995 75 91
5. H. Alt, and L. Guibas Discrete geometric shapes: Matching, interpolation, and approximation J.-R. Sack, J. Urrutia, Handbook of Computational Geometry 1999 Elsevier Science Publishers 121 153
6. H. Alt, C. Knauer, and C. Wenk Comparison of distance measures for planar curves Algorithmica 38 1 2004 45 58 Special Issue on Shape Algorithmics
7. K. Buchin, M. Buchin, C. Wenk. Fréchet distance between simple polygons, in: Proc. 15th Annual Fall Workshop on Computational Geometry, 2005, pp. 7-8
8. K. Buchin, M. Buchin, C. Wenk, Computing the Fréchet distance between simple polygons, in: Proc. 22nd European Workshop on Computational Geometry, 2006, pp. 103-106
9. K. Buchin, M. Buchin, C. Wenk, Computing the Fréchet distance between simple polygons in polynomial time, in: Proc. 22nd Annual ACM Symposium on Computational Geometry, 2006, pp. 80-87
10. R. Cole Slowing down sorting networks to obtain faster sorting algorithms Journal of the ACM 34 1 1987 200 208
11. D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progressions Journal of Symbolic Computation 9 1990 251 280
12. M. Fréchet Sur la distance de deux surfaces Annales de la Société Polonaise de Mathématique 3 1924 4 19
13. M. Godau, On the complexity of measuring the similarity between geometric objects in higher dimensions, PhD thesis, Freie Universität Berlin, Germany, 1998
14. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan Linear time algorithms for visibility and shortest path problems inside simple polygons Algorithmica 2 1 1987 209 233
15. J.M. Keil Polygon decomposition R. Sack, J. Urrutia, Handbook of Computational Geometry 2000 Elsevier Science Publishers
16. J.M. Keil, and J. Snoeyink On the time bound for convex decomposition of simple polygons International Journal of Computational Geometry and Applications 12 3 2002 181 192
17. N. Megiddo Applying parallel computation algorithms in the design of serial algorithms Journal of the ACM 30 4 1983 852 865
18. T. Rado Length and Area American Mathematical Society Colloquium Publ. vol. 30 1948 AMS New York
19. V. Strassen Gaussian elimination is not optimal Numer. Math. 13 1969 354 356
20. R. Veltkamp, and M. Hagedoorn State-of-the-art in shape matching M. Lew, Principles of Visual Information Retrieval 2001 Springer Verlag