摘要
针对某些GPS数据处理软件搜索异步环不全的问题,本文提出了一种简单有效的基于边界结点的GPS控制网异步环自动搜索的算法。这种算法借鉴了Delaunay三角网的思想,通过建立Delaunay三角网,找出三角网上所有具有3条或3条以上边界边的边界结点,并依次搜索有边界结点的边界异步环和无边界结点的边界异步环,针对边界异步环,根据不同的观测时段数给出所有的基线组合,最后计算边界异步环的闭合差;并且根据此算法编写了软件,最后利用某县GPS平面控制网验证了该方法的可行性。
Aiming at the search incomplete asynchronous loop of some of GPS data processing software, this paper presented a simple and effective GPS control network search algorithm for automatic asynchronous loop based on boundary nodes. This algorithm drew on ideas of Delaunay triangulation that is through the establishment of Delaunay triangulation, finding all the boundary nodes of the three and above boundary edges on the triangle nets, and in turn searching for the boundary asynchronous loop with boundary nodes and no boundary nodes, then for the asynchronous loop, depending on the number of observation period, giving all of the baseline combination, finally calculating the closed error about boundary asynchronous loop. The software was compiled based on this algorithm and finally GPS horizontal control network for some county was used to demonstrate the feasibility of the method.
出处
《测绘科学》
CSCD
北大核心
2012年第3期31-32,共2页
Science of Surveying and Mapping