[SciPy-User] KDTree count_neighbors

[elmar]

hi Anne,

will try length - but tomorrow

elmar

Am 02.07.2010 22:25, schrieb Anne Archibald:
> The count_neighbors function is designed to compare close neighbors
> between two trees, not between one tree and one point or one tree and
> one array of points. I think the fastest way to get what you want is
> to just query for the neighbors and take the length of the resulting
> list. You could also try putting your query point (or points) into a
> KDtreel; if you have many query points this will be much faster.
>
> Anne
......................