Fortune ( Delaunay Triangulation)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$ words
(See Fortune's Algorithm (Voronoi diagrams); Voronoi diagram gives us O(n) circumcenters which can be used to find the O(n) triangles)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM?
Year
1987
Reference
http://www.wias-berlin.de/people/si/course/files/Fortune87-SweepLine-Voronoi.pdf