Sweeping an oval to a vanishing point

Given a convex region in the plane, and a sweep-line as a tool, what is the best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweeps was first studied in [2]. Here we consider the following slanted variant of sweeping recently introduced in  [1]: in a single sweep, the sweep-line is placed at a start position somewhere in the plane, then moved continuously according to a sweep vector v→ (not necessarily orthogonal to the sweep-line) to another parallel end position, and then lifted from the plane. The cost of a sequence of sweeps is the sum of the lengths of the sweep vectors. The optimal sweeping cost of a region is the infimum of the costs over all finite sweeping sequences for that region. An optimal sweeping sequence for a region is one with a minimum total cost, if it exists. Another parameter of interest is the number of sweeps.We show that there exist convex regions for which the optimal sweeping cost cannot be attained by two sweeps. This disproves a conjecture of Bousany, Karker, O’Rourke, and Sparaco stating that two sweeps (with vectors along the two adjacent sides of a minimum-perimeter enclosing parallelogram) always suffice [1]. Moreover, we conjecture that for some convex regions, no finite sweeping sequence is optimal. On the other hand, we show that both the 2-sweep algorithm based on the minimum-perimeter enclosing rectangle and the 2-sweep algorithm based on the minimum-perimeter enclosing parallelogram achieve a 4/π≈1.274/π≈1.27 approximation of the optimal sweeping cost in this model.

► We study the problem of sweeping a convex region in the plane to a single point.
► Our result disproves a conjecture of Bousany, Karker, O’Rourke, and Sparaco.
► A 2-sweep algorithm achieves a constant approximation for any convex region.
► But there exist convex regions for which two sweeps cannot attain the optimal cost.