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
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
|
///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2012-2018 DreamWorks Animation LLC
//
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
//
// Redistributions of source code must retain the above copyright
// and license notice and the following restrictions and disclaimer.
//
// * Neither the name of DreamWorks Animation nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// IN NO EVENT SHALL THE COPYRIGHT HOLDERS' AND CONTRIBUTORS' AGGREGATE
// LIABILITY FOR ALL CLAIMS REGARDLESS OF THEIR BASIS EXCEED US$250.00.
//
///////////////////////////////////////////////////////////////////////////
//
/// @file TestQuadraticInterp.cc
#include <sstream>
#include <cppunit/extensions/HelperMacros.h>
#include <openvdb/openvdb.h>
#include <openvdb/tools/Interpolation.h>
// CPPUNIT_TEST_SUITE() invokes CPPUNIT_TESTNAMER_DECL() to generate a suite name
// from the FixtureType. But if FixtureType is a templated type, the generated name
// can become long and messy. This macro overrides the normal naming logic,
// instead invoking FixtureType::testSuiteName(), which should be a static member
// function that returns a std::string containing the suite name for the specific
// template instantiation.
#undef CPPUNIT_TESTNAMER_DECL
#define CPPUNIT_TESTNAMER_DECL( variableName, FixtureType ) \
CPPUNIT_NS::TestNamer variableName( FixtureType::testSuiteName() )
namespace {
// Absolute tolerance for floating-point equality comparisons
const double TOLERANCE = 1.0e-5;
}
////////////////////////////////////////
template<typename GridType>
class TestQuadraticInterp: public CppUnit::TestCase
{
public:
typedef typename GridType::ValueType ValueT;
typedef typename GridType::Ptr GridPtr;
struct TestVal { float x, y, z; ValueT expected; };
static std::string testSuiteName()
{
std::string name = openvdb::typeNameAsString<ValueT>();
if (!name.empty()) name[0] = static_cast<char>(::toupper(name[0]));
return "TestQuadraticInterp" + name;
}
CPPUNIT_TEST_SUITE(TestQuadraticInterp);
CPPUNIT_TEST(test);
CPPUNIT_TEST(testConstantValues);
CPPUNIT_TEST(testFillValues);
CPPUNIT_TEST(testNegativeIndices);
CPPUNIT_TEST_SUITE_END();
void test();
void testConstantValues();
void testFillValues();
void testNegativeIndices();
private:
void executeTest(const GridPtr&, const TestVal*, size_t numVals) const;
/// Initialize an arbitrary ValueType from a scalar.
static inline ValueT constValue(double d) { return ValueT(d); }
/// Compare two numeric values for equality within an absolute tolerance.
static inline bool relEq(const ValueT& v1, const ValueT& v2)
{ return fabs(v1 - v2) <= TOLERANCE; }
};
CPPUNIT_TEST_SUITE_REGISTRATION(TestQuadraticInterp<openvdb::FloatGrid>);
CPPUNIT_TEST_SUITE_REGISTRATION(TestQuadraticInterp<openvdb::DoubleGrid>);
CPPUNIT_TEST_SUITE_REGISTRATION(TestQuadraticInterp<openvdb::Vec3SGrid>);
////////////////////////////////////////
/// Specialization for Vec3s grids
template<>
inline openvdb::Vec3s
TestQuadraticInterp<openvdb::Vec3SGrid>::constValue(double d)
{
return openvdb::Vec3s(float(d), float(d), float(d));
}
/// Specialization for Vec3s grids
template<>
inline bool
TestQuadraticInterp<openvdb::Vec3SGrid>::relEq(
const openvdb::Vec3s& v1, const openvdb::Vec3s& v2)
{
return v1.eq(v2, float(TOLERANCE));
}
/// Sample the given tree at various locations and assert if
/// any of the sampled values don't match the expected values.
template<typename GridType>
void
TestQuadraticInterp<GridType>::executeTest(const GridPtr& grid,
const TestVal* testVals, size_t numVals) const
{
openvdb::tools::GridSampler<GridType, openvdb::tools::QuadraticSampler> interpolator(*grid);
//openvdb::tools::QuadraticInterp<GridType> interpolator(*tree);
for (size_t i = 0; i < numVals; ++i) {
const TestVal& val = testVals[i];
const ValueT actual = interpolator.sampleVoxel(val.x, val.y, val.z);
if (!relEq(val.expected, actual)) {
std::ostringstream ostr;
ostr << std::setprecision(10)
<< "sampleVoxel(" << val.x << ", " << val.y << ", " << val.z
<< "): expected " << val.expected << ", got " << actual;
CPPUNIT_FAIL(ostr.str());
}
}
}
template<typename GridType>
void
TestQuadraticInterp<GridType>::test()
{
const ValueT
one = constValue(1),
two = constValue(2),
three = constValue(3),
four = constValue(4),
fillValue = constValue(256);
GridPtr grid(new GridType(fillValue));
typename GridType::TreeType& tree = grid->tree();
tree.setValue(openvdb::Coord(10, 10, 10), one);
tree.setValue(openvdb::Coord(11, 10, 10), two);
tree.setValue(openvdb::Coord(11, 11, 10), two);
tree.setValue(openvdb::Coord(10, 11, 10), two);
tree.setValue(openvdb::Coord( 9, 11, 10), two);
tree.setValue(openvdb::Coord( 9, 10, 10), two);
tree.setValue(openvdb::Coord( 9, 9, 10), two);
tree.setValue(openvdb::Coord(10, 9, 10), two);
tree.setValue(openvdb::Coord(11, 9, 10), two);
tree.setValue(openvdb::Coord(10, 10, 11), three);
tree.setValue(openvdb::Coord(11, 10, 11), three);
tree.setValue(openvdb::Coord(11, 11, 11), three);
tree.setValue(openvdb::Coord(10, 11, 11), three);
tree.setValue(openvdb::Coord( 9, 11, 11), three);
tree.setValue(openvdb::Coord( 9, 10, 11), three);
tree.setValue(openvdb::Coord( 9, 9, 11), three);
tree.setValue(openvdb::Coord(10, 9, 11), three);
tree.setValue(openvdb::Coord(11, 9, 11), three);
tree.setValue(openvdb::Coord(10, 10, 9), four);
tree.setValue(openvdb::Coord(11, 10, 9), four);
tree.setValue(openvdb::Coord(11, 11, 9), four);
tree.setValue(openvdb::Coord(10, 11, 9), four);
tree.setValue(openvdb::Coord( 9, 11, 9), four);
tree.setValue(openvdb::Coord( 9, 10, 9), four);
tree.setValue(openvdb::Coord( 9, 9, 9), four);
tree.setValue(openvdb::Coord(10, 9, 9), four);
tree.setValue(openvdb::Coord(11, 9, 9), four);
const TestVal testVals[] = {
{ 10.5f, 10.5f, 10.5f, constValue(1.703125) },
{ 10.0f, 10.0f, 10.0f, one },
{ 11.0f, 10.0f, 10.0f, two },
{ 11.0f, 11.0f, 10.0f, two },
{ 11.0f, 11.0f, 11.0f, three },
{ 9.0f, 11.0f, 9.0f, four },
{ 9.0f, 10.0f, 9.0f, four },
{ 10.1f, 10.0f, 10.0f, constValue(1.01) },
{ 10.8f, 10.8f, 10.8f, constValue(2.513344) },
{ 10.1f, 10.8f, 10.5f, constValue(1.8577) },
{ 10.8f, 10.1f, 10.5f, constValue(1.8577) },
{ 10.5f, 10.1f, 10.8f, constValue(2.2927) },
{ 10.5f, 10.8f, 10.1f, constValue(1.6977) },
};
const size_t numVals = sizeof(testVals) / sizeof(TestVal);
executeTest(grid, testVals, numVals);
}
template<typename GridType>
void
TestQuadraticInterp<GridType>::testConstantValues()
{
const ValueT
two = constValue(2),
fillValue = constValue(256);
GridPtr grid(new GridType(fillValue));
typename GridType::TreeType& tree = grid->tree();
tree.setValue(openvdb::Coord(10, 10, 10), two);
tree.setValue(openvdb::Coord(11, 10, 10), two);
tree.setValue(openvdb::Coord(11, 11, 10), two);
tree.setValue(openvdb::Coord(10, 11, 10), two);
tree.setValue(openvdb::Coord( 9, 11, 10), two);
tree.setValue(openvdb::Coord( 9, 10, 10), two);
tree.setValue(openvdb::Coord( 9, 9, 10), two);
tree.setValue(openvdb::Coord(10, 9, 10), two);
tree.setValue(openvdb::Coord(11, 9, 10), two);
tree.setValue(openvdb::Coord(10, 10, 11), two);
tree.setValue(openvdb::Coord(11, 10, 11), two);
tree.setValue(openvdb::Coord(11, 11, 11), two);
tree.setValue(openvdb::Coord(10, 11, 11), two);
tree.setValue(openvdb::Coord( 9, 11, 11), two);
tree.setValue(openvdb::Coord( 9, 10, 11), two);
tree.setValue(openvdb::Coord( 9, 9, 11), two);
tree.setValue(openvdb::Coord(10, 9, 11), two);
tree.setValue(openvdb::Coord(11, 9, 11), two);
tree.setValue(openvdb::Coord(10, 10, 9), two);
tree.setValue(openvdb::Coord(11, 10, 9), two);
tree.setValue(openvdb::Coord(11, 11, 9), two);
tree.setValue(openvdb::Coord(10, 11, 9), two);
tree.setValue(openvdb::Coord( 9, 11, 9), two);
tree.setValue(openvdb::Coord( 9, 10, 9), two);
tree.setValue(openvdb::Coord( 9, 9, 9), two);
tree.setValue(openvdb::Coord(10, 9, 9), two);
tree.setValue(openvdb::Coord(11, 9, 9), two);
const TestVal testVals[] = {
{ 10.5f, 10.5f, 10.5f, two },
{ 10.0f, 10.0f, 10.0f, two },
{ 10.1f, 10.0f, 10.0f, two },
{ 10.8f, 10.8f, 10.8f, two },
{ 10.1f, 10.8f, 10.5f, two },
{ 10.8f, 10.1f, 10.5f, two },
{ 10.5f, 10.1f, 10.8f, two },
{ 10.5f, 10.8f, 10.1f, two }
};
const size_t numVals = sizeof(testVals) / sizeof(TestVal);
executeTest(grid, testVals, numVals);
}
template<typename GridType>
void
TestQuadraticInterp<GridType>::testFillValues()
{
const ValueT fillValue = constValue(256);
GridPtr grid(new GridType(fillValue));
const TestVal testVals[] = {
{ 10.5f, 10.5f, 10.5f, fillValue },
{ 10.0f, 10.0f, 10.0f, fillValue },
{ 10.1f, 10.0f, 10.0f, fillValue },
{ 10.8f, 10.8f, 10.8f, fillValue },
{ 10.1f, 10.8f, 10.5f, fillValue },
{ 10.8f, 10.1f, 10.5f, fillValue },
{ 10.5f, 10.1f, 10.8f, fillValue },
{ 10.5f, 10.8f, 10.1f, fillValue }
};
const size_t numVals = sizeof(testVals) / sizeof(TestVal);
executeTest(grid, testVals, numVals);
}
template<typename GridType>
void
TestQuadraticInterp<GridType>::testNegativeIndices()
{
const ValueT
one = constValue(1),
two = constValue(2),
three = constValue(3),
four = constValue(4),
fillValue = constValue(256);
GridPtr grid(new GridType(fillValue));
typename GridType::TreeType& tree = grid->tree();
tree.setValue(openvdb::Coord(-10, -10, -10), one);
tree.setValue(openvdb::Coord(-11, -10, -10), two);
tree.setValue(openvdb::Coord(-11, -11, -10), two);
tree.setValue(openvdb::Coord(-10, -11, -10), two);
tree.setValue(openvdb::Coord( -9, -11, -10), two);
tree.setValue(openvdb::Coord( -9, -10, -10), two);
tree.setValue(openvdb::Coord( -9, -9, -10), two);
tree.setValue(openvdb::Coord(-10, -9, -10), two);
tree.setValue(openvdb::Coord(-11, -9, -10), two);
tree.setValue(openvdb::Coord(-10, -10, -11), three);
tree.setValue(openvdb::Coord(-11, -10, -11), three);
tree.setValue(openvdb::Coord(-11, -11, -11), three);
tree.setValue(openvdb::Coord(-10, -11, -11), three);
tree.setValue(openvdb::Coord( -9, -11, -11), three);
tree.setValue(openvdb::Coord( -9, -10, -11), three);
tree.setValue(openvdb::Coord( -9, -9, -11), three);
tree.setValue(openvdb::Coord(-10, -9, -11), three);
tree.setValue(openvdb::Coord(-11, -9, -11), three);
tree.setValue(openvdb::Coord(-10, -10, -9), four);
tree.setValue(openvdb::Coord(-11, -10, -9), four);
tree.setValue(openvdb::Coord(-11, -11, -9), four);
tree.setValue(openvdb::Coord(-10, -11, -9), four);
tree.setValue(openvdb::Coord( -9, -11, -9), four);
tree.setValue(openvdb::Coord( -9, -10, -9), four);
tree.setValue(openvdb::Coord( -9, -9, -9), four);
tree.setValue(openvdb::Coord(-10, -9, -9), four);
tree.setValue(openvdb::Coord(-11, -9, -9), four);
const TestVal testVals[] = {
{ -10.5f, -10.5f, -10.5f, constValue(-104.75586) },
{ -10.0f, -10.0f, -10.0f, one },
{ -11.0f, -10.0f, -10.0f, two },
{ -11.0f, -11.0f, -10.0f, two },
{ -11.0f, -11.0f, -11.0f, three },
{ -9.0f, -11.0f, -9.0f, four },
{ -9.0f, -10.0f, -9.0f, four },
{ -10.1f, -10.0f, -10.0f, constValue(-10.28504) },
{ -10.8f, -10.8f, -10.8f, constValue(-62.84878) },
{ -10.1f, -10.8f, -10.5f, constValue(-65.68951) },
{ -10.8f, -10.1f, -10.5f, constValue(-65.68951) },
{ -10.5f, -10.1f, -10.8f, constValue(-65.40736) },
{ -10.5f, -10.8f, -10.1f, constValue(-66.30510) },
};
const size_t numVals = sizeof(testVals) / sizeof(TestVal);
executeTest(grid, testVals, numVals);
}
// Copyright (c) 2012-2018 DreamWorks Animation LLC
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
|
