Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup

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.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, Leona Sparaco
• Keywords: CCCG 2010, Computational Geometry, Infinite Line, Parallel Sweeps, Planar Region