The smallest convex set containing a given collection of points in a real linear space. Also known as convex linear hull.
For a set S in space, the smallest
convex set containing S. In the plane, the convex hull can
be visualized as the shape assumed by a rubber band that has
been stretched around the set S and released to conform as
closely as possible to S.
We will also see that a necessary (but not sufficient) condition for those point features to conflict with the simplified line is that the point features must lie within the closed convex hull of the original polyline, as well as being within [Epsilon] of the original polyline.