I am struggling to wrap my head around how the divide and conquer algorithm works for dimensions greater than 2, specifically how to find the closest pair of points between two sub-problems. I kn...

Is there a known, efficient algorithm for finding the closest group of three points in a cloud? This is similar to the closest pair of points problem but I am looking for three points instead of tw...

I have a 2 dimensional array: MyArray = array([6588252.24, 1933573.3, 212.79, 0, 0], [6588253.79, 1933602.89, 212.66, 0, 0], etc...) The first two elements MyArray[0] and MyArray[1] are the X ...

I have two numpy arrays containing timeseries (unix timestamps). I want to find pairs of timestamps (1 from each array) whose difference is within a threshold. For achieving this, I need to align t...

I am trying to implement the closest pair problem in Python using divide and conquer, everything seems to work fine except that in some input cases, there is a wrong answer. My code is as follows: ...

I can find the distance between a point MyPoint and a polygon MyPolygon with double dist = boost::geometry::distance(MyPoint, MyPolygon) obviously the actual closest point on MyPolygon has to b...

I know this may be a duplicate, but it seems like a variation on the 'Closest pair of Points' algorithm. Given a Set of N points (x, y) in the unit square and a distance d, find all pair of poin...

Given a list of points in a two dimensional space, you want to perform a function in Haskell to find the distance between the two closest points. example: Input: project [(1,5), (3,4), (2,8), (-1,2...

I am trying to implement a simpler version of this algorithm but which works better than the quadratic algorithm. My idea basically is to sort the points by only x coordinate and try to solve it fr...

I have about 75 million records in a SQL Server 2008 R2 Express database. Each is a lat long corresponding to some value. The table has geography column. I am trying to find one nearest neighbor fo...