closest-pair-of-points

There are 1 repository under closest-pair-of-points topic.

• andreacasalino / Flexible-GJK-and-EPA

  Implementations of the GJK and EPA algorithm for performing proximity queries on pair of convex shapes

  gjkgjk-algorithmepaepa-algorithmminkowski-differenceconvexhullconvexcppclosest-pair-of-pointsdistance-calculationpenetration-depthpenetration-vector
  Language:C++ 26

• HuangQiang / ExactPair

  GPU-based Exact Closest/Furthest Pair Search

  ground-truthcudagpuhigh-dimensional-dataclosest-pair-of-pointsfurthest-pairs-search
  Language:Cuda 4

• Johnsuuuu / data-structures-and-algorithms

  data structures and algorithms implemented in Python

  data-structuresalgorithmsinterviewcomputer-sciencetreegraphconvex-hullsortb-tree-implementationgreedy-algorithmsdivide-and-conquerclosest-pair-of-pointsmaximum-flowavl-tree-implementationsred-black-treestring-algorithmsdynamic-programmingbacktrakingpython3
  Language:Jupyter Notebook 3

• Tosha1409 / Closest_pair_of_points

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

  pairofpointsclosestfieldclosest-pair-of-points
  Language:Python 3

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

  cppalgorithmalgorithmsalgorithms-datastructuresclosest-pairclosest-pair-of-pointsdata-structures
  Language:C++ 2

• 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

  bruteforceclosest-pair-of-pointsclusterdivide-and-conquerdivide-et-imperahpchpc-clustersmpimpichparallel-computingparallel-implementationsparallel-programming
  Language:Shell 2

• ashiqursuperfly / data-structures-algorithms-1

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

  data-structuresalgorithmsdynamic-programmingdivide-and-conquergreedy-algorithmsoptimal-binary-search-treegraphlinked-listjavacpphuffman-codingmatrix-chain-multiplicationlcs-algorithmskylineproblemclosest-pair-of-pointsmergesortquicksortheapkaratsuba-multiplicationkaratsuba-algorithm
  Language:C++ 1

• asujaykk / Yolov7-Multi-Object-tracking

  A Multi object detection and tracking with yolov7 inference.

  closest-pair-of-pointsobjecttrackingyolov7multiobject-trackingobjectdetectionvehicle-trackingcomputer-visioniouiou-calculationspeeddetectortraffic-monitoringvehicle-trajectory
  Language:Python 1

• farhanfahreezy / Tucil2_13521092_13521106

  Simple GUI for Closest Pair Problem using DnC and BF

  brute-forceclosest-pair-of-pointsdivide-and-conquer
  Language:Python 1

• jagodki / Closest-Points

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

  closestclosest-pair-of-pointsclosest-pointsgisnearestqgis-pluginqgis-processingqgis3-plugin
  Language:Python 1

• JustinShenk / closely

  Python library for finding the closest pairs in an array

  similaritypointsneighborsclosest-pair-of-points
  Language:Python 1

• noelsimbolon / proximate

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

  closest-pair-of-pointsdivide-and-conquerdivide-and-conquer-algorithms
  Language:Python 1

• projeto-de-algoritmos / D-C_ClosestPairOfPoints

  O par de pontos mais próximos.

  javascriptdivide-and-conquerclosest-pair-of-points
  Language:JavaScript 1

• rifqifarhansyah / Tucil2_13521166

  Simple closest pair problem solution with python 🧩

  brute-forceclosest-pair-of-pointsdivide-and-conquerclieuclidean-distancespython
  Language:Python 1

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

  anil-maheshwaryclosest-pair-of-pointscomputational-geometrycomputational-geometry-algorithmsdoubling-metricsimplementation-of-algorithmsimplementation-of-research-papermichiel-smidwolfgang-mulzer
  Language:C++ 1

• AyanPahari / Closest-Pair-of-Points

  Closest Pair of Points Problem using Divide and Conquer.

  closest-pair-of-pointsdivide-and-conquer
  Language:C++ 0

• davidemodolo / Closest-pair-of-points-HPC

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

  algorithmclosest-pair-of-pointshpcmpiparallel-computing
  Language:C 0

• irsyadnb / Closest-Pair-Problem-3D

  Closest Pair Problem in 3D using Divide and Conquer

  closest-pair-of-pointsdivide-and-conquer
  Language:Python 0

• ishmahafeez / OMP-vs-MPI

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

  closest-pair-of-pointsgraham-scan-algorithmmpiopenmp
  Language:C 0

• 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

  algorithm-strategiesalgorithmsclosest-pair-of-pointsdivide-and-conquermatplotlibn-dimensionalnumpypythonstrategi-algoritma
  Language:Python 0

• kennypanjaitan / Closest-Pair-of-Points

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

  closest-pair-of-pointsdivide-and-conquermulti-dimensional
  Language:Python 0

• liviaarumsari / Closest-Pair-of-Points

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

  algorithm-strategiesclosest-pair-of-pointsdivide-and-conquer
  Language:Python 0

• pakzaban / closest_pair

  Python implementation of recursive closest pair algorithm

  closest-pair-of-pointsrecursive-algorithm
  Language:Python 0

• ronek22 / geometry-algorithms

  Geometry algorithms implementations in Python

  geometry-algorithmsgeometryplottingpolygonsubset-sumtraveling-salesmantriangulationkdtreeclosest-pair-of-points
  Language:Python 0

• tsjabie-o / Closest-Points

  Studie - Closest Points Problem

  closest-pair-of-pointsicomparerrecursion
  Language:C# 0

• umutsevdi / closest-pair

  C implementation of Closest Pair Problem.

  algorithmalgorithms-and-data-structuresclosest-pair-of-pointsclosest-pairclosest-points
  Language:C 0

• 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?

  efficient-algorithmefficient-implementationsclosest-pair-of-pointspython
  Language:Python

• ammahmoudi / ClosestPointsFinder

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

  algorithm-challengesalgorithmsalgorithms-and-data-structuresclosest-pair-of-points
  Language:Java

• AntVil / closest-pair

  Computes closest pairs of points

  closest-neighbourclosest-pairclosest-pair-of-pointssweep-line-algorithmwebapp
  Language:JavaScript

• arturoaviles / k_closest_points

  closest-pair-of-pointsmaxheappython3sorted
  Language:Python

• 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

  linear-classifierpythonsweep-line-algorithmclosest-pair-of-points
  Language:Jupyter Notebook

• mikeleo03 / Closest-Pair-Points-Problem

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

  closest-pair-of-pointsdivide-and-conquerpython3
  Language:Python

• miretteamin / Algorithms-Assignment

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

  prims-algorithmkruskal-algorithmcodeforcesproblem-solvingclosest-pair-of-pointsmapsdynamic-programminggraphmstactivityselectionproblemdjikstrahuffman-codingjobsequencingskiplisthashingbinary-searchinsertion-sortquicksort
  Language:C++

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

  closest-pair-of-pointscomputational-geometrydivide-and-conquer
  Language:Python

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

  divide-and-conqueralgorithmsnlogndistanceclosest-pair-of-pointsclosest-pairminimalperimetertriangle
  Language:Python

• yuujin-Q / Tucil2_13521074_13521100

  Tugas Kecil 2 - Strategi Algoritma 2022/2023

  closest-pair-of-pointsdivide-and-conquer
  Language:Python