Efficient area optimization for multi-level spiral floorplans

An algorithm for solving the area optimization problem for multilevel spiral/slicing floorplans is presented. It is shown that in the worst case, there are exponentially many useful implementations for a multilevel spiral floorplan. The reasons why this does not happen very often are also shown. The experimental data suggest that in most cases, the area optimization problem of multilevel spiral/slicing floorplans can be solved in O(n/sup 2/ log n) time and O(n/sup 2/) space, where n is the number of basic rectangles of the floorplans.<>