摘要： 与传统的多边形集合求并算法相比，级联求并法基于STR-Tree索引优先对相邻的多边形进行求并，提高多边形集合的求并效率，但在数据密度高畸变区域的性能较差。针对该问题，提出一种基于格网的多边形集合级联求并算法。该算法利用格网划分多边形集合，缩小数据密度高畸变区域的范围，进一步提高级联求并法的效率。实验结果表明，该算法有效可行。

关键词: 格网, 多边形集合, 级联求并

Abstract: Compared with traditional algorithms for merging a set of polygons, the cascaded union algorithm is more efficient by merging adjacent polygons first based on STR-Tree. However, it has poor performance in high distortion area of data density. To solve this problem, a cascaded union algorithm for polygon set based on grid is proposed. It spilts polygon set by using grid, which can reduce the high distortion area of data density. Experimental results show that the algorithm is feasible and effective.

Key words: grid, polygon set, cascaded union

中图分类号: 

• TP311