View source

class Triangle

package hxd.poly2tri

@:directlyUsed

Static methods

staticrotateTrianglePair(t:Triangle, p:Point, ot:Triangle, op:Point):Void

Rotates a triangle pair one vertex CW 



  n2                    n2



P +-----+             P +-----+
| t  /|               |\  t |
|   / |               | \   |
n1|  /  |n3           n1|  \  |n3
| /   |    after CW   |   \ |
|/ oT |               | oT \|
+-----+ oP            +-----+


  n4                    n4

Constructor

@:value({ checkOrientation : true, fixOrientation : false })new(p1:Point, p2:Point, p3:Point, fixOrientation:Bool = false, checkOrientation:Bool = true)

Variables

constrained_edge:Array<Bool>

delaunay_edge:Array<Bool>

@:value(-1)id:Int = -1

neighbors:Array<Triangle>

points:Array<Point>

Methods

clearDelunayEdges():Void

clearNeigbors():Void

containsEdgePoints(p1:Point, p2:Point):Bool

containsPoint(point:Point):Bool

Test if this Triangle contains the Point object given as parameter as its vertices.

Returns:

True if the Point objects are of the Triangle's vertices, false otherwise.

edgeIndex(p1:Point, p2:Point):Int

inlinegetConstrainedEdgeCCW(p:Point):Bool

inlinegetConstrainedEdgeCW(p:Point):Bool

inlinegetDelaunayEdgeCCW(p:Point):Bool

inlinegetDelaunayEdgeCW(p:Point):Bool

@:value({ offset : 0 })getPointIndexOffset(p:Point, offset:Int = 0):Int

inlineindex(p:Point):Int

Alias for getPointIndexOffset

Parameters:

null

p

isEdgeSide(ep:Point, eq:Point):Bool

Checks if a side from this triangle is an edge side. If sides are not marked they will be marked.

@return

Parameters:

ep
eq

@:value({ npoint : null })legalize(opoint:Point, ?npoint:Point):Void

Legalize triangle by rotating clockwise.
This method takes either 1 parameter (then the triangle is rotated around points(0)) or 2 parameters (then the triangle is rotated around the first parameter).

inlinemarkConstrainedEdgeByEdge(edge:Edge):Void

markConstrainedEdgeByPoints(p:Point, q:Point):Void

markNeighbor(t:Triangle, p1:Point, p2:Point):Void

Update neighbor pointers.
This method takes either 3 parameters (p1, p2 and t) or 1 parameter (t).

Parameters:

t

Triangle object.

p1

Point object.

p2

Point object.

markNeighborTriangle(that:Triangle):Void

inlineneighborAcross(p:Point):Triangle

The neighbor across to given point.

inlineneighborCCW(p:Point):Triangle

inlineneighborCW(p:Point):Triangle

inlineoppositePoint(t:Triangle, p:Point):Point

inlinepointCCW(p:Point):Point

inlinepointCW(p:Point):Point

inlinesetConstrainedEdgeCCW(p:Point, ce:Bool):Bool

inlinesetConstrainedEdgeCW(p:Point, ce:Bool):Bool

inlinesetDelaunayEdgeCCW(p:Point, e:Bool):Bool

inlinesetDelaunayEdgeCW(p:Point, e:Bool):Bool

toString():String