Perfect square packings

DOI10.1006/JCTA.2000.3058MaRDI QIDQ1841223zbMATH OpenOpenAlexFDO

Authors Adam Chalcraft

Publication date 9 January 2002

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

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

zbMATH Keywords

square packing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
• Perfect packings of squares using the stack-pack strategy
• A note on perfect packing of squares and cubes
• Perfect packing of \(d\)-cubes
• An algorithm for packing squares

Cites work

• An algorithm for packing squares
• On packing of squares and cubes
• On packing unequal squares
• Unsolved problems in geometry

Cited in

(13)

• PERFECT PACKING OF SQUARES
• A note on perfect packing of squares and cubes
• Perfect packings of squares using the stack-pack strategy
• Optimal packings of 13 and 46 unit squares in a square
• Efficient packing of unit squares in a square
• Perfect packing of \(d\)-cubes
• An algorithm for the generation of perfect squared rectangles of arbitrary dimension
• Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
• Parallel packing squares into a triangle
• On packing of rectangles in a rectangle
• A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
• Perfect packing of cubes
• Guillotine cutting is asymptotically optimal for packing consecutive squares

This page was built for publication: Perfect square packings

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