I have a 2d coordinates system with some points on it, like this one:Now I am looking for an algorithm (or just some approach) to find neighboured points.So, if you have the coordinates of one point, and a list of other ones, how to find all neighbours of that point?  I really have no idea how to do this. If I look at the orange point, the grey, the blue and the light green one are obviously neighbours of it, but what about the others?You could put circles around the points... and look if any other of the points is in this circle. Those points should be listed as being neigbours of the first point.What I had: An array with tuples in it, every tuple representing the (x,y)-coodrinates of a point.What I wanted: A dictionary/map: the keys are every tuple from the above list and the value of such a point-tuple should be a list out of all it's neighbours.Problems:How do I define what is a neighbourhood of two points? What would the inputs be to such a definition (e.g. proximity threshold)?What would be a strategy to design and implement this?
Neighbourhood points (2d)
algorithms;geometry
I'm going to define neighboring points as points that share an edge with area of point in Voronoi diagram.To calculate which points are neighbors in voronoi diagram, you use Delaunay triangulation.