An Improved Algorithm for the Shortest Descending Path on a Convex Terrain

In this paper, we propose an algorithm for computing a shortest descending path from a start point s to a destination point t on an arbitrary convex terrain. Our algorithm requires O(nlogn) time and space, which is an improvement of the algorithm provided in S. Roy (2012) [3]. © 2012 Elsevier B.V