Dwyer (2-Dimensional Delaunay Triangulation Delaunay Triangulation)

From Algorithm Wiki

Revision as of 08:44, 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

(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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Dwyer_(2-Dimensional_Delaunay_Triangulation_Delaunay_Triangulation)&oldid=47440"