Key points are not available for this paper at this time.
We give an overview of the 2024 Computational Geometry Challenge targeting the problem Maximum Polygon Packing: Given a convex region P in the plane, and a collection of simple polygons Q₁, , Qₙ, each Qᵢ with a respective value cᵢ, find a subset S \1, , n\ and a feasible packing within P of the polygons Qᵢ (without rotation) for i S, maximizing ₈ ₒ cᵢ. Geometric packing problems, such as this, present significant computational challenges and are of substantial practical importance.
Fekete et al. (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: