Carathéodory’s theorem
Suppose a point lies in the convex hull of a set . Then there is a subset consisting of no more than points such that lies in the convex hull of .
For example, if a point is contained in a convex hull of a set , then there are three points in that determine the triangle containing , provided, of course, that contains at least three points.