Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Voronoi Diagrams and Arrangements
Authors: Edelsbrunner, Herbert
Seidel, Raimund
Keywords: computer science
technical report
Issue Date: Mar-1985
Publisher: Cornell University
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.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
85-669.pdf1.43 MBAdobe PDFView/Open
85-669.ps474.38 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us