Geometric relations among Voronoi diagrams

Two general classes of Voronoi diagrams are introduced and, along with their modifications to higher order, are shown to be geometrically related. This geometric background, on the one hand, serves to analyse the size and combinatorial structure and, on the other, implies general and efficient methods of construction for various important types of Voronoi diagrams considered in the literature.

[1]  P. McMullen.  The maximum numbers of faces of a convex polytope , 1970 .

[2]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[3]  D. T. Lee,et al.  Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.

[4]  D. T. Lee,et al.  Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[5]  R. Seidel.  A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions , 1981 .

[6]  J. Linhart,et al.  Dirichletsche Zellenkomplexe mit maximaler Eckenzahl , 1981 .

[7]  Franz Aurenhammer,et al.  An optimal algorithm for constructing the weighted voronoi diagram in the plane , 1984, Pattern Recognit..

[8]  Hiroshi Imai,et al.  Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..

[9]  Ethan D. Bolker,et al.  Recognizing Dirichlet tessellations , 1985 .

[10]  Raimund Seidel,et al.  Constructing higher-dimensional convex hulls at logarithmic cost per face , 1986, STOC '86.

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

[12]  E. Bolker,et al.  Generalized Dirichlet tessellations , 1986 .

[13]  Bernard Chazelle,et al.  Computing the Largest Empty Rectangle , 1986, SIAM J. Comput..

[14]  Franz Aurenhammer.  A New Duality Result Concerning Voronoi Diagrams , 1986, ICALP.

[15]  Franz Aurenhammer,et al.  The One-Dimensional Weighted Voronoi Diagram , 1986, Information Processing Letters.

[16]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[17]  Chee-Keng Yap,et al.  AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[18]  Franz Aurenhammer,et al.  A criterion for the affine equivalence of cell complexes inRd and convex polyhedra inRd+1 , 1987, Discret. Comput. Geom..