115 search results - page 1 / 23 » Approximation Algorithms for Shortest Descending Paths in Te... |
110
Voted
CORR
2007
Springer
14 years 11 months 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 ...
80
Voted
CORR
2008
Springer
14 years 11 months 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 ...
83
Voted
CCCG
2006
15 years 9 days 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 ...
97
Voted
CCCG
2007
15 years 10 days 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...
100
click to vote
IPL
2008
14 years 10 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...