【24h】

A spatial indexing approach based on Linear Referencing System

机译:基于线性参照系的空间索引方法

获取原文
获取原文并翻译 | 示例

摘要

To 3D visualization of terrain data with large ranges, we often use the strategy as follows: terrain model is firstly divided into regular patches and then index mechanism is set up on the basis of data patches. Next, we load batches of data patches around the viewpoint dynamically. However, when many road networks are nested into terrain models, it is difficult for terrain models to divide into regular patches in an original way. It is well known that the data is along the road in a linear way and the roads connect to each other. According to the above feature, a hybrid index mechanism combining connectivity with dynamic segmentation is proposed in this paper, which can realize the process of query in two steps. The first step is to search roughly by means of connectivity index. Based on the results of the first step, the second step can finish the process of exact query satisfactorily using dynamic segmentation index. This index mechanism with high query speed guarantees speed of loading data dynamically, and meets the demand of visualization of road network. Finally, we implement the algorithm by means of some experiments, and give a comparison in space efficiency and time efficiency with R-tree index.
机译:为了对大范围的地形数据进行3D可视化,我们经常采用以下策略:首先将地形模型划分为常规补丁,然后在数据补丁的基础上建立索引机制。接下来,我们围绕视点动态加载一批数据补丁。但是,当许多道路网络嵌套到地形模型中时,地形模型很难以原始方式划分为常规小块。众所周知,数据以线性方式沿着道路,并且道路相互连接。针对以上特点,提出了一种将连通性与动态细分相结合的混合索引机制,可以实现两步查询。第一步是通过连通性索引进行粗略搜索。根据第一步的结果,第二步可以使用动态细分索引令人满意地完成精确查询的过程。这种查询速度快的索引机制,保证了动态加载数据的速度,满足了路网可视化的需求。最后,我们通过一些实验来实现该算法,并与R-tree索引进行空间效率和时间效率的比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号