Abstract

We give simple randomized incremental algorithms for computing the ≤k-level in an
arrangement of n hyperplanes in two- and three-dimensional space. The expected running
time of our algorithms is O(nk+nα(n) logn) for the planar case, and O(nk2+n log3 n) for
the three-dimensional case. Both bounds are optimal unless k is very small. The
... read more