473 search results - page 9 / 95 » Computing shortest paths with uncertainty |
PSIVT
2007
Springer
15 years 3 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
NETCOOP
2007
Springer
15 years 3 months ago
2007
Springer
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
COSIT
2003
Springer
15 years 2 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
COMPGEOM
1998
ACM
15 years 1 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
