fast kdtree tree implementation for python 3?

[_wolf]

does anyone have a suggestion for a ready-to-go, fast kdtree
implementation for python 3.1 and up, for nearest-neighbor searches? i
used to use the one from numpy/scipy, but find it a pain to install
for python 3. also, i'm trying to wrap the code from http://code.google.com/p/kdtree/
using cython, but i'm still getting errors.

i wish stuff like kdtree, levenshtein edit distance and similar things
were available in the standard library.