Content deleted Content added
cs1 |
m Task 18 (cosmetic): eval 15 templates: del empty params (2×); hyphenate params (3×); |
||
Line 3:
[[File:Convex polygon illustration2.svg|right|thumb|Illustration of a non-convex set. Since the (red) part of the (black and red) line-segment joining the points x and y lies ''outside'' of the (green) set, the set is non-convex.]]
In [[geometry]], a subset of a [[Euclidean space]], or more generally an [[affine space]] over the [[Real number|reals]], is '''convex''' if, given any two points, it contains the whole [[line segment]] that joins them. Equivalently, a '''convex set''' or a '''convex region''' is a subset that intersect every [[line (geometry)|line]] into a single line segment (possibly empty).<ref>{{cite book|last1=Morris|first1=Carla C.|last2=Stark|first2=Robert M.|title=Finite Mathematics: Models and Applications|date=24 August 2015|publisher=John Wiley & Sons|isbn=9781119015383|page=121|url=https://books.google.com/books?id=ZgJyCgAAQBAJ&q=convex+region&pg=PA121|accessdate=5 April 2017|language=en}}</ref><ref>{{cite journal|last1=Kjeldsen|first1=Tinne Hoff|title=History of Convexity and Mathematical Programming|journal=Proceedings of the International Congress of Mathematicians|issue=ICM 2010|pages=3233–3257|doi=10.1142/9789814324359_0187|url=http://www.mathunion.org/ICM/ICM2010.4/Main/icm2010.4.3233.3257.pdf|accessdate=5 April 2017|url-status=dead|
For example, a solid [[cube (geometry)|cube]] is a convex set, but anything that is hollow or has an indent, for example, a [[crescent]] shape, is not convex.
Line 54:
=== Blaschke-Santaló diagrams ===
The set <math>\mathcal{K}^2</math> of all planar convex bodies can be parameterized in terms of the convex body [[Diameter#Generalizations|diameter]] ''D'', its inradius ''r'' (the biggest circle contained in the convex body) and its circumradius ''R'' (the smallest circle containing the convex body). In fact, this set can be described by the set of inequalities given by<ref name=":0">{{Cite journal|last=Santaló|first=L.|date=1961|title=Sobre los sistemas completos de desigualdades entre tres elementos de una figura convexa planas
<math>R \le \frac{\sqrt{3}}{3} D</math>
Line 115:
:<math>\text{Conv}\left ( \sum_n S_n \right ) = \sum_n \text{Conv} \left (S_n \right).</math>
In mathematical terminology, the [[operation (mathematics)|operation]]s of Minkowski summation and of forming [[convex hull]]s are [[commutativity|commuting]] operations.<ref>Theorem 3 (pages 562–563): {{cite news|first1=M.|last1=Krein|
=== Minkowski sums of convex sets ===
|