Seidel's Shelling Algorithm (d-dimensional Convex Hull Convex Hull)

From Algorithm Wiki
Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2}+f_1*log(n)$) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1986 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/12130.12172")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2}+f_1*log(n)$)

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1986

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/12130.12172

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Seidel%27s_Shelling_Algorithm_(d-dimensional_Convex_Hull_Convex_Hull)&oldid=45066"