O(n) algorithm for finding closest pair of points, as described in: http://people.scs.carleton.ca/~michiel/simplerando.pdf
craigthelinguist / closest-pair Goto Github PK
View Code? Open in Web Editor NEWClosest pair of d-dimensional points in O(n^d) time.