Flying over a polyhedral terrain


We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p ≥ 1, computes a (c + ε)approximation to the Lp-shortest path above a polyhedral terrain in O( ε log n log log n) time and O(n log n) space, where n is the number of vertices of the… (More)
DOI: 10.1016/j.ipl.2007.08.008


1 Figure or Table

Slides referencing similar topics