SDS模型化简合并多边形的一个改进算法研究

An Improved Algorithm for SDS Model Based Polygon Simplification and Aggregation

作为自动制图综合中的重要组成部分,多边形化简与合并可用来解决由于制图比例尺减小而带来的多边形与多边形之间以及多边形内部的邻近冲突问题。该方法设计主要基于多边形几何特征、拓扑特征的分析,同时需要一种合适的空间数据模型用于支持多边形与多边形之间,多边形内部的邻近关系探测。为避免分离操作带来的多边形综合结果的不同,在分析了基于Delaunay三角网的SDS模型表达对象邻近关系的能力后,提出了一种统一解决多边形化简和合并的方案,同时对原有的邻近冲突检测方法进行了改进,从而解决了由于边缘尖锐三角形的引入而导致多边形合并和化简后面积大量增大和丢失某些特征点的问题。实验结果表明,该方法可以获得满意的多边形化简合并效果。

Polygon simplification and aggregation play an important role in automatic cartographic generalization, which is used for resolving spatial conflicts caused by reduction in the scale at which cartographic data are plotted. After analyzing the capabilities to detect conflict existed between polygons and in polygons of CDT-based SDR. Authors present a method for polygon simplification and aggregation to avoid the difference caused by separate operator. In this method, an improvement of conflict detection algorithm is applied to avoid the overmuch increase of area and the loss of characteristic vertex during polygon simplification and aggregation, which is caused by involving peaked triangles located at the edge of triangulate mesh. At last authors demonstrate the advantage of this method through experiments.