118
Voted
IPL
2008
14 years 11 months ago
2008
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, comp...
121
Voted
CORR
2007
Springer
15 years 7 days ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
91
Voted
CORR
2008
Springer
15 years 10 days ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
92
Voted
CCCG
2006
15 years 1 months ago
2006
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
109
Voted
CCCG
2007
15 years 1 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
82
Voted
STACS
1992
Springer
15 years 4 months ago
1992
Springer
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
87
Voted
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...