最小覆盖圆，很多点，然后找一个最小覆盖他们这些点的圆，有算法。-coverage of the smallest circle, many of the points, and then look for a minimum coverage of these points they won, algorithm.

给定若干平面上的点，找出一个最小的圆包含这些点-A given number of points in the plane, find a minimal circle containing these points