计算机工程2011，Vol.37Issue(6)：38-40,3.DOI:10.3969/j.issn.1000-3428.2011.06.014
基于格网的多边形集合级联求并算法
Cascaded Union Algorithm for Polygon Set Based on Grid
摘要
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分类
信息技术与安全科学引用本文复制引用
张华鑫,刘南,刘仁义,尹天鹤,张丰..基于格网的多边形集合级联求并算法[J].计算机工程,2011,37(6):38-40,3.基金项目
国家"863"计划基金资助项目(2009AA12Z222,2007AA12Z182) （2009AA12Z222,2007AA12Z182）
浙江省重点攻关基金资助项目(2009C33011) （2009C33011）
浙江省自然科学基金资助项目(Y5090130) （Y5090130）
教育部博士点基金资助项目(200803350017) （200803350017）
