检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐益峰[1] 陈昱 程宝银[1] 张蒙[1] XU Yifeng;CHEN Yu;CHENG Baoyin;ZHANG Meng(Suzhou Surveying and Mapping Institute Co.,Ltd.,Suzhou 215000,China;Suzhou Natural Resources and Planning Bureau,Suzhou 215000,China)
机构地区:[1]苏州市测绘院有限责任公司,江苏苏州215000 [2]苏州市自然资源和规划局,江苏苏州215000
出 处:《测绘通报》2021年第9期140-144,共5页Bulletin of Surveying and Mapping
基 金:江苏省测绘地理信息科研项目(JSCHKY201913)。
摘 要:分幅地理空间数据坐标转换后,还需在新坐标系下重新分幅。对于其中的批量数据,在新旧图幅重叠判断时需要大量的检索操作,快速查找算法能够提高查找效率。本文在建立新旧图幅关联关系、确定重叠判断方法和分割要素的文件存储方式后,提出了一种以新图幅中心点坐标为关键字的二维哈希表索引构建和重叠图幅查找的算法;给出了算法设计思路,并以实际案例验证分析了算法的正确性和有效性。与传统方法相比,该算法具有更高的执行效率,是一种较好的替代算法。After the coordinate transformation of divisive geospatial data, it’s necessary to re-divided in the new coordinate system. For the batch data, the search efficiency can be improved when judging the overlap of old and new mapsheets by the fast search algorithm. Firstly, the relationship between the old and the new mapsheets is established and the overlapping judgment method and the file storage mode of the segmented elements are determined. Then, the algorithm of constructing two-dimensional Hashtable with center point coordinates of new mapsheet as key-words and finding overlapped mapsheets is proposed. Finally, the algorithm design idea is realized, and the correctness and effectiveness of the algorithm are verified by computational examples in the paper. Compared with traditional methods, this algorithm has higher execution efficiency and is an ideal alternative algorithm.
关 键 词:二维哈希算法 哈希表 批量分幅 地理空间数据 坐标转换
分 类 号:P208[天文地球—地图制图学与地理信息工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145