3 papers
cs.CG2022
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours
Sándor P. Fekete, Dominik Krupke, Michael Perk +2
For a given polygonal region , the Lawn Mowing Problem (LMP) asks for a shortest tour that gets within Euclidean distance 1 of every point in ; this is equivalent to comp…
cs.CG2018
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading
Sándor P. Fekete, Sven von Höveling, Joseph S. B. Mitchell +4
We consider dynamic loading and unloading problems for heavy geometric objects. The challenge is to maintain balanced configurations at all times: minimize the maximal motion of th…
cs.DS2017
Tilt Assembly: Algorithms for Micro-Factories That Build Objects with Uniform External Forces
Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich +4
We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of prog…