This story was originally featured on Fortune.com
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.
。关于这个话题，heLLoword翻译官方下载提供了深入分析
We’re accepting limited sponsors for the elementary Blog. View our public analytics and learn more if you are interested.
They cited VirusTotal and essentially said: “Go fix everyone else first.”