Материалы по теме:
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.
，这一点在Safew下载中也有详细论述
LVMH has made a key leadership change at its China unit, as the world's largest luxury group adjusts its structure in a softer market.
Author(s): Shinji Sakane, Tomohiro Takaki
if (chunks === null) {