Skip to main content

On Distortion of Raster-Based Least-Cost Corridors

  • Conference paper
  • First Online:

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

Abstract

Given a grid of cells each having a cost value, a variant of the least-cost path problem seeks a corridor—represented by a swath of cells rather than a sequence of cells—connecting two terminuses such that its total accumulated cost is minimized. While it is widely known that raster-based least-cost paths are subject to three types of distortion, i.e., deviation, distortion, and proximity, little is known about potential distortion of their corridor counterparts. This paper studies a raster model of the least-cost corridor problem and analyses its solution in terms of each type of distortion. It is found that raster-based least-cost corridors, too, are subject to all three types of distortion but in different ways: elongation distortion is always persistent, deviation distortion can be substantially reduced, and proximity distortion can be essentially eliminated.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Adriaensen, F., Chardon, J.P., De Blust, G., Swinnen, E., Villalba, S., Gulinck, H., Matthysen, E.: The application of ‘least-cost’ modelling as a functional landscape model. Landsc. Urban Plan. 64(4), 233–247 (2003)

    Article  Google Scholar 

  2. Antikainen, H.: Comparison of different strategies for determining raster-based least-cost paths with a minimum amount of distortion. Trans. GIS 17(1), 96–108 (2013)

    Article  Google Scholar 

  3. Bagli, S., Geneletti, D., Orsi, F.: Routeing of power lines through least-cost path analysis and multicriteria evaluation to minimise environmental impacts. Environ. Impact Assess. Rev. 31, 234–239 (2011)

    Article  Google Scholar 

  4. van Bemmelen, J., Quak, W., van Hekken, M., van Oosterom, P.: Vector vs. raster-based algorithms for cross country movement planning. In: Proceedings of International Symposium on Computer-Assisted Cartography (Auto-Carto XI), Minneapolis, Minnesota, pp. 304–317 (1993)

    Google Scholar 

  5. Chetkiewicz, C.B., Boyce, M.S.: Use of resource selection functions to identify conservation corridors. J. Appl. Ecol. 46, 1036–1047 (2009)

    Article  Google Scholar 

  6. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  7. Douglas, D.H.: Least cost path in GIS using an accumulated cost surface and slope lines. Cartographica 31(3), 37–51 (1994)

    Article  Google Scholar 

  8. Feldman, S.C., Pelletier, R.E., Walser, E., Smoot, J.C., Ahl, D.: A prototype for pipeline routing using remotely sensed data and geographic information system analysis. Remote Sens. Environ. 53, 123–131 (1995)

    Article  Google Scholar 

  9. Gonçalves, A.B.: An extension of GIS-based least-cost path modelling to the location of wide paths. Int. J. Geogr. Inf. Sci. 24(7), 983–996 (2010)

    Article  Google Scholar 

  10. Huber, D.L., Church, R.L.: Transmission corridor location modeling. J. Transp. Eng. 111(2), 114–130 (1985)

    Article  Google Scholar 

  11. Lombard, K., Church, R.L.: The gateway shortest path problem: generating alternative routes for a corridor location problem. Geogr. Syst. 1, 25–45 (1993)

    Google Scholar 

  12. Goodchild, M.F.: An evaluation of lattice solutions to the problem of corridor location. Environ. Plan. A 9, 727–738 (1977)

    Article  Google Scholar 

  13. Rothley, K.: Finding and filling the “cracks” in resistance surfaces for least-cost modeling. Ecol. Soc. 10(1), 4 (2005)

    Google Scholar 

  14. Scaparra, M.P., Church, R.L., Medrano, F.A.: Corridor location: the multi-gateway shortest path model. J. Geogr. Syst. 16(3), 287–309 (2014)

    Article  Google Scholar 

  15. Shirabe, T.: A method for finding a least-cost wide path in raster space. Int. J. Geogr. Inf. Sci. 30(8), 1469–1485 (2016)

    Article  Google Scholar 

  16. Tomlin, C.D.: Propagating radial waves of travel cost in a grid. Int. J. Geogr. Inf. Sci. 24(9), 1391–1413 (2010)

    Article  Google Scholar 

  17. Xu, J., Lathrop, R.G.: Improving simulation accuracy of spread phenomena in a raster-based geographic information system. Int. J. Geogr. Inf. Sci. 17(4), 153–168 (1995)

    Article  Google Scholar 

Download references

Acknowledgment

This work was partially supported by a grant (No. 942-2015-1513) from the Swedish Research Council Formas. The author would like to thank the three anonymous reviewers for their valuable comments and suggestions, which have improved the presentation of this paper. Still, any errors remain the author’s own.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takeshi Shirabe .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Shirabe, T. (2016). On Distortion of Raster-Based Least-Cost Corridors. In: Miller, J., O'Sullivan, D., Wiegand, N. (eds) Geographic Information Science. GIScience 2016. Lecture Notes in Computer Science(), vol 9927. Springer, Cham. https://doi.org/10.1007/978-3-319-45738-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45738-3_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45737-6

  • Online ISBN: 978-3-319-45738-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics