A lower bound on Voronoi diagram complexity

[1]  Raimund Seidel,et al.  Voronoi diagrams and arrangements , 1986, Discret. Comput. Geom..

[2]  Micha Sharir,et al.  Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications , 1995, WADS.

[3]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[4]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[5]  János Pach,et al.  Extremal Problems for Geometric Hypergraphs , 1998, Discret. Comput. Geom..

[6]  Boaz Tagansky,et al.  A new technique for analyzing substructures in arrangements of piecewise linear surfaces , 1996, Discret. Comput. Geom..

[7]  Micha Sharir.  Almost tight upper bounds for lower envelopes in higher dimensions , 1994, Discret. Comput. Geom..

[8]  J. Sack,et al.  Handbook of computational geometry , 2000 .

[9]  Micha Sharir,et al.  Voronoi diagrams of lines in 3-space under polyhedral convex distance functions , 1995, SODA '95.

[10]  Mariette Yvinec,et al.  Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions , 1998, Discret. Comput. Geom..

[11]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[12]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

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