An edge-oriented compaction scheme based on multiple storage quad tree

As the complexity of integrated circuit design increases, the need for a computer-aided layout editing tool becomes critical. However, the most critical role in a VLSI CAD layout tool is known as the compactor. The authors describe an efficient edge-oriented, error-tolerance and mixed-constraint graph compactor based on a simple and fast region-query data structure-the multiple storage (MS) quad tree. The MS quad tree data structure supports a dexterous region search and inherently can be used to handle extended objects such as rhomboids and polygons.<>