Maximum Polygon Packing: The CG:SHOP Challenge 2024
Not on the map. Why?
Abstract (arXiv)
We give an overview of the 2024 Computational Geometry Challenge targeting the problem textscMaximum Polygon Packing: Given a convex region P in the plane, and a collection of simple polygons Q1, ldots, Qn, each Qi with a respective value ci, find a subset S subseteq 1, ldots,n and a feasible packing within P of the polygons Qi (without rotation) for i ∈ S, maximizing sumi ∈ S ci. Geometric packing problems, such as this, present significant computational challenges and are of substantial practical importance.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 24 Mar 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.