Vigneron, Antoine E.
KAUST DepartmentVisual Computing Center (VCC)
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Geometric Algorithms Group
Preprint Posting Date2012-09-10
Online Publication Date2013-09-19
Print Publication Date2014-10
Permanent link to this recordhttp://hdl.handle.net/10754/562979
MetadataShow full item record
AbstractGiven a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya's problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal Θ(nlogn)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of every rotated copy of G. © 2013 Springer Science+Business Media New York.
SponsorsH.-K.A. was supported by NRF grant 2011-0030044 (SRC-GAIA) funded by the government of Korea. J.G. is the recipient of an Australian Research Council Future Fellowship (project number FT100100755). S.W. Bae was supported by NRF grant (NRF-2013R1A1A1A05006927) funded by the government of Korea. O.C. was supported in part by NRF grant 2011-0030044 (SRC-GAIA), and in part by NRF grant 2011-0016434, both funded by the government of Korea.