Algorithms for floorplan design via rectangular dualization

• Published in: IEEE transactions on computer-aided design of integrated circuits and systems Vol. 7; no. 12; pp. 1278 - 1289
• Main Authors: Yen-Tai Lai, Leinwand, S.M.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.12.1988; Institute of Electrical and Electronics Engineers
• Subjects: Algorithm design and analysis; Applied sciences; Bipartite graph; Buildings; Design. Technologies. Operation analysis. Testing; Electronics; Exact sciences and technology; Integrated circuit interconnections; Integrated circuits; Iterative algorithms; Iterative methods; Joining processes; Optimization methods; Routing; Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices; Space technology; Circuit design; Integrated circuit
• ISSN: 0278-0070; 1937-4151
• DOI: 10.1109/43.16806

A rectangular floorplan construction problem is approached from a graph-theoretical view. The study is based on a reduction of the rectangular dualization problem to a matching problem on bipartite graphs. This opens the way to applying traditional graph-theoretic methods and algorithms to floorplanning. Another result is a method for generating alternative rectangular duals, such that a proposed floorplan can be optimized by a sequence of iterative transformations. This approach is made more practical than others, by assuming that the given structure graph can be modified to force it to admit a rectangular dual. Algorithms that introduce edges and vertices into the given graph until a rectangular dual can be constructed are also presented.< >