Bibliographic and Citation Tools
The algorithm also visits children in order of distance to the query point. This means it checks the most promising quadrants first, which tends to find a good candidate early and enables aggressive pruning of the remaining quadrants. Without this ordering, the algorithm would still produce the correct result, but it would prune fewer nodes.
。业内人士推荐谷歌浏览器下载作为进阶阅读
DagsHub (What is DagsHub?)。PDF资料是该领域的重要参考
Фото: Ilya Moskovets / URA.RU / Global Look Press