Fortune's algorithm (Voronoi Diagrams Voronoi Diagrams): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ auxiliary 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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$ words | ||
(https://www.wias-berlin.de/people/si/course/files/Fortune87-SweepLine-Voronoi.pdf) | (https://www.wias-berlin.de/people/si/course/files/Fortune87-SweepLine-Voronoi.pdf) | ||
Latest revision as of 09:42, 10 April 2023
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