plotboilerplate 1.26.0 → 1.27.0

package/src/cjs/interfaces/DrawLib.js.map

@@ -1 +1 @@
-{"version":3,"file":"DrawLib.js","sourceRoot":"","sources":["../../ts/interfaces/DrawLib.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;IA2BI"}
+{"version":3,"file":"DrawLib.js","sourceRoot":"","sources":["../../ts/interfaces/DrawLib.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;IA4BI"}

package/src/cjs/utils/WebColors.d.ts

@@ -1,9 +1,10 @@
 /**
  * @author   Ikaros Kappler
- * @version  1.0.1
  * @date     2018-11-10
  * @modified 2020-10-23 Ported to Typescript.
  * @modified 2020-10-30 Exporting each color under its name globally.
+ * @modified 2025-12-08 Replaying self defined colors by official web colors.
+ * @version  1.0.2
  **/
 import { Color } from "./datastructures/Color";
 export declare const Red: Color;

package/src/cjs/utils/WebColors.js

@@ -1,25 +1,26 @@
 "use strict";
 /**
  * @author   Ikaros Kappler
- * @version  1.0.1
  * @date     2018-11-10
  * @modified 2020-10-23 Ported to Typescript.
  * @modified 2020-10-30 Exporting each color under its name globally.
+ * @modified 2025-12-08 Replaying self defined colors by official web colors.
+ * @version  1.0.2
  **/
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.shuffleWebColors = exports.WebColors = exports.LightGreen = exports.Green = exports.Teal = exports.Cyan = exports.LightBlue = exports.Blue = exports.Indigo = exports.DeepPurple = exports.Purple = exports.Pink = exports.Red = void 0;
 var Color_1 = require("./datastructures/Color");
-exports.Red = Color_1.Color.makeRGB(255, 67, 55);
-exports.Pink = Color_1.Color.makeRGB(232, 31, 100);
-exports.Purple = Color_1.Color.makeRGB(156, 39, 175);
-exports.DeepPurple = Color_1.Color.makeRGB(103, 59, 184);
-exports.Indigo = Color_1.Color.makeRGB(64, 81, 181);
-exports.Blue = Color_1.Color.makeRGB(35, 151, 245);
-exports.LightBlue = Color_1.Color.makeRGB(6, 170, 245);
-exports.Cyan = Color_1.Color.makeRGB(3, 189, 214);
-exports.Teal = Color_1.Color.makeRGB(1, 150, 137);
-exports.Green = Color_1.Color.makeRGB(77, 175, 82);
-exports.LightGreen = Color_1.Color.makeRGB(141, 195, 67);
+exports.Red = Color_1.Color.Red; // Color.makeRGB(255,67,55);
+exports.Pink = Color_1.Color.Pink; // Color.makeRGB(232,31,100);
+exports.Purple = Color_1.Color.Purple; // Color.makeRGB(156,39,175);
+exports.DeepPurple = Color_1.Color.DeepPink; // Color.makeRGB(103,59,184);
+exports.Indigo = Color_1.Color.Indigo; // Color.makeRGB(64,81,181);
+exports.Blue = Color_1.Color.Blue; // Color.makeRGB(35,151,245);
+exports.LightBlue = Color_1.Color.LightBlue; // Color.makeRGB(6,170,245);
+exports.Cyan = Color_1.Color.Cyan; // Color.makeRGB(3,189,214);
+exports.Teal = Color_1.Color.Teal; // Color.makeRGB(1,150,137);
+exports.Green = Color_1.Color.Green; // Color.makeRGB(77,175,82);
+exports.LightGreen = Color_1.Color.LightGreen; // Color.makeRGB(141,195,67);
 /**
  * A set of beautiful web colors (I know, beauty is in the eye of the beholder).
  *
@@ -29,19 +30,7 @@ exports.LightGreen = Color_1.Color.makeRGB(141, 195, 67);
  * @requires Color
  *
  */
-exports.WebColors = [
-    exports.Red,
-    exports.Pink,
-    exports.Purple,
-    exports.DeepPurple,
-    exports.Indigo,
-    exports.Blue,
-    exports.LightBlue,
-    exports.Cyan,
-    exports.Teal,
-    exports.Green,
-    exports.LightGreen
-];
+exports.WebColors = [exports.Red, exports.Pink, exports.Purple, exports.DeepPurple, exports.Indigo, exports.Blue, exports.LightBlue, exports.Cyan, exports.Teal, exports.Green, exports.LightGreen];
 /**
  * A helper function to shuffle the colors into a new order.
  */

package/src/cjs/utils/WebColors.js.map

@@ -1 +1 @@
-{"version":3,"file":"WebColors.js","sourceRoot":"","sources":["../../ts/utils/WebColors.ts"],"names":[],"mappings":";AAAA;;;;;;IAMI;;;AAEJ,gDAA+C;AAElC,QAAA,GAAG,GAAW,aAAK,CAAC,OAAO,CAAC,GAAG,EAAC,EAAE,EAAC,EAAE,CAAC,CAAC;AACvC,QAAA,IAAI,GAAW,aAAK,CAAC,OAAO,CAAC,GAAG,EAAC,EAAE,EAAC,GAAG,CAAC,CAAC;AACzC,QAAA,MAAM,GAAW,aAAK,CAAC,OAAO,CAAC,GAAG,EAAC,EAAE,EAAC,GAAG,CAAC,CAAC;AAC3C,QAAA,UAAU,GAAW,aAAK,CAAC,OAAO,CAAC,GAAG,EAAC,EAAE,EAAC,GAAG,CAAC,CAAC;AAC/C,QAAA,MAAM,GAAW,aAAK,CAAC,OAAO,CAAC,EAAE,EAAC,EAAE,EAAC,GAAG,CAAC,CAAC;AAC1C,QAAA,IAAI,GAAW,aAAK,CAAC,OAAO,CAAC,EAAE,EAAC,GAAG,EAAC,GAAG,CAAC,CAAC;AACzC,QAAA,SAAS,GAAW,aAAK,CAAC,OAAO,CAAC,CAAC,EAAC,GAAG,EAAC,GAAG,CAAC,CAAC;AAC7C,QAAA,IAAI,GAAW,aAAK,CAAC,OAAO,CAAC,CAAC,EAAC,GAAG,EAAC,GAAG,CAAC,CAAC;AACxC,QAAA,IAAI,GAAW,aAAK,CAAC,OAAO,CAAC,CAAC,EAAC,GAAG,EAAC,GAAG,CAAC,CAAC;AACxC,QAAA,KAAK,GAAW,aAAK,CAAC,OAAO,CAAC,EAAE,EAAC,GAAG,EAAC,EAAE,CAAC,CAAC;AACzC,QAAA,UAAU,GAAW,aAAK,CAAC,OAAO,CAAC,GAAG,EAAC,GAAG,EAAC,EAAE,CAAC,CAAC;AAG5D;;;;;;;;GAQG;AACU,QAAA,SAAS,GAAkB;IACpC,WAAG;IACH,YAAI;IACJ,cAAM;IACN,kBAAU;IACV,cAAM;IACN,YAAI;IACJ,iBAAS;IACT,YAAI;IACJ,YAAI;IACJ,aAAK;IACL,kBAAU;CACb,CAAC;AAGF;;GAEG;AACI,IAAM,gBAAgB,GAAG,UAAE,KAAoB;IAClD,IAAM,MAAM,GAAkB,KAAK,CAAE,KAAK,CAAC,MAAM,CAAE,CAAC;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;QAC5C,MAAM,CAAC,CAAC,CAAC,GAAG,iBAAS,CAAE,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAS,CAAC,MAAM,CAAE,CAAC;IAClD,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AANW,QAAA,gBAAgB,oBAM3B"}
+{"version":3,"file":"WebColors.js","sourceRoot":"","sources":["../../ts/utils/WebColors.ts"],"names":[],"mappings":";AAAA;;;;;;;IAOI;;;AAEJ,gDAA+C;AAElC,QAAA,GAAG,GAAU,aAAK,CAAC,GAAG,CAAC,CAAC,4BAA4B;AACpD,QAAA,IAAI,GAAU,aAAK,CAAC,IAAI,CAAC,CAAC,6BAA6B;AACvD,QAAA,MAAM,GAAU,aAAK,CAAC,MAAM,CAAC,CAAC,6BAA6B;AAC3D,QAAA,UAAU,GAAU,aAAK,CAAC,QAAQ,CAAC,CAAC,6BAA6B;AACjE,QAAA,MAAM,GAAU,aAAK,CAAC,MAAM,CAAC,CAAC,4BAA4B;AAC1D,QAAA,IAAI,GAAU,aAAK,CAAC,IAAI,CAAC,CAAC,6BAA6B;AACvD,QAAA,SAAS,GAAU,aAAK,CAAC,SAAS,CAAC,CAAC,4BAA4B;AAChE,QAAA,IAAI,GAAU,aAAK,CAAC,IAAI,CAAC,CAAC,4BAA4B;AACtD,QAAA,IAAI,GAAU,aAAK,CAAC,IAAI,CAAC,CAAC,4BAA4B;AACtD,QAAA,KAAK,GAAU,aAAK,CAAC,KAAK,CAAC,CAAC,4BAA4B;AACxD,QAAA,UAAU,GAAU,aAAK,CAAC,UAAU,CAAC,CAAC,6BAA6B;AAEhF;;;;;;;;GAQG;AACU,QAAA,SAAS,GAAiB,CAAC,WAAG,EAAE,YAAI,EAAE,cAAM,EAAE,kBAAU,EAAE,cAAM,EAAE,YAAI,EAAE,iBAAS,EAAE,YAAI,EAAE,YAAI,EAAE,aAAK,EAAE,kBAAU,CAAC,CAAC;AAE/H;;GAEG;AACI,IAAM,gBAAgB,GAAG,UAAC,KAAoB;IACnD,IAAM,MAAM,GAAiB,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,CAAC,CAAC,GAAG,iBAAS,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAS,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AANW,QAAA,gBAAgB,oBAM3B"}

package/src/cjs/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;
+}

package/src/cjs/utils/algorithms/PolygonTesselationOutlines.js

@@ -0,0 +1,269 @@
+"use strict";
+/**
+ * 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
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PolygonTesselationOutlines = exports.polygonTesselationToGraph = void 0;
+var Line_1 = require("../../Line");
+var Polygon_1 = require("../../Polygon");
+var arrayFill_1 = require("./arrayFill");
+var detectPaths_1 = require("./detectPaths");
+/**
+ * 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.
+ */
+var polygonTesselationToGraph = function (polygons) {
+    var vertices = [];
+    var edges = [];
+    // const vertexPolygonMapping: Array<number>[] = []; // Map polygon+vertex to graph vertices
+    for (var i = 0; i < polygons.length; i++) {
+        var polygon = polygons[i];
+        var polygonMapping = [];
+        // vertexPolygonMapping.push(polygonMapping);
+        // Add vertices
+        for (var j = 0; j < polygon.vertices.length; j++) {
+            var graphVertIndex = vertices.length;
+            vertices.push(polygon.vertices[j]);
+            polygonMapping.push(graphVertIndex);
+        }
+        // Now add edges
+        for (var j = 0; j < polygon.vertices.length; j++) {
+            var polyEdgeIndexA = j;
+            var polyEdgeIndexB = (j + 1) % polygon.vertices.length;
+            var grapgVertIndexA = polygonMapping[polyEdgeIndexA];
+            var grapgVertIndexB = polygonMapping[polyEdgeIndexB];
+            edges.push({ i: grapgVertIndexA, j: grapgVertIndexB });
+        }
+    }
+    return { vertices: vertices, edges: edges };
+};
+exports.polygonTesselationToGraph = polygonTesselationToGraph;
+/**
+ * A class to calculate the tesselation's outer hull.
+ */
+var PolygonTesselationOutlines = /** @class */ (function () {
+    /**
+     * @constructor
+     * @param {Polygon[]} polygons - The polygon tesselation to use.
+     * @param {PolygonTesselationOutlinesOptions} options - (optional)
+     */
+    function PolygonTesselationOutlines(polygons, options) {
+        var _a, _b;
+        this.polygons = polygons;
+        // this.tesselationGraph = tesselationToGraph(polygons);
+        this.tolerance = (_a = options === null || options === void 0 ? void 0 : options.tolerance) !== null && _a !== void 0 ? _a : PolygonTesselationOutlines.DEFAULT_TOLERANCE;
+        this.removeUnusedVertices = (_b = options === null || options === void 0 ? void 0 : options.removeUnusedVertices) !== null && _b !== void 0 ? _b : true;
+    }
+    /**
+     * 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.
+     */
+    PolygonTesselationOutlines.prototype.__eliminateDuplicateEdges = function (tesselationGraph) {
+        var newEdges = [];
+        for (var e = 0; e < tesselationGraph.edges.length; e++) {
+            var curEdge = tesselationGraph.edges[e];
+            if (!curEdge) {
+                continue;
+            }
+            var curA = tesselationGraph.vertices[curEdge.i];
+            var curB = tesselationGraph.vertices[curEdge.j];
+            for (var f = 0; f < tesselationGraph.edges.length; f++) {
+                if (e === f) {
+                    continue;
+                }
+                var otherEdge = tesselationGraph.edges[f];
+                if (!otherEdge) {
+                    continue;
+                }
+                var otherA = tesselationGraph.vertices[otherEdge.i];
+                var otherB = tesselationGraph.vertices[otherEdge.j];
+                if (this.__isEqualEdge(curA, curB, otherA, otherB)) {
+                    // Both edges are equal -> remove both
+                    tesselationGraph.edges[e] = null;
+                    tesselationGraph.edges[f] = null;
+                }
+            }
+        }
+        // return tesselationGraph; // TODO: create clean clone with new mapping
+        // Clear null-records.
+        return {
+            vertices: tesselationGraph.vertices,
+            edges: tesselationGraph.edges.filter(function (edge) { return edge != null; })
+        }; // TODO: create clean clone with new mapping
+    };
+    /**
+     * 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.
+     */
+    PolygonTesselationOutlines.prototype.__locateEdgeWithVertIndex = function (vertIndex, tesselationGraph) {
+        return tesselationGraph.edges.findIndex(function (edge) { return edge.i == vertIndex || edge.j == vertIndex; });
+    };
+    /**
+     * 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.
+     */
+    PolygonTesselationOutlines.prototype.__removeUnusedVertices = function (tesselationGraph) {
+        // First remove un-used vertices and re-map indices.
+        var newVertices = [];
+        var indexMapping = (0, arrayFill_1.arrayFill)(tesselationGraph.vertices.length, -1);
+        for (var j = 0; j < tesselationGraph.vertices.length; j++) {
+            var edgeIndex = this.__locateEdgeWithVertIndex(j, tesselationGraph);
+            if (edgeIndex === -1) {
+                // No adjacent edge found -> vertex is not in use
+                // Ignore; index mapping remains to -1
+            }
+            else {
+                // Keep vertex
+                var newIndex = newVertices.length;
+                newVertices.push(tesselationGraph.vertices[j]);
+                indexMapping[j] = newIndex;
+            }
+        }
+        // Now re-map the egdes
+        var newEdges = [];
+        for (var j = 0; j < tesselationGraph.edges.length; j++) {
+            var edge = tesselationGraph.edges[j];
+            newEdges.push({ i: indexMapping[edge.i], j: indexMapping[edge.j] });
+        }
+        return { vertices: newVertices, edges: newEdges };
+    };
+    /**
+     * 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.
+     */
+    PolygonTesselationOutlines.prototype.findAllOutlinesGraph = function () {
+        // First build tesselation graph from polygons, containing all edges and vertices.
+        var tesselationGraph = (0, exports.polygonTesselationToGraph)(this.polygons);
+        // Now eliminate all duplicate edges. By construction only inner edges are duplicates.
+        var outerHull = this.__eliminateDuplicateEdges(tesselationGraph);
+        // Only of requested remove unused vertices.
+        if (this.removeUnusedVertices) {
+            var cleanOuterHull = this.__removeUnusedVertices(outerHull);
+            return cleanOuterHull;
+        }
+        else {
+            return outerHull;
+        }
+    };
+    /**
+     * 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.
+     */
+    PolygonTesselationOutlines.prototype.__convertGenericPathToPolygon = function (path) {
+        var vertices = [];
+        var n = path.getSegmentCount();
+        var isOpen = false;
+        for (var i = 0; i < n; i++) {
+            var segment = path.getSegmentAt(i);
+            vertices.push(segment.getStartPoint());
+            if (i > 0 && i + 1 >= n && !this.__isEqualPoint(segment.getEndPoint(), vertices[0])) {
+                isOpen = true;
+            }
+        }
+        return new Polygon_1.Polygon(vertices, isOpen);
+    };
+    /**
+     * 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.
+     */
+    PolygonTesselationOutlines.prototype.findAllOutlinesPolygons = function (tesselationGraph) {
+        var _this = this;
+        // Convert to real line segments:
+        var lineSegments = tesselationGraph.edges.map(function (edge) { return new Line_1.Line(tesselationGraph.vertices[edge.i], tesselationGraph.vertices[edge.j]); });
+        // Now run the path detection.
+        var paths = (0, detectPaths_1.detectPaths)(lineSegments, this.tolerance);
+        // And now convert the generic paths back to polygons
+        // (we have put in line segments, so line segments must have returned)
+        return paths.map(function (path) { return _this.__convertGenericPathToPolygon(path); });
+    };
+    /**
+     * 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.
+     */
+    PolygonTesselationOutlines.prototype.__isEqualPoint = function (vertA, vertB) {
+        return vertA.distance(vertB) < this.tolerance;
+    };
+    /**
+     * 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.
+     */
+    PolygonTesselationOutlines.prototype.__isEqualEdge = function (edgeAvertA, edgeAvertB, edgeBvertA, edgeBvertB) {
+        return ((this.__isEqualPoint(edgeAvertA, edgeBvertA) && this.__isEqualPoint(edgeAvertB, edgeBvertB)) ||
+            (this.__isEqualPoint(edgeAvertA, edgeBvertB) && this.__isEqualPoint(edgeAvertB, edgeBvertA)));
+    };
+    PolygonTesselationOutlines.DEFAULT_TOLERANCE = 0.01;
+    return PolygonTesselationOutlines;
+}());
+exports.PolygonTesselationOutlines = PolygonTesselationOutlines;
+//# sourceMappingURL=PolygonTesselationOutlines.js.map

package/src/cjs/utils/algorithms/PolygonTesselationOutlines.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolygonTesselationOutlines.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/PolygonTesselationOutlines.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;;AAEH,mCAAkC;AAClC,yCAAwC;AAKxC,yCAAwC;AACxC,6CAA4C;AAY5C;;;;;;GAMG;AACI,IAAM,yBAAyB,GAAG,UAAC,QAAmB;IAC3D,IAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,IAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,4FAA4F;IAC5F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAM,cAAc,GAAkB,EAAE,CAAC;QACzC,6CAA6C;QAC7C,eAAe;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,IAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACtC,CAAC;QACD,gBAAgB;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,IAAM,cAAc,GAAG,CAAC,CAAC;YACzB,IAAM,cAAc,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;YACzD,IAAM,eAAe,GAAG,cAAc,CAAC,cAAc,CAAC,CAAC;YACvD,IAAM,eAAe,GAAG,cAAc,CAAC,cAAc,CAAC,CAAC;YACvD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,UAAA,EAAE,KAAK,OAAA,EAAE,CAAC;AAC7B,CAAC,CAAC;AAxBW,QAAA,yBAAyB,6BAwBpC;AAEF;;GAEG;AACH;IAQE;;;;OAIG;IACH,oCAAY,QAAmB,EAAE,OAA2C;;QAC1E,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,wDAAwD;QACxD,IAAI,CAAC,SAAS,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,SAAS,mCAAI,0BAA0B,CAAC,iBAAiB,CAAC;QACpF,IAAI,CAAC,oBAAoB,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,oBAAoB,mCAAI,IAAI,CAAC;IACpE,CAAC;IAED;;;;;;;;;;;OAWG;IACK,8DAAyB,GAAjC,UAAkC,gBAAkC;QAClE,IAAM,QAAQ,GAAqB,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,IAAM,OAAO,GAAc,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,SAAS;YACX,CAAC;YACD,IAAM,IAAI,GAAW,gBAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1D,IAAM,IAAI,GAAW,gBAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,SAAS;gBACX,CAAC;gBACD,IAAM,SAAS,GAAc,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvD,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,SAAS;gBACX,CAAC;gBACD,IAAM,MAAM,GAAW,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC9D,IAAM,MAAM,GAAW,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC9D,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;oBACnD,sCAAsC;oBACtC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;oBACjC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;QACD,wEAAwE;QACxE,sBAAsB;QACtB,OAAO;YACL,QAAQ,EAAE,gBAAgB,CAAC,QAAQ;YACnC,KAAK,EAAE,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,UAAC,IAAe,IAAK,OAAA,IAAI,IAAI,IAAI,EAAZ,CAAY,CAAC;SACxE,CAAC,CAAC,4CAA4C;IACjD,CAAC;IAED;;;;;;;;;;;OAWG;IACK,8DAAyB,GAAjC,UAAkC,SAAiB,EAAE,gBAAkC;QACrF,OAAO,gBAAgB,CAAC,KAAK,CAAC,SAAS,CAAC,UAAC,IAAe,IAAK,OAAA,IAAI,CAAC,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,CAAC,IAAI,SAAS,EAA1C,CAA0C,CAAC,CAAC;IAC3G,CAAC;IAED;;;;;;;;;OASG;IACK,2DAAsB,GAA9B,UAA+B,gBAAkC;QAC/D,oDAAoD;QACpD,IAAM,WAAW,GAAkB,EAAE,CAAC;QACtC,IAAM,YAAY,GAAkB,IAAA,qBAAS,EAAC,gBAAgB,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1D,IAAM,SAAS,GAAW,IAAI,CAAC,yBAAyB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAC9E,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;gBACrB,iDAAiD;gBACjD,sCAAsC;YACxC,CAAC;iBAAM,CAAC;gBACN,cAAc;gBACd,IAAM,QAAQ,GAAW,WAAW,CAAC,MAAM,CAAC;gBAC5C,WAAW,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,YAAY,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,IAAM,QAAQ,GAAqB,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,IAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IACpD,CAAC;IAED;;;;;;;;OAQG;IACH,yDAAoB,GAApB;QACE,kFAAkF;QAClF,IAAM,gBAAgB,GAAqB,IAAA,iCAAyB,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEpF,sFAAsF;QACtF,IAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,gBAAgB,CAAC,CAAC;QACnE,4CAA4C;QAC5C,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC9B,IAAM,cAAc,GAAG,IAAI,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;YAC9D,OAAO,cAAc,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACK,kEAA6B,GAArC,UAAsC,IAAiB;QACrD,IAAM,QAAQ,GAAkB,EAAE,CAAC;QACnC,IAAM,CAAC,GAAW,IAAI,CAAC,eAAe,EAAE,CAAC;QACzC,IAAI,MAAM,GAAY,KAAK,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAM,OAAO,GAAgB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;YACvC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpF,MAAM,GAAG,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,iBAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;OAQG;IACH,4DAAuB,GAAvB,UAAwB,gBAAkC;QAA1D,iBAWC;QAVC,iCAAiC;QACjC,IAAM,YAAY,GAAgB,gBAAgB,CAAC,KAAK,CAAC,GAAG,CAC1D,UAAC,IAAe,IAAK,OAAA,IAAI,WAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAA9E,CAA8E,CACpG,CAAC;QACF,8BAA8B;QAC9B,IAAM,KAAK,GAAuB,IAAA,yBAAW,EAAC,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAE5E,qDAAqD;QACrD,sEAAsE;QACtE,OAAO,KAAK,CAAC,GAAG,CAAC,UAAC,IAAiB,IAAK,OAAA,KAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,EAAxC,CAAwC,CAAC,CAAC;IACpF,CAAC;IAED;;;;;;;;;;OAUG;IACK,mDAAc,GAAtB,UAAuB,KAAa,EAAE,KAAa;QACjD,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;IAChD,CAAC;IAED;;;;;;;;;;;;;OAaG;IACK,kDAAa,GAArB,UAAsB,UAAkB,EAAE,UAAkB,EAAE,UAAkB,EAAE,UAAkB;QAClG,OAAO,CACL,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC5F,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAC7F,CAAC;IACJ,CAAC;IA7NsB,4CAAiB,GAAG,IAAI,CAAC;IA8NlD,iCAAC;CAAA,AA/ND,IA+NC;AA/NY,gEAA0B"}

package/src/cjs/utils/datastructures/Color.js

@@ -312,25 +312,6 @@ var Color = /** @class */ (function () {
         Color.Converter.HSLToRGB(this);
         return this;
     };
-    //   lighten(v: string | number): Color {
-    //     if ("string" == typeof v && v.indexOf("%") > -1 && (v = parseInt(v)) != NaN) {
-    //       this.l += v / 100;
-    //     } else if ("number" == typeof v) {
-    //       if (v >= -1.0 && v <= 1.0) {
-    //         // range 0.0...1.0
-    //         this.l += v;
-    //       } else {
-    //         // range 255
-    //         this.l += v / 255;
-    //       }
-    //     } else {
-    //       throw new Error("error: bad modifier format (percent or number)");
-    //     }
-    //     if (this.l > 1) this.l = 1;
-    //     else if (this.l < 0) this.l = 0;
-    //     Color.Converter.HSLToRGB(this);
-    //     return this;
-    //   }
     Color.prototype.lighten = function (v) {
         // if ("string" == typeof v && v.indexOf("%") > -1 && (v = parseInt(v)) != NaN) {
         if ("string" == typeof v && v.indexOf("%") > -1 && !Number.isNaN((v = parseInt(v)))) {