Approximate Shortest Descending Paths

DOI10.1137/130913808zbMath1298.65031OpenAlexW1974056748MaRDI QIDQ5494923

Siu-Wing Cheng, Jiongxin Jin

Publication date: 30 July 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/81867b87a80524c19e4c83da9a64a9b92479d8d3

zbMATH Keywords

approximation algorithmterrainEuclidean lengthsequence treepolygonal surfaceheight constraints problempath length optimization problemShortest descending path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)

Related Items (6)

Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ Shortest Journeys in Directed Temporal Graphs ⋮ Optimal facility location problem on polyhedral terrains using descending paths ⋮ Computing approximately shortest descending paths on convex terrains via multiple shooting ⋮ Approximate Shortest Paths in Polygons with Violations ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes

This page was built for publication: Approximate Shortest Descending Paths