Cascaded Union Algorithm for Polygon Set Based on Grid
Feng Zhang · Jisuanji gongcheng · 2011
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.