Linked from

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

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

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

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

• 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.

• 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.