Computational Complexity of Two-Dimensional Packing Problems with Curved Pieces and Containers

Many variants of two-dimensional packing problems, including those with curved pieces and containers, are ∃R-complete, indicating their fundamental computational difficulty.