✦ LIBER ✦

On packing unequal rectangles in the unit square

✍ Scribed by Derek Jennings

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 159 KB
Volume: 68
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(94)90116-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Packing Unequal Squares

✍ Karen Ball 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

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 unans

On packings of squares and rectangles

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

Tiling the unit square with squares and

Tiling the unit square with squares and rectangles

✍ Jim Owings 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 282 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

New results in the packing of equal circ

New results in the packing of equal circles in a square

✍ Costas D. Maranas; Christodoulos A. Floudas; Panos M. Pardalos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Some progress in the packing of equal ci

Some progress in the packing of equal circles in a square

✍ Michael Mollard; Charles Payan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The problem of the densest packing of n equal circles in a square has been solved for n < 10 in [4, 61; and some solutions have been proposed for n > 10. In this paper we give some better packings for n = 10, 11, 13 and 14.