Houdini 21.0 Nodes Copernicus nodes

Worley Noise 3D Copernicus node

Generates Worley noise from 3D locations.

On this page

This node generates a noise pattern using Worley noise . Worley noise is useful for producing cellular patterns. Unlike the Worley Noise COP, the source location is the pixel’s world coordinates instead of its image coordinates.

Parameters

Element Size

The size (in world coordinates) of the basic element of the noise. You can turn on the Per-Component Controls button to adjust this further using the Element Scale parameter.

Element Scale

When the Per-Component Controls button is on, this is the per-axis scaling of the element size for anistropic noise.

Jitter

The amount of random noise to add to each point’s position on a grid. The random noise is added before the Worley noise measures the distance to the points. You can turn on the Per-Component Controls button to adjust this further using the Jitter Scale parameter.

Note

Values greater than 1 may produce artifacts because they jitter past the search radius.

Jitter Scale

When the Per-Component Controls button is on, this is the per-axis scaling of the jitter.

Metric

The metric for computing the distance to a point.

Euclidean

Use the length of the line segment between the two axial points to define the distance between the two points. This can result in circular shapes. See Euclidean distance for more information.

Manhattan

Use the sum of the differences between the two axial points to define the distance between the two points. This can result in diamond shapes. See Taxicab geometry for more information.

Chebyshev

Use the maximum difference between the two axial points to define the distance between the two points. This can result in square shapes. See Chebyshev distance for more information.

Offset

The amount to offset the entire noise function in world coordinates.

Post Processing

Note

The node applies the post-processing operations in the order they're listed.

Complement

Sets the pixel value x to 1 - x.

Note

This method works for values in the 0 to 1 range. For images outside of this range, using Complement results in negative or out of range values.

Bias

The amount to pull the medium grey values (around 0.5) towards zero (if Bias is less than 1) or one (if Bias is greater than 1). A bias value of 0.5 doesn’t affect the values.

Gain

The amount to pull the medium grey values (around 0.5) together, while values around 0 and 1 are pulled apart. A gain value of 0.5 doesn’t affect the noise values.

Gamma

The overall gamma of the generated noise. Values greater than 1 increase the range of values in originally bright areas, which darkens the noise. Values less than 1 stretch out the range of values for originally dark areas, which increases the overall brightness of the noise.

Contrast

The amount to expand or shrink the overall range of tonal values. Each noise value is pushed towards (if Contrast is less than 1) or away from (if Contrast is greater than 1) medium grey values (around 0.5).

Note

This is not the same as Noise Contrast, which appears in some noise nodes and applies contrast during the noise function.

Clamp Minimum

Clamps values below the specified threshold.

Clamp Maximum

Clamps values exceeding the specified threshold.

Inputs

size_ref

A representative layer that determines the size of the output image and controls the metadata.

pos

An RGB layer or Vector VDB for the position of each pixel to evaluate the noise at.

Outputs

dist1

A Mono layer or VDB with distance to the nearest point.

dist2

A Mono layer or VDB with the distance to the second nearest point. Commonly dist2 - dist1 is used as a border estimate.

border

An SDF Mono or VDB layer storing the exact distance to the border between the two closest points.

Because this is a 2d slice of a 3d cell, the distance function will appear to have non-uniform sizes if the boundary plane isn’t perpendicular to the layer.

center

A RGB layer or VDB storing the image coordinates of the closest grid point.

id

An ID layer or VDB storing the hash of the closest grid point. Note this can be negative.

See also

Copernicus nodes