Bowyer–Watson algorithm (Voronoi Diagrams Voronoi Diagrams)

From Algorithm Wiki
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ auxiliary 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/comjnl/article/24/2/167/338200")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

Space Complexity

$O(n)$ auxiliary 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/comjnl/article/24/2/167/338200

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bowyer–Watson_algorithm_(Voronoi_Diagrams_Voronoi_Diagrams)&oldid=45379"