Sciweavers

6 search results - page 1 / 2
» Approximating Shortest Paths on a Convex Polytope in Three D...
Sort
View
COMPGEOM
1996
ACM
13 years 7 months ago
Approximating Shortest Paths on a Convex Polytope in Three Dimensions
Sariel Har-Peled, Micha Sharir, Kasturi R. Varadar...
COMPGEOM
1998
ACM
13 years 7 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
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...
Sariel Har-Peled
COMPGEOM
2006
ACM
13 years 9 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
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...
Yevgeny Schreiber, Micha Sharir
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 3 months ago
Sublinear geometric algorithms
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...
Bernard Chazelle, Ding Liu, Avner Magen
COMPGEOM
2000
ACM
13 years 8 months ago
Computing approximate shortest paths on convex polytopes
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...
Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia