An optimal algorithm for spiral floorplan designs

Abstract

An improved algorithm for solving the area optimization problem of spiral floorplans is presented. Each of the five basic rectangles of a spiral floorplan have O(n) implementations. The algorithm takes O(n/sup 2/logn) time, and requires O(n/sup 2/) space to solve the area optimization problem. The best previously known algorithm solved the problem in O(n/sup 3/logn) time and O(n/sup 3/) space.<>