Bowyer–Watson algorithm (Voronoi Diagrams Voronoi Diagrams)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$ words
(Computes the Delaunay triangulation first (O(n) space), then uses that to generate the Voronoi diagram)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1981