Julian Kent's kd-tree
From User talk:Tmservo
Jump to navigation
Jump to search
Revision as of 5 October 2013 at 00:32.
The highlighted comment was created in this revision.
The highlighted comment was created in this revision.
They're pretty much tied. Mine might be a little faster on systems where the data in the Kd-Tree is frequently pushed out of cache.
Skilgannon (talk)
No, as I said above, they are mostly the same except for cache conditions.
Skilgannon (talk)
3rd gen is the fastest of Rednaxela's trees. There's also a k-NN algorithm benchmark if you want to run some tests.