14 citations · 25 across the 13 of their papers we have counts for
22 papers
The Lawn Mowing Problem: From Algebra to Algorithms
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/2 of every point in ; this is equivalent to co…
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…
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
Sándor P. Fekete, Peter Kramer, Christian Rieck +2
When considering motion planning for a swarm of labeled robots, we need to rearrange a given start configuration into a desired target configuration via a sequence of parallel,…
The Dispersive Art Gallery Problem
Christian Rieck, Christian Scheffer
We introduce a new variant of the art gallery problem that comes from safety issues. In this variant we are not interested in guard sets of smallest cardinality, but in guard sets…
Connected Coordinated Motion Planning with Bounded Stretch
Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld +2
We consider the problem of connected coordinated motion planning for a large collective of simple, identical robots: From a given start grid configuration of robots, we need to rea…
Particle-Based Assembly Using Precise Global Control
Jakob Keller, Christian Rieck, Christian Scheffer +1
In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each…