summaryrefslogtreecommitdiff
path: root/quadtree.h
blob: b927dee791bc86ed44434857b3cef565127dfdbc (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#ifndef QUADTREE_H
#define QUADTREE_H

#include "vector.h"

#include <boost/thread.hpp>

class Quadtree {
	public:

		struct UpdateThread {
			Quadtree *tree;
			float *buffer;
			UpdateThread(Quadtree *t, float *b);
			void operator()();
		};

		struct QuadNode {
			Quadtree *tree;
			QuadNode *parent;
			QuadNode *children[4];
			int elems;
			float x, y, width, height;
			int level;
			float *vertex_array;

			QuadNode(Quadtree *tree, QuadNode *parent, float x, float y, float width, float height, int level, bool leaf);
			virtual ~QuadNode();

			float distance(float px, float pz);
			void fill();
			void fix_cracks();
			void subdivide(bool leaf = true);
			void merge();
			void draw();
			void draw_grid();
			float get_height(float px, float py);
			Vector3 get_normal(int index);
		};

		float *heights;
		float *thread_buffer;
		size_t buf_size;
		bool thread_done, thread_running;
		boost::mutex vbo_lock;
		boost::mutex node_lock;
		int width, height, levels;
		float init_time;
		QuadNode *root;
		unsigned int temp_vbo;
		unsigned int vbo_object;
		unsigned int nodes;
		unsigned int vertices;
		Quadtree(int width, int height, float *heightmap, int levels);
		virtual ~Quadtree();

		void update(float x, float z);
		void fix_cracks();
		void create_nodes(int levels);
		unsigned int count_nodes();
		void make_vbo();
		void update_vbo();
		QuadNode *find(float x, float y, int level = -1);
		QuadNode *get_left(QuadNode *node);
		QuadNode *get_right(QuadNode *node);
		QuadNode *get_up(QuadNode *node);
		QuadNode *get_down(QuadNode *node);
};

#endif