Matching convex shapes with respect to the symmetric difference

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

Volumn 1136, Issue , 1996, Pages 320-333

  Alt, Helmut ^a   Fuchs, Ulrich ^a   Rote, Günter ^b   Weber, Gerald ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

APPROXIMATE MATCHING; CONVEX GEOMETRY; CONVEX SHAPES; SHAPE MATCHING; SYMMETRIC DIFFERENCE;

GEOMETRY;

EID: 84958041885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_65     Document Type: Conference Paper

References (9)

1. H. Alt, O. Aichholzex, and G. Rote. Matching shapes with a reference point. In Proc. lOth Annu. ACM Syrnpos. Comput. Geom., pages 85-92, 1994. To appear in Int. J. Comput. Geom. Appl.
2. H. Alt, B. Behrends, and J. Blbmer. Approximate matching of polygonal shapes. In Proc. 7th Annu. ACM Sympos. Comput Geom., pages 186-193, 1991.
3. H. Alt, J. B15mer, M. Godau, and H. Wagener. Approximation of convex polygons. In Proc. 17th Internat. Colloq. Automata Lang. Program., volume 443 of Lecture Notes in Computer Science, pages 703-716. Springer-Verlag, 1990.
4. P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. J. Algorithms, 17:292-318, 1994.
5. T. Bonnesen and W. Fenchel. Theorie der konvexen Körper, volume 3 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Chelsea Publ. Comp., 1948.
6. L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion. In Proc. 5th Canad. Conf. Comput. Geom., pages 151-156, Waterloo, Canada, 1993.
7. M. de Berg, O. Devillers, M. van Kreveld, O. Schwarzkopf, and M. Teilland. Computing the maximum overlap of two convex polygons under translations. Technical Report, Dept. of Comp. Science, Univ. of Utrecht, 1996.
8. D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267-291, 1993.
9. A. SchSnhage. The fundamental theorem of algebra in terms of computational complexity. Technical Report, University of Tübingen, 1982.