Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
GPU-based Exact Closest/Furthest Pair Search
data structures and algorithms implemented in Python
A Multi object detection and tracking with yolov7 inference.
a QGIS-plugin to calculate the closest points for one layer to another
Closest pair problem in 3D space using divide and conquer algorithm. Brute-force vs. divide and conquer approach complexity analysis.
Parallel MPI implementation of Bruteforce and Divide et Impera approaches to solve the Closest Pair of Points problem leveraging the HPC infrastructure provided by the University of Trento
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.
Simple GUI for Closest Pair Problem using DnC and BF
My Data-Structures and Algorithms codes for CSE 203 Course.
Simple closest pair problem solution with python 🧩
🐍 Python implementation to find the closest pair of points in a three-dimensional space
MPI parallel implementation of bruteforce and divide et impera approaches to the Closest Pair of Points problem
Python library for finding the closest pairs in an array
Computes closest pairs of points
Given an array consisting of n distinct points[p1[x1, y1] ... pn[xn, yn]]. Find the closest pair of points using a Divide-and-Conquer Algorithm with asymptotic complexity of O(N log N)
A 2D linear classifier that wraps each group of points in a tight shape and then draws a separating line
C implementation of Closest Pair Problem.
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."