基于CDT骨架线的地图目标邻近冲突识别

摘要

制图综合过程中随着比例尺的缩小,不可避免地产生邻近冲突.为了在数字环境下自动地解决这类冲突,首先需要实现这些冲突的自动识别.文中提出一种基于CDT骨架线的地图目标邻近冲突识别方法.该方法首先基于CDT提取地图目标之间空白区域的骨架线;然后沿着每一条骨架线弧段所穿过的三角形路径搜索相邻地图目标之间的冲突区域(宽度小于阈值的三角形集合);最后,从冲突涉及的地图目标、发生冲突的空间位置以及冲突严重程度3个方面给出所识别冲突的定量化描述,从而为邻近冲突的解决提供依据.%In the process of cartographic generalization, duo to the reduction of scales, it is inevitable to encounter proximity conflicts.In order to solve these conflicts automatically in the digital environment, it needs to realize the automatic identification of the conflicts at first.This paper proposeds a method to identify the conflicts on the basis of constrained Delaunay triangulation skeleton.Firstly, the skeleton of white space between neighboring map objects are extracted.Then, the conflict regions between neighboring map objects are identified by using triangular path along each skeleton arc.It is represented by triangular sets with a width less than a threshold.Finally, the quantitative description of the identified conflicts from three aspects is given, including the conflicting map objects, the spatial location of conflict and the degree of conflict, which can provide the basis for the solution of proximity conflicts.