IDEAS home Printed from https://ideas.repec.org/a/jss/jstsof/v076i13.html
   My bibliography  Save this article

R Package gdistance: Distances and Routes on Geographical Grids

Author

Listed:
  • van Etten, Jacob

Abstract

The R package gdistance provides classes and functions to calculate various distance measures and routes in heterogeneous geographic spaces represented as grids. Least-cost distances as well as more complex distances based on (constrained) random walks can be calculated. Also the corresponding routes or probabilities of passing each cell can be determined. The package implements classes to store the data about the probability or cost of transitioning from one cell to another on a grid in a memory-efficient sparse format. These classes make it possible to manipulate the values of cell-to-cell movement directly, which offers flexibility and the possibility to use asymmetric values. The novel distances implemented in the package are used in geographical genetics (applying circuit theory), but also have applications in other fields of geospatial analysis.

Suggested Citation

  • van Etten, Jacob, 2017. "R Package gdistance: Distances and Routes on Geographical Grids," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 76(i13).
    • Handle: RePEc:jss:jstsof:v:076:i13
    DOI: http://hdl.handle.net/10.18637/jss.v076.i13
    as

    Download full text from publisher

    File URL: https://www.jstatsoft.org/index.php/jss/article/view/v076i13/v76i13.pdf
    Download Restriction: no
    File URL: https://www.jstatsoft.org/index.php/jss/article/downloadSuppFile/v076i13/gdistance_1.2-1.tar.gz
    Download Restriction: no
    File URL: https://www.jstatsoft.org/index.php/jss/article/downloadSuppFile/v076i13/v76i13.R
    Download Restriction: no
    File URL: https://libkey.io/http://hdl.handle.net/10.18637/jss.v076.i13?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Kivimäki, Ilkka & Shimbo, Masashi & Saerens, Marco, 2014. "Developments in the theory of randomized shortest paths with a comparison of graph node distances," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 600-616.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wibbenmeyer, Matthew & Joiner, Emily & Wear, David N., 2023. "The Economics of Forest Fuel Removals on Federal Lands," RFF Working Paper Series 23-27, Resources for the Future.
    2. Falchetta, G. & Noussan, M. & Hammad, A.T., 2021. "Comparing paratransit in seven major African cities: An accessibility and network analysis," Journal of Transport Geography, Elsevier, vol. 94(C).
    3. Roger Bär & Albrecht Ehrensperger, 2018. "Accounting for the Boundary Problem at Subnational Level: The Supply–Demand Balance of Biomass Cooking Fuels in Kitui County, Kenya," Resources, MDPI, vol. 7(1), pages 1-32, February.
    4. Robby R Marrotte & Jeff Bowman, 2017. "The relationship between least-cost and resistance distance," PLOS ONE, Public Library of Science, vol. 12(3), pages 1-19, March.
    5. Bernhard Ludwig, 2020. "Reconstructing the Ancient Route Network in Pergamon’s Surroundings," Land, MDPI, vol. 9(8), pages 1-38, July.
    6. Petsas, Panagiotis & Tzivanopoulou, Marianna & Doxa, Aggeliki & Sailley, Sévrine F. & Mazaris, Antonios D., 2023. "Climate change on sea currents is not expected to alter contemporary migration routes of loggerhead sea turtles," Ecological Modelling, Elsevier, vol. 475(C).
    7. Gianluca Boo & Stefan Leyk & Christopher Brunsdon & Ramona Graf & Andreas Pospischil & Sara Irina Fabrikant, 2018. "The importance of regional models in assessing canine cancer incidences in Switzerland," PLOS ONE, Public Library of Science, vol. 13(4), pages 1-16, April.
    8. Yunpeng Liu & Xiaoting Xu & Dimitar Dimitrov & Loic Pellissier & Michael K. Borregaard & Nawal Shrestha & Xiangyan Su & Ao Luo & Niklaus E. Zimmermann & Carsten Rahbek & Zhiheng Wang, 2023. "An updated floristic map of the world," Nature Communications, Nature, vol. 14(1), pages 1-11, December.
    9. Hirzi Luqman & Daniel Wegmann & Simone Fior & Alex Widmer, 2023. "Climate-induced range shifts drive adaptive response via spatio-temporal sieving of alleles," Nature Communications, Nature, vol. 14(1), pages 1-15, December.
    10. David H. Fletcher & Joanne K. Garrett & Amy Thomas & Alice Fitch & Phil Cryle & Simon Shilton & Laurence Jones, 2022. "Location, Location, Location: Modelling of Noise Mitigation by Urban Woodland Shows the Benefit of Targeted Tree Planting in Cities," Sustainability, MDPI, vol. 14(12), pages 1-15, June.
    11. N. Nagkoulis & K.L. Katsifarakis, 2020. "Minimization of Total Pumping Cost from an Aquifer to a Water Tank, Via a Pipe Network," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 34(13), pages 4147-4162, October.
    12. L. Alfredo Fernandez-Jimenez & Montserrat Mendoza-Villena & Eduardo Garcia-Garrido & Pedro M. Lara-Santillan & Pedro J. Zorzano-Santamaria & Enrique Zorzano-Alba & Alberto Falces, 2017. "High Voltage Overhead Power Line Routing under an Objective Observability Criterion," Energies, MDPI, vol. 10(10), pages 1-13, October.
    13. Páez, Antonio & Anjum, Zoha & Dickson-Anderson, Sarah E. & Schuster-Wallace, Corinne J. & Martín Ramos, Belén & Higgins, Christopher D., 2020. "Comparing distance, time, and metabolic energy cost functions for walking accessibility in infrastructure-poor regions," Journal of Transport Geography, Elsevier, vol. 82(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Oyama, Yuki & Hato, Eiji, 2019. "Prism-based path set restriction for solving Markovian traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 528-546.
    2. Leleux, Pierre & Courtain, Sylvain & Françoisse, Kevin & Saerens, Marco, 2022. "Design of biased random walks on a graph with application to collaborative recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    3. Guex, Guillaume, 2016. "Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 264-277.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jss:jstsof:v:076:i13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christopher F. Baum (email available below). General contact details of provider: http://www.jstatsoft.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.