research
∙
07/03/2023
The Lawn Mowing Problem: From Algebra to Algorithms
For a given polygonal region P, the Lawn Mowing Problem (LMP) asks for a...
share
research
∙
03/13/2023
Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023
We give an overview of the 2023 Computational Geometry Challenge targeti...
research
∙
11/16/2022
Cooperative 2D Reconfiguration using Spatio-Temporal Planning and Load Transferring
We present progress on the problem of reconfiguring a 2D arrangement of ...
research
∙
11/10/2022
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours
For a given polygonal region P, the Lawn Mowing Problem (LMP) asks for a...
research
∙
09/22/2022
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
When considering motion planning for a swarm of n labeled robots, we nee...
research
∙
03/14/2022
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022
We give an overview of the 2022 Computational Geometry Challenge targeti...
research
∙
11/14/2021
Area-Optimal Simple Polygonalizations: The CG Challenge 2019
We give an overview of theoretical and practical aspects of finding a si...
research
∙
11/09/2021
Computing Area-Optimal Simple Polygonizations
We consider methods for finding a simple polygon of minimum (Min-Area) o...
research
∙
09/25/2021
Connected Coordinated Motion Planning with Bounded Stretch
We consider the problem of coordinated motion planning for a swarm of si...
research
∙
03/29/2021
Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021
We give an overview of the 2021 Computational Geometry Challenge, which ...
research
∙
03/26/2021
Minimum Scan Cover and Variants – Theory and Experiments
We consider a spectrum of geometric optimization problems motivated by c...
research
∙
03/12/2021
Packing Squares into a Disk with Optimal Worst-Case Density
We provide a tight result for a fundamental problem arising from packing...
research
∙
11/26/2020
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game
We study competitive location problems in a continuous setting, in which...
research
∙
04/08/2020
Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
We give an overview of the 2020 Computational Geometry Challenge, which ...
research
∙
04/07/2020
Probing a Set of Trajectories to Maximize Captured Information
We study a trajectory analysis problem we call the Trajectory Capture Pr...
research
∙
03/19/2020
Minimum Scan Cover with Angular Transition Costs
We provide a comprehensive study of a natural geometric optimization pro...
research
∙
03/18/2020
Worst-Case Optimal Covering of Rectangles by Disks
We provide the solution for a fundamental problem of geometric optimizat...
research
∙
10/22/2019
Folding Polyominoes with Holes into a Cube
When can a polyomino piece of paper be folded into a unit cube? Prior wo...
research
∙
10/08/2019
Parallel Online Algorithms for the Bin Packing Problem
We study parallel online algorithms: For some fixed integer k, a colle...
research
∙
09/09/2019
Connected Assembly and Reconfiguration by Finite Automata
We consider methods for connected reconfigurations by finite automate in...
research
∙
05/02/2019
Online Circle Packing
We consider the online problem of packing circles into a square containe...
research
∙
03/19/2019
Packing Disks into Disks with Optimal Worst-Case Density
We provide a tight result for a fundamental problem arising from packing...
research
∙
10/15/2018
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata
We contribute results for a set of fundamental problems in the context o...
research
∙
08/13/2018
Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation
We investigate a variety of problems of finding tours and cycle covers w...
research
∙
07/04/2018
Efficient Parallel Self-Assembly Under Uniform Control Inputs
We prove that by successively combining subassemblies, we can achieve su...
research
∙
01/05/2018
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
We present a number of breakthroughs for coordinated motion planning, in...
research
∙
12/26/2017
Folding Polyominoes into (Poly)Cubes
We study the problem of folding a polyomino P into a polycube Q, allowin...
research
∙
12/18/2017
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading
We consider dynamic loading and unloading problems for heavy geometric o...
research
∙
12/04/2017
Particle Computation: Complexity, Algorithms, and Logic
We investigate algorithmic control of a large swarm of mobile particles ...
research
∙
09/19/2017
Tilt Assembly: Algorithms for Micro-Factories That Build Objects with Uniform External Forces
We present algorithmic results for the parallel assembly of many micro-s...
research
∙
09/12/2017
Conflict-Free Coloring of Intersection Graphs
A conflict-free k-coloring of a graph G=(V,E) assigns one of k different...
research
∙
10/21/2010
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib
In this work we present a protocol for self-synchronized duty-cycling in...
research
∙
04/10/2002