Voronoi Diagrams: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:Voronoi Diagrams (Voronoi Diagrams)}} == Description == Given a set of n points in 2-dimensional space, compute the Voronoi diagram with the n points as seeds. == Parameters == <pre>n: number of points</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams)|For...")
 
No edit summary
Line 6: Line 6:
== Parameters ==  
== Parameters ==  


<pre>n: number of points</pre>
n: number of points


== Table of Algorithms ==  
== Table of Algorithms ==  

Revision as of 12:02, 15 February 2023

Description

Given a set of n points in 2-dimensional space, compute the Voronoi diagram with the n points as seeds.

Parameters

n: number of points

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Fortune's algorithm 1986 $O(nlogn)$ $O(n)$ auxiliary Exact Deterministic Time & Space
Linde–Buzo–Gray algorithm 1980 $O(nlogn)$ Exact Deterministic Time
Bowyer–Watson algorithm 1981 $O(nlogn)$ $O(n)$ auxiliary Exact Deterministic Time

Time Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Space Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Pareto Decades graph

Error creating thumbnail: Unable to save thumbnail to destination