冯琰, 张正禄, 罗年学. 最小独立闭合环与附合导线的自动生成算法[J]. 武汉大学学报 ( 信息科学版), 1998, 23(3): 255-259.
引用本文: 冯琰, 张正禄, 罗年学. 最小独立闭合环与附合导线的自动生成算法[J]. 武汉大学学报 ( 信息科学版), 1998, 23(3): 255-259.
Feng Yan, Zhang Zhenglu, Luo Nianxue. Algorithms to Produce Least Independent Close Loops and Connecting Traverses Automatically[J]. Geomatics and Information Science of Wuhan University, 1998, 23(3): 255-259.
Citation: Feng Yan, Zhang Zhenglu, Luo Nianxue. Algorithms to Produce Least Independent Close Loops and Connecting Traverses Automatically[J]. Geomatics and Information Science of Wuhan University, 1998, 23(3): 255-259.

最小独立闭合环与附合导线的自动生成算法

Algorithms to Produce Least Independent Close Loops and Connecting Traverses Automatically

  • 摘要: 应用图论理论,直接根据控制网平差的基于测站的网点信息和观测值文件,提出了最小独立闭合环自动生成的逐步回代法和附合导线自动生成的组合法,并编程予以实现。最后用实例验证了算法的正确性和用之进行观测值质量检核的有效性。

     

    Abstract: In order to meet the needs of users and to improve the data processing function in control surveying,we have proposed two algorithms in this paper based on graph theory.According to the observation file of control network,one is the step-by-step back-substitution algorithm,with which a set of least independent close loops in control network can be produced automatically.And the other in called combination algorithm,which is used to produce the connecting traverses.The corresponding program is developed.Finally,illustrations are given to show that the proposed algorithms are valid and effective.

     

/

返回文章
返回