Open mjrasobarnett opened 13 years ago
Absorb Emyr's kdtree algorithms into codebase as they perform significantly faster than my own implementation.
Also, it is advised to shuffle the points list before putting into the tree, http://www.cplusplus.com/reference/algorithm/random_shuffle/
Have tested Emyr's implementation and it is significantly faster. Will now absorb his algorithm into codebase.
Absorb Emyr's kdtree algorithms into codebase as they perform significantly faster than my own implementation.
Also, it is advised to shuffle the points list before putting into the tree, http://www.cplusplus.com/reference/algorithm/random_shuffle/