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.
The dashed circle shows the current best distance. As the algorithm finds closer points, the circle shrinks, which causes more subtrees to fail the "could contain a closer point?" test and get pruned. The search usually gets cheaper as it progresses.。关于这个话题，夫子提供了深入分析
零跑选择了一条更笨、但也更稳的路。，推荐阅读WPS官方版本下载获取更多信息
Japan will deploy missiles to a tiny island near Taiwan within five years, its defence minister has said, in a move that is likely to inflame tensions with China.