dışbükey örtü

listen to the pronunciation of dışbükey örtü
Турецкий язык - Английский Язык
convex hull
The smallest convex set of points in which a given set of points is contained
(of a set) The intersection of all convex supersets (which can be limited to halfspaces) Equivalently, the set of all convex combinations of points in the set (which can be limited to convex combinations of at most n+1 points, in n dimensions, which is known as Carathéodory's Theorem)
The convex hull of a given set of points is the smallest convex set that contains all the points
The surface of minimum area with convex (outward-bowing) curvature that passes through all the spatial points in a set In three dimensions, this set must contain at least four non-coplanar points to make a closed surface with nonzero enclosed volume
The surface of minimum area with convex (outward-bowing) curvature that passes through all the points in the set In three dimensions, this set must contain at least four non-coplanar points to make a closed surface with nonzero enclosed volume
(Spatial User's Guide and Reference)
The convex hull of a polygon or polyhedron is the smallest convex polygon or polyhedron which encloses the given shape
The convex hull of a set of points is the intersection of all convex sets which contain the points
The convex hull of a bounded subset of a 2D plane is the convex set of smallest area that contains the original set If one thinks of the points of the original set as pegs on a board, then the convex hull would be those points interior to a rubber band stretched around the pegs
dışbükey örtü
Избранное