AI Chat AI Image Generator AI Video Text to Speech

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

03/14/2022

∙

by Sandor P. Fekete, et al.

∙

∙

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.

Sandor P. Fekete
33 publications
Phillip Keldenich
15 publications
Dominik Krupke
12 publications
Stefan Schirra
2 publications

page 7

page 10

page 11

research

∙ 03/13/2023

Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023

We give an overview of the 2023 Computational Geometry Challenge targeti...

0 Sandor P. Fekete, et al. ∙

research

∙ 12/13/2022

On computing the vertex connectivity of 1-plane graphs

A graph is called 1-plane if it has an embedding in the plane where each...

0 Therese Biedl, et al. ∙

research

∙ 08/16/2022

Computing Smallest Convex Intersecting Polygons

A polygon C is an intersecting polygon for a set O of objects in the pla...

0 Antonios Antoniadis, et al. ∙

research

∙ 11/14/2021

Area-Optimal Simple Polygonalizations: The CG Challenge 2019

We give an overview of theoretical and practical aspects of finding a si...

0 Erik D. Demaine, et al. ∙

research

∙ 02/14/2023

Minimum-link C-Oriented Paths Visiting a Sequence of Regions in the Plane

Let E={e_1,…,e_n} be a set of C-oriented disjoint segments in the plane,...

0 Kerem Geva, et al. ∙

research

∙ 11/18/2019

Minimum-Width Double-Strip and Parallelogram Annulus

In this paper, we study the problem of computing a minimum-width double-...

0 Sang Won Bae, et al. ∙

research

∙ 03/16/2023

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring

CG:SHOP is an annual geometric optimization challenge and the 2022 editi...

0 Loïc Crombez, et al. ∙