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

Time Complexity

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

Space Complexity

words

()

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1996

Reference

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