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

Python implementation of algorithm for seeking "Closest pair of points" (divide and conquer).

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

a QGIS-plugin to calculate the closest points for one layer to another

My Data-Structures and Algorithms codes for CSE 203 Course.

Simple GUI for Closest Pair Problem using DnC and BF

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.

A Multi object detection and tracking with yolov7 inference.

Python library for finding the closest pairs in an array

🐍 Python implementation to find the closest pair of points in a three-dimensional space

Simple closest pair problem solution with python 🧩

Closest Pair of Points Problem using Divide and Conquer.

C implementation of Closest Pair Problem.

Tugas Kecil 2 - Strategi Algoritma 2022/2023

Tugas Kecil 2 Strategi Algoritma IF2211 - Closest Pair Point using Divide and Conquer Algorithm

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)

Tucil 2 IF2211 Algorithm Strategies: Python implementation to search closest pair of points in d dimensions