Hey guys,
Does anyone know anything about K-dimensional trees and implementing the nearest neighbor algorithm?
I have constructed the tree following the algorithm on the wikipedia entry for kd-Trees but am confused on how to implement the search algorithm to find multiple nearest neighbors.
Any help much appreciated.
As a birthday present to the
As a birthday present to the TC (yes I looked it up)
http://en.wikipedia.org/wiki/Kd-tree and
http://en.wikipedia.org/wiki/Kd-tree#Nearest_neighbor_search
... though you probably don't care any more / found out long ago :P
---
Wyatt Carss
... a guy
http://wcarss.blogspot.com