2-dimensional Convex Hull (Convex Hull)
Jump to navigation
Jump to search
Description
The convex hull or convex envelope or convex closure of a set X of points in the Euclidean plane or in a Euclidean space (or; more generally; in an affine space over the reals) is the smallest convex set that contains X. Here, we are looking at the 2-dimensional case.
Related Problems
Generalizations: d-dimensional Convex Hull
Subproblem: 2-dimensional Convex Hull, Online, 2-dimensional Convex Hull, Dynamic
Related: 3-dimensional Convex Hull, 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 |