Abstract
A Voronoi diagram is a cell complex which is defined with respect to a finite set of objects in some Euclidean space. Each cell of the diagram belongs to one object of the set and contains all points for which this object is the closest, or the one with the dominant influence in some sense. The Voronoi diagram in fact expresses the proximity information of the set of objects at hand in a very explicit and computationally useful manner. We will see examples of uses of this information (in particular in Section 13.2). First, we provide a rather general definition of the notion of a Voronoi diagram which subsumes all common variants as specializations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Edelsbrunner, H. (1987). Voronoi Diagrams. In: Algorithms in Combinatorial Geometry. EATCS Monographs in Theoretical Computer Science, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61568-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-61568-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64873-1
Online ISBN: 978-3-642-61568-9
eBook Packages: Springer Book Archive