检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马林兵[1]
机构地区:[1]中山大学地理科学与规划学院,广东广州510275
出 处:《地理与地理信息科学》2009年第5期39-42,共4页Geography and Geo-Information Science
基 金:"985工程"GIS与遥感的地学应用科技创新平台资助项目(105203200400006)
摘 要:提出一个非均质栅格Voronoi图的生成方法。假定在Voronoi领域扩张中,经过每个栅格的距离权值不相等。由于非均质栅格Voronoi图生成复杂,提出了一种基于A*启发式空间搜索确定每个栅格的归属来产生Voronoi区域的方法。讨论了非均质栅格Voronoi图的基本定义、启发式函数确定、具体生成方法等。利用C#语言实现了所提出的方法,并分析了该方法的时间复杂度。但该方法仅适合于简单点发生元情况,在面向复杂发生元的情况下,需进一步研究更有效的方法。As a comprehensive tool of space partition tool, Voronoi diagram has generated several kind of variation. This paper puts forward a method of creating inhomogeneous raster Voronoi diagram, which considers that the distance weight of each grid is different in the course of grid neighbor expanding. Because of the complexity of creating inhomogeneous raster Voronoi diagram, a new method was developed,in which the Voronoi regions were defined by deciding each grid character through A * heuristic space searching. In the paper, a definition of inhomogeneous raster Voronoi diagram,confirmation of heuristic search function and detailed creating process was given. C # language was employed to implement the creating method and its time complexity was analyzed. The result shows it has better time efficiency by making use of A * heuristic searching algorithms in the inhomogeneous space. But computing time increased rapidly with the number of initial cells increasing,so the method is only fit for the condition of simple point initial cells and a more efficient method of handle non-simple initial cells is needed to be researched in the further work.
分 类 号:P208[天文地球—地图制图学与地理信息工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.46