Given a collection R of n (¸=M×N) rectangles, the authors 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 th 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 problems is to find a packing with the minimuum cost. In this paper the authors present an O(n) time algorithm and an O(n2) time algorithm for two non-trivial special cases. They also show how to extend the algorithms to handle other cost functions.
