Aligning Two Convex Figures to Minimize Area or Perimeter
Given two compact convex sets P and Q in the plane, we consider the problem of finding a placementϕ P of P that minimizes the convex hull ofϕ P∪ Q. We study eight versions of the problem: we consider minimizing either the area or the perimeter of the convex hull; we either allowϕ P and Q to intersec...
|Published in:||Algorithmica : an international journal in computer science, Vol. 62, No. 1/2 (2012), p. 464-479|
|Other Involved Persons:|
|Item Description:||H.-K. Ahn was supported by the National Research Foundation of Korea Grant funded by the Korean Government (MEST) (NRF-2009-0067195). O. Cheong was supported by Mid-career Researcher Program through NRF grant funded by the MEST (No. R01-2008-000-11607-0).|
|QR Code:||Show QR Code|
Algorithmica : an international journal in computer science, Vol. 62, No. 1/2 (2012), p. 464-479