patriciogonzalezvivo

Please consider using http://lygia.xyz instead of copy/pasting this functions. It expand suport for voronoi, voronoise, fbm, noise, worley, noise, derivatives and much more, through simple file dependencies. Take a look to https://github.com/patriciogonzalezvivo/lygia/tree/main/generative

Generic 1,2,3 Noise

float rand(float n){return fract(sin(n) * 43758.5453123);}

float noise(float p){
	float fl = floor(p);
  float fc = fract(p);

KdotJPG

/**
 * K.jpg's OpenSimplex 2, smooth variant ("SuperSimplex")
 *
 * More language ports, as well as legacy 2014 OpenSimplex, can be found here:
 * https://github.com/KdotJPG/OpenSimplex2
 */

public class OpenSimplex2S {

    private static final long PRIME_X = 0x5205402B9270C86FL;

selfsame

Generating Procedural Game Worlds with Wave Function Collapse

Wave Function Collapse (WFC) by @exutumno is a new algorithm that can generate procedural patterns from a sample image. It's especially exciting for game designers, letting us draw our ideas instead of hand coding them. We'll take a look at the kinds of output WFC can produce and the meaning of the algorithm's parameters. Then we'll walk through setting up WFC in javascript and the Unity game engine.

The traditional approach to this sort of output is to hand code algorithms that generate features, and combine them to alter your game map. For example you could sprinkle some trees at random coordinates, draw roads with a brownian motion, and add rooms with a Binary Space Partition. This is powerful but time consuming, and your original vision can someti

Eiyeron

import hxd.snd.Data;
import hxd.res.Sound;

// This class should work like a Sound. Jsut create one and call play and a lo-fi generated tune should ring.
// You can check out a bit more about bytebeat there : http://countercomplex.blogspot.com/2011/10/algorithmic-symphonies-from-one-line-of.html
class CustomSound extends Sound {
    public function new() {
        super(null);
        data = new SoundDataGenerator();
    }

banksean

// Ported from Stefan Gustavson's java implementation
// http://staffwww.itn.liu.se/~stegu/simplexnoise/simplexnoise.pdf
// Read Stefan's excellent paper for details on how this code works.
//
// Sean McCullough banksean@gmail.com

/**
 * You can pass in a random number generator object if you like.
 * It is assumed to have a random() method.
 */

joelverhagen

This is a plugin meant for Jekyll.

Example use:

Easily embed a YouTube video. Just drop this file in your _plugins directory.

{% youtube oHg5SJYRHA0 %}

hamaluik

package ;
import openfl.display.Sprite;

/**
 * ...
 * @author Kenton Hamaluik
 */
class AABB
{
	public var center:Vector = new Vector();

hamaluik

package ;
import openfl.display.Sprite;

/**
 * ...
 * @author Kenton Hamaluik
 */
class AABB
{
	public var center:Vector = new Vector();

snorpey

// Ported to JavaScript from 
// http://www.migapro.com/circle-and-rotated-rectangle-collision-detection/
//
// An example:
// var circle: { x: 20, y: 10, radius: 20 };
// var rect: { x: 30, y: 30, width: 100, height: 100, rotation: Math.PI / 2 };
// collideCircleWithRotatedRectangle( circle, rect );
// // returns true.
// 
//

jamis

# Recursive backtracking algorithm for maze generation. Requires that
# the entire maze be stored in memory, but is quite fast, easy to
# learn and implement, and (with a few tweaks) gives fairly good mazes.
# Can also be customized in a variety of ways.

DIRS     = (N, S, E, W = 1, 2, 4, 8)
DX       = { E => 1, W => -1, N =>  0, S => 0 }
DY       = { E => 0, W =>  0, N => -1, S => 1 }
OPPOSITE = { E => W, W =>  E, N =>  S, S => N }