115
click to vote
COMPGEOM
15 years 4 months ago
1994 ACM 
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...
113
Voted
COMPGEOM
15 years 4 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...
110
Voted
COMPGEOM
15 years 4 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...
106
click to vote
COMPGEOM
15 years 4 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...
103
Voted
COMPGEOM
15 years 4 months ago
1994 ACM
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...
|
Discrete Geometry