Closest Pair of Points Problem using Divide and Conquer.
-
Updated
Dec 27, 2021 - C++
Closest Pair of Points Problem using Divide and Conquer.
Analysis of Algorithms II, Assignment II.
Closest pair problem in 3D space using divide and conquer algorithm. Brute-force vs. divide and conquer approach complexity analysis.
My Data-Structures and Algorithms codes for CSE 203 Course.
The implementation in C++ of the closest-pair doubling algorithm which finds the smallest distance between two points in a metric space in O(n log n) time without directly using the points' coordinates.
24 problems implementation for Algorithms assignment and their details are included in README
Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
Add a description, image, and links to the closest-pair-of-points topic page so that developers can more easily learn about it.
To associate your repository with the closest-pair-of-points topic, visit your repo's landing page and select "manage topics."