Shortest Gently Descending Paths
From MaRDI portal
Publication:3605485
DOI10.1007/978-3-642-00202-1_6zbMATH Open1211.68459OpenAlexW1523968747MaRDI QIDQ3605485FDOQ3605485
Authors: Mustaq Ahmed, Anna Lubiw, Anil Maheshwari 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- Trekking in the alps without freezing or getting tired
- The weighted region problem
- On finding approximate optimal paths in weighted regions
- Determining approximate shortest paths on weighted polyhedral surfaces
- Shortest descending paths through given faces
- Shortest descending paths: towards an exact algorithm
- Shortest monotone descent path problem in polyhedral terrain
- Approximation algorithms for shortest descending paths in terrains
- Querying approximate shortest paths in anisotropic regions
- On discretization methods for approximating optimal paths in regions with direction-dependent costs
Cited In (7)
- Optimal facility location problem on polyhedral terrains using descending paths
- Approximate shortest descending paths
- Title not available (Why is that?)
- Approximation algorithms for shortest descending paths in terrains
- Shortest descending paths through given faces
- Approximate shortest descending paths
- Shortest descending paths: towards an exact algorithm
Uses Software
This page was built for publication: Shortest Gently Descending Paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605485)
