Algorithm for GPS Network Construction Based on Spherical Delaunay Triangulated Irregular Network
-
摘要: 根据球面Delaunay三角网的最大二面角性质,提出了一种GPS网络快速生长算法.采用国际大地坐标系的离散GPS站点,构造了全球球面Delaunay三角网,以验证该算法的可靠性.最后,对球面Delaunay三角网快速生长算法和球面Delaunay三角网直接搜索算法的效率进行了比较.结果表明,所提出的基于球面Delaunay三角网的GPS网络快速生长算法是有效的.
-
关键词:
- 球面 /
- 狄洛尼 /
- 参考站 /
- 全球定位系统(GPS)
Abstract: A fast growth algorithm for GPS(global positioning system) network construction was developed based on the characteristics of maximized dihedral angle of SDTIN(spherical Delaunay triangulated irregular network).The coordinates,as test data,of GPS sites of ITRF(international terrain reference frame) were utilized to construct a global SDTIN in order to prove the reliability of the algorithm.In addition,the directly searching algorithm for SDTIN was compared with the fast growth algorithm.The comparison result shows that the fast growth algorithm is effective.-
Key words:
- sphere /
- Delaunay /
- reference station /
- GPS(global positioning system)
-
冯琰,施一民.基于区域性椭球面数字地面模型的研究[J].同济大学学报:自然科学版,2003,30(8):964-967.FENG Yan,SHI Yimin.Three-dimensional geographic information system visualization model depended on ellipsoid-based digital terrain model[J].Journal of Tonji University,2003,30(8):964-967.[2] 白建军,赵学胜,陈军.基于椭球面三角格网的数字高程建模[J].武汉大学学报:信息科学版,2005,30(5):383-387.BAI Jianjun,ZHAO Xuesheng,CHEN Jun.Digital elevation modeling based on hierarchical subdivision of the triangular meshes on ellipsoidal surface[J].Geomaties and Information Science of Wuhan University,2005,30(5):383-387.[3] De BERG M,Van KREVELD M.计算几何--算法与应用[M].2版.邓俊辉译.北京:清华大学出版社,2005:203-207.[4] 李志林,朱庆.数字高程模型[M].武汉:武汉科技大学出版社,2000:34-48.[5] 王建华,徐强勋,张锐.任意形状三维物体的Delaunay网格生成算法[J].岩石力学与工程学报,2003,22(5):717-722.WANG Jianlma,XU Qianxun,ZHANG Rui.Delaunay algorithm and related procedure to generate the tetralledron mesh for an object with arbitrary boundary[J].Chinese Journal of Rock Mechanics and Engineering,2003,22(5):717-722. -
点击查看大图
计量
- 文章访问数: 1533
- HTML全文浏览量: 92
- PDF下载量: 513
- 被引次数: 0
下载: