首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 46 毫秒
1.
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.  相似文献   

2.
Polygonal vector data are important for representing countries, lakes, residential settlements, and other polygonal features. The proper representation of polygonal vector data is the basis of efficient rendering and picking and quick access and display of the analysis results based on polygons (e.g., 3D overlaying and surface area measurement in mountainous areas) in a virtual globe. However, polygonal vector data are displayed using texture-based or boundary-based approaches in most existing virtual globes. The texture-based approach cannot easily support interactive operations (e.g., picking) and spatial analysis (e.g., adjacency analysis and spatial measurement). The boundary-based approach treats the holes as independent features; however, it is difficult to recognize which boundaries constitute a polygon. Further research is needed on how to better organize the polygons to support efficient rendering, picking, and analysis in a virtual globe. In this article, we propose two methods to drape interior filled 2D polygons onto a multi-resolution 3D terrain. Both proposed methods combine polygon clipping and polygon triangulation. The difference between the two methods is in the way holes are eliminated. Method 1 recursively subdivides a terrain triangle until the child-triangles contain no holes; every resulting clipped polygon, which is then triangulated, contains no holes. Method 2 directly clips a polygon against a terrain triangle and creates bridge edges to transform the resulting polygons with holes to degenerate polygons that are further triangulated. The experimental results demonstrate that both proposed methods can efficiently process polygons with holes resulting in appropriate numbers of triangles. The processed interior-filled polygons remain close to the terrain surface in a virtual globe. Both proposed methods support real-time rendering of polygonal vector data in a virtual globe.  相似文献   

3.
Facility placement and associated service coverage are major concerns in urban and regional planning. In this paper an approach is detailed for the problem of covering spatial demand for service, where potential facilities are located in the continuous plane. It is shown that weighted demand, represented as points, lines or polygons, can be optimally served by a finite number of potential facility locations, called the polygon intersection point set (PIPS). The developed approach is an extension of a point‐based abstraction of demand to more general representations (e.g. points, lines or polygons). An empirical analysis of warning siren siting in Ohio is carried out, highlighting the applicability of this approach.  相似文献   

4.
基于钻孔点集Voronoi 图的矿产储量新算法   总被引：6，自引：0，他引：6  
该文在分析平面点集Voronoi图特性及其生成算法的基础上,针对传统矿产储量计算方法的不足,提出了一种新的方法。该法以钻孔平面点集的Voronoi图为基础,利用Voronoi多边形的势力范围特性,实现了任意区域内矿床体积与矿产储量的计算。并给出了以Delphi编程实现的系统界面与计算实例,讨论了基于钻孔三维点集的Voronoi体进行矿产品位与经济可采性分析的前景。  相似文献   

5.
Qualitative knowledge representation of spatial locations and relations is popular in many text-based media, for example, postings on social networks, news reports, and encyclopedia, as representing qualitative spatial locations is indispensable to infer spatial knowledge from them. However, an integrative model capable of handling direction-based locations of various spatial objects is missing. This study presents an integrative representation and inference framework about direction-based qualitative locations for points, lines, and polygons. In the framework, direction partitions of different types of reference objects are first unified to create a partition consisting of cells, segments, and corners. They serve as a frame of reference to locate spatial objects (e.g., points, lines, and polygons). Qualitative relations are then defined to relate spatial objects to the elements in a cell partition, and to form the model of qualitative locations. Last, based on the integrative representation, location-based reasoning mechanism is presented to derive topological relations between objects from their locations, such as point–point, line–line, point–line, point–polygon, line–polygon, and polygon–polygon relations. The presented model can locate any type of spatial objects in a frame of reference composed of points, lines, and polygons, and derive topological relations between any pairs of objects from the locations in a unified method.  相似文献   

6.
中国省级人口增长率及其空间关联分析   总被引：38，自引：0，他引：38  
分析了1982－1990年和1990－1998年2个时期的人口增长率，并用空间统计分析方法研究了2个时期人口增长率的空间关联关系。1982－1990年中国可分为北部人口低增长、中西部高人口增长率、中东部低人口增长率和南部高人口增长率等4个区域，1990－1998年中国可分为北部低人口增长率和南部高人口增长率2个区域，2个时期的空间聚类虽然不完全相同，但它们有共同的特点，南部和西部的人口增长率都比较高，北部地区的人口增长率都比较低，但它们有共同的特点，南部和西部的人口增长率都比较高，北部地区的人口增长率都比较低。最后对实证研究的结果进行了分析。  相似文献   

7.
  相似文献   

8.
A new method is illustrated for describing the characteristics of urban pattern changes over different time periods. This method employs vector geometry, paired centroids, shared boundary lines, and overlain polygons. Three new statistics are proposed for characterizing local polygon feature changes in quantity, shape, and size. These statistics are standardized, based on conventional theories from urban geography such as directional concentric zones and user‐designated corridors to document both regional and global patterns of land‐use change. This method is used to analyse land‐use changes in metropolitan Detroit between 1990 and 2000. The Detroit case study indicates that the CTSPA statistics are effective in describing urban spatial pattern changes and in characterizing the evolution of discrete urban landscapes over selected periods.  相似文献   

9.
As positional error is a major issue in the assessment of spatial data quality, its propagation has been studied widely in map overlaying. However, few studies deal with a manifest consequence of positional error in map overlaying, namely sliver polygons. Sliver polygons are generally treated as awkward by-products that need to be removed quickly. Nevertheless, as they represent spurious areas, their nature and properties carry useful information, for example, for land use/cover assessment. Therefore, next to sliver removal, there is a need for intelligent detection and eventually further analysis of sliver polygons. This article proposes a general, semi-automated method for the assessment of slivers in vector polygon layers. A case study in Flanders (Belgium) illustrates a possible application in area estimation evaluation of land use allocation classes.  相似文献   

10.
In the map of geo-referenced population and cases, the detection of the most likely cluster (MLC), which is made up of many connected polygons (e.g., the boundaries of census tracts), may face two difficulties. One is the irregularity of the shape of the cluster and the other is the heterogeneity of the cluster. A heterogeneous cluster is referred to as the cluster containing depression links (a polygon is a depression link if it satisfies two conditions: (1) the ratio between the case number and the population in the polygon is below the average ratio of the whole map; (2) the removal of the polygon will disconnect the cluster). Previous studies have successfully solved the problem of detecting arbitrarily shaped clusters not containing depression links. However, for a heterogeneous cluster, existing methods may generate mistakes, for example, missing some parts of the cluster. In this article, a spatial scanning method based on the ant colony optimization (AntScan) is proposed to improve the detection power. If a polygon can be simplified as a node, the research area consisting of many polygons then can be seen as a graph. So the detection of the MLC can be seen as the search of the best subgraph (with the largest likelihood value) in the graph. The comparison between AntScan, GAScan (the spatial scan method based on the genetic optimization), and SAScan (the spatial scan method based on the simulated annealing optimization) indicates that (1) the performance of GAScan and SAScan is significantly influenced by the parameter of the fraction value (the maximum allowed size of the detected cluster), which can only be estimated by multiple trials, while no such parameter is needed in AntScan; (2) AntScan shows superior power over GAScan and SAScan in detecting heterogeneous clusters. The case study on esophageal cancer in North China demonstrates that the cluster identified by AntScan has the larger likelihood value than that detected by SAScan and covers all high-risk regions of esophageal cancer whereas SAScan misses some high-risk regions (the region in the southwest of Shandong province, eastern China) due to the existence of a depression link.  相似文献   

11.
提出GIS多边形倒金字塔模型,拓展了模型能够支持的数据结构与适用范围,使其可以应用于普通GIS电子地图中,为采用预生成不同比例尺图面多分辨率表达无极比例尺图形显示技术提供了模型支持,并给出了建模方法,使普通GIS多边形的无极比例尺显示可以依据精度标准进行局部更新和无冗余存储。  相似文献   

12.
ABSTRACT

The aim of this article is to describe a convenient but robust method for defining neighbourhood relations among buildings based on ordinary Delaunay diagrams (ODDs) and area Delaunay diagrams (ADDs). ODDs and ADDs are defined as a set of edges connecting the generators of adjacent ordinary Voronoi cells (points representing centroids of building polygons) and a set of edges connecting two centroids of building polygons, which are the generators of adjacent area Voronoi cells, respectively. Although ADDs are more robust than ODDs, computation time of ODDs is shorter than that of ADDs (the order of their computation time complexity is O(nlogn)). If ODDs can approximate ADDs with a certain degree of accuracy, the former can be used as an alternative. Therefore, we computed the ratio of the number of ADD edges to that of ODD edges overlapping ADDs at building and regional scales. The results indicate that: (1) for approximately 60% of all buildings, ODDs can exactly overlap ADDs with extra ODD edges; (2) at a regional scale, ODDs can overlap approximately 90% of ADDs with 10% extra ODD edges; and (3) focusing on judging errors, although ADDs are more accurate than ODDs, the difference is only approximately 1%.  相似文献   

13.
Multicriteria analysis is a set of mathematical tools and methods allowing the comparison of different alternatives according to many criteria, often conflicting, to guide the decision maker towards a judicious choice. Multicriteria methods are used in spatial context to evaluate and compare spatial decision alternatives, often modeled through constraint‐based suitability analysis and represented by point, line, and polygon features or their combination, and evaluated on several space‐related criteria, to select a restricted subset for implementation. Outranking methods, a family of multicriteria methods, may be useful in spatial decision problems, especially when ordinal evaluation criteria are implied. However, it is recognized that these methods, except those devoted to multicriteria classification problems, are subject to computational limitations with respect to the number of alternatives. This paper proposes a framework to facilitate the incorporation and use of outranking methods in geographical information systems (GIS). The framework is composed of two phases. The first phase allows producing a planar subdivision of the study area obtained by combining a set of criteria maps; each represents a particular vision of the decision problem. The result is a set of non‐overlapping spatial units. The second phase allows constructing decision alternatives by combining the spatial units. Point, line and polygon feature‐based decision alternatives are then constructed as an individual, a grouping of linearly adjacent or a grouping of contiguous spatial units. This permits us to reduce considerably the number of alternatives, enabling the use of outranking methods. The framework is illustrated through the development of a prototype and through a step‐by‐step application to a corridor identification problem. This paper includes also a discussion of some conceptual and technical issues related to the framework.  相似文献   

14.
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.  相似文献   

15.
This paper presents a development of the extended Cellular Automata (CA), a Voronoi-based CA, to model dynamic interactions among spatial objects. Cellular automata are efficient models for representing dynamic spatial interactions. A complex global spatial pattern is generated by a set of simple local transition rules. However, its original definition for a two-dimensional array limits its application to raster spatial data only. This paper presents a newly developed Voronoi-based CA in which the CA is extended by using the Voronoi spatial model as its spatial framework. The Voronoi spatial model offers a ready solution to handling neighbourhood relations among spatial objects dynamically. By implementing this model, we have demonstrated that the Voronoi-based CA can model local interactions among spatial objects to generate complex global patterns. The Voronoi-based CA can further model interactions among point, line and polygon objects with irregular shapes and sizes in a dynamic system. Each of these objects possesses its own set of attributes, transition rules and neighbourhood relationships. The Voronoi-based CA models spatial interactions among real entities, such as shops, residential areas, industries and cities. Compared to the original CA, the Voronoi-based CA is a more natural and efficient representation of human knowledge over space.  相似文献   

16.
简单要素模型下多边形叠置分析算法   总被引：1，自引：0，他引：1  
现有的矢量空间叠置分析多采用拓扑模型,要求建立完整的数据拓扑关系。该文采用简单要素模型,以多边形叠置交运算为例,介绍简单要素模型下空间叠置分析的具体实现,着重讨论多边形交运算的交替搜索算法,在线段求交中对连续出入点、重交点等特殊数据进行处理。在实际应用中,该算法可较好解决大规模复杂数据层的叠置交运算,比同规模的拓扑叠置运算效率高。  相似文献   

17.
A spatial modeling technique is proposed to represent boundary uncertainty or gradation on area-class maps using a simple polygon tessellation with designated zones of indeterminacy or transition zones. The transition zone can be conceptualized as a dual of the epsilon band, but is more flexible and allows for a wide range of polygonal configurations, including polygons with sinuous boundaries, spurs, three-way transition zones, and null polygons. The model is specified using the medial axis to capture the general shape characteristics of a transition zone. Graph theoretic representation of an extended version of the medial axis captures key junctions in both shape and classification and is used to identify well-formed transition zones that can be logically and unambiguously handled by the model. A multivariate classification surface is specified by first defining degrees or probabilities of membership at every point on the medial axis and transition zone boundary. Degrees or probabilities of membership at all other points are defined by linear interpolation. The technique is illustrated with an example of a complex transition zone, and a simple isoline representation that can be derived from the model is presented. The proposed modeling technique promises to facilitate expert characterization of soil formations, ecological systems, and other types of areal units where gradation and/or boundary uncertainty are prevalent.  相似文献   

18.
A Monte Carlo approach is used to evaluate the uncertainty caused by incorporating Post Office Box (PO Box) addresses in point‐cluster detection for an environmental‐health study. Placing PO Box addresses at the centroids of postcode polygons in conventional geocoding can introduce significant error into a cluster analysis of the point data generated from them. In the restricted Monte Carlo method I presented in this paper, an address that cannot be matched to a precise location is assigned a random location within the smallest polygon believed to contain that address. These random locations are then combined with the locations of precisely matched addresses, and the resulting dataset is used for performing cluster analysis. After repeating this randomization‐and‐analysis process many times, one can use the variance in the calculated cluster evaluation statistics to estimate the uncertainty caused by the addresses that cannot be precisely matched. This method maximizes the use of the available spatial information, while also providing a quantitative estimate of the uncertainty in that utilization. The method is applied to lung‐cancer data from Grafton County, New Hampshire, USA, in which the PO Box addresses account for more than half of the address dataset. The results show that less than 50% of the detected cluster area can be considered to have high certainty.  相似文献   

19.
基于道路网络的商业网点市场域分析   总被引：6，自引：0，他引：6  
社会经济活动中人们的空间行为往往是基于道路网络来实现的。但是,目前多数研究都假设地理空间是一个均质空间,采用基于平面欧氏距离的空间分析方法,这是有局限的。本文阐述了基于网络距离的网络Voronoi图基本概念和实现方法,以武汉市商业零售连锁企业为例,分别采用基于欧氏距离的普通Voronoi图方法和基于网络距离的网络Voronoi图方法来确定商业零售网点的市场域,结果表明武汉市主城区商业网点市场域较小、主城区外围市场域较大。市场域大小与城市路网密度呈现一定相关关系,路网密度高、市场域小,路网密度低、市场域大。两种方法的计算结果存在一定差异,差异大小与路网密度有关,路网密度大、差异小,路网密度小、差异大。这表明在路网密度大的情况下,可以采用普通Voronoi图粗略地模拟商业网点的市场域。  相似文献   

20.
Quantization of spatial objects, which usually means vector‐to‐raster conversion in GIS and remote sensing, is a basic operation used for handling spatial data from data creation to visualization. Since quantization is an approximation of spatial objects, it inevitably yields errors in measuring their properties such as area, perimeter, diameter, and so forth. This paper discusses the accuracy of a quantized Voronoi diagram, a spatial tessellation generated from a set of points. A measure is proposed to evaluate the accuracy of the area of Voronoi regions calculated after quantization. In one‐dimensional space the measure is expressed as an explicit function of the expected number of generators in a cell. In two‐dimensional space, on the other hand, the measure is defined by an implicit function, whose approximation is derived in an explicit form. These functions permit us to evaluate the accuracy of quantization in relation to the size of lattice cells and the density of Voronoi generators. This leads to an appropriate choice of a lattice to keep the quality of a quantized Voronoi diagram at a desirable level.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号