6 search results - page 1 / 2 » An optimal-time algorithm for shortest paths on a convex pol... |
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...
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...
STOC
2003
ACM
14 years 4 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...
DCG
2008
13 years 4 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...