Discrete & Computational Geometry

, Volume 7, Issue 4, pp 359–369

Counting facets and incidences

  • Pankaj K. Agarwal
  • Boris Aronov


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.

Unable to display preview. Download preview PDF.


  1. [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
  2. [AS1]
    B. Aronov and M. Sharir, Triangles in space or building (and analyzing) castles in the air,Combinatorica 10 (1990), 137–173.MathSciNetCrossRefMATHGoogle Scholar
  3. [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
  4. [B]
    J. Beck, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdös in combinatorial geometry,Combinatorica 3 (1983), 281–297.MathSciNetCrossRefMATHGoogle Scholar
  5. [CEG+]
    K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and surfaces,Discrete and Computational Geometry 5 (1990), 99–160.MathSciNetCrossRefMATHGoogle Scholar
  6. [E]
    H. Edelsbrunner,Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.CrossRefMATHGoogle Scholar
  7. [EGS]
    H. Edelsbrunner, L. Guibas, and M. Sharir. Complexity of many cells in arrangements of planes and related problems,Discrete and Computational Geometry 5 (1990), 197–216.MathSciNetCrossRefMATHGoogle Scholar
  8. [EH]
    H. Edelsbrunner and D. Haussler, The complexity of cells in three-dimensional arrangements,Discrete Mathematics 60 (1986), 139–146.MathSciNetCrossRefMATHGoogle Scholar
  9. [EW]
    H. Edelsbrunner and E. Welzl, On the maximum number of edges of many faces in an arrangement,Journal of Combinatorial Theory Ser. A 41 (1986), 159–166.MathSciNetCrossRefMATHGoogle Scholar
  10. [PS]
    J. Pach and M. Sharir, The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: combinatorial analysis,Discrete and Computational Geometry 4 (1989), 291–310.MathSciNetCrossRefMATHGoogle Scholar
  11. [ST]
    E. Szemerédi and W. Trotter, Jr., Extremal problems in discrete geometry,Combinatorica 3 (1983), 381–392.MathSciNetCrossRefMATHGoogle Scholar
  12. [YDEP]
    F. F. Yao, D. Dobkin, H. Edelsbrunner, and M. S. Paterson, Partitioning space for range queries,SIAM Journal on Computing 18 (1989), 371–384.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1992

Authors and Affiliations

  • Pankaj K. Agarwal
    • 1
  • Boris Aronov
    • 2
  1. 1.Computer Science DepartmentDuke UniversityDurhamUSA
  2. 2.Computer Science DepartmentPolytechnic UniversityBrooklynUSA

Personalised recommendations