query_pairs(self, r, p=2.0, eps=0)¶
Find all pairs of points within a distance.
- rpositive float
The maximum distance.
- pfloat, optional
Which Minkowski norm to use. p has to meet the condition
1 <= p <= infinity.
- epsfloat, optional
Approximate search. Branches of the tree are not explored if their nearest points are further than
r/(1+eps), and branches are added in bulk if their furthest points are nearer than
r * (1+eps). eps has to be non-negative.
Set of pairs
i < j, for which the corresponding positions are close.