A transformation algorithm to construct a rectangular floorplan

Abstract

A rectangular floorplan (RFP) is a partition of a rectangle into rectangles such that no four of them meet at a point. Rectangular floorplans find their applications in VLSI circuits floorplanning and architectural floorplanning. Let represent the graph of a rectangular floorplan RFP and be a subgraph of , where n denotes the number of rectangles in RFP. It is well known that every subgraph of may not admit an RFP, i.e., does not have a hereditary property. Hence, in this paper, we first derive a necessary and sufficient condition for to admit a rectangular floorplan RFP. Further, if admits an RFP, we present a linear time transformation algorithm for deriving RFP from RFP