Skip to main content
Log in

Packing rectangles in a strip

  • Original article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

Rectangles with dimensions independently chosen from a uniform distribution on [0,1] are packed on-line into a unit-width strip under a constraint like that of the Tetris\(^{TM}\) game: rectangles arrive from the top and must be moved inside the strip to reach their place; once placed, they cannot be moved again. Cargo loading applications impose similar constraints. This paper assumes that rectangles must be moved without rotation. For n rectangles, the resulting packing height is shown to have an asymptotic expected value of at least (0.31382733 ...)n under any on-line packing algorithm. An on-line algorithm is presented that achieves an asymptotic expected height of (0.36976421 ...)n. This algorithm improves the bound achieved in Next Fit Level (NFL) packing, by compressing the items packed on two successive levels of an NFL packing via on-line movement admissible under the Tetris constraint.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 6 February 2001 / 25 June 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Coffman, Jr., E., Downey, P. & Winkler, P. Packing rectangles in a strip. Acta Informatica 38, 673–693 (2002). https://doi.org/10.1007/s00236-002-0089-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-002-0089-0

Keywords

Navigation