201
click to vote
COMPGEOM
15 years 11 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...
200
click to vote
COMPGEOM
15 years 11 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...
187
Voted
COMPGEOM
15 years 11 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...
177
click to vote
COMPGEOM
15 years 11 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 ...
173
click to vote
COMPGEOM
15 years 11 months ago
1994 ACM
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...
|
Discrete Geometry