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...
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...
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...
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...