Title :
An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits
Author :
Kozminski, Krzysztof ; Kinnen, Edwin
Author_Institution :
Department of Electrical Engineering, The University of Rochester, Rochester, NY
Abstract :
An O(n 2) algorithm for finding a rectangular dual of a planar triangulated graph is presented. In practice, almost linear running times have been observed. The algorithm is useful for solving area planning problems in VLSI IC design.
Keywords :
Algorithm design and analysis; Clustering algorithms; Integrated circuit interconnections; Integrated circuit layout; Polynomials; Sufficient conditions; Very large scale integration;
Conference_Titel :
Design Automation, 1984. 21st Conference on
Print_ISBN :
0-8186-0542-1
DOI :
10.1109/DAC.1984.1585872
