Convex hull

Last updated

In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset.

Contents

Convex hulls of open sets are open, and convex hulls of compact sets are compact. Every compact convex set is the convex hull of its extreme points. The convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of points. The algorithmic problems of finding the convex hull of a finite set of points in the plane or other low-dimensional Euclidean spaces, and its dual problem of intersecting half-spaces, are fundamental problems of computational geometry. They can be solved in time ${\displaystyle O(n\log n)}$ for two or three dimensional point sets, and in time matching the worst-case output complexity given by the upper bound theorem in higher dimensions.

As well as for finite point sets, convex hulls have also been studied for simple polygons, Brownian motion, space curves, and epigraphs of functions. Convex hulls have wide applications in mathematics, statistics, combinatorial optimization, economics, geometric modeling, and ethology. Related structures include the orthogonal convex hull, convex layers, Delaunay triangulation and Voronoi diagram, and convex skull.

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 ${\displaystyle X}$ may be defined as [1]

1. The (unique) minimal convex set containing ${\displaystyle X}$
2. The intersection of all convex sets containing ${\displaystyle X}$
3. The set of all convex combinations of points in ${\displaystyle X}$
4. The union of all simplices with vertices in ${\displaystyle X}$

For bounded sets in the Euclidean plane, not all on one line, the boundary of the convex hull is the simple closed curve with minimum perimeter containing ${\displaystyle X}$. One may imagine stretching a rubber band so that it surrounds the entire set ${\displaystyle S}$ and then releasing it, allowing it to contract; when it becomes taut, it encloses the convex hull of ${\displaystyle S}$. [2] This formulation does not immediately generalize to higher dimensions: for a finite set of points in three-dimensional space, a neighborhood of a spanning tree of the points encloses them with arbitrarily small surface area, smaller than the surface area of the convex hull. [3] However, in higher dimensions, variants of the obstacle problem of finding a minimum-energy surface above a given shape can have the convex hull as their solution. [4]

For objects in three dimensions, the first definition states that the convex hull is the smallest possible convex bounding volume of the objects. The definition using intersections of convex sets may be extended to non-Euclidean geometry, and the definition using convex combinations may be extended from Euclidean spaces to arbitrary real vector spaces or affine spaces; convex hulls may also be generalized in a more abstract way, to oriented matroids. [5]

Equivalence of definitions

It is not obvious that the first definition makes sense: why should there exist a unique minimal convex set containing ${\displaystyle X}$, for every ${\displaystyle X}$? However, the second definition, the intersection of all convex sets containing ${\displaystyle X}$, is well-defined. It is a subset of every other convex set ${\displaystyle Y}$ that contains ${\displaystyle X}$, because ${\displaystyle Y}$ is included among the sets being intersected. Thus, it is exactly the unique minimal convex set containing ${\displaystyle X}$. Therefore, the first two definitions are equivalent. [1]

Each convex set containing ${\displaystyle X}$ must (by the assumption that it is convex) contain all convex combinations of points in ${\displaystyle X}$, so the set of all convex combinations is contained in the intersection of all convex sets containing ${\displaystyle X}$. Conversely, the set of all convex combinations is itself a convex set containing ${\displaystyle X}$, so it also contains the intersection of all convex sets containing ${\displaystyle X}$, and therefore the second and third definitions are equivalent. [6]

In fact, according to Carathéodory's theorem, if ${\displaystyle X}$ is a subset of a ${\displaystyle d}$-dimensional Euclidean space, every convex combination of finitely many points from ${\displaystyle X}$ is also a convex combination of at most ${\displaystyle d+1}$ points in ${\displaystyle X}$. The set of convex combinations of a ${\displaystyle (d+1)}$-tuple of points is a simplex; in the plane it is a triangle and in three-dimensional space it is a tetrahedron. Therefore, every convex combination of points of ${\displaystyle X}$ belongs to a simplex whose vertices belong to ${\displaystyle X}$, and the third and fourth definitions are equivalent. [6]

Upper and lower hulls

In two dimensions, the convex hull is sometimes partitioned into two parts, the upper hull and the lower hull, stretching between the leftmost and rightmost points of the hull. More generally, for convex hulls in any dimension, one can partition the boundary of the hull into upward-facing points (points for which an upward ray is disjoint from the hull), downward-facing points, and extreme points. For three-dimensional hulls, the upward-facing and downward-facing parts of the boundary form topological disks. [7]

Topological properties

Closed and open hulls

The closed convex hull of a set is the closure of the convex hull, and the open convex hull is the interior (or in some sources the relative interior) of the convex hull. [8]

The closed convex hull of ${\displaystyle X}$ is the intersection of all closed half-spaces containing ${\displaystyle X}$. If the convex hull of ${\displaystyle X}$ is already a closed set itself (as happens, for instance, if ${\displaystyle X}$ is a finite set or more generally a compact set), then it equals the closed convex hull. However, an intersection of closed half-spaces is itself closed, so when a convex hull is not closed it cannot be represented in this way. [9]

If the open convex hull of a set ${\displaystyle X}$ is ${\displaystyle d}$-dimensional, then every point of the hull belongs to an open convex hull of at most ${\displaystyle 2d}$ points of ${\displaystyle X}$. The sets of vertices of a square, regular octahedron, or higher-dimensional cross-polytope provide examples where exactly ${\displaystyle 2d}$ points are needed. [10]

Preservation of topological properties

Topologically, the convex hull of an open set is always itself open, and the convex hull of a compact set is always itself compact. However, there exist closed sets for which the convex hull is not closed. [11] For instance, the closed set

${\displaystyle \left\{(x,y)\mathop {\bigg |} y\geq {\frac {1}{1+x^{2}}}\right\}}$

(the set of points that lie on or above the witch of Agnesi) has the open upper half-plane as its convex hull. [12]

The compactness of convex hulls of compact sets, in finite-dimensional Euclidean spaces, is generalized by the Krein–Smulian theorem, according to which the closed convex hull of a weakly compact subset of a Banach space (a subset that is compact under the weak topology) is weakly compact. [13]

Extreme points

An extreme point of a convex set is a point in the set that does not lie on any open line segment between any other two points of the same set. For a convex hull, every extreme point must be part of the given set, because otherwise it cannot be formed as a convex combination of given points. According to the Krein–Milman theorem, every compact convex set in a Euclidean space (or more generally in a locally convex topological vector space) is the convex hull of its extreme points. [14] However, this may not be true for convex sets that are not compact; for instance, the whole Euclidean plane and the open unit ball are both convex, but neither one has any extreme points. Choquet theory extends this theory from finite convex combinations of extreme points to infinite combinations (integrals) in more general spaces. [15]

Geometric and algebraic properties

Closure operator

The convex-hull operator has the characteristic properties of a closure operator: [16]

• It is extensive, meaning that the convex hull of every set ${\displaystyle X}$ is a superset of ${\displaystyle X}$.
• It is non-decreasing , meaning that, for every two sets ${\displaystyle X}$ and ${\displaystyle Y}$ with ${\displaystyle X\subseteq Y}$, the convex hull of ${\displaystyle X}$ is a subset of the convex hull of ${\displaystyle Y}$.
• It is idempotent , meaning that for every ${\displaystyle X}$, the convex hull of the convex hull of ${\displaystyle X}$ is the same as the convex hull of ${\displaystyle X}$.

When applied to a finite set of points, this is the closure operator of an antimatroid, the shelling antimatroid of the point set. Every antimatroid can be represented in this way by convex hulls of points in a Euclidean space of high-enough dimension. [17]

Minkowski sum

The operations of constructing the convex hull and taking the Minkowski sum commute with each other, in the sense that the Minkowski sum of convex hulls of sets gives the same result as the convex hull of the Minkowski sum of the same sets. This provides a step towards the Shapley–Folkman theorem bounding the distance of a Minkowski sum from its convex hull. [18]

Projective duality

The projective dual operation to constructing the convex hull of a set of points is constructing the intersection of a family of closed halfspaces that all contain the origin (or any other designated point). [19]

Special cases

Finite point sets

The convex hull of a finite point set ${\displaystyle S\subset \mathbb {R} ^{d}}$ forms a convex polygon when ${\displaystyle d=2}$, or more generally a convex polytope in ${\displaystyle \mathbb {R} ^{d}}$. Each extreme point of the hull is called a vertex, and (by the Krein–Milman theorem) every convex polytope is the convex hull of its vertices. It is the unique convex polytope whose vertices belong to ${\displaystyle S}$ and that encloses all of ${\displaystyle S}$. [2] For sets of points in general position, the convex hull is a simplicial polytope. [20]

According to the upper bound theorem, the number of faces of the convex hull of ${\displaystyle n}$ points in ${\displaystyle d}$-dimensional Euclidean space is ${\displaystyle O(n^{\lfloor d/2\rfloor })}$. [21] In particular, in two and three dimensions the number of faces is at most linear in ${\displaystyle n}$. [22]

Simple polygons

The convex hull of a simple polygon encloses the given polygon and is partitioned by it into regions, one of which is the polygon itself. The other regions, bounded by a polygonal chain of the polygon and a single convex hull edge, are called pockets. Computing the same decomposition recursively for each pocket forms a hierarchical description of a given polygon called its convex differences tree. [23] Reflecting a pocket across its convex hull edge expands the given simple polygon into a polygon with the same perimeter and larger area, and the Erdős–Nagy theorem states that this expansion process eventually terminates. [24]

Brownian motion

The curve generated by Brownian motion in the plane, at any fixed time, has probability 1 of having a convex hull whose boundary forms a continuously differentiable curve. However, for any angle ${\displaystyle \theta }$ in the range ${\displaystyle \pi /2<\theta <\pi }$, there will be times during the Brownian motion where the moving particle touches the boundary of the convex hull at a point of angle ${\displaystyle \theta }$. The Hausdorff dimension of this set of exceptional times is (with high probability) ${\displaystyle 1-\pi /2\theta }$. [25]

Space curves

For the convex hull of a space curve or finite set of space curves in general position in three-dimensional space, the parts of the boundary away from the curves are developable and ruled surfaces. [26] Examples include the oloid, the convex hull of two circles in perpendicular planes, each passing through the other's center, [27] the sphericon, the convex hull of two semicircles in perpendicular planes with a common center, and D-forms, the convex shapes obtained from Alexandrov's uniqueness theorem for a surface formed by gluing together two planar convex sets of equal perimeter. [28]

Functions

The convex hull or lower convex envelope of a function ${\displaystyle f}$ on a real vector space is the function whose epigraph is the lower convex hull of the epigraph of ${\displaystyle f}$. It is the unique maximal convex function majorized by ${\displaystyle f}$. [29] The definition can be extended to the convex hull of a set of functions (obtained from the convex hull of the union of their epigraphs, or equivalently from their pointwise minimum) and, in this form, is dual to the convex conjugate operation. [30]

Computation

In computational geometry, a number of algorithms are known for computing the convex hull for a finite set of points and for other geometric objects. Computing the convex hull means constructing an unambiguous, efficient representation of the required convex shape. Output representations that have been considered for convex hulls of point sets include a list of linear inequalities describing the facets of the hull, an undirected graph of facets and their adjacencies, or the full face lattice of the hull. [31] In two dimensions, it may suffice more simply to list the points that are vertices, in their cyclic order around the hull. [2]

For convex hulls in two or three dimensions, the complexity of the corresponding algorithms is usually estimated in terms of ${\displaystyle n}$, the number of input points, and ${\displaystyle h}$, the number of points on the convex hull, which may be significantly smaller than ${\displaystyle n}$. For higher-dimensional hulls, the number of faces of other dimensions may also come into the analysis. Graham scan can compute the convex hull of ${\displaystyle n}$ points in the plane in time ${\displaystyle O(n\log n)}$. For points in two and three dimensions, more complicated output-sensitive algorithms are known that compute the convex hull in time ${\displaystyle O(n\log h)}$. These include Chan's algorithm and the Kirkpatrick–Seidel algorithm. [32] For dimensions ${\displaystyle d>3}$, the time for computing the convex hull is ${\displaystyle O(n^{\lfloor d/2\rfloor })}$, matching the worst-case output complexity of the problem. [33] The convex hull of a simple polygon in the plane can be constructed in linear time. [34]

Dynamic convex hull data structures can be used to keep track of the convex hull of a set of points undergoing insertions and deletions of points, [35] and kinetic convex hull structures can keep track of the convex hull for points moving continuously. [36] The construction of convex hulls also serves as a tool, a building block for a number of other computational-geometric algorithms such as the rotating calipers method for computing the width and diameter of a point set. [37]

Several other shapes can be defined from a set of points in a similar way to the convex hull, as the minimal superset with some property, the intersection of all shapes containing the points from a given family of shapes, or the union of all combinations of points for a certain type of combination. For instance:

• The affine hull is the smallest affine subspace of a Euclidean space containing a given set, or the union of all affine combinations of points in the set. [38]
• The linear hull is the smallest linear subspace of a vector space containing a given set, or the union of all linear combinations of points in the set. [38]
• The conical hull or positive hull of a subset of a vector space is the set of all positive combinations of points in the subset. [38]
• The visual hull of a three-dimensional object, with respect to a set of viewpoints, consists of the points ${\displaystyle p}$ such that every ray from a viewpoint through ${\displaystyle p}$ intersects the object. Equivalently it is the intersection of the (non-convex) cones generated by the outline of the object with respect to each viewpoint. It is used in 3D reconstruction as the largest shape that could have the same outlines from the given viewpoints. [39]
• The circular hull or alpha-hull of a subset of the plane is the intersection of all disks with a given radius ${\displaystyle 1/\alpha }$ that contain the subset. [40]
• The relative convex hull of a subset of a two-dimensional simple polygon is the intersection of all relatively convex supersets, where a set within the same polygon is relatively convex if it contains the geodesic between any two of its points. [41]
• The orthogonal convex hull or rectilinear convex hull is the intersection of all orthogonally convex and connected supersets, where a set is orthogonally convex if it contains all axis-parallel segments between pairs of its points. [42]
• The orthogonal convex hull is a special case of a much more general construction, the hyperconvex hull, which can be thought of as the smallest injective metric space containing the points of a given metric space. [43]
• The holomorphically convex hull is a generalization of similar concepts to complex analytic manifolds, obtained as an intersection of sublevel sets of holomorphic functions containing a given set. [44]

The Delaunay triangulation of a point set and its dual, the Voronoi diagram, are mathematically related to convex hulls: the Delaunay triangulation of a point set in ${\displaystyle \mathbb {R} ^{n}}$ can be viewed as the projection of a convex hull in ${\displaystyle \mathbb {R} ^{n+1}.}$ [45] The alpha shapes of a finite point set give a nested family of (non-convex) geometric objects describing the shape of a point set at different levels of detail. Each of alpha shape is the union of some of the features of the Delaunay triangulation, selected by comparing their circumradius to the parameter alpha. The point set itself forms one endpoint of this family of shapes, and its convex hull forms the other endpoint. [40] The convex layers of a point set are a nested family of convex polygons, the outermost of which is the convex hull, with the inner layers constructed recursively from the points that are not vertices of the convex hull. [46]

The convex skull of a polygon is the largest convex polygon contained inside it. It can be found in polynomial time, but the exponent of the algorithm is high. [47]

Applications

Convex hulls have wide applications in many fields. Within mathematics, convex hulls are used to study polynomials, matrix eigenvalues, and unitary elements, and several theorems in discrete geometry involve convex hulls. They are used in robust statistics as the outermost contour of Tukey depth, are part of the bagplot visualization of two-dimensional data, and define risk sets of randomized decision rules. Convex hulls of indicator vectors of solutions to combinatorial problems are central to combinatorial optimization and polyhedral combinatorics. In economics, convex hulls can be used to apply methods of convexity in economics to non-convex markets. In geometric modeling, the convex hull property Bézier curves helps find their crossings, and convex hulls are part of the measurement of boat hulls. And in the study of animal behavior, convex hulls are used in a standard definition of the home range.

Mathematics

Newton polygons of univariate polynomials and Newton polytopes of multivariate polynomials are convex hulls of points derived from the exponents of the terms in the polynomial, and can be used to analyze the asymptotic behavior of the polynomial and the valuations of its roots. [48] Convex hulls and polynomials also come together in the Gauss–Lucas theorem, according to which the roots of the derivative of a polynomial all lie within the convex hull of the roots of the polynomial. [49]

In spectral analysis, the numerical range of a normal matrix is the convex hull of its eigenvalues. [50] The Russo–Dye theorem describes the convex hulls of unitary elements in a C*-algebra. [51] In discrete geometry, both Radon's theorem and Tverberg's theorem concern the existence of partitions of point sets into subsets with intersecting convex hulls. [52]

The definitions of a convex set as containing line segments between its points, and of a convex hull as the intersection of all convex supersets, apply to hyperbolic spaces as well as to Euclidean spaces. However, in hyperbolic space, it is also possible to consider the convex hulls of sets of ideal points, points that do not belong to the hyperbolic space itself but lie on the boundary of a model of that space. The boundaries of convex hulls of ideal points of three-dimensional hyperbolic space are analogous to ruled surfaces in Euclidean space, and their metric properties play an important role in the geometrization conjecture in low-dimensional topology. [53] Hyperbolic convex hulls have also been used as part of the calculation of canonical triangulations of hyperbolic manifolds, and applied to determine the equivalence of knots. [54]

See also the section on Brownian motion for the application of convex hulls to this subject, and the section on space curves for their application to the theory of developable surfaces.

Statistics

In robust statistics, the convex hull provides one of the key components of a bagplot, a method for visualizing the spread of two-dimensional sample points. The contours of Tukey depth form a nested family of convex sets, with the convex hull outermost, and the bagplot also displays another polygon from this nested family, the contour of 50% depth. [55]

In statistical decision theory, the risk set of a randomized decision rule is the convex hull of the risk points of its underlying deterministic decision rules. [56]

Combinatorial optimization

In combinatorial optimization and polyhedral combinatorics, central objects of study are the convex hulls of indicator vectors of solutions to a combinatorial problem. If the facets of these polytopes can be found, describing the polytopes as intersections of halfspaces, then algorithms based on linear programming can be used to find optimal solutions. [57] In multi-objective optimization, a different type of convex hull is also used, the convex hull of the weight vectors of solutions. One can maximize any quasiconvex combination of weights by finding and checking each convex hull vertex, often more efficiently than checking all possible solutions. [58]

Economics

In the Arrow–Debreu model of general economic equilibrium, agents are assumed to have convex budget sets and convex preferences. These assumptions of convexity in economics can be used to prove the existence of an equilibrium. When actual economic data is non-convex, it can be made convex by taking convex hulls. The Shapley–Folkman theorem can be used to show that, for large markets, this approximation is accurate, and leads to a "quasi-equilibrium" for the original non-convex market. [59]

Geometric modeling

In geometric modeling, one of the key properties of a Bézier curve is that it lies within the convex hull of its control points. This so-called "convex hull property" can be used, for instance, in quickly detecting intersections of these curves. [60]

In the geometry of boat and ship design, chain girth is a measurement of the size of a sailing vessel, defined using the convex hull of a cross-section of the hull of the vessel. It differs from the skin girth, the perimeter of the cross-section itself, except for boats and ships that have a convex hull. [61]

Ethology

The convex hull is commonly known as the minimum convex polygon in ethology, the study of animal behavior, where it is a classic, though perhaps simplistic, approach in estimating an animal's home range based on points where the animal has been observed. [62] Outliers can make the minimum convex polygon excessively large, which has motivated relaxed approaches that contain only a subset of the observations, for instance by choosing one of the convex layers that is close to a target percentage of the samples, [63] or in the local convex hull method by combining convex hulls of neighborhoods of points. [64]

Quantum physics

In quantum physics, the state space of any quantum system — the set of all ways the system can be prepared — is a convex hull whose extreme points are positive-semidefinite operators known as pure states and whose interior points are called mixed states. [65] The Schrödinger–HJW theorem proves that any mixed state can in fact be written as a convex combination of pure states in multiple ways. [66]

Thermodynamics

A convex hull in thermodynamics was identified by Josiah Willard Gibbs (1873), [68] although the paper was published before the convex hull was so named. In a set of energies of several stoichiometries of a material, only those measurements on the lower convex hull will be stable. When removing a point from the hull and then calculating its distance to the hull, its distance to the new hull represents the degree of stability of the phase. [69]

History

The lower convex hull of points in the plane appears, in the form of a Newton polygon, in a letter from Isaac Newton to Henry Oldenburg in 1676. [70] The term "convex hull" itself appears as early as the work of GarrettBirkhoff  ( 1935 ), and the corresponding term in German appears earlier, for instance in Hans Rademacher's review of Kőnig  ( 1922 ). Other terms, such as "convex envelope", were also used in this time frame. [71] By 1938, according to Lloyd Dines, the term "convex hull" had become standard; Dines adds that he finds the term unfortunate, because the colloquial meaning of the word "hull" would suggest that it refers to the surface of a shape, whereas the convex hull includes the interior and not just the surface. [72]

Notes

1. Rockafellar (1970), p. 12.
2. de Berg et al. (2008), p. 3.
3. Williams & Rossignac (2005). See also Douglas Zare, answer to "the perimeter of a non-convex set", MathOverflow, May 16, 2014.
4. Rockafellar (1970), p. 12; Lay (1982), p. 17.
5. de Berg et al. (2008), p. 6. The idea of partitioning the hull into two chains comes from an efficient variant of Graham scan by Andrew (1979).
6. Rockafellar (1970), p. 99.
7. Grünbaum (2003), p. 16; Lay (1982), p. 21; Sakuma (1977).
8. This example is given by Talman (1977), Remark 2.6.
9. Krein & Milman (1940); Lay (1982), p. 43.
10. Krein & Šmulian (1940), Theorem 3, pages 562–563; Schneider (1993), Theorem 1.1.2 (pages 2–3) and Chapter 3.
11. de Berg et al. (2008), p. 254.
12. Grünbaum (2003), p. 57.
13. de Berg et al. (2008), p. 256.
14. de Berg et al. (2008), p. 245.
15. Rockafellar (1970), p. 36.
16. Rockafellar (1970), p. 149.
17. de Berg et al. (2008), p. 13.
18. Chazelle (1993); de Berg et al. (2008), p. 256.
19. Pulleyblank (1983); see especially remarks following Theorem 2.9.
20. Nicola (2000). See in particular Section 16.9, Non Convexity and Approximate Equilibrium, pp. 209–210.
21. Newton (1676); see Auel (2019), page 336, and Escobar & Kaveh (2020).
22. See, e.g., White (1923), page 520.

Related Research Articles

In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex region is a subset that intersects every line into a single line segment . For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex.

In geometry, a polyhedron is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices.

In elementary geometry, a polytope is a geometric object with flat sides (faces). Polytopes are the generalization of three-dimensional polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions n as an n-dimensional polytope or n-polytope. For example, a two-dimensional polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. In this context, "flat sides" means that the sides of a (k + 1)-polytope consist of k-polytopes that may have (k – 1)-polytopes in common.

In geometry, the Minkowski sum of two sets of position vectors A and B in Euclidean space is formed by adding each vector in A to each vector in B, i.e., the set

In mathematics, a duality translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one-to-one fashion, often by means of an involution operation: if the dual of A is B, then the dual of B is A. Such involutions sometimes have fixed points, so that the dual of A is A itself. For example, Desargues' theorem is self-dual in this sense under the standard duality in projective geometry.

Carathéodory's theorem is a theorem in convex geometry. It states that if a point x of Rd lies in the convex hull of a set P, then x can be written as the convex combination of at most d + 1 points in P. Namely, there is a subset P′ of P consisting of d + 1 or fewer points such that x lies in the convex hull of P′. Equivalently, x lies in an r-simplex with vertices in P, where . The smallest r that makes the last statement valid for each x in the convex hull of P is defined as the Carathéodory's number of P. Depending on the properties of P, upper bounds lower than the one provided by Carathéodory's theorem can be obtained. Note that P need not be itself convex. A consequence of this is that P′ can always be extremal in P, as non-extremal points can be removed from P without changing the membership of x in the convex hull.

In geometry, Radon's theorem on convex sets, published by Johann Radon in 1921, states that any set of d + 2 points in Rd can be partitioned into two sets whose convex hulls intersect. A point in the intersection of these convex hulls is called a Radon point of the set.

A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the -dimensional Euclidean space . Most texts use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary.

In mathematics, the "happy ending problem" is the following statement:

In the mathematical theory of functional analysis, the Krein–Milman theorem is a proposition about compact convex sets in locally convex topological vector spaces (TVSs).

In geometry, a set KRd is defined to be orthogonally convex if, for every line L that is parallel to one of standard basis vectors, the intersection of K with L is empty, a point, or a single segment. The term "orthogonal" refers to corresponding Cartesian basis and coordinates in Euclidean space, where different basis vectors are perpendicular, as well as corresponding lines. Unlike ordinary convex sets, an orthogonally convex set is not necessarily connected.

In mathematics, specifically in combinatorial commutative algebra, a convex lattice polytope P is called normal if it has the following property: given any positive integer n, every lattice point of the dilation nP, obtained from P by scaling its vertices by the factor n and taking the convex hull of the resulting points, can be written as the sum of exactly n lattice points in P. This property plays an important role in the theory of toric varieties, where it corresponds to projective normality of the toric variety determined by P. Normal polytopes have popularity in algebraic combinatorics. These polytopes also represent the homogeneous case of the Hilbert bases of finite positive rational cones and the connection to algebraic geometry is that they define projectively normal embeddings of toric varieties.

Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science.

In geometry, the moment curve is an algebraic curve in d-dimensional Euclidean space given by the set of points with Cartesian coordinates of the form

In discrete and computational geometry, a set of points in the Euclidean plane or a higher-dimensional Euclidean space is said to be in convex position or convex independent if none of the points can be represented as a convex combination of the others. A finite set of points is in convex position if all of the points are vertices of their convex hull. More generally, a family of convex sets is said to be in convex position if they are pairwise disjoint and none of them is contained in the convex hull of the others.

In mathematics, a flip graph is a graph whose vertices are combinatorial or geometric objects, and whose edges link two of these objects when they can be obtained from one another by an elementary operation called a flip. Flip graphs are special cases of geometric graphs.

Combinatorial Geometry in the Plane is a book in discrete geometry. It was translated from a German-language book, Kombinatorische Geometrie in der Ebene, which its authors Hugo Hadwiger and Hans Debrunner published through the University of Geneva in 1960, expanding a 1955 survey paper that Hadwiger had published in L'Enseignement mathématique. Victor Klee translated it into English, and added a chapter of new material. It was published in 1964 by Holt, Rinehart and Winston, and republished in 1966 by Dover Publications. A Russian-language edition, Комбинаторная геометрия плоскости, translated by I. M. Jaglom and including a summary of the new material by Klee, was published by Nauka in 1965. The Basic Library List Committee of the Mathematical Association of America has recommended its inclusion in undergraduate mathematics libraries.

In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the two given polytopes, with the same measure. When both polytopes have parallel facets, the measure of the corresponding facet in the Blaschke sum is the sum of the measures from the two given polytopes.

Kirchberger's theorem is a theorem in discrete geometry, on linear separability. The two-dimensional version of the theorem states that, if a finite set of red and blue points in the Euclidean plane has the property that, for every four points, there exists a line separating the red and blue points within those four, then there exists a single line separating all the red points from all the blue points. Donald Watson phrases this result more colorfully, with a farmyard analogy:

If sheep and goats are grazing in a field and for every four animals there exists a line separating the sheep from the goats then there exists such a line for all the animals.