How to find the closest 2 points in a 100 dimensional space with 500,000 points?
问题 I have a database with 500,000 points in a 100 dimensional space, and I want to find the closest 2 points. How do I do it? Update: Space is Euclidean, Sorry. And thanks for all the answers. BTW this is not homework. 回答1: You could try the ANN library, but that only gives reliable results up to 20 dimensions. 回答2: There's a chapter in Introduction to Algorithms devoted to finding two closest points in two-dimensional space in O(n*logn) time. You can check it out on google books. In fact, I