DocumentCode :
911295
Title :
Quad list quad trees: a geometrical data structure with improved performance for large region queries
Author :
Weyten, Ludo ; De Pauw, Wim
Author_Institution :
Electron. Lab., Ghent Univ., Belgium
Volume :
8
Issue :
3
fYear :
1989
fDate :
3/1/1989 12:00:00 AM
Firstpage :
229
Lastpage :
233
Abstract :
A data structure is presented for the storage of graphical information. It is a modified multiple storage quad tree, with four lists in each leaf quad. A substantial improvement is obtained for region queries, in particular on large windows, and for tree traversal. On the other hand, only an insignificant increase of memory requirement is noticed in particular situations. The method is not complicated, so it can easily be programmed
Keywords :
computer graphics; data structures; geometrical data structure; graphical information; large region queries; large windows; leaf quad; lists; memory requirement; modified multiple storage quad tree; region queries; tree traversal; Data structures; Degradation; Design automation; Frequency; Information retrieval; Tree data structures; Tree graphs;
fLanguage :
English
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0278-0070
Type :
jour
DOI :
10.1109/43.21842
Filename :
21842
Link To Document :
بازگشت