메뉴 건너뛰기




Volumn 76, Issue 1, 2017, Pages

R package gdistance: Distances and routes on geographical grids

Author keywords

Circuit theory; Connectivity; Dispersal; Geospatial analysis; Landscape genetics; Least cost distance; Least cost path; R; Random walk; Travel

Indexed keywords


EID: 85015250895     PISSN: 15487660     EISSN: None     Source Type: Journal    
DOI: 10.18637/jss.v076.i13     Document Type: Article
Times cited : (353)

References (22)
  • 3
    • 31944438411 scopus 로고    scopus 로고
    • Diagonal and Orthogonal Neighbours in Grid-Based Simulations: Buffons Stick after 200 Years.”
    • Birch CPD (2006). “Diagonal and Orthogonal Neighbours in Grid-Based Simulations: Buffon’s Stick after 200 Years.” Ecological Modelling, 192(3–4), 637–644. doi:10.1016/j.ecolmodel.2005.07.017.
    • (2006) Ecological Modelling , vol.192 , Issue.34 , pp. 637-644
    • Birch, C.1
  • 4
    • 0040898784 scopus 로고    scopus 로고
    • The Electrical Resistance of a Graph Captures Its Commute and Cover Times.
    • Chandra AK, Raghavan P, Ruzzo WL, Smolensky R, Tiwari P (1996). “The Electrical Resistance of a Graph Captures Its Commute and Cover Times.” Computational Complexity, 6(4), 312–340. doi:10.1007/BF01270385.
    • (1996) Computational Complexity , vol.6 , Issue.4 , pp. 312-340
    • Chandra, A.K.1    Raghavan, P.2    Ruzzo, W.L.3    Smolensky, R.4    Tiwari, P.5
  • 5
    • 43349094507 scopus 로고    scopus 로고
    • The igraph Software Package for Complex Network Research.
    • Csardi G, Nepusz T (2006). “The igraph Software Package for Complex Network Research.” InterJournal, p. 1695.
    • (2006) Interjournal , pp. 1695
    • Csardi, G.1    Nepusz, T.2
  • 7
    • 34147120474 scopus 로고
    • A Note on Two Problems in Connexion with Graphs.
    • Dijkstra EW (1959). “A Note on Two Problems in Connexion with Graphs.” Numerische Mathematik, 1(1), 269–271. doi:10.1007/bf01386390.
    • (1959) Numerische Mathematik , vol.1 , Issue.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 9
    • 33847766633 scopus 로고    scopus 로고
    • Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation.
    • Fouss F, Pirotte A, Renders JM, Saerens M (2007). “Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation.” IEEE Transactions on Knowledge and Data Engineering, 19(3), 355–369. doi: 10.1109/tkde.2007.46.
    • (2007) IEEE Transactions on Knowledge and Data Engineering , vol.19 , Issue.3 , pp. 355-369
    • Fouss, F.1    Pirotte, A.2    Renders, J.M.3    Saerens, M.4
  • 12
    • 84886595579 scopus 로고    scopus 로고
    • Developments in the Theory of Randomized Shortest Paths with a Comparison of Graph Node Distances.
    • Kivimäki I, Shimbo M, Saerens M (2014). “Developments in the Theory of Randomized Shortest Paths with a Comparison of Graph Node Distances.” Physica A: Statistical Mechanics and its Applications, 393, 600–616. doi:10.1016/j.physa.2013.09.016.
    • (2014) Physica A: Statistical Mechanics and Its Applications , vol.393 , pp. 600-616
    • Kivimäki, I.1    Shimbo, M.2    Saerens, M.3
  • 14
    • 33750584310 scopus 로고    scopus 로고
    • Isolation by Resistance.
    • McRae BH (2006). “Isolation by Resistance.” Evolution, 60(8), 1551–1561. doi:10.1111/j.0014-3820.2006.tb00500.x.
    • (2006) Evolution , vol.60 , Issue.8 , pp. 1551-1561
    • McRae, B.H.1
  • 15
    • 58149355439 scopus 로고    scopus 로고
    • Using Circuit Theory to Model Connectivity in Ecology, Evolution, and Conservation.
    • McRae BH, Dickson BG, Keitt TH, Shah VB (2008). “Using Circuit Theory to Model Connectivity in Ecology, Evolution, and Conservation.” Ecological Modelling, 89(10), 2712–2724. doi:10.1890/07-1861.1.
    • (2008) Ecological Modelling , vol.89 , Issue.10 , pp. 2712-2724
    • McRae, B.H.1    Dickson, B.G.2    Keitt, T.H.3    Shah, V.B.4
  • 17
    • 84975753826 scopus 로고    scopus 로고
    • R Core Team, R Foundation for Statistical Computing, Vienna, Austria. URL
    • R Core Team (2016). R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria. URL https://www.R-project.org/.
    • (2016) R: A Language and Environment for Statistical Computing
  • 18
    • 70249146941 scopus 로고    scopus 로고
    • Randomized Shortest-Path Problems: Two Related Models.
    • Saerens M, Yen L, Fouss F, Achbany Y (2009). “Randomized Shortest-Path Problems: Two Related Models.” Neural Computation, 21(8), 2363–2404. doi:10.1162/neco.2009.11-07-643.
    • (2009) Neural Computation , vol.21 , Issue.8 , pp. 2363-2404
    • Saerens, M.1    Yen, L.2    Fouss, F.3    Achbany, Y.4
  • 19
    • 0000565591 scopus 로고
    • A Computer Movie Simulating Urban Growth in the Detroit Region.
    • Tobler W (1970). “A Computer Movie Simulating Urban Growth in the Detroit Region.” Economic Geography, 46(2), 234–240. doi:10.2307/143141.
    • (1970) Economic Geography , vol.46 , Issue.2 , pp. 234-240
    • Tobler, W.1
  • 20
    • 0003658460 scopus 로고
    • Technical Report 93-1, National Center for Geographic Information and Analysis. URL
    • Tobler W (1993). “Three Presentations on Geographical Analysis and Modeling.” Technical Report 93-1, National Center for Geographic Information and Analysis. URL http://www.ncgia.ucsb.edu/Publications/Tech_Reports/93/93-1.PDF.
    • (1993) Three Presentations on Geographical Analysis and Modeling.
    • Tobler, W.1
  • 22
    • 0001024012 scopus 로고
    • Wright S (1943). “Isolation by Distance.” Genetics, 28(2), 114-138. doi:10.1038/hdy.2014.62.
    • (1943) Genetics , vol.28 , Issue.2 , pp. 114-138
    • Wright, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.