Diamond-square algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Plasma fractal
Animated plasma fractal

The diamond-square algorithm is a method for generating heightmaps for computer graphics. It is a slightly better algorithm than the three-dimensional implementation of the midpoint displacement algorithm which produces two-dimensional landscapes. It is also known as the random midpoint displacement fractal, the cloud fractal or the plasma fractal, because of the plasma effect produced when applied.

The idea was first introduced by Fournier, Fussell and Carpenter at SIGGRAPH 1982.[1]

The diamond-square algorithm starts with a 2D grid then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares.

The Algorithm[edit]

The diamond-square algorithm begins with a 2D array of size 2n + 1. The four corner points of the array must firstly be set to initial values. The diamond and square steps are then performed alternately until all array values have been set.

The diamond step. For each square in the array, set the midpoint of that square to be the average of the four corner points plus a random value.

The square step. For each diamond in the array, set the midpoint of that diamond to be the average of the four corner points plus a random value.

At each iteration, the magnitude of the random value should be reduced.

During the square steps, points located on the edges of the array will have only three adjacent values set rather than four. There are a number of ways to handle this complication - the simplest being to take the average of just the three adjacent values. Another option is to 'wrap around', taking the fourth value from the other side of the array. When used with consistent initial corner values this method also allows generated fractals to be stitched together without discontinuities.

Visualization[edit]

The image below shows the steps involved in running the diamond-square algorithm on a 5 × 5 array.

Visualization of the Diamond Square Algorithm

Applications[edit]

This algorithm can be used to generate realistic-looking landscapes, and different implementations are used in computer graphics software such as Terragen.

Artifacts and Extensions[edit]

The diamond-square algorithm was analyzed by Gavin S. P. Miller in SIGGRAPH 1986[2] who described it as flawed because the algorithm produces noticeable vertical and horizontal "creases" due to the most significant perturbation taking place in a rectangular grid. The grid artifacts were addressed in a generalized algorithm introduced by J.P. Lewis.[3] In this variant the weights on the neighboring points are obtained by solving a small linear system motivated by estimation theory, rather than being fixed. The Lewis algorithm also allows the synthesis of non-fractal heightmaps such as rolling hills or ocean waves. Similar results can be efficiently obtained with Fourier synthesis,[4] although the possibility of adaptive refinement is lost. The diamond-square algorithm and its refinements are reviewed in the book.[4]

References[edit]

  1. ^ Fournier, Alain; Fussell, Don; Carpenter, Loren (June 1982). "Computer rendering of stochastic models". Communications of the ACM 25 (6): 371–384. doi:10.1145/358523.358553. 
  2. ^ Miller, Gavin S. P. (August 1986). "The definition and rendering of terrain maps". ACM SIGGRAPH Computer Graphics 20 (4): 39–48. doi:10.1145/15886.15890. 
  3. ^ Lewis, J. P. (1 July 1987). "Generalized stochastic subdivision". ACM Transactions on Graphics 6 (3): 167–190. doi:10.1145/35068.35069. 
  4. ^ a b Peitgen, Heinz-Otto, Dietmar Saupe (1988). The Science of fractal images. New York: Springer-Verlag. ISBN 0-387-96608-0. 

External links[edit]