In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either...

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

is always a convex curve. The intersection of all the convex sets that contain a given subset A of Euclidean space is called the convex hull of A. It is...

every convex set is orthogonally convex but not vice versa. For the same reason, the orthogonal convex hull itself is a subset of the convex hull of the...

locally convex space, the convex hull and the disked hull of a totally bounded set is totally bounded. In a complete locally convex space, the convex hull and...

Carathéodory's theorem is a theorem in convex geometry. It states that if a point x {\displaystyle x} lies in the convex hull C o n v ( P ) {\displaystyle \mathrm...

The polynomially convex hull contains the holomorphically convex hull. The domain G {\displaystyle G} is called holomorphically convex if for every compact...

learning resources about Convex combination Affine hull Carathéodory's theorem (convex hull) Simplex Barycentric coordinate system Convex space Rockafellar,...

"balanced"), in which case it is called a disk. The disked hull or the absolute convex hull of a set is the intersection of all disks containing that set...

convex set of points in space. Other important definitions are: as the intersection of half-spaces (half-space representation) and as the convex hull...

geometry Conical hull, in convex geometry Convex hull, in convex geometry Carathéodory's theorem (convex hull) Holomorphically convex hull, in complex analysis...

or vertices. A convex polyhedron is a polyhedron that bounds a convex set. Every convex polyhedron can be constructed as the convex hull of its vertices...

The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track...

Delone triangulation of a set of points in the plane subdivides their convex hull into triangles whose circumcircles do not contain any of the points....

Local convex hull (LoCoH) is a method for estimating size of the home range of an animal or a group of animals (e.g. a pack of wolves, a pride of lions...

geometric object that was discovered by Paul Schatz in 1929. It is the convex hull of a skeletal frame made by placing two linked congruent circles in perpendicular...

Closed hulls In a locally convex space, convex hulls of bounded sets are bounded. This is not true for TVSs in general. The closed convex hull of a set...

and computational geometry, the relative convex hull or geodesic convex hull is an analogue of the convex hull for the points inside a simple polygon or...

A kinetic convex hull data structure is a kinetic data structure that maintains the convex hull of a set of continuously moving points. It should be distinguished...

the convex hull of its edges. Additional properties of convex polygons include: The intersection of two convex polygons is a convex polygon. A convex polygon...

encoding of the convex hull of the function's epigraph in terms of its supporting hyperplanes. For more examples, see § Table of selected convex conjugates...

spheres determines a specific volume known as the convex hull of the packing, defined as the smallest convex set that includes all the spheres. There are many...

to the closed convex hull of its extreme points. This theorem generalizes to infinite-dimensional spaces and to arbitrary compact convex sets the following...

Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n). It is named after Ronald...

piece from a figure, its area decreases but its perimeter may not. The convex hull of a figure may be visualized as the shape formed by a rubber band stretched...

In discrete geometry and computational geometry, the convex hull of a simple polygon is the polygon of minimum perimeter that contains a given simple...

S_{2}} of a real vector space, the convex hull of their Minkowski sum is the Minkowski sum of their convex hulls: Conv ⁡ ( S 1 + S 2 ) = Conv ⁡ ( S 1...

generalization of the concept of the convex hull, i.e. every convex hull is an alpha-shape but not every alpha shape is a convex hull. For each real number α, define...

problems, including point in polygon testing, area computation, the convex hull of a simple polygon, triangulation, and Euclidean shortest paths. Other...

bound on the distance between any point in the Minkowski sum and its convex hull. This upper bound is sharpened by the Shapley–Folkman–Starr theorem (alternatively...