AI Chat AI Image Generator AI Video Text to Speech

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

03/13/2023

∙

by Sandor P. Fekete, et al.

∙

∙

We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a problem with a long-standing tradition in Computational Geometry.

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

research

∙ 03/14/2022

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

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

0 Sandor P. Fekete, et al. ∙

research

∙ 04/08/2020

Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020

We give an overview of the 2020 Computational Geometry Challenge, which ...

0 Erik D. Demaine, et al. ∙

research

∙ 05/06/2021

Covering Convex Polygons by Two Congruent Disks

We consider the planar two-center problem for a convex polygon: given a ...

0 Jongmin Choi, et al. ∙

research

∙ 02/05/2022

Asymptotic Critical Radii in Random Geometric Graphs over 3-Dimensional Convex regions

This article presents the precise asymptotical distribution of two types...

0 Jie Ding, et al. ∙

research

∙ 03/14/2023

Shadoks Approach to Convex Covering

We describe the heuristics used by the Shadoks team in the CG:SHOP 2023 ...

0 Guilherme D. da Fonseca, et al. ∙

research

∙ 01/27/2020

Cellular Decomposition for Non-repetitive Coverage Task with Minimum Discontinuities

A mechanism to derive non-repetitive coverage path solutions with a prov...

0 Tong Yang, et al. ∙

research

∙ 06/04/2021

Covering Polygons is Even Harder

In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon...

0 Mikkel Abrahamsen, et al. ∙