The quadtree is the two-dimensional case of a broader family of space-partitioning data structures. Octrees extend the same idea to three dimensions (splitting cubes into eight children), KD-trees use alternating axis-aligned splits (splitting along x, then y, then x again), and R-trees group nearby objects into bounding rectangles. Each variant makes different tradeoffs between construction time, query speed, and update cost.
Екатерина Улитина (Редактор отдела «Забота о себе»)，更多细节参见爱思助手下载最新版本
。一键获取谷歌浏览器下载对此有专业解读
ITmedia�̓A�C�e�B���f�B�A�������Ђ̓o�^���W�ł��B，这一点在下载安装 谷歌浏览器 开启极速安全的 上网之旅。中也有详细论述
But he agrees with Josh that "there is a huge amount to do" for fans.