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

Key Points

• The central aim is to address the Minimum Coverage by Convex Polygons problem within the context of computational geometry.
• Introduced as a challenge in the 2023 Computational Geometry Challenge.
• Focused on polygonal regions potentially containing holes.
• Explores strategies for covering these regions with convex subsets.
• Aims to generate solutions that utilize the least number of convex subsets.
• Outcome may provide insights into existing methods and new algorithms in computational geometry.