Convex Hull
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.
DCH
d-dimensional Convex Hull
3 Algorithms
2CH
2-dimensional Convex Hull
17 Algorithms
3CH
3-dimensional Convex Hull
13 Algorithms
- d-dimensional Convex Hull
- 2CH2-dimensional Convex Hull
17 Algorithms
- 3CH3-dimensional Convex Hull
13 Algorithms