Convex and discrete geometry Convex sets: basic notions Concept
Convex independence
Summary
A family of points is convexly independent if no point of the family lies in the convex hull of the other points. A set of points with this property is said to be in convex position. Then every point of the set is an extreme point of its convex hull. The notion is the convex analogue of linear and affine independence, and it is central in problems such as the Erdős–Szekeres problem on convex polygons.
Further reading
About this page
| Tag | GCPRFTKS4E |
|---|---|
| URI | m2://GCPRFTKS4E |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52A20, 52C35 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.