.png){kind=icon}
.png){kind=icon}
Return
ORIENTED ALIGNED RECTANGLE PACKING PROBLEM
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90249-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given a collection R of n (= M X N) rectangles, we wish to pack it into M rows and N columns as the elements of an M X 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.
Keywords:
DYNAMIC PROGRAMMING
2-DIMENSIONAL BIN-PACKING
MODULE PLACEMENT
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available