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
-
Updated
Oct 14, 2020 - Python