convex hull Kirkpatrick-Seidel Algorithm (Ultimate Planar Convex Hull Algorithm) Algorithm Complexity Applications Reading time: 15 minutes | Coding time: 9 minutes The Kirkpatrick–Seidel algorithm, called by its authors "the ultimate planar convex hull algorithm", is an algorithm for computing the
