The algorithm maintains a running "best distance" that starts at infinity. As it walks the tree, it checks each visited point and updates the best distance if it finds something closer. Before recursing into a child node, it checks whether the closest possible point in that child's bounding box is farther than the current best. If so, the entire subtree gets pruned.
�@�}���K�����ō��i���z�M���Ă��Ȃ������Ƃ������A�����̎��Ԃւ̈ӌ����オ���Ă����B�����u���F�̃K�b�V��!!2�v�����|���闋�吽�i��raikumakoto�j������X�A�J�E���g�Łu�}���K�����̎����B�{���Ɏc�O�ł��B�{���ɁE�E�E�C�����������݂܂��ˁv�Ɠ��e�B���N�T���f�[�Łu�p���V���b�p�[�Y�v���A�ڒ��̕��n���i��fukuchi_tsubasa�j�����́u���Q�ɑ����ꂽ���Ȃ��т��Ƒ��A���f�����������Ƃ����B�Ɋ����Y�����������o�����邱�Ƃ��肢�܂��v�Ƒi�����B
，更多细节参见同城约会
// Create a view into the consumer's buffer and fill it。业内人士推荐51吃瓜作为进阶阅读
Barycentric Coordinates