2 search results - page 1 / 1 » A Linear-Time Randomized Algorithm for the Bounded Voronoi D... |
COMPGEOM
1993
ACM
13 years 8 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
1994
ACM
13 years 8 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...