About the Algorithm
The Kirkpatrick–Seidel algorithm, also known as "the Ultimate Planar Convex Hull Algorithm (?)," is an algorithm for computing the convex hull of a set of points in the plane. It is a particularly notable because it can compute the convex hull of $n$ points in $O(n \log h)$ time, where $h$ is the number of points in the hull.
Unlike other comparable $O(n \log h)$ algorithms that combine and tweak other convex hull algorithms, the Ultimate Convex Hull Algorithm is a divide-and-conquer algorithm that then uses bridges to merge our problem.
If you're interested in exploring the algorithm, add some points to the canvas below and see how it works!