引用本文: 谢顺平, 冯学智, 王结臣, 周立国. 一种基于优势属性存储的四叉树结构及其构建算法[J]. 武汉大学学报 ( 信息科学版), 2009, 34(6): 663-666.
XIE Shunping, FENG Xuezhi, WANG Jiechen, ZHOU Liguo. A Quadtree Structure Based on Storing Ascendant Attribute and Its Construction Algorithm[J]. Geomatics and Information Science of Wuhan University, 2009, 34(6): 663-666.
 Citation: XIE Shunping, FENG Xuezhi, WANG Jiechen, ZHOU Liguo. A Quadtree Structure Based on Storing Ascendant Attribute and Its Construction Algorithm[J]. Geomatics and Information Science of Wuhan University, 2009, 34(6): 663-666.

## A Quadtree Structure Based on Storing Ascendant Attribute and Its Construction Algorithm

• 摘要: 针对多值图像或栅格型空间数据的四叉树存储方法,提出了一种基于优势属性存储的改进四叉树结构———优势四叉树,给出了实现自底向上的优势四叉树递归构建算法,并对不同规模和复杂度的多幅图像进行了构树对比实验。结果表明,本文提出的优势四叉树结构大幅度缩减了结点总数,存储开销平均为线性四叉树编码的69%,并具有较高的构建效率,是一种具有应用前景的四叉树结构。

Abstract: An improved quadtree structure based on storing ascendant attribute is proposed,which is called ascendant quadtree.A recursion algorithm of constructing ascendant quadtree that implement a bottom-up process is also presented.A lot of experiments were carried out to demonstrate the memory-efficiency and algorithm advantages of the proposed method.The results for different scales and different complexities show that the proposed quadtree structure can obviously reduce the total of nodes and has a 69% compression improvement compared with the constant bit-length linear quadtrees,and has a better practical value and application prospect.

/

• 分享
• 用微信扫码二维码

分享至好友和朋友圈