License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.GISCIENCE.2018.13
URN: urn:nbn:de:0030-drops-93412
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9341/
Niedermann, Benjamin ;
Oehrlein, Johannes ;
Lautenbach, Sven ;
Haunert, Jan-Henrik
A Network Flow Model for the Analysis of Green Spaces in Urban Areas
Abstract
Green spaces in urban areas offer great possibilities of recreation, provided that they are easily accessible. Therefore, an ideal city should offer large green spaces close to where its residents live. Although there are several measures for the assessment of urban green spaces, the existing measures usually focus either on the total size of green spaces or on their accessibility. Hence, in this paper, we present a new methodology for assessing green-space provision and accessibility in an integrated way. The core of our methodology is an algorithm based on linear programming that computes an optimal assignment between residential areas and green spaces. In a basic setting, it assigns a green space of a prescribed size exclusively to each resident such that the average distance between residents and assigned green spaces is minimized. We contribute a detailed presentation on how to engineer an assignment-based method such that it yields reasonable results (e.g., by considering distances in the road network) and becomes efficient enough for the analysis of large metropolitan areas (e.g., we were able to process an instance of Berlin with about 130000 polygons representing green spaces, 18000 polygons representing residential areas, and 6 million road segments). Furthermore, we show that the optimal assignments resulting from our method enable a subsequent analysis that reveals both interesting global properties of a city as well as spatial patterns. For example, our method allows us to identify neighborhoods with a shortage of green spaces, which will help spatial planners in their decision making.
BibTeX - Entry
@InProceedings{niedermann_et_al:LIPIcs:2018:9341,
author = {Benjamin Niedermann and Johannes Oehrlein and Sven Lautenbach and Jan-Henrik Haunert},
title = {{A Network Flow Model for the Analysis of Green Spaces in Urban Areas}},
booktitle = {10th International Conference on Geographic Information Science (GIScience 2018)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-083-5},
ISSN = {1868-8969},
year = {2018},
volume = {114},
editor = {Stephan Winter and Amy Griffin and Monika Sester},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9341},
URN = {urn:nbn:de:0030-drops-93412},
doi = {10.4230/LIPIcs.GISCIENCE.2018.13},
annote = {Keywords: urban green, transportation problem, maximum flow, linear program}
}
|
Keywords: |
|
urban green, transportation problem, maximum flow, linear program |
|
Collection: |
|
10th International Conference on Geographic Information Science (GIScience 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
02.08.2018 |
