3 Copyright (C) 2010-2011 celeron55, Perttu Ahola <celeron55@gmail.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License along
16 with this program; if not, write to the Free Software Foundation, Inc.,
17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 #define NOISE_MAGIC_X 1619
25 #define NOISE_MAGIC_Y 31337
26 #define NOISE_MAGIC_Z 52591
27 #define NOISE_MAGIC_SEED 1013
29 double cos_lookup[16] = {
30 1.0,0.9238,0.7071,0.3826,0,-0.3826,-0.7071,-0.9238,
31 1.0,-0.9238,-0.7071,-0.3826,0,0.3826,0.7071,0.9238
34 double dotProduct(double vx, double vy, double wx, double wy){
38 double easeCurve(double t){
39 return 6*pow(t,5)-15*pow(t,4)+10*pow(t,3);
42 double linearInterpolation(double x0, double x1, double t){
46 double biLinearInterpolation(double x0y0, double x1y0, double x0y1, double x1y1, double x, double y){
47 double tx = easeCurve(x);
48 double ty = easeCurve(y);
51 double u = linearInterpolation(x0y0,x1y0,tx);
52 double v = linearInterpolation(x0y1,x1y1,tx);
53 return linearInterpolation(u,v,ty);
56 double triLinearInterpolation(
57 double v000, double v100, double v010, double v110,
58 double v001, double v101, double v011, double v111,
59 double x, double y, double z)
61 /*double tx = easeCurve(x);
62 double ty = easeCurve(y);
63 double tz = easeCurve(z);*/
68 v000*(1-tx)*(1-ty)*(1-tz) +
69 v100*tx*(1-ty)*(1-tz) +
70 v010*(1-tx)*ty*(1-tz) +
72 v001*(1-tx)*(1-ty)*tz +
79 double noise2d(int x, int y, int seed)
81 int n = (NOISE_MAGIC_X * x + NOISE_MAGIC_Y * y
82 + NOISE_MAGIC_SEED * seed) & 0x7fffffff;
84 n = (n * (n*n*60493+19990303) + 1376312589) & 0x7fffffff;
85 return 1.0 - (double)n/1073741824;
88 double noise3d(int x, int y, int z, int seed)
90 int n = (NOISE_MAGIC_X * x + NOISE_MAGIC_Y * y + NOISE_MAGIC_Z * z
91 + NOISE_MAGIC_SEED * seed) & 0x7fffffff;
93 n = (n * (n*n*60493+19990303) + 1376312589) & 0x7fffffff;
94 return 1.0 - (double)n/1073741824;
98 double noise2d_gradient(double x, double y, int seed)
100 // Calculate the integer coordinates
101 int x0 = (x > 0.0 ? (int)x : (int)x - 1);
102 int y0 = (y > 0.0 ? (int)y : (int)y - 1);
103 // Calculate the remaining part of the coordinates
104 double xl = x - (double)x0;
105 double yl = y - (double)y0;
106 // Calculate random cosine lookup table indices for the integer corners.
107 // They are looked up as unit vector gradients from the lookup table.
108 int n00 = (int)((noise2d(x0, y0, seed)+1)*8);
109 int n10 = (int)((noise2d(x0+1, y0, seed)+1)*8);
110 int n01 = (int)((noise2d(x0, y0+1, seed)+1)*8);
111 int n11 = (int)((noise2d(x0+1, y0+1, seed)+1)*8);
112 // Make a dot product for the gradients and the positions, to get the values
113 double s = dotProduct(cos_lookup[n00], cos_lookup[(n00+12)%16], xl, yl);
114 double u = dotProduct(-cos_lookup[n10], cos_lookup[(n10+12)%16], 1.-xl, yl);
115 double v = dotProduct(cos_lookup[n01], -cos_lookup[(n01+12)%16], xl, 1.-yl);
116 double w = dotProduct(-cos_lookup[n11], -cos_lookup[(n11+12)%16], 1.-xl, 1.-yl);
117 // Interpolate between the values
118 return biLinearInterpolation(s,u,v,w,xl,yl);
123 double noise2d_gradient(double x, double y, int seed)
125 // Calculate the integer coordinates
126 int x0 = (x > 0.0 ? (int)x : (int)x - 1);
127 int y0 = (y > 0.0 ? (int)y : (int)y - 1);
128 // Calculate the remaining part of the coordinates
129 double xl = x - (double)x0;
130 double yl = y - (double)y0;
131 // Get values for corners of cube
132 double v00 = noise2d(x0, y0, seed);
133 double v10 = noise2d(x0+1, y0, seed);
134 double v01 = noise2d(x0, y0+1, seed);
135 double v11 = noise2d(x0+1, y0+1, seed);
137 return biLinearInterpolation(v00,v10,v01,v11,xl,yl);
141 double noise3d_gradient(double x, double y, double z, int seed)
143 // Calculate the integer coordinates
144 int x0 = (x > 0.0 ? (int)x : (int)x - 1);
145 int y0 = (y > 0.0 ? (int)y : (int)y - 1);
146 int z0 = (z > 0.0 ? (int)z : (int)z - 1);
147 // Calculate the remaining part of the coordinates
148 double xl = x - (double)x0;
149 double yl = y - (double)y0;
150 double zl = z - (double)z0;
151 // Get values for corners of cube
152 double v000 = noise3d(x0, y0, z0, seed);
153 double v100 = noise3d(x0+1, y0, z0, seed);
154 double v010 = noise3d(x0, y0+1, z0, seed);
155 double v110 = noise3d(x0+1, y0+1, z0, seed);
156 double v001 = noise3d(x0, y0, z0+1, seed);
157 double v101 = noise3d(x0+1, y0, z0+1, seed);
158 double v011 = noise3d(x0, y0+1, z0+1, seed);
159 double v111 = noise3d(x0+1, y0+1, z0+1, seed);
161 return triLinearInterpolation(v000,v100,v010,v110,v001,v101,v011,v111,xl,yl,zl);
164 double noise2d_perlin(double x, double y, int seed,
165 int octaves, double persistence)
170 for(int i=0; i<octaves; i++)
172 a += g * noise2d_gradient(x*f, y*f, seed+i);
179 double noise2d_perlin_abs(double x, double y, int seed,
180 int octaves, double persistence)
185 for(int i=0; i<octaves; i++)
187 a += g * fabs(noise2d_gradient(x*f, y*f, seed+i));
194 double noise3d_perlin(double x, double y, double z, int seed,
195 int octaves, double persistence)
200 for(int i=0; i<octaves; i++)
202 a += g * noise3d_gradient(x*f, y*f, z*f, seed+i);
209 double noise3d_perlin_abs(double x, double y, double z, int seed,
210 int octaves, double persistence)
215 for(int i=0; i<octaves; i++)
217 a += g * fabs(noise3d_gradient(x*f, y*f, z*f, seed+i));