3-dimensional Convex Hull (Convex Hull)

From Algorithm Wiki
Revision as of 08:19, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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