Shortest Gently Descending Paths

DOI10.1007/978-3-642-00202-1_6zbMath1211.68459OpenAlexW1523968747MaRDI QIDQ3605485

Mustaq Ahmed, Anil Maheshwari, Anna Lubiw

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_6

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Unnamed Item ⋮ Approximation algorithms for shortest descending paths in terrains

Uses Software

• BUSHWHACK

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Trekking in the alps without freezing or getting tired
• SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM
• Determining approximate shortest paths on weighted polyhedral surfaces
• Querying approximate shortest paths in anisotropic regions
• The weighted region problem
• On finding approximate optimal paths in weighted regions

This page was built for publication: Shortest Gently Descending Paths