# convex hull

(redirected from Convex closure)

## convex hull

[′kän‚veks ′həl]
(mathematics)
The smallest convex set containing a given collection of points in a real linear space. Also known as convex linear hull.

## convex hull

(mathematics, graphics)
For a set S in space, the smallest convex set containing S. In the plane, the convex hull can be visualized as the shape assumed by a rubber band that has been stretched around the set S and released to conform as closely as possible to S.
Mentioned in ?
References in periodicals archive ?
Note that every non-degenerate polar space is the convex closure of any two of its points at distance 2 from each other.
Now (x, y) is called a special pair, the convex closure of {x, y} is the set of points on the two lines xy and yz, which is not a symp.
1, also dG(x, y) = 2 and S is contained in the convex closure of {x, y} in G.
Both are the convex closures of the two points in S so that S [?
The convex closure of a nonempty set S is the least (with respect to [subset or equal to] convex set that contains S.
i]} is downward closed and therefore convex, so the convex closure {[C.
The equivalence class of this set is obtained by taking its convex closure.
Because [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is downward closed, and therefore convex, and because taking convex closure only adds elements to a set, the set [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] satisfies the same properties, so
Hence our convex closure [Mathematical Expression Omitted] will in general be a smaller set of worlds than the 'convex hull' of X according to Oddie.

Site: Follow: Share:
Open / Close