Abstract
This paper deals with questions from convex geometry related to shape matching. In particular, we consider the problem of matching convex figures minimizing the area of the symmetric difference. The main theorem of this paper states, that if we just match the two centers of gravity the resulting symmetric difference is within a factor of 11/3 from the optimal one. This leads to efficient approximate matching algorithms for convex figures.
This research was supported by grant No. Al 253/4-1 from Deutsche Forschungsgemeinschaft DFG (German Research Association).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Alt, O. Aichholzer, and G. Rote. Matching shapes with a reference point. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 85–92, 1994. To appear in Int. J. Comput. Geom. Appl.
H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 186–193, 1991.
H. Alt, J. Blömer, 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.
P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. J. Algorithms, 17:292–318, 1994.
T. Bonnesen and W.Fenchel. Theorie der konvexen Körper, volume 3 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Chelsea Publ. Comp., 1948.
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.
M. de Berg, O. Devillers, M. van Kreveld, O. Schwarzkopf, and M. Teillaud. Computing the maximum overlap of two convex polygons under translations. Technical Report, Dept. of Comp. Science, Univ. of Utrecht, 1996.
D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267–291, 1993.
A. Schönhage. The fundamental theorem of algebra in terms of computational complexity. Technical Report, University of Tübingen, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alt, H., Fuchs, U., Rote, G., Weber, G. (1996). Matching convex shapes with respect to the symmetric difference. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_65
Download citation
DOI: https://doi.org/10.1007/3-540-61680-2_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61680-1
Online ISBN: 978-3-540-70667-0
eBook Packages: Springer Book Archive