We describe the heuristics used by the Shadoks team in the CG:SHOP 2023 Challenge. The Challenge consists of 206 instances, each being a polygon with holes. The goal is to cover each instance polygon with a small number of convex polygons. Our general strategy is the following. We find a big collection of large (often maximal) convex polygons inside the instance polygon and then solve several set cover problems to find a small subset of the collection that covers the whole polygon.

翻译：本文描述了Shadoks团队在CG:SHOP 2023挑战赛中使用的启发式算法。该挑战包含206个实例，每个实例均为带孔多边形。目标是用少量凸多边形覆盖每个实例多边形。我们的总体策略如下：在实例多边形内部寻找大量（通常为最大的）凸多边形，然后求解多个集合覆盖问题，以找出能够覆盖整个多边形的小规模子集。