球面DQG地址码与经纬度坐标的快速转换算法  

A Fast Translating Algorithm between DQG Code and Longitude/Latitude Coordinates

作　　者：崔马军[1,2] 高彦丽[2] 赵学胜[2] 

机构地区：[1]扬州环境资源职业技术学院,江苏扬州225127 [2]中国矿业大学(北京)测绘与土地科学系,北京100083

出　　处：《地理与地理信息科学》2009年第3期42-44,共3页Geography and Geo-Information Science

基　　金：国家自然科学基金项目"顾及地形的全球离散格网自适应建模研究"(4077116)

摘　　要：为了解决传统球面格网与经纬度坐标在转换效率或精度上存在的问题,提出一种新的转换算法。在分析球面退化四叉树格网(DQG)的剖分原理及其编码规则的基础上,给出DQG单元的行列定义规则,并设计了一套地址码与经纬度之间快速坐标转换的详细算法;将该算法与QTM行列逼近法、ZOT投影法及ETP投影法进行效率对比实验,结果表明:对于100万个DQG格网单元,其转换算法的平均耗时量为上述传统算法的53%、39%和7%,且避免了QTM行列逼近法出现的半格网误差现象,精度较高。In order to resolve the defects in translating efficiency or precision between the traditional spherical grids and longitude/latitude coordinates,a new translating algorithm is presented in this paper. Firstly, the partition principle and encoding rules of the degenerate quadtree grid on sphere were analyzed. Then, the definition of row ＆ column of DQG units was given and a fast translating algorithm between DQG code and longitude/latitude coordinates was designed in details. In the end,efficiency analysis by comparing experiment was done between this algorithm and other three traditional algorithms, i. e. QTM, ZOT, and ETP algorithms. The results illustrate that time consume of this algorithm is only 53%, 39%,and 7% to that of three traditional algorithms by dealing with 1 million grids and the half-grid error produced by QTM is avoided in this algorithm.

关 键 词：DQG 地址码 经纬度 坐标转换 

分 类 号：P208[天文地球—地图制图学与地理信息工程]