Comparison of distance measures for planar curves

Algorithmica (New York)

Volumn 38, Issue 1, 2003, Pages 45-58

  Alt, Helmut ^a   Knauer, Christian ^a   Wenk, Carola ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b University of Arizona   (United States)

Author keywords

Computational geometry; Fr chet; Hausdorff; Planar curves

Indexed keywords

EUCLIDEAN DISTANCE; FRÉCHET DISTANCE; HAUSDORFF DISTANCE; PLANAR CURVES;

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; COMPUTER GRAPHICS; COMPUTER VISION; SET THEORY;

ALGORITHMS;

EID: 21144453588     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-003-1042-5     Document Type: Article

References (15)

1. P. K. Agarwal, R. Klein, C. Knauer, and M. Sharir. Computing the detour of polygonal curves. Technical Report B 02-03, Fachbereich Mathematik und Informatik, Freie Universität Berlin, 2002.
2. O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. Discrete Appl. Math., 109:3-24, 2001.
3. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. Ann. Math. Artif. Intell., 13:251-266, 1995.
4. [4| H. Alt, J. Blömer, M. Godau, and H. Wagener. Approximation of convex polygons. In Proceedings of the 17th International Colloquium on Automata, Languages, and Programming, volume 443 of Lecture Notes in Computer Science, pages 703-716. Springer-Verlag, Berlin, 1990.
5. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl. 5:75-91, 1995.
6. H. Alt, C. Knauer, and C. Wenk. Bounding the Frechet distance by the Hausdorff distance (extended abstract). In Proceedings of she Seventeenth European Workshop on Computational Geometry, Berlin, Germany, pages 166-169, 2001.
7. F. Aurenhammer. Improved algorithms for discs and balls using power diagrams. J. Algorithms, 9:151-161, 1988.
8. B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and J. Snoeyink. Computing a face in an arrangement of line segments and related problems. SIAM J. Comput., 22:1286-1302, 1993.
9. M. Godau. On the complexity of measuring the similarity between geometric objects in higher dimensions. Ph.D. thesis, Department of Computer Science, Freie Universität Berlin, 1999.
10. L. J. Guibas, M. Sharir, and S. Sifrony. On the general motion planning problem with two degrees of freedom. Discrete Comput. Geom., 4:491-521, 1989.
11. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59-71, 1986.
12. J. Pach and M. Sharir. On the boundary of the union of planar convex sets. Discrete Comput. Geom., 21:321-328, 1999.
13. G. Rote. Curves with increasing chords. Math. Proc. Cambridge Philos. Soc., 115:1-12, 1994.
14. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
15. R. van Oostrum and R. C. Veltkamp. Parametric search made practical. In Proceedings of the Eighteenth Annual Symposium on Computational Geometry, pages 1-9. ACM Press, New York, 2002.