Convex geometry
In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas: computational geometry, convex analysis, discrete geometry, functional analysis, geometry of numbers, integral geometry, linear programming, probability theory, game theory, etc.
Classification
According to the Mathematics Subject Classification MSC2010, the mathematical discipline Convex and Discrete Geometry includes three major branches:- general convexity
- polytopes and polyhedra
- discrete geometry
General convexity is further subdivided as follows:
- axiomatic and generalized convexity
- convex sets without dimension restrictions
- convex sets in topological vector spaces
- convex sets in 2 dimensions
- convex sets in 3 dimensions
- convex sets in n dimensions
- finite-dimensional Banach spaces
- random convex sets and integral geometry
- asymptotic theory of convex bodies
- approximation by convex sets
- variants of convex sets
- Helly-type theorems and geometric transversal theory
- other problems of combinatorial convexity
- length, area, volume
- mixed volumes and related topics
- valuations on convex bodies
- inequalities and extremum problems
- convex functions and convex programs
- spherical and hyperbolic convexity