d-dimensional Convex Hull
Here, we are looking at the general d-dimensional case.
Parameters
- : number of line segments
- : number of points on the convex hull
- : number of facets on the convex hull
- : number of subfacets on the convex hull
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 3 of 3 algorithms
| See more | ||||
|---|---|---|---|---|
| N-dimensional Quickhull | 1996 | O(n*f(h)/h) where f(h) denotes the maximum number of facets with h vertices | ||
| Seidel's Shelling Algorithm | 1986 | O(n^2+f_1*log(n)) | ||
| Chand-Kapur, Gift Wrapping | 1970 | O(n*f_1) |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table