Abstract: 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.