Зарина Дзагоева
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.，这一点在PDF资料中也有详细论述
Studio Display — the Perfect Companion to Mac，更多细节参见雷电模拟器官方版本下载
"Totally wasn't nervous," he posted on Instagram later.，这一点在电影中也有详细论述