- Algebra
- >
- Linear algebra
- >
- Convex geometry
- >
- Convex hulls

- Area
- >
- Integral calculus
- >
- Integral representations
- >
- Convex hulls

- Calculus
- >
- Integral calculus
- >
- Integral representations
- >
- Convex hulls

- Category theory
- >
- Duality theories
- >
- Closure operators
- >
- Convex hulls

- Classical geometry
- >
- Affine geometry
- >
- Convex geometry
- >
- Convex hulls

- Comparison (mathematical)
- >
- Order theory
- >
- Closure operators
- >
- Convex hulls

- Fields of mathematical analysis
- >
- Functional analysis
- >
- Integral representations
- >
- Convex hulls

- Fields of mathematical analysis
- >
- Measure theory
- >
- Integral representations
- >
- Convex hulls

- Fields of mathematics
- >
- Order theory
- >
- Closure operators
- >
- Convex hulls

- Functions and mappings
- >
- Functional analysis
- >
- Integral representations
- >
- Convex hulls

- Geometry
- >
- Duality theories
- >
- Closure operators
- >
- Convex hulls

- Geometry
- >
- Fields of geometry
- >
- Convex geometry
- >
- Convex hulls

- Homological algebra
- >
- Duality theories
- >
- Closure operators
- >
- Convex hulls

- Manifolds
- >
- Duality theories
- >
- Closure operators
- >
- Convex hulls

- Mathematical analysis
- >
- Fields of mathematical analysis
- >
- Functional analysis
- >
- Convex hulls

- Mathematical analysis
- >
- Functions and mappings
- >
- Functional analysis
- >
- Convex hulls

- Mathematical objects
- >
- Functions and mappings
- >
- Functional analysis
- >
- Convex hulls

- Mathematical relations
- >
- Functions and mappings
- >
- Functional analysis
- >
- Convex hulls

- Topology
- >
- General topology
- >
- Closure operators
- >
- Convex hulls

Relative convex hull

In discrete geometry 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 rectifiable simple close

Alpha shape

In computational geometry, an alpha shape, or α-shape, is a family of piecewise linear simple curves in the Euclidean plane associated with the shape of a finite set of points. They were first defined

Convex hull

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 c

Potato peeling

In computational geometry, the potato peeling or convex skull problem is a problem of finding the convex polygon of the largest possible area that lies within a given non-convex polygon. It was posed

Local convex hull

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, or herd of buffaloes), and for constructing a u

Convexity in economics

Convexity is an important topic in economics. In the Arrow–Debreu model of general economic equilibrium, agents have convex budget sets and convex preferences: At equilibrium prices, the budget hyperp

Choquet theory

In mathematics, Choquet theory, named after Gustave Choquet, is an area of functional analysis and convex analysis concerned with measures which have support on the extreme points of a convex set C. R

Carathéodory's theorem (convex hull)

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

Shapley–Folkman lemma

The Shapley–Folkman lemma is a result in convex geometry with applications in mathematical economics that describes the Minkowski addition of sets in a vector space. Minkowski addition is defined as t

Non-convexity (economics)

In economics, non-convexity refers to violations of the convexity assumptions of elementary economics. Basic economics textbooks concentrate on consumers with convex preferences (that do not prefer ex

Convex layers

In computational geometry, the convex layers of a set of points in the Euclidean plane are a sequence of nested convex polygons having the points as their vertices. The outermost one is the convex hul

Orthogonal convex hull

In geometry, a set K ⊂ Rd 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 segme

Convex position

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

Convex combination

In convex geometry and vector algebra, a convex combination is a linear combination of points (which can be vectors, scalars, or more generally points in an affine space) where all coefficients are no

Extreme point

In mathematics, an extreme point of a convex set in a real or complex vector space is a point in which does not lie in any open line segment joining two points of In linear programming problems, an ex

Convex hull of a simple polygon

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

Krein–Milman theorem

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). Krein–Milman theorem — A comp

Tverberg's theorem

In discrete geometry, Tverberg's theorem, first stated by Helge Tverberg, is the result that sufficiently many points in d-dimensional Euclidean space can be partitioned into subsets with intersecting

Radon's theorem

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

© 2023 Useful Links.