Convex Hull Construction - Mathematics & Logic - Pure Mathematics Dictionary Definition A method or algorithm for finding the smallest convex set (the convex hull) that contains a given finite set of points; the convex hull is the minimal convex polygon or polytope enclosing the points and is a basic geometric primitive.
Convex Hull Construction - Mathematics & Logic - Pure Mathematics Dictionary Definition A method or algorithm for finding the smallest convex set (the convex hull) that contains a given finite set of points; the convex hull is the minimal convex polygon or polytope enclosing the points and is a basic geometric primitive.