Multitrees with internal storage

摘要

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.