Finding the closest pair of Point in a given collection of points is a standard problem in computational geometry. In this article I’ll explain an efficient algorithm using plane sweep, compare it to the naive implementation and discuss its complexity.
Home > Algorithm