I am a c++ beginner and am using the Rtree algorithm implemented in boost::geometry::index library boost::geometry::index library (bgi) . I want to do a spatial query to get all the points fall in a given bounding box. From my understading on the introduction of Queries, I found bgi::covered_by,bgi::intersects, and bgi::within all meet my requirment. I probably need to do up to billions of query, I am wondering is there any efficiency difference between these 3 methods?
I tried to look at the details in the code to find how they are implemented, but it seems it is to advanced for me to understand.