Skip to main content
. 2020 Feb 3;17(3):261–272. doi: 10.1038/s41592-019-0686-2

Fig. 3. Results of the scipy.spatial.cKDTree.query benchmark from the introduction of cKDTree to the release of SciPy 1.0.

Fig. 3

The benchmark generates a k-d tree from uniformly distributed points in an m-dimensional unit hypercube, then finds the nearest (Euclidean) neighbor in the tree for each of 1,000 query points. Each marker in the figure indicates the execution time of the benchmark for a commit in the master branch of SciPy.