Approximate shortest descending paths
From MaRDI portal
Recommendations
Cited in
(16)- Shortest descending paths through given faces
- An algorithmic approach to some problems in terrain navigation
- Computing approximately shortest descending paths on convex terrains via multiple shooting
- Optimal facility location problem on polyhedral terrains using descending paths
- Flying over a polyhedral terrain
- An improved algorithm for the shortest descending path on a convex terrain
- Approximate geodesic calculation based on an ant colony iterative algorithm
- Shortest Gently Descending Paths
- Near optimal algorithm for the shortest descending path on the surface of a convex terrain
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Approximate Shortest Paths in Polygons with Violations
- Navigating weighted regions with scattered skinny tetrahedra
- STACS 2005
- Approximate shortest descending paths
- Shortest Journeys in Directed Temporal Graphs
- Approximation algorithms for shortest descending paths in terrains
This page was built for publication: Approximate shortest descending paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494923)