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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
/*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration |
\\ / A nd | Copyright (C) 2012 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
Description
Test the construction, insertion and removal of points from the dynamic
indexed octree.
\*---------------------------------------------------------------------------*/
#include "argList.H"
#include "cpuTime.H"
#include "treeBoundBox.H"
#include "dynamicIndexedOctree.H"
#include "dynamicTreeDataPoint.H"
#include "indexedOctree.H"
#include "treeDataPoint.H"
using namespace Foam;
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
// Main program:
int main(int argc, char *argv[])
{
cpuTime timer;
treeBoundBox overallBb
(
point(0,0,0),
point(1,1,1)
);
label size = 5e6;
Info<< "Creating indexed octrees with " << size
<< " points in bounding box: " << overallBb << endl;
// Create the data
DynamicList<point> pointList(size);
pointField pointFieldList(size);
for (label pI = size - 1; pI >= 0; --pI)
{
scalar factor = pI/scalar(size);
pointList.append(0.99*point(factor, factor, factor));
pointFieldList[pI] = 0.99*point(factor, factor, factor);
}
for (label i=0; i<5; ++i)
{
pointList.append(point(0.95, 0.95,0.95));
pointFieldList.append(point(0.95, 0.95,0.95));
}
Info<< "Time to construct lists of points: "
<< timer.cpuTimeIncrement() << endl;
// Construct the trees
dynamicIndexedOctree<dynamicTreeDataPoint> tree
(
dynamicTreeDataPoint(pointList),
overallBb, // overall search domain
20, // max levels
100, // maximum ratio of cubes v.s. cells
100.0 // max. duplicity; n/a since no bounding boxes.
);
Info<< "Time to construct dynamic tree: "
<< timer.cpuTimeIncrement() << endl;
indexedOctree<treeDataPoint> tree2
(
treeDataPoint(pointFieldList),
overallBb, // overall search domain
20, // max levels
100, // maximum ratio of cubes v.s. cells
100.0 // max. duplicity; n/a since no bounding boxes.
);
Info<< "Time to construct normal tree: "
<< timer.cpuTimeIncrement() << endl;
Info<< "Statistics of the dynamic tree:" << endl;
tree.writeTreeInfo();
// Test calls to findNearest()
point p(0.94,0.94,0.94);
Info<< "Nearest point to " << p << " = "
<< tree.findNearest(p, 0.4) << endl;
for (label i = 0; i < size; ++i)
{
tree.findNearest
(
point(scalar(i)/size, scalar(i)/size, scalar(i)/size),
0.4
);
}
Info<< "Time to perform " << size
<< " findNearest() calls on the dynamic tree: "
<< timer.cpuTimeIncrement() << endl;
for (label i = 0; i < size; ++i)
{
tree2.findNearest
(
point(scalar(i)/size, scalar(i)/size, scalar(i)/size),
0.4
);
}
Info<< "Time to perform " << size
<< " findNearest() calls on the normal tree: "
<< timer.cpuTimeIncrement() << endl;
// Test point insertion
label index = pointList.size();
pointList.append(p);
Info<< nl << "Inserting point " << p << " with index " << index << endl;
// Now insert a point into the tree.
tree.insert(index, pointList.size());
Info<< "Nearest point to " << p << " = "
<< tree.findNearest(p, 0.4) << endl;
index = pointList.size();
pointList.append(p);
Info<< "Inserting same point " << p << " with index " << index << endl;
tree.insert(index, pointList.size());
Info<< "Nearest point to " << p << " = "
<< tree.findNearest(p, 0.4) << endl;
Info<< nl << "Tree after insertion:" << endl;
tree.writeTreeInfo();
// Test point removal
label nRemoved = 0;
for (label pI = size - 5; pI >= 5; pI--)
{
tree.remove(pI);
++nRemoved;
}
Info<< "Time to remove " << nRemoved << " points from the tree: "
<< timer.cpuTimeIncrement() << endl;
Info<< nl << "Tree after removal:" << endl;
tree.writeTreeInfo();
Info<< "Nearest point to " << p << " = "
<< tree.findNearest(p, 0.4) << endl;
return 0;
}
// ************************************************************************* //
|
