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.
This Tweet is currently unavailable. It might be loading or has been removed.，详情可参考heLLoword翻译官方下载
Thanks for reading! 🙏🏻，这一点在heLLoword翻译官方下载中也有详细论述
* Subscribers only