A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in which each node has four descendants. Since most algorithms based on quadtrees require complex navigation between nodes, efficient traversal methods as well as efficient storage techniques are of great interest. In this paper, we first propose an efficient indexing scheme for a linear (pointerless) quadtree data structure.doi:10.1109/icip.1999.822944 dblp:conf/icip/BalmelliKV99 fatcat:uhh3iu4ocrdkxnmiexx5npk5gu