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

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(m2/3n logn +n2); we can calculatem such cells specified by a point in each, in worst-case timeO(m2/3n log3n+n2 logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m2/3n logn+n2), but this number is onlyO(m3/5−δn4/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((m3/4−δn3/4+3δ+m) log2n+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([m3/4−δn3/4+3δ+m] log2n+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(m2/3nd/3 logn+nd−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.

[1]  Micha Sharir,et al.  Intersection and decomposition algorithms for arrangements of curves in the plane , 1989 .

[2]  Endre Szemerédi,et al.  Extremal problems in discrete geometry , 1983, Comb..

[3]  Herbert Edelsbrunner,et al.  On the maximal number of edges of many faces in an arrangement , 1986, J. Comb. Theory, Ser. A.

[4]  David E. Muller,et al.  Finding the Intersection of n Half-Spaces in Time O(n log n) , 1979, Theor. Comput. Sci..

[5]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[6]  Herbert Edelsbrunner,et al.  The upper envelope of piecewise linear functions: Tight bounds on the number of faces , 1989, Discret. Comput. Geom..

[7]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersections , 1982, ICALP.

[8]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[9]  Kenneth L. Clarkson,et al.  Combinatorial complexity bounds for arrangements of curves and surfaces , 2015, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10]  David Haussler,et al.  The complexity of cells in three-dimensional arrangements , 1986, Discret. Math..

[11]  Bernard Chazelle,et al.  How to Search in History , 1983, Inf. Control..

[12]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[13]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[14]  Kenneth L. Clarkson,et al.  A probabilistic algorithm for the post office problem , 1985, STOC '85.

[15]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[16]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[17]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[18]  Micha Sharir,et al.  Triangles in space or building (and analyzing) castles in the air , 1990, Comb..

[19]  Leonidas J. Guibas,et al.  The complexity of many faces in arrangements of lines of segments , 1988, SCG '88.

[20]  R. Canham.  A theorem on arrangements of lines in the plane , 1969 .

[21]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[22]  Leonidas J. Guibas,et al.  Implicitly representing arrangements of lines or segments , 2011, SCG '88.