Cross-scale analysis of cluster correspondence using different operational neighborhoods

Cluster correspondence analysis examines the spatial autocorrelation of multi-location events at the local scale. This paper argues that patterns of cluster correspondence are highly sensitive to the definition of operational neighborhoods that form the spatial units of analysis. A subset of multi-location events is examined for cluster correspondence if they are associated with the same operational neighborhood. This paper discusses the construction of operational neighborhoods for cluster correspondence analysis based on the spatial properties of the underlying zoning system and the scales at which the zones are aggregated into neighborhoods. Impacts of this construction on the degree of cluster correspondence are also analyzed. Empirical analyses of cluster correspondence between paired vehicle theft and recovery locations are conducted on different zoning methods and across a series of geographic scales and the dynamics of cluster correspondence patterns are discussed.      

基于最短路径的扩展泰森多边形建立

由于传统的泰森多边形是对空间不考虑路径距离的一种分割方式，使得其在很多领域的应用受到了限制，尤其是在城市规划和沿路径分析等方面表现更为突出。针对这种情况，文中提出一种基于最短路径的扩展泰森多边形的建立方法，并对这种泰森多边形的应用前景提出了自己的看法。     

自动搜索最小多边形算法的研究

多边形的自动搜索是ＧＩＳ空间分析的基本算法之一，同时也在地籍拆宗、导线网闭合环的闭合差计算等领域有着重要的作用。本文依据一般的图形数据结构，提出了一种结点标记的搜索算法，利用该算法可自动搜索出所有独立的最小多边形。     

遥感影像制图综合的智能化研究

本文以人工智能为基础,用计算机模拟一般制图人员对遥感图像进行制图综合的过程,用框架的知识表示方法建立了一个实验性的知识库,并设计了一个推理机。对蒙古人民共和国乌布苏淖尔地区的ＴＭ分类图进行了实验,取得了较好的效果。     

Combining spatial data with survey data improves predictions of boundaries between settlements

Studies of land-use change often require the combination of socioeconomic survey data with spatially continuous maps of land-cover change. One approach is to define maps of land ownership, assuming that all land-use change can be attributed to the owners or managers of each parcel of land. Unfortunately, records of administrative boundaries between towns and villages are commonly unavailable in developing countries and prohibitively costly or time consuming to map for individual projects. However, point locations of the settlements themselves can be obtained easily from existing maps or remotely-sensed imagery. In this paper we compare three methods – circular buffers, unweighted Voronoi polygons (sometimes referred to as Thiessen polygons) and multiplicatively weighted Voronoi polygons – for estimating boundaries between villages in an agricultural landscape in West Africa. The benefits and limitations of each approach are discussed, and their accuracy assessed using 98 independently collected GPS coordinates of village boundaries. We present a novel method for generating and optimising weights for multiplicatively weighted Voronoi polygons using survey data of village sizes from a subset of villages. By using both spatial information and survey data from villages, we show that multiplicatively weighted Voronoi polygons outperform other methods of predicting village boundaries, and increase the correlation coefficient between surveyed village area and mapped areas from 0.18 to 0.68 compared with more commonly used unweighted Voronoi polygons. Our method of weighting Voronoi polygons can be implemented with data and software commonly available to researchers and non-governmental organisations.     

A spatial genetic algorithm for automating land partitioning

Land fragmentation is a widespread situation which may often hinder agricultural development. Land consolidation is considered to be the most effective land management planning approach for controlling land fragmentation and hence improving agricultural efficiency. Land partitioning is a basic process of land consolidation that involves the subdivision of land into smaller sub-spaces subject to a number of constraints. This paper explains the development of a module called LandParcelS (Land Parcelling System) that is a part of an integrated planning and decision support system called LACONISS (LAndCONsolidation Integrated Support System) which has been developed to assist land consolidation planning in Cyprus. LandParcelS automates the land partitioning process by designing and optimising land parcels in terms of their shape, size and value. The methodology integrates geographical information systems and a genetic algorithm that has been applied to two land blocks that are part of a larger case study area in Cyprus. Partitioning is treated as either a single or multi-objective problem for various optimisation cases. The results suggest that a step forward has been made in solving this complex spatial problem, although further research is needed to improve the algorithm. This approach may have relevance to other spatial planning tasks that involve single or multi-objective optimisation problems, especially those dealing with space partitioning.     

泰森多边形在地质数据去丛聚中的应用

钻井总是被优先设计在有利储层的部位,导致获取的地质数据分布不均匀。为了使地质数据的统计结果更客观地反映实际情况,需要对地质数据进行去丛聚处理,其核心思想就是给密集的数据赋较小的权值,给稀疏的数据赋较大的权值。笔者用泰森多边形法求取钻井的控制范围,以此确定该井数据统计时的权值大小,为多边形去丛聚法中多边形的确定提供了新思路。应用本方法对石南油田某井区的孔隙度分布进行了分析,验证了该方法的可行性。     

A parallel method to accelerate spatial operations involving polygon intersections

Polygon intersection is an important spatial data-handling process, on which many spatial operations are based. However, this process is computationally intensive because it involves the detection and calculation of polygon intersections. We addressed this computation issue based on two perspectives. First, we improved a method called boundary algebra filling to efficiently rasterize the input polygons. Polygon intersections were subsequently detected in the cells of the raster. Owing to the use of a raster data structure, this method offers advantages of reduced task dependence and improved performance. Based on this method, we developed parallel strategies for different procedures in terms of workload decomposition and task scheduling. Thus, the workload across different parallel processes can be balanced. The results suggest that our method can effectively accelerate the process of polygon intersection. When addressing datasets with 1,409,020 groups of overlapping polygons, our method could reduce the total execution time from 987.82 to 53.66 s, thereby obtaining an optimal speedup ratio of 18.41 while consistently balancing the workloads. We also tested the effect of task scheduling on the parallel efficiency, showing that reducing the total runtime is effective, especially for a lower number of processes. Finally, the good scalability of the method is demonstrated.     

安徽淮北平原史前文化遗址Thiessen多边形分析

通过生成遗址点的Thiessen多边形,结合应用小多边形的概念及理论,综合分析了安徽淮北平原地区史前文化遗址的聚集状况以及该地区在石山子文化时期、大汶口文化时期和龙山文化时期的农业状况、生存环境及交通等特征。结果表明:用Thiessen多边形空间分析方法可以有效确定聚落中心,并合理推测史前时期农业、生存环境和交通等人地关系状况。从石山子到龙山文化时期,小多边形数量不断增加反映出聚落聚集程度和文化交流水平的提高,大汶口和龙山文化时期淮北平原中部明显是区域内聚落的中心,且多边形中心到边的距离逐渐减小说明先民对农业的依赖程度及农业发展水平也在不断提高。淮北平原史前文化发展受环境变化影响,从石山子到龙山文化时期,气候条件逐渐趋于干旱,沼泽萎缩,气温变化不大,这种环境条件十分有利于先民的生产生活,不仅遗址和小多边形数量不断增多,而且在平原中部和淮河干流沿岸地区出现了多个遗址群和聚落中心,史前文化蓬勃发展,人类适应自然和改造自然的能力提高。从小多边形的分布方向也可以推断出西北—东南向古水系对淮北平原史前遗址之间的交通起控制作用。     

基于初始规划网的镶嵌线自动生成方法研究

针对地理国情普查底图制作过程中数据量大、时间紧、采用传统的镶嵌线生成方法费时费力等问题,提出了基于初始规划网的镶嵌线自动生成法。该方法先利用顾及面要素法和泰森多边形获得初始规划网,然后利用相关系数算法选择最优镶嵌线,最后进行接边纠正。研究表明,该方法可完全满足地理国情普查DOM制作的精度要求,且能大大提高DOM的生产效率。