论文信息 - An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits

An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits

An O(n /sup 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.

Krzysztof Kozminski | Edwin Kinnen

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

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

[3] William R. Heller,et al. On finding Most Optimal Rectangular Package Plans , 1982, 19th Design Automation Conference.

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