Title :
Generation of rectangular duals of a planar triangulated graph by elementary transformations
Author :
Tang, Hui ; Chen, Wai-Kai
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA
Abstract :
In the rectangular dual approach to the floorplan design, it is important to incorporate efficient rectangular dual transformation techniques in the iterative optimal-search algorithms. A solution to the rectangular dual transformation problem by directly using the properties of oriented graphs is proposed. The definitions of elementary components and elementary transformation are given. It is shown that any two rectangular duals of a graph can be converted into each other by a finite sequence of elementary transformations. As a result, all rectangular duals of a graph are derivable from each other
Keywords :
circuit layout; graph theory; network topology; floorplan design; iterative optimal-search algorithms; oriented graphs; planar triangulated graph; rectangular dual transformation; Algorithm design and analysis; Bipartite graph; Computer science; Iterative algorithms; Iterative methods; Sufficient conditions;
Conference_Titel :
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location :
New Orleans, LA
DOI :
10.1109/ISCAS.1990.112606
