|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.hermit.geometry.voronoi.Fortune
public abstract class Fortune
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 |
---|
public Fortune()
Method Detail |
---|
public static Graph ComputeVoronoiGraph(java.lang.Iterable<Point> points)
points
- The data points.
public static Graph ComputeVoronoiGraph(Point[] points)
points
- The data points.
public static Graph FilterVG(Graph graph, double min)
graph
- The graph to filter.min
- The minimum data point separation for any
edge we wish to keep.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |