6 search results - page 1 / 2 » Approximating Shortest Paths on a Convex Polytope in Three D... |
COMPGEOM
1996
ACM
14 years 3 months ago
1996
ACM
COMPGEOM
1998
ACM
14 years 3 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
14 years 5 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...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
COMPGEOM
2000
ACM
14 years 3 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...