𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Packing squares into a square

✍ Scribed by Joseph Y-T. Leung; Tommy W. Tam; C.S. Wong; Gilbert H. Young; Francis Y.L. Chin

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
464 KB
Volume
10
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Perfect Square Packings
Perfect Square Packings
✍ Adam Chalcraft πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 185 KB

An interesting problem is to determine whether all the squares of side n &1 can be packed into a rectangle of the appropriate area. Such a packing (into a rectangle of the right area) is called perfect. In this paper, we define an algorithm based on an algorithm by Paulhus and use it to show that th

On Packing Unequal Squares
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

An Algorithm for Packing Squares
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.