My first time I join the community, thanks all contributors for this library, part of boost.

Hope that I can get some helps.

I'm working on a data issue where I will have a lot of points (says a few millions), many of them overlaps. Can I use the rtree, push all my points(2D) inside, and get the group of rectangles where the size is small enough (I will define how is small enough in my query). Then I iterate from those small rectangles, get points from them, and to my analyze on those.

So my question is : Is it possible to query the rtree by size of rectangle, instead of certain concrete geometry form?