On minimum-area hulls
We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shaped hull problem: Given an n-vertex simple polygon P, find a minimum-area, star-shaped polygon P* containing P. This problem arises in lattice packings of translates of multiple, nonidentical shapes in material layout problems (e.g., in clothing manufacture), and has been recently posed by Daniels and Milenkovic. We consider two versions of the problem: the restricted version, in which the vertices of P* are constrained to be vertices of P, and the unrestricted version, in which the vertices of P* can be anywhere in the plane. We prove that the restricted problem falls in the class of "3SUM-hard" (sometimes called "n(2)-hard") problems, which are suspected to admit no solutions in o(n(2)) time. Further, we give an O(n(2)) time algorithm, improving the previous bound of O(n(5)). We also show that the unrestricted problem can be solved in O(n(2)p(n)) time, where p(n) is the time needed to find the roots of two equations in two unknowns, each a polynomial of degree O (n). We also consider the case in which P* is required to be monotone, with respect to an unspecified direction; we refer to this as the minimum-area monotone hull problem. We give a matching lower and upper bound of O (n log n) time for computing P* in the restricted version, and an upper bound of O (nq(n)) time in the unrestricted version, where q(n) is the time needed to find the roots of two polynomial equations in two unknowns with degrees 2 and O(n).
minimum-area hulls star-shaped polygons 3sum-hardness monotone polygons lower bounds computational geometry design and analysis of algorithms