On the sum of squares of cell complexities in hyperplane arrangements

Authors:
Boris Aronov;Jiří Matoušek;Micha Sharir
Affiliations:
Department of Computer Science, Polytechnic University, Brooklyn, NY;Department of Applied Mathematics, Charles University, 118 00 Praha 1, Czechoslovakia;School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel and Courant Institute of Mathematical Sciences, New York University, NY
Venue:
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Year:
1991

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Combinatorial complexity bounds for arrangements of curves and spheres

Discrete & Computational Geometry - Special issue on the complexity of arrangements
The complexity of many cells in arrangements of planes and related problems

Discrete & Computational Geometry - Special issue on the complexity of arrangements
Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988

Castles in the air revisited

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Almost tight upper bounds for the single cell and zone problems in three dimensions

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Combining multiple heuristics

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Hi-index	0.00