Shortest monotone descent path problem in polyhedral terrain

Authors:
Sasanka Roy;Sandip Das;Subhas C. Nandy
Affiliations:
Indian Statistical Institute, Kolkata, India;Indian Statistical Institute, Kolkata, India;Indian Statistical Institute, Kolkata, India
Venue:
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Year:
2005

Citing 6
Cited 0

On shortest paths in polyhedral spaces

SIAM Journal on Computing
The discrete geodesic problem

SIAM Journal on Computing
The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
Efficient computation of geodesic shortest paths

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for geometric shortest path problems

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximating Shortest Paths on a Nonconvex Polyhedron

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a polyhedral terrain with n vertices, the shortest monotone descent path problem deals with finding the shortest path between a pair of points, called source (s) and destination (t) such that the path is constrained to lie on the surface of the terrain, and for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on the path, if dist(s,p) dist(s,q) then z(p) z(q), where dist(s,p) denotes the distance of p from s along the aforesaid path. This is posed as an open problem in [3]. We show that for some restricted classes of polyhedral terrain, the optimal path can be identified in polynomial time. We also propose an elegant method which can return near-optimal path for the general terrain in polynomial time.