Counting facets and incidences
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. © 1992 Springer-Verlag New York Inc.
Volume / Issue
Start / End Page
Electronic International Standard Serial Number (EISSN)
International Standard Serial Number (ISSN)
Digital Object Identifier (DOI)