Advanced search
Publication Cover
International Journal of Geographical Information Science Volume 36, 2022 - Issue 8
Submit an article Journal homepage
284
Views
1
CrossRef citations to date
0
Altmetric
Research Articles

An efficient multiple scanning order algorithm for accumulative least-cost surface calculation

Yuanzhi Yaoa School of Geographic Sciences, East China Normal University, Shanghai, P.R. China;b College of Forestry and Wildlife Sciences, Auburn University, Auburn, AL, USAORCID Iconhttps://orcid.org/0000-0003-2387-4598View further author information
ORCID Icon,
Xun Shic Department of Geography, Dartmouth College, Hanover, NH, USACorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0002-7169-5175View further author information
ORCID Icon &
Zekun Wangd Department of Mechanical Engineering, Auburn University, Auburn, AL, USAORCID Iconhttps://orcid.org/0000-0003-1641-1229View further author information
ORCID Icon
Pages 1677-1695 | Received 20 Jun 2021, Accepted 10 Mar 2022, Published online: 24 Mar 2022

References

  • Arge, L., et al., 2003. Efficient flow computation on massive grid terrain datasets. GeoInformatica, 7 (4), 283–313.
  • Balbi, M., et al., 2019. Title: Ecological relevance of least cost path analysis: an easy implementation method for landscape urban planning. Journal of Environmental Management, 244, 61–68.
  • Brabyn, L., and Skelly, C., 2002. Modeling population access to New Zealand public hospitals. International Journal of Health Geographics, 1 (1), 3–9.
  • Collischonn, W., and Pilar, J.V., 2000. A direction dependent least-cost-path algorithm for roads and canals. International Journal of Geographical Information Science, 14 (4), 397–406.
  • Crauser, A., et al., 1998., A parallelization of Dijkstra’s shortest path algorithm. In: International Symposium on Mathematical Foundations of Computer Science. Berlin: Springer, 722–731.
  • Dijkstra, E.W., 1959. A note on two problems in connexion with graphs. Numerische Mathematik, 1 (1), 269–271.
  • Douglas, D.H., 1994. Least-cost path in GIS using an accumulated cost surface and slopelines. Cartographica, 31 (3), 37–51.
  • Elsheikh, R.F.A., and Hassan, W.A.S., 2016. Analysis of least cost path by using geographic information systems network and multi criteria techniques. International Journal of Multidisciplinary Sciences and Engineering, 7 (5), 1–6.
  • Fredman, M.L., and Tarjan, R.E., 1987. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34 (3), 596–615.
  • Gonçalves, A.B., 2010. An extension of GIS-based least-cost path modelling to the location of wide paths. International Journal of Geographical Information Science, 24 (7), 983–996.
  • Gorelick, N., et al., 2017. Google Earth Engine: planetary-scale geospatial analysis for everyone. Remote Sensing of Environment, 202, 18–27.
  • Jasika, N., et al., 2012., Dijkstra’s shortest path algorithm serial and parallel execution performance analysis. In: MIPRO, 2012 proceedings of the 35th international convention. IEEE, 1811–1815.
  • LaRue, M.A., and Nielsen, C.K., 2008. Modelling potential dispersal corridors for cougars in midwestern North America using least-cost path methods. Ecological Modelling, 212 (3–4), 372–381.
  • Planchon, O., and Darboux, F., 2002. A fast, simple and versatile algorithm to fill the depressions of digital elevation models. CATENA, 46 (2–3), 159–176.
  • Rosenfeld, A., and Pfaltz, J.L., 1966. Sequential operations in digital picture processing. Journal of the ACM, 13 (4), 471–494.
  • Scott, L.M., and Janikas, M.V., 2010. Spatial statistics in ArcGIS. In: Handbook of applied spatial analysis. Germany: Springer, 27–41.
  • Soltani, A.R., et al., 2002. Path planning in construction sites: performance evaluation of the Dijkstra, A∗, and GA search algorithms. Advanced Engineering Informatics, 16 (4), 291–303.
  • Teng, M., et al., 2011. Multipurpose greenway planning for changing cities: a framework integrating priorities and a least-cost path model. Landscape and Urban Planning, 103 (1), 1–14.
  • Toma, L., et al., 2001. Flow computation on massive grids. In: Proceedings of the 9th ACM international symposium on Advances in geographic information systems. 82–87.
  • Vincent, L., 1993. Morphological grayscale reconstruction in image analysis: applications and efficient algorithms. IEEE Transactions on Image Processing, 2 (2), 176–201.
  • Wickham, J., et al., 2017. Thematic accuracy assessment of the 2011 national land cover database (NLCD). Remote Sensing of Environment, 191, 328–341.
  • Xu, J., and Lathrop, R.G., Jr, 1994. Improving cost-path tracing in a raster data format. Computers & Geosciences, 20 (10), 1455–1465.
  • Xu, J., and Lathrop, R.G., Jr, 1995. Improving simulation accuracy of spread phenomena in a raster-based geographic information system. International Journal of Geographical Information Systems, 9 (2), 153–168.
  • Yao, Y., and Shi, X., 2015. Alternating scanning orders and combining algorithms to improve the efficiency of flow accumulation calculation. International Journal of Geographical Information Science, 29 (7), 1214–1239.
  • Yao, Y., Tao, H., and Shi, X., 2012. Multi-type sweeping for improving the efficiency of flow accumulation calculation. In: 2012 20th International Conference on Geoinformatics. IEEE, 1–4.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.