Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
Closest pair problem in 3D space using divide and conquer algorithm. Brute-force vs. divide and conquer approach complexity analysis.
algorithm design projects focused on fundamental algorithms, including their specifications, approaches, and implementations in C/C++.
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.
My Data-Structures and Algorithms codes for CSE 203 Course.
Closest Pair of Points Problem using Divide and Conquer.
24 problems implementation for Algorithms assignment and their details are included in README
Analysis of Algorithms II, Assignment II.
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."