虚拟战场环境时空数据的Hilbert码索引方法

Hilbert Code Index Method for Spatiotemporal Data of Virtual Battlefield Environment

  • 摘要: 在虚拟战场环境中,时空数据的高效组织是动态描述战场关键要素、实时分析军事行动计划的前提。首先对经度、纬度、时间进行同步层次嵌套细分来构建规则的多分辨率时空网格,然后基于Hilbert曲线设计时空格元编码,进而根据虚拟战场环境时空数据与时空格元Hilbert码的对应关系,提出一种基于Hilbert码的时空数据索引方法。在此基础上设计实验, 比较格元编码的时空邻近性、索引构建效率以及查询效率。结果表明,Hilbert码方法在邻近性上优于Morton码,索引构建速度满足大规模时空数据处理需要,且查询效率优于直接基于经度、纬度、时间查询和基于Morton码查询的方法,可作为虚拟战场中作战计划推演、战场环境要素可视化与分析等时空操作的基础。

     

    Abstract: In a virtual battlefield environment, efficient organization of spatiotemporal data is a prerequisite for dynamically describing key elements of the battlefield and analyzing military action plans in real time. First, the latitude, longitude, and time are synchronized and hierarchically subdivided to construct a regular multi-resolution spatiotemporal grid. Then, based on the Hilbert curve, a spatiotemporal coding is designed. A spatiotemporal data indexing method based on Hilbert code is proposed. Based on this, experiments are designed to compare the spatiotemporal proximity of coding, index construction efficiency, and query efficiency. The results show that the Hilbert code method is superior to Morton code in terms of proximity. The index construction speed meets the needs of large-scale spatiotemporal data processing, and the query efficiency is better than the methods based on longitude-latitude-time query and Morton code query directly, which means that the Hilbert code method can be used as the basis for spatiotemporal operations such as deduction of battle plans in the virtual battlefield, visualization and analysis of battlefield environment elements.

     

/

返回文章
返回