DocumentCode :
2889164
Title :
YAQT: Yet another quad tree
Author :
Srinivas, P.V. ; Dwivedi, V.K.
Author_Institution :
Semicond. Complex Ltd., S.A.S. Nagar Chandigarh, India
fYear :
1991
fDate :
4-8 Jan 1991
Firstpage :
302
Lastpage :
309
Abstract :
A new data structure for storing two dimensional objects has been presented. A multiple storage quad tree is a quad tree which stores pointers to objects intersecting more than one quad in all of the quad that they intersect. The YAQT (Yet Another Quad Tree) is a modified form of multiple storage quad tree with no list required for storing crossing objects. A substantial improvement in the region query operation and tree traversal has been obtained. On the other hand only an insignificant increase of memory requirement is noticed in practical situations. Finally the YAQT and the algorithms which operate on it are found to be very simple
Keywords :
circuit CAD; data structures; trees (mathematics); 2D object storage; VLSI CAD; YAQT; data structure; memory requirement; multiple storage quad tree; region query operation; tree traversal; two dimensional objects; Circuits; Data mining; Data structures; Design engineering; Grid computing; Information retrieval; Multidimensional systems; Tiles; Tree data structures; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
VLSI Design, 1991. Proceedings., Fourth CSI/IEEE International Symposium on
Conference_Location :
New Delhi
Print_ISBN :
0-8186-2125-7
Type :
conf
DOI :
10.1109/ISVD.1991.185143
Filename :
185143
Link To Document :
بازگشت