Polygon Containment under Translation

Given two simple polygons $P$ and $Q$ in the plane with $n$ and $m = O(n)$ edges, respectively, is there a translation of $P$ that makes it contained in $Q$

Parameters

$n$ : number of edges in $P$
$m$ : number of edges in $Q$ ; $m = O(n)$

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

			See more
Segments Containing Points	Polygon Containment under Translation	2001

Other relevant algorithms