A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations

We describe a new algorithm for computing the Voronoi diagram of a set of n points in constant-dimensional Euclidean space. The running time of our algorithm is O ( f log n log Δ ) where f is the output complexity of the Voronoi diagram and Δ is the spread of the input, the ratio of largest to small...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete & computational geometry 2014-10, Vol.52 (3), p.476-491
Hauptverfasser:	Miller, Gary L., Sheehy, Donald R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Combinatorics Complexity Computational mathematics Computational Mathematics and Numerical Analysis Construction Euclidean geometry Kinetics Mathematical analysis Mathematics Mathematics and Statistics Polynomials State of the art Texts
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!