│ walls only │ filter on │ kernel in │ boundary │ access at
The algorithm also visits children in order of distance to the query point. This means it checks the most promising quadrants first, which tends to find a good candidate early and enables aggressive pruning of the remaining quadrants. Without this ordering, the algorithm would still produce the correct result, but it would prune fewer nodes.
，推荐阅读51吃瓜获取更多信息
Waxing Gibbous - More than half is lit up, but it’s not quite full yet.
�@���{�Ŕ̔������Ă������v���[�J�[�i�S���[�J�[�Ƃ����Ȃ��̂��c�O�j�̑S���i�����x�ɐG���āA���������葊�k�������̌��ł����C�x���g�Ȃ̂ł��邩���A�e�ЂƂ��l�X�ȃj�[�Y�Ɍ����Đ��i�̑̌����s���Ă����B