Article ID Journal Published Year Pages File Type
430905 Journal of Discrete Algorithms 2013 5 Pages PDF
Abstract

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].

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
An improved algorithm for the shortest descending path on a convex terrain
Authors
, ,