数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构：线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree

从K近邻算法、距离度量谈到KD树、SIFT+BBF算法,讲解详细，非常有用-From K neighbor algorithm and distance measurement when it comes to KD tree, SIFT+ BBF algorithm, explain in detail, very useful

详细讲解BBF搜索遍历算法的原理以及与kd-tree的关联应用-In detail the BBF search times calendar calculation method and the principle of the associated application in kd- tree