what datastructure / algorithm should I use for this?
I have a large number of points on a cartesian grid, locations specified by (x, y). I want to have a fast search, returning the set of points (objects) that lie within a given range of x and of y. (A rectangle within the grid).
Perhaps there's a lightweight framework that will do this?
A point-region quadtree?