View source

class Sweep

package hxd.poly2tri

@:directlyUsed

Static methods

staticnextFlipPoint(ep:Point, eq:Point, ot:Triangle, op:Point):Point

Constructor

new(context:SweepContext)

Methods

edgeEventByEdge(edge:Edge, node:Node):Void

edgeEventByPoints(ep:Point, eq:Point, triangle:Triangle, point:Point):Void

fill(node:Node):Void

Adds a triangle to the advancing front to fill a hole.

Parameters:

tcx
node
  • middle node, that is the bottom of the hole

fillAdvancingFront(n:Node):Void

Fills holes in the Advancing Front

fillBasin(node:Node):Void

Fills a basin that has formed on the Advancing Front to the right of given node.
First we decide a left,bottom and right node that forms the boundaries of the basin. Then we do a reqursive fill.

Parameters:

tcx
node
  • starting node, this or next node will be left node

fillBasinReq(node:Node):Void

Recursive algorithm to fill a Basin with triangles

Parameters:

tcx
node
  • bottom_node

fillEdgeEvent(edge:Edge, node:Node):Void

fillLeftAboveEdgeEvent(edge:Edge, node:Node):Void

fillLeftBelowEdgeEvent(edge:Edge, node:Node):Void

fillLeftConcaveEdgeEvent(edge:Edge, node:Node):Void

fillLeftConvexEdgeEvent(edge:Edge, node:Node):Void

fillRightAboveEdgeEvent(edge:Edge, node:Node):Void

fillRightBelowEdgeEvent(edge:Edge, node:Node):Void

fillRightConcaveEdgeEvent(edge:Edge, node:Node):Void

fillRightConvexEdgeEvent(edge:Edge, node:Node):Void

finalizationPolygon():Void

flipEdgeEvent(ep:Point, eq:Point, t:Triangle, p:Point):Void

flipScanEdgeEvent(ep:Point, eq:Point, flip_triangle:Triangle, t:Triangle, p:Point):Void

inlineisShallow(node:Node):Bool

legalize(t:Triangle):Bool

Returns true if triangle was legalized

newFrontTriangle(point:Point, node:Node):Node

nextFlipTriangle(o:Int, t:Triangle, ot:Triangle, p:Point, op:Point):Triangle

pointEvent(point:Point):Node

Find closes node to the left of the new point and create a new triangle. If needed new holes and basins will be filled to.

sweepPoints():Void

triangulate():Void