๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Online Removable Square Packing

โœ Scribed by Xin Han; Kazuo Iwama; Guochuan Zhang


Publisher
Springer
Year
2007
Tongue
English
Weight
481 KB
Volume
43
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Online square and cube packing
โœ Leah Epstein; Rob van Stee ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 261 KB
cover
โœ Connor, Vic ๐Ÿ“‚ Fiction ๐Ÿ“… 2019 ๐Ÿ› Helvetic House ๐ŸŒ English โš– 305 KB ๐Ÿ‘ 3 views
cover
โœ Vic Connor ๐Ÿ“‚ Fiction ๐Ÿ“… 2019 ๐Ÿ› Helvetic House ๐ŸŒ English โš– 305 KB ๐Ÿ‘ 3 views
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
Online variable-sized bin packing
โœ Nancy G. Kinnerseley; Michael A. Langston ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 438 KB
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