一种基于邻近图的植被面要素合并方法  

A Method of Vegetation Polygon Element Merging Based on Adjacent Graph

作　　者：张付兵 孙群[1] 温伯威[1] 马京振 朱新铭 陈晓慧[1] ZHANG Fubing;SUN Qun;WEN Bowei;MA Jingzhen;ZHU Xinming;CHEN Xiaohui(Information Engineering University,Zhengzhou 450001,China)

机构地区：[1]信息工程大学,河南郑州450001

出　　处：《测绘科学技术学报》2024年第5期534-540,共7页Journal of Geomatics Science and Technology

基　　金：国家自然科学基金项目(41801313);中原学者资助项目(202101510001)。

摘　　要：植被面要素合并是面要素制图综合的重要内容。针对现有面要素合并方法在合并过程中缺乏有效邻近关系表达和指导的问题,提出一种基于邻近图的植被面要素邻近关系表达和合并方法。首先,将植被面要素的邻近关系定义为3种类型,制定不同类型邻近关系的探测策略,其次,以节点和链接的形式实现植被面要素邻近关系的图表达,通过邻近图搜索获取邻近群组,最后,对邻近群组执行相对应的合并算法实现植被面要素合并。实验结果表明,邻近图可以正确表达植被面要素之间的邻近关系,有效地指导合并过程,提高合并效率。The merging of vegetation polygon element is an important part of polygon element cartographic generalization.In view of the lack of effective adjacency expression and guidance in the merging process of the existing polygon element merging methods,a method of expressing and merging the adjacent relationship of vegetation polygon element is proposed based on adjacent graph in this paper.Firstly,the adjacent relationship of vegetation polygon element is defined as three types and the detection strategies of different types of adjacent relationship are formulated.Secondly,the graph expression of adjacent relationship of vegetation polygon element is realized in the form of nodes and links and the adjacent groups are obtained through the adjacent graph search.Finally,the corresponding merging algorithm is implemented to merge the vegetation polygon elements.The experimental results show that adjacent graph can correctly express the adjacent relationship between vegetation polygon elements,effectively guide the merging process and improve the merging efficiency.

关 键 词：邻近关系 邻近图 植被面要素 合并 图搜索 

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