utils/earcut library

Classes

Earcut
Node

Functions

area(Node? p, Node? q, Node? r) double
compareX(dynamic a, dynamic b) int
cureLocalIntersections(dynamic start, dynamic triangles, dynamic dim) → dynamic
earcutLinked(Node? ear, List<num> triangles, int dim, double minX, double minY, [double? invSize, int? pass]) → void
eliminateHole(dynamic hole, dynamic outerNode) → dynamic
eliminateHoles(dynamic data, dynamic holeIndices, dynamic outerNode, dynamic dim) → dynamic
equals(Node? p1, Node? p2) bool
filterPoints([Node? start, Node? end]) Node?
findHoleBridge(dynamic hole, dynamic outerNode) → dynamic
getLeftmost(Node start) Node?
indexCurve(Node start, dynamic minX, dynamic minY, dynamic invSize) → void
insertNode(int i, double x, dynamic y, Node? last) Node
intersects(dynamic p1, dynamic q1, dynamic p2, dynamic q2) → dynamic
intersectsPolygon(dynamic a, dynamic b) → dynamic
isEar(Node ear) bool
isEarHashed(dynamic ear, dynamic minX, dynamic minY, dynamic invSize) bool
isValidDiagonal(Node a, Node b) bool
linkedList(dynamic data, int start, int end, int dim, bool clockwise) Node?
locallyInside(dynamic a, dynamic b) → dynamic
middleInside(Node a, Node b) bool
onSegment(dynamic p, dynamic q, dynamic r) → dynamic
pointInTriangle(double ax, double ay, double bx, double by, double cx, double cy, double px, double py) bool
removeNode(Node? p) → void
sectorContainsSector(Node m, Node p) → dynamic
sign(num num) int
signedArea(List<double> data, int start, int end, int dim) double
sortLinked(dynamic list) → dynamic
splitEarcut(dynamic start, dynamic triangles, dynamic dim, dynamic minX, dynamic minY, dynamic invSize) → dynamic
splitPolygon(Node a, Node b) Node
zOrder(double x0, double y0, double minX, double minY, double invSize) int