Telcik, T.M. (1992) Calculation of on- and off-road shortest time paths using parallel algorithms.
	Proceedings AURISA-92: 127-136. Australasian Urban and Regional Information Systems
	Associates, Inc.: Queensland (Australia).


ABSTRACT

Most previous work on the determination of shortest time paths has dealt with travel over pre-defined
networks or with off-road mobility. Many real-life problems involve combinations to reach the desired
destination. 

This problem has been termed the Cross-Country Problem (CCP); commercial systems that allow such 
computations are lacking. A solution is discussed which uses a Digital Elevation Model (DEM) 
called a Triangulated Irregular Network (TIN). 

Also considered is a comparison of the TIN and regular grid DEM for the CCP, and the role of a 
massively parallel computer for path-finding.