Packing 2 × 2 unit squares into grid polygons is NP-complete
Dania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj van Omme · 2009
In a packing problem, the goal is to put some small objects disjointly into a large container, while optimizing some objective function. The packing problem is very general, and a rich variety of objects and containers are