Discrete & Computational Geometry

, Volume 7, Issue 4, pp 359–369

Counting facets and incidences

Authors

  • Pankaj K. Agarwal
    • Computer Science DepartmentDuke University
  • Boris Aronov
    • Computer Science DepartmentPolytechnic University
Article

DOI: 10.1007/BF02187848

Cite this article as:
Agarwal, P.K. & Aronov, B. Discrete Comput Geom (1992) 7: 359. doi:10.1007/BF02187848

Abstract

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.

Download to read the full article text

Copyright information

© Springer-Verlag New York Inc. 1992