An experimental analysis of least-cost path models on ordinal-scaled raster surfaces
Author:
Affiliation:
1. Geoinformatics Division, School of Architecture and the Built Environment, Royal Institute of Technology (KTH), Stockholm, Sweden
Funder
Svenska Forskningsrådet Formas
Publisher
Informa UK Limited
Subject
Library and Information Sciences,Geography, Planning and Development,Information Systems
Link
https://www.tandfonline.com/doi/pdf/10.1080/13658816.2020.1753204
Reference53 articles.
1. The application of ‘least-cost’ modelling as a functional landscape model
2. Routeing of power lines through least-cost path analysis and multicriteria evaluation to minimise environmental impacts
3. Forks in the Road: Choices in Procedures for Designing Wildland Linkages
4. The min-max spanning tree problem and some extensions
Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A hierarchical model with hexagon grids for multi-objective route planning in large-scale off-road environments;International Journal of Geographical Information Science;2024-05-06
2. A novel approach for calculating single-source shortest paths of weighted digraphs based on rough sets theory;Mathematical Biosciences and Engineering;2024
3. Investigation of fractured rock beneath a uranium-tailing storage dam through UAV digital photogrammetry and seismic refraction tomography;Frontiers in Earth Science;2023-12-15
4. An Effective Method for Computing the Least-Cost Path Using a Multi-Resolution Raster Cost Surface Model;ISPRS International Journal of Geo-Information;2023-07-17
5. A method for finding a least-cost corridor on an ordinal-scaled raster cost surface;Annals of GIS;2023-01-20
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3