共查询到20条相似文献，搜索用时 31 毫秒
7.
The objective of this study is the production and visualization of an emotional map to reveal the unique emotions inherent to the areas surrounding the Yeongsan River, which is often referred to as ‘the cradle of civilization’ in Korea. The sites selected for this study are the 11 cities and districts (5667.6 km 2) that cut across the vast granary in the southeastern region of Korea, near the Yeongsan River. The emotional map was produced by extracting features of historical and cultural heritage distributed throughout this region and by using a geographic information systems program and its functions for spatial analysis. A database was constructed through interviews with locals and Global Positioning System to index 4318 pieces of cultural heritage to achieve the visualization of emotions. Among the 558 historical relics considered for representing the regional culture, 100 with the largest emotional impact were selected. It was determined that loyalty ( ), justice ( ), courtesy ( ), resentment ( ), and anger ( ) should be the major emotional elements. Methodologically, a set of regional, periodic, historical, and emotional classification codes were first systematized. After subjecting this data to inverse distance weight interpolation and vertical exaggeration coefficients, the three-dimensional emotional map could be visualized. 相似文献
12.
Abstract We present the notion of a natural tree as an efficient method for storing spatial information for quick access. A natural tree is a representation of spatial adjacency, organised to allow efficient addition of new data, access to existing data, or deletions. The nodes of a natural tree are compound elements obtained by a particular Delaunay triangulation algorithm. Improvements to that algorithm allow both the construction of the triangulation and subsequent access to neighbourhood information to be O( N log N). Applications include geographical information systems, contouring, and dynamical systems reconstruction. 相似文献
14.
Urban spatial structure in large cities is becoming ever more complex as populations grow in size, engage in more travel, and have increasing amounts of disposable income that enable them to live more diverse lifestyles. These trends have prominent and visible effects on urban activity, and cities are becoming more polycentric in their structure as new clusters and hotspots emerge and coalesce in a wider sea of urban development. Here, we apply recent methods in network science and their generalization to spatial analysis to identify the spatial structure of city hubs, centers, and borders, which are essential elements in understanding urban interactions. We use a ‘big’ data set for Singapore from the automatic smart card fare collection system, which is available for sample periods in 2010, 2011, and 2012 to show how the changing roles and influences of local areas in the overall spatial structure of urban movement can be efficiently monitored from daily transportation. In essence, we first construct a weighted directed graph from these travel records. Each node in the graph denotes an urban area, edges denote the possibility of travel between any two areas, and the weight of edges denotes the volume of travel, which is the number of trips made. We then make use of (a) the graph properties to obtain an overall view of travel demand, (b) graph centralities for detecting urban centers and hubs, and (c) graph community structures for uncovering socioeconomic clusters defined as neighborhoods and their borders. Finally, results of this network analysis are projected back onto geographical space to reveal the spatial structure of urban movements. The revealed community structure shows a clear subdivision into different areas that separate the population’s activity space into smaller neighborhoods. The generated borders are different from existing administrative ones. By comparing the results from 3 years of data, we find that Singapore, even from such a short time series, is developing rapidly towards a polycentric urban form, where new subcenters and communities are emerging largely in line with the city’s master plan. To summarize, our approach yields important insights into urban phenomena generated by human movements. It represents a quantitative approach to urban analysis, which explicitly identifies ongoing urban transformations. 相似文献
15.
Regionalization is a classification procedure applied to spatial objects with an areal representation, which groups them into homogeneous contiguous regions. This paper presents an efficient method for regionalization. The first step creates a connectivity graph that captures the neighbourhood relationship between the spatial objects. The cost of each edge in the graph is inversely proportional to the similarity between the regions it joins. We summarize the neighbourhood structure by a minimum spanning tree (MST), which is a connected tree with no circuits. We partition the MST by successive removal of edges that link dissimilar regions. The result is the division of the spatial objects into connected regions that have maximum internal homogeneity. Since the MST partitioning problem is NP‐hard, we propose a heuristic to speed up the tree partitioning significantly. Our results show that our proposed method combines performance and quality, and it is a good alternative to other regionalization methods found in the literature. 相似文献
16.
Building generalization is a difficult operation due to the complexity of the spatial distribution of buildings and for reasons of spatial recognition. In this study, building generalization is decomposed into two steps, i.e. building grouping and generalization execution. The neighbourhood model in urban morphology provides global constraints for guiding the global partitioning of building sets on the whole map by means of roads and rivers, by which enclaves, blocks, superblocks or neighbourhoods are formed; whereas the local constraints from Gestalt principles provide criteria for the further grouping of enclaves, blocks, superblocks and/or neighbourhoods. In the grouping process, graph theory, Delaunay triangulation and the Voronoi diagram are employed as supporting techniques. After grouping, some useful information, such as the sum of the building's area, the mean separation and the standard deviation of the separation of buildings, is attached to each group. By means of the attached information, an appropriate operation is selected to generalize the corresponding groups. Indeed, the methodology described brings together a number of well-developed theories/techniques, including graph theory, Delaunay triangulation, the Voronoi diagram, urban morphology and Gestalt theory, in such a way that multiscale products can be derived. 相似文献
18.
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( nlog n)). 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%. 相似文献
19.
Recently, the Chinese government raised an urban planning policy which suggests communities open their private roads for public transport and establish street networks with high spatial density in cities. In this context, the purpose of this study is to analyze the potential changes to street network accessibility using GIS techniques and to provide spatial information that may influence the decision making of urban managers. In addition to the existing street network data in the case study city, Shenzhen, intra-community roads are extracted from building footprints in GIS topographic database and used to construct a potential street network with respect to the community opening policy. An automatic GIS-based method is proposed here to analyze the location advantage information in the simulated urban environment, by combining Delaunay triangulation model and graph theory concepts. Specifically, we establish a two-step framework based on the spatial relationships between roads and buildings. Firstly, intra-community roads between neighboring building footprints are generated using a Delaunay triangulation skeleton model, and with the existing inter-community roads they form the simulated network. Secondly, street centrality indices of the current and simulated networks are compared in terms of closeness, betweenness and straightness. Results indicate that after applying the policy the global accessibility in the city would be increased at some places and decreased at others, and places' directness among others would be generally improved. In addition, the skeleton of central routes for through traffic would not change much. The presented method can also be applied to other cities. 相似文献
20.
Geographic data themes modelled as planar partitions are found in many GIS applications (e.g. topographic data, land cover, zoning plans, etc.). When generalizing this kind of 2D map, this specific nature has to be respected and generalization operations should be carefully designed. This paper presents a design and implementation of an algorithm to perform a split operation of faces (polygonal areas). The result of the split operation has to fit in with the topological data structure supporting variable-scale data. The algorithm, termed SPLITAREA, obtains the skeleton of a face using a constrained Delaunay triangulation. The new split operator is especially relevant in urban areas with many infrastructural objects such as roads. The contribution of this work is twofold: (1) the quality of the split operation is formally assessed by comparing the results on actual test data sets with a goal/metric we defined beforehand for the ‘balanced’ split and (2) the algorithm allows a weighted split, where different neighbours have different weights due to different compatibility. With the weighted split, the special case of unmovable boundaries is also explicitly addressed. The developed split algorithm can also be used outside the generalization context in other settings. For example, to make two cross-border data sets fit, the algorithm could be applied to allow splitting of slivers. 相似文献
|
