Shortest descending paths: towards an exact algorithm
From MaRDI portal
Recommendations
Cites work
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Approximation algorithms for shortest descending paths in terrains
- Determining approximate shortest paths on weighted polyhedral surfaces
- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- On finding approximate optimal paths in weighted regions
- Shortest descending paths through given faces
- Shortest monotone descent path problem in polyhedral terrain
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- The Discrete Geodesic Problem
- The weighted region problem
- Trekking in the alps without freezing or getting tired
- Triangulating a simple polygon in linear time
Cited in
(9)- Shortest descending paths through given faces
- Computing approximately shortest descending paths on convex terrains via multiple shooting
- An improved algorithm for the shortest descending path on a convex terrain
- Shortest Gently Descending Paths
- Near optimal algorithm for the shortest descending path on the surface of a convex terrain
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Navigating weighted regions with scattered skinny tetrahedra
- On the number of shortest descending paths on the surface of a convex terrain
- Approximation algorithms for shortest descending paths in terrains
This page was built for publication: Shortest descending paths: towards an exact algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893462)