1 /* |
1 /* |
2 * Pyrit Ray Tracer |
2 * noise.cc: noise generators |
3 * file: noise.cc |
|
4 * |
3 * |
5 * Radek Brich, 2006-2007 |
4 * This file is part of Pyrit Ray Tracer. |
|
5 * |
|
6 * Copyright 2006, 2008 Radek Brich |
|
7 * |
|
8 * Permission is hereby granted, free of charge, to any person obtaining a copy |
|
9 * of this software and associated documentation files (the "Software"), to deal |
|
10 * in the Software without restriction, including without limitation the rights |
|
11 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
|
12 * copies of the Software, and to permit persons to whom the Software is |
|
13 * furnished to do so, subject to the following conditions: |
|
14 * |
|
15 * The above copyright notice and this permission notice shall be included in |
|
16 * all copies or substantial portions of the Software. |
|
17 * |
|
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|
20 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|
21 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|
22 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
|
23 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
|
24 * THE SOFTWARE. |
6 */ |
25 */ |
7 |
|
8 /* |
|
9 Based on |
|
10 JAVA REFERENCE IMPLEMENTATION OF IMPROVED NOISE |
|
11 by KEN PERLIN (COPYRIGHT 2002) |
|
12 */ |
|
13 |
26 |
14 #include <math.h> |
27 #include <math.h> |
15 |
28 |
16 #include "noise.h" |
29 #include "noise.h" |
17 |
30 |
|
31 /* |
|
32 Perlin noise |
|
33 Based on JAVA REFERENCE IMPLEMENTATION OF IMPROVED NOISE by KEN PERLIN (COPYRIGHT 2002) |
|
34 */ |
|
35 |
18 Float fade(Float t) |
36 Float fade(Float t) |
19 { |
37 { |
20 return t * t * t * (t * (t * 6 - 15) + 10); |
38 return t * t * t * (t * (t * 6 - 15) + 10); |
21 } |
39 } |
22 |
40 |
23 Float lerp(Float t, Float a, Float b) |
41 Float lerp(Float t, Float a, Float b) |
24 { |
42 { |
25 return a + t * (b - a); |
43 return a + t * (b - a); |
26 } |
44 } |
27 |
45 |
28 Float grad(unsigned char hash, Float x, Float y, Float z) |
46 Float grad(unsigned char hash, Float x, Float y, Float z) |
29 { |
47 { |
30 unsigned char h = hash & 15; // CONVERT LO 4 BITS OF HASH CODE |
48 unsigned char h = hash & 15; // CONVERT LO 4 BITS OF HASH CODE |
31 Float u = h<8 ? x : y, // INTO 12 GRADIENT DIRECTIONS. |
49 Float u = h<8 ? x : y, // INTO 12 GRADIENT DIRECTIONS. |
32 v = h<4 ? y : h==12||h==14 ? x : z; |
50 v = h<4 ? y : h==12||h==14 ? x : z; |
33 return ((h&1) == 0 ? u : -u) + ((h&2) == 0 ? v : -v); |
51 return ((h&1) == 0 ? u : -u) + ((h&2) == 0 ? v : -v); |
34 } |
52 } |
35 |
53 |
36 unsigned char p[512] = { 151,160,137,91,90,15, |
54 const unsigned char p[512] = |
37 131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23, |
55 { |
38 190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33, |
56 151,160,137,91,90,15, |
39 88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166, |
57 131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23, |
40 77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244, |
58 190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33, |
41 102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196, |
59 88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166, |
42 135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123, |
60 77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244, |
43 5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42, |
61 102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196, |
44 223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9, |
62 135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123, |
45 129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228, |
63 5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42, |
46 251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107, |
64 223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9, |
47 49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254, |
65 129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228, |
48 138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180, |
66 251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107, |
|
67 49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254, |
|
68 138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180, |
49 |
69 |
50 151,160,137,91,90,15, |
70 151,160,137,91,90,15, |
51 131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23, |
71 131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23, |
52 190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33, |
72 190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33, |
53 88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166, |
73 88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166, |
54 77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244, |
74 77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244, |
55 102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196, |
75 102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196, |
56 135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123, |
76 135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123, |
57 5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42, |
77 5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42, |
58 223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9, |
78 223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9, |
59 129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228, |
79 129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228, |
60 251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107, |
80 251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107, |
61 49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254, |
81 49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254, |
62 138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180 |
82 138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180 |
63 }; |
83 }; |
64 |
84 |
65 |
85 |
66 Float perlin(Float x, Float y, Float z) |
86 Float perlin(Float x, Float y, Float z) |
67 { |
87 { |
68 int X = (int)floor(x) & 255, // FIND UNIT CUBE THAT |
88 int X = (int)floor(x) & 255, |
69 Y = (int)floor(y) & 255, // CONTAINS POINT. |
89 Y = (int)floor(y) & 255, |
70 Z = (int)floor(z) & 255; |
90 Z = (int)floor(z) & 255; |
71 x -= floor(x); // FIND RELATIVE X,Y,Z |
91 x -= floor(x); |
72 y -= floor(y); // OF POINT IN CUBE. |
92 y -= floor(y); |
73 z -= floor(z); |
93 z -= floor(z); |
74 Float u = fade(x), // COMPUTE FADE CURVES |
94 Float u = fade(x), |
75 v = fade(y), // FOR EACH OF X,Y,Z. |
95 v = fade(y), |
76 w = fade(z); |
96 w = fade(z); |
77 int A = p[X ]+Y, AA = p[A]+Z, AB = p[A+1]+Z, // HASH COORDINATES OF |
97 int A = p[X ]+Y, AA = p[A]+Z, AB = p[A+1]+Z, |
78 B = p[X+1]+Y, BA = p[B]+Z, BB = p[B+1]+Z; // THE 8 CUBE CORNERS, |
98 B = p[X+1]+Y, BA = p[B]+Z, BB = p[B+1]+Z; |
79 |
99 |
80 return lerp(w, lerp(v, lerp(u, grad(p[AA ], x , y , z ), // AND ADD |
100 return lerp(w, lerp(v, lerp(u, grad(p[AA ], x , y , z ), |
81 grad(p[BA ], x-1, y , z )), // BLENDED |
101 grad(p[BA ], x-1, y , z )), |
82 lerp(u, grad(p[AB ], x , y-1, z ), // RESULTS |
102 lerp(u, grad(p[AB ], x , y-1, z ), |
83 grad(p[BB ], x-1, y-1, z ))),// FROM 8 |
103 grad(p[BB ], x-1, y-1, z ))), |
84 lerp(v, lerp(u, grad(p[AA+1], x , y , z-1 ), // CORNERS |
104 lerp(v, lerp(u, grad(p[AA+1], x , y , z-1 ), |
85 grad(p[BA+1], x-1, y , z-1 )), // OF CUBE |
105 grad(p[BA+1], x-1, y , z-1 )), |
86 lerp(u, grad(p[AB+1], x , y-1, z-1 ), |
106 lerp(u, grad(p[AB+1], x , y-1, z-1 ), |
87 grad(p[BB+1], x-1, y-1, z-1 )))); |
107 grad(p[BB+1], x-1, y-1, z-1 )))); |
88 } |
108 } |
89 |
|
90 |
|
91 /* |
|
92 // JAVA REFERENCE IMPLEMENTATION OF IMPROVED NOISE - COPYRIGHT 2002 KEN PERLIN. |
|
93 |
|
94 public final class ImprovedNoise { |
|
95 static public double noise(double x, double y, double z) { |
|
96 int X = (int)Math.floor(x) & 255, // FIND UNIT CUBE THAT |
|
97 Y = (int)Math.floor(y) & 255, // CONTAINS POINT. |
|
98 Z = (int)Math.floor(z) & 255; |
|
99 x -= Math.floor(x); // FIND RELATIVE X,Y,Z |
|
100 y -= Math.floor(y); // OF POINT IN CUBE. |
|
101 z -= Math.floor(z); |
|
102 double u = fade(x), // COMPUTE FADE CURVES |
|
103 v = fade(y), // FOR EACH OF X,Y,Z. |
|
104 w = fade(z); |
|
105 int A = p[X ]+Y, AA = p[A]+Z, AB = p[A+1]+Z, // HASH COORDINATES OF |
|
106 B = p[X+1]+Y, BA = p[B]+Z, BB = p[B+1]+Z; // THE 8 CUBE CORNERS, |
|
107 |
|
108 return lerp(w, lerp(v, lerp(u, grad(p[AA ], x , y , z ), // AND ADD |
|
109 grad(p[BA ], x-1, y , z )), // BLENDED |
|
110 lerp(u, grad(p[AB ], x , y-1, z ), // RESULTS |
|
111 grad(p[BB ], x-1, y-1, z ))),// FROM 8 |
|
112 lerp(v, lerp(u, grad(p[AA+1], x , y , z-1 ), // CORNERS |
|
113 grad(p[BA+1], x-1, y , z-1 )), // OF CUBE |
|
114 lerp(u, grad(p[AB+1], x , y-1, z-1 ), |
|
115 grad(p[BB+1], x-1, y-1, z-1 )))); |
|
116 } |
|
117 static double fade(double t) { return t * t * t * (t * (t * 6 - 15) + 10); } |
|
118 static double lerp(double t, double a, double b) { return a + t * (b - a); } |
|
119 static double grad(int hash, double x, double y, double z) { |
|
120 int h = hash & 15; // CONVERT LO 4 BITS OF HASH CODE |
|
121 double u = h<8 ? x : y, // INTO 12 GRADIENT DIRECTIONS. |
|
122 v = h<4 ? y : h==12||h==14 ? x : z; |
|
123 return ((h&1) == 0 ? u : -u) + ((h&2) == 0 ? v : -v); |
|
124 } |
|
125 static final int p[] = new int[512], permutation[] = { 151,160,137,91,90,15, |
|
126 131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23, |
|
127 190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33, |
|
128 88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166, |
|
129 77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244, |
|
130 102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196, |
|
131 135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123, |
|
132 5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42, |
|
133 223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9, |
|
134 129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228, |
|
135 251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107, |
|
136 49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254, |
|
137 138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180 |
|
138 }; |
|
139 static { for (int i=0; i < 256 ; i++) p[256+i] = p[i] = permutation[i]; } |
|
140 } |
|
141 */ |
|