Please use this identifier to cite or link to this item:
Title: A graph-based algorithm to define urban topology from unstructured geospatial data
Authors: de Almeida, J.-P. 
Morley, J.G. 
Dowman, I.J. 
Keywords: urban topology; graph theory; scene analysis; GIS
Issue Date: 25-Feb-2013
Project: SFRH/BD/9909/2002 - Programa de Formação Avançada FCT 
Serial title, monograph or event: International Journal of Geographical Information Science
Volume: 27
Issue: 8
Abstract: 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.
DOI: 10.1080/13658816.2012.756881
Rights: openAccess
Appears in Collections:I&D INESCC - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
Manuscript_2012_03_13.pdf4.96 MBAdobe PDFView/Open
Show full item record


checked on Jun 25, 2019


checked on Jun 25, 2019

Page view(s) 5

checked on Oct 2, 2019


checked on Oct 2, 2019

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.