I have a list of points in $R^n$, and for each point I want to find the Euclidean distance to the nearest other point in the list. I don't need to know the coordinates of the nearest neighbor; I only need the distance. The naive approach would be to compare each point to every other, resulting in quadratic running time. Are there any better approaches?

  • $\begingroup$ Have a look at metric trees for starters. $\endgroup$ – Juho Jun 2 '15 at 17:19

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.