In computational geometry, the gift wrapping algorithm is an algorithm for computing the convex hull of a given set of points.