const stack = []; // 单调递增栈：存储每个独立车队的到达时间
Opens in a new window
，这一点在搜狗输入法2026中也有详细论述
The tree starts as a single region covering the whole space. As points arrive, they get dropped into the region that contains them. When a region exceeds its capacity (the maximum number of points it can hold before splitting), the region divides into four children, and the existing points get redistributed.
Continue reading...