closest-pair-of-points

HuangQiang/ExactPair

GPU-based Exact Closest/Furthest Pair Search

Johnsuuuu/data-structures-and-algorithms

data structures and algorithms implemented in Python

asujaykk/Yolov7-Multi-Object-tracking

A Multi object detection and tracking with yolov7 inference.

Tosha1409/Closest_pair_of_points

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

0x01h/closest-pair-distance-3d

Closest pair problem in 3D space using divide and conquer algorithm. Brute-force vs. divide and conquer approach complexity analysis.

KevinDepedri/MPI-Parallel-Closest-Pair-of-Points

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

ashiqursuperfly/data-structures-algorithms-1

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

farhanfahreezy/Tucil2_13521092_13521106

Simple GUI for Closest Pair Problem using DnC and BF

jagodki/Closest-Points

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

JustinShenk/closely

Python library for finding the closest pairs in an array

noelsimbolon/proximate

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

projeto-de-algoritmos/D-C_ClosestPairOfPoints

O par de pontos mais próximos.

rifqifarhansyah/Tucil2_13521166

Simple closest pair problem solution with python 🧩

ThangMinhCao/closest-pair-doubling

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.

AyanPahari/Closest-Pair-of-Points

Closest Pair of Points Problem using Divide and Conquer.

davidemodolo/Closest-pair-of-points-HPC

MPI parallel implementation of bruteforce and divide et impera approaches to the Closest Pair of Points problem

irsyadnb/Closest-Pair-Problem-3D

Closest Pair Problem in 3D using Divide and Conquer

ishmahafeez/OMP-vs-MPI

Comparison of sorting algorithms Closest Point and Gharam Scan through OpenMP and MPI

juanmbraga/linear-classifier-with-computational-geometry

A 2D linear classifier that wraps each group of points in a tight shape and then draws a separating line

KenEzekiel/Tucil2_13521089_13521171

A Closest Pair of Point Problem Solver, made using the Divide and Conquer approach for the Algorithm and Strategies Course using Python

kennypanjaitan/Closest-Pair-of-Points

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

liviaarumsari/Closest-Pair-of-Points

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

pakzaban/closest_pair

Python implementation of recursive closest pair algorithm

ronek22/geometry-algorithms

Geometry algorithms implementations in Python

tsjabie-o/Closest-Points

Studie - Closest Points Problem

umutsevdi/closest-pair

C implementation of Closest Pair Problem.

0deadLock0/Efficient-Closest-Pair-of-Points

Brute Force to find the minimum distance between 2 points in a set of n points takes (n^2) computations. Can we do better?

ammahmoudi/ClosestPointsFinder

Finding closest points on a 2d plane with different data structures in O(n log n)

AntVil/closest-pair

Computes closest pairs of points

arturoaviles/k_closest_points

mikeleo03/Closest-Pair-Points-Problem

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

miretteamin/Algorithms-Assignment

24 problems implementation for Algorithms assignment and their details are included in README

NicholasLiem/IF2211_TugasKecil_2_ClosestPairNDimension

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.

SlavkoPrytula/Find-The-Closest-Pair-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)

yuujin-Q/stima-divide-and-conquer

Tugas Kecil 2 - Strategi Algoritma 2022/2023