Using C++ implementation of KDTree

===============
Basic Scale Tests:
===============
n=10 KDTree built in 0.0074 ms
n=10 KDTree found in 0.0024 ms
n=100 KDTree built in 0.0527 ms
n=100 KDTree found in 0.0014 ms
n=1000 KDTree built in 0.7665 ms
n=1000 KDTree found in 0.0014 ms
n=10000 KDTree built in 10.6316 ms
n=10000 KDTree found in 0.0026 ms
n=100000 KDTree built in 141.6891 ms
n=100000 KDTree found in 0.0081 ms

===============
Basic GeoKDTree Tests:
===============
Success: Closest index is correct.
Success: Closest point is correct.

===============
GeoKDTree SCALE Tests:
===============
n=1000 GeoKDTree data created in 0.4227 ms
n=1000 GeoKDTree built in 1.018 ms.
n=1000 GeoKDTree found in 0.0021 ms.
n=10000 GeoKDTree data created in 4.5609 ms
n=10000 GeoKDTree built in 15.1136 ms.
n=10000 GeoKDTree found in 0.005 ms.
n=100000 GeoKDTree data created in 43.9467 ms
n=100000 GeoKDTree built in 221.446 ms.
n=100000 GeoKDTree found in 0.0069 ms.
n=1000000 GeoKDTree data created in 437.3243 ms
n=1000000 GeoKDTree built in 3615.5252 ms.
n=1000000 GeoKDTree found in 0.0327 ms.
