首页 | 本学科首页   官方微博 | 高级检索  
     检索      

三维Hilbert曲线层级演进模型与编码计算
引用本文:吴宇豪,曹雪峰,余岸竹,孙万忠.三维Hilbert曲线层级演进模型与编码计算[J].测绘学报,2022,51(1):104-114.
作者姓名:吴宇豪  曹雪峰  余岸竹  孙万忠
作者单位:信息工程大学地理空间信息学院, 河南 郑州 450001
基金项目:国家自然科学基金(41401465)~~;
摘    要:格网单元的编码计算是全球离散网格系统的核心,支撑着网格快速索引及应用分析的高效计算。Hilbert曲线具有聚簇性高、连续性强的特点,是研究设计全球离散网格编码的重要工具。利用Hilbert曲线进行格元编码实现了坐标等效降维表达,但是对Hilbert曲线不同层级之间的变换关系、一维Hilbert码如何刻画格元多维空间结构与关系等网格编码基础理论问题的研究尚不完备。本文以八叉树立体网格中三维Hilbert曲线层级演进关系为突破口,使用状态矩阵与演进矩阵构建层级演进模型,进而分别设计笛卡儿坐标至Hilbert码计算以及邻近格元Hilbert码计算方法。与现有算法对比,本文算法以层级演进模型为理论基础,避免了烦琐迭代步骤以及转换步骤,算法流程简明直接。试验结果表明,本文笛卡儿坐标至Hilbert码计算效率较迭代算法提高为7%~23%,邻近格元Hilbert码计算效率较转换算法提高4.0~4.5倍。

关 键 词:全球离散网格  Hilbert曲线  编码计算  邻近  
收稿时间:2020-06-13
修稿时间:2021-03-16

Hierarchical evolution model and coding calculation of three-dimensional Hilbert curve
WU Yuhao,CAO Xuefeng,YU Anzhu,SUN Wanzhong.Hierarchical evolution model and coding calculation of three-dimensional Hilbert curve[J].Acta Geodaetica et Cartographica Sinica,2022,51(1):104-114.
Authors:WU Yuhao  CAO Xuefeng  YU Anzhu  SUN Wanzhong
Institution:Institute of Geospatial Information, Information Engineering University, Zhengzhou 450001, China
Abstract:The coding calculation of grid cells is the core of the discrete global grid system,which supports efficient calculation of indexing and analysis.Hilbert curve has the characteristics of high clustering and strong continuity,and is an important tool for global discrete grid coding.The lattice element coding using Hilbert curve realizes the coordinate equivalent dimensionality reduction expression,but the research on the basic theoretical problems of grid coding still not complete.In this paper,the hierarchical evolution relationship of the three-dimensional Hilbert curve in the octree three-dimensional grid is used as a breakthrough.The state matrix and the evolution matrix are used to construct a hierarchical evolution model,and then the calculation methods of Cartesian coordinates to Hilbert codes and adjacent grid Hilbert codes are designed respectively.Compared with the existing algorithms,the algorithm in this paper is based on a hierarchical evolution model,which avoids cumbersome iteration steps and conversion steps,and the algorithm flow is simple and straightforward.The experimental results show that the calculation efficiency of Cartesian coordinates to Hilbert codes in this paper is“7%~23%”higher than that of the iterative algorithm,and the calculation efficiency of neighbor grid elements Hilbert codes is 4.0~4.5 times higher than that of the conversion algorithm.
Keywords:discrete global grid  Hilbert curve  coding calculation  neighbor
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《测绘学报》浏览原始摘要信息
点击此处可从《测绘学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号