Skip to main content

ForestMaps: A Computational Model and Visualization for Forest Utilization

  • Conference paper
Web and Wireless Geographical Information Systems (W2GIS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8470))

Abstract

We seek to compute utilization information for public spaces, in particular forests: which parts are used by how many people. Our contribution is threefold. First, we present a sound model for computing this information from publicly available data such as road maps and population counts. Second, we present efficient algorithms for computing the desired utilization information according to this model. Third, we provide an experimental evaluation with respect to both efficiency and quality, as well as an interactive web application, that visualizes our result as a heat-map layer on top of OpenStreetMap data. The link to our web application can be found under http://forestmaps.informatik.uni-freiburg.de .

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ural, S., Hussain, E., Shan, J.: Building population mapping with aerial imagery and GIS data. International Journal of Applied Earth Observation and Geoinformation 13(6), 841–852 (2011)

    Article  Google Scholar 

  2. Gemsa, A., Pajor, T., Wagner, D., Zündorf, T.: Efficient Computation of Jogging Routes. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 272–283. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Maervoet, J., Brackman, P., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: Tour suggestion for outdoor activities. In: Liang, S.H.L., Wang, X., Claramunt, C. (eds.) W2GIS 2013. LNCS, vol. 7820, pp. 54–63. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Luxen, D., Schieferdecker, D.: Candidate sets for alternative routes in road networks. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 260–270. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Yen, J.Y.: Finding the k shortest loopless paths in a network. Management Science 17(11), 712–716 (1971)

    Article  MATH  Google Scholar 

  6. Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing 28(2), 652–673 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ensinger, K., Wurster, M., Selter, A., Jenne, M., Bethmann, S., Botsch, K.: “Eintauchen in eine andere Welt” - Untersuchungen über Erholungskonzepte und Erholungsprozesse im Wald. German Journal of Forest Research 184(3), 70–83 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bast, H., Sternisko, J., Storandt, S. (2014). ForestMaps: A Computational Model and Visualization for Forest Utilization. In: Pfoser, D., Li, KJ. (eds) Web and Wireless Geographical Information Systems. W2GIS 2014. Lecture Notes in Computer Science, vol 8470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55334-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55334-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-55333-2

  • Online ISBN: 978-3-642-55334-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics