k-d树搜索最近点,在opencv中使用FLANN算法,其包含:
1:建树 2.查询
程序见下:
#include "kdtree.h"
#include <iostream>
#include <iomanip>
#include "cv.h"
#include "highgui.h"
#include <fstream>
#include "cv.h"
#include "highgui.h"
#include <vector> // <vector > STL头文件
#include <stdio.h>
#include "opencv2/objdetect/objdetect.hpp"
#include "opencv2/features2d/features2d.hpp"
#include "opencv2/highgui/highgui.hpp"
#include "opencv2/calib3d/calib3d.hpp"
#include "opencv2/imgproc/imgproc_c.h"
#include <iostream>
#define EXAMPLAR_NUM 700
#define EXAMPLAR_DIM 3
/****系统可以搜索660个3维点云中的最近点****/
/************保存CvMat型矩阵****************************
输入参数:&VecString:n个点云容器
输出参数