Shadoks Approach to Minimum Partition into Plane Subgraphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

Shadoks Approach to Minimum Partition into Plane Subgraphs

Abstract

We explain the heuristics used by the Shadoks team to win first place in the CG:SHOP 2022 challenge that considers the minimum partition into plane subgraphs. The goal is to partition a set of segments into as few subsets as possible such that segments in the same subset do not cross each other. The challenge has given 225 instances containing between 2500 and 75000 segments. For every instance, our solution was the best among all 32 participating teams.
Fichier principal
Vignette du fichier
CGSHOP22.pdf (632.34 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Licence : CC BY NC - Attribution - NonCommercial

Dates and versions

hal-04072887 , version 1 (18-04-2023)

Identifiers

Cite

Loïc Crombez, Guilherme D da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo. Shadoks Approach to Minimum Partition into Plane Subgraphs. 38th International Symposium on Computational Geometry (SoCG 2022), Freie Universität Berlin, Jun 2022, Berlin (Freie Universität), Germany. ⟨10.4230/LIPIcs.SoCG.2022.71⟩. ⟨hal-04072887⟩
1 View
1 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More