Approximating the Maximum Overlap of Polygons under Translation

Sariel Har-Peled, Subhro Roy

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\epsilon )$-approxim…