Linked from

The 22 pages that link to Convex hull, each with the reason it gives.

• Convex setBroader topic: It is formed by adding every convex combination of the original points.

• Barycentric coordinatesRelated: The signs of barycentric coordinates characterize whether a point lies inside a simplex.

• Linear combinationCompared with: It consists of convex combinations, not arbitrary linear combinations.

• PolyhedronCompared with: Finite convex hulls describe polytopes, while general polyhedra may be unbounded.

• Vertex (geometry)Related: Extreme input points become vertices of the hull, while interior points do not.

• Convex geometryBroader topic: It turns arbitrary point configurations into the convex sets studied here.

• Extreme pointRelated: Finite-dimensional convex hulls can be described using their extreme points.

• ConvexityBroader topic: It completes any set into the smallest set satisfying convexity.

• Carathéodory's theoremNarrower topic: The theorem characterizes every point in this set using a bounded number of generators.

• Convex combinationRelated: It consists of all finite convex combinations of the given points.

• Geometry of numbersRelated: Convexity lets geometric arguments control regions containing integer points.

• Convex polygonRelated: The hull of finitely many points is a convex polygon after redundant points are removed.

• Linear programming relaxationRelated: The integer solutions' convex hull clarifies how closely a relaxation captures them.

• Helly's theoremBroader topic: Proofs translate intersection questions into statements about convex hulls.

• Radon's theoremNarrower topic: The theorem asserts that the two groups' convex hulls share a point.

• Gauss–Lucas theoremBroader topic: The theorem locates every derivative zero inside this region determined by the roots.

• Tverberg's theoremBroader topic: Each group in the theorem contributes one convex hull to the common intersection.

• Cone (convex analysis)Related: Adding convexity to a cone amounts to closure under convex combinations.

• Alexandrov's theorem on polyhedraRelated: Convex hulls provide concrete polyhedra whose intrinsic metrics can be compared with prescribed ones.

• Bipolar theoremRelated: Taking a bipolar enforces convexity, so nonconvex features disappear.

• Erdős–Nagy theoremRelated: Pockets are defined relative to the polygon’s convex hull.

• Shapley–Folkman lemmaRelated: Convexifying the summands creates the larger sum that the lemma approximates.