DocumentCode :
995835
Title :
Multiple storage adaptive multi-trees
Author :
De Pauw, Wim ; Weyten, Ludo
Author_Institution :
Electr. Electron. Lab., Ghent Univ., Belgium
Volume :
9
Issue :
3
fYear :
1990
fDate :
3/1/1990 12:00:00 AM
Firstpage :
248
Lastpage :
252
Abstract :
A powerful technique (multiple storage multi-trees) for storage of geometrical data in CAD applications is presented. A significant improvement has been obtained in the field of region query performance. Memory requirements are slightly lower than for R.L. Brown´s well-known multiple storage quadtrees (ibid., vol.5, no.3, p.413-9, 1986). Experimental results for the new data structure are presented. The method may prove to be very useful for VLSI design tools
Keywords :
VLSI; circuit layout CAD; data structures; trees (mathematics); CAD applications; VLSI design tools; adaptive multi-trees; computer aided design; data structure; geometrical data; multiple storage multi-trees; region query performance; Circuits; Data structures; Helium; Memory; Very large scale integration;
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.46800
Filename :
46800
Link To Document :
بازگشت