基于无向图的线要素拼接算法  

Algorithm research of disconnection stitching based on undirected graph

作　　者：胡荣明[1] 谢芳[1] 贾建华[1] 

机构地区：[1]西安科技大学测绘科学与技术学院,西安710054

出　　处：《测绘科学》2014年第3期103-106,共4页Science of Surveying and Mapping

基　　金：西安科技大学博士启动基金(A5030823);陕西省教育厅科研计划项目(2013JK0946)

摘　　要：GIS数据在绘制或数据转换的过程中会产生大量断线,这些断线使得拓扑构建和空间分析无法进行。本文在详细分析线数据的特点及产生大量断线原因的基础上,提出了一种基于无向图结构的断线拼接算法。该算法定义了公共端点和待拼接线的数据模型,并以此为基础建立无向图结构,对其进行遍历实现线要素的拼接。实验表明该算法灵活、准确,能大量减少人工干预从而提高工作效率。In the process of data plotting and data converting, GIS data produce a large number of dis- connections which can not make topology construction and spatial analysis be conducted. In this paper, af- ter minutely analyzing the characteristics of the line data and the causes of numerous disconnections, a dis- connection stitching algorithm based on undirected graph structure was proposed. It defined the public point model and the line model, in order to build the undirected graph structure and get disconnection stitching result by its traversal. Experimental result showed that the algorithm would be flexible, accurate and fast to complete disconnection stitching, and reduce manual intervention with high work efficiency.

关 键 词：GIS数据 线要素 断线拼接 无向图 

分 类 号：P208[天文地球—地图制图学与地理信息工程] P283.1[天文地球—测绘科学与技术]