Convex geometry

Convex geometry

Convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas of mathematics: computational geometry, convex analysis, discrete geometry, functional analysis, geometry of numbers, integral geometry, linear programming, probability theory, etc. According to the American Mathematical Society Subject Classification 2010, major branches of the mathematical discipline Convex and Discrete Geometry are: General Convexity, Polytopes and Polyhedra, Discrete Geometry. Further classification of General Convexity results in the following list:

  • axiomatic and generalized convexity
  • convex sets without dimension restrictions
  • convex sets in topological vector spaces
  • convex sets in 2 dimensions (including convex curves)
  • convex sets in 3 dimensions (including convex surfaces)
  • convex sets in n dimensions (including convex hypersurfaces)
  • finite-dimensional Banach spaces
  • random convex sets and integral geometry
  • asymptotic theory of convex bodies
  • approximation by convex sets
  • variants of convex sets (star-shaped, (m, n)-convex, etc.)
  • Helly-type theorems and geometric transversal theory
  • other problems of combinatorial convexity
  • length, area, volume
  • inequalities and extremum problems
  • convex functions and convex programs
  • spherical and hyperbolic convexity

The phrase convex geometry is also used in combinatorics as the name for an abstract model of convex sets based on antimatroids.

Historical note

Convex geometry is a relatively young mathematical discipline. Although the first known contributions to convex geometry date back to antiquity and can be traced in the works of Euclid and Archimedes, it became an independent branch of mathematics at the turn of the 19th century, mainly due to the works of Hermann Brunn and Hermann Minkowski in dimensions two and three. A big part of their results was soon generalized to spaces of higher dimensions, and in 1934 T. Bonnesen and W. Fenchel gave a comprehensive survey of convex geometry in Euclidean space Rn. Further development of convex geometry in the 20th century and its relations to numerous mathematical disciplines are summarized in the Handbook of convex geometry edited by P. M. Gruber and J. M. Wills.

See also

References

Expository articles on convex geometry

  • K. Ball, An elementary introduction to modern convex geometry, in: Flavors of Geometry, pp. 1—58, Math. Sci. Res. Inst. Publ. Vol. 31, Cambridge Univ. Press, Cambridge, 1997, available online.
  • M. Berger, Convexity, Amer. Math. Monthly, Vol. 97 (1990), 650—678.
  • P. M. Gruber, Aspects of convexity and its applications, Exposition. Math., Vol. 2 (1984), 47—83.
  • V. Klee, What is a convex set? Amer. Math. Monthly, Vol. 78 (1971), 616—631.

Some books on convex geometry

  • T. Bonnesen, W. Fenchel, Theorie der konvexen Körper, Julius Springer, Berlin, 1934. English translation: Theory of convex bodies, BCS Associates, Moscow, ID, 1987.
  • R. J. Gardner, Geometric tomography, Cambridge University Press, New York, 1995. Second edition: 2006.
  • P. M. Gruber, Convex and discrete geometry, Springer-Verlag, New York, 2007.
  • P. M. Gruber, J. M. Wills (editors), Handbook of convex geometry. Vol. A. B, North-Holland, Amsterdam, 1993.
  • R. Schneider, Convex bodies: the Brunn-Minkowski theory, Cambridge University Press, Cambridge, 1993.
  • A. C. Thompson, Minkowski geometry, Cambridge University Press, Cambridge, 1996.
  • A. Koldobsky, V. Yaskin, The Interface between Convex Geometry and Harmonic Analysis, American Mathematical Society, Providence, Rhode Island, 2008.

Articles on history of convex geometry

  • W. Fenchel, Convexity through the ages, (Danish) Danish Mathematical Society (1929—1973), pp. 103-116, Dansk. Mat. Forening, Copenhagen, 1973. English translation: Convexity through the ages, in: P. M. Gruber, J. M. Wills (editors), Convexity and its Applications, pp. 120-130, Birkhauser Verlag, Basel, 1983.
  • P. M. Gruber, Zur Geschichte der Konvexgeometrie und der Geometrie der Zahlen, in: G. Fischer, et al. (editors), Ein Jahrhundert Mathematik 1890—1990, pp. 421—455, Dokumente Gesch. Math., Vol. 6, F. Wieweg and Sohn, Braunschweig; Deutsche Mathematiker Vereinigung, Freiburg, 1990.
  • P. M. Gruber, History of convexity, in: P. M. Gruber, J. M. Wills (editors), Handbook of convex geometry. Vol. A, pp. 1-15, North-Holland, Amsterdam, 1993.

Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Geometry — (Greek γεωμετρία ; geo = earth, metria = measure) is a part of mathematics concerned with questions of size, shape, and relative position of figures and with properties of space. Geometry is one of the oldest sciences. Initially a body of… …   Wikipedia

  • Convex set — A convex set …   Wikipedia

  • Convex and concave polygons — An example of a convex polygon: a regular pentagon In geometry, a polygon can be either convex or concave (non convex). Contents 1 Convex polygons …   Wikipedia

  • Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… …   Wikipedia

  • Convex metric space — An illustration of a convex metric space. In mathematics, convex metric spaces are, intuitively, metric spaces with the property any segment joining two points in that space has other points in it besides the endpoints. Formally, consider a… …   Wikipedia

  • Convex combination — Given three points x1,x2,x3 in a plane as shown in the figure, the point P is a convex combination of the three points, while Q is not. (Q is however an affine combination of the three poin …   Wikipedia

  • Convex curve — In mathematics, a convex curve is the boundary of a convex set. See also Secant line Categories: Convex geometry …   Wikipedia

  • Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… …   Wikipedia

  • Convex hull — The convex hull of the red set is the blue convex set. See also: Convex set and Convex combination In mathematics, the convex hull or convex envelope for a set of points X in a real vector space V is the min …   Wikipedia

  • Convex lattice polytope — A convex lattice polytope (also called Z polyhedron or Z polytope) is a geometric object playing an important role in discrete geometry and combinatorial commutative algebra. It is a polytope in a Euclidean space Rn which is a convex hull of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”