Matching convex shapes with respect to the symmetric difference

Algorithmica (New York)

Volumn 21, Issue 1, 1998, Pages 89-103

  Alt, H ^a   Fuchs, U ^a   Rote, G ^b   Weber, G ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Centroid; Computational geometry; Convex geometry; Shape matching

Indexed keywords

EID: 0005165178     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009210     Document Type: Article

References (14)

1. H. Alt, O. Aichholzer, and G. Rote. Matching shapes with a reference point. In Proc. 10th Ann. Symp. Comput. Geom., pp. 85-92, 1994.
2. Final version in Internat. J. Comput. Geom. Appl. 7 (1997), 349-363.
3. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. In Proc. 7th Ann. Symp. Comput. Geom., pp. 186-193, 1991.
4. H. Alt, J. Blömer, M. Godau, and H. Wagener. Approximation of convex polygons. In Proc. 17th Internat. Colloq. Automata Lang. Program., Lecture Notes in Computer Science, Vol. 443, pp. 703-716. Springer-Verlag, Berlin, 1990.
5. D. Avis, P. Bose, T. Shermer, J. Snoeyink, G. Toussaint, and B. Zhu. On the sectional area of convex polytopes. In Proc. 12th Ann. Symp. Comput. Geom., pp. C11-C12, 1996.
6. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. In: J. Díaz and M. Serna (eds.), Algorithms - ESA '96, Proc. Fourth Annual European Symposium on Algorithms, Barcelona, September 25-27, 1996. Lecture Notes in Computer Science, Vol. 1136, pp. 320-333. Springer-Verlag, Berlin, 1996.
7. P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. J. Algorithms 17 (1994), 292-318.
8. M. de Berg, O. Devillers, M. van Kreveld, O. Schwarzkopf, and M. Teillaud. Computing the maximum overlap of two convex polygons under translations. In Proc. 7th Internat. Symp. Algorithms and Computation (ISAAC '96), Lecture Notes in Computer Science, Vol. 1178, pp. 126-135, Springer-Verlag, Berlin, 1996.
9. T. Bonnesen and W. Fenchel. Theorie der konvexen Körper. Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 3. Springer-Verlag, Berlin, 1933; repr. Chelsea, New York, 1948, 1971.
10. 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., pp. 151-156, Waterloo, 1993.
11. P.M. Gruber. Approximation of convex bodies. In: P. M. Gruber and J. M. Wills (eds.), Convexity and its Applications. Birkhäuser, Basel, 1983, pp. 131-162.
12. P. M. Gruber. Aspects of approximation of convex bodies. In: P. M. Gruber and J. M. Wills (eds.), Handbook of Convex Geometry, Vol. A, Chapter 1.10. North-Holland, Amsterdam, 1993, pp. 319-345.
13. D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9 (1993), 267-291.
14. A. Schönhage. The fundamental theorem of algebra in terms of computational complexity. Technical Report, University of Tübingen, 1982.