Extensions to least-cost path algorithms for roadway planning

International Journal of Geographical Information Science

Volumn 17, Issue 4, 2003, Pages 361-376

  Yu, Chaoqing ^a   Lee, Jay ^b   Munro Stasiuk, Mandy J ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; DIGITAL ELEVATION MODEL; GIS; PLANNING METHOD; REMOTE SENSING; ROAD TRANSPORT;

EID: 0038182835     PISSN: 13658816     EISSN: None     Source Type: Journal    
DOI: 10.1080/1365881031000072645     Document Type: Article

References (22)

1. BEMMELEN, J. VAN, QUAK, W., HEKKEN, M. VAN, and OOSTEROM, P. VAN, 1993, Vector vs. Raster-based algorithms for cross country movement planning. In Proceedings of Auto Carto II (Bethesda: American Congress on Surveying and Mapping), pp. 304-317.
2. BERG, M. D., and KREVELD, M. V., 1997, Trekking in the Alps without freezing or getting tired. Algorithmica, 18, 306-323.
3. COLLISCHONN, W., and PILAR, J. V., 2000, A direction dependent least-costs path algorithm for roads and canals. In International Journal of Geographical Information Science, 14, 397-406.
4. DIJKSTRA, E. W., 1959, A note on two problems in connection with graphs. Numerische Mathmatik, 1, 269-271.
5. DOUGLAS, D. H., 1994, Least-cost path in GIS using an accumulated-cost surface and slope lines. Cartographica, 31, 37-51.
6. FELDMAN, S. C., PELLETIER, R. E., WALSER, E., SMOOT, J. R., and AHL, D., 1995, A prototype for pipeline routing using remotely sensed data and geographic information system analysis. Remote Sensing of Environment, 53, 123-131.
7. GOODCHILD, M. F., 1977, An evaluation of lattice solutions to the corridor location problem. Environment and Planning, A9, 727-738.
8. LEE, J., and STUCKY, D., 1998, On applying viewshed analysis for determining least-cost paths on Digital Elevation Models. International Journal of Geographical Information Systems, 12, 891-905.
9. MITCHELL, J. S. B., 1988, An algorithmic approach to some problems in terrain navigation. Artificial Intelligence, 37, 171-201.
10. MITCHELL, J. S. B., MOUNT, D. M., and PAPADIMITRIOU, C. H., 1987, The discrete geodesic problem. SIAM Journal on Computing, 16, 647-668.
11. O'FLAHERTY, C. A., 1967, Highways (London: Edward Arnold), 321 pp.
12. OGLESBY, C. H., and HEWES, L. I., 1963, Highway Engineering, 2nd edition (New York: John Wiley and Sons, Inc), pp. 256-259.
13. SOLKA, J. L., PERRY, J. C., POELLINGER, B. R., and ROGERS, G. W., 1995, Faster computation of optimal paths using a parallel Dijkstra algorithm with embedded constraints. Neurocomputing, 8, 195-212.
14. STEFANAKIS, E., and KAVOURAS, M., 1995, On the determination of the optimum path in space. COSIT '95, 241-257.
15. VARADARAJAN, K., and AGARWAL, P. K., 2000, Approximating shortest paths on a non-convex polyhedron. SIAM Journal of Computing, 30, 1321-1340.
16. VÖRÖS, J., 2001, Low-cost implementation of distance maps for path planning using matrix quadtrees and octrees. Robotics and Computer Integrated Manufacturing, 17, 447-459.
17. WARNTZ, W., 1957, Transportation, social physics and the Law of Refraction. The Professional Geographer, 9, 2-7.
18. WEISS, M. A., 1995, Algorithm, data structures, and problem solving with C+ + (MA: Addison Wesley).
19. XU, J., and LATHROP, R. G., 1994, Improving cost-path in a raster data format. Computers & Geosciences, 20, 1455-1465.
20. XU, J., and LATHROP, R. G., 1995, Improving simulation accuracy of spread phenomena in a raster-based geographic information system. International Journal of Geographical Information Science, 9, 153-168.
21. ZHAN, C., MENON, S., and GAO, P., 1993, A directional path distance model for raster distance mapping. COSIT '93, 434-443.
22. ZHU, H., EASTMAN, J. R., and TOLEDANO, J., 2001, Triangulated irregular network optimization from contour data using bridge and tunnel removal. International Journal of Geographical Information Science, 15, 271-286.