✦ LIBER ✦

On Packing Unequal Squares

✍ Scribed by Karen Ball

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 196 KB
Volume: 75
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1996.0083

No coin nor oath required. For personal study only.

✦ Synopsis

This paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A 68 (1994), 465 469], on the smallest rectangle into which all of the squares of side length 1Ân, n=2, 3, 4, ... can be packed. The question of whether a packing with an arbitrarily small excess area is possible remains unanswered.

📜 SIMILAR VOLUMES

On packing unequal rectangles in the uni

On packing unequal rectangles in the unit square

✍ Derek Jennings 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Inefficiency in packing squares with uni

Inefficiency in packing squares with unit squares

✍ K.F Roth; R.C Vaughan 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 893 KB

Efficiently packing unequal disks in a c

Efficiently packing unequal disks in a circle

✍ Bernardetta Addis; Marco Locatelli; Fabio Schoen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 148 KB

An Algorithm for Packing Squares

✍ Marc M. Paulhus 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 357 KB

An algorithm is presented that can be used to pack sets of squares (or rectangles) into rectangles. The algorithm is applied to three open problems and will show how the best known results can be improved by a factor of at least 6\_10 6 in the first two problems and 2\_10 6 in the third.

Packing squares into a square

✍ Joseph Y-T. Leung; Tommy W. Tam; C.S. Wong; Gilbert H. Young; Francis Y.L. Chin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 464 KB

On packings of squares and rectangles

✍ Derek Jennings 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 226 KB