 Chan's algorithm

In computational geometry, Chan's algorithm, named after Timothy M. Chan, is an optimal output-sensitive algorithm to compute the convex hull of a set formula_1 of formula_2 points, in 2- or 3-dimensional space.The algorithm takes formula_3 time, where formula_4 is the number of vertices of the output (the convex hull).