Subscribe
Issue No.03  May/June (1988 vol.8)
pp: 4868
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.513
ABSTRACT
<p>The fundamentals of hierarchical data structures are reviewed and it is shown how they are used in the implementation of some basic operations in computer graphics. The properties of hierarchical structures are discussed, focusing on quadtrees and octrees. The latter are defined, some of the more common ways in which they are implemented are examined, and an explanation of the quadtree/octree complexity theorem is provided. Vector quadtrees and vector octrees are discussed. The performance of basic operations using quadtrees is considered.</p>
CITATION
Hanan Samet, Robert E. Webber, "Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.", IEEE Computer Graphics and Applications, vol.8, no. 3, pp. 4868, May/June 1988, doi:10.1109/38.513
REFERENCES
