Preprocessing open data for optimizing estimation times in urban network analysis: Extracting, filtering, geoprocessing, and simplifying the road-center lines

Hacar, Müslüm, Mara, Federico, Altafini, Diego ORCID: https://orcid.org/0000-0002-6559-2372 and Cutini, Valerio 2024. Preprocessing open data for optimizing estimation times in urban network analysis: Extracting, filtering, geoprocessing, and simplifying the road-center lines. Presented at: 12th International Conference on Innovation in Urban and Regional Planning (INPUT2023), L'Aquila, Italy, 6-8 September 2023. Published in: Marucci, Alessandro, Zullo, Francesco, Fiorini, Lorena and Sagan, Lucia eds. Innovation in Urban and Regional Planning. INPUT 2023. Springer, pp. 551-562. 10.1007/978-3-031-54118-6_49

Full text not available from this repository.

Abstract

Road networks are crucial datasets for urban and regional spatial analysis, yet their large size and complexity make them a computational challenge, particularly for methods such as Space Syntax’ Angular Analysis, which break the network according to road direction changes for more precise potential movement pattern estimations in each road element. This becomes difficult to apply in certain practical situations, for instance, digital twins, due to the considerable time required for modelling, which can pose computational resource limitations. In this study, we propose a rule-based approach for pre-processing OpenStreetMap (OSM) data to construct road networks suitable for Space Syntax analysis. Our approach extracts OSM data within an administrative area of interest from GADM database, filters by regarding tags, and then goes in two directions depending on whether the user prefers to keep semantic tags: preserving intersections or creating an arc-node structure, respectively. Finally, road networks are simplified to reduce the estimated time that the network will take to perform the analysis. We applied this approach to OSM data from six cities in Türkiye and Italy and evaluated in terms of computational time estimation in DepthmapX 0.8. Results show that simplifying road networks as a lane-width (2 m) threshold in Douglas-Peucker algorithm maintains their basic structure (i.e., configuration, morphology, and movement patterns) and relationships between nodes, while reducing computation time significantly. Our approach provides a scalable and efficient solution for urban network analysis and has the potential to be applied in other fields that require the processing of large and complex datasets.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Architecture
Publisher:	Springer
ISBN:	9783031541179
Last Modified:	01 May 2024 09:41
URI:	https://orca.cardiff.ac.uk/id/eprint/168534

Actions (repository staff only)

Edit Item