| 基于多级格网的多边形集合求并算法研究 |
| |
| 引用本文： | 黄志,张哲伦,张丰,陈明,刘仁义.基于多级格网的多边形集合求并算法研究[J].浙江大学学报(理学版),2014,41(1):108-112. |
| |
| 作者姓名： | 黄志 张哲伦 张丰 陈明 刘仁义 |
| |
| 作者单位： | 浙江大学浙江省资源与环境信息系统重点实验室;浙江大学地理信息科学研究所;湖南大学土木工程学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(41001227);国家863计划资助项目(2007AA12Z182,2009AA12Z222);浙江省重点科技攻关计划项目(2009C33011);国家教育部博士点专项基金资助项目(200803350017);浙江省自然科学基金资助项目(Y5090130) |
| |
| 摘 要： | 多边形集合求并效率的高低,关键在于能否根据多边形的相邻程度优化求并顺序.在分析了几种常用求并算法优劣的基础上,提出了基于多级格网的多边形集合求并算法.通过构建多级格网,划分多边形集合,既缩小了多边形畸变区域的范围,也减少了一级格网的密集程度,提高了求并效率.对比实验表明,该算法可行.
|
| 关 键 词： | 多级格网 多边形集合 求并 |
| 收稿时间： | 2012-11-29; |
Union algorithm for polygon set based on multi-level grid |
| |
| HUANG Zhi,＇,ZHANG Zheluna,ZHANG Fengj＇,CHEN MingI ＇,LIU Renyi.Union algorithm for polygon set based on multi-level grid[J].Journal of Zhejiang University(Sciences Edition),2014,41(1):108-112. |
| |
| Authors: | HUANG Zhi ＇ ZHANG Zheluna ZHANG Fengj＇ CHEN MingI ＇ LIU Renyi |
| |
| Institution: | 1. Zhejiang Provincial Key Lab of GIS, Zhejiang University, Hangzhou 310028, China; 2. Department of Geographic Information Sci ence, Zhejiang University, Hangzhou 310027, China; 3. College of Civil Engineering, Hunan University, Changsha 410082, China) |
| |
| Abstract: | The efficiency of merging a set of polygons depends on the order of dissolving according to polygon prox- imity. Based on the analysis of several common union algorithm pros and cons, an union algorithm for polygon set based on multi level grid is proposed. This algorithm spilting polygon set by using multi grid not only narrows the high distortion area of data density, but also reduses the density of the first-level grid. Comparative experiments show the algorithm is more effective. |
| |
| Keywords: | multi-level grid polygon set union |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《浙江大学学报(理学版)》下载免费的PDF全文 |
|
