Carleton University
Technical Report TR-37
January 1984
Geometric Containment is Not Reducible to Pareto Dominance
N. Santoro, J.B. Sidney, S.J. Sidney, J. Urrutia
Abstract
Given a family F of closed curves in the plane (e.g., polygons), the containment problem for F is the problem of determining for all A, Be F whether A can be contained in B; that is whether there exists a rotation and translation which will move A in the plane so that A and its interior lies within B.