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

TL;DR

This paper overviews the 2022 CG:SHOP Challenge focused on partitioning line segments into the fewest non-crossing subsets, highlighting recent computational geometry approaches to this complex problem.

Contribution

It presents an overview of the challenge, showcasing new algorithms and methods developed for minimum partitioning into plane subgraphs.

Findings

New algorithms for partitioning line segments into non-crossing subsets

Benchmark results demonstrating effectiveness of proposed methods

Insights into computational complexity of the problem

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.