CONSTRUCTING LEVELS IN ARRANGEMENTS AND HIGHER-ORDER VORONOI DIAGRAMS

We give simple randomized incremental algorithms for computing the les s than or equal to k-level in an arrangement of n lines in the plane o r in an arrangement of n planes in R-3. The expected running time of o ur algorithms is O(nk + n alpha(n)logn) for the planar case and O(nk(2 ) + nlog(3)n) for the three-dimensional case. Both bounds are optimal unless k is very small. The algorithm generalizes to computing the les s than or equal to k-level in an arrangement of discs or x-monotone Jo rdan curves in the plane. Our approach can also compute the k-level; t his yields a randomized algorithm for computing the order-k Voronoi di agram of n points in the plane in expected time O(k(n - k) logn + nlog (3)n).