SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM

DOI10.1142/S0218195911003755zbMath1252.68326OpenAlexW2117878581MaRDI QIDQ2893462

Anna Lubiw, Mustaq Ahmed

Publication date: 20 June 2012

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195911003755

zbMATH Keywords

optimizationcomputational geometryterrainSnell's lawcontinuous Dijkstrasequence tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (7)

Unnamed Item ⋮ Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ Near optimal algorithm for the shortest descending path on the surface of a convex terrain ⋮ Computing approximately shortest descending paths on convex terrains via multiple shooting ⋮ Approximation algorithms for shortest descending paths in terrains ⋮ On the number of shortest descending paths on the surface of a convex terrain ⋮ Shortest Gently Descending Paths

Cites Work

• Shortest monotone descent path problem in polyhedral terrain
• Approximation algorithms for shortest descending paths in terrains
• Shortest descending paths through given faces
• On discretization methods for approximating optimal paths in regions with direction-dependent costs
• Triangulating a simple polygon in linear time
• Trekking in the alps without freezing or getting tired
• The Discrete Geodesic Problem
• Determining approximate shortest paths on weighted polyhedral surfaces
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• The weighted region problem
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• On finding approximate optimal paths in weighted regions

This page was built for publication: SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM