首页 | 本学科首页   官方微博 | 高级检索  
     

最小独立闭合环与附合导线的自动生成算法
引用本文:冯琰, 张正禄, 罗年学. 最小独立闭合环与附合导线的自动生成算法[J]. 武汉大学学报 ( 信息科学版), 1998, 23(3): 255-259.
作者姓名:冯琰  张正禄  罗年学
作者单位:武汉测绘科技大学地学测量工程学院, 武汉市珞喻路129号, 430079
基金项目:国家测绘局教学研究项目
摘    要:应用图论理论,直接根据控制网平差的基于测站的网点信息和观测值文件,提出了最小独立闭合环自动生成的逐步回代法和附合导线自动生成的组合法,并编程予以实现。最后用实例验证了算法的正确性和用之进行观测值质量检核的有效性。

关 键 词:图论  测量控制网  最小独立闭合环  附合导线  逐步回代法
收稿时间:1997-07-08

Algorithms to Produce Least Independent Close Loops and Connecting Traverses Automatically
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.
Authors:Feng Yan Zhang Zhenglu Luo Nianxue
Affiliation:School of Geo-science and Surveying Engineering, WTUSM, 129 Luoyu Road, Wuhan, China, 430079
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.
Keywords:graph theory  surveying control network  least independent close loop  connection traverse  step by step back substitution algorithm
本文献已被 CNKI 等数据库收录!
点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息
点击此处可从《武汉大学学报(信息科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号