dc.contributor.author Edelsbrunner, Herbert en_US dc.contributor.author Seidel, Raimund en_US dc.date.accessioned 2007-04-23T17:08:45Z dc.date.available 2007-04-23T17:08:45Z dc.date.issued 1985-03 en_US dc.identifier.citation http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-669 en_US dc.identifier.uri https://hdl.handle.net/1813/6509 dc.description.abstract 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 domain $D$ induced by a finite number of real valued functions on $D$. Valuable insight can be gained when one considers how these real valued functions partition $D \times R$. With this view it turns out that the standard Euclidean Voronoi Diagram of point sets in $R^{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. en_US dc.format.extent 1462760 bytes dc.format.extent 485765 bytes dc.format.mimetype application/pdf dc.format.mimetype application/postscript dc.language.iso en_US en_US dc.publisher Cornell University en_US dc.subject computer science en_US dc.subject technical report en_US dc.title Voronoi Diagrams and Arrangements en_US dc.type technical report en_US
﻿