Flying over a polyhedral terrain

DOI10.1016/j.ipl.2007.08.008zbMath1184.68648OpenAlexW2060313721MaRDI QIDQ2380051

Hamid Zarrabi-Zadeh

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.008

zbMATH Keywords

shortest pathcomputational geometryapproximation algorithmspolyhedral terrain

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites Work

• An algorithm for shortest-path motion in three dimensions
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• Pseudo approximation algorithms with applications to optimal motion planning
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• New results on shortest paths in three dimensions
• Unnamed Item
• Unnamed Item
• Unnamed Item