Approximation Algorithms for Shortest Descending Paths in Terrains

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
24 pages, 8 figures

Keywords

Computational Geometry, Data Structures and Algorithms, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/160677

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0805.1401
 http://arxiv.org/abs/0805.1401

Collections

arXiv