Abstract
In this paper, we present an efficient algorithm to construct shape curves for floorplans. Our algorithm is based on extensions of the tree-restructuring technique in [5] and the curve-adding technique in [2]. We assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Our algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that our algorithm performs well.