On the sum of squares of cell complexities in hyperplane arrangements

DOI10.1016/0097-3165(94)90027-2zbMath0799.52009OpenAlexW2043060962WikidataQ56442898 ScholiaQ56442898MaRDI QIDQ1320395

Ji{ří} Matoušek, Boris Aronov, Micha Sharir

Publication date: 6 June 1994

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90027-2

zbMATH Keywords

arrangement of hyperplanescell complexityface countzones of arrangements

Mathematics Subject Classification ID

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

Related Items

On stabbing lines for convex polyhedra in 3D ⋮ Castles in the air revisited ⋮ On lines missing polyhedral sets in 3-space ⋮ Vertical decomposition of arrangements of hyperplanes in four dimensions ⋮ Almost tight upper bounds for the single cell and zone problems in the three dimensions ⋮ Counting facets and incidences ⋮ On the zone of a surface in a hyperplane arrangement ⋮ Locating an obnoxious plane ⋮ Robot motion planning and the single cell problem in arrangements

Cites Work

• Unnamed Item
• The complexity of many cells in arrangements of planes and related problems
• Combinatorial complexity bounds for arrangements of curves and spheres
• Counting facets and incidences
• On the zone of a surface in a hyperplane arrangement
• Point location among hyperplanes and unidirectional ray-shooting
• Castles in the air revisited
• On vertical ray shooting in arrangements
• Applications of random sampling in computational geometry. II
• On the Zone Theorem for Hyperplane Arrangements

This page was built for publication: On the sum of squares of cell complexities in hyperplane arrangements