This class provides algorithms for the triangulation of point sets in the plane.
Inheritance Hierarchy
TriangulationAlgorithm
Type Details
- yfiles module
- algorithms
- yfiles-umd modules
- All layout modules, view-layout-bridge
- Legacy UMD name
- yfiles.algorithms.Triangulator
Static Methods
Computes a Delauney triangulation of the given points.
Remarks
A Delauney triangulation is a triangulation such that none of the given points is inside the circumcircle of any of the calculated triangles.
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.
Parameters
options - Object
A map of options to pass to the method.
A map of options to pass to the method.
- result - Graph
- a graph whose nodes represent the points that need to be triangulated.
- pointData - IDataProvider
- must provide the location (YPoint) for each node in the given graph.
- revMap - IEdgeMap
- a node map that will contain for each edge its reverse edge. If this argument is
nullthen no reverse edge information will be available.
Returns
- ↪Edge
- an edge on the outer face of the result graph.
Computes a triangulation of the given points.
Remarks
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.
Parameters
options - Object
A map of options to pass to the method.
A map of options to pass to the method.
- result - Graph
- a graph whose nodes represent the points that need to be triangulated.
- pointData - IDataProvider
- must provide the location (YPoint) for each node in the given graph.
- reverseEdgeMap - IEdgeMap
- a node map that will contain for each edge its reverse edge. If this argument is
nullthen no reverse edge information will be available.
Returns
- ↪Edge
- an edge on the outer face of the result graph.
triangulatePoints
(points: YList, result: Graph, resultMap: INodeMap, reverseEdgeMap: IEdgeMap) : EdgeComputes a triangulation of the given points.
Remarks
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.
Parameters
options - Object
A map of options to pass to the method.
A map of options to pass to the method.
- points - YList
- the point set to be triangulated. The points must be provided as a YList of YPoints.
- result - Graph
- the resulting triangulation
- resultMap - INodeMap
- the node map that forms the link between a point and a node.
- reverseEdgeMap - IEdgeMap
- a node map that will contain for each edge its reverse edge. If this argument is
nullthen no reverse edge information will be available.
Returns
- ↪Edge
- an edge on the outer face of the result graph.