Generation of rectangular duals of a planar triangulated graph by elementary transformations

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.<
>