Computing the Maximum Overlap of Two Convex Polygons Under Translations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1996

Computing the Maximum Overlap of Two Convex Polygons Under Translations

Olivier Devillers
Marc Van Kreveld
  • Function : Author
Otfried Schwarzkopf
  • Function : Author
Monique Teillaud

Abstract

Let $P$ be a convex polygon in the plane with $n$ vertices and let $Q$ be a convex polygon with $m$ vertices. We prove that the maximum number of combinatorially distinct placements of $Q$ with respect to $P$ under translations is $O(n^2+m^2+\min(nm^2+n^2m))$, and we give an example showing that this bound is tight in the worst case. Second, we present an $O((n+m)\log(n+m))$ algorithm for determining a translation of $Q$ that maximizes the area of overlap of $P$ and $Q$. We also prove that the position which translates the centroid of $Q$ on the centroid of $P$ always realizes an overlap of 9/25 of the maximum overlap and that this overlap may be as small as 4/9 of the maximum.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2832.pdf (334.37 Ko) Télécharger le fichier

Dates and versions

inria-00073859 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073859 , version 1

Cite

Mark De Berg, Olivier Devillers, Marc Van Kreveld, Otfried Schwarzkopf, Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. RR-2832, INRIA. 1996. ⟨inria-00073859⟩
90 View
1344 Download

Share

Gmail Facebook X LinkedIn More