The Kirkpatrick–Seidel algorithm, proposed by its authors as a potential "ultimate planar convex hull algorithm", is an algorithm for computing the convex hull of a set of points in the plane, with O {\displaystyle {\mathcal {O}}} time complexity, where n {\displaystyle n} is the number of input points and h {\displaystyle h} is the number of points in the hull. Wikipedia