A graph-based algorithm to define urban topology from unstructured geospatial data

• Published in: International journal of geographical information science : IJGIS Vol. 27; no. 8; pp. 1514 - 1529
• Main Authors: de Almeida, J.-P., Morley, J.G., Dowman, I.J.
• Format: Journal Article
• Language: English
• Published: Abingdon Taylor & Francis 01.08.2013; Taylor & Francis LLC
• Subjects: Algorithms; Automation; Geographic information systems; GIS; Graph theory; scene analysis; Topology; Urban areas; urban topology
• ISSN: 1365-8816; 1362-3087; 0269-3798; 1362-3087; 1365-8824
• DOI: 10.1080/13658816.2012.756881

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.