Adaptive continuity-preserving simplification of street networks
Authors/Creators
- 1. Charles University, Albertov 6, 128 00 Prague, CZ
- 2. University of Copenhagen, Øster Farimagsgade 5A, 1353 Copenhagen, DK
- 3. IT University of Copenhagen, Rued Langgaards Vej 7, 2300 Copenhagen, DK
- 4. Oak Ridge National Laboratory, P.O. Box 2008, 37831 Oak Ridge, TN, USA
Description
While street network data are nearly universally available, their representation is usually transportation-based. However, for many types of analyses, e.g., urban morphology or network science, unprocessed transportation-based street network data is unsuitable, making a cumbersome manual simplification process necessary. To address this challenge, in this paper we propose an algorithm for simplification of street networks, based on the detection of network portions that need to be simplified, and continuity-preserving heuristics that generate new geometries. The algorithm, released in the open-source Python package neatnet, facilitates the generation of morphological networks and generalises to various geographical contexts without a need to alter the parameters, while offering better performance than other available solutions.
Files
gisruk2025-simplification.pdf
Files
(1.2 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:47fe9f701ee78126d8a6b382464100e6
|
1.2 MB | Preview Download |
Additional details
Software
- Repository URL
- https://github.com/uscuni/neatnet
- Programming language
- Python