基于格网的多边形集合级联求并算法  

Cascaded Union Algorithm for Polygon Set Based on Grid

作　　者：张华鑫[1,2] 刘南[1] 刘仁义[2] 尹天鹤[1,2] 张丰[1,2] 

机构地区：[1]浙江大学浙江省资源与环境重点实验室,杭州310028 [2]浙江大学地理信息科学研究所,杭州310027

出　　处：《计算机工程》2011年第6期38-40,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2009AA12Z222;2007AA12Z182);浙江省重点攻关基金资助项目(2009C33011);浙江省自然科学基金资助项目(Y5090130);教育部博士点基金资助项目(200803350017)

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

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

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]