An improved algorithm for the shortest descending path on a convex terrain

DOI10.1016/j.jda.2012.12.001zbMath1280.68283OpenAlexW2085388686MaRDI QIDQ2434932

Xiangzhi Wei, Ajay Joneja

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

zbMATH Keywords

shortest pathcomputational geometrygeodesic pathterrain

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Optimal facility location problem on polyhedral terrains using descending paths ⋮ Computing approximately shortest descending paths on convex terrains via multiple shooting

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

This page was built for publication: An improved algorithm for the shortest descending path on a convex terrain