摘要
本文提出线性八叉树的一种最优构造算法,本文对文献[3]中最优四叉树构造算法的某些思路作了推广及改进:采用了最大活动结点插入原则,免除了合并操作;算法只需进行与黑结点数成比例的插入操作。借助于一种新的图像数据结构——数字搜索树作为中间存储结构,有效地压缩了数据并加快了插入速度,因而本算法有较高的效率.
In this paper, an optimal construction algorithm for linear octrees is presented. Using the largest-arctive-node insertion rule, the algorithm only needs insertion operations pro-portational to the number of black nodes and no merging is needed. With the aid of a new image data structure, the digital search tree, as a mid storage structure, the image data can be efficiently compressed, and the insertion operations can be sped up. Therefore, the efficiency of the new algorithm is higher.
出处
《计算机学报》
EI
CSCD
北大核心
1993年第4期281-286,共6页
Chinese Journal of Computers
关键词
线性八叉树
最优构造
算法
Linear octree, octree construction, digital search tree.
