  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.
