【C++实现四叉树（附完整源码）题】

最新推荐文章于 2024-04-30 10:34:59 发布

lst0426

最新推荐文章于 2024-04-30 10:34:59 发布

阅读量370

点赞数

分类专栏： c++源码文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/vv1025/article/details/131688949

版权

本文详细介绍了如何使用C++编程语言实现四叉树，并提供了完整的源代码示例，适合想要深入理解四叉树及其C++实现的开发者阅读。

摘要由CSDN通过智能技术生成

C++实现四叉树（附完整源码）

C++实现四叉树

#ifndef __QuardTree__
#define __QuardTree__


#include <vector>
#include <iostream>
using namespace std;

template<typename T>
struct Point{
   
	T x;
	T y;
	Point(){
   }
	Point(T _x, T _y) :x(_x), y(_y){
   }
};

template<typename T>
struct Node{
   
	Node* R[4];
	Point<T> pt;
	Node* parent;
};

template<typename ElemType>
class QuardTree
{
   
public:
	QuardTree();
	~QuardTree();
	void Insert(const Point<ElemType>& pos);
	void BalanceInsert(const Point<ElemType>& pos );
	int nodeCount();
	int TPLS();
	int Height();
	void RegionResearch(ElemType left, ElemType right, ElemType botom, ElemType top, int& visitednum,int& foundnum);
	void clear();
private:
	Node<ElemType>* root;
	int Compare(const Node<ElemType>* node, const Point<ElemType>& pos);
	bool In_Region(Point<ElemType> t, ElemType left, ElemType right, ElemType botom, ElemType top);
	bool Rectangle_Overlapse_Region(ElemType L, ElemType R, ElemType B, ElemType T, ElemType left, ElemType right, ElemType botom, ElemType top);
	void RegionResearch(Node<ElemType>* t, ElemType left, ElemType right, ElemType botom, ElemType top, int& visitednum, int& foundnum);
	int Depth(Node<ElemType>* &);
	int nodeCount(const Node<ElemType>*);
	void clear(Node < ElemType>*& p);
	void Insert(Node<ElemType>*& , const Point<ElemType>& pos);//递归插入节点
};


template<typename T>
QuardTree<T>::QuardTree()
{
   
	root = NULL;
}

template<typename T>
QuardTree<T>::~QuardTree()
{
   
	clear(root);
}

template<typename T>
int QuardTree<T>::TPLS()
{
   
	return Depth(root);
}

template<typename T>
int QuardTree<T>::Compare(const Node<T>* node, const Point<T>& pos)
{
   
	if (pos.x == node->pt.x && pos.y == node->pt.y) return 0;
	if (pos.x >= node->pt.x && pos.y>node->pt.y)  return 1;
	if (pos.x&