This class provides algorithms for the triangulation of point sets in the plane.
public function Triangulator(init:Boolean = true) Parameters | init:Boolean (default = true) |
public static function calcDelauneyTriangulation(result:Graph, pointData:DataProvider, revMap:EdgeMap):Edge
Computes a Delauney triangulation of the given points.
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
| result:Graph — a graph whose nodes represent the points that need to be triangulated.
|
| |
| pointData:DataProvider — must provide the location (YPoint) for each node in the given graph.
|
| |
| revMap:EdgeMap — 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.
|
Returns | Edge — an edge on the outer face of the result graph.
|
override public function getClass():ClassReturns protected final function initTriangulator():void public static function newTriangulator():TriangulatorReturns public static function triangulatePoints(result:Graph, pointData:DataProvider, reverseEdgeMap:EdgeMap):Edge
Computes a triangulation of the given points.
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
| result:Graph — a graph whose nodes represent the points that need to be triangulated.
|
| |
| pointData:DataProvider — must provide the location (YPoint) for each node in the given graph.
|
| |
| reverseEdgeMap:EdgeMap — 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.
|
Returns | Edge — an edge on the outer face of the result graph.
|
public static function triangulatePoints2(points:YList, result:Graph, resultMap:NodeMap, reverseEdgeMap:EdgeMap):Edge
Computes a triangulation of the given points.
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
| points:YList — the point set to be triangulated. The points must be provided as a YList of YPoints.
|
| |
| result:Graph — the resulting triangulation
|
| |
| resultMap:NodeMap — the node map that forms the link between a point and a node.
|
| |
| reverseEdgeMap:EdgeMap — 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.
|
Returns | Edge — an edge on the outer face of the result graph.
|
Wed Oct 7 2015, 04:43 PM +02:00 
YObject 
Hide Inherited Public Methods
Show Inherited Public Methods