Approximate matching of polygonal shapes

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 1991, Pages 186-193

  Alt, Helmut ^a   Behrends, Bernd ^a   Blömer, Johannes ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE DETECTION; OPTIMAL SYSTEMS;

APPROXIMATE MATCHING; CONSTANT FACTORS; CONVEX HULL; HAUSDORFF DISTANCE; OPTIMAL SOLUTIONS; POLYGONAL SHAPES; RIGID MOTIONS; SIMPLE POLYGON;

COMPUTATIONAL GEOMETRY;

EID: 84856459496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/109648.109669     Document Type: Conference Paper

References (14)

1. H. Alt, J. Blörner, M. Godau, H. Wagener, "Approximations of Convex Polygons", Proc. 17th ICALP, LNCS 443, 1990, pp. 703-716.
2. E. M. Arkin, K. Kedem, J. S. B. Mitchell, J. Sprinzak, M. Werman, "Matching Points into Noise Regions: Combinatorial Bounds and Algorithms", Proc. 2nd Annual acm-siam Symposium on Discrete Algorithms, 1991, pp. 42-51.
3. H. Alt, K. Mehlhorn, H. Wagener, E. Welzl, "Congruence, Similarity and Symmetries of Geometric Objects", Discrete Comp. Geom. 3, 1988, pp. 237-256.
4. P. K. Agarwal, M. Sharir, P. Shor, "Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences", J. Combin. Theory, Ser. A 52, 1989, pp. 228-274.
5. M. J. Atallah, "A Linear Time Algorithm for the HausdorfF-distance between Convex Polygons", Information Processing Letters 17, 1983, pp. 207-209.
6. M. Atallah, "Dynamic Computational Geometry", Proc. 24th Annual Symp. on Foundations of Computer Science, 1983, pp. 92-99
7. also in Comp. Math. Appl. 11, 1985, pp. 1171-1181.
8. H. Edelsbrunner, J. Pach, J. T. Schwartz, M. Sharir, "On the Lower Envelope of Bivariate Functions and its Applications", Proc. 28th Annual Symp. on Foundations of Computer Science, 1987, pp. 27-37.
9. S. Fortune, "A Sweepline - Algorithm for Voronoi-Diagrams", Algorithmica 2, 1987, pp. 153-174.
10. M. Godau, "A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms", Proc. 8th STACS, LNCS480, 1991, pp. 127-126.
11. D. P. Huttenlocher, K. Kedem, "Computing the Minimum Hausdorff Distance for Point Sets under Translation", Proc. 6th Annual Symp. on Computational Geometrie, 1990, pp. 340-349.
12. G. E. Martin, Transformation Geometry, Springer-Verlag, New York, Heidelberg, Berlin, 1982.
13. S. Schirra, "Über die Bitkomplexitat der e-Kongruenz", Diplomarbeit, Fachbereich Informatik, Universität des Saarlandes, 1988.
14. C. K. Yap, "An O (nlogn) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments", Discrete Comp. Geom. 2, 1987, pp. 365-393.