Counting facets and incidences

Pankaj K. Agarwal, Boris Aronov

    Research output: Contribution to journalArticle

    Abstract

    We show that m distinct cells in an arrangement of n planes in ℝ3 are bounded by O(m2/3n+n2) faces, which in turn yields a tight bound on the maximum number of facets bounding m cells in an arrangement of n hyperplanes in ℝd, for every d≥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 the O(m2/3nd/3+nd-1) bound on the number of incidences between n hyperplanes in ℝd and m vertices of their arrangement.

    Original languageEnglish (US)
    Pages (from-to)359-369
    Number of pages11
    JournalDiscrete & Computational Geometry
    Volume7
    Issue number1
    DOIs
    StatePublished - Dec 1992

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Geometry and Topology
    • Discrete Mathematics and Combinatorics
    • Computational Theory and Mathematics

    Fingerprint Dive into the research topics of 'Counting facets and incidences'. Together they form a unique fingerprint.

  • Cite this