Последние новости
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.
，推荐阅读一键获取谷歌浏览器下载获取更多信息
但如果是早晚高峰挤广州地铁三号线的时候，倒是可以考虑打开第二档。
Natural Neighbour Interpolation