TY - JOUR
AB - We propose a uniform and general framework for defining and dealing with Voronoi diagrams. In this framework a Voronoi diagram is a partition of a domainD induced by a finite number of real valued functions onD. Valuable insight can be gained when one considers how these real valued functions partitionD ×R. With this view it turns out that the standard Euclidean Voronoi diagram of point sets inR d along with its order-k generalizations are intimately related to certain arrangements of hyperplanes. This fact can be used to obtain new Voronoi diagram algorithms. We also discuss how the formalism of arrangements can be used to solve certain intersection and union problems.
AU - Herbert Edelsbrunner
AU - Seidel, Raimund
ID - 4108
IS - 1
JF - Discrete & Computational Geometry
TI - Voronoi diagrams and arrangements
VL - 1
ER -