Shortest descending paths through given faces

DOI10.1016/j.comgeo.2007.10.011zbMath1172.65012OpenAlexW2079124625MaRDI QIDQ1025303

Anna Lubiw, Mustaq Ahmed

Publication date: 18 June 2009

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationshortest pathsterrainshortest descending paths

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (10)

SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM ⋮ Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ Optimal facility location problem on polyhedral terrains using descending paths ⋮ 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 ⋮ A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints ⋮ Shortest descending paths through given faces

Cites Work

• Shortest descending paths through given faces
• Applications of second-order cone programming
• Trekking in the alps without freezing or getting tired
• The Discrete Geodesic Problem
• The weighted region problem
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• New results on shortest paths in three dimensions
• STACS 2005
• Unnamed Item
• Unnamed Item

This page was built for publication: Shortest descending paths through given faces