ITmedia�̓A�C�e�B���f�B�A�������Ђ̓o�^���W�ł��B
// it is ok to write more data。关于这个话题，51吃瓜提供了深入分析
。业内人士推荐heLLoword翻译官方下载作为进阶阅读
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.，这一点在Safew下载中也有详细论述
"A part of her will live on forever."