Bowyer–Watson algorithm (Voronoi Diagrams Voronoi Diagrams)

From Algorithm Wiki
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

Reference

https://academic-oup-com.ezproxy.canberra.edu.au/comjnl/article/24/2/167/338200