2 citations · 3 across the 7 of their papers we have counts for
7 papers · 1 filter
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…
Worst-Case Optimal Covering of Rectangles by Disks
Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich +2
We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any $λ\geq…
Connected Assembly and Reconfiguration by Finite Automata
Sándor P. Fekete, Eike Niehs, Christian Scheffer +1
We consider methods for connected reconfigurations by finite automate in the so-called \emph{hybrid} or \emph{Robot-on-Tiles} model of programmable matter, in which a number of sim…
Packing Disks into Disks with Optimal Worst-Case Density
Sándor P. Fekete, Phillip Keldenich, Christian Scheffer
We provide a tight result for a fundamental problem arising from packing disks into a circular container: The critical density of packing disks in a disk is 0.5. This implies that…
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…
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich +2
We present a number of breakthroughs for coordinated motion planning, in which the objective is to reconfigure a swarm of labeled convex objects by a combination of parallel, conti…