# # Convex Hull

## # Definitions

A set of points in a Euclidean space is defined to be convex if it contains the line segments connecting each pair of its points. The convex hull of a given set X may be defined as:

- The (unique) minimal convex set containing X
- The intersection of all convex sets containing X
- The set of all convex combinations of points in X
- The union of all simplices with vertices in X

# # Algorithm

I will introduce two method to find the convex hull.