Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams)
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