Counting facets and incidences

DOI10.1007/BF02187848zbMath0747.68092MaRDI QIDQ1189286

Boris Aronov, Pankaj K. Agarwal

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

arrangements; facets; tight bounds

Mathematics Subject Classification ID

52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

52C35: Arrangements of points, flats, hyperplanes (aspects of discrete geometry)

Related Items

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, Castles in the air revisited, Many-face complexity in incremental convex arrangements, A new technique for analyzing substructures in arrangements of piecewise linear surfaces, Robot motion planning and the single cell problem in arrangements, On a Question of Bourgain about Geometric Incidences

Cites Work

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