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.
Source: Computational Materials Science, Volume 267
，更多细节参见WPS官方版本下载
Александр Курбатов (редактор отдела «Бывший СССР»)
But for many North Korea watchers, the Workers’ party congress – held over several days just once every five years – was a rare opportunity to speculate over the identity of the country’s future leader.