Skip to main content
Log in

Matching Convex Shapes with Respect to the Symmetric Difference

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

This paper deals with questions from convex geometry related to shape matching. In particular, we consider the problem of moving one convex figure over another, minimizing the area of their symmetric difference. We show that if we just let the two centers of gravity coincide, the resulting symmetric difference is within a factor of 11/3 of the optimum. This leads to efficient approximate matching algorithms for convex figures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 1996; revised March 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alt, H., Fuchs, U., Rote, G. et al. Matching Convex Shapes with Respect to the Symmetric Difference . Algorithmica 21, 89–103 (1998). https://doi.org/10.1007/PL00009210

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009210

Navigation