Queries the tree and returns items which may lie in the given search envelope.
Precisely, the items that are returned are all items in the tree
whose envelope may intersect the search Envelope.
Note that some items with non-intersecting envelopes may be returned as well;
the client is responsible for filtering these out.
In most situations there will be many items in the tree which do not
intersect the search envelope and which are not returned - thus
providing improved performance over a simple linear scan.
Queries the tree and visits items which may lie in the given search envelope.
Precisely, the items that are visited are all items in the tree
whose envelope may intersect the search Envelope.
Note that some items with non-intersecting envelopes may be visited as well;
the client is responsible for filtering these out.
In most situations there will be many items in the tree which do not
intersect the search envelope and which are not visited - thus
providing improved performance over a simple linear scan.