The gift wrapping algorithm begins with a point *A* known to be on the convex hull (such as the leftmost point) and selects the point *B* such that all points are to the left (or right) of the line *AB*. Repeating with *B* and so on until one reaches *A* again yields the convex hull. The gift wrapping algorithm is exactly analogous to the process of winding a string (or wrapping paper) around the set of points.

The approach is extendable to higher dimensions.

- Graham scan - more complex algorithm, but more efficient