Automatic Floorplan Design

A new approach to rectangle-packing

“…Then, by (1) and (2) in Section 3.1, code and order are assigned. The horizontal/vertical constraints generated in the application of the procedure PACK_BY_BOUNDARY are considered.…”

“…The vertical constraint graph G V is similarly defined based on the upper and lower positional relationship in (2) above and the height of each rectangle.…”

“…In such instances, the efficiency of the solution is significantly affected by the representation of the rectangular layout solution. From the point of view of efficiency, most of the conventional algorithms limit the layout solution to a slice structure [2]. Even if a nonslice structure is treated, the models treated are limited to special ones with several restrictions [4].…”

On the convex formulation of area for slicing floorplans

“…Lots of approaches have been reported along the three past decades for floorplanning of many (usually digital) cells in a chip [1][2][3][4][5][6][7][8][9][10].…”

“…A floorplan is called slicing [2], if it is possible to recursively split it into rectangular slices by means of successive horizontal and vertical cuts. The resulting slices may be represented by a binary tree.…”