Voronoi (squidlib-util 3.0.0)

java.lang.Object

squidpony.squidmath.Voronoi

All Implemented Interfaces:: Serializable

public class Voronoi
extends Object
implements Serializable

A Java implementation of both a 2D Delaunay triangulation algorithm and a Voronoi polygon data structure. This is a port of Johannes Diemke's code, with modifications suggested by Amit Patel to consolidate the triangles with a barycentric dual mesh.

Author:: Johannes Diemke, Tommy Ettinger
See Also:: Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type Class Description

static class Voronoi.Edge

static class Voronoi.Polygon

static class Voronoi.Triangle

Constructor Summary

Constructors
Constructor	Description
`Voronoi()`	Constructs a triangulator instance but does not insert any points; you should add points to `getPointSet()` before running `triangulate()`.
`Voronoi(OrderedSet<CoordDouble> pointSet)`	Constructs a new triangulator instance using the specified point set.

Method Summary

Modifier and Type	Method	Description
`OrderedSet<CoordDouble>`	`getPointSet()`	Returns the point set in form of a vector of 2D vectors.
`ArrayList<Voronoi.Triangle>`	`getTriangles()`	Returns the triangles of the triangulation in form of a list of 2D triangles.
`ArrayList<Voronoi.Polygon>`	`polygonize()`
`void`	`reorder(int[] permutation)`	Shuffles the point set using a custom permutation sequence.
`void`	`shuffle(IRNG rng)`	Creates a random permutation of the specified point set.
`ArrayList<Voronoi.Triangle>`	`triangulate()`	This method generates a Delaunay triangulation from the specified point set.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details
- Voronoi
  
  public Voronoi()
  
  Constructs a triangulator instance but does not insert any points; you should add points to getPointSet() before running triangulate().
- Voronoi
  
  public Voronoi(OrderedSet<CoordDouble> pointSet)
  
  Constructs a new triangulator instance using the specified point set.
  
  Parameters:
  
  pointSet - The point set to be triangulated
Method Details
- triangulate
  
  public ArrayList<Voronoi.Triangle> triangulate()
  
  This method generates a Delaunay triangulation from the specified point set.
- polygonize
  
  public ArrayList<Voronoi.Polygon> polygonize()
- shuffle
  
  public void shuffle(IRNG rng)
  
  Creates a random permutation of the specified point set. Based on the implementation of the Delaunay algorithm, this can speed up the computation.
- reorder
  
  public void reorder(int[] permutation)
  
  Shuffles the point set using a custom permutation sequence.
  
  Parameters:
  
  permutation - The permutation used to shuffle the point set
- getPointSet
  
  public OrderedSet<CoordDouble> getPointSet()
  
  Returns the point set in form of a vector of 2D vectors.
  
  Returns:
  
  Returns the points set.
- getTriangles
  
  public ArrayList<Voronoi.Triangle> getTriangles()
  
  Returns the triangles of the triangulation in form of a list of 2D triangles.
  
  Returns:
  
  Returns the triangles of the triangulation.