最小独立闭合环及水准支线自动搜索算法研究

Discussion on searching algorithm of least independent loops and leveling branch line

针对原有深度优先算法存在因水准路线曲折造成的最小独立闭合环搜索失真的问题,该文提出一种最小独立闭合环搜索算法:通过引入水准点平面坐标信息,采用逐步回代思想实现对水准网最小独立闭合环的准确搜索;考虑到水准网中极有可能存在无法构成最小独立闭合环的水准支线的情形,在搜索最小独立闭合环的同时,兼顾提取出水准支线的信息。通过对2012年天津市地面沉降水准数据进行最小独立闭合环搜索,并结合人工拼环的结果加以印证,对比分析结果表明:在水准网较为复杂的情况下,该算法可有效避免原有深度优先算法搜索失真的问题,同时准确搜索出水准支线。

Aiming at the problem that the searching of least independent loops by existed depth-first algorithm is probably incorrect due to some twisty leveling lines, the paper proposed an improved search- ing algorithm of least independent loops： through introducing the plane coordinate data, the algorithm which comes from step back substitution idea could precisely search the least independent loops in the lev- eling network; moreover, considering branch lines probably existed in the network, the algorithm could extract the information of branch lines. Experimental result showed that the proposed algorithm would im- prove the searching accuracy and find out the leveling branch lines, which make the leveling network joint works more convenient and reliable.