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).

A Multi object detection and tracking with yolov7 inference.

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

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++.

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

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.

Simple closest pair problem solution with python 🧩

Simple GUI for Closest Pair Problem using DnC and BF

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

Python library for finding the closest pairs in an array

Closest Pair of Points Problem using Divide and Conquer.

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

Geometry algorithms implementations in Python

Projeto e implementação de uma classe e funções para resolução de problemas clássicos de geometria computacional. Trabalho realizado no 6º período de Ciência da Computação do Instituto Federal de Minas Gerais(IFMG) - Campus Formiga para a Disciplina Projeto e Análise de Algoritmos