COMPGEOM
1994
ACM
14 years 1 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...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
COMPGEOM
1994
ACM
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
1994
ACM
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 ...
COMPGEOM
1994
ACM
14 years 1 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...
COMPGEOM
1994
ACM
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
1994
ACM
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
1993
ACM
14 years 1 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
COMPGEOM
1993
ACM
14 years 1 months ago
1993
ACM
COMPGEOM
1993
ACM
14 years 1 months ago
1993
ACM
