Counting facets and incidences
- First Online:
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.
Unable to display preview. Download preview PDF.
- [AMS]B. Aronov, J. Matoušek and M. Sharir, On the sum of squares of cell complexities in hyperplane arrangements.Proceedings of the 7th Annual Symposium on Computational Geometry, 1991, pp. 307–313.Google Scholar
- [AS2]B. Aronov and M. Sharir, Castles in the air revisited.Proceedings of the 8th Annual Symposium on Computational Geometry, 1992, to appear.Google Scholar