The other four faces need only contain a point of the convex hull.

The spline is contained in the convex hull of its control points.

Suppose that is a point in the intersection of these two convex hulls.

Then, the theorem states that is the closed convex hull of its extreme points.

Construct a convex hull for each set of nearest neighbors and the original data point.

Equivalently, a line segment is the convex hull of two points.

Efficient kinetic convex hull in dimensions higher than 2 is also an open problem.

It can also be easily demonstrated that the observer design is typically needs large convex hull.

Therefore in the general case the convex hull of n points cannot be computed more quickly than sorting.

The second point is assumed to be a candidate convex hull vertex as well.

Convex hulls of linearly moving points can change times.

Figure 1 displays the convex hull in 2D for the vector .

Expressing this as a single formula, the convex hull is the set:

The compound is a facetting of the convex hull.

It is customary to also consider the polyhedron formed by the convex hull of the points.

In this example, the orthogonal convex hull is connected.

So the holomorphic envelope of any tube is equal to its convex hull.

Above, denotes the convex hull of the set.

Kinetic convex hull can be used to solve the following related problems:

It is sufficient to find the smallest enclosing box for the convex hull of the objects in question.

All convex combinations are within the convex hull of the given points.

The upper and lower envelopes can be maintained using the standard data structure for kinetic convex hull.

The algorithm finds all vertices of the convex hull ordered along its boundary.

It shares the same vertex arrangement with the icosidodecahedron, its convex hull.

Given n points in the plane, find a largest circle centered within their convex hull and enclosing none of them.