Approximation Algorithms for Shortest Descending Paths in Terrains
Computational Geometry
2008-05-12 v1 Data Structures and Algorithms
Abstract
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We give two approximation algorithms (more precisely, FPTASs) that solve the SDP problem on general terrains. Both algorithms are simple, robust and easy to implement.
Cite
@article{arxiv.0805.1401,
title = {Approximation Algorithms for Shortest Descending Paths in Terrains},
author = {Mustaq Ahmed and Sandip Das and Sachin Lodha and Anna Lubiw and Anil Maheshwari and Sasanka Roy},
journal= {arXiv preprint arXiv:0805.1401},
year = {2008}
}
Comments
24 pages, 8 figures