吳先生說問卷流於空泛，「現在不可以令我想到下一步怎樣做。」
FT Edit: Access on iOS and web
。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.
（作者单位：北京大学考古文博学院）