Maximizing the overlap of two planar convex sets under rigid motions (Q871058)

The area of overlap of two planar regions is a natural measure of their similarity that is insensitive to noise [cf. \textit{H. Alt, U. Fuchs, G. Rote} and \textit{G. Weber}, Algorithmica 21, 89--103 (1998; Zbl 0896.68150)]. The authors study here the following general problem. Given compact sets \(P\) and \(Q\) in the plane, to find a mapping \(\phi\) such that the area common to the image of \(P\) under \(\phi\) and \(Q\) is maximized. Observing that most of the theoretical works on the problem deal with \(\phi\) as translation, the authors study the problem when \(\phi\) is a rigid motion [cf. \textit{H.-K. Ahn, P. Brass, O. Cheong, H.-S. Na, C.-S. Shin} and \textit{A. Vigneron}, Comput. Geom. 33, 152--164 (2006; Zbl 1137.68608)].