Hierarchical data structures and algorithms for computer graphics. I. Fundamentals
Hierarchical data structures and algorithms for computer graphics. I. Fundamentals
复制标题
计算机图形学的分层数据结构和算法。
DOI：
--
复制
发表时间：
1988
影响因子：
1.8
通讯作者：
R. Webber
中科院分区：
文献类型：
--
作者：
H. Samet;R. Webber
回顾了层次数据结构的基本原理，并说明了如何将它们用于实现计算机图形学中的一些基本操作。讨论了层次结构的性质，重点讨论了四叉树和八叉树。定义了后者，研究了它们的一些更常见的实现方式，并对四叉树/八叉树复杂性定理进行了解释。讨论了向量四叉树和向量八叉树。考虑了使用四叉树的基本运算的性能。
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.<<ETX>>