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
|
//------------------------------------------------------------------------------
//
// Project: AMR Visualization
// Module: $RCSfile$
// Language: C++
// Date: $Date$
// Author: $Author$
// Version: $Revision$
//
//------------------------------------------------------------------------------
/* WARNING: This software is EXPERIMENTAL. The authors give no guaranty
* about stability or correctness of the provided source!
*
* Copyright (C) 2001, The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Visualization
* Group at Lawrence Berkeley National Laboratory.
* 4. Neither the name of the University of California, Berkeley nor of the
* Lawrence Berkeley National Laboratory may be used to endorse or
* promote products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE 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 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.
*
*
* This work is supported by the U. S. Department of Energy under contract
* number DE-AC03-76SF00098 between the U. S. Department of Energy and the
* University of California.
*
* Author: Gunther H Weber
* Lawrence Berkeley National Laboratory
* Berkeley, California
*
* "this software is 100% hand-crafted by a human being in the USA [and Germany :-)]"
*
*/
inline float AMRGrid::getValue(int i) const
{
// <NOTE> Maybe it is possible to integrate some type of conversion here, if the
// grid is not Float32.</NOTE>
// <NOTE> Maybe it is possible to switch here between logaritmic and normal grid rep.
// </NOTE>
#ifdef LOG_GETVALUE
return logf(static_cast<float*>(data)[i]);
#else
return static_cast<float*>(data)[i];
#endif
}
inline float AMRGrid::getValue(int i, int j, int k) const
{
//if (0<=i && i<dims[0] && 0 <=j && j<dims[1] && 0<=k && k<dims[2])
return getValue(i+dims[0]*(j+k*dims[1]));
//else
// return 0.0;
}
inline float AMRGrid::getInterpolatedValue(double x, double y, double z) const
{
// Compute (i, j, k) = index of cell containing position to interpolate value for
x -= origin[0];
y -= origin[1];
z -= origin[2];
int i = int(x/delta[0]+0.5)-1;
int j = int(y/delta[1]+0.5)-1;
int k = int(z/delta[2]+0.5)-1;
float deltaX = (getValue(i+1, j, k) - getValue(i-1, j, k)) / delta[0];
float deltaY = (getValue(i, j+1, k) - getValue(i, j-1, k)) / delta[1];
float deltaZ = (getValue(i, j, k+1) - getValue(i, j, k-1)) / delta[2];
float xi = (float(i)+0.5)*delta[0];
float yi = (float(j)+0.5)*delta[1];
float zi = (float(k)+0.5)*delta[2];
float res = getValue(i, j, k) + deltaX*(x-xi) + deltaY*(y-yi) + deltaZ*(z-zi);
return res;
#if 0
double tx = (x-xi)/delta[0];
double ty = (y-yi)/delta[1];
double tz = (z-zi)/delta[2];
return tz*(ty *(tx*getValue(i+1,j+1,k+1)*(1-tx)*getValue(i,j+1,k+1))+
(1-ty)*(tx*getValue(i+1,j ,k+1)*(1-tx)*getValue(i,j, k+1)))
+(1-tz)*(ty *(tx*getValue(i+1,j+1,k )*(1-tx)*getValue(i,j+1,k ))+
(1-ty)*(tx*getValue(i+1,j, k )*(1-tx)*getValue(i,j,k)));
#endif
}
inline void AMRGrid::unloadCells()
{
if (data) free(data);
data = NULL;
}
inline AMRGrid* AMRGrid::getNextGridInLevel() const
{
return mNextGridInLevel;
}
inline AMRGrid::AMRRefiningGridIterator AMRGrid::refiningGridsBegin()
{
return mRefiningGrids.begin();
}
inline AMRGrid::AMRRefiningGridIterator AMRGrid::refiningGridsEnd()
{
return mRefiningGrids.end();
}
inline AMRGrid::AMRRefinedGridIterator AMRGrid::refinedGridsBegin()
{
return mRefinedGrids.begin();
}
inline AMRGrid::AMRRefinedGridIterator AMRGrid::refinedGridsEnd()
{
return mRefinedGrids.end();
}
inline AMRGrid::AMRRefiningGridConstIterator AMRGrid::refiningGridsBegin() const
{
return mRefiningGrids.begin();
}
inline AMRGrid::AMRRefiningGridConstIterator AMRGrid::refiningGridsEnd() const
{
return mRefiningGrids.end();
}
inline AMRGrid::AMRRefinedGridConstIterator AMRGrid::refinedGridsBegin() const
{
return mRefinedGrids.begin();
}
inline AMRGrid::AMRRefinedGridConstIterator AMRGrid::refinedGridsEnd() const
{
return mRefinedGrids.end();
}
inline AMRHierarchy::GridId AMRGrid::index() const
{
return mGridIndex;
}
inline const Range<float>& AMRGrid::getValueRange() const
{
return mValueRange;
}
inline AMRGrid::IntersectionMap* AMRGrid::computeIntersectionMap(IntersectionMap::MapType mapType) const
{
return computeIntersectionMap(mapType, PrimitiveBitSet(1), true);
}
inline bool AMRGrid::refinementAvailable() const
{
return !mRefiningGrids.empty();
}
inline bool AMRGrid::isRefinement() const
{
return !mRefinedGrids.empty();
}
inline AMRHierarchy::GridId AMRGrid::getCellRefiningGridId(const int idx[3]) const
{
return getCellRefiningGridId(idx[0], idx[1], idx[2]);
}
|
