Matching polygonal curves with respect to the fréchet distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 63-74

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

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithm; Computational geometry; Fr chet distance; Parametric search; Reference point; Shape matching; Steiner point

Indexed keywords

COMPUTATIONAL GEOMETRY;

APPROXIMATE SOLUTION; HAUSDORFF DISTANCE; MATCHING PROBLEMS; PARAMETRIC SEARCH; POLYGONAL CURVE; REFERENCE POINTS; SHAPE MATCHING; STEINER POINTS;

APPROXIMATION ALGORITHMS;

EID: 84957054206     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_6     Document Type: Conference Paper

References (10)

1. O. Aichholzer, H. Alt, and G. Rote. Matching shapes with a reference point. Internat. J. Comput. Geom. Appl., 7:349-363, 1997.
2. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. Ann. Math. Artif. Intell., 13:251-266, 1995.
3. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. Algorithmica, 21:89-103, 1998.
4. H. Alt and M. Godau. Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl., 5:75-91, 1995.
5. H. Alt and L. J. 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, 2000.
6. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM, 34(1):200-208, 1987.
7. A. Efrat, P. Indyk, and S. Venkatasubramanian. Pattern matching for sets of segments, September 2000. Manuscript, accepted to the 12th Symposium on Discrete Algorithms, 2001.
8. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM, 30(4):852-865, 1983.
9. S. Schirra. Über die Bitkomplexität der ɛ-Kongruenz. Master's thesis, Fachbereich Informatik, Universität des Saarlandes, 1988.
10. S. Venkatasubramanian. Geometric Shape Matching and Drug Design. PhD thesis, Department of Computer Science, Stanford University, August 1999.