smallest-circle Algorithm

The smallest-circle problem (also known as minimal covering circle problem, bounding circle problem, smallest enclosing circle problem) is a mathematical problem of compute the smallest circle that contains all of a given set of points in the euclidean an example of a facility location problem (the 1-center problem) in which the location of a new facility must be choose to supply service to a number of customers, minimizing the farthest distance that any customer must travel to reach the new facility.

smallest-circle source code, pseudocode and analysis