YAQT: Yet another quad tree

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.<>