Convex hull
Summary
The convex hull of a set of points is the smallest convex set that contains it. It is the set of all convex combinations of points of the set.
What this node needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What depends on this
2 nodes use this node, directly or through other nodes.
- Polyhedron 00C2WN1H21
- Carathéodory's theorem 0201Q4P2B5
Sources
- Web https://en.wikipedia.org/wiki/Convex_hull, lead section
What links here
Used by
- Polyhedron 00C2WN1H21
- Carathéodory's theorem 0201Q4P2B5
Definitions
- Convex hull 0TCHAS04WK