TY - JOUR
T1 - Cell complexities in hyperplane arrangements
AU - Aronov, Boris
AU - Sharir, Micha
PY - 2004/7
Y1 - 2004/7
N2 - We derive improved bounds on the complexity, i.e., the total number of faces of all dimensions, of many cells in arrangements of hyperplanes in higher dimensions, and use these bounds to obtain a very simple proof of an earlier bound, due to Aronov, Matoušek, and Sharir, on the sum of squares of cell complexities in such an arrangement.
AB - We derive improved bounds on the complexity, i.e., the total number of faces of all dimensions, of many cells in arrangements of hyperplanes in higher dimensions, and use these bounds to obtain a very simple proof of an earlier bound, due to Aronov, Matoušek, and Sharir, on the sum of squares of cell complexities in such an arrangement.
UR - https://www.scopus.com/pages/publications/3142778524
U2 - 10.1007/s00454-003-0854-z
DO - 10.1007/s00454-003-0854-z
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:3142778524
SN - 0179-5376
VL - 32
SP - 107
EP - 115
JO - Discrete and Computational Geometry
JF - Discrete and Computational Geometry
IS - 1
ER -