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
|
#ifndef QUADTREE_H
#define QUADTREE_H
#include "vector.h"
class Quadtree {
public:
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 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;
int width, height, levels;
float init_time;
QuadNode *root;
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 create_nodes(int levels);
unsigned int count_nodes();
void make_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
|