作者: Jianping Xu , Richard G. Lathrop
DOI: 10.1080/02693799508902031
关键词:
摘要: Abstract Dijkstra's shortest path algorithm is widely used in spread simulation. While robust solving classical network problems, its implementation raster-based geographical information systems (GIS) has not been satisfying. A major reason for the inadequate simulation restricted number of raster cells (generally 4 to 8 adjacent cells) included as links algorithm. We propose several alternative methods that incorporate non-adjacent additional links, thus overcoming limitation a data structure. The accuracy increased from less than 60 per cent above 95 spatially homogeneous elliptical and appears be significantly heterogeneous conditions. computational cost new are higher but still reasonable practical use.