gift wrapping algorithm

In two dimensions, the gift wrapping algorithm is similar to the process of winding a string (or wrapping paper) around the set of points.

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

Another output-sensitive algorithm, the gift wrapping algorithm, was known much earlier, but the Kirkpatrick-Seidel algorithm has an asymptotic running time that is significantly smaller and that always improves on the O(n log n) bounds of non-output-sensitive algorithms.