Approximation algorithms for shortest descending paths in terrains
From MaRDI portal
Publication:972363
DOI10.1016/j.jda.2009.05.001zbMath1190.90252MaRDI QIDQ972363
Anil Maheshwari, Anna Lubiw, Sandip Das, Sasanka Roy, Mustaq Ahmed, Sachin Lodha
Publication date: 25 May 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.05.001
shortest path; approximation algorithm; computational geometry; terrain; descending path; gently descending path
Related Items
Near optimal algorithm for the shortest descending path on the surface of a convex terrain, On the number of shortest descending paths on the surface of a convex terrain, SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM, Shortest Gently Descending Paths
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shortest monotone descent path problem in polyhedral terrain
- Shortest descending paths through given faces
- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- An algorithm for shortest-path motion in three dimensions
- Trekking in the alps without freezing or getting tired
- SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM
- The Discrete Geodesic Problem
- Approximation algorithms for geometric shortest path problems
- Determining approximate shortest paths on weighted polyhedral surfaces
- Shortest paths on realistic polyhedra
- Shortest Gently Descending Paths
- Constructing Approximate Shortest Path Maps in Three Dimensions
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- The weighted region problem
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Fibonacci heaps and their uses in improved network optimization algorithms
- Computing approximate shortest paths on convex polytopes
- On finding approximate optimal paths in weighted regions
