Dwyer (2-Dimensional Delaunay Triangulation Delaunay Triangulation)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$? words
(Space recursion is S(n)=max(2S(n/2), O(n)) as triangulations from recursive calls are modified in the merge step)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM?
Year
1987
Reference
https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF01840356