Counting facets and incidences

DOI10.1007/BF02187848MaRDI QIDQ1189286zbMATH OpenOpenAlexWikidataFDO

Authors Pankaj K. Agarwal, Boris Aronov

Publication date 26 September 1992

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131201

zbMATH Keywords

arrangementsfacetstight bounds

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Recommendations

• The complexity of many cells in arrangements of planes and related problems
• The complexity of cells in three-dimensional arrangements
• Cells with many facets in arrangements of hyperplanes
• Polytopes in arrangements
• On counting point-hyperplane incidences

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• Castles in the air revisited
• Combinatorial complexity bounds for arrangements of curves and spheres
• Extremal problems in discrete geometry
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• On the maximal number of edges of many faces in an arrangement
• On the sum of squares of cell complexities in hyperplane arrangements
• Partitioning Space for Range Queries
• The complexity of cells in three-dimensional arrangements
• The complexity of many cells in arrangements of planes and related problems
• The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
• Triangles in space or building (and analyzing) castles in the air

Cited in

(17)

• Polytopes in arrangements
• On the complexity of a single cell in certain arrangements of surfaces related to motion planning
• On the sum of squares of cell complexities in hyperplane arrangements
• Nondegenerate spheres in four dimensions
• Counting faces in the extended Shi arrangement
• Robot motion planning and the single cell problem in arrangements
• Two theorems on point-flat incidences
• On a Question of Bourgain about Geometric Incidences
• Many-face complexity in incremental convex arrangements
• Cells with many facets in arrangements of hyperplanes
• A new technique for analyzing substructures in arrangements of piecewise linear surfaces
• Castles in the air revisited
• On the number of regions in an \(m\)-dimensional space cut by \(n\) hyperplanes
• The complexity of cells in three-dimensional arrangements
• A bichromatic incidence bound and an application
• On counting point-hyperplane incidences
• Cell complexities in hyperplane arrangements

This page was built for publication: Counting facets and incidences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189286)