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.      

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

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

任意多边形间方向关系的计算及其可确定问题

提出了一种符合空间认知规律的栅格化处理的任意多边形间方向关系的计算方法，该方法计算结果与人眼的判断结果非常接近，在此基础上讨论了多边形间方向关系的可确定问题，并提出了一种基于8方向隶属零值个数的两个多边形方向关系可确定程度的判定方法。     

Tagging-the-triangle algorithm for partitioning features with inconsistent boundaries

In spatial data sets, gaps or overlaps among features are frequently found in spatial tessellations due to the non-abutting edges with adjacent features. These non-abutting edges in loose tessellations are also called inconsistent boundaries or slivers; polygons containing at least one inconsistent boundary are called inconsistent polygons or sliver polygons. The existing algorithms to solve topological inconsistencies in sliver polygons suffer from one or more of three major issues, namely determination of tolerances, excessive CPU processing time for large data sets and loss of vertex history. In this article, we introduce a new algorithm that mitigates these three issues. Our algorithm efficiently searches the features with inconsistent polygons in a given spatial data set and logically partitions them among adjacent features. The proposed algorithm employs the constrained Delaunay triangulation technique to generate labelled triangles from which inconsistent polygons with gaps and overlaps are identified using label counts. These inconsistent polygons are then partitioned using the straight skeleton method. Moreover, each of these partitioned gaps or overlaps is distributed among the adjacent features to improve the topological consistency of the spatial data sets. We experimentally verified our algorithm using the real land cadastre data set. The comparison results show that the proposed algorithm is four times faster than the existing algorithm for data sets with 200,000 edges.     

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.     

面向自然连续面群边线的协同化简方法

自然连续面群边线化简是地形图中自然面状要素和地理国情普查数据中自然图斑自动制图综合的重要实施步骤。现有面要素边线化简算法大多以线化简算法为基础,未有效化简弯曲特征、保持面积平衡和满足图面视觉清晰性要求,且化简结果存在共享边界不一致、边线自相交和边线之间相交的拓扑问题。为此,结合自然连续面群表达特点和化简要求,本文提出一种面向自然连续面群边线的协同化简方法。首先将自然连续面群转换为拓扑数据结构组织,以待化简弧段及其相邻弧段为基础构建约束Delaunay三角网,标识化简区域;其次利用弧段双侧层次多叉树模型渐进式退化条带状弯曲、化简细小弯曲;最后自适应夸大狭窄“瓶颈”,实现边线的协同化简。以河南省某区域1:5万地形图中的植被与土质面要素进行化简实验,相较于对比方法,该方法能够有效保持自然连续面群边线化简前后的拓扑一致性、要素之间的面积平衡,充分化简目标尺度下的局部不清晰细节,化简结果精度高。     

Perennial frost blisters of the outer Mackenzie Delta,western Arctic coast,Canada

Saturated floodplains in Arctic deltas provide conditions favourable for frost mound growth. Little work has been reported from these settings to determine the origin of frost mounds and the controls on their distribution, to assess the longevity of individual mounds, or to quantify variation of mound distribution over time. A case study is presented on low mounds in low‐centred syngenetic ice‐wedge polygons of Big Lake Delta Plain, outer Mackenzie Delta. In 2008 and 2009, 12 mounds were examined by drilling to describe their morphologic variations and to investigate their growth processes. The mounds, containing a core of ice 15 to 58 cm thick, were less than 1 m high and 3 · 7 to 8 · 5 m in diameter; other mounds were over 10 m long. Organic inclusions in the ice, bubble densities, electrical conductivity profiles, and ice‐crystal structure indicated that the mounds were hydrostatic frost blisters. Up to six frost blisters were found within individual polygons due to the relatively small volume of water needed to create each mound. Frost‐blister densities, of greater than 1700 km^–2, increased toward the wet centres of alluvial islands down gentle topographic gradients. The frost blisters were perennial, with individuals remaining identifiable on aerial photographs and satellite images for up to 10 years. Frost blisters collapsed along dilation cracks opened by hydrostatic uplift and by thawing from their sides caused by snow drifting and water ponding. Cyclical growth and decay of the mounds may degrade the visible polygonal network over time. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

一种改进的点与多边形关系的叉乘判别法

本文针对叉乘判别法只适用于凸多边形的缺陷提出了改进,将其推广至凹多边形和自相交多边形,改进方法利用叉乘值的正负变化,选择对点的积分路径,从而判断是否有闭合的路径包围被测点。并通过检测多边形是否环绕被测点,判断点与多边形的关系,属于非零环绕数法。经过实验,改进方法被证明有较快的速度和较强的适应性。     

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

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