That's a fairly standard nearest neighbour search[0], usually made fast by using a kd-tree[1] or an R-tree[2]. [0] https://en.wikipedia.org/wiki/Nearest_neig

That's a fairly standard nearest neighbour search[0], usually made fast by using a kd-tree[1] or an R-tree[2]. [0] https://en.wikipedia.org/wiki/Nearest_neighbor_search [1] https://en.wikipedia.org/wiki/K-d_tree [2] https://en.wikipedia.org/wiki/R-tree