Square packing with O(x^0.6) wasted area

2025/08/06 by Bui, Hong Duc
#Computational Geometry (cs.CG) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.2508.04603

Abstract

We show a new construction for square packing, and prove that it is more efficient than previous results.

Citations

• Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
• A New Result on Packing Unit Squares into a Large Square

Related

• Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
• Optimal Packings of 22 and 33 Unit Squares in a Square
• A New Result on Packing Unit Squares into a Large Square
• Perfectly packing a square by squares of sidelength f(n)^-t
• Perfect packing of squares