Maximum Polygon Packing: The CG:SHOP Challenge 2024
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913281362362368 |
|---|---|
| author | Fekete, Sándor P. Keldenich, Phillip Krupke, Dominik Schirra, Stefan |
| author_facet | Fekete, Sándor P. Keldenich, Phillip Krupke, Dominik Schirra, Stefan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_16203 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Maximum Polygon Packing: The CG:SHOP Challenge 2024 Fekete, Sándor P. Keldenich, Phillip Krupke, Dominik Schirra, Stefan Computational Geometry Data Structures and Algorithms F.2.2 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. |
| title | Maximum Polygon Packing: The CG:SHOP Challenge 2024 |
| topic | Computational Geometry Data Structures and Algorithms F.2.2 |
| url | https://arxiv.org/abs/2403.16203 |