Shortest monotone descent path problem in polyhedral terrain

DOI10.1016/J.COMGEO.2006.06.003MaRDI QIDQ876505zbMATH OpenOpenAlexFDO

Authors Sasanka Roy, Sandip Das, Subhas C. Nandy

Publication date 18 April 2007

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2006.06.003

zbMATH Keywords

complexitypolyhedral algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• STACS 2005
• Shortest descending paths through given faces
• An improved algorithm for the shortest descending path on a convex terrain
• Approximation algorithms for shortest descending paths in terrains
• Shortest Gently Descending Paths

Cites work

• scientific article; zbMATH DE number 1391661 (Why is no real title available?)
• A sweepline algorithm for Voronoi diagrams
• An efficient approximation algorithm for weighted region shortest path problem
• Approximating shortest paths on a nonconvex polyhedron
• Approximating shortest paths on weighted polyhedral surfaces
• Approximation algorithms for geometric shortest path problems
• Computational Science and Its Applications – ICCSA 2004
• Computing approximate shortest paths on convex polytopes
• Determining approximate shortest paths on weighted polyhedral surfaces
• Efficient computation of geodesic shortest paths
• Fundamentals of Computation Theory
• New results on shortest paths in three dimensions
• On Shortest Paths in Polyhedral Spaces
• Optimal Search in Planar Subdivisions
• Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• The Discrete Geodesic Problem
• The weighted region problem
• Trekking in the alps without freezing or getting tired

Cited in

(9)

• Optimal facility location problem on polyhedral terrains using descending paths
• An improved algorithm for the shortest descending path on a convex terrain
• 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
• STACS 2005
• Approximation algorithms for shortest descending paths in terrains
• Shortest Gently Descending Paths
• Shortest descending paths: towards an exact algorithm
• Computing approximately shortest descending paths on convex terrains via multiple shooting

This page was built for publication: Shortest monotone descent path problem in polyhedral terrain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876505)