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个算例，每个算例均为带孔洞的多边形。目标是用最少数量的凸多边形覆盖每个算例多边形。我们的总体策略如下：首先在实例多边形内部寻找大量大型（通常是最大）凸多边形集合，随后通过求解若干集合覆盖问题，从该集合中筛选出能完整覆盖原多边形的最小子集。