Counting facets and incidences

We show thatm distinct cells in an arrangement ofn planes in ℝ3 are bounded byO(m2/3n+n2) faces, which in turn yields a tight bound on the maximum number of facets boundingm cells in an arrangement ofn hyperplanes in ℝd, for everyd≥3. In addition, the method is extended to obtain tight bounds on the maximum number of faces on the boundary of all nonconvex cells in an arrangement of triangles in ℝ3. We also present a simpler proof of theO(m2/3nd/3+nd−1) bound on the number of incidences betweenn hyperplanes in ℝd andm vertices of their arrangement.

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

[2]  David P. Dobkin,et al.  Partitioning Space for Range Queries , 1989, SIAM J. Comput..

[3]  Micha Sharir,et al.  Castles in the air revisited , 1992, SCG '92.

[4]  Micha Sharir,et al.  On the sum of squares of cell complexities in hyperplane arrangements , 1991, SCG '91.

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

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

[7]  József Beck,et al.  On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry , 1983, Comb..

[8]  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.

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

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

[11]  Leonidas J. Guibas,et al.  The complexity of many cells in arrangements of planes and related problems , 1990, Discret. Comput. Geom..

[12]  Micha Sharir,et al.  The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis , 2011, Discret. Comput. Geom..

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