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.
Sign up for the Money Makers newsletter to get weekly, expert-backed tips to help you earn more money — from real people who founded and scaled successful businesses. Get it in your inbox.
，这一点在同城约会中也有详细论述
"He still doesn't like you Ted, forget about it," says Kimmel. "He's never going to like you. No one does."
然而，美國最高法院週五以六名大法官多數意見做出對總統不利的裁決，並沒有太在意他的擔憂。