Andere Kunden interessierten sich auch für
![Convex Combination]( "Convex Combination")
Convex Combination22,99 €![Convex function]( "Convex function")
Convex function25,99 €![Uniformly Convex Space]( "Uniformly Convex Space")
Uniformly Convex Space22,99 €![Multiphase Segmentation with Convex Relaxation of Phase Functions]( "Multiphase Segmentation with Convex Relaxation of Phase Functions")
Multiphase Segmentation with Convex Relaxation of Phase Functions32,99 €![Distributive Convex l-Subgroup in Commutative l-Group]( "Distributive Convex l-Subgroup in Commutative l-Group")
Distributive Convex l-Subgroup in Commutative l-Group55,99 €![Geometry - Intuitive, Discrete, and Convex]( "Geometry - Intuitive, Discrete, and Convex")
Geometry - Intuitive, Discrete, and Convex37,99 €![Vector Optimization and Monotone Operators via Convex Duality]( "Vector Optimization and Monotone Operators via Convex Duality")
Vector Optimization and Monotone Operators via Convex Duality74,99 €
In Euclidean space, an object is convex if for every pair of points within the object, every point on the straight line segment that joins them is also within the object. For example, a solid cube is convex, but anything that is hollow or has a dent in it, for example, a crescent shape, is not convex.The convex subsets of R (the set of real numbers) are simply the intervals of R. Some examples of convex subsets of Euclidean 2-space are regular polygons and bodies of constant width. Some examples of convex subsets of Euclidean 3-space are the Archimedean solids and the Platonic solids. The Kepler-Poinsot polyhedra are examples of non-convex sets.