The complexity of many cells in arrangements of planes and related problems

The maximum number of faces boundingm distinct cells in an arrangement ofn planes is O(m2/3n logn +n2); the authors can calculatem such cells specified by a point in each, in worst-case timeO(m3/5−δn4/5+2δ+m+n logm), for any collection of points no three of which are collinear.

Abstract

We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m 2/3 n logn +n 2); we can calculatem such cells specified by a point in each, in worst-case timeO(m 2/3 n log3 n+n 2 logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m 2/3 n logn+n 2), but this number is onlyO(m 3/5−δ n 4/5+2δ +m+n logm), for anyδ>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m 3/4−δ n 3/4+3δ +m) log2 n+n logn logm) for anyδ>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m 3/4−δ n 3/4+3δ +m] log2 n+n logn logm) for anyδ>0. (v) The maximum number of facets (i.e., (d−1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m 2/3 n d/3 logn+n d−1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.