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
A path froms to t on a polyhedral terrain is descending if the height of a point p never increases w...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
Two algorithms are presented for computing shortest paths in the plane avoiding convex polygonal obs...
AbstractWe study the problem of finding a shortest descending path (SDP) between a pair of points, c...
We present an approximate algorithm for the shortest descending path (SDP) problem. Given a source s...
We present an approximation algorithm for the shortest descending path problem. Given a source s and...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
AbstractWe study the problem of finding a shortest descending path (SDP) between a pair of points, c...
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if f...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
A path from s to t on a polyhedral terrain is de-scending if the height of a point p never increases...
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases ...
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases ...
The shortest paths on the surface of a convex polyhedron can be grouped into equivalence classes acc...
AbstractThe shortest paths on the surface of a convex polyhedron can be grouped into equivalence cla...
A path froms to t on a polyhedral terrain is descending if the height of a point p never increases w...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
Two algorithms are presented for computing shortest paths in the plane avoiding convex polygonal obs...
AbstractWe study the problem of finding a shortest descending path (SDP) between a pair of points, c...
We present an approximate algorithm for the shortest descending path (SDP) problem. Given a source s...
We present an approximation algorithm for the shortest descending path problem. Given a source s and...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
AbstractWe study the problem of finding a shortest descending path (SDP) between a pair of points, c...
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if f...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
A path from s to t on a polyhedral terrain is de-scending if the height of a point p never increases...
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases ...
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases ...
The shortest paths on the surface of a convex polyhedron can be grouped into equivalence classes acc...
AbstractThe shortest paths on the surface of a convex polyhedron can be grouped into equivalence cla...
A path froms to t on a polyhedral terrain is descending if the height of a point p never increases w...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
Two algorithms are presented for computing shortest paths in the plane avoiding convex polygonal obs...
DOI
Add to ORKG