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...
61 KB (7,161 words) - 05:57, 16 August 2024
Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry...
16 KB (2,229 words) - 19:20, 17 June 2024
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...
25 KB (3,037 words) - 22:51, 6 July 2024
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...
13 KB (1,508 words) - 10:27, 18 December 2023
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...
58 KB (10,592 words) - 23:16, 10 August 2024
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...
14 KB (2,153 words) - 21:04, 8 July 2024
Function of several complex variables (redirect from Holomorphically convex hull)
The polynomially convex hull contains the holomorphically convex hull. The domain G {\displaystyle G} is called holomorphically convex if for every compact...
124 KB (17,658 words) - 20:14, 19 August 2024
learning resources about Convex combination Affine hull Carathéodory's theorem (convex hull) Simplex Barycentric coordinate system Convex space Rockafellar,...
7 KB (542 words) - 07:55, 4 June 2024
"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...
11 KB (1,913 words) - 09:38, 28 August 2024
convex set of points in space. Other important definitions are: as the intersection of half-spaces (half-space representation) and as the convex hull...
23 KB (3,266 words) - 17:46, 21 May 2024
geometry Conical hull, in convex geometry Convex hull, in convex geometry Carathéodory's theorem (convex hull) Holomorphically convex hull, in complex analysis...
2 KB (339 words) - 19:30, 6 June 2024
Polyhedron (redirect from Convex polyhedron)
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...
87 KB (9,879 words) - 11:31, 5 September 2024
The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track...
6 KB (769 words) - 22:54, 28 July 2024
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...
103 KB (13,529 words) - 03:12, 5 July 2024
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....
28 KB (3,181 words) - 17:12, 14 May 2024
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...
9 KB (1,112 words) - 14:39, 29 July 2024
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...
7 KB (857 words) - 17:09, 8 June 2024
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...
12 KB (1,934 words) - 20:41, 10 November 2022
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...
6 KB (881 words) - 21:52, 20 February 2024
In discrete geometry and computational geometry, the convex hull of a simple polygon is the polygon of minimum perimeter that contains a given simple...
9 KB (1,141 words) - 10:12, 18 December 2023
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...
7 KB (1,116 words) - 07:18, 14 May 2021
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...
16 KB (2,641 words) - 03:03, 10 August 2024
Krein–Milman theorem (category Convex hulls)
to the closed convex hull of its extreme points. This theorem generalizes to infinite-dimensional spaces and to arbitrary compact convex sets the following...
20 KB (2,953 words) - 10:28, 18 December 2023
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...
16 KB (2,025 words) - 09:08, 29 August 2024
Graham scan (category Convex hull algorithms)
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...
12 KB (1,738 words) - 20:57, 11 August 2024
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...
11 KB (1,302 words) - 01:55, 15 May 2024
Minkowski addition (category Convex geometry)
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...
23 KB (2,986 words) - 15:50, 23 May 2024
Alpha shape (category Convex hulls)
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...
6 KB (703 words) - 07:48, 29 August 2024
problems, including point in polygon testing, area computation, the convex hull of a simple polygon, triangulation, and Euclidean shortest paths. Other...
31 KB (3,199 words) - 07:45, 18 July 2024
Shapley–Folkman lemma (category Convex hulls)
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...
83 KB (10,367 words) - 21:50, 25 August 2024