3-dimensional Convex Hull: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
n: number of line segments | $n$: number of line segments | ||
h: number of points on the convex hull | $h$: number of points on the convex hull | ||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 24: | Line 24: | ||
|- | |- | ||
| [[Incremental convex hull algorithm; Michael Kallay ( Convex Hull)|Incremental convex hull algorithm; Michael Kallay]] || 1984 || $O(n log n)$ || || Exact || Deterministic || [https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/002001908490084X Time] | | [[Incremental convex hull algorithm; Michael Kallay ( Convex Hull)|Incremental convex hull algorithm; Michael Kallay]] || 1984 || $O(n \log n)$ || || Exact || Deterministic || [https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/002001908490084X Time] | ||
|- | |- | ||
|} | |} | ||
Latest revision as of 08:19, 10 April 2023
Description
Here, we are looking at the 3-dimensional case.
Related Problems
Generalizations: d-dimensional Convex Hull
Related: 2-dimensional Convex Hull, 2-dimensional Convex Hull, Online, 2-dimensional Convex Hull, Dynamic
Parameters
$n$: number of line segments
$h$: number of points on the convex hull
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Incremental convex hull algorithm; Michael Kallay | 1984 | $O(n \log n)$ | Exact | Deterministic | Time |
References/Citation
https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF02712873