Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.


This method involves getting a random dataset, sampling it at various resolutions, and adding together the result. I've heard it claimed that this is actually "Fractal Noise" or something diffe


This PDF claims that there is mass-misinformation about what Perlin Noise is, and explains a completely different method (I'm not talking about the discussion of Simplex noise at the bottom, but about his summary of Classic Perlin noise).

Who is correct?

share|improve this question
No it hasnt got infinite and self similar depths of scale variance. It is a repettetive aperiodic wave. the wave is renewed every seed = 64k or in that order of magnitude, and it is an aperiodic wave, not a fractal. –  comprehensible 2 days ago

1 Answer 1

up vote 2 down vote accepted

You can find out all about Perlin noise at the web page about it written by Ken Perlin himself. His first publication about it was the SIGGRAPH 1985 paper "An image synthesizer". He later described an improved version of the algorithm in "Improving Noise" at SIGGRAPH 2002, and has also posted source code for the reference implementation.

The basic idea is that you pick, at each lattice point $(i,j,k)$, the gradient $\mathbf g_{i,j,k}$ of the noise, determining linear functions $\mathbf g_{i,j,k}\cdot(x-i,y-j,z-k)$ which you then interpolate over the rest of the space. The first link you posted, which is regrettably one of the top search hits for "Perlin noise" in most search engines, suggests picking the value of the function and interpolating that instead. So the first link is wrong and the second link is right.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.