Efficient point inside rectangle boundaries search
After browsing through books, I've found one answer in Computational Geometry book (p. 237 in 3rd edition; 2008). This type of search is often referred to as stabbing query and is usually implemented using segment trees.
Complexities:
- The query: O(log2n + k), where k is the number of reported bounding boxes
- The data structure uses O(n*log n) storage
- The structure can be built in O(n*log n) time