Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022-Reference-Cited by-同舟云学术

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

Published:2023-08-11 Issue: Volume:28 Page:1-13
ISSN:1084-6654
Container-title:ACM Journal of Experimental Algorithmics
language:en
Short-container-title:ACM J. Exp. Algorithmics

Author:

Fekete Sándor P.¹^ORCID,Keldenich Phillip¹^ORCID,Krupke Dominik¹^ORCID,Schirra Stefan²^ORCID

Affiliation:

1. Department of Computer Science, TU Braunschweig, Germany

2. Department for Simulation and Graphics, OvGU Magdeburg, Germany

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.

Funder

DFG project “Computational Geometry: Solving Hard Optimization Problems”

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3604907

Reference42 articles.

1. Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, and Alexandra Weinberger. 2020. Plane spanning trees in edge-colored simple drawings of \(K_{n}\) . In International Symposium on Graph Drawing and Network Visualization (GD’20). 482–489.

2. A graph coloring heuristic using partial solutions and a reactive tabu scheme

3. New methods to color the vertices of a graph

4. Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring;Crombez Loïc;J. Experim. Algor.,2023

5. Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard, and Aldo Gonzalez-Lorenzo. 2022. Shadoks approach to minimum partition into plane subgraphs. In Symposium on Computational Geometry (SoCG’22). 71:1–71:8.