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
复制标题
一种用于查找平面图的矩形对偶的算法，用于 VLSI 集成电路的面积规划
DOI：
10.1109/dac.1984.1585872
复制
发表时间：
1984
期刊：
影响因子：
--
通讯作者：
E. Kinnen
中科院分区：
文献类型：
--
作者：
K. Kozminski;E. Kinnen
给出了一个求平面三角剖分图的矩形对偶的O（n /sup 2/）算法.在实践中，已经观察到几乎线性的运行时间。该算法对解决超大规模集成电路设计中的面积规划问题有一定的参考价值。
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.