# Maximum Polygon Packing: The CG:SHOP Challenge 2024

arXiv: https://arxiv.org/abs/2403.16203 · HTML: https://mlsanity.com/paper/2403.16203/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Mar 2024.

## Built on by (most cited first, 1 of 1)

- [GeoNest: Learning to Select Failure-Aware Neighborhoods for the Irregular Knapsack Problem in a Circular Container](https://mlsanity.com/paper/2609.38863/) (2026)

## 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.