English

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares

Computational Geometry 2025-04-15 v1

Abstract

We consider the problem of packing a large square with nonoverlapping unit squares. Let W(x)W(x) be the minimum wasted area when a large square of side length xx is packed with unit squares. In Roth and Vaughan's paper that proves the lower bound W(x)o(x1/2)W(x) \notin o(x^{1/2}), a good square is defined to be a square with inclination at most 101010^{-10} with respect to the large square. In this article, we prove that in calculating the asymptotic growth of the wasted space, it suffices to only consider packings with only good squares. This allows the lower bound proof in Roth and Vaughan's paper to be simplified by not having to handle bad squares.

Cite

@article{arxiv.2504.09489,
  title  = {Square Packing with Asymptotically Smallest Waste Only Needs Good Squares},
  author = {Hong Duc Bui},
  journal= {arXiv preprint arXiv:2504.09489},
  year   = {2025}
}

Comments

7 pages, 7 figures, submitted to CCCG 2025

R2 v1 2026-06-28T22:56:29.809Z