-
Notifications
You must be signed in to change notification settings - Fork 0
/
node.cpp
136 lines (113 loc) · 2.94 KB
/
node.cpp
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
#include "kdt.h"
namespace Kdt
{
int find_median(int axis, Input& objects)
{
std::sort(objects.begin(), objects.end(), [&](Object& a, Object& b){return a.dim.min[axis] < b.dim.min[axis];});
int size = objects.size();
if (size % 2 != 0)
{
return (size + 1) / 2 - 1;
}
return size / 2;
}
Node::Node(int level, Object obj, Dimension dim, bool median):
left(nullptr),
right(nullptr),
level(level),
obj(obj),
dim(dim)
{
axis = level % n_cutting_dim;
set_key(median);
}
Node::Node(int level, Dimension dim):
left(nullptr),
right(nullptr),
level(level),
dim(dim)
{
axis = level % n_cutting_dim;
}
void Node::search(const Dimension& target, std::vector<int>& id)
{
if (!overlap(dim, target)) return;
if (overlap(obj.dim, target))
{
id.push_back(obj.id);
}
if (left != nullptr) left->search(target, id);
if (right != nullptr) right->search(target, id);
}
Dimension Node::half_dim_left(bool median)
{
Dimension half_dim = dim;
if (median)
{
half_dim.max[axis] = this->obj.dim.min[axis];
}
else
{
half_dim.max[axis] = key;
}
return half_dim;
}
Dimension Node::half_dim_right(bool median)
{
Dimension half_dim = dim;
if (median)
{
half_dim.min[axis] = this->obj.dim.min[axis];
}
else
{
half_dim.min[axis] = key;
}
return half_dim;
}
void Node::set_key(bool median)
{
if (median)
{
key = obj.dim.min[axis];
}
else
{
key = 0.5 * (dim.min[axis] + dim.max[axis]);
}
}
void Node::insert(Input objects, std::map<int, Node*>& id_address, bool median)
{
if (objects.empty())
{
return;
}
int index;
if (median)
{
index = find_median(axis, objects);
}
else
{
index = 0;
}
const Object& obj = objects[index];
this->obj = obj;
set_key(median);
id_address.insert(std::make_pair(obj.id, this));
auto slice_left = std::vector<Object>(objects.begin(), objects.begin() + index);
auto slice_right = std::vector<Object>(objects.begin() + index + 1, objects.end());
if (!slice_left.empty())
{
assert(left == nullptr);
left = new Node(level + 1, half_dim_left(median));
left->insert(slice_left, id_address, median);
}
if (!slice_right.empty())
{
assert(right == nullptr);
right = new Node(level + 1, half_dim_right(median));
right->insert(slice_right, id_address, median);
}
}
}