plotboilerplate 1.27.0 → 1.28.0

package/src/_esm/utils/algorithms/PolygonInset.js

@@ -0,0 +1,428 @@
+"use strict";
+/**
+ * Calculate the inset of any non-self-overlapping polygon.
+ *
+ * The polygon may be
+ *  - convex or non-convex
+ *  - self-intersecting
+ *
+ * The algorithms will
+ *  - first construct a general offset polygon which may be corrupt due to ouf-of-bounds or in illegal-area problems.
+ *  - then dissect the possibly self-intersecting inset polygon into separate simple polygons.
+ *  - then detect for each if it's out of bounds or in some illegal area.
+ *  - keeping only the valid ones.
+ *
+ * @required sutherlandHodgman
+ * @required splitPolygonToNonIntersecting
+ *
+ * @author   Ikaros Kappler
+ * @date     2024-11-04 Ported the script to a class.
+ * @modified 2024-12-02 Ported to Typescript.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PolygonInset = void 0;
+const Line_1 = require("../../Line");
+const Polygon_1 = require("../../Polygon");
+const Vector_1 = require("../../Vector");
+const splitPolygonToNonIntersecting_1 = require("./splitPolygonToNonIntersecting");
+const sutherlandHodgman_1 = require("./sutherlandHodgman");
+class PolygonInset {
+    /**
+     * Constructs a new PolygonInset instance with the underlying given polygon to work with.
+     *
+     * Please note that the algorithm will reverse the vertex order if the given polygon
+     * is not clockwise.
+     *
+     * @param {Polygon} polygon - The polygon to calculate the offset for.
+     */
+    constructor(polygon) {
+        /**
+         * The original polygon as a sequence of line objects. This is easier to use than a list of points.
+         */
+        this.originalPolygonLines = [];
+        /**
+         * The simple inset lines, directly generated by offsetting the original polygon lines by the given amount.
+         */
+        this.insetLines = [];
+        /**
+         * The cropped inset lines that makes up the first direct iteration of the inset polygon.
+         * This one will probably be self-intersecting.
+         */
+        this.insetPolygonLines = [];
+        /**
+         * The inset polygon split up into simple non-self-intersecting polygons.
+         * Represented as a list of vertex-lists. Each sub-list represents a single polygon.
+         */
+        this.splitPolygons = [];
+        this.polygon = polygon;
+    }
+    /**
+     * This is the main method.
+     *
+     * Call this with the required option params to compute your desired offset polygon(s).
+     *
+     * @param {number} options.innerPolygonOffset - The offset to use. Should be a positive number. Correct result for negative numbers are not guaranteed.
+     * @param {number?} options.maxPolygonSplitDepth - (default is the number of polygon.vertices) The maximum amount of recursive stepts to simplify the complex first iteration of the offset polygon.
+     * @param {number?} options.intersectionEpsilon - (default is 1.0) The epsilon to use for detecting overlapping polygons. This indicates a tolerance value, because directly adjecent polygons may have a little arithmetic intersection area.
+     * @returns {Array<Array<Vertex>>} A list of vertex-lists, each one representing a simple polygon from the offset-polygons.
+     */
+    computeOutputPolygons(options) {
+        var _a;
+        // No offset implies: no change.
+        if (options.innerPolygonOffset === 0) {
+            return [this.polygon.vertices]; // No change
+        }
+        // This algorithm only works with polygon in clockwise vertex order.
+        // If the polygon is not clockwise: revert.
+        PolygonInset._assertPolygonIsClockwise(this.polygon.vertices);
+        // The potential result polygons might overlap with other parts. These are not part of the desired
+        // result set and need to be filtered out.
+        // Define an intersection-epsilon: minimal critical overlaps might result of rounding errors and
+        // don't represent real overlaps.
+        const intersectionEpsilon = options.intersectionEpsilon;
+        // This will create a deep clone
+        this.optimizedPolygon = this.polygon.clone();
+        // In case the potential result polygons are self intersecting we need to split them apart later.
+        // Using the initial vertex number as the upper split limit should be safe here.
+        const maxPolygonSplitDepth = (_a = options === null || options === void 0 ? void 0 : options.maxPolygonSplitDepth) !== null && _a !== void 0 ? _a : this.optimizedPolygon.vertices.length;
+        // For calculations of initial inset rectagles we need the original polygon's lines.
+        this.originalPolygonLines = this.optimizedPolygon.getEdges();
+        this._collectInsetLines(this.originalPolygonLines, options.innerPolygonOffset);
+        this._collectInsetPolygonLines(this.insetLines);
+        this.insetRectanglePolygons = this._collectRectangularPolygonInsets(this.originalPolygonLines, this.insetLines);
+        // Optimize inset polygon AND the insetRectanglePolygons?
+        if (options.removeEars) {
+            // console.log("Remove ears");
+            // This will modify both params!
+            PolygonInset._optimizeInsetPolygon(this.optimizedPolygon, this.insetRectanglePolygons);
+        }
+        // Create a naive first inset polygon for later optimization.
+        this.insetPolygon = PolygonInset.convertToBasicInsetPolygon(this.insetPolygonLines);
+        // // Optimize inset polygon AND the insetRectanglePolygons!
+        // if (options.removeEars) {
+        //   // This will modify both params!
+        //   PolygonInset._optimizeInsetPolygon(this.insetPolygon, this.insetRectanglePolygons);
+        // }
+        // The resulting polygon will likely intersect itself multiple times.
+        // For further calculations split apart into non-self-intersecting.
+        this.splitPolygons = (0, splitPolygonToNonIntersecting_1.splitPolygonToNonIntersecting)(this.insetPolygon.vertices, maxPolygonSplitDepth, true); // insideBoundsOnly
+        // This method was initially meant to calculate inset-polygons only.
+        // But with a simple filter we COULD also create outer offset-polygons.
+        // Maybe this is a task for the future
+        // console.log("DEBUG", DEBUG);
+        // DEBUG("TEST");
+        if (options.innerPolygonOffset < 0) {
+            // return [this.polygon.vertices]; // No change
+        }
+        // console.log("splitPolygons.length", this.splitPolygons.length);
+        // Assert all polygons are clockwise!
+        PolygonInset._assertAllPolygonsAreClockwise(this.splitPolygons);
+        this.filteredSplitPolygons = PolygonInset._filterInnerSplitPolygonsByCoverage(this.splitPolygons, this.insetRectanglePolygons, intersectionEpsilon);
+        // console.log("[0] filteredSplitPolygons.length", this.filteredSplitPolygons.length);
+        this.filteredSplitPolygons = PolygonInset._filterInnerSplitPolygonsByOriginalBounds(this.filteredSplitPolygons, this.polygon);
+        // console.log("[1] filteredSplitPolygons.length", this.filteredSplitPolygons.length);
+        return this.filteredSplitPolygons;
+    }
+    /**
+     * This method transforms each polygon line into a new line
+     * by moving it to the inside direction of the polygon (by the given `insetAmount`).
+     *
+     * @param {Array<Line>} polygonLines
+     * @param {number} insetAmount
+     * @return {Array<Line>} The transformed lines. The result array has the same length and order as the input array.
+     */
+    _collectInsetLines(polygonLines, insetAmount) {
+        const insetLines = []; // Array<Line>
+        for (var i = 0; i < polygonLines.length; i++) {
+            const line = polygonLines[i];
+            const perp = new Vector_1.Vector(line.a, line.b).perp();
+            const t = insetAmount / perp.length();
+            const offsetOnPerp = perp.vertAt(t);
+            const diff = line.a.difference(offsetOnPerp);
+            // Polygon is is clockwise order.
+            // Move line inside polygon
+            const movedLine = line.clone();
+            movedLine.a.add(diff);
+            movedLine.b.add(diff);
+            insetLines.push(movedLine);
+        }
+        this.insetLines = insetLines;
+        return insetLines;
+    }
+    /**
+     * For a sequence of inset polygon lines get the inset polygon by detecting
+     * useful intersections (by cropping or extending them).
+     *
+     * The returned lines resemble a new polygon.
+     *
+     * Please note that the returned polygon can be self-intersecting!
+     *
+     * @param {Array<Line>} insetLines
+     * @returns {Array<Line>} The cropped or exented inset polygon lines.
+     */
+    _collectInsetPolygonLines(insetLines) {
+        if (insetLines.length <= 1) {
+            return [];
+        }
+        const insetPolygonLines = [];
+        // Collect first intersection at beginning :)
+        const lastInsetLine = insetLines[insetLines.length - 1];
+        const firstInsetLine = insetLines[0];
+        let lastIntersectionPoint = lastInsetLine.intersection(firstInsetLine); // Must not be null
+        for (var i = 0; i < insetLines.length; i++) {
+            const insetLine = insetLines[i];
+            const nextInsetLine = insetLines[(i + 1) % insetLines.length];
+            // Find desired intersection
+            const intersection = insetLine.intersection(nextInsetLine);
+            if (intersection == null) {
+                console.warn("[collectInsetPolygon] WARN intersection line must not be null", i, nextInsetLine);
+            }
+            else {
+                // By construction they MUST have any non-null intersection!
+                if (lastIntersectionPoint != null) {
+                    const resultLine = new Line_1.Line(lastIntersectionPoint, intersection);
+                    insetPolygonLines.push(resultLine);
+                }
+            }
+            lastIntersectionPoint = intersection;
+        }
+        // Store intermediate result for later retrieval.
+        this.insetPolygonLines = insetPolygonLines;
+        return insetPolygonLines;
+    }
+    /**
+     * Converts two lists (same length) of original polygon lines and inset lines (interpreted as
+     * pairs) to a list of rectangular polyons.
+     *
+     * @static
+     * @param {Array<Line>} originalPolygonLines
+     * @param {Array<Line>} insetLines
+     * @returns {Array<Polygon>} A list of rectangular polygons; each returned polyon has exactly four vertices.
+     */
+    _collectRectangularPolygonInsets(originalPolygonLines, insetLines) {
+        // Convert to rectangle polygon
+        const insetRectanglePolygons = originalPolygonLines.map((polygonLine, index) => {
+            const rectPolygon = new Polygon_1.Polygon([], false);
+            // Add in original order
+            rectPolygon.vertices.push(polygonLine.a.clone());
+            rectPolygon.vertices.push(polygonLine.b.clone());
+            // Add in reverse order
+            const insetLine = insetLines[index];
+            rectPolygon.vertices.push(insetLine.b.clone());
+            rectPolygon.vertices.push(insetLine.a.clone());
+            return rectPolygon;
+        });
+        return insetRectanglePolygons;
+    }
+    /**
+     * Converts a sequence of (hopefully adjacent) lines to a polygon by using all second line vertices `b`.
+     *
+     * @static
+     * @param insetPolygonLines
+     * @returns
+     */
+    static convertToBasicInsetPolygon(insetPolygonLines) {
+        const insetPolygon = new Polygon_1.Polygon([], false);
+        insetPolygonLines.forEach((insetLine) => {
+            insetPolygon.vertices.push(insetLine.a);
+        });
+        return insetPolygon;
+    }
+    /**
+     * Filter split polygons: only keep those whose vertices are all contained inside the original polygon.
+     * Reason: scaling too much will result in excessive translation beyond the opposite bounds of the polygon (like more than 200% of possible insetting).
+     *
+     * @param {Array<Array<Vertex>>} splitPolygonsVertices
+     * @param {Polygon} originalPolygon
+     * @return {Array<Array<Vertex>>} The filtered polygon list.
+     */
+    static _filterInnerSplitPolygonsByOriginalBounds(splitPolygonsVertices, originalPolygon) {
+        return splitPolygonsVertices.filter((splitPolyVerts, _splitPolyIndex) => {
+            return splitPolyVerts.every((splitPVert) => {
+                return originalPolygon.containsVert(splitPVert);
+            });
+        });
+    }
+    /**
+     * Filter split polygons: only keep those that do not (signifiantly) interset with any rectangles.
+     *
+     * @static
+     * @param {Array<Array<Vertex>>} splitPolygonsVertices
+     * @param {Array<Polygon>} insetRectanglePolygons
+     * @param {number?=1.0} intersectionEpsilon - (optional, default is 1.0) A epsislon to define a tolerance for checking if two polygons intersect.
+     */
+    static _filterInnerSplitPolygonsByCoverage(splitPolygonsVertices, insetRectanglePolygons, intersectionEpsilon) {
+        // TEST: Add some jitter
+        // splitPolygonsVertices.forEach(split => {
+        //   split.forEach(vert => {
+        //     vert.x += (0.5 - Math.random()) * 0.01;
+        //     vert.y += (0.5 - Math.random()) * 0.01;
+        //   });
+        // });
+        splitPolygonsVertices.forEach((split, index) => {
+            const isCW = Polygon_1.Polygon.utils.isClockwise(split);
+            if (!isCW) {
+                console.warn("------ split is not isClockwise!", index, isCW);
+            }
+        });
+        insetRectanglePolygons.forEach((rect, index) => {
+            const isCW = rect.isClockwise();
+            if (!isCW) {
+                console.warn("------ rect is not isClockwise!", index, isCW);
+            }
+        });
+        const eps = intersectionEpsilon === undefined || typeof intersectionEpsilon === "undefined" ? 1.0 : intersectionEpsilon;
+        return splitPolygonsVertices.filter((splitPolyVerts, _splitPolyIndex) => {
+            const intersectionTestCallback = PolygonInset._hasIntersectionCallback(splitPolyVerts, eps, _splitPolyIndex);
+            const intersectsWithAnyRect = insetRectanglePolygons.some(intersectionTestCallback);
+            return !intersectsWithAnyRect;
+        });
+    }
+    /**
+     * This private method will reverse each polygon's vertex order that's not clockwise.
+     *
+     * @param {Array<Vertex[]>} polygons
+     */
+    static _assertAllPolygonsAreClockwise(polygons) {
+        polygons.forEach((polygonVerts, _polyIndex) => {
+            // if (!Polygon.utils.isClockwise(polygonVerts)) {
+            //   polygonVerts.reverse(); // Attention: this happens in-place (Array.reverse is destructive!)
+            // }
+            PolygonInset._assertPolygonIsClockwise(polygonVerts);
+        });
+    }
+    /**
+     * This private method will revert the vertex order if the polygon is not clockwise.
+     *
+     * @param {Vertex[]} polygonVerts
+     */
+    static _assertPolygonIsClockwise(polygonVerts) {
+        if (!Polygon_1.Polygon.utils.isClockwise(polygonVerts)) {
+            polygonVerts.reverse(); // Attention: this happens in-place (Array.reverse is destructive!)
+        }
+    }
+}
+exports.PolygonInset = PolygonInset;
+/**
+ * Optimize the inset polygon by removing critical `ear` edges.
+ * Such an is identified by: the edge itself is completely located inside its neighbours inset rectangle.
+ *
+ * In this process multiple edges from the ear might be dropped and two adjacent edges get a new
+ * common intersection point.
+ *
+ * Note: this method is not working as expected in all cases and quite experimental.
+ *
+ * @param insetPolygon
+ * @param insetRectangles
+ */
+PolygonInset._optimizeInsetPolygon = (insetPolygon, insetRectangles) => {
+    // Locate edge that can be removed:
+    var earEdgeIndex = -1;
+    var maxLimit = insetPolygon.vertices.length;
+    var i = 0;
+    while (i++ < maxLimit &&
+        insetPolygon.vertices.length > 3 &&
+        (earEdgeIndex = PolygonInset._locateExcessiveEarEdge(insetPolygon, insetRectangles)) != -1) {
+        // console.log("REMOVE EAR EDGE", earEdgeIndex);
+        // As this is an ear edge: don't just remove the vertex.
+        //   i) Remove the vertex and calculate the new intersection point of neighbour edges.
+        //  ii) Update neightbour rectangles
+        var leftEdge = insetPolygon.getEdgeAt(earEdgeIndex - 2);
+        var rightEdge = insetPolygon.getEdgeAt(earEdgeIndex + 1);
+        var newIntersection = leftEdge.intersection(rightEdge);
+        newIntersection && rightEdge.a.set(newIntersection);
+        // Update rectangles
+        // ...
+        insetPolygon.vertices.splice(earEdgeIndex, 1);
+        insetRectangles.splice(earEdgeIndex, 1);
+    }
+    // TODO remove if not -1
+};
+PolygonInset._locateExcessiveEarEdge = (insetPolygon, insetRectangles) => {
+    for (var i = 0; i < insetPolygon.vertices.length; i++) {
+        const thisEdge = insetPolygon.getEdgeAt(i);
+        const leftIndex = i == 0 ? insetPolygon.vertices.length - 1 : i - 1;
+        // const rightIndex = i + 1 >= insetPolygon.vertices.length ? 0 : i + 1;
+        const leftRect = insetRectangles[leftIndex];
+        // const rightRect = insetRectangles[rightIndex];
+        const leftRectContainsThisEdge = PolygonInset._rectangleFullyContainsLine(leftRect, thisEdge);
+        if (leftRectContainsThisEdge) {
+            return i;
+        }
+        const leftEdge = insetPolygon.getEdgeAt(leftIndex);
+        const thisRect = insetRectangles[i];
+        const thisRectContainsLeftEdge = PolygonInset._rectangleFullyContainsLine(thisRect, leftEdge);
+        if (thisRectContainsLeftEdge) {
+            return i; // leftIndex;
+        }
+    }
+    return -1;
+};
+// Pre: rectangle.vertices.length === 4
+PolygonInset._rectangleFullyContainsLine = (rectangle, edge) => {
+    var rectWidth = rectangle.getEdgeAt(0).length();
+    var rectHeight = rectangle.getEdgeAt(1).length();
+    // Both line corners must be at least 1% within the rectangle limits.
+    const eps = Math.min(rectWidth, rectHeight) / 100;
+    const edgeLen = edge.length();
+    var epsPointA = edge.vertAt(0.01); // edgeLen * eps);
+    var epsPointB = edge.vertAt(0.99); // 1.0 - edgeLen * eps);
+    var centerPoint = edge.vertAt(0.5);
+    return rectangle.containsVerts([epsPointA, epsPointB, centerPoint]);
+};
+/**
+ * For simplification I'm using a callback generator function here.
+ *
+ * @param splitPolyVerts
+ * @param eps
+ * @param _splitPolyIndex
+ * @returns {Function} The callback for an `Array.some` parameter.
+ */
+PolygonInset._hasIntersectionCallback = (splitPolyVerts, eps, _splitPolyIndex) => (rectanglePoly, _rectanglePolyIndex) => {
+    // const intersectionVerts: XYCoords[] = sutherlandHodgman(splitPolyVerts, rectanglePoly.vertices);
+    const intersectionVerts = (0, sutherlandHodgman_1.sutherlandHodgman)(rectanglePoly.vertices, splitPolyVerts);
+    // var intersection = GreinerHorman.intersection(sourcePolygon.vertices, clipPolygon.vertices);
+    // const uniqueIntersectionVerts = clearDuplicateVertices(intersectionVerts);
+    const intersectionAreaSize = Polygon_1.Polygon.utils.area(intersectionVerts);
+    if (intersectionAreaSize < 0) {
+        console.warn("%cFound a polygon split with negative area. Counterclockwise against all odds?", "color: red; background: black;", //  font-size: 30px",
+        "intersectionAreaSize", intersectionAreaSize, "_splitPolyIndex", _splitPolyIndex, "_rectanglePolyIndex", _rectanglePolyIndex, "intersectionVerts", intersectionVerts
+        // "uniqueIntersectionVerts",
+        // uniqueIntersectionVerts
+        );
+    }
+    // if (intersectionAreaSize >= eps) {
+    //   console.log(
+    //     "%cFound a polygon split for removal",
+    //     "color: orange; background: grey;", //  font-size: 30px",
+    //     "intersectionAreaSize",
+    //     intersectionAreaSize,
+    //     "_splitPolyIndex",
+    //     _splitPolyIndex,
+    //     "_rectanglePolyIndex",
+    //     _rectanglePolyIndex,
+    //     "intersectionVerts",
+    //     intersectionVerts
+    //     // "uniqueIntersectionVerts",
+    //     // uniqueIntersectionVerts
+    //   );
+    // }
+    // if (intersectionAreaSize < eps) {
+    //   // console.log("%cHello", "color: green; background: yellow; font-size: 30px");
+    //   console.log(
+    //     "Polygon split can be kept. Area is position but below epsilon.",
+    //     "intersectionAreaSize",
+    //     intersectionAreaSize,
+    //     "_splitPolyIndex",
+    //     _splitPolyIndex,
+    //     "_rectanglePolyIndex",
+    //     _rectanglePolyIndex,
+    //     "intersectionVerts",
+    //     intersectionVerts
+    //     // "uniqueIntersectionVerts",
+    //     // uniqueIntersectionVerts
+    //   );
+    // }
+    return intersectionAreaSize >= eps;
+};
+//# sourceMappingURL=PolygonInset.js.map

package/src/_esm/utils/algorithms/PolygonInset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolygonInset.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/PolygonInset.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;GAmBG;;;AAEH,qCAAkC;AAClC,2CAAwC;AACxC,yCAAsC;AAGtC,mFAAgF;AAChF,2DAAwD;AAYxD;IAkDE;;;;;;;OAOG;IACH,YAAY,OAAgB;QA/C5B;;WAEG;QACH,yBAAoB,GAAgB,EAAE,CAAC;QAEvC;;WAEG;QACH,eAAU,GAAgB,EAAE,CAAC;QAE7B;;;WAGG;QACH,sBAAiB,GAAgB,EAAE,CAAC;QAapC;;;WAGG;QACH,kBAAa,GAAyB,EAAE,CAAC;QAiBvC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED;;;;;;;;;OASG;IACI,qBAAqB,CAAC,OAA6B;;QACxD,gCAAgC;QAChC,IAAI,OAAO,CAAC,kBAAkB,KAAK,CAAC,EAAE,CAAC;YACrC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY;QAC9C,CAAC;QAED,oEAAoE;QACpE,2CAA2C;QAC3C,YAAY,CAAC,yBAAyB,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAE9D,kGAAkG;QAClG,0CAA0C;QAC1C,gGAAgG;QAChG,iCAAiC;QACjC,MAAM,mBAAmB,GAAuB,OAAO,CAAC,mBAAmB,CAAC;QAE5E,gCAAgC;QAChC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QAE7C,iGAAiG;QACjG,gFAAgF;QAChF,MAAM,oBAAoB,SAAG,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,oBAAoB,mCAAI,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,MAAM,CAAC;QAEpG,oFAAoF;QACpF,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC;QAC7D,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,oBAAoB,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAC;QAC/E,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,gCAAgC,CAAC,IAAI,CAAC,oBAAoB,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAEhH,yDAAyD;QACzD,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;YACvB,8BAA8B;YAC9B,gCAAgC;YAChC,YAAY,CAAC,qBAAqB,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,sBAAsB,CAAC,CAAC;QACzF,CAAC;QAED,6DAA6D;QAC7D,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC,0BAA0B,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAEpF,4DAA4D;QAC5D,4BAA4B;QAC5B,qCAAqC;QACrC,wFAAwF;QACxF,IAAI;QAEJ,qEAAqE;QACrE,mEAAmE;QACnE,IAAI,CAAC,aAAa,GAAG,IAAA,6DAA6B,EAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,oBAAoB,EAAE,IAAI,CAAC,CAAC,CAAC,mBAAmB;QAE/H,oEAAoE;QACpE,uEAAuE;QACvE,sCAAsC;QACtC,+BAA+B;QAC/B,iBAAiB;QACjB,IAAI,OAAO,CAAC,kBAAkB,GAAG,CAAC,EAAE,CAAC;YACnC,+CAA+C;QACjD,CAAC;QAED,kEAAkE;QAClE,qCAAqC;QACrC,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAEhE,IAAI,CAAC,qBAAqB,GAAG,YAAY,CAAC,mCAAmC,CAC3E,IAAI,CAAC,aAAa,EAClB,IAAI,CAAC,sBAAsB,EAC3B,mBAAmB,CACpB,CAAC;QACF,sFAAsF;QACtF,IAAI,CAAC,qBAAqB,GAAG,YAAY,CAAC,yCAAyC,CAAC,IAAI,CAAC,qBAAqB,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9H,sFAAsF;QACtF,OAAO,IAAI,CAAC,qBAAqB,CAAC;IACpC,CAAC;IAED;;;;;;;OAOG;IACK,kBAAkB,CAAC,YAAyB,EAAE,WAAmB;QACvE,MAAM,UAAU,GAAgB,EAAE,CAAC,CAAC,cAAc;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,eAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC/C,MAAM,CAAC,GAAG,WAAW,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;YAC7C,iCAAiC;YACjC,2BAA2B;YAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtB,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtB,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;;;;;;OAUG;IACK,yBAAyB,CAAC,UAAuB;QACvD,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC3B,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,iBAAiB,GAAgB,EAAE,CAAC;QAC1C,6CAA6C;QAC7C,MAAM,aAAa,GAAS,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9D,MAAM,cAAc,GAAS,UAAU,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,qBAAqB,GAAG,aAAa,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC,CAAC,mBAAmB;QAC3F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAS,UAAU,CAAC,CAAC,CAAC,CAAC;YAEtC,MAAM,aAAa,GAAS,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;YACpE,4BAA4B;YAC5B,MAAM,YAAY,GAAkB,SAAS,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YAC1E,IAAI,YAAY,IAAI,IAAI,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,+DAA+D,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;YAClG,CAAC;iBAAM,CAAC;gBACN,4DAA4D;gBAC5D,IAAI,qBAAqB,IAAI,IAAI,EAAE,CAAC;oBAClC,MAAM,UAAU,GAAS,IAAI,WAAI,CAAC,qBAAqB,EAAE,YAAY,CAAC,CAAC;oBACvE,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;YACD,qBAAqB,GAAG,YAAY,CAAC;QACvC,CAAC;QACD,iDAAiD;QACjD,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;QAC3C,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IAED;;;;;;;;OAQG;IACK,gCAAgC,CAAC,oBAAiC,EAAE,UAAuB;QACjG,+BAA+B;QAC/B,MAAM,sBAAsB,GAAmB,oBAAoB,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE;YAC7F,MAAM,WAAW,GAAY,IAAI,iBAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACpD,wBAAwB;YACxB,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YACjD,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YACjD,uBAAuB;YACvB,MAAM,SAAS,GAAS,UAAU,CAAC,KAAK,CAAC,CAAC;YAC1C,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC/C,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC/C,OAAO,WAAW,CAAC;QACrB,CAAC,CAAC,CAAC;QACH,OAAO,sBAAsB,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,0BAA0B,CAAC,iBAA8B;QACtE,MAAM,YAAY,GAAG,IAAI,iBAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC5C,iBAAiB,CAAC,OAAO,CAAC,CAAC,SAAe,EAAQ,EAAE;YAClD,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QACH,OAAO,YAAY,CAAC;IACtB,CAAC;IAmFD;;;;;;;OAOG;IACK,MAAM,CAAC,yCAAyC,CACtD,qBAA2C,EAC3C,eAAwB;QAExB,OAAO,qBAAqB,CAAC,MAAM,CAAC,CAAC,cAA6B,EAAE,eAAuB,EAAW,EAAE;YACtG,OAAO,cAAc,CAAC,KAAK,CAAC,CAAC,UAAkB,EAAW,EAAE;gBAC1D,OAAO,eAAe,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACK,MAAM,CAAC,mCAAmC,CAChD,qBAA2C,EAC3C,sBAAsC,EACtC,mBAA4B;QAE5B,wBAAwB;QACxB,2CAA2C;QAC3C,4BAA4B;QAC5B,8CAA8C;QAC9C,8CAA8C;QAC9C,QAAQ;QACR,MAAM;QAEN,qBAAqB,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAC7C,MAAM,IAAI,GAAY,iBAAO,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YACvD,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,CAAC,IAAI,CAAC,kCAAkC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAChE,CAAC;QACH,CAAC,CAAC,CAAC;QACH,sBAAsB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YAC7C,MAAM,IAAI,GAAY,IAAI,CAAC,WAAW,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,CAAC,IAAI,CAAC,iCAAiC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,GAAG,GACP,mBAAmB,KAAK,SAAS,IAAI,OAAO,mBAAmB,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC;QAC9G,OAAO,qBAAqB,CAAC,MAAM,CAAC,CAAC,cAAwB,EAAE,eAAuB,EAAE,EAAE;YACxF,MAAM,wBAAwB,GAAG,YAAY,CAAC,wBAAwB,CAAC,cAAc,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC;YAC7G,MAAM,qBAAqB,GAAG,sBAAsB,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YACpF,OAAO,CAAC,qBAAqB,CAAC;QAChC,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,8BAA8B,CAAC,QAAyB;QACrE,QAAQ,CAAC,OAAO,CAAC,CAAC,YAAsB,EAAE,UAAkB,EAAE,EAAE;YAC9D,kDAAkD;YAClD,gGAAgG;YAChG,IAAI;YACJ,YAAY,CAAC,yBAAyB,CAAC,YAAY,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,yBAAyB,CAAC,YAAsB;QAC7D,IAAI,CAAC,iBAAO,CAAC,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC;YAC7C,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,mEAAmE;QAC7F,CAAC;IACH,CAAC;CAqEF;;AA3OC;;;;;;;;;;;GAWG;AACY,kCAAqB,GAAG,CAAC,YAAqB,EAAE,eAA+B,EAAQ,EAAE;IACtG,mCAAmC;IACnC,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;IACtB,IAAI,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC5C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OACE,CAAC,EAAE,GAAG,QAAQ;QACd,YAAY,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAChC,CAAC,YAAY,GAAG,YAAY,CAAC,uBAAuB,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,EAC1F,CAAC;QACD,gDAAgD;QAChD,wDAAwD;QACxD,sFAAsF;QACtF,oCAAoC;QACpC,IAAI,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;QACxD,IAAI,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,eAAe,GAAG,QAAQ,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACvD,eAAe,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;QAEpD,oBAAoB;QACpB,MAAM;QAEN,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;QAC9C,eAAe,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,wBAAwB;AAC1B,CAAC,AA1BmC,CA0BlC;AAEa,oCAAuB,GAAG,CAAC,YAAqB,EAAE,eAA+B,EAAU,EAAE;IAC1G,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtD,MAAM,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpE,wEAAwE;QAExE,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;QAC5C,iDAAiD;QAEjD,MAAM,wBAAwB,GAAG,YAAY,CAAC,2BAA2B,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE9F,IAAI,wBAAwB,EAAE,CAAC;YAC7B,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,QAAQ,GAAG,YAAY,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAEpC,MAAM,wBAAwB,GAAG,YAAY,CAAC,2BAA2B,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC9F,IAAI,wBAAwB,EAAE,CAAC;YAC7B,OAAO,CAAC,CAAC,CAAC,aAAa;QACzB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC,AAxBqC,CAwBpC;AAEF,uCAAuC;AACxB,wCAA2B,GAAG,CAAC,SAAkB,EAAE,IAAU,EAAW,EAAE;IACvF,IAAI,SAAS,GAAW,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACxD,IAAI,UAAU,GAAW,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAEzD,qEAAqE;IACrE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAE9B,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB;IACrD,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB;IAC3D,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACnC,OAAO,SAAS,CAAC,aAAa,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC;AACtE,CAAC,AAZyC,CAYxC;AAyFF;;;;;;;GAOG;AACY,qCAAwB,GACrC,CAAC,cAAwB,EAAE,GAAW,EAAE,eAAuB,EAAE,EAAE,CACnE,CAAC,aAAsB,EAAE,mBAA2B,EAAW,EAAE;IAC/D,mGAAmG;IACnG,MAAM,iBAAiB,GAAe,IAAA,qCAAiB,EAAC,aAAa,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;IAEhG,+FAA+F;IAC/F,6EAA6E;IAC7E,MAAM,oBAAoB,GAAW,iBAAO,CAAC,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC3E,IAAI,oBAAoB,GAAG,CAAC,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CACV,gFAAgF,EAChF,gCAAgC,EAAE,qBAAqB;QACvD,sBAAsB,EACtB,oBAAoB,EACpB,iBAAiB,EACjB,eAAe,EACf,qBAAqB,EACrB,mBAAmB,EACnB,mBAAmB,EACnB,iBAAiB;QACjB,6BAA6B;QAC7B,0BAA0B;SAC3B,CAAC;IACJ,CAAC;IACD,qCAAqC;IACrC,iBAAiB;IACjB,6CAA6C;IAC7C,gEAAgE;IAChE,8BAA8B;IAC9B,4BAA4B;IAC5B,yBAAyB;IACzB,uBAAuB;IACvB,6BAA6B;IAC7B,2BAA2B;IAC3B,2BAA2B;IAC3B,wBAAwB;IACxB,oCAAoC;IACpC,iCAAiC;IACjC,OAAO;IACP,IAAI;IACJ,oCAAoC;IACpC,oFAAoF;IACpF,iBAAiB;IACjB,wEAAwE;IACxE,8BAA8B;IAC9B,4BAA4B;IAC5B,yBAAyB;IACzB,uBAAuB;IACvB,6BAA6B;IAC7B,2BAA2B;IAC3B,2BAA2B;IAC3B,wBAAwB;IACxB,oCAAoC;IACpC,iCAAiC;IACjC,OAAO;IACP,IAAI;IACJ,OAAO,oBAAoB,IAAI,GAAG,CAAC;AACrC,CAAC,AA1DoC,CA0DnC"}

package/src/_esm/utils/algorithms/PolygonTesselationOutlines.d.ts

@@ -0,0 +1,145 @@
+/**
+ * Find the outer hull outlines of a (not necessarily full connected) polygon tesellation.
+ *
+ * The method `findAllOutlinesGraph` will return a simple graph containing all vertices and edges
+ * that belong to the outer hull.
+ *
+ * The method `findAllOutlinesPolygons` will detect connected paths inside the graph and return
+ * an array of Polygons.
+ *
+ *
+ * @require detectPaths
+ *
+ * @author  Ikaros Kappler
+ * @date    2026-01-20
+ * @version 1.0.0
+ */
+import { Polygon } from "../../Polygon";
+import { Vertex } from "../../Vertex";
+import { IndexPair } from "../datastructures/interfaces";
+export interface PolygonTesselationOutlinesOptions {
+    tolerance?: number;
+    removeUnusedVertices?: boolean;
+}
+export interface TesselationGraph {
+    vertices: Array<Vertex>;
+    edges: Array<IndexPair>;
+}
+/**
+ * Convert any non-intersecting tesselation to a graph.
+ * Adjadent tiles (polygons) will result in duplicate edges.
+ *
+ * @param {Polygon[]} polygons - The polygon tesselation to use.
+ * @return {TesselationGraph} A tesselation graph.
+ */
+export declare const polygonTesselationToGraph: (polygons: Polygon[]) => TesselationGraph;
+/**
+ * A class to calculate the tesselation's outer hull.
+ */
+export declare class PolygonTesselationOutlines {
+    static readonly DEFAULT_TOLERANCE = 0.01;
+    private readonly polygons;
+    private readonly tolerance;
+    private readonly removeUnusedVertices;
+    /**
+     * @constructor
+     * @param {Polygon[]} polygons - The polygon tesselation to use.
+     * @param {PolygonTesselationOutlinesOptions} options - (optional)
+     */
+    constructor(polygons: Polygon[], options?: PolygonTesselationOutlinesOptions);
+    /**
+     * Clears duplicate edges.
+     *
+     * Note: this works only for duplicates. Triplets will not be removed.
+     *
+     * @name __eliminateDuplicateEdges
+     * @private
+     * @memberof TesselationGraph
+     * @instance
+     * @param {TesselationGraph} tesselationGraph - The tesselation graph to remove duplicate edges from.
+     * @return {TesselationGraph} A new tesselation graph with cleaned up edges.
+     */
+    private __eliminateDuplicateEdges;
+    /**
+     * Locate some edge that adjacent to the given vertex index
+     *
+     * @name __locateEdgeWithVertIndex
+     * @private
+     * @memberof TesselationGraph
+     * @instance
+     * @param {number} vertIndex - The vertex index to find an edge for.
+     * @param {TesselationGraph} tesselationGraph - The tesselation graph to remove unused vertices from.
+     * @return {number} The edge index that's adjacent to the given vertex index.
+     * @return -1 if no such edge is found.
+     */
+    private __locateEdgeWithVertIndex;
+    /**
+     * Removes all unused vertices from the graph and re-matps the edges.
+     *
+     * @name __removeUnusedVertices
+     * @private
+     * @memberof TesselationGraph
+     * @instance
+     * @param {TesselationGraph} tesselationGraph - The tesselation graph to remove unused vertices from.
+     * @return {TesselationGraph} A new tesselation graph.
+     */
+    private __removeUnusedVertices;
+    /**
+     * Creates a tesselation graph and removes all inner edges.
+     *
+     * @name findAllOutlinesGraph
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @return {TesselationGraph} A tesselation graph containing the outer hull edges only.
+     */
+    findAllOutlinesGraph(): TesselationGraph;
+    /**
+     * Convert any generic path to a polygon. Each path segment (start point and end point)
+     * are interpreted as a linear segment here.
+     *
+     * @name __convertGenericPathToPolygon
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @param {GenericPath} path - The path to convert.
+     */
+    private __convertGenericPathToPolygon;
+    /**
+     * Creates a tesselation graph and removes all inner edges.
+     *
+     * @name findAllOutlinesPolygons
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @param {TesselationGraph} tesselationGraph - Find all outlines on the tesselation graph.
+     */
+    findAllOutlinesPolygons(tesselationGraph: TesselationGraph): Array<Polygon>;
+    /**
+     * Checks if two vertices are equal – regarding to the current tolerance setting.
+     *
+     * @name __isEqualPoint
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @param {boolean} vertA - The first point.
+     * @param {boolean} vertB - The second point.
+     * @return True if the vertices are equal.
+     */
+    private __isEqualPoint;
+    /**
+     * Checks if two edges (identified as two pairs of vertices) are equal – regarding to the
+     * current tolerance setting.
+     *
+     * @name __isEqualEdge
+     * @private
+     * @memberof PolygonTesselationOutlines
+     * @instance
+     * @param {boolean} edgeAvertA - The first edge's point A.
+     * @param {boolean} edgeAvertB - The first edge's point B.
+     * @param {boolean} edgeBvertA - The second edge's point A.
+     * @param {boolean} edgeBvertB - The second edge's point B.
+     * @return True if the edges are equal.
+     */
+    private __isEqualEdge;
+}