Drysdale; Su (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(n)$ == Space Complexity == $O(n)$? words (See other incremental algorithms) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM? == Year == 1996 == Reference == https://web.archive.org/web/20120308043808/http://www.cs.berkeley.edu/~jrs/meshpapers/SuDrysdale.pdf")

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

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$? words

(See other incremental algorithms)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM?

Year

1996

Reference

https://web.archive.org/web/20120308043808/http://www.cs.berkeley.edu/~jrs/meshpapers/SuDrysdale.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Drysdale;_Su_(2-Dimensional_Delaunay_Triangulation_Delaunay_Triangulation)&oldid=44845"