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/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
∙
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
∙
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
∙
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
∙
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
∙
09/19/2017