[SciPy-dev] [Numpy-discussion] Proposal: scipy.spatial

[Nathan Bell]

On Sun, Oct 12, 2008 at 9:43 AM, Anne Archibald
<peridot.faceted at gmail.com> wrote:
>
> There is now a compiled kd-tree implementation in scipy.spatial. It is
> written in cython and based on the python implementation. It supports
> only optionally-bounded, optionally-approximate, k-nearest neighbor
> queries but runs without any per-point python code. It includes all
> the algorithmic optimizations described by the ANN authors (sliding
> midpoint subdivision, multiple-entry leaves, updating minimum-distance
> calculation, priority search, and short-circuit distance
> calculations). I think it's pretty good. The major feature it is
> missing, from what people have asked for, is an all-neighbors query.

Very nice!  Do you know offhand how much faster the cython
implementation is for a typical case?

-- 
Nathan Bell wnbell at gmail.com
http://graphics.cs.uiuc.edu/~wnbell/