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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
#include "quadtree.hpp"
Quadtree::Quadtree(){}
Quadtree::Quadtree(int pLevel,Rectangle pBounds){
level = pLevel;
bounds = pBounds;
isNull=false;
nodes = new Quadtree[4];
gfxDataRect.x = pBounds.x * 1.01;
gfxDataRect.y = pBounds.y * 1.05;
gfxDataRect.r = 255;
gfxDataRect.g = 0;
gfxDataRect.b = 255;
gfxDataRect.sides = pBounds.h;
}
void Quadtree::clear(){
objects.clear();
for (int i = 0; i < 4; i++)
if (!nodes[i].isNull) {
nodes[i].objects.clear();
nodes[i].clear();
}
delete[] nodes;
if(level == 0)
nodes = new Quadtree[4];
}
void Quadtree::split(){
float subWidth = (bounds.w / 2);
float subHeight = (bounds.h / 2);
float x = bounds.x;
float y = bounds.y;
Rectangle R0(x + subWidth/2, y + subHeight/2, subWidth, subHeight);
Rectangle R1(x - subWidth/2, y + subHeight/2, subWidth, subHeight);
Rectangle R2(x - subWidth/2, y - subHeight/2, subWidth, subHeight);
Rectangle R3(x + subWidth/2, y - subHeight/2, subWidth, subHeight);
Quadtree Q0(level+1, R0);
Quadtree Q1(level+1, R1);
Quadtree Q2(level+1, R2);
Quadtree Q3(level+1, R3);
nodes[0] = Q0;
nodes[1] = Q1;
nodes[2] = Q2;
nodes[3] = Q3;
}
int Quadtree::getIndex(GraphicsData object) {
int index = -1;
bool topQuadrant = (object.y > bounds.y);
bool bottomQuadrant = (object.y < bounds.y);
if (object.x < bounds.x) {
if (topQuadrant)
index = 1;
else if (bottomQuadrant)
index = 2;
}
else if (object.x > bounds.x) {
if (topQuadrant)
index = 0;
else if (bottomQuadrant)
index = 3;
}
return index;
}
void Quadtree::insert(Entity* iter){
if (!nodes[0].isNull) {
int index = getIndex((*iter).getGFXD());
if (index != -1) {
nodes[index].insert(iter);
return;
}
}
objects.emplace_back(iter);
if (objects.size() > MAX_OBJECTS && level < MAX_LEVELS) {
if (nodes[0].isNull)
split();
for(std::list <Entity*>::iterator it = objects.begin(); it!=objects.end();it++){
int index = getIndex((*it)->getGFXD());
if (index != -1) {
nodes[index].insert(*it);
objects.erase(it--);
}
}
}
}
std::vector<GraphicsData> Quadtree::Draw(){
std::vector<GraphicsData> retdat;
for (int i = 0; i < 4; i++) {
if (!nodes[i].isNull) {
std::vector<GraphicsData> temp = nodes[i].Draw();
retdat.insert(retdat.end(), temp.begin(), temp.end());
}
}
if (!nodes[0].isNull)
retdat.emplace_back(nodes[0].gfxDataRect);
if (!nodes[1].isNull)
retdat.emplace_back(nodes[1].gfxDataRect);
if (!nodes[2].isNull)
retdat.emplace_back(nodes[2].gfxDataRect);
if (!nodes[3].isNull)
retdat.emplace_back(nodes[3].gfxDataRect);
retdat.emplace_back(gfxDataRect);
return retdat;
}
std::list<Entity*> Quadtree::retrieve(std::list<Entity*> returnObjects, GraphicsData obj) {
int index = getIndex(obj);
if (index != -1 && !nodes[0].isNull) {
returnObjects = nodes[index].retrieve(returnObjects, obj);
}
for(std::list <Entity*>::iterator it = objects.begin(); it!=objects.end(); it++){
returnObjects.emplace_back(*it);
}
return returnObjects;
}
|
