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

From Algorithm Wiki

Revision as of 10:52, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == 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 == 1985 == Reference == http://www.geom.uiuc.edu/~samuelp/del_project.html")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

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

1985

Reference

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

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