IJPAM: Volume 1, No. 1 (2002)


Emmanuel Stefanakis$^1$, Marinos Kavouras$^2$
$^1$ Dept. of Geography
Harokopio University of Athens
Athens 17671, GREECE
e-mail: estef@hua.gr
$^2$ Dept. of Surveying Engineering
Nat. Technical University of Athens
Athens 15780, GREECE
e-mail: mkav@cs.ntua.gr

Abstract.Various algorithms have been proposed for the determination of the optimum path(s) in line networks. Moving in space under constraints is a far more complex problem, where research has been relatively scarce. An example would be the determination of the shortest sea course between two harbors. This paper presents a graph-based approach to the problem of the optimum path(s) finding in space; and shows how it can be applied to a variety of spaces and application domains. This approach, although quantitative in nature, it may also support the piecewise qualitative path selection.

Received: January 18, 2002

AMS Subject Classification: 68U01

Key Words and Phrases: optimum path finding, graph theory, cross-country movement, human navigation

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2002
Volume: 1
Issue: 1