This challenge reviews covering polygonal regions with minimum convex subsets, indicating continued interest in geometry problems.
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.
No takes yet. Share an insight, caveat, or question.
Fekete et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: