N-dimensional Quickhull (d-dimensional Convex Hull Convex Hull)
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.ezproxy.canberra.edu.au/doi/pdf/10.1145/235815.235821