Assignments done during CS403, Even Semester 2016-2017, IIT Mandi
-
Updated
Aug 24, 2017 - C++
Assignments done during CS403, Even Semester 2016-2017, IIT Mandi
Closest pair problem in 3D space using divide and conquer algorithm. Brute-force vs. divide and conquer approach complexity analysis.
C++ implementation of parallel 'Closest Pair' algorithm (https://www.cs.cmu.edu/~guyb/papers/BM04.pdf pages 44-46)
Closest Pair and Convex Hull
Add a description, image, and links to the closest-pair topic page so that developers can more easily learn about it.
To associate your repository with the closest-pair topic, visit your repo's landing page and select "manage topics."