///////////////////////////////////////////////////////////////////////////////////
/// OpenGL Mathematics (glm.g-truc.net)
///
/// Copyright (c) 2005 – 2015 G-Truc Creation (www.g-truc.net)
/// Permission is hereby granted, free of charge, to any person obtaining a copy
/// of this software and associated documentation files (the “Software”), to deal
/// in the Software without restriction, including without limitation the rights
/// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
/// copies of the Software, and to permit persons to whom the Software is
/// furnished to do so, subject to the following conditions:
///
/// The above copyright notice and this permission notice shall be included in
/// all copies or substantial portions of the Software.
///
/// Restrictions:
/// By making use of the Software for military purposes, you choose to make
/// a Bunny unhappy.
///
/// THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
/// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
/// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
/// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
/// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
/// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
/// THE SOFTWARE.
///
/// @ref core
/// @file glm/detail/func_noise.inl
/// @date 2008-08-01 / 2011-09-27
/// @author Christophe Riccio
///////////////////////////////////////////////////////////////////////////////////
#include “../detail/_noise.hpp”
#include “./func_common.hpp”
namespace glm{
namespace detail
{
template
GLM_FUNC_QUALIFIER tvec4
{
tvec3
T pW = static_cast
tvec4
pXYZ = pXYZ + (tvec3
return tvec4
}
}//namespace detail
template
GLM_FUNC_QUALIFIER T noise1(T const & x)
{
return noise1(tvec2
}
template
GLM_FUNC_QUALIFIER tvec2
{
return tvec2
noise1(x + T(0.0)),
noise1(x + T(1.0)));
}
template
GLM_FUNC_QUALIFIER tvec3
{
return tvec3
noise1(x – T(1.0)),
noise1(x + T(0.0)),
noise1(x + T(1.0)));
}
template
GLM_FUNC_QUALIFIER tvec4
{
return tvec4
noise1(x – T(1.0)),
noise1(x + T(0.0)),
noise1(x + T(1.0)),
noise1(x + T(2.0)));
}
template
GLM_FUNC_QUALIFIER T noise1(tvec2
{
tvec4
T( 0.211324865405187), // (3.0 – sqrt(3.0)) / 6.0
T( 0.366025403784439), // 0.5 * (sqrt(3.0) – 1.0)
T(-0.577350269189626), // -1.0 + 2.0 * C.x
T( 0.024390243902439)); // 1.0 / 41.0
// First corner
tvec2
tvec2
// Other corners
//i1.x = step( x0.y, x0.x ); // x0.x > x0.y ? 1.0 : 0.0
//i1.y = 1.0 – i1.x;
tvec2
// x0 = x0 – 0.0 + 0.0 * C.xx ;
// x1 = x0 – i1 + 1.0 * C.xx ;
// x2 = x0 – 1.0 + 2.0 * C.xx ;
tvec4
x12 = tvec4
// Permutations
i = mod(i, T(289)); // Avoid truncation effects in permutation
tvec3
detail::permute(i.y + tvec3
tvec3
dot(x0, x0),
dot(tvec2
dot(tvec2
m = m * m;
m = m * m;
// Gradients: 41 points uniformly over a line, mapped onto a diamond.
// The ring size 17*17 = 289 is close to a multiple of 41 (41*7 = 287)
tvec3
tvec3
tvec3
tvec3
// Normalise gradients implicitly by scaling m
// Inlined for speed: m *= taylorInvSqrt( a0*a0 + h*h );
m *= static_cast
// Compute final noise value at P
tvec3
g.x = a0.x * x0.x + h.x * x0.y;
//g.yz = a0.yz * x12.xz + h.yz * x12.yw;
g.y = a0.y * x12.x + h.y * x12.y;
g.z = a0.z * x12.z + h.z * x12.w;
return T(130) * dot(m, g);
}
template
GLM_FUNC_QUALIFIER T noise1(tvec3
{
tvec2
tvec4
// First corner
tvec3
tvec3
// Other corners
tvec3
tvec3
tvec3
tvec3
// x0 = x0 – 0.0 + 0.0 * C.xxx;
// x1 = x0 – i1 + 1.0 * C.xxx;
// x2 = x0 – i2 + 2.0 * C.xxx;
// x3 = x0 – 1.0 + 3.0 * C.xxx;
tvec3
tvec3
tvec3
// Permutations
i = mod289(i);
tvec4
i.z + tvec4
i.y + tvec4
i.x + tvec4
// Gradients: 7×7 points over a square, mapped onto an octahedron.
// The ring size 17*17 = 289 is close to a multiple of 49 (49*6 = 294)
T n_ = static_cast
tvec3
tvec4
tvec4
tvec4
tvec4
tvec4
tvec4
tvec4
tvec4
// vec4 s0 = vec4(lessThan(b0,0.0))*2.0 – 1.0;
// vec4 s1 = vec4(lessThan(b1,0.0))*2.0 – 1.0;
tvec4
tvec4
tvec4
tvec4
tvec4
tvec3
tvec3
tvec3
tvec3
// Normalise gradients
tvec4
p0 *= norm.x;
p1 *= norm.y;
p2 *= norm.z;
p3 *= norm.w;
// Mix final noise value
tvec4
m = m * m;
return T(42) * dot(m * m, tvec4
}
template
GLM_FUNC_QUALIFIER T noise1(tvec4
{
tvec4
0.138196601125011, // (5 – sqrt(5))/20 G4
0.276393202250021, // 2 * G4
0.414589803375032, // 3 * G4
-0.447213595499958); // -1 + 4 * G4
// (sqrt(5) – 1)/4 = F4, used once below
T const F4 = static_cast
// First corner
tvec4
tvec4
// Other corners
// Rank sorting originally contributed by Bill Licea-Kane, AMD (formerly ATI)
tvec4
tvec3
tvec3
// i0.x = dot(isX, vec3(1.0));
//i0.x = isX.x + isX.y + isX.z;
//i0.yzw = static_cast
i0 = tvec4
// i0.y += dot(isYZ.xy, vec2(1.0));
i0.y += isYZ.x + isYZ.y;
//i0.zw += 1.0 – tvec2
i0.z += static_cast
i0.w += static_cast
i0.z += isYZ.z;
i0.w += static_cast
// i0 now contains the unique values 0,1,2,3 in each channel
tvec4
tvec4
tvec4
// x0 = x0 – 0.0 + 0.0 * C.xxxx
// x1 = x0 – i1 + 0.0 * C.xxxx
// x2 = x0 – i2 + 0.0 * C.xxxx
// x3 = x0 – i3 + 0.0 * C.xxxx
// x4 = x0 – 1.0 + 4.0 * C.xxxx
tvec4
tvec4
tvec4
tvec4
// Permutations
i = mod(i, T(289));
T j0 = detail::permute(detail::permute(detail::permute(detail::permute(i.w) + i.z) + i.y) + i.x);
tvec4
i.w + tvec4
i.z + tvec4
i.y + tvec4
i.x + tvec4
// Gradients: 7x7x6 points over a cube, mapped onto a 4-cross polytope
// 7*7*6 = 294, which is close to the ring size 17*17 = 289.
tvec4
tvec4
tvec4
tvec4
tvec4
tvec4
// Normalise gradients
tvec4
p0 *= norm.x;
p1 *= norm.y;
p2 *= norm.z;
p3 *= norm.w;
p4 *= taylorInvSqrt(dot(p4, p4));
// Mix contributions from the five corners
tvec3
tvec2
m0 = m0 * m0;
m1 = m1 * m1;
return T(49) * (
dot(m0 * m0, tvec3
dot(m1 * m1, tvec2
}
template
GLM_FUNC_QUALIFIER tvec2
{
return tvec2
noise1(x + tvec2
noise1(tvec2
}
template
GLM_FUNC_QUALIFIER tvec2
{
return tvec2
noise1(x + tvec3
noise1(tvec3
}
template
GLM_FUNC_QUALIFIER tvec2
{
return tvec2
noise1(x + tvec4
noise1(tvec4
}
template
GLM_FUNC_QUALIFIER tvec3
{
return tvec3
noise1(x – tvec2
noise1(x + tvec2
noise1(x + tvec2
}
template
GLM_FUNC_QUALIFIER tvec3
{
return tvec3
noise1(x – tvec3
noise1(x + tvec3
noise1(x + tvec3
}
template
GLM_FUNC_QUALIFIER tvec3
{
return tvec3
noise1(x – tvec4
noise1(x + tvec4
noise1(x + tvec4
}
template
GLM_FUNC_QUALIFIER tvec4
{
return tvec4
noise1(x – tvec2
noise1(x + tvec2
noise1(x + tvec2
noise1(x + tvec2
}
template
GLM_FUNC_QUALIFIER tvec4
{
return tvec4
noise1(x – tvec3
noise1(x + tvec3
noise1(x + tvec3
noise1(x + tvec3
}
template
GLM_FUNC_QUALIFIER tvec4
{
return tvec4
noise1(x – tvec4
noise1(x + tvec4
noise1(x + tvec4
noise1(x + tvec4
}
}//namespace glm