
Search this API  
PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
java.lang.Object y.geom.Triangulator
public class Triangulator
This class provides algorithms for the triangulation of point sets in the plane.
Constructor Summary  

Triangulator()

Method Summary  

static Edge 
calcDelauneyTriangulation(Graph result,
DataProvider pointData,
EdgeMap revMap)
Computes a Delauney triangulation of the given points. 
static Edge 
triangulatePoints(Graph result,
DataProvider pointData,
EdgeMap reverseEdgeMap)
Computes a triangulation of the given points. 
static Edge 
triangulatePoints(YList points,
Graph result,
NodeMap resultMap,
EdgeMap reverseEdgeMap)
Computes a triangulation of the given points. 
Methods inherited from class java.lang.Object 

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

public Triangulator()
Method Detail 

public static Edge triangulatePoints(Graph result, DataProvider pointData, EdgeMap reverseEdgeMap)
result
 a graph whose nodes represent the points that need
to be triangulated.pointData
 must provide the location (YPoint) for each node in the given graph.reverseEdgeMap
 a node map that will contain for each edge its reverse
edge. If this argument is null
then no reverse edge information
will be available.
public static Edge triangulatePoints(YList points, Graph result, NodeMap resultMap, EdgeMap reverseEdgeMap)
points
 the point set to be triangulated. The points must be provided
as a YList of YPoints.result
 the resulting triangulationresultMap
 the node map that forms the link between a point and a node.reverseEdgeMap
 a node map that will contain for each edge its reverse
edge. If this argument is null
then no reverse edge information
will be available.
public static Edge calcDelauneyTriangulation(Graph result, DataProvider pointData, EdgeMap revMap)
The calculated triangulation is represented by an embedded graph, i.e. to each edge there exists a reverse edge and the outedges around each node are in embedded order. The returned edge and the (optional) reverseEdgeMap can be used to construct all faces of the plane graph and to determine its outer face.
result
 a graph whose nodes represent the points that need
to be triangulated.pointData
 must provide the location (YPoint) for each node in the given graph.revMap
 a node map that will contain for each edge its reverse
edge. If this argument is null
then no reverse edge information
will be available.

© Copyright 20002022, yWorks GmbH. All rights reserved. 

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 