(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.

(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 science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).

Synonym of Ramer-Douglas-Peucker algorithm

An extension to the Euclidean algorithm, which computes the coefficients of Bézout's identity in addition to the greatest common divisor of two integers.

(statistics) A Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult.

(computing theory) A certain unsupervised learning algorithm for neural networks, having separate "wake" and "sleep" phases that attempt to connect the layers of neurons in alternating directions.

(computing theory) A heuristic algorithm for finding partitions of graphs, having important applications in the layout of digital circuits and components in VLSI.

(computing theory) An iterative heuristic algorithm for bipartitioning a hypergraph.

(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.