COMPGEOM
14 years 1 months ago
1994 ACM 
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...
COMPGEOM
14 years 1 months ago
1994 ACM 
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...
COMPGEOM
14 years 1 months ago
1994 ACM 
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...
COMPGEOM
14 years 1 months ago
1994 ACM 
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...
COMPGEOM
14 years 1 months ago
1994 ACM
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 ...
|
Discrete Geometry