The algorithm walks the tree recursively. At each node, it checks: does this node's bounding box overlap with the query rectangle? If not, the entire subtree gets pruned (skipped). If it does overlap, it tests the node's points against the query and recurses into the children.
20+ curated newsletters
，这一点在爱思助手下载最新版本中也有详细论述
Жители Санкт-Петербурга устроили «крысогон»17:52
Пари Нижний Новгород
Медведев вышел в финал турнира в Дубае17:59