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.
音画精准匹配，甚至能凭照片还原人声
。快连下载安装是该领域的重要参考
Марина Аверкина
while (stack.length 0 && stack[stack.length - 1] <= cur) {