On the sum of squares of cell complexities in hyperplane arrangements

[1]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[2]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[3]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

[4]  Jirí Matousek.  On Vertical Ray Shooting in Arrangements , 1992, Comput. Geom..

[5]  Micha Sharir,et al.  Castles in the air revisited , 1992, SCG '92.

[6]  Boris Aronov,et al.  Counting facets and incidences , 1992, Discret. Comput. Geom..

[7]  Micha Sharir,et al.  On the zone of a surface in a hyperplane arrangement , 1993, Discret. Comput. Geom..

[8]  Micha Sharir,et al.  On the Zone Theorem for Hyperplane Arrangements , 1991, SIAM J. Comput..

[9]  Bernard Chazelle,et al.  Point Location Among Hyperplanes and Unidirectional Ray-shooting , 1994, Comput. Geom..