Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams)

From Algorithm Wiki

Revision as of 09:42, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(https://www.wias-berlin.de/people/si/course/files/Fortune87-SweepLine-Voronoi.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1986

Reference

http://www.wias-berlin.de/people/si/course/files/Fortune87-SweepLine-Voronoi.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Fortune%27s_algorithm_(Voronoi_Diagrams_Voronoi_Diagrams)&oldid=47396"