We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Multitrees with internal storage

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
De Pauw, W. ; Lab. of Electron., Ghent Univ., Belgium

Some multitrees with internal storage data structure are presented for the storage of graphical objects in CAD systems. Memory requirements are as low as those for the very compact quad trees without bisector lists (QWBL). Moreover, multitrees with internal storage (MTIS) are as fast as quad list quad trees (QLQT) for region search operations

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:12 ,  Issue: 10 )