CG:SHOP Challenges Bibliography

Challenge 2024

• Maximum Polygon Packing: The CG:SHOP Challenge 2024
  Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra.
  arXiv preprint, 2024.
  Read more on arXiv
• Shadoks Approach to Knapsack Polygonal Packing
  Guilherme Dias da Fonseca, Yan Gerard.
  Symp. Comp. Geom. (SoCG), 83: 1-9, 2024.
  Read more
• A General Heuristic Approach for Maximum Polygon Packing
  Canhui Luo, Zhouxing Su, Zhipeng Lü.
  Symp. Comp. Geom. (SoCG), 84: 1-9, 2024.
  Read more
• Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid
  Martin Held.
  Symp. Comp. Geom. (SoCG), 85: 1-6, 2024.
  Read more
• Computing Maximum Polygonal Packings in Convex Polygons using Best-Fit, Genetic Algorithms and ILPs
  Alkan Atak, Kevin Buchin, Mart Hagedoorn, Jona Heinrichs, Karsten Hogreve, Guangping Li, Patrick Pawelczyk.
  Symp. Comp. Geom. (SoCG), 86: 1-9, 2024.
  Read more
• Shadoks Approach to Knapsack Polygonal Packing
  Guilherme Dias da Fonseca, Yan Gerard.
  Comput. Geom. Top., 2025+.
  Invited to special issue: CG:SHOP Challenge 2024.
• A General Heuristic Approach for Maximum Polygon Packing
  Canhui Luo, Zhouxing Su, Zhipeng Lü.
  Comput. Geom. Top., 2025+.
  Invited to special issue: CG:SHOP Challenge 2024.
• Priority-Driven Nesting of Irregular Polygonal Shapes Within a Convex Polygonal Container Based on a Hierarchical Integer Grid
  Martin Held.
  Comput. Geom. Top., 2025+.
  Invited to special issue: CG:SHOP Challenge 2024.
• Computing Maximum Polygonal Packings in Convex Polygons using Best-Fit, Genetic Algorithms and ILPs
  Alkan Atak, Kevin Buchin, Mart Hagedoorn, Jona Heinrichs, Karsten Hogreve, Guangping Li, Patrick Pawelczyk.
  Comput. Geom. Top., 2025+.
  Invited to special issue: CG:SHOP Challenge 2024.
• Maximum Polygon Packing: The CG:SHOP Challenge 2024
  Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra.
  Comput. Geom. Top., 2025+.
  Invited to special issue: CG:SHOP Challenge 2024.

Challenge 2023

• Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023
  Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra.
  arXiv preprint, 2023.
  Read more on arXiv
• Shadoks Approach to Convex Covering
  Guilherme Dias da Fonseca.
  Symp. Comp. Geom. (SoCG), 67: 1-9, 2023.
  Read more
• Constructing Concise Convex Covers via Clique Covers
  Mikkel Abrahamsen, William Bille Meyling, André Nusser.
  Symp. Comp. Geom. (SoCG), 66: 1-9, 2023.
  Read more
• Shadoks Approach to Convex Covering
  Guilherme Dias da Fonseca.
  Comput. Geom. Top., 2025+.
  Invited to special issue: CG:SHOP Challenge 2023.
• Constructing Concise Convex Covers via Clique Covers
  Mikkel Abrahamsen, William Bille Meyling, André Nusser.
  Comput. Geom. Top., 2025+.
  Invited to special issue: CG:SHOP Challenge 2023.
• Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023
  Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra.
  Comput. Geom. Top., 2025+.
  Invited to special issue: CG:SHOP Challenge 2023.

Challenge 2022

• Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022
  Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra.
  J. Exp. Alg., 28(1.9): 1-13, 2022.
  Read more
• Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
  Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng.
  J. Exp. Alg., 28(1.2): 1-13, 2023.
  Read more
• SAT-boosted Tabu Search for Coloring Massive Graphs
  André Schidler, Stefan Szeider.
  J. Exp. Alg., 28(1.5): 1-19, 2023.
  Read more
• Shadoks Approach to Minimum Partition into Plane Subgraphs
  Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo.
  Symp. Comp. Geom. (SoCG), 71: 1-8, 2022.
  Read more
• Conflict-Based Local Search for Minimum Partition into Plane Subgraphs
  Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng.
  Symp. Comp. Geom. (SoCG), 72: 1-6, 2022.
  Read more
• Local Search with Weighting Schemes for the CG:SHOP 2022 Competition
  Florian Fontan, Pascal Lafourcade, Luc Libralesso, Benjamin Momège.
  Symp. Comp. Geom. (SoCG), 73: 1-6, 2022.
  Read more
• SAT-Based Local Search for Plane Subgraph Partitions
  André Schidler.
  Symp. Comp. Geom. (SoCG), 74: 1-8, 2022.
  Read more

Challenge 2021

• Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021
  Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell.
  J. Exp. Alg., 27(3.1): 1-12, 2022.
  Read more
• Shadoks Approach to Low-Makespan Coordinated Motion Planning
  Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso.
  J. Exp. Alg., 27(3.2): 1-17, 2022.
  Read more
• Coordinated Motion Planning Through Randomized k-Opt
  Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng.
  J. Exp. Alg., 27(3.4): 1-9, 2022.
  Read more
• Coordinated Path Planning through Local Search and Simulated Annealing
  Hyeyun Yang, Antoine Vigneron.
  J. Exp. Alg., 27(3.3): 1-14, 2022.
  Read more
• Shadoks Approach to Low-Makespan Coordinated Motion Planning
  Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso.
  Symp. Comp. Geom. (SoCG), 63: 1-9, 2021.
  Read more
• Coordinated Motion Planning Through Randomized k-Opt
  Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng.
  Symp. Comp. Geom. (SoCG), 64: 1-8, 2021.
  Read more
• A Simulated Annealing Approach to Coordinated Motion Planning
  Hyeyun Yang, Antoine Vigneron.
  Symp. Comp. Geom. (SoCG), 65: 1-9, 2021.
  Read more

Challenge 2020

• Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020
  Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell.
  arXiv preprint, 2020.
  Read more on arXiv
• Computing Low-Cost Convex Partitions for Planar Point Sets
  Da Wei Zheng, Jack Spalding-Jamieson, Brandon Zhang.
  Symp. Comp. Geom. (SoCG), 83: 1-7, 2020.
  Read more
• Computing Low-Cost Convex Partitions for Planar Point Sets
  Laurent Moalic, Dominique Schmitt, Julien Lepagnot, Julien Kritter.
  Symp. Comp. Geom. (SoCG), 84: 1-9, 2020.
  Read more
• Computing Low-Cost Convex Partitions for Planar Point Sets
  Günther Eder, Martin Held, Stefan de Lorenzo, Peter Palfrader.
  Symp. Comp. Geom. (SoCG), 85: 1-11, 2020.
  Read more

Challenge 2019

• Area-Optimal Simple Polygonalizations: The CG Challenge 2019
  Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell.
  J. Exp. Alg., 27(2.4): 1-12, 2022.
  Read more
• Greedy and Local Search Solutions to the Minimum and Maximum Area
  Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard.
  J. Exp. Alg., 27(2.2): 1-11, 2022.
  Read more
• Area-optimal polygonization using simulated annealing
  Nir Goren, Efi Fogel, Dan Halperin.
  J. Exp. Alg., 27(2.3): 1-17, 2022.
  Read more
• 2-Opt moves and flips for area-optimal polygonalizations
  Günther Eder, Martin Held, Steinthor Jasonarson, Philipp Mayer, Peter Palfrader.
  J. Exp. Alg., 27(2.7): 1-12, 2022.
  Read more
• Computing area-optimal simple polygonalization
  Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt.
  J. Exp. Alg., 27(2.6): 1-23, 2022.
  Read more
• Triangle-based Heuristics for area optimal polygonizations
  Natanael Ramos, Rai Caetan de Jesus, Pedro de Rezende, Cid de Souza, Fabio Luiz Usberti.
  J. Exp. Alg., 27(2.1): 1-25, 2022.
  Read more
• Optimal area polygonization by triangulation and ray-tracing
  Julien Lepagnot, Laurent Moalic, Dominique Schmitt.
  J. Exp. Alg., 27: 1-23, 2022.
  Read more