org.openimaj.math.geometry.triangulation

## Class Voronoi

• ```public class Voronoi
extends Object```
Static methods for the computation of a Voronoi diagram (aka Dirichlet tessellation) from a set of points. Internally, these use Fortune's algorithm to do the work.
Author:
Jonathon Hare (jsh2@ecs.soton.ac.uk)
"http://en.wikipedia.org/wiki/Fortune%27s_algorithm"
• ### Method Summary

All Methods
Modifier and Type Method and Description
`static List<Line2d>` `computeVoronoiEdges(List<? extends Point2d> points)`
Compute the Voronoi diagram as a list of its edges
`static List<Line2d>` ```computeVoronoiEdges(List<? extends Point2d> points, double width, double height)```
Compute the Voronoi diagram as a list of its edges
`static org.jgrapht.Graph<Point2d,org.jgrapht.graph.DefaultEdge>` `computeVoronoiGraph(List<? extends Point2d> points)`
Compute the Voronoi diagram as a graph of its vertices
`static org.jgrapht.Graph<Point2d,org.jgrapht.graph.DefaultEdge>` ```computeVoronoiGraph(List<? extends Point2d> points, double width, double height)```
Compute the Voronoi diagram as a graph of its vertices
• ### Methods inherited from class java.lang.Object

`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`
• ### Method Detail

• #### computeVoronoiGraph

`public static org.jgrapht.Graph<Point2d,org.jgrapht.graph.DefaultEdge> computeVoronoiGraph(List<? extends Point2d> points)`
Compute the Voronoi diagram as a graph of its vertices
Parameters:
`points` - the vertices
Returns:
the graph
• #### computeVoronoiGraph

```public static org.jgrapht.Graph<Point2d,org.jgrapht.graph.DefaultEdge> computeVoronoiGraph(List<? extends Point2d> points,
double width,
double height)```
Compute the Voronoi diagram as a graph of its vertices
Parameters:
`points` - the vertices
`width` - the width of the diagram
`height` - the height of the diagram
Returns:
the graph
• #### computeVoronoiEdges

`public static List<Line2d> computeVoronoiEdges(List<? extends Point2d> points)`
Compute the Voronoi diagram as a list of its edges
Parameters:
`points` - the vertices
Returns:
the graph
• #### computeVoronoiEdges

```public static List<Line2d> computeVoronoiEdges(List<? extends Point2d> points,
double width,
double height)```
Compute the Voronoi diagram as a list of its edges
Parameters:
`points` - the vertices
`width` - the width of the diagram
`height` - the height of the diagram
Returns:
the graph