Difference between revisions of "Thread:Talk:Kd-tree/Mini-Sized/reply (4)"
Jump to navigation
Jump to search
Skilgannon (talk | contribs) m (Reply to Mini-Sized) |
(No difference)
|
Latest revision as of 19:37, 17 July 2013
I ran across this while doing my KD-Tree research
http://www.michaelpollmeier.com/selecting-top-k-items-from-a-list-efficiently-in-java-groovy/
It looks like once you calculate your distances to everything (two for loops) it's just about 4 lines of code.
