org.hermit.geometry.voronoi
Class Fortune

java.lang.Object
  extended by org.hermit.geometry.voronoi.Fortune

public abstract class Fortune
extends java.lang.Object

Fortune's algorithm for generating a Voronoi diagram.

This class takes a set of points in the plane and generates the corresponding Voronoi diagram using Fortune's algorithm.


Constructor Summary
Fortune()
           
 
Method Summary
static Graph ComputeVoronoiGraph(java.lang.Iterable<Point> points)
          Compute the Voronoi diagram for the given set of points.
static Graph ComputeVoronoiGraph(Point[] points)
          Compute the Voronoi diagram for the given set of points.
static Graph FilterVG(Graph graph, double min)
          Filter the given graph, removing any edges whose data points are closer than min.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

Fortune

public Fortune()
Method Detail

ComputeVoronoiGraph

public static Graph ComputeVoronoiGraph(java.lang.Iterable<Point> points)
Compute the Voronoi diagram for the given set of points.

Parameters:
points - The data points.
Returns:
A Graph representing the generated diagram.

ComputeVoronoiGraph

public static Graph ComputeVoronoiGraph(Point[] points)
Compute the Voronoi diagram for the given set of points.

Parameters:
points - The data points.
Returns:
A Graph representing the generated diagram.

FilterVG

public static Graph FilterVG(Graph graph,
                             double min)
Filter the given graph, removing any edges whose data points are closer than min.

Parameters:
graph - The graph to filter.
min - The minimum data point separation for any edge we wish to keep.
Returns:
A new Graph, represenging the filtered input graph.