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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkHyperTreeGridGeometryUnlimitedEntry.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#include "vtkHyperTreeGridGeometryUnlimitedEntry.h"
#include "vtkBitArray.h"
#include "vtkHyperTree.h"
#include "vtkHyperTreeGrid.h"
#include <cassert>
#include <limits>
VTK_ABI_NAMESPACE_BEGIN
//------------------------------------------------------------------------------
vtkHyperTreeGridGeometryUnlimitedEntry::vtkHyperTreeGridGeometryUnlimitedEntry()
{
for (unsigned int d = 0; d < 3; ++d)
{
this->Origin[d] = 0.;
}
}
//------------------------------------------------------------------------------
vtkHyperTreeGridGeometryUnlimitedEntry::vtkHyperTreeGridGeometryUnlimitedEntry(
vtkIdType index, const double* origin)
{
this->Index = index;
if (index != std::numeric_limits<unsigned int>::max())
{
this->LastRealIndex = index;
}
else
{
vtkWarningWithObjectMacro(
nullptr, "Attempt to construct a geometry entry from an invalid index.");
this->LastRealIndex = vtkHyperTreeGrid::InvalidIndex;
}
for (unsigned int d = 0; d < 3; ++d)
{
this->Origin[d] = origin[d];
}
}
//------------------------------------------------------------------------------
void vtkHyperTreeGridGeometryUnlimitedEntry::PrintSelf(ostream& os, vtkIndent indent)
{
os << indent << "--vtkHyperTreeGridGeometryLevelEntry--" << endl;
os << indent << "Index:" << this->Index << endl;
os << indent << "LastRealIndex:" << this->LastRealIndex << endl;
os << indent << "Origin:" << this->Origin[0] << ", " << this->Origin[1] << ", " << this->Origin[2]
<< endl;
}
//------------------------------------------------------------------------------
void vtkHyperTreeGridGeometryUnlimitedEntry::Dump(ostream& os)
{
os << "Index:" << this->Index << endl;
os << "LastRealIndex:" << this->LastRealIndex << endl;
os << "Origin:" << this->Origin[0] << ", " << this->Origin[1] << ", " << this->Origin[2] << endl;
}
//------------------------------------------------------------------------------
vtkHyperTree* vtkHyperTreeGridGeometryUnlimitedEntry::Initialize(
vtkHyperTreeGrid* grid, vtkIdType treeIndex, bool create)
{
this->Index = 0;
grid->GetLevelZeroOriginFromIndex(treeIndex, this->Origin);
return grid->GetTree(treeIndex, create);
}
//------------------------------------------------------------------------------
vtkIdType vtkHyperTreeGridGeometryUnlimitedEntry::GetGlobalNodeIndex(const vtkHyperTree* tree) const
{
assert("pre: not_tree" && tree);
return tree->GetGlobalIndexFromLocal(this->LastRealIndex);
}
//------------------------------------------------------------------------------
void vtkHyperTreeGridGeometryUnlimitedEntry::SetGlobalIndexStart(
vtkHyperTree* tree, vtkIdType index)
{
assert("pre: not_tree" && tree);
tree->SetGlobalIndexStart(index);
}
//------------------------------------------------------------------------------
void vtkHyperTreeGridGeometryUnlimitedEntry::SetGlobalIndexFromLocal(
vtkHyperTree* tree, vtkIdType index)
{
assert("pre: not_tree" && tree);
tree->SetGlobalIndexFromLocal(this->Index, index);
}
//------------------------------------------------------------------------------
void vtkHyperTreeGridGeometryUnlimitedEntry::SetMask(
const vtkHyperTreeGrid* grid, const vtkHyperTree* tree, bool value)
{
assert("pre: not_tree" && tree);
const_cast<vtkHyperTreeGrid*>(grid)->GetMask()->InsertTuple1(
this->GetGlobalNodeIndex(tree), value);
}
//------------------------------------------------------------------------------
bool vtkHyperTreeGridGeometryUnlimitedEntry::IsMasked(
const vtkHyperTreeGrid* grid, const vtkHyperTree* tree) const
{
assert("pre: not_tree" && tree);
if (tree && const_cast<vtkHyperTreeGrid*>(grid)->HasMask())
{
return const_cast<vtkHyperTreeGrid*>(grid)->GetMask()->GetValue(
this->GetGlobalNodeIndex(tree)) != 0;
}
return false;
}
//------------------------------------------------------------------------------
bool vtkHyperTreeGridGeometryUnlimitedEntry::IsLeaf(
const vtkHyperTreeGrid* grid, const vtkHyperTree* vtkNotUsed(tree), unsigned int level) const
{
if (level >= const_cast<vtkHyperTreeGrid*>(grid)->GetDepthLimiter())
{
return true;
}
return false;
}
//------------------------------------------------------------------------------
bool vtkHyperTreeGridGeometryUnlimitedEntry::IsRealLeaf(const vtkHyperTree* tree) const
{
assert("pre: not_tree" && tree);
assert("pre: not_virtual" && !this->IsVirtualLeaf(tree));
return tree->IsLeaf(this->Index);
}
//------------------------------------------------------------------------------
bool vtkHyperTreeGridGeometryUnlimitedEntry::IsVirtualLeaf(
const vtkHyperTree* vtkNotUsed(tree)) const
{
return this->LastRealIndex != this->Index;
}
//------------------------------------------------------------------------------
bool vtkHyperTreeGridGeometryUnlimitedEntry::IsTerminalNode(
const vtkHyperTreeGrid* grid, const vtkHyperTree* vtkNotUsed(tree), unsigned int level) const
{
if (level + 1 == const_cast<vtkHyperTreeGrid*>(grid)->GetDepthLimiter())
{
return true;
}
return false;
}
//------------------------------------------------------------------------------
void vtkHyperTreeGridGeometryUnlimitedEntry::ToChild(const vtkHyperTreeGrid* grid,
const vtkHyperTree* tree, unsigned int vtkNotUsed(level), const double* sizeChild,
unsigned char ichild)
{
assert("pre: not_tree" && tree);
assert("pre: is_masked" && !IsMasked(grid, tree));
size_t indexMax = 0;
tree->GetElderChildIndexArray(indexMax);
if (this->Index >= 0 && this->Index < static_cast<vtkIdType>(indexMax))
{
vtkIdType elder = tree->GetElderChildIndex(this->Index);
if (elder != std::numeric_limits<unsigned int>::max())
{
this->Index = elder + ichild;
this->LastRealIndex = this->Index;
}
else
{
// first virtual cell
this->Index = vtkHyperTreeGrid::InvalidIndex;
}
}
else
{
// cell is already virtual
this->Index = vtkHyperTreeGrid::InvalidIndex;
}
// Divide cell size and translate origin per template parameter
switch (tree->GetNumberOfChildren())
{
case 2: // dimension = 1, branch factor = 2
{
unsigned int axis = grid->GetOrientation();
this->Origin[axis] += (ichild & 1) * sizeChild[axis];
break;
}
case 3: // dimension = 1, branch factor = 3
{
unsigned int axis = grid->GetOrientation();
this->Origin[axis] += (ichild % 3) * sizeChild[axis];
break;
}
case 4: // dimension = 2, branch factor = 2
{
unsigned int axis1 = 0;
unsigned int axis2 = 1;
switch (grid->GetOrientation())
{
case 0:
axis1 = 1;
VTK_FALLTHROUGH;
case 1:
axis2 = 2;
}
this->Origin[axis1] += (ichild & 1) * sizeChild[axis1];
this->Origin[axis2] += ((ichild & 2) >> 1) * sizeChild[axis2];
break;
}
case 9: // dimension = 2, branch factor = 3
{
unsigned int axis1 = 0;
unsigned int axis2 = 1;
switch (grid->GetOrientation())
{
case 0:
axis1 = 1;
VTK_FALLTHROUGH;
case 1:
axis2 = 2;
}
this->Origin[axis1] += (ichild % 3) * sizeChild[axis1];
this->Origin[axis2] += ((ichild % 9) / 3) * sizeChild[axis2];
break;
}
case 8: // dimension = 3, branch factor = 2
{
this->Origin[0] += (ichild & 1) * sizeChild[0];
this->Origin[1] += ((ichild & 2) >> 1) * sizeChild[1];
this->Origin[2] += ((ichild & 4) >> 2) * sizeChild[2];
break;
}
case 27: // dimension = 3, branch factor = 3
{
this->Origin[0] += (ichild % 3) * sizeChild[0];
this->Origin[1] += ((ichild % 9) / 3) * sizeChild[1];
this->Origin[2] += (ichild / 9) * sizeChild[2];
break;
}
}
}
VTK_ABI_NAMESPACE_END
|
