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

03/13/2023

∙

by   Sandor P. Fekete, et al.

∙

0

∙

share

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.