2 Search Results for "Lautenbach, Sven"

Document
DOI: 10.4230/LIPIcs.GIScience.2021.II.3
Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians

Authors: Christina Ludwig, Sven Lautenbach, Eva-Marie Schömann, and Alexander Zipf

Published in: LIPIcs, Volume 208, 11th International Conference on Geographic Information Science (GIScience 2021) - Part II

Abstract
Routes with a high share of greenery are attractive for cyclist and pedestrians. We analyze how strongly such green routes differ from the respective fast routes using the openrouteservice. Greenness of streets was estimated based on OpenStreetMap data in combination with Sentinel-II imagery, 3d laser scan data and administrative information on trees on public ground. We assess the effect both at the level of the individual route and at the urban level for two German cities: Dresden and Heidelberg. For individual routes, we study how strongly green routes differ from the respective fast routes. In addition, we identify parts of the road network which represent important green corridors as well as unattractive parts which can or cannot be avoided at the cost of reasonable detours. In both cities, our results show the importance of urban green spaces for the provision of attractive green routes and provide new insights for urban planning by identifying unvegetated bottlenecks in the street network for which no green alternatives exist at this point.
Cite as

Christina Ludwig, Sven Lautenbach, Eva-Marie Schömann, and Alexander Zipf. Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians. In 11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Leibniz International Proceedings in Informatics (LIPIcs), Volume 208, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{ludwig_et_al:LIPIcs.GIScience.2021.II.3,
  author =	{Ludwig, Christina and Lautenbach, Sven and Sch\"{o}mann, Eva-Marie and Zipf, Alexander},
  title =	{{Comparison of Simulated Fast and Green Routes for Cyclists and Pedestrians}},
  booktitle =	{11th International Conference on Geographic Information Science (GIScience 2021) - Part II},
  pages =	{3:1--3:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-208-2},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{208},
  editor =	{Janowicz, Krzysztof and Verstegen, Judith A.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2021.II.3},
  URN =		{urn:nbn:de:0030-drops-147622},
  doi =		{10.4230/LIPIcs.GIScience.2021.II.3},
  annote =	{Keywords: Routing, OpenStreetMap, route choice, urban vegetation, sustainable mobility}
}
Document
DOI: 10.4230/LIPIcs.GISCIENCE.2018.13
A Network Flow Model for the Analysis of Green Spaces in Urban Areas

Authors: Benjamin Niedermann, Johannes Oehrlein, Sven Lautenbach, and Jan-Henrik Haunert

Published in: LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)

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.
Cite as

Benjamin Niedermann, Johannes Oehrlein, Sven Lautenbach, and Jan-Henrik Haunert. A Network Flow Model for the Analysis of Green Spaces in Urban Areas. In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{niedermann_et_al:LIPIcs.GISCIENCE.2018.13,
  author =	{Niedermann, Benjamin and Oehrlein, Johannes and Lautenbach, Sven and Haunert, Jan-Henrik},
  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 =	{Winter, Stephan and Griffin, Amy and Sester, Monika},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.13},
  URN =		{urn:nbn:de:0030-drops-93412},
  doi =		{10.4230/LIPIcs.GISCIENCE.2018.13},
  annote =	{Keywords: urban green, transportation problem, maximum flow, linear program}
}
  • Refine by Author
  • 2 Lautenbach, Sven
  • 1 Haunert, Jan-Henrik
  • 1 Ludwig, Christina
  • 1 Niedermann, Benjamin
  • 1 Oehrlein, Johannes
  • Show More...

  • Refine by Classification
  • 1 Applied computing → Cartography
  • 1 Computing methodologies → Simulation evaluation
  • 1 General and reference → Empirical studies
  • 1 Information systems → Geographic information systems

  • Refine by Keyword
  • 1 OpenStreetMap
  • 1 Routing
  • 1 linear program
  • 1 maximum flow
  • 1 route choice
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2018
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact