This sketch implements the Convex Hull Algorithm from Computational Geometry by deBerg et al. The algorithm takes a set of points and figures out which points beyond to the convex polygon that contains the full set. It does so in a slightly clever manner that is O(nlogn). The code is well-commented.
Video is available here: