1
edit
Changes
→Closet Pair
GPU: nVIDIA GEFORCE GT 620
== Closet Closest Pair ==
'''Unfortunately we had to abandon the project since it was not really compatible with CUDA(there is no time to look more into it as the semester is almost over...). Team TudyBert, who are also working on the same project, have found that CUDA uses dynamic libraries where Dirve_God_Lin uses static libraries and there isn’t much to be done about that. As a result, we will be using Stephanie’s closet pair program.'''
The closet closest pair problem can be explained simply by imagining a random set of points spread in a metric space. Now the process of finding two points with the smallest distance between them is called the closet closest pair problem.
One of the more common algorithm used to find the closet closest pair is the Brute-force algorithm; which is calculating the distances of all the point ( O(n^2) notation):
