├── Main.cpp
├── QuadTree.cpp
├── QuadTree.h
└── README.md


/Main.cpp:
--------------------------------------------------------------------------------
 1 | #include <iostream>
 2 | #include "stdlib.h"
 3 | #include "QuadTree.h"
 4 | #include <time.h>
 5 | #include <fstream>
 6 | using namespace std;
 7 | int main()
 8 | {
 9 | 	ofstream myfile;
10 | 	myfile.open("F:\\QuadTree.txt", ios::out);
11 | 	if(!myfile)
12 | 	{ 
13 | 		std::cout<<"create file failed!";
14 | 		system("pause"); 
15 | 		exit(1);
16 | 	}
17 | 	
18 | 	QuadTree *p_tree = new QuadTree(TREE_DEPTH, MAX_OBJECT);
19 | 	p_tree->InitQuadTreeNode(QuadTree::Rect(LB_X, LB_Y, RT_X, RT_Y));
20 | 	srand((unsigned)time(NULL));
21 | 	for (int i = 0; i < RAND_NUM; ++i)
22 | 	{
23 | 		QuadTree::PosInfo pos;
24 | 		pos.latitude = rand() % (RT_X - LB_X) + LB_X + 1;
25 | 		pos.longitude = rand() % (RT_Y - LB_Y) + LB_Y + 1;
26 | 		p_tree->Insert(pos, p_tree->GetTreeRoot());
27 | 	}
28 | 	p_tree->PrintAllQuadTreeLeafNode(p_tree->GetTreeRoot());
29 | 
30 | 	int pos_x, pos_y;
31 | 	cout<<"input a pos to search near point:"<<endl;
32 | 	cin>>pos_x>>pos_y;
33 | 	QuadTree::PosInfo pos_source(pos_x, pos_y);
34 | 	std::vector<QuadTree::PosInfo> pos_list;
35 | 
36 | 	clock_t start_time = clock();
37 | 	myfile<<endl<<"start time: "<<(double)start_time<<std::endl<<std::endl;
38 | 	p_tree->Search(SEARCH_NUM, pos_source, pos_list, p_tree->GetTreeRoot());
39 | 	myfile<<"pos_list:"<<std::endl;
40 | 	for (std::vector<QuadTree::PosInfo>::iterator it = pos_list.begin(); it != pos_list.end(); ++it)
41 | 	{
42 | 		myfile<<"["<<(*it).latitude<<", "<<(*it).longitude<<"]"<<std::endl;
43 | 	}
44 | 	clock_t end_time = clock();
45 | 	myfile<<std::endl<<"end time: "<<(double)end_time<<std::endl;
46 | 	myfile<<"duration:"<<(double)(end_time - start_time) / CLOCKS_PER_SEC<<std::endl;
47 | 	
48 | 	//delete p_tree;
49 | 	myfile.close();
50 | 	system("Pause");
51 | 	return 0;
52 | }


--------------------------------------------------------------------------------
/QuadTree.cpp:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/yao2yao/QuadTree/fefa4f3490a2bf983253708625ed9823073022aa/QuadTree.cpp


--------------------------------------------------------------------------------
/QuadTree.h:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/yao2yao/QuadTree/fefa4f3490a2bf983253708625ed9823073022aa/QuadTree.h


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | 一个简单的四叉树(c++)
 2 | 
 3 | 1.分割矩形用的均分法，取x，y坐标的一半划分。
 4 | 
 5 | 2.位置信息存储在树的叶子节点，非叶子节点没有位置信息。
 6 | 
 7 | 3.从根节点遍历到目标节点所在节点，遍历该节点所有的位置信息点。
 8 | 假如数量不够，则向上到父节点，搜寻兄弟节点，直到获得足够数量的位置信息点。
 9 | 
10 | 优化：
11 | 
12 | 拆分函数优化，取节点内位置信息的平均值作为拆分点，使得四叉树尽可能平衡
13 | 
14 | 


--------------------------------------------------------------------------------