Description Usage Arguments Value Author(s) Examples
least cost path algorithm are useful for al lot of applications. gdistance is providing a generic R-ish approach that is cool for smaller data set. If you want to go bigger than 2000*2000 pixel than you should engage something else. This implementation uses the incredible power of GRASS 7. It calculates the least cost pathes for a set of given points for each point in the list to all other points.
1 | gcost(runDir,currentP,allP)
|
runDir |
the choosen working directory |
currentP |
actual startpoint |
allP |
list of all Points |
gcost basically returns (a) dataframe with the position of startpoint,destination point and distance. Additionally it writes a shapefile containing all pathes to the destinations for the source point
Chris Reudenbach
1 2 3 4 5 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.