1
///////////////////////////////////////////////////////////////////////////////////
2
/// OpenGL Mathematics (glm.g-truc.net)
4
/// Copyright (c) 2005 - 2012 G-Truc Creation (www.g-truc.net)
5
/// Permission is hereby granted, free of charge, to any person obtaining a copy
6
/// of this software and associated documentation files (the "Software"), to deal
7
/// in the Software without restriction, including without limitation the rights
8
/// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9
/// copies of the Software, and to permit persons to whom the Software is
10
/// furnished to do so, subject to the following conditions:
12
/// The above copyright notice and this permission notice shall be included in
13
/// all copies or substantial portions of the Software.
15
/// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
/// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
/// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18
/// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
/// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20
/// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
24
/// @file glm/core/func_noise.inl
25
/// @date 2008-08-01 / 2011-09-27
26
/// @author Christophe Riccio
27
///////////////////////////////////////////////////////////////////////////////////
32
GLM_FUNC_QUALIFIER T noise1(T const & x)
34
return noise1(glm::detail::tvec2<T>(x, T(0)));
38
GLM_FUNC_QUALIFIER glm::detail::tvec2<T> noise2(T const & x)
40
return glm::detail::tvec2<T>(
46
GLM_FUNC_QUALIFIER glm::detail::tvec3<T> noise3(T const & x)
48
return glm::detail::tvec3<T>(
55
GLM_FUNC_QUALIFIER glm::detail::tvec4<T> noise4(T const & x)
57
return glm::detail::tvec4<T>(
65
GLM_FUNC_QUALIFIER T noise1(glm::detail::tvec2<T> const & v)
67
detail::tvec4<T> const C = detail::tvec4<T>(
68
T( 0.211324865405187), // (3.0 - sqrt(3.0)) / 6.0
69
T( 0.366025403784439), // 0.5 * (sqrt(3.0) - 1.0)
70
T(-0.577350269189626), // -1.0 + 2.0 * C.x
71
T( 0.024390243902439)); // 1.0 / 41.0
74
detail::tvec2<T> i = floor(v + dot(v, detail::tvec2<T>(C[1])));
75
detail::tvec2<T> x0 = v - i + dot(i, detail::tvec2<T>(C[0]));
78
//i1.x = step( x0.y, x0.x ); // x0.x > x0.y ? 1.0 : 0.0
80
detail::tvec2<T> i1 = (x0.x > x0.y) ? detail::tvec2<T>(1, 0) : detail::tvec2<T>(0, 1);
81
// x0 = x0 - 0.0 + 0.0 * C.xx ;
82
// x1 = x0 - i1 + 1.0 * C.xx ;
83
// x2 = x0 - 1.0 + 2.0 * C.xx ;
84
detail::tvec4<T> x12 = detail::tvec4<T>(x0.x, x0.y, x0.x, x0.y) + detail::tvec4<T>(C.x, C.x, C.z, C.z);
85
x12 = detail::tvec4<T>(detail::tvec2<T>(x12) - i1, x12.z, x12.w);
88
i = mod(i, T(289)); // Avoid truncation effects in permutation
89
detail::tvec3<T> p = permute(
90
permute(i.y + detail::tvec3<T>(T(0), i1.y, T(1)))
91
+ i.x + detail::tvec3<T>(T(0), i1.x, T(1)));
93
detail::tvec3<T> m = max(T(0.5) - detail::tvec3<T>(
95
dot(detail::tvec2<T>(x12.x, x12.y), detail::tvec2<T>(x12.x, x12.y)),
96
dot(detail::tvec2<T>(x12.z, x12.w), detail::tvec2<T>(x12.z, x12.w))), T(0));
100
// Gradients: 41 points uniformly over a line, mapped onto a diamond.
101
// The ring size 17*17 = 289 is close to a multiple of 41 (41*7 = 287)
103
detail::tvec3<T> x = T(2) * fract(p * C.w) - T(1);
104
detail::tvec3<T> h = abs(x) - T(0.5);
105
detail::tvec3<T> ox = floor(x + T(0.5));
106
detail::tvec3<T> a0 = x - ox;
108
// Normalise gradients implicitly by scaling m
109
// Inlined for speed: m *= taylorInvSqrt( a0*a0 + h*h );
110
m *= T(1.79284291400159) - T(0.85373472095314) * (a0 * a0 + h * h);
112
// Compute final noise value at P
114
g.x = a0.x * x0.x + h.x * x0.y;
115
//g.yz = a0.yz * x12.xz + h.yz * x12.yw;
116
g.y = a0.y * x12.x + h.y * x12.y;
117
g.z = a0.z * x12.z + h.z * x12.w;
118
return T(130) * dot(m, g);
121
template <typename T>
122
GLM_FUNC_QUALIFIER T noise1(detail::tvec3<T> const & v)
124
detail::tvec2<T> const C(1.0 / 6.0, 1.0 / 3.0);
125
detail::tvec4<T> const D(0.0, 0.5, 1.0, 2.0);
128
detail::tvec3<T> i(floor(v + dot(v, detail::tvec3<T>(C.y))));
129
detail::tvec3<T> x0(v - i + dot(i, detail::tvec3<T>(C.x)));
132
detail::tvec3<T> g(step(detail::tvec3<T>(x0.y, x0.z, x0.x), x0));
133
detail::tvec3<T> l(T(1) - g);
134
detail::tvec3<T> i1(min(g, detail::tvec3<T>(l.z, l.x, l.y)));
135
detail::tvec3<T> i2(max(g, detail::tvec3<T>(l.z, l.x, l.y)));
137
// x0 = x0 - 0.0 + 0.0 * C.xxx;
138
// x1 = x0 - i1 + 1.0 * C.xxx;
139
// x2 = x0 - i2 + 2.0 * C.xxx;
140
// x3 = x0 - 1.0 + 3.0 * C.xxx;
141
detail::tvec3<T> x1(x0 - i1 + C.x);
142
detail::tvec3<T> x2(x0 - i2 + C.y); // 2.0*C.x = 1/3 = C.y
143
detail::tvec3<T> x3(x0 - D.y); // -1.0+3.0*C.x = -0.5 = -D.y
147
detail::tvec4<T> p(permute(permute(permute(
148
i.z + detail::tvec4<T>(T(0), i1.z, i2.z, T(1))) +
149
i.y + detail::tvec4<T>(T(0), i1.y, i2.y, T(1))) +
150
i.x + detail::tvec4<T>(T(0), i1.x, i2.x, T(1))));
152
// Gradients: 7x7 points over a square, mapped onto an octahedron.
153
// The ring size 17*17 = 289 is close to a multiple of 49 (49*6 = 294)
154
T n_ = T(0.142857142857); // 1.0/7.0
155
detail::tvec3<T> ns(n_ * detail::tvec3<T>(D.w, D.y, D.z) - detail::tvec3<T>(D.x, D.z, D.x));
157
detail::tvec4<T> j(p - T(49) * floor(p * ns.z * ns.z)); // mod(p,7*7)
159
detail::tvec4<T> x_(floor(j * ns.z));
160
detail::tvec4<T> y_(floor(j - T(7) * x_)); // mod(j,N)
162
detail::tvec4<T> x(x_ * ns.x + ns.y);
163
detail::tvec4<T> y(y_ * ns.x + ns.y);
164
detail::tvec4<T> h(T(1) - abs(x) - abs(y));
166
detail::tvec4<T> b0(x.x, x.y, y.x, y.y);
167
detail::tvec4<T> b1(x.z, x.w, y.z, y.w);
169
// vec4 s0 = vec4(lessThan(b0,0.0))*2.0 - 1.0;
170
// vec4 s1 = vec4(lessThan(b1,0.0))*2.0 - 1.0;
171
detail::tvec4<T> s0(floor(b0) * T(2) + T(1));
172
detail::tvec4<T> s1(floor(b1) * T(2) + T(1));
173
detail::tvec4<T> sh(-step(h, detail::tvec4<T>(0.0)));
175
detail::tvec4<T> a0 = detail::tvec4<T>(b0.x, b0.z, b0.y, b0.w) + detail::tvec4<T>(s0.x, s0.z, s0.y, s0.w) * detail::tvec4<T>(sh.x, sh.x, sh.y, sh.y);
176
detail::tvec4<T> a1 = detail::tvec4<T>(b1.x, b1.z, b1.y, b1.w) + detail::tvec4<T>(s1.x, s1.z, s1.y, s1.w) * detail::tvec4<T>(sh.z, sh.z, sh.w, sh.w);
178
detail::tvec3<T> p0(a0.x, a0.y, h.x);
179
detail::tvec3<T> p1(a0.z, a0.w, h.y);
180
detail::tvec3<T> p2(a1.x, a1.y, h.z);
181
detail::tvec3<T> p3(a1.z, a1.w, h.w);
183
// Normalise gradients
184
detail::tvec4<T> norm = taylorInvSqrt(detail::tvec4<T>(dot(p0, p0), dot(p1, p1), dot(p2, p2), dot(p3, p3)));
190
// Mix final noise value
191
detail::tvec4<T> m = max(T(0.6) - detail::tvec4<T>(dot(x0, x0), dot(x1, x1), dot(x2, x2), dot(x3, x3)), T(0));
193
return T(42) * dot(m * m, detail::tvec4<T>(dot(p0, x0), dot(p1, x1), dot(p2, x2), dot(p3, x3)));
196
template <typename T>
197
GLM_FUNC_QUALIFIER T noise1(detail::tvec4<T> const & v)
199
detail::tvec4<T> const C(
200
0.138196601125011, // (5 - sqrt(5))/20 G4
201
0.276393202250021, // 2 * G4
202
0.414589803375032, // 3 * G4
203
-0.447213595499958); // -1 + 4 * G4
205
// (sqrt(5) - 1)/4 = F4, used once below
206
T const F4 = T(0.309016994374947451);
209
detail::tvec4<T> i = floor(v + dot(v, vec4(F4)));
210
detail::tvec4<T> x0 = v - i + dot(i, vec4(C.x));
214
// Rank sorting originally contributed by Bill Licea-Kane, AMD (formerly ATI)
216
detail::tvec3<T> isX = step(detail::tvec3<T>(x0.y, x0.z, x0.w), detail::tvec3<T>(x0.x));
217
detail::tvec3<T> isYZ = step(detail::tvec3<T>(x0.z, x0.w, x0.w), detail::tvec3<T>(x0.y, x0.y, x0.z));
218
// i0.x = dot(isX, vec3(1.0));
219
//i0.x = isX.x + isX.y + isX.z;
220
//i0.yzw = T(1) - isX;
221
i0 = detail::tvec4<T>(isX.x + isX.y + isX.z, T(1) - isX);
222
// i0.y += dot(isYZ.xy, vec2(1.0));
223
i0.y += isYZ.x + isYZ.y;
224
//i0.zw += 1.0 - detail::tvec2<T>(isYZ.x, isYZ.y);
225
i0.z += T(1) - isYZ.x;
226
i0.w += T(1) - isYZ.y;
228
i0.w += T(1) - isYZ.z;
230
// i0 now contains the unique values 0,1,2,3 in each channel
231
detail::tvec4<T> i3 = clamp(i0, 0.0, 1.0);
232
detail::tvec4<T> i2 = clamp(i0 - 1.0, 0.0, 1.0);
233
detail::tvec4<T> i1 = clamp(i0 - 2.0, 0.0, 1.0);
235
// x0 = x0 - 0.0 + 0.0 * C.xxxx
236
// x1 = x0 - i1 + 0.0 * C.xxxx
237
// x2 = x0 - i2 + 0.0 * C.xxxx
238
// x3 = x0 - i3 + 0.0 * C.xxxx
239
// x4 = x0 - 1.0 + 4.0 * C.xxxx
240
detail::tvec4<T> x1 = x0 - i1 + C.x;
241
detail::tvec4<T> x2 = x0 - i2 + C.y;
242
detail::tvec4<T> x3 = x0 - i3 + C.z;
243
detail::tvec4<T> x4 = x0 + C.w;
247
T j0 = permute(permute(permute(permute(i.w) + i.z) + i.y) + i.x);
248
detail::tvec4<T> j1 = permute(permute(permute(permute(
249
i.w + detail::tvec4<T>(i1.w, i2.w, i3.w, T(1)))
250
+ i.z + detail::tvec4<T>(i1.z, i2.z, i3.z, T(1)))
251
+ i.y + detail::tvec4<T>(i1.y, i2.y, i3.y, T(1)))
252
+ i.x + detail::tvec4<T>(i1.x, i2.x, i3.x, T(1)));
254
// Gradients: 7x7x6 points over a cube, mapped onto a 4-cross polytope
255
// 7*7*6 = 294, which is close to the ring size 17*17 = 289.
256
detail::tvec4<T> ip = detail::tvec4<T>(T(1) / T(294), T(1) / T(49), T(1) / T(7), T(0));
258
detail::tvec4<T> p0 = grad4(j0, ip);
259
detail::tvec4<T> p1 = grad4(j1.x, ip);
260
detail::tvec4<T> p2 = grad4(j1.y, ip);
261
detail::tvec4<T> p3 = grad4(j1.z, ip);
262
detail::tvec4<T> p4 = grad4(j1.w, ip);
264
// Normalise gradients
265
detail::tvec4<T> norm = taylorInvSqrt(detail::tvec4<T>(dot(p0, p0), dot(p1, p1), dot(p2, p2), dot(p3, p3)));
270
p4 *= taylorInvSqrt(dot(p4, p4));
272
// Mix contributions from the five corners
273
detail::tvec3<T> m0 = max(T(0.6) - detail::tvec3<T>(dot(x0, x0), dot(x1, x1), dot(x2, x2)), T(0));
274
detail::tvec2<T> m1 = max(T(0.6) - detail::tvec2<T>(dot(x3, x3), dot(x4, x4) ), T(0));
278
(dot(m0 * m0, detail::tvec3<T>(dot(p0, x0), dot(p1, x1), dot(p2, x2))) +
279
dot(m1 * m1, detail::tvec2<T>(dot(p3, x3), dot(p4, x4))));
282
template <typename T>
283
GLM_FUNC_QUALIFIER glm::detail::tvec2<T> noise2(glm::detail::tvec2<T> const & x)
285
return glm::detail::tvec2<T>(
286
noise1(x + glm::detail::tvec2<T>(0.0)),
287
noise1(glm::detail::tvec2<T>(0.0) - x));
290
template <typename T>
291
GLM_FUNC_QUALIFIER glm::detail::tvec2<T> noise2(glm::detail::tvec3<T> const & x)
293
return glm::detail::tvec2<T>(
294
noise1(x + glm::detail::tvec3<T>(0.0)),
295
noise1(glm::detail::tvec3<T>(0.0) - x));
298
template <typename T>
299
GLM_FUNC_QUALIFIER glm::detail::tvec2<T> noise2(glm::detail::tvec4<T> const & x)
301
return glm::detail::tvec2<T>(
302
noise1(x + glm::detail::tvec4<T>(0.0)),
303
noise1(glm::detail::tvec4<T>(0.0) - x));
306
template <typename T>
307
GLM_FUNC_QUALIFIER glm::detail::tvec3<T> noise3(glm::detail::tvec2<T> const & x)
309
return glm::detail::tvec3<T>(
310
noise1(x - glm::detail::tvec2<T>(1.0)),
311
noise1(x + glm::detail::tvec2<T>(0.0)),
312
noise1(x + glm::detail::tvec2<T>(1.0)));
315
template <typename T>
316
GLM_FUNC_QUALIFIER glm::detail::tvec3<T> noise3(glm::detail::tvec3<T> const & x)
318
return glm::detail::tvec3<T>(
319
noise1(x - glm::detail::tvec3<T>(1.0)),
320
noise1(x + glm::detail::tvec3<T>(0.0)),
321
noise1(x + glm::detail::tvec3<T>(1.0)));
324
template <typename T>
325
GLM_FUNC_QUALIFIER glm::detail::tvec3<T> noise3(glm::detail::tvec4<T> const & x)
327
return glm::detail::tvec3<T>(
328
noise1(x - glm::detail::tvec4<T>(1.0)),
329
noise1(x + glm::detail::tvec4<T>(0.0)),
330
noise1(x + glm::detail::tvec4<T>(1.0)));
333
template <typename T>
334
GLM_FUNC_QUALIFIER glm::detail::tvec4<T> noise4(glm::detail::tvec2<T> const & x)
336
return glm::detail::tvec4<T>(
337
noise1(x - glm::detail::tvec2<T>(1.0)),
338
noise1(x + glm::detail::tvec2<T>(0.0)),
339
noise1(x + glm::detail::tvec2<T>(1.0)),
340
noise1(x + glm::detail::tvec2<T>(2.0)));
344
template <typename T>
345
GLM_FUNC_QUALIFIER glm::detail::tvec4<T> noise4(glm::detail::tvec3<T> const & x)
347
return glm::detail::tvec4<T>(
348
noise1(x - glm::detail::tvec3<T>(1.0)),
349
noise1(x + glm::detail::tvec3<T>(0.0)),
350
noise1(x + glm::detail::tvec3<T>(1.0)),
351
noise1(x + glm::detail::tvec3<T>(2.0)));
354
template <typename T>
355
GLM_FUNC_QUALIFIER glm::detail::tvec4<T> noise4(glm::detail::tvec4<T> const & x)
357
return glm::detail::tvec4<T>(
358
noise1(x - glm::detail::tvec4<T>(1.0)),
359
noise1(x + glm::detail::tvec4<T>(0.0)),
360
noise1(x + glm::detail::tvec4<T>(1.0)),
361
noise1(x + glm::detail::tvec4<T>(2.0)));