Guibas; Stofli (2-Dimensional Delaunay Triangulation Delaunay Triangulation)

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)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM?

Year

1985

Reference

http://www.geom.uiuc.edu/~samuelp/del_project.html