Description: This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
- [dem_make_show] - based on discrete data generated dem pap
- [Sort] - Is to do a partition of the algorithm, a
- [unittestppt] - Unit test theory PPT, divided into four
File list (Check if you may need any files):
ClosetPairs\ClosetPairs.csproj
...........\bin\Debug\ClosetPairs.exe
...........\...\.....\ClosetPairs.pdb
...........\...\.....\ClosetPairs.vshost.exe
...........\...\.....\ClosetPairs.vshost.exe.manifest
...........\obj\Debug\ClosetPairs.csproj.FileListAbsolute.txt
...........\...\.....\ClosetPairs.exe
...........\...\.....\ClosetPairs.pdb
...........\Properties\AssemblyInfo.cs
...........\Program.cs
...........\obj\Debug\TempPE
...........\bin\Debug
...........\obj\Debug
...........\bin
...........\obj
...........\Properties
ClosetPairs
Download