给定平面上的n个点，找其中的一对点，使得在n个点组成的所有点对中，该点对间的距离最小。-Plane on a given n points, find one of a pair of points, making the composition of the n points of all points, the distance between points on the smallest.

使用分治算法找到平面上的n各点的集合S中最小距离的一个点对-Use Divide and Conquer Algorithm to find the plane of the set of n points S in the minimum distance of a point on the