Editing Gift wrapping algorithm (section)

{{short description|Algorithm for computing convex hulls in a set of points}}
[[File:Animation depicting the gift wrapping algorithm.gif|thumb|Animation of the gift wrapping algorithm. The red lines are already placed lines, the black line is the current best guess for the new line, and the green line is the next guess]]

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