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
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
|
/*****************************************************************************
*
* Copyright (c) 2000 - 2017, Lawrence Livermore National Security, LLC
* Produced at the Lawrence Livermore National Laboratory
* LLNL-CODE-442911
* All rights reserved.
*
* This file is part of VisIt. For details, see https://visit.llnl.gov/. The
* full copyright notice is contained in the file COPYRIGHT located at the root
* of the VisIt distribution or at http://www.llnl.gov/visit/copyright.html.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the disclaimer below.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the disclaimer (as noted below) in the
* documentation and/or other materials provided with the distribution.
* - Neither the name of the LLNS/LLNL 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 LAWRENCE LIVERMORE NATIONAL SECURITY,
* LLC, THE U.S. DEPARTMENT OF ENERGY OR CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, 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.
*
*****************************************************************************/
#ifndef INTERPOLATOR_H
#define INTERPOLATOR_H
#include <vector>
// ****************************************************************************
// Class: ConstInterp
//
// Purpose:
// Interpolators for piecewise constant interpolation.
// Rounds to nearest control point.
//
// Programmer: Jeremy Meredith
// Creation: January 17, 2003
//
// ****************************************************************************
template <class T>
struct ConstInterp
{
inline static void InterpScalar(void *, void *a1,void *a2, double);
inline static void InterpArray(void *, void *a1,void *a2, int l, double);
inline static void InterpVector(void *, void *a1,void *a2, double);
};
// ****************************************************************************
// Class: LinInterp
//
// Purpose:
// Interpolators for piecewise linear interpolation.
//
// Programmer: Jeremy Meredith
// Creation: January 17, 2003
//
// ****************************************************************************
template <class T>
struct LinInterp
{
inline static void InterpScalar(void *, void *a1,void *a2, double);
inline static void InterpArray(void *, void *a1,void *a2, int l, double);
inline static void InterpVector(void *, void *a1,void *a2, double);
};
// ----------------------------------------------------------------------------
// ----------------------------------------------------------------------------
// Inline Methods
// ----------------------------------------------------------------------------
// ----------------------------------------------------------------------------
// ****************************************************************************
// Methods: ConstInterp<T>::Interp*
//
// Purpose:
// Methods for piecewise constant interpolation.
// Rounds to nearest control point.
//
// Arguments:
// out the pointer to the output location
// a1 the pointer to the first control point value
// a2 the pointer to the second control point value
// l (where applicable) the length of the array
// f the alpha value from [0.0 , 1.0]
//
// Programmer: Jeremy Meredith
// Creation: January 17, 2003
//
// ****************************************************************************
template <class T>
void
ConstInterp<T>::InterpScalar(void *out_, void *a1_, void *a2_, double f)
{
T *out = (T*)out_;
T *a1 = (T*)a1_;
T *a2 = (T*)a2_;
if (f < .5)
*out = *a1;
else
*out = *a2;
}
template <class T>
void
ConstInterp<T>::InterpArray(void *out_, void *a1_, void *a2_, int l, double f)
{
T *out = (T*)out_;
T *a1 = (T*)a1_;
T *a2 = (T*)a2_;
for (int i=0; i<l; i++)
{
if (f < .5)
out[i] = a1[i];
else
out[i] = a2[i];
}
}
template <class T>
void
ConstInterp<T>::InterpVector(void *out_, void *a1_, void *a2_, double f)
{
std::vector<T> &out = *(std::vector<T>*)out_;
std::vector<T> &a1 = *(std::vector<T>*)a1_;
std::vector<T> &a2 = *(std::vector<T>*)a2_;
size_t l1 = a1.size();
size_t l2 = a2.size();
if (l1 > l2)
out = a1;
else
out = a2;
size_t l = (l1 < l2) ? l1 : l2;
for (size_t i=0; i<l; i++)
{
if (f < .5)
out[i] = a1[i];
else
out[i] = a2[i];
}
}
// ****************************************************************************
// Methods: ConstInterp<AttributeGroup*>::Interp*
//
// Purpose:
// Specialized methods for piecewise constant interpolation of Attribute
// Group Vectors.
//
// Arguments:
// out the pointer to the output location
// a1 the pointer to the first control point value
// a2 the pointer to the second control point value
// l (where applicable) the length of the array
// f the alpha value from [0.0 , 1.0]
//
// Note: Assumes out.size is at least as great at the max of a1 & a2's size
//
// Programmer: Jeremy Meredith
// Creation: January 23, 2003
//
// Modifications:
// Jeremy Meredith, Thu Feb 27 11:23:58 PST 2003
// Added template<> to conform to new C++ rules.
//
// ****************************************************************************
template<>
void
ConstInterp<AttributeGroup*>::InterpVector(void *out_, void *a1_, void *a2_, double f)
{
AttributeGroupVector &out= *(AttributeGroupVector*)out_;
AttributeGroupVector &a1 = *(AttributeGroupVector*)a1_;
AttributeGroupVector &a2 = *(AttributeGroupVector*)a2_;
size_t l1 = a1.size();
size_t l2 = a2.size();
if (l1 > l2)
{
for (size_t i=l2; i<l1; i++)
out[i]->CopyAttributes(a1[i]);
}
else
{
for (size_t i=l1; i<l2; i++)
out[i]->CopyAttributes(a2[i]);
}
size_t l = (l1 < l2) ? l1 : l2;
for (size_t i=0; i<l; i++)
{
if (f < .5)
out[i]->CopyAttributes(a1[i]);
else
out[i]->CopyAttributes(a2[i]);
}
}
// ****************************************************************************
// Methods: LinInterp<T>::Interp*
//
// Purpose:
// Methods for piecewise linear interpolation.
//
// Arguments:
// out the pointer to the output location
// a1 the pointer to the first control point value
// a2 the pointer to the second control point value
// l (where applicable) the length of the array
// f the alpha value from [0.0 , 1.0]
//
// Programmer: Jeremy Meredith
// Creation: January 17, 2003
//
// ****************************************************************************
template <class T>
void
LinInterp<T>::InterpScalar(void *out_, void *a1_, void *a2_, double f)
{
T *out = (T*)out_;
T *a1 = (T*)a1_;
T *a2 = (T*)a2_;
*out = T((1.0 - f) * (*a1) + f * (*a2));
}
template <class T>
void
LinInterp<T>::InterpArray(void *out_, void *a1_, void *a2_, int l, double f)
{
T *out = (T*)out_;
T *a1 = (T*)a1_;
T *a2 = (T*)a2_;
for (int i=0; i<l; i++)
{
out[i] = T((1.0 - f) * (a1[i]) + f * (a2[i]));
}
}
template <class T>
void
LinInterp<T>::InterpVector(void *out_, void *a1_, void *a2_, double f)
{
std::vector<T> &out = *(std::vector<T>*)out_;
std::vector<T> &a1 = *(std::vector<T>*)a1_;
std::vector<T> &a2 = *(std::vector<T>*)a2_;
size_t l1 = a1.size();
size_t l2 = a2.size();
if (l1 > l2)
out = a1;
else
out = a2;
size_t l = (l1 < l2) ? l1 : l2;
for (size_t i=0; i<l; i++)
out[i] = T((1.0 - f) * (a1[i]) + f * (a2[i]));
}
// ****************************************************************************
// Methods: LinInterp<int>::Interp*
//
// Purpose:
// Specialized methods for piecewise linear interpolation of integers.
// Rounds to nearest integer after floating point interpolation.
//
// Arguments:
// out the pointer to the output location
// a1 the pointer to the first control point value
// a2 the pointer to the second control point value
// l (where applicable) the length of the array
// f the alpha value from [0.0 , 1.0]
//
// Programmer: Jeremy Meredith
// Creation: January 17, 2003
//
// Modifications:
// Jeremy Meredith, Thu Feb 27 11:23:58 PST 2003
// Added template<> to conform to new C++ rules.
//
// ****************************************************************************
template<>
void
LinInterp<int>::InterpScalar(void *out_, void *a1_, void *a2_, double f)
{
int *out = (int*)out_;
int *a1 = (int*)a1_;
int *a2 = (int*)a2_;
*out = int((1.0 - f) * (*a1) + f * (*a2) + 0.5); // round ints
}
template<>
void
LinInterp<int>::InterpArray(void *out_, void *a1_, void *a2_, int l, double f)
{
int *out = (int*)out_;
int *a1 = (int*)a1_;
int *a2 = (int*)a2_;
for (int i=0; i<l; i++)
out[i] = int((1.0 - f) * (a1[i]) + f * (a2[i]) + 0.5); // round ints
}
template<>
void
LinInterp<int>::InterpVector(void *out_, void *a1_, void *a2_, double f)
{
std::vector<int> &out = *(std::vector<int>*)out_;
std::vector<int> &a1 = *(std::vector<int>*)a1_;
std::vector<int> &a2 = *(std::vector<int>*)a2_;
size_t l1 = a1.size();
size_t l2 = a2.size();
if (l1 > l2)
out = a1;
else
out = a2;
size_t l = (l1 < l2) ? l1 : l2;
for (size_t i=0; i<l; i++)
out[i] = int((1.0 - f) * (a1[i]) + f * (a2[i]));
}
// ****************************************************************************
// Methods: LinInterp<AttributeGroup*>::Interp*
//
// Purpose:
// Specialized methods for piecewise linear interpolation of Attribute
// Group Vectors.
//
// Arguments:
// out the pointer to the output location
// a1 the pointer to the first control point value
// a2 the pointer to the second control point value
// l (where applicable) the length of the array
// f the alpha value from [0.0 , 1.0]
//
// Note: Assumes out.size is at least as great at the max of a1 & a2's size
//
// Programmer: Jeremy Meredith
// Creation: January 23, 2003
//
// Modifications:
// Jeremy Meredith, Thu Feb 27 11:23:58 PST 2003
// Added template<> to conform to new C++ rules.
//
// ****************************************************************************
template<>
void
LinInterp<AttributeGroup*>::InterpVector(void *out_, void *a1_, void *a2_, double f)
{
AttributeGroupVector &out= *(AttributeGroupVector*)out_;
AttributeGroupVector &a1 = *(AttributeGroupVector*)a1_;
AttributeGroupVector &a2 = *(AttributeGroupVector*)a2_;
size_t l1 = a1.size();
size_t l2 = a2.size();
if (l1 > l2)
{
for (size_t i=l2; i<l1; i++)
out[i]->CopyAttributes(a1[i]);
}
else
{
for (size_t i=l1; i<l2; i++)
out[i]->CopyAttributes(a2[i]);
}
size_t l = (l1 < l2) ? l1 : l2;
for (size_t i=0; i<l; i++)
{
out[i]->InterpolateLinear(a1[i],a2[i],f);
}
}
#endif
|
