Computational Geometry:
Solving Hard Optimization Problems
Geometric Optimization Challenges
We host optimization challenges for computational geometry problems. The challenges are part of CG Week.
News
12:54 p.m.
The official ranking for the 2023 challenge is now public! The two top teams have been invited to present their approaches on this year's CG Week. Thanks to all participants and we hope you enjoyed this year's challenge and will join the next one, too!
10:57 a.m.
With ~24 hours to go (27th, AoE), please note that the rank is only final, after we evaluated all submissions. If you encounter any problems with your upload, please just mail us a hash of it and then forward us the submission via some link. We will then add it …
5:42 p.m.
We have slightly changed the instance set. Please make sure you download a new version of the instance ZIP archive!
Past Competitions
CG:SHOP 2023
Organized by: Sándor Fekete , Phillip Keldenich , Dominik Krupke , Stefan Schirra
The Fifth Geometric Optimization Challenge is part of CG Week 2023.
Review the problem description for more details.CG:SHOP 2022
Organized by: Sándor Fekete , Phillip Keldenich , Dominik Krupke , Stefan Schirra
The Fourth Geometric Optimization Challenge is part of CG Week in Berlin, Germany, June 6-10, 2022. The task is to solve the Minimum Partition into Plane Subgraphs Problem.
Review the problem description for more details.CG:SHOP 2021
Organized by: Sándor Fekete , Phillip Keldenich , Dominik Krupke , Joseph S. B. Mitchell
Third CG:SHOP competition as part of CG Week 2021. The problem is to compute a set of collision-free parallel motions for unit-square robots on a pixel grid.
Review the problem description for more details.CG:SHOP 2020
Organized by: Erik Demaine , Sándor Fekete , Phillip Keldenich , Dominik Krupke , Joseph S. B. Mitchell
The Second Geometric Optimization Challenge is part of CG Week in Zurich, Switzerland, June 22-26, 2020. The task is to solve the Minimum Convex Partition Problem, which asks for a set of edges connecting a given set of points which partitions the convex hull of the points into the minimum number of convex regions.
Review the problem description for more details.CG:SHOP 2019
Organized by: Erik Demaine , Sándor Fekete , Joseph S. B. Mitchell
First CG:SHOP competition as part of a workshop at CG Week 2019. The problem was to compute polygons with minimal or maximal area for a given point set.
Review the problem description for more details.