✳flâneur — a map of the web's best reading

Convex hull - Wikipedia

en.wikipedia.org · 8,231 words · saved by 1 readers

In geometry, the convex hull, convex envelope or convex closure[1] of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset. Convex hulls of open sets are open, and convex hulls of compact sets are compact. Every compact convex set is the convex hull of its extreme points. The convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of points. The algorithmic problems of finding the convex hull of a finite set of points in the plane or other low-dimensional Euclidean spaces, and its dual problem of intersecting half-spaces, are fundamental problems of computationa

Convex hull - Wikipedia Jump to content From Wikipedia, the free encyclopedia Smallest convex set containing a given set This article is about the smallest convex shape enclosing a given shape. For boats whose hulls are convex, see Hull (watercraft) § Hull shapes . The convex hull of the red set is the blue and red convex set . In geometry , the convex hull , convex envelope or convex closure [ 1 ] of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space , or equivalently

Explore this link on the map →

related reading