Geometric Bin Packing Beyond Convexity: Approximation Schemes without AugmentationResearch Paper
Geometric bin packing asks how many identical containers are needed to place a collection of objects without overlap. For polygonal objects, a bounding rectangle can discard useful free space around a concavity or inside a hole. The geometric distinction matters when the required answer is an actual placement in unit squares. The paper studies this problem…