An effective data structure for VLSI layout systems

An effective data structure is presented which is called a B-2 tree (bucket tree with 2-D binary trees) suitable for VLSI layout systems. The B-2 tree consists of a main binary tree which forms a directory for buckets, and bisector lists with 2-D binary trees. Experimental results have shown that the B-2 tree is superior to other data structures in region search performance even for huge size data. It has also been shown that its region search performance is not influenced by the distribution of objects on a chip.<>