Sciweavers

115 search results - page 1 / 23
» Approximation Algorithms for Shortest Descending Paths in Te...
Sort
View
107
Voted
CORR
2007
Springer
143views Education» more  CORR 2007»
14 years 10 months ago
An Approximation Algorithm for Shortest Descending Paths
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 ...
Mustaq Ahmed, Anna Lubiw
77
Voted
CORR
2008
Springer
133views Education» more  CORR 2008»
14 years 10 months ago
Approximation Algorithms for Shortest Descending Paths in Terrains
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 ...
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw...
CCCG
2006
14 years 11 months ago
Shortest Descending Paths through Given Faces
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 ...
Mustaq Ahmed, Anna Lubiw
95
Voted
CCCG
2007
14 years 11 months ago
Approximate Shortest Descent Path on a Terrain
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...
Sasanka Roy, Sachin Lodha, Sandip Das, Anil Mahesh...
97
Voted
IPL
2008
111views more  IPL 2008»
14 years 9 months ago
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, comp...
Hamid Zarrabi-Zadeh