期刊文献+

基于轨道约束的空间目标球面网格索引及区域查询应用 被引量:3

Space target sphere grid index based on orbit restraint and region query application
下载PDF
导出
摘要 针对海量、高速运动的空间目标检索查询效率低的问题,提出一种基于轨道约束的空间目标球面网格索引构建方法。该方法利用地球惯性系下空间目标轨道相对稳定的特性,通过维护球面剖分网格内途经的空间目标列表,实现了对高速运动目标的稳定索引。在此基础上,提出基于目标球面网格索引的区域查询应用方案,首先,依据一定步长离散查询时段;然后,计算查询区域在惯性空间的边界点坐标并确定交叉网格;其次,提取网格中的空间目标,计算并判断目标与区域的位置关系;最后,递归查询整个时段,实现空间目标过境查询分析。仿真实验中,传统逐目标查询方法耗时与目标数量线性正相关而与区域大小无关,单目标平均耗时0.09 ms;与之相比,所提方法用时随区域面积减小呈线性递减,区域格网数小于2 750时,时间效率高于对比方法,且能够维持相当的准确率。实验结果表明,该方法在实际区域应用中可以有效提升查询的效率。 Since the efficiency of retrieval and query of mass and high-speed space targets remains in a low level, a construction method of sphere grid index to the space targets based on the orbit restraint was proposed. The advantage that the orbit of space target is relatively stable in earth inertial coordinate system was used in the method to achieve the stabilized index to high-speed moving objects by maintaining the list of the space targets that pass through the sphere subdivision grid. On this basis, a region query application scheme was proposed. Firstly, the query time period was dispersed according to a particular step value. Secondly, the boundary coordinates of the query region in the inertial space were calculated and the staggered mesh was confirmed. Then the space targets in the grid were extracted and the spatial relationship between targets and the region was calculated and estimated. Finally, the whole time period was queried recursively and the space targets transit query analysis was accomplished. In the simulation experiment, the consumed time of the traditional method by calculating one by one has a linear positive correlation with the target number, but it has no relevance with the region size. One target costs 0.09 ms on average. By contrast, the time of the proposed method in the paper shows a linear decrease with the decline of area size. When the number of the region grids is less than 2 750, the time efficiency is higher than that of the comparison method. Furthermore, it can maintain a fairly good accuracy. The experimental results show that the proposed method can improve the efficiency of the query in the actual region application effectively.
出处 《计算机应用》 CSCD 北大核心 2017年第7期2095-2099,共5页 journal of Computer Applications
基金 河南省科技攻关项目(172102210020)~~
关键词 空间目标 轨道约束 交叉格网 网格索引 区域查询 space target orbit restraint staggered mesh grid index region query
  • 相关文献

参考文献5

二级参考文献39

  • 1贲进,童晓冲,张永生,张衡.球面等积六边形离散网格的生成算法及变形分析[J].地理与地理信息科学,2006,22(1):7-11. 被引量:21
  • 2童晓冲,贲进,张永生.不同集合的球面矢量VORONOI图生成算法[J].测绘学报,2006,35(1):83-89. 被引量:5
  • 3徐青.“数字空间”与“深空测绘”及其支撑技术[J].测绘科学技术学报,2006,23(2):97-100. 被引量:7
  • 4周杨,蓝朝桢,徐青.空间目标几何与行为一体化建模方法[J].计算机仿真,2006,23(9):11-14. 被引量:1
  • 5DUTTON G..Encoding and Handling Geospatial Data with Hierarchical Triangular Meshes[A].Proceeding of 7th International Symposium on Spatial Data Handling[C].[s.l.]:[s.n.].1996,34-43.
  • 6FEKETE G.Rendering and Managing Spherical Data with Sphere Quadtrees[A].Proceedings of the First 1990 IEEE Conference on Visualization[C].[s.l.]:[s.n.].1990,176-186.
  • 7GOODCHILD M F,YANG S.A Hierarchical Data Structure for Global Geographic Information Systems[J].Computer Graphics,Vision and Image Processing,1992,54(1):31-44.
  • 8SAHR K,WHITE D.Geodesic Discrete Global Grid Systems[J].Cartography and Geographic Information Science,1998,30(2):121-134.
  • 9OTTOSON P,HAUSKA H.Ellipsoidal Quadtrees for Indexing of Global Geographical Data[J].Int.J.Geographical Information Science,2002,16(3):213-226.
  • 10WALDO,Chen Z.A Quadtree for Global Information Storage[J].Geographical Analysis,1986,18(4):360-371.

共引文献104

同被引文献20

引证文献3

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部