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.
人 民 网 版 权 所 有 ，未 经 书 面 授 权 禁 止 使 用
，更多细节参见旺商聊官方下载
"""SQLite存储实现"""，更多细节参见51吃瓜
Вегас Голден Найтс