On Two Dimensional Packing

Yossi Azar, Leah Epstein

Research output: Contribution to journalArticlepeer-review

Abstract

The paper considers packing of rectangles into an infinite bin. Similar to the Tetris game, the rectangles arrive from the top and, once placed, cannot be moved again. The rectangles are moved inside the bin to reach their place. For the case in which rotations are allowed, we design an algorithm whose performance ratio is constant. In contrast, if rotations are not allowed, we show that no algorithm of constant ratio exists. For this case we design an algorithm with performance ratio of O(log(1/ε)), where ε is the minimum width of any rectangle. We also show that no algorithm can achieve a better ratio than Ω(√log(1/ε) ) for this case.

Original languageEnglish
Pages (from-to)290-310
Number of pages21
JournalJournal of Algorithms
Volume25
Issue number2
DOIs
StatePublished - Nov 1997

Fingerprint

Dive into the research topics of 'On Two Dimensional Packing'. Together they form a unique fingerprint.

Cite this