DOI: 10.1080/13658810903401016
关键词: Least cost path 、 Fixed width 、 Geographic information system 、 Computation 、 Test case 、 Theoretical computer science 、 Raster graphics 、 Computer science 、 Algorithm 、 Graph (abstract data type) 、 Any-angle path planning
摘要: The computation of least-cost paths over a cost surface is well-known and widely used capability raster geographic information systems (GISs). It consists in finding the path with lowest accumulated between two locations model surface, which results string-like, thin long sequence cells. In this article, new extension raster-based modelling proposed. approach allows or corridors fixed width, larger than one cell. These swaths are called wide may be useful circumstances where detail level surfaces higher width desired corridor. presented article independent choice algorithms, because transformation from regular to applied construction nodes edges an induced graph. gives foundations discusses particularities such paths, regardless imposed explores difference usual model. Test cases were included, hypothetical other real data. coherent indicative applicability paths.