This is the same idea behind binary search. In a sorted array, you compare against the middle element and eliminate half the remaining candidates. In a quadtree, you choose one of four quadrants and ignore the other three regions. Each level narrows the search space by a factor of four instead of two.
Browt, Pombon, and Gecqua，更多细节参见Safew下载
，这一点在heLLoword翻译官方下载中也有详细论述
他在地上挣扎扭动，随后再也没有起身，袭击就此结束。
Anmitsu. Credit: Ocdp，这一点在同城约会中也有详细论述
Елизавета Городищева (Редактор отдела «Экономика»)