On packing unequal rectangles in the unit square

DOI10.1016/0097-3165(94)90116-3MaRDI QIDQ1337180zbMATH OpenOpenAlexFDO

Authors Derek Jennings

Publication date 30 November 1994

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

Full work available at URL https://doi.org/10.1016/0097-3165(94)90116-3

zbMATH Keywords

packingrectanglesunit square

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Review text

The author shows that all the rectangles of size \(1 /n \times 1/(n + 1)\), \(n = 1, 2, \dots,\) can be packed into a square of size 133/132.

Cites work

• On packing of squares and cubes
• Some packing and covering theorems
• Tiling the unit square with squares and rectangles
• Unsolved problems in geometry

Cited in

(10)

• On packing squares with equal squares
• An algorithm for packing squares
• Two packing problems
• Packing unit squares in squares: A survey and new results
• Perfect packing of cubes
• On packings of squares and rectangles
• Packing unit squares in a rectangle
• Packing squares into a rectangle with a relatively small area
• On packing of rectangles in a rectangle
• Perfect packing of \(d\)-cubes

This page was built for publication: On packing unequal rectangles in the unit square

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