论文信息 - A condition for a maximal planar graph to have a unique rectangular dual and its application to VLSI floor-plan

A condition for a maximal planar graph to have a unique rectangular dual and its application to VLSI floor-plan

The concept of a rectangular dual of maximal planar graph G provides an interesting approach to VLSI floor plans in hierarchical design strategies. In the approach, a rectangular dual yielding the most area-efficient floor plan has to be selected from among all rectangular duals of G. A systematic algorithm is described for enumerating all rectangular duals of G in O( mod V mod R mod ) time, where V and R are the sets of vertices and rectangular duals of G, respectively. This time complexity is achieved by using a condition for a maximal planar graph to have a unique rectangular dual, and it is asymptotically optimal in the sense that at least O( mod V mod R mod ) time is necessary to output all the rectangular duals.<<ETX>>

Shoji Shinoda | Shuji Tsukiyama | Isao Shirakawa | T. Maruyama

[1] Larry J. Stockmeyer,et al. Optimal Orientations of Cells in Slicing Floorplan Designs , 1984, Inf. Control..

[2] Yen-Tai Lai,et al. An Algorithm for Building Rectangular Floor-Plans , 1984, 21st Design Automation Conference Proceedings.

[3] Shuji Tsukiyama,et al. An algorithm generating all rectangular duals for VLSI floor-plan , 1987, 1987 Symposium on VLSI Circuits.

[4] S. L. Hakimi. A problem on rectangular floorplans , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[5] Sartaj Sahni,et al. A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph , 1987, Networks.

[6] William R. Heller,et al. On finding Most Optimal Rectangular Package Plans , 1982, DAC 1982.

[8] Israel Koren,et al. Floorplans, planar graphs and layouts , 1988 .

[9] Krzysztof Kozminski,et al. An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits , 1984, 21st Design Automation Conference Proceedings.

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

[11] Isao Shirakawa,et al. A Floor Plan System Using a Rectangular Dual , 1988 .

[12] K. Kozminski,et al. Rectangular dualization and rectangular dissections , 1988 .

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