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.