Y
Hacker News
new
|
ask
|
show
|
jobs
by
bglazer
2908 days ago
This is generally called the k-Nearest Neighbors problem. You should check out the various data structures for doing this, like the ball tree and kd tree.