DocumentCode :
3144018
Title :
The Quad-CIF Tree: A Data Structure for Hierarchical On-Line Algorithms
Author :
Kedem, Gershon
Author_Institution :
University of Rochester, Rochester, NY
fYear :
1982
fDate :
14-16 June 1982
Firstpage :
352
Lastpage :
357
Abstract :
In this paper we describe the quad-CIF tree data structure and its application to hierarchical on-line computer-aided design algorithms. The main idea is to overlay a tree of coordinates on top of the hierarchical representation of an integrated circuit. The coordinate tree enables one to find quickly the set of all objects that intersect a given window. We outline how one can use the data structure in order to implement hierarchical, on-line design rule checking and node extraction. We also describe some applications to plotting.
Keywords :
Algorithm design and analysis; Application software; Circuits; Data mining; Data structures; Design automation; Organizing; Sorting; Transistors; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation, 1982. 19th Conference on
Conference_Location :
Las Vegas, NV, USA
ISSN :
0146-7123
Print_ISBN :
0-89791-020-6
Type :
conf
DOI :
10.1109/DAC.1982.1585523
Filename :
1585523
Link To Document :
بازگشت