Optimally Packing a Large Square by Unit Squares
Abstract
We show that a large square of sidelength $x$ can be packed by unit squares in a manner so that the wasted space $W(x) = O(x^{3/5})$.
Fields of Study & Subjects
Optimization and Packing Problems
Computational Geometry and Mesh Generation
Complexity and Algorithms in Graphs
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 1 February 2026
- Document type
- Preprint