103 search results - page 1 / 21 » Computing approximate shortest paths on convex polytopes |
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
COMPGEOM
1996
ACM
13 years 8 months ago
1996
ACM
COMPGEOM
1998
ACM
13 years 8 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...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
PSIVT
2007
Springer
13 years 10 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...