today i haz bin perlin

[codifiesParticipant]

Probably the least efficient way to render it, doesn’t pan properly when it zooms, shore logarithm is just a radius but you can rip the naff bits out and use the noise functions for yourself…

Monkey

[crayon-5cba8437843fd717606728 inline="true" ] #Rem as Ken Perlin has asserted his copyright but not specified a licence I don't know the legality of using this... // JAVA REFERENCE IMPLEMENTATION OF IMPROVED NOISE - COPYRIGHT 2002 KEN PERLIN. public final class ImprovedNoise { static public double noise(double x, double y, double z) { int X = (int)Math.floor(x) & 255, // FIND UNIT CUBE THAT Y = (int)Math.floor(y) & 255, // CONTAINS POINT. Z = (int)Math.floor(z) & 255; x -= Math.floor(x); // FIND RELATIVE X,Y,Z y -= Math.floor(y); // OF POINT IN CUBE. z -= Math.floor(z); double u = fade(x), // COMPUTE FADE CURVES v = fade(y), // FOR EACH OF X,Y,Z. w = fade(z); int A = p[X ]+Y, AA = p[A]+Z, AB = p[A+1]+Z, // HASH COORDINATES OF B = p[X+1]+Y, BA = p[B]+Z, BB = p[B+1]+Z; // THE 8 CUBE CORNERS, return lerp(w, lerp(v, lerp(u, grad(p[AA ], x , y , z ), // AND ADD grad(p[BA ], x-1, y , z )), // BLENDED lerp(u, grad(p[AB ], x , y-1, z ), // RESULTS grad(p[BB ], x-1, y-1, z ))),// FROM 8 lerp(v, lerp(u, grad(p[AA+1], x , y , z-1 ), // CORNERS grad(p[BA+1], x-1, y , z-1 )), // OF CUBE lerp(u, grad(p[AB+1], x , y-1, z-1 ), grad(p[BB+1], x-1, y-1, z-1 )))); } static double fade(double t) { return t * t * t * (t * (t * 6 - 15) + 10); } static double lerp(double t, double a, double b) { return a + t * (b - a); } static double grad(int hash, double x, double y, double z) { int h = hash & 15; // CONVERT LO 4 BITS OF HASH CODE double u = h<8 ? x : y, // INTO 12 GRADIENT DIRECTIONS. v = h<4 ? y : h==12||h==14 ? x : z; return ((h&1) == 0 ? u : -u) + ((h&2) == 0 ? v : -v); } static final int p[] = new int[512], permutation[] = { 151,160,137,91,90,15, 131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23, 190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33, 88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166, 77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244, 102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196, 135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123, 5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42, 223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9, 129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228, 251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107, 49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254, 138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180 }; static { for (int i=0; i < 256 ; i++) p[256+i] = p[i] = permutation[i]; } } #end rem #Import "<std>" #Import "<mojo>" Using std.. Using mojo.. Global permutation:Int[] = New Int[](151,160,137,91,90,15, 131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23, 190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33, 88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166, 77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244, 102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196, 135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123, 5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42, 223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9, 129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228, 251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107, 49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254, 138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180) Global p:Int[] = new int[512] Global zoom:Float=1 Global offx:Float=0 Global offy:Float=0 Global map:Float[] = New Float[256*256] Global ap:AppInstance Class awindow Extends Window Method New() ClearColor=Color.Black updateMap() End Method Method OnRender( canvas:Canvas ) Override App.RequestRender() For Local y:int = 0 To 255 For Local x:int = 0 To 255 Local v:Float=map[x+(y*256)] If v<.2 Then canvas.Color=New Color(0,0,v+.5) elseIf v<.4 Then canvas.Color=New Color(v,v,0) elseIf v<.7 Then canvas.Color=New Color(0,v,0) else canvas.Color=New Color(v,v,v) Endif canvas.DrawPoint(x+100,y+100) Next Next Local update:Bool = False If Keyboard.KeyDown(Key.Comma) Then zoom=zoom-1 If zoom<1 Then zoom=1 Else offx-=64 offy-=64 update = True Endif End If If Keyboard.KeyDown(Key.Period) Then zoom=zoom+1 offx+=64 offy+=64 update = true End If If Keyboard.KeyDown(Key.Left) Then offx-=8 update = true End If If Keyboard.KeyDown(Key.Right) Then offx+=8 update = true End If If Keyboard.KeyDown(Key.Up) Then offy-=8 update = true End If If Keyboard.KeyDown(Key.Down) Then offy+=8 update = true End If If update Then updateMap() End Method End Class Function Main() For Local i:int=0 To 255 ' no static code blocks :( so do it here p[256+i] = permutation[i] p[i] = permutation[i] Next New AppInstance New awindow App.Run() End Function Function updateMap() Local min:Double=1000000 Local max:Double=-1000000 Local o:double For Local y:Int = 0 To 255 For Local x:int = 0 To 255 Local o1:Double = (noise(((x+offx)/15.0)/zoom,((y+offy)/15.0)/zoom,1)+.6)/3.3 Local o2:Double = (noise(((x+offx)/7.0)/zoom,((y+offy)/7.0)/zoom,1)+.6)/3.3 Local o3:Double = (noise(((x+offx)/2.0)/zoom,((y+offy)/2.0)/zoom,1)+.6)/3.3 Local d:Double Local xd:double = Abs(((x+offx)/zoom)-128) Local yd:Double = Abs(((y+offy)/zoom)-128) d = Sqrt( xd*xd + yd*yd ) If d>100 Then d = 1.0 - ( (d-100) / 40 ) If d<0 Then d=0 Else d = 1 Endif o = (o1 + o2 + o3) * d If o>1 then o=1 map[x+(y*256)] = o If o<min Then min = o If o>max Then max = o Next Next Print zoom+" "+offx+","+offy End Function Function grad:double(hash:Int, x:double, y:double, z:double) local h:Int = hash & 15 ' CONVERT LO 4 BITS OF HASH CODE local u:double = h<8 ? x Else y ' INTO 12 GRADIENT DIRECTIONS. local v:double = h<4 ? y Else ((h=12 Or h=14) ? x else z) return ((h&1) = 0 ? u Else -u) + ((h&2) = 0 ? v Else -v) End Function Function lerp:double(t:double , a:double, b:double) return a + t * (b - a) End Function Function fade:double(t:Double) return t * t * t * (t * (t * 6 - 15) + 10) End Function Function noise:double(x:double, y:double, z:double) 'YUK Perlin what were you thinking X & x terrible practice..... Local t:Int = Floor(x) '// FIND UNIT CUBE THAT Local X:Int = t & 255 t = Floor(y) local Y:int = t & 255 '// CONTAINS POINT. t = Floor(z) Local Z:int = t & 255 x -= Floor(x) '// FIND RELATIVE X,Y,Z y -= Floor(y) '// OF POINT IN CUBE. z -= Floor(z) local u:double = fade(x) '// COMPUTE FADE CURVES local v:double = fade(y) '// FOR EACH OF X,Y,Z. Local w:double = fade(z) local A:int = p[X ]+Y Local AA:Int = p[A]+Z Local AB:int = p[A+1]+Z '// HASH COORDINATES OF Local B:int = p[X+1]+Y Local BA:Int = p[B]+Z Local BB:int = p[B+1]+Z '// THE 8 CUBE CORNERS, return lerp(w, lerp(v, lerp(u, grad(p[AA ], x , y , z ), '// AND ADD grad(p[BA ], x-1, y , z )), '// BLENDED lerp(u, grad(p[AB ], x , y-1, z ), '// RESULTS grad(p[BB ], x-1, y-1, z ))),'// FROM 8 lerp(v, lerp(u, grad(p[AA+1], x , y , z-1 ), '// CORNERS grad(p[BA+1], x-1, y , z-1 )), '// OF CUBE lerp(u, grad(p[AB+1], x , y-1, z-1 ), grad(p[BB+1], x-1, y-1, z-1 )))) End Function

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 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261

[crayon-5cba8437843fd717606728 inline="true" ]   #Rem   as Ken Perlin has asserted his copyright but not specified a licence I don't know the legality of using this...   // JAVA REFERENCE IMPLEMENTATION OF IMPROVED NOISE - COPYRIGHT 2002 KEN PERLIN.   public final class ImprovedNoise {    static public double noise(double x, double y, double z) {       int X = (int)Math.floor(x) & 255,                  // FIND UNIT CUBE THAT           Y = (int)Math.floor(y) & 255,                  // CONTAINS POINT.           Z = (int)Math.floor(z) & 255;       x -= Math.floor(x);                                // FIND RELATIVE X,Y,Z       y -= Math.floor(y);                                // OF POINT IN CUBE.       z -= Math.floor(z);       double u = fade(x),                                // COMPUTE FADE CURVES              v = fade(y),                                // FOR EACH OF X,Y,Z.              w = fade(z);       int A = p[X  ]+Y, AA = p[A]+Z, AB = p[A+1]+Z,      // HASH COORDINATES OF           B = p[X+1]+Y, BA = p[B]+Z, BB = p[B+1]+Z;      // THE 8 CUBE CORNERS,         return lerp(w, lerp(v, lerp(u, grad(p[AA  ], x  , y  , z   ),  // AND ADD                                      grad(p[BA  ], x-1, y  , z   )), // BLENDED                              lerp(u, grad(p[AB  ], x  , y-1, z   ),  // RESULTS                                      grad(p[BB  ], x-1, y-1, z   ))),// FROM  8                      lerp(v, lerp(u, grad(p[AA+1], x  , y  , z-1 ),  // CORNERS                                      grad(p[BA+1], x-1, y  , z-1 )), // OF CUBE                              lerp(u, grad(p[AB+1], x  , y-1, z-1 ),                                      grad(p[BB+1], x-1, y-1, z-1 ))));    }    static double fade(double t) { return t * t * t * (t * (t * 6 - 15) + 10); }    static double lerp(double t, double a, double b) { return a + t * (b - a); }    static double grad(int hash, double x, double y, double z) {       int h = hash & 15;                      // CONVERT LO 4 BITS OF HASH CODE       double u = h<8 ? x : y,                 // INTO 12 GRADIENT DIRECTIONS.              v = h<4 ? y : h==12||h==14 ? x : z;       return ((h&1) == 0 ? u : -u) + ((h&2) == 0 ? v : -v);    }    static final int p[] = new int[512], permutation[] = { 151,160,137,91,90,15,    131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23,    190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33,    88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166,    77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244,    102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196,    135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123,    5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42,    223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9,    129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228,    251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107,    49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254,    138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180    };    static { for (int i=0; i < 256 ; i++) p[256+i] = p[i] = permutation[i]; } }   #end rem   #Import "<std>" #Import "<mojo>"   Using std.. Using mojo..   Global permutation:Int[] = New Int[](151,160,137,91,90,15,    131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23,    190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33,    88,237,149,56,87,174,20,125,136,171,168, 68,175,74,165,71,134,139,48,27,166,    77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244,    102,143,54, 65,25,63,161, 1,216,80,73,209,76,132,187,208, 89,18,169,200,196,    135,130,116,188,159,86,164,100,109,198,173,186, 3,64,52,217,226,250,124,123,    5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42,    223,183,170,213,119,248,152, 2,44,154,163, 70,221,153,101,155,167, 43,172,9,    129,22,39,253, 19,98,108,110,79,113,224,232,178,185, 112,104,218,246,97,228,    251,34,242,193,238,210,144,12,191,179,162,241, 81,51,145,235,249,14,239,107,    49,192,214, 31,181,199,106,157,184, 84,204,176,115,121,50,45,127, 4,150,254,    138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180)   Global p:Int[] = new int[512] Global zoom:Float=1 Global offx:Float=0 Global offy:Float=0 Global map:Float[] = New Float[256*256] Global ap:AppInstance   Class awindow Extends Window Method New()   ClearColor=Color.Black   updateMap() End Method Method OnRender( canvas:Canvas ) Override   App.RequestRender() For Local y:int = 0 To 255 For Local x:int = 0 To 255 Local v:Float=map[x+(y*256)] If v<.2 Then canvas.Color=New Color(0,0,v+.5) elseIf v<.4 Then canvas.Color=New Color(v,v,0) elseIf v<.7 Then canvas.Color=New Color(0,v,0) else canvas.Color=New Color(v,v,v) Endif canvas.DrawPoint(x+100,y+100) Next Next Local update:Bool = False If Keyboard.KeyDown(Key.Comma) Then zoom=zoom-1 If zoom<1 Then zoom=1 Else offx-=64 offy-=64 update = True Endif End If If Keyboard.KeyDown(Key.Period) Then zoom=zoom+1 offx+=64 offy+=64 update = true End If If Keyboard.KeyDown(Key.Left) Then offx-=8 update = true End If If Keyboard.KeyDown(Key.Right) Then offx+=8 update = true End If If Keyboard.KeyDown(Key.Up) Then offy-=8 update = true End If If Keyboard.KeyDown(Key.Down) Then offy+=8 update = true End If If update Then updateMap() End Method   End Class   Function Main()   For Local i:int=0 To 255        ' no static code blocks :( so do it here p[256+i] = permutation[i] p[i] = permutation[i] Next   New AppInstance New awindow App.Run() End Function   Function updateMap() Local min:Double=1000000 Local max:Double=-1000000 Local o:double For Local y:Int = 0 To 255 For Local x:int = 0 To 255 Local o1:Double = (noise(((x+offx)/15.0)/zoom,((y+offy)/15.0)/zoom,1)+.6)/3.3 Local o2:Double = (noise(((x+offx)/7.0)/zoom,((y+offy)/7.0)/zoom,1)+.6)/3.3 Local o3:Double = (noise(((x+offx)/2.0)/zoom,((y+offy)/2.0)/zoom,1)+.6)/3.3 Local d:Double Local xd:double = Abs(((x+offx)/zoom)-128) Local yd:Double = Abs(((y+offy)/zoom)-128) d = Sqrt( xd*xd + yd*yd ) If d>100 Then d =  1.0 - ( (d-100) / 40  ) If d<0 Then d=0 Else d = 1 Endif o = (o1 + o2 + o3) * d If o>1 then o=1   map[x+(y*256)] = o If o<min Then min = o If o>max Then max = o Next Next   Print zoom+" "+offx+","+offy End Function   Function grad:double(hash:Int, x:double, y:double, z:double)       local h:Int = hash & 15                      ' CONVERT LO 4 BITS OF HASH CODE       local u:double = h<8 ? x Else y                 ' INTO 12 GRADIENT DIRECTIONS.       local v:double = h<4 ? y Else ((h=12 Or h=14) ? x else z)              return ((h&1) = 0 ? u Else -u) + ((h&2) = 0 ? v Else -v) End Function Function lerp:double(t:double , a:double, b:double) return a + t * (b - a) End Function   Function fade:double(t:Double) return t * t * t * (t * (t * 6 - 15) + 10) End Function   Function noise:double(x:double, y:double, z:double) 'YUK Perlin what were you thinking X & x terrible practice.....     Local t:Int = Floor(x)                 '// FIND UNIT CUBE THAT     Local X:Int = t & 255     t = Floor(y)     local Y:int = t & 255                  '// CONTAINS POINT.     t = Floor(z)     Local Z:int = t & 255     x -= Floor(x)                                '// FIND RELATIVE X,Y,Z     y -= Floor(y)                                '// OF POINT IN CUBE.     z -= Floor(z)     local u:double = fade(x)                                '// COMPUTE FADE CURVES     local v:double = fade(y)                                '// FOR EACH OF X,Y,Z.     Local w:double = fade(z)     local A:int  = p[X  ]+Y     Local AA:Int = p[A]+Z     Local AB:int = p[A+1]+Z      '// HASH COORDINATES OF     Local B:int =  p[X+1]+Y     Local BA:Int = p[B]+Z     Local BB:int = p[B+1]+Z      '// THE 8 CUBE CORNERS,       return lerp(w, lerp(v, lerp(u, grad(p[AA  ], x  , y  , z   ),  '// AND ADD                                      grad(p[BA  ], x-1, y  , z   )), '// BLENDED                              lerp(u, grad(p[AB  ], x  , y-1, z   ),  '// RESULTS                                      grad(p[BB  ], x-1, y-1, z   ))),'// FROM  8                      lerp(v, lerp(u, grad(p[AA+1], x  , y  , z-1 ),  '// CORNERS                                      grad(p[BA+1], x-1, y  , z-1 )), '// OF CUBE                              lerp(u, grad(p[AB+1], x  , y-1, z-1 ),                                      grad(p[BB+1], x-1, y-1, z-1 )))) End Function

[/crayon]

[codifiesParticipant]

see some rather better implementations http://monkey2.monkey-x.com/forums/topic/perlin-noise/

[coconParticipant]

Nice one.

[Author]

Posts