.png){kind=icon}
.png){kind=icon}
Return
A graph-based algorithm to define urban topology from unstructured geospatial data
.png){kind=icon}
OA
AI
DOI：10.1080/13658816.2012.756881.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Interpretation and analysis of urban topology are particularly challenging tasks given the complex spatial pattern of the urban elements, and hence their automation is especially needed. In terms of the urban scene meaning, the starting point in this study is unstructured geospatial data, i.e. no prior knowledge of the geospatial entities is assumed. Translating these data into more meaningful homogeneous regions can be achieved by detecting geographic features within the initial random collection of geospatial objects, and then by grouping them according to their spatial arrangement. The techniques applied to achieve this are those of graph theory applied to urban topology analysis within GIS environment. This article focuses primarily on the implementation and algorithmic design of a methodology to define and make urban topology explicit. Conceptually, such procedure analyses and interprets geospatial object arrangements in terms of the extension of the standard notion of the topological relation of adjacency to that of containment: the so-called containment-first search'. LiDAR data were used as an example scenario for development and test purposes.
Keywords:
urban topology
graph theory
scene analysis
GIS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.1
Papers:
2.7K
Citations:
9.3K
View more organizations