Marches through an array of points and finds their location in the quad tree and its friends that live in the same subtree.

1. qTree.doWithPointsInRadius(x,y,r,myAction)
2. point.closeEnoughTo(other, distance)
3. Bounds.createBoundsFromCenter(x, y, w, h);
4. bounds.inscribedCircleContains(x, y)