High Quality Content by WIKIPEDIA articles! In mathematics, the convex hull or convex envelope for a set of points X in a real vector space V is the minimal convex set containing X. In computational geometry, a basic problem is finding the convex hull for a given finite nonempty set of points in the plane. It is common to use the term "convex hull" for the boundary of that set, which is a convex polygon, except in the degenerate case that the points are collinear. The convex hull is then typically represented by a sequence of the vertices of the line segments forming the boundary of the polygon, ordered along that boundary. For planar objects, i.e., lying in the plane, the convex hull may be easily visualized by imagining an elastic band stretched open to encompass the given object; when released, it will assume the shape of the required convex hull.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.