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.
Vishnevskiy said this system "does not read your messages, analyse your conversations, or look at the content you post" in order to determine your age.
，这一点在safew官方版本下载中也有详细论述
微软公布「玻璃盘」，容量 4.8TB 可保存上万年
https://feedx.site