first
prev
toc
Download Citation
Recommend
Mark
Alert
Link
Print
Research Article: Extensions to least-cost path algorithms for roadway planning
Authors:
Chaoqing Yu a;
Jay Lee b;
Mandy J. Munro-Stasiuk b
| Affiliations: | a Department of Geography, Pennsylvania State University, State College, PA 16802, USA. |
| b Department of Geography, Kent State University, Kent, OH 44242-0001, USA. |
DOI:
10.1080/1365881031000072645
Publication Frequency:
12 issues per year
Published in:
International Journal of Geographical Information Science,
Volume
17,
Issue
4
April
2003
, pages 361
- 376
International Journal of Geographical Information Science,
Volume
17,
Issue
4
April
2003
, pages 361
- 376
Subjects:
Cartography;
Computer Science (General);
Earth Sciences;
Geographic Information Systems;
Location Based Services;
Navigation;
Systems & Computer Architecture of Databases;
Topography;
Transport Geography;
Number of References: 22
Formats available:
PDF
(English)
Previously published as:
International journal of geographical information systems
(0269-3798,
1362-3087)
until 1996
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
Finding a least-cost-path in a raster data format is a useful function in geographical information systems. However, existing algorithms are often inadequate for practical roadway planning. This paper improves conventional algorithms by including the considerations of spatial distances, anisotropic costs and the presence of bridges and tunnels in the paths. This new algorithm is implemented in JAVA to run with actual remote sensing and DEM data. The experimental results show that this approach produces realistic least-cost paths for practical roadway planning.
|
| view references (22) : view citations |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
