Oriented aligned rectangle packing problem

Published

Journal Article

Given a collection R of n (= M × N) rectangles, we wish to pack it into M rows and N columns as the elements of an M × N matrix. The height of a row is defined to be the height of the tallest rectangle in that row, and the width of a column is defined to be the width of the widest rectangle in that column. The cost of a packing is the sum of the heights of the M rows plus the sum of the widths of the N columns. The oriented aligned rectangle packing problem is to find a packing with the minimum cost. In this paper we present an O(n) time algorithm and an O(n2) time algorithm for two non-trivial special cases. We also show how to extend the algorithms to handle other cost functions. © 1992.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Shing, MT

Published Date

  • October 26, 1992

Published In

Volume / Issue

  • 62 / 2

Start / End Page

  • 210 - 220

International Standard Serial Number (ISSN)

  • 0377-2217

Digital Object Identifier (DOI)

  • 10.1016/0377-2217(92)90249-9

Citation Source

  • Scopus