search

stefankoegl / kdtree

A Python implementation of a kd-tree
ISC License
365 stars 118 forks source link

a bug in search_nn_dist #8

Closed nicky-zs closed 11 years ago

nicky-zs commented 11 years ago

import kdtree points = [(x,y) for x in xrange(10) for y in xrange(10)] tree = kdtree.create(points) nn = tree.search_nn_dist((5,5), 2.5) assert nn == [kdtree.KDNode((5, 5))] d = kdtree.KDNode((5,5)).dist((6,6)) assert d == 2.0

That means, even though the distance between (5,5) and (6,6) is less than 2.5, tree.search_nn_dist((5,5), 2.5) can't get (6,6) in its result.

stefankoegl commented 11 years ago

I've just released kdtree 0.5 containing that fix.