On packing unequal squares

DOI10.1006/JCTA.1996.0083MaRDI QIDQ1924232zbMATH OpenOpenAlexFDO

Authors Karen Ball

Publication date 6 March 1997

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcta.1996.0083

zbMATH Keywords

packingrectanglesquares

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Recommendations

• Two packing problems
• Packing squares into a rectangle with a relatively small area
• On packing squares into a rectangle
• Packing of odd squares revisited

Cited in

(16)

• A note on perfect packing of squares and cubes
• A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
• Perfect packing of cubes
• On packings of squares and rectangles
• Perfect packing of \(d\)-cubes
• Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
• Compactness theorems for geometric packings
• A note on three Moser's problems and two Paulhus' lemmas
• Packing of odd squares revisited
• An algorithm for packing squares
• On packing squares with equal squares
• Packing squares into a rectangle with a relatively small area
• Packing a triangle by equilateral triangles of harmonic sidelengths
• Packing equal squares into a large square
• Perfect square packings
• Guillotine cutting is asymptotically optimal for packing consecutive squares

This page was built for publication: On packing unequal squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924232)