WeilerAtherton

WeilerAtherton is a computational technique used in computer graphics for generating realistic terrain surfaces. Developed by Paul Weiler and Ian Atherton, it is a type of fractal terrain generation algorithm. The core idea behind WeilerAtherton is to start with a simple geometric shape, often a square or a triangle, and then iteratively subdivide it, adding random displacements at each step to create the appearance of natural topographical features.

The algorithm works by recursively applying a set of rules to subdivide existing faces of the terrain mesh. At each subdivision, new vertices are introduced, and their heights are determined based on a combination of randomness and a "roughness" parameter. This parameter controls how jagged or smooth the resulting terrain will be. Higher roughness values lead to more detailed and rugged landscapes, while lower values produce gentler slopes.

One of the key advantages of the WeilerAtherton algorithm is its ability to generate highly detailed terrain with a relatively low computational cost, especially when compared to some earlier methods. It can produce a wide variety of terrain types, from rolling hills to mountainous regions, by adjusting parameters like the initial shape, the number of subdivision levels, and the random displacement functions. The algorithm has been influential in the field of computer graphics, finding applications in video games, simulations, and visual effects for its efficient and controllable terrain synthesis capabilities.