Description: Two-dimensional nearest point of the algorithm, respectively, and partition with traversal algorithm, and compare the time to achieve
To Search:
File list (Check if you may need any files):
ClosestPair\ClosestPair\ClosestPair.cpp
...........\...........\ClosestPair.h
...........\...........\ClosestPair.vcproj
...........\...........\ClosestPair.vcproj.LENOVO-80FFBF0C.user.user
...........\ClosestPair.ncb
...........\ClosestPair.sln
...........\ClosestPair.suo
...........\ClosestPair
ClosestPair