Optimal rectangle packing
โ Scribed by Richard E. Korf; Michael D. Moffitt; Martha E. Pollack
- Publisher
- Springer US
- Year
- 2008
- Tongue
- English
- Weight
- 648 KB
- Volume
- 179
- Category
- Article
- ISSN
- 0254-5330
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The rectangle-packing problem is the problem of placing several given rectangles of arbitrary width and height into a minimum area rectangle without overlapping. This problem can be applied to VLSI packaging design, for which the area significantly affects the fabrication cost. Since this is an NP-h
Golomb has covered the main previous results of tiling a rectangle with congruent polyominoes in the revised edition of ``Polyominoes' ' (1994). This article attempts to summarise recent discoveries of many new examples of polyominoes which pack rectangles.