Follow topics & set alerts with myFT
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.
Just… don’t do it with JavaScript ffs.
侏儒症的治疗，正迎来被全面颠覆的时刻。