Simplex noise

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Simplex noise is a method for constructing an n-dimensional noise function comparable to Perlin noise ("classic" noise) but with a lower computational overhead, especially in larger dimensions. Ken Perlin designed the algorithm in 2001[1] to address the limitations of his classic noise function, especially in higher dimensions.

The advantages of simplex noise over Perlin noise:

  • Simplex noise has a lower computational complexity and requires fewer multiplications.
  • Simplex noise scales to higher dimensions (4D, 5D) with much less computational cost, the complexity is O(n^2) for n dimensions instead of the O(2^n) of classic noise.[2]
  • Simplex noise has no noticeable directional artifacts (is isotropic).
  • Simplex noise has a well-defined and continuous gradient everywhere that can be computed quite cheaply.
  • Simplex noise is easy to implement in hardware.

Whereas classical noise interpolates between the values from the surrounding hypergrid end points (i.e., north, south, east and west in 2D), simplex noise divides the space into simplices (i.e., n-dimensional triangles) to interpolate between. This reduces the number of data points. While a hypercube in n dimensions has 2^n corners, a simplex in n dimensions has only n + 1 corners. The triangles are equilateral in 2D, but in higher dimensions the simplices are only approximately regular.

Simplex noise is useful for computer graphics applications, where noise is usually computed over 2, 3, 4 or possibly 5 dimensions. For higher dimensions, n-spheres around n-simplex corners are not densely enough packed, reducing the support of the function and making it zero in large portions of space.

See also[edit]

References[edit]

  1. ^ Ken Perlin, Noise hardware. In Real-Time Shading SIGGRAPH Course Notes (2001), Olano M., (Ed.). (pdf)
  2. ^ Ken Perlin, Making noise. Based on a talk presented at GDCHardcore (Dec 9, 1999). (url)

External links[edit]