基于余枝搜索的最小独立闭合环自动搜索算法  

A Method of Auto-searching Least Closed Loops Based on Spare Branch

作　　者：谢海燕[1] 王超[1] 

机构地区：[1]上海岩土工程勘察设计研究院有限公司,上海200438

出　　处：《浙江水利水电学院学报》2017年第3期68-71,共4页Journal of Zhejiang University of Water Resources and Electric Power

摘　　要：在控制测量、水准测量数据处理中,为实现快速有效的进行最小独立闭合环的自动搜索,基于生成树和余树,利用数组的存储结构,由余枝两端向外搜索,遇同名点后获得闭合环,再通过闭合环的独立性判断,实现最小独立闭合环的快速有效搜索.进而利用该程序对2011年上海市闸北区水利普查项目中的部分水准测量结果进行进行验证,证明所搜索的闭合环在常规网型中可以有效的做到最小和独立.In the data processing of control surveying and leveling,in order to quickly and effectively carry out auto-search least closed loop,based on spanning tree and spare branch,a 2-D array storage structure is used to search at both ends of spare branch and to get closed loop when meeting the same point. The independent judge of the new closed loop realizes fast and effective auto-searching least closed loops,which is proved to be effective by some leveling results of water census in Zhabei district of Shanghai city.

关 键 词：最小独立闭合环 生成树 自动搜索 算法 

分 类 号：P211[天文地球—测绘科学与技术]