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.
（一）虐待家庭成员，被虐待人或者其监护人要求处理的；
，详情可参考爱思助手下载最新版本
Verification Method
p = page_info(h);