Open AccessComputer ScienceMathematics
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
tlooto Summary
This article discusses a challenge from 2022 focused on partitioning line segments into non-crossing subsets to achieve minimum partition size.
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.
Citation format
FEKETE, Sándor P., et al. Minimum partition into plane subgraphs: The CG:SHOP challenge 2022 [preprint]. arXiv, 2022. arXiv:2203.07444.