Overview
Perlin Worms is a procedural generation method that turns seeds, rules, noise, or constraints into repeatable generated content. It is useful when generated content needs repeatability plus controllable variation.
Perlin Worms uses rules, noise, or constraints to synthesize repeatable generated content.
Compact metadata for implementation and discovery.
Perlin Worms is a procedural generation method that turns seeds, rules, noise, or constraints into repeatable generated content. It is useful when generated content needs repeatability plus controllable variation.
Quick facts
Runtime and memory behavior at a glance.
Best
O(n)
Average
O(n)
Worst
O(n^2)
Space
O(n)
position_next = position + direction(noise(position)) * step_sizeAdvances a tunnel or vein path through a noise-guided direction field.
Show the generated structure growing or resolving from seed values and rules.
Perlin Worms operates in O(n) time and O(n) space within the Procedural Generation family. Key governing relation: position_next = position + direction(noise(position)) * step_size. Often compared with Perlin Noise and Wave Function Collapse.
What each reference supports for this entry.
Original Perlin noise reference supporting coherent procedural paths and noise-driven structures.
Open sourceProcedural texturing reference supporting Perlin Worms noise, tiling, terrain, growth, or pattern-generation mechanism.
Good next jumps from the relationship graph, ranked for useful discovery.
Perlin Worms and Perlin Noise address nearby procedural generation problems but make different implementation tradeoffs.