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.

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

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.

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

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 closest pair problem solution with python 🧩

Simple GUI for Closest Pair Problem using DnC and BF

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

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

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.

Closest pair problem adalah masalah dalam geometri komputasi yang mencari pasangan titik terdekat dari sekumpulan titik di suatu ruang. Ada beberapa algoritma yang dikembangkan untuk menyelesaikan masalah ini dengan lebih efisien, seperti algoritma divide-and-conquer.

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)

Closest Pair of Points Problem using Divide and Conquer.

Computes closest pairs of points

Tugas Kecil 2 - Strategi Algoritma 2022/2023

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

Finding Closest Pair of Points in Multi-Dimensional Space using Divide and Conquer Algorithm

Geometry algorithms implementations in Python

No description provided.

This repo compares different algorithms that find the closest pair in a set of points.

O(n²) implementation of the Closest Pair of Points problem in 2D space using squared distance optimization.

Analysis of Algorithms II, Assignment II.