- Home /
Fast nearest neighbour searches
I am interested what would be the best method to use for nearest neighbour searches between Vector3 points?
I used KDTrees, like this, but they are a bit to slow for runtime.
I also found some posts that LSH approximate nearest neighbour searches can be faster, but I didn't found any implemented solutions for Unity. So does anyone know something about this?
Comment
Your answer
Follow this Question
Related Questions
Converting String to Variable Name 3 Answers
For in a hash table 1 Answer
Boo.Lang.Hash bug? 0 Answers
Hashtable Bejeweled movement 1 Answer
Hashtable problem c# 1 Answer