Computing approximately shortest descending paths on convex terrains via multiple shooting
From MaRDI portal
Publication:1715706
DOI10.1007/s40314-018-0686-3zbMath1413.68160OpenAlexW2889414797WikidataQ114219365 ScholiaQ114219365MaRDI QIDQ1715706
Publication date: 29 January 2019
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-018-0686-3
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On the number of shortest descending paths on the surface of a convex terrain
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Shortest monotone descent path problem in polyhedral terrain
- Approximation algorithms for shortest descending paths in terrains
- Shortest descending paths through given faces
- Trekking in the alps without freezing or getting tired
- Computing approximate shortest paths on convex polytopes
- Direct multiple shooting method for solving approximate shortest path problems
- An improved algorithm for the shortest descending path on a convex terrain
- SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM
- The Discrete Geodesic Problem
- Euclidean Shortest Paths
- On Shortest Paths in Polyhedral Spaces
- Approximate Shortest Descending Paths
- Metric spaces, convexity and nonpositive curvature
- Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes
This page was built for publication: Computing approximately shortest descending paths on convex terrains via multiple shooting
