English

Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022

Computational Geometry 2022-03-16 v1 Data Structures and Algorithms
Authors: Sándor P. Fekete , Phillip Keldenich , Dominik Krupke , Stefan Schirra
View on arXiv ↗ PDF ↗

Abstract

We give an overview of the 2022 Computational Geometry Challenge targeting the problem Minimum Partition into Plane Subsets, which consists of partitioning a given set of line segments into a minimum number of non-crossing subsets.

Keywords

computational geometry

Cite

@article{arxiv.2203.07444,
  title  = {Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022},
  author = {Sándor P. Fekete and Phillip Keldenich and Dominik Krupke and Stefan Schirra},
  journal= {arXiv preprint arXiv:2203.07444},
  year   = {2022}
}

Comments

13 pages, 5 figures, 1 table

Related papers

View all related →
Computational Geometry · Computer Science
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 +1
2020-04-10
Computational Geometry · Computer Science
Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
2023-03-14
Computational Geometry · Computer Science
Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
2025-06-19
Computational Geometry · Computer Science
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
Loïc Crombez, Guilherme D. da Fonseca, Florian Fontan, Yan Gerard +7
2023-03-28
Computational Geometry · Computer Science
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
Jack Spalding-Jamieson, Anurag Murty Naredla
2025-07-15
Computational Geometry · Computer Science
Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell
2021-03-30
Computational Geometry · Computer Science
Maximum Polygon Packing: The CG:SHOP Challenge 2024
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
2024-03-26
Optimization and Control · Mathematics
Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques
Mishelle Cordero, Andrés Miniguano-Trujillo, Diego Recalde, Ramiro Torres +1
2024-11-12
Computational Geometry · Computer Science
Splitting Plane Graphs to Outerplanarity
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
2023-01-24
Optimization and Control · Mathematics
A minimal partition problem with trace constraint in the Grushin plane
Valentina Franceschi
2020-12-02
Discrete Mathematics · Computer Science
Matrix Partitions of Split Graphs
Tomás Feder, Pavol Hell, Oren Shklarsky
2013-06-21
Computational Geometry · Computer Science
Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
Oswin Aichholzer, Joseph Dorfer, Sándor P. Fekete, Phillip Keldenich +2
2026-03-20
Computational Geometry · Computer Science
Minimum Perimeter-Sum Partitions in the Plane
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr +1
2021-03-02
Computational Geometry · Computer Science
Solving the Minimum Convex Partition of Point Sets with Integer Programming
Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza
2020-12-08
Data Structures and Algorithms · Computer Science
Approximating Submodular Matroid-Constrained Partitioning
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel P. Szabo
2025-07-03
Data Structures and Algorithms · Computer Science
Minimum-weight partitioning of a set with associated subsets
Yakov Zinder, Bertrand M. T. Lin, Joanna Berlińska
2022-12-13
Computational Geometry · Computer Science
Efficient Segment Folding is Hard
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada +2
2022-01-17
Discrete Mathematics · Computer Science
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
Nour ElHouda Tellache, Roberto Baldacci
2025-01-17
Optimization and Control · Mathematics
Multi-constraint Graph Partitioning Problems Via Recursive Bipartition Algorithm Based on Subspace Minimization Conjugate Gradient Method
Wumwi Sun, Hongwei Liu, Xiaoyu Wang
2025-03-17
Systems and Control · Computer Science
Weak Interactions Based System Partitioning Using Integer Linear Programming
Romain Guicherd, Paul A. Trodden, Andrew R. Mills, Visakan Kadirkamanathan
2017-11-22
Data Structures and Algorithms · Computer Science
Algorithm Engineering for Cut Problems
Alexander Noe
2021-08-11
Computational Geometry · Computer Science
An integer programming formulation using convex polygons for the convex partition problem
Hadrien Cambazard, Nicolas Catusse
2020-12-16
Computational Geometry · Computer Science
Area-Optimal Simple Polygonalizations: The CG Challenge 2019
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke +1
2021-11-16
Data Structures and Algorithms · Computer Science
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
Éric Colin de Verdière
2016-11-24
Optimization and Control · Mathematics
Computing skeletons for rectilinearly-convex obstacles in the rectilinear plane
Marcus Volz, Marcus Brazil, Charl Ras, Doreen Thomas
2020-04-10
R2 v1 2026-06-24T10:13:03.556Z