Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
-
Updated
Apr 20, 2024 - C++
Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes
GPU-based Exact Closest/Furthest Pair Search
A Multi object detection and tracking with yolov7 inference.
data structures and algorithms implemented in Python
a QGIS-plugin to calculate the closest points for one layer to another
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++.
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.
Trabalho de Projeto de Algoritmos do semestre 26.1 sobre Dividir e Conquistar. [União de Municípios]
My Data-Structures and Algorithms codes for CSE 203 Course.
🐍 Python implementation to find the closest pair of points in a three-dimensional space
Simple GUI for Closest Pair Problem using DnC and BF
Simple closest pair problem solution with python 🧩
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
Ferramenta de linha de comando em Java que determina o par de pontos mais próximos em coordenadas geoespaciais de grande escala — Divide & Conquer (O(n log n)) com relatório de desempenho (tempo, memória e comparações). Projeto de Análise de Algoritmos, ISPTEC.
Visualization for the solving of the closest pair problem using a plane sweep algorithm.
A 2D linear classifier that wraps each group of points in a tight shape and then draws a separating line
To associate your repository with the closest-pair-of-points topic, visit your repo's landing page and select "manage topics."