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

SlavkoPrytula / Find-The-Closest-Pair-Of-Points Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

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)

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
BrutForcePerimeter.py		BrutForcePerimeter.py
Kleinberg, Tardos.pdf		Kleinberg, Tardos.pdf
minDistance.py		minDistance.py
minTriPerimeter.py		minTriPerimeter.py

About

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)

algorithms minimal distance triangle perimeter divide-and-conquer closest-pair closest-pair-of-points nlogn

Activity

0 stars

2 watching

0 forks

Report repository