Maths.PseudoRandom

Create a circle packing on the interior of a disc.

Create a hexagonal pattern of circles with radius 1 around the origin.

Create an octogonal pattern of circles with varying radii around the origin.

Create a hexagonal pattern of circles with radius 1 around the origin.

Create a circle packing on the interior of a disc.

Place circles on point coordinates assumed to lie on a sphere with origin at (0,0,0).

Create a new instance of a specific generator.

Dilates the specified array of 3D points outward from a given origin so that all points remain within the defined box dimensions, and retains only the specified number of points closest to the origin after dilation.

Spatially inflate an array of points until all but N are outside a circle.

Spatially inflate an array of points until all but N are outside a circle.

Spatially inflate an array of points until all but N are outside an axis aligned rectangle.

Spatially inflate an array of points until all but N are outside an axis aligned rectangle.

Spatially inflate an array of points until all but N are outside an axis aligned rectangle.

Dilates a specified number of points within a defined spherical region, scaling their positions relative to a center point.

Generates the coordinates of a Fibonacci point sampling on the upper half of the unit sphere.

Generates the coordinates of a Fibonacci point sampling on the unit disc.

Generates the coordinates of a Fibonacci point sampling on the unit sphere.

Generates the coordinates of a Fibonacci point sampling on the unit square.

Create a human-centric string which describes a certain random algorithm.

Try and parse a random engine by name.

Create a two-dimensional Poisson sampling with a variable separation radius. This algorithm relies on slow spatial lookup of neighbouring coordinates since no assumptions can be made regarding the minimum allowed spacing across the entire field. As a result this method probably will not yield the same distribution as the Poisson2D method which takes a constant radius value.

Create a two-dimensional Poisson sampling with a constant separation radius.

Randomly populate a one-dimensional interval. This method works by randomly dividing the longest remaining interval into two until a fixed number of values has been found.

Generate an enumeration of random, non-negative integers.

Generate an enumeration of random, non-negative integers.

Generate an enumeration of random, non-negative integers.

Generate an enumeration of random, non-negative integers.

Generate an enumeration of random, non-negative integers.

Generate an enumeration of random, non-negative integers.

Generate an enumeration of random, non-negative integers.

Generate an enumeration of random, non-negative integers.

Create a Van Der Corput distribution within the unit cube.

Generates the coordinates of a van der Corput Quasi random point set on the unit square. The distances between adjacent points are more similar than using a strict pseudo-random distribution, not quite as good as a Poisson distribution but very fast. The x coordinates increase steadily from zero to (n-1)/n, whereas the associated y coordinates are spread out using a quasi-mote-carlo pattern.