N-dimensional Quickhull (d-dimensional Convex Hull Convex Hull)

From Algorithm Wiki
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n*f(h)$/h) where f(h) denotes the maximum number of facets with h vertices == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1996 == Reference == https://dl.acm.org/doi/pdf/10.1145/235815.235821")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n*f(h)$/h) where f(h) denotes the maximum number of facets with h vertices

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1996

Reference

https://dl.acm.org/doi/pdf/10.1145/235815.235821

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=N-dimensional_Quickhull_(d-dimensional_Convex_Hull_Convex_Hull)&oldid=45068"