> One of the things people want is to find the all the points in > set X which are within distance r of any point in set Y. I thought about it - it should be fairly easy to adapt the all-neighbor search algorithm for this type of query as well. Should be very fast. It's on the to-do list. -Thomas