| 基于二叉树的栅格数据快速编码及其实现 |
| |
| 引用本文： | 杨敏,汪云甲.基于二叉树的栅格数据快速编码及其实现[J].测绘工程,2001,10(4):16-19. |
| |
| 作者姓名： | 杨敏 汪云甲 |
| |
| 作者单位： | 中国矿业大学环境与测绘学院,江苏徐州,221008 |
| |
| 摘 要： | 在对常规编码方法存在的不足进行分析的基础上，提出了在一次遍历栅格数据过程中生成线性二叉树的快速动态编码以及地程编码方法，该方法用堆栈的思想代替传统的线性表，以十进制orton码为顺序提取栅格单元数据并介入栈，以压栈的方式完成栅格单元或结点向上层的递归合并。当对整个栅格数据遍历一次后，栈中剩下的记录便是所需的线性二叉树编码结果。通过对算法的分析表明，该方法具有明显的优点和重要意义。
|
| 关 键 词： | 栅格数据 线性二叉树 Morton码 压栈 编码方法 GIS 地理信息系统 |
| 文章编号： | 1006-7949(2001)04-0016-04 |
| 修稿时间： | 2001年5月10日 |
Fast Dynamic Encoding of Raster Data Using Linear Bintree and Its Realization |
| |
| YANG Min,WANG Yun-jia.Fast Dynamic Encoding of Raster Data Using Linear Bintree and Its Realization[J].Engineering of Surveying and Mapping,2001,10(4):16-19. |
| |
| Authors: | YANG Min WANG Yun-jia |
| |
| Abstract: | Raster data structure is one of the effective data structures to express spatial data. Different traditional methods can be used to compress and organize raster data, such as Raster Matrix Code, Run Length Code and Quadtree code. They are either time-consuming and large memory block require- ments or low compressing efficiency. Linear bintree is a effective approach for reducing storage data of raster data, which uses stack pulling and pushing instead of traditional linear-table. It transforms the orig- inal data into record with decimal Morton code, puffing into stack and pushing the records of stack dur- ing data processing. When accessed to the whole raster data, the records remain in the stack are the re- quired bintree encoding results. As far as the compressing efficiency, processing speed and memory re- quirements concerned, bintree is a significant approach for raster data organization. |
| |
| Keywords: | Raster data Linear bintree Morton code Stack pushing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
