An improved algorithm for the shortest descending path on a convex terrain
From MaRDI portal
Publication:2434932
DOI10.1016/j.jda.2012.12.001zbMath1280.68283MaRDI QIDQ2434932
Publication date: 3 February 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.12.001
68W40: Analysis of algorithms
52B55: Computational aspects related to convexity
68R05: Combinatorics in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Computing approximately shortest descending paths on convex terrains via multiple shooting, Optimal facility location problem on polyhedral terrains using descending paths
Cites Work
- 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
- An optimal-time algorithm for shortest paths on realistic polyhedra
- Shortest monotone descent path problem in polyhedral terrain
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- The Discrete Geodesic Problem
- On Shortest Paths in Polyhedral Spaces