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 8 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 ...