We devise techniques to manipulate a collection of loosely interpenetrating spheres in threedimensional space. Our study is motivated by the representation and manipulation of mol...
An interactive visualization of weighted three-dimensional -hulls is presented for static and dynamic spheres. The -hull is analytically computed and represented by a triangulated...
Amitabh Varshney, Frederick P. Brooks Jr., William...
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...