Shadoks Approach to Minimum Partition into Plane Subgraphs
Résumé
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.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|---|
| Licence |
