hH;,SrSrSSKJrJrJr SSKJr SrSr Sr S\"S 5S - -r S \"S 5- S - r S r S rSr"SS5r"SS\5rSrSr"SS\5r\"5r\R,r\R0r\"5r\R0rg)a?Noise functions for procedural generation of content Contains native code implementations of Perlin improved noise (with fBm capabilities) and Perlin simplex noise. Also contains a fast "fake noise" implementation in GLSL for execution in shaders. Copyright (c) 2008, Casey Duncan (casey dot duncan at gmail dot com) z1.2.1)floorfmodsqrt)randint)rrrr)rr r)r r r)rrr)r rr)rrr )r rr )rrrrr r)rrr rr r rr r r ) )rrrr)rrrr )rrr r)rrr r )rr rr)rr rr )rr r r)rr r r )rrrr)rrrr )rrr r)rrr r )r rrr)r rrr )r rr r)r rr r )rrrr)rrrr )rr rr)rr rr )r rrr)r rrr )r r rr)r r rr )rrrr)rrr r)rr rr)rr r r)r rrr)r rr r)r r rr)r r r r)@)rr)rrrr rrrr)rr rrrrr)rr rr)rr rrr)rrrr )rrr rrrr)rrr rrrrrrrrr)rr rrr)rrrr rrr)r rrr)r rrr)rrr r)rrrr rrr)r rrrr)r rrrrrrrrrrr)r rrrrrr)rrrr )rrr rr)rrr r)r rrrrrr)rrrr r)rr rr)rr rr?@?g@gUUUUUU?gUUUUUU?([Z _`5$gEc% xKr>^u# 9!X8W}DJG0MSoz<i\)7.(f6A?rPILYtVdmr@4|{&v~RU;/:*wr ,Fe+ 'rblnOqpha" Q3k1jTsy2-]rCHNB=cF\rSrSrSr\"\5r\S-rSSjr S Sjr Sr g) BaseNoiserEzNoise abstract base classr NcUbUb [S5eUbURU5 gUb$[U5S-Ul[ U5Ulgg)a,Initialize the noise generator. With no arguments, the default period and permutation table are used (256). The default permutation table generates the exact same noise pattern each time. An integer period can be specified, to generate a random permutation table with period elements. The period determines the (integer) interval that the noise repeats, which is useful for creating tiled textures. period should be a power-of-two, though this is not enforced. Note that the speed of the noise algorithm is independent of the period size, though larger periods mean a larger table, which consume more memory. A permutation table consisting of an iterable sequence of whole numbers can be specified directly. This should have a power-of-two length. Typical permutation tables are a sequence of unique integers in the range [0,period) in random order, though other arrangements could prove useful, they will not be "pure" simplex noise. The largest element in the sequence must be no larger than period-1. period and permutation_table may not be specified together. Nz8Can specify either period or permutation_table, not bothr ) ValueError randomizetuple permutationlenperiod)selfrpermutation_tables C/var/www/html/env/lib/python3.13/site-packages/ezdxf/math/perlin.py__init__BaseNoise.__init__^s_,  "3"?J    NN6 "  *$%67!;D /0DK+cUbXl[[UR55nURS- n[U5Hn[SU5nX%X$sX$'X%'M [ U5S-Ulg)zRandomize the permutation table used by the noise functions. This makes them generate a different noise pattern for the same inputs. Nrrr )rlistrangerrr)rrperm perm_rightijs rrBaseNoise.randomize~so   KE$++&'[[1_ dA:&A#w DGTW!;?r)rr)NNN) __name__ __module__ __qualname____firstlineno____doc__r _permutationrrrr__static_attributes__rrrrXs$#  F"K1@ +rrc$\rSrSrSrSrSrSrg) SimplexNoiser#aPerlin simplex noise generator Adapted from Stefan Gustavson's Java implementation described here: http://staffwww.itn.liu.se/~stegu/simplexnoise/simplexnoise.pdf To summarize: "In 2001, Ken Perlin presented 'simplex noise', a replacement for his classic noise algorithm. Classic 'Perlin noise' won him an academy award and has become an ubiquitous procedural primitive for computer graphics over the years, but in hindsight it has quite a few limitations. Ken Perlin himself designed simplex noise specifically to overcome those limitations, and he spent a lot of good thinking on it. Therefore, it is a better idea than his original algorithm. A few of the more prominent advantages are: * Simplex noise has a lower computational complexity and requires fewer multiplications. * Simplex noise scales to higher dimensions (4D, 5D and up) with much less computational cost, the complexity is O(N) for N dimensions instead of the O(2^N) of classic Noise. * Simplex noise has no noticeable directional artifacts. Simplex noise has a well-defined and continuous gradient everywhere that can be computed quite cheaply. * Simplex noise is easy to implement in hardware." c:X-[-n[X-5n[X#-5nXE-[-nXU- - nX%U- - nXx:aSn Sn OSn Sn Xy- [-n X- [-n U[S--S- n U[S--S- nURn[ U5UR -n[ U5UR -nUUUU-S-nUUU -UUU --S-nUUS-UUS--S-nSUS-- US-- nUS:a![ UnUS-USU-USU---nOS nSU S-- U S-- nUS:a#[ UnUUS-USU -USU ---- nSU S-- US-- nUS:a#[ UnUUS-USU -USU---- nUS -$) z2D Perlin simplex noise. Return a floating point value from -1 to 1 for the given x, y coordinate. The same value is always returned for a given x, y pair unless the permutation table changes (see randomize above). rr@rrrr rgQ@)_F2r_G2rintr_GRAD3)rxysr"r#tx0y0i1j1x1y1x2y2r iijjgi0gi1gi2ttgnoises rnoise2SimplexNoise.noise2sUcM !%L !%L UcM a%[ a%[ 7BBBB Ws] Ws] sNS  #)^c ! Vdkk ! Vdkk !2R=!B&27T"r']*+b026DaL()B.27]R1W $ 6s A!Gqtby1Q4"945EE 27]R1W $ 6s A R1W!r AaD2I 56 6E 27]R1W $ 6s A R1W!r AaD2I 56 6Et|rc.X-U-[-n[X-5n[X$-5n[X4-5nXV-U-[-nXU- - n X&U- - n X7U- - n X:a1X:a Sn Sn SnSnSnSnOOX:a Sn Sn SnSnSnSnO=Sn Sn SnSnSnSnO0X:a Sn Sn SnSnSnSnOX:a Sn Sn SnSnSnSnO Sn Sn SnSnSnSnX- [-nX- [-nX- [-nX- S[--nU U- S[--nU U- S[--nU S- S[--nU S- S[--nU S- S[--nURn[ U5UR -n[ U5UR -n[ U5UR -nUUUUUU--S-nUUU -UUU -UUU---S-n UUU-UUU-UUU---S-n!UUS-UUS-UUS---S-n"Sn#SU S -- U S -- U S -- n$U$S:a*[ Un%U$S -U%SU -U%SU --U%S U ---n#OSn#SUS -- US -- US -- n$U$S:a,[ U n%U#U$S -U%SU-U%SU--U%S U---- n#SUS -- US -- US -- n$U$S:a,[ U!n%U#U$S -U%SU-U%SU--U%S U---- n#SUS -- US -- US -- n$U$S:a,[ U"n%U#U$S -U%SU-U%SU--U%S U---- n#U#S -$) z3D Perlin simplex noise. Return a floating point value from -1 to 1 for the given x, y, z coordinate. The same value is always returned for a given x, y, z pair unless the permutation table changes (see randomize above). rrr1rrrr2g333333?r rg@@)_F3r_G3rr5rr6)&rr7r8zr9r"r#kr:r;r<z0r=r>k1i2j2k2r?r@z1rArBz2x3y3z3r rCrDkkrErFrGgi3rJrHrIs& rnoise3SimplexNoise.noise3sQUQY#  !%L !%L !%L UQY#  a%[ a%[ a%[ 8xwWs] Ws] Ws] WsSy  "WsSy  "WsSy  #Xc ! #Xc ! #Xc ! Vdkk ! Vdkk ! Vdkk !2R$r(]++,r127T"r'DbM"9::;b@27T"r'DbM"9::;b@26Da$rAv,!67782= 27]R1W $rQw . 6s A!Gqtby1Q4"94qtby@AEE 27]R1W $rQw . 6s A R1W!r AaD2I 5!r AB BE 27]R1W $rQw . 6s A R1W!r AaD2I 5!r AB BE 27]R1W $rQw . 6s A R1W!r AaD2I 5!r AB BEt|rr-N)r&r'r(r)r*rKr^r,r-rrr/r/s67rmrr/cXX!- --$r%r-)r:abs rlerprcQs AE{?rcH[US-nXS-X$S--X4S--$)Nrrrr )r6)hashr7r8rPrIs rgrad3rfUs2tbyA t8aA$h qT ))rc"\rSrSrSrSSjrSrg) TileableNoiseiZzTileable implementation of Perlin "improved" noise. This is based on the reference implementation published here: http://mrl.nyu.edu/~perlin/noise/ cL[[[U5U55n[[[U5U55n[[[U5U55nUS-U-n US-U-n US-U-n U(aXe- nXu- nX- nX- n X- n X- n U[U5-nU[U5-nU[U5-nUS-XS-S- -S--n US-X"S-S- -S--n US-X3S-S- -S--nURnXnUUU-nUUU -nXnUUU-nUUU -n[ U[ U [ U [ UUU-XU5[ UUU-US- X#55[ U [ UUU-XS- U5[ UUU-US- US- U555[ U [ U [ UUU -XUS- 5[ UUU -US- X#S- 55[ U [ UUU -XS- US- 5[ UUU -US- US- US- 5555$)zTileable 3D noise. repeat specifies the integer interval in each dimension when the noise pattern repeats. base allows a different texture to be generated for the same repeat interval. rrr1rr.)r5rrrrcrf)rr7r8rPrepeatbaser"r#rQrCrDr\fxfyfzr AAAABBBABBs rr^TileableNoise.noise3as U1Xv& ' U1Xv& ' U1Xv& '!ev !ev !ev   IA IA IA JB JB JB U1X  U1X  U1X  !VqEBJ'", - !VqEBJ'", - !VqEBJ'", - G !a%[ !b&\ H !a%[ !b&\  $rAv,a0$rAv,Aq4 $rAv,q5!4$rAv,Aq1ua8  $rBw-q1u5$rBw-Qq59 $rBw-E1q59$rBw-QAq1u=   rr-N)r2)r&r'r(r)r*r^r,r-rrrhrhZs  B rrhN)r* __version__mathrrrrandomrr6_GRAD4_SIMPLEXr3r4rNrOr+rr/rcrfrh_simplexrKsnoise2r^snoise3 _tileabletnoise3r-rrrs ""   " T#Y_ T#Y# ,1+1+hB9BJ* I II X > // // O   r