Maximum Polygon Packing: The CG:SHOP Challenge 2024
<|reference_start|>Maximum Polygon Packing: The CG:SHOP Challenge 2024: We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, each $Q_i$ with a respective value $c_i$, find a subset $S \subseteq \{1, \ldots,n\}$ and a feasible packing within $P$ of the polygons $Q_i$ (without rotation) for $i \in S$, maximizing $\sum_{i \in S} c_i$. Geometric packing problems, such as this, present significant computational challenges and are of substantial practical importance.<|reference_end|>
@article{fekete2024maximum,
    title={Maximum Polygon Packing: The CG:SHOP Challenge 2024},
    author={S'andor P. Fekete, Phillip Keldenich, Dominik Krupke and Stefan
  Schirra},
    journal={arXiv preprint arXiv:2403.16203},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.16203},
    primaryClass={cs.CG cs.DS}
}