检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王正帅 胡晋山 王爱生 康建荣 WANG Zhengshuai;HU Jinshan;WANG Aisheng;KANG Jianrong(School of Geography,Geodesy and Planning,Jiangsu Normal University,Xuzhou,Jiangsu 221116,China)
机构地区:[1]江苏师范大学地理测绘与城乡规划学院,江苏徐州221116
出 处:《测绘科学》2018年第11期147-151,共5页Science of Surveying and Mapping
基 金:国家自然科学基金项目(41671395;51574132)
摘 要:针对高速铁路CPⅢ高程控制网条件方程列立时易出现的多样性、冗余性和效率低等问题,提出了一种建立条件方程的方法:基于图论将控制网视为连通图,采用广度优先搜索(BFS)获取生成树、余树和父节点矩阵,根据余树枝节点、联测水准点至根点的路径分别构建闭合环、附合路线,并建立对应的条件方程,通过有限次相加或相减运算,即可得到最简形条件方程。实例分析结果表明:该方法列立的条件方程具有唯一性、最简形,且耗时少,有着较高的实用价值。Aiming at the shortcomings of the multiformity,redundancy and inefficiency in establishing conditional equations of high-speed railway CPⅢ vertical control network,a novel method is proposed in this paper.Firstly,the control network was regarded as a connected graph,the spanning tree,cotree and predecessor matrix were obtained via BFS;Secondly,all of the closed loops and annexed leveling lines were found according to the paths from the cotree vertexes and known elevation points to the root,and the corresponding condition equations were respectively established;Finally,the simplest form of conditional equations could be obtained by finite addition or subtraction among the equations.A case study was given and the results show that:the method mentioned above could establish the unique and the simplest conditional equations in less time,and has more practical value.
关 键 词:CPⅢ 高程控制网 条件方程 广度优先搜索(BFS) 图论
分 类 号:P207[天文地球—测绘科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28