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.
Cite
CITATION STYLE
Alt, H., Fuchs, U., Rote, G., & Weber, G. (1996). Matching convex shapes with respect to the symmetric difference. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1136, pp. 320–333). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
