Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vectors. We characterize the optimal 2-sweeps of triangles, and provide a linear-time algorithm for convex polygons.
© the authors
Bousany, Yonit; Karker, Mary Leah; O'Rourke, Joseph; and Sparaco, Leona, "Sweeping Minimum Perimeter Enclosing Parallelograms: Optimal Crumb Cleanup" (2010). Computer Science: Faculty Publications, Smith College, Northampton, MA.