An improved algorithm for the shortest descending path on a convex terrain

Authors:
Xiangzhi Wei;Ajay Joneja
Affiliations:
Department of IELM, HKUST, Clear Water Bay, Kowloon, Hong Kong;Department of IELM, HKUST, Clear Water Bay, Kowloon, Hong Kong
Venue:
Journal of Discrete Algorithms
Year:
2013

Citing 6
Cited 0

The discrete geodesic problem

SIAM Journal on Computing
Shortest monotone descent path problem in polyhedral terrain

Computational Geometry: Theory and Applications
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions

Discrete & Computational Geometry
An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra

Discrete & Computational Geometry
On the number of shortest descending paths on the surface of a convex terrain

Journal of Discrete Algorithms
Near optimal algorithm for the shortest descending path on the surface of a convex terrain

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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