Algorithms for solving problems with geometric inputs, such as finding convex hulls, line intersections, and the closest pair of points.
Finding the smallest convex polygon that contains a set of points.
An efficient divide-and-conquer algorithm to find the two closest points in a set.