论文信息 - A theory of rectangular dual graphs

A theory of rectangular dual graphs

Arectangular graph is a plane graph where all regions are four-sided and all edges are oriented in either the vertical or the horizontal direction. In addition the graph enclosure must also be rectangular. Given a plane graph representing a desired component connectivity, itsrectangular dual can be used to build afloorplan. This indicates that a system implementation can allocate rectangular floorplan regions to components that can be pairwise connected through common borders.This paper proves that constructing a rectangular dual graph is equivalent to a matching problem in a bipartite graph derived from the given plane graph. A simple existence theorem in terms of the graph structure is obtained as a corollary.

Yen-Tai Lai | Sany M. Leinwand | Y. Lai

[1] Robert E. Tarjan,et al. Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[2] Edwin Kinnen,et al. Rectangular duals of planar graphs , 1985, Networks.

[3] Sartaj Sahni,et al. A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, DAC 1986.

[4] Sartaj Sahni,et al. A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[5] John Grason. An approach to computerized space planning using graph theory , 1971, DAC '71.

[6] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7] O. Ore. The Four-Color Problem , 1967 .

[8] Alon Itai,et al. Some Matching Problems for Bipartite Graphs , 1978, JACM.

[9] Dieter Jungnickel,et al. Graphs, Networks, and Algorithms , 1980 .

[10] William R. Heller,et al. The Planar Package Planner for System Designers , 1982, DAC 1982.

[11] D. T. Lee,et al. Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.