A General Heuristic Approach for Maximum Polygon Packing (CG Challenge)

Download PDF
Open Webpage

Canhui Luo, Zhouxing Su, Zhipeng Lü

Published: 01 Jan 2024, Last Modified: 22 Jul 2025SoCG 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: This work proposes a general heuristic packing approach to address the Maximum Polygon Packing Problem introduced by the CG:SHOP 2024 Challenge. Our solver primarily consists of two steps: (1) Partitioning the container and polygons to form a series of small-scale subproblems; (2) For each subproblem, sequentially placing polygons into the container and attempting to eliminate overlaps.