Approximation algorithms for shortest descending paths in terrains
From MaRDI portal
Publication:972363
DOI10.1016/J.JDA.2009.05.001zbMATH Open1190.90252OpenAlexW2127945324MaRDI QIDQ972363FDOQ972363
Sasanka Roy, Anil Maheshwari, Sandip Das, Anna Lubiw, Sachin Lodha, Mustaq Ahmed
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
Recommendations
approximation algorithmcomputational geometryshortest pathterraindescending pathgently descending path
Cites Work
- Title not available (Why is that?)
- Fibonacci heaps and their uses in improved network optimization algorithms
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Title not available (Why is that?)
- Trekking in the alps without freezing or getting tired
- The Discrete Geodesic Problem
- The weighted region problem
- On finding approximate optimal paths in weighted regions
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Approximation algorithms for geometric shortest path problems
- Determining approximate shortest paths on weighted polyhedral surfaces
- Title not available (Why is that?)
- Shortest descending paths through given faces
- Shortest descending paths: towards an exact algorithm
- Shortest monotone descent path problem in polyhedral terrain
- An algorithm for shortest-path motion in three dimensions
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Title not available (Why is that?)
- Constructing Approximate Shortest Path Maps in Three Dimensions
- Shortest paths on realistic polyhedra
- Title not available (Why is that?)
- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- Shortest Gently Descending Paths
- Computing approximate shortest paths on convex polytopes
Cited In (10)
- Optimal facility location problem on polyhedral terrains using descending paths
- Navigating Weighted Regions with Scattered Skinny Tetrahedra
- Title not available (Why is that?)
- 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
- STACS 2005
- Linear Search with Terrain-Dependent Speeds
- Shortest Gently Descending Paths
- Shortest descending paths: towards an exact algorithm
- Computing approximately shortest descending paths on convex terrains via multiple shooting
Uses Software
This page was built for publication: Approximation algorithms for shortest descending paths in terrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972363)