- convex hull
-
Math.the smallest convex set containing a given set; the intersection of all convex sets that contain a given set.Also called convex cover, convex span.
* * *
Universalium. 2010.
* * *
Universalium. 2010.
Convex hull — The convex hull of the red set is the blue convex set. See also: Convex set and Convex combination In mathematics, the convex hull or convex envelope for a set of points X in a real vector space V is the min … Wikipedia
Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… … Wikipedia
convex hull — Math. the smallest convex set containing a given set; the intersection of all convex sets that contain a given set. Also called convex cover, convex span … Useful english dictionary
convex hull — noun The smallest convex set of points in which a given set of points is contained … Wiktionary
Orthogonal convex hull — The orthogonal convex hull of a point set In Euclidean geometry, a set is defined to be orthogonally convex if, for every line L that is parallel to one of the axes of the Cartesian coordinate system, the intersection of K with L is empty, a… … Wikipedia
Dynamic convex hull — The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track, of the convex hull for the dynamically changing input data, i.e., when input data elements may … Wikipedia
Carathéodory's theorem (convex hull) — See also Carathéodory s theorem for other meanings In convex geometry Carathéodory s theorem states that if a point x of R d lies in the convex hull of a set P , there is a subset P prime; of P consisting of d +1 or fewer points such that x lies… … Wikipedia
Holomorphically convex hull — In mathematics, more precisely in complex analysis, the holomorphically convex hull of a given compact set in the n dimensional complex space C n is defined as follows. Let G subset {mathbb{C^n be a domain (an open and connected set), or… … Wikipedia
Local convex hull — (LoCoH) is a method for estimating the size the home range of an animal or a group of animals (e.g. a pack of wolves, a pride of lions, or herd of buffalos), and for constructing a utilization distribution. [Getz, W. M. and C. C. Wilmers, 2004. A … Wikipedia
Hull — may refer to: *Kingston upon Hull (invariably abbreviated to Hull), city in England named after the River Hull (Kings town upon Hull, prior to 1299 Wyke upon Hull) ** River Hull, river in East Riding of Yorkshire, England ** Hull City A.F.C.,… … Wikipedia