(computer graphics) An algorithm for generating heightmaps. It starts with a two-dimensional grid and then randomly generates terrain height from four seed values arranged in a grid of points so that the entire plane is covered in squares.

(Internet) An algorithm for improving the efficiency of a network by combining a number of small packets, or messages, and later sending them in a single operation.

(computer graphics) An algorithm used for line clipping. It divides a two-dimensional space into nine regions (or a three-dimensional space into 27 regions), and then efficiently determines the lines and portions of lines that are visible in the central region, or viewport.

(computer graphics) A simple rendering technique that sorts all the polygons in a scene by their depth and then paints them in that order, from farthest to closest.

(computing theory) An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n.

A pattern-matching algorithm for implementing production rule systems, used to determine which of the system's rules should fire based on its data store.

(mathematics) An iterative algorithm used to find simple approximations to functions, specifically, approximations by functions in a Chebyshev space that are the best in the uniform norm L_∞ sense.

(computing theory) A multiplication algorithm that multiplies large integers by recursively splitting them into smaller parts and performing operations on the parts.

A common recursive fast Fourier transform algorithm.

(computing theory) An asymptotically fast recursive multiplication algorithm for large integers.