Keywords: point-in-box numpy python vectorized range-query quadtree
inside = points_in_boxes( Npt points, Nbox boxes ) # -> (Npt, Nbox) bool
returns an Npt x Nbox bool array, True where points[i] is in boxes[j].
This takes < 3 nanoseconds * Npt * Nbox on my old imac;
1000 points in 1000 boxes, or a million points in 1 box, both take < 3 ms --



