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 opti
mum. This leads to efficient approximate matching algorithms for conve
x figures.