最小点对问题（二维）



二维最接近点对问题：给定平面上n个点，找其中的一对点，使得在n个点的所有点对中，该点对的距离最小。严格地说，最接近点对可能多于1对。



【本算法基于C++语言编写，在Windows平台的DEV C++下编译通过，且运行正常】

-The minimum point of the problem (two-dimensional) two-dimensional closest point of the problem: a pair of points given n points in the plane, looking for them, so that all points of n points, the point of minimum distance. Strictly speaking, the closest point to the possibility of more than one pair. The algorithm is based on C++ written language.