搜索资源列表
kd树简介
- 介绍了kd树的构造和检索算法
kd-trees
- 数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构：线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree
AnIntroductoryTutorialonKD-tree
- 这是一篇关于KD树数据结构的基础而详细介绍。介绍由浅入深，能帮助学生了解掌握这种基本但重要数据结构-This paper is an introduction to an imortant data structure, that is, KD tree structure.From this paper, we can have a basic idea on KD tree structure.
K-nearest-neighbor-algorithm
- 从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
邻域计算
- kd树数据存储结构，进行klinyu搜索，GUI界面，具有保存搜索的k邻域数据(Kd tree data storage structure, k linyu search, GUI interface, with k neighborhood data to save the search)