改进的垂直平面扫描约束图建立算法

An Improved Constraint Geheration Algorithm Using Perpendicular-plane-sweep

本文提出了一种基于垂直平面扫描建立约束图方法的改进算法,即用2-3树的数据结构代替了双链表数据结构,从而使整个算法的复杂性降低,实验数据表明这种改进的算法适用于VLSI中大量器件或模块的压缩问题。

The algorithm of generating constraint graph using perpendicular-plane-s -weep is the best one in symbolic layout compaction. An improved method is presented in this paper, namely substituting. the doubly-linked list by 2-3 tree.The time comple xity of the algorithm is reduced.Experimental results indicate the improved algorithm. is more suitable for the compaction of the great number of devices or modules in VLSI.