Voronoi Diagram Library

Library to create voronoi diagrams in Unity3D.

Build status:

Building

The solution has a reference set for UnityEngine.dll, but the path for this assembly is not set. To build the library, a reference path must be set to the Managed directory (Default is C:\Program Files\Unity\Editor\Data\Managed).

Additionally, this library is also dependent on the library from PixelsForGlory/Extensions. The dependency can be resolved manually by downloading the library from the latest release.

Installation

From a build or downloaded release, copy the VoronoiDiagram.dll to [PROJECT DIR]\Assets\Plugins.

If using the Pixels for Glory NuGet repository, install the PixelsForGlory.VoronoiDiagram package into your own class library project or install the PixelsForGlory.Unity3D.VoronoiDiagram package into a Unity3D project.

Usage

The following code:

using PixelsForGlory.ComputationalSystem;

int width = 4096;
int height = 4096;

var voronoiDiagram = new VoronoiDiagram<Color>(new Rect(0f, 0f, width, height));    

var points = new List<Vector2>();
while(points.Count < 1000)
{
    int randX = Random.Range(0, width - 1);
    int randY = Random.Range(0, height - 1);

    var point = new Vector2(randX, randY);
    if(!points.Any(item => item.Coordinate == point))
    {
        points.Add(new VoronoiDiagramSite<Color>(point, new Color(Random.Range(0f, 1f), Random.Range(0f, 1f), Random.Range(0f, 1f));
    }
}

voronoiDiagram.AddPoints(points);
voronoiDiagram.GenerateSites(2);

var outImg = new Texture2D(width, height);
outImg.SetPixels(voronoiDiagram.Get1DSampleArray().ToArray());
outImg.Apply();

System.IO.File.WriteAllBytes("diagram.png", outImg.EncodeToPNG());

Will create a image similar to:

Additional information can be stored with a site through the generic type parameter. This is accessed through the SiteData property.

Citations:

Fortune's Algorithm as outlined in: Steve J. Fortune (1987). "A Sweepline Algorithm for Voronoi Diagrams". Algorithmica 2, 153-174.

Lloyd's algorithm as outlined in: Lloyd, Stuart P. (1982), "Least squares quantization in PCM", IEEE Transactions on Information Theory 28 (2): 129–137

Monotone Chain Convex Hull Algorithm outlined in: A. M. Andrew, "Another Efficient Algorithm for Convex Hulls in Two Dimensions", Info. Proc. Letters 9, 216-219 (1979)

Based off of:

as3delaunay