plotboilerplate 1.27.1 → 1.28.0

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

@@ -0,0 +1,28 @@
+/**
+ * @requires Line
+ * @requires Vertex
+ *
+ * @author   Ikaros Kappler
+ * @date     2020-12-04
+ * @modified 2020-12-07 Ported from vanilla JS to typescript.
+ * @modified 2024-11-22 Added the `insideBoundsOnly` param to the `splitPolygonToNonIntersecting` algorithm.
+ * @version  1.1.0
+ */
+import { Vertex } from "../../Vertex";
+/**
+ * This function cuts a given self-intersecting polygon into non-self-intersecting
+ * sub polygons.
+ *
+ * The algorithm only works for non-self-overlapping polygons:
+ * Please note that the union set of the sub polygons themselves will _not_ be disjunct if
+ * the input polyon overlaps with itself!
+ *
+ * See this illustration for details:
+ * ./demos/27-polygon-intersection-greinerhormann/splitting-polygon-types.png
+ *
+ * @name splitPolygonToNonIntersecting
+ * @param {Array<Vertex>} vertices - The polygon as an array of vertices.
+ * @param {number=10} maxDepth - Number of max recursive steps (default is 10).
+ * @return {Array<Array<Vertex>>} A sequence of non-self-intersecting sub polygons.
+ */
+export declare const splitPolygonToNonIntersecting: (vertices: Array<Vertex>, maxDepth?: number, insideBoundsOnly?: boolean) => Array<Array<Vertex>>;

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

@@ -0,0 +1,102 @@
+"use strict";
+/**
+ * @requires Line
+ * @requires Vertex
+ *
+ * @author   Ikaros Kappler
+ * @date     2020-12-04
+ * @modified 2020-12-07 Ported from vanilla JS to typescript.
+ * @modified 2024-11-22 Added the `insideBoundsOnly` param to the `splitPolygonToNonIntersecting` algorithm.
+ * @version  1.1.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.splitPolygonToNonIntersecting = void 0;
+const Line_1 = require("../../Line");
+const Vertex_1 = require("../../Vertex");
+/**
+ * This function cuts a given self-intersecting polygon into non-self-intersecting
+ * sub polygons.
+ *
+ * The algorithm only works for non-self-overlapping polygons:
+ * Please note that the union set of the sub polygons themselves will _not_ be disjunct if
+ * the input polyon overlaps with itself!
+ *
+ * See this illustration for details:
+ * ./demos/27-polygon-intersection-greinerhormann/splitting-polygon-types.png
+ *
+ * @name splitPolygonToNonIntersecting
+ * @param {Array<Vertex>} vertices - The polygon as an array of vertices.
+ * @param {number=10} maxDepth - Number of max recursive steps (default is 10).
+ * @return {Array<Array<Vertex>>} A sequence of non-self-intersecting sub polygons.
+ */
+exports.splitPolygonToNonIntersecting = (() => {
+    /**
+     * @param {Array<Vertex>} vertices
+     * @param {number=10} maxDepth
+     */
+    const splitPolygonToNonIntersecting = (vertices, maxDepth, insideBoundsOnly) => {
+        if (typeof maxDepth === "undefined")
+            maxDepth = 10;
+        return _splitPolygonToNonIntersecting(vertices, maxDepth, insideBoundsOnly);
+    };
+    const _splitPolygonToNonIntersecting = (vertices, maxDepth, insideBoundsOnly) => {
+        if (maxDepth <= 0) {
+            // aborting at max depth
+            return [vertices];
+        }
+        if (vertices.length <= 3) {
+            // No intersections possible
+            return [vertices];
+        }
+        const n = vertices.length;
+        const lineA = new Line_1.Line(new Vertex_1.Vertex(), new Vertex_1.Vertex());
+        const lineB = new Line_1.Line(new Vertex_1.Vertex(), new Vertex_1.Vertex());
+        for (var a = 0; a < vertices.length; a++) {
+            lineA.a.set(vertices[a]);
+            lineA.b.set(vertices[(a + 1) % n]);
+            for (var b = 0; b < vertices.length; b++) {
+                // Equal edges or neighbour edges intersect by definition.
+                // We ignore them.
+                if (a == b || a + 1 == b || a == b + 1 || (a == 0 && b + 1 == vertices.length) || (b == 0 && a + 1 == vertices.length))
+                    continue;
+                lineB.a.set(vertices[b]);
+                lineB.b.set(vertices[(b + 1) % n]);
+                const intersectionPoint = lineA.intersection(lineB);
+                if (intersectionPoint &&
+                    lineA.hasPoint(intersectionPoint, insideBoundsOnly) &&
+                    lineB.hasPoint(intersectionPoint, insideBoundsOnly)) {
+                    // Cut polygon into two here
+                    const split = splitPolygonAt(vertices, a, b, intersectionPoint);
+                    // Split has 2 elements.
+                    const leftCleaned = _splitPolygonToNonIntersecting(split[0], maxDepth - 1, insideBoundsOnly);
+                    const rightCleaned = _splitPolygonToNonIntersecting(split[1], maxDepth - 1, insideBoundsOnly);
+                    return leftCleaned.concat(rightCleaned);
+                }
+            }
+        }
+        // No intersection found:
+        //    just return a list with the original
+        //    polygon as its only element.
+        return [vertices];
+    };
+    // Pre: edgeIndexA < edgeIndexB && vertices.length >= 4
+    const splitPolygonAt = (vertices, edgeIndexA, edgeIndexB, intersectionPoint) => {
+        const first = [];
+        var second = [];
+        for (var i = 0; i < vertices.length; i++) {
+            if (i <= edgeIndexA)
+                first.push(vertices[i]);
+            if (i == edgeIndexA) {
+                first.push(intersectionPoint);
+                second.push(intersectionPoint); // clone???
+            }
+            if (i > edgeIndexA && i <= edgeIndexB)
+                second.push(vertices[i]);
+            if (i > edgeIndexB)
+                first.push(vertices[i]);
+        }
+        return [first, second];
+    };
+    return splitPolygonToNonIntersecting;
+})();
+//# sourceMappingURL=splitPolygonToNonIntersecting.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"splitPolygonToNonIntersecting.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/splitPolygonToNonIntersecting.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAEH,qCAAkC;AAClC,yCAAsC;AAOtC;;;;;;;;;;;;;;;GAeG;AACU,QAAA,6BAA6B,GAAG,CAAC,GAAG,EAAE;IACjD;;;OAGG;IACH,MAAM,6BAA6B,GAAG,CACpC,QAAuB,EACvB,QAAiB,EACjB,gBAA0B,EACJ,EAAE;QACxB,IAAI,OAAO,QAAQ,KAAK,WAAW;YAAE,QAAQ,GAAG,EAAE,CAAC;QACnD,OAAO,8BAA8B,CAAC,QAAQ,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;IAC9E,CAAC,CAAC;IAEF,MAAM,8BAA8B,GAAG,CACrC,QAAuB,EACvB,QAAgB,EAChB,gBAA0B,EACJ,EAAE;QACxB,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,wBAAwB;YACxB,OAAO,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACzB,4BAA4B;YAC5B,OAAO,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;QAED,MAAM,CAAC,GAAW,QAAQ,CAAC,MAAM,CAAC;QAClC,MAAM,KAAK,GAAS,IAAI,WAAI,CAAC,IAAI,eAAM,EAAE,EAAE,IAAI,eAAM,EAAE,CAAC,CAAC;QACzD,MAAM,KAAK,GAAS,IAAI,WAAI,CAAC,IAAI,eAAM,EAAE,EAAE,IAAI,eAAM,EAAE,CAAC,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,0DAA0D;gBAC1D,kBAAkB;gBAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;oBACpH,SAAS;gBACX,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAEnC,MAAM,iBAAiB,GAAkB,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBACnE,IACE,iBAAiB;oBACjB,KAAK,CAAC,QAAQ,CAAC,iBAAiB,EAAE,gBAAgB,CAAC;oBACnD,KAAK,CAAC,QAAQ,CAAC,iBAAiB,EAAE,gBAAgB,CAAC,EACnD,CAAC;oBACD,4BAA4B;oBAC5B,MAAM,KAAK,GAAW,cAAc,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;oBAExE,wBAAwB;oBACxB,MAAM,WAAW,GAAyB,8BAA8B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;oBACnH,MAAM,YAAY,GAAyB,8BAA8B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;oBAEpH,OAAO,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,0CAA0C;QAC1C,kCAAkC;QAClC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACpB,CAAC,CAAC;IAEF,uDAAuD;IACvD,MAAM,cAAc,GAAG,CAAC,QAAuB,EAAE,UAAkB,EAAE,UAAkB,EAAE,iBAAyB,EAAU,EAAE;QAC5H,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,IAAI,MAAM,GAAkB,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,UAAU;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAE7C,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,WAAW;YAC7C,CAAC;YAED,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,IAAI,UAAU;gBAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhE,IAAI,CAAC,GAAG,UAAU;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACzB,CAAC,CAAC;IAEF,OAAO,6BAA6B,CAAC;AACvC,CAAC,CAAC,EAAE,CAAC"}

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

@@ -0,0 +1,16 @@
+/**
+ * The Sutherland-Hodgman convex polygon clipping algorithm.
+ *
+ * Original version:
+ *    https://rosettacode.org/wiki/Sutherland-Hodgman_polygon_clipping#JavaScript
+ *
+ * @author  Ikaros Kappler (ported to TypeScript with {x,y} vertices).
+ * @date    2021-01-29
+ * @version 1.0.0
+ */
+import { XYCoords } from "../../interfaces";
+/**
+ * @param {Array<XYCoords>} subjectPolygon - Can be any polygon.
+ * @param {Array<XYCoords>} clipPolygon - Must be convex.
+ */
+export declare const sutherlandHodgman: (subjectPolygon: Array<XYCoords>, clipPolygon: Array<XYCoords>) => Array<XYCoords>;

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

@@ -0,0 +1,76 @@
+"use strict";
+/**
+ * The Sutherland-Hodgman convex polygon clipping algorithm.
+ *
+ * Original version:
+ *    https://rosettacode.org/wiki/Sutherland-Hodgman_polygon_clipping#JavaScript
+ *
+ * @author  Ikaros Kappler (ported to TypeScript with {x,y} vertices).
+ * @date    2021-01-29
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sutherlandHodgman = void 0;
+/**
+ * @param {XYCoords}
+ * @param {XYCoords}
+ **/
+const inside = (cp1, cp2, p) => {
+    return (cp2.x - cp1.x) * (p.y - cp1.y) > (cp2.y - cp1.y) * (p.x - cp1.x);
+};
+/**
+ * @param {XYCoords}
+ * @param {XYCoords}
+ * @param {XYCoords}
+ * @param {XYCoords}
+ */
+const intersection = (cp1, cp2, s, e) => {
+    const dc = {
+        x: cp1.x - cp2.x,
+        y: cp1.y - cp2.y
+    };
+    const dp = {
+        x: s.x - e.x,
+        y: s.y - e.y
+    };
+    const n1 = cp1.x * cp2.y - cp1.y * cp2.x;
+    const n2 = s.x * e.y - s.y * e.x;
+    const n3 = 1.0 / (dc.x * dp.y - dc.y * dp.x);
+    return { x: (n1 * dp.x - n2 * dc.x) * n3,
+        y: (n1 * dp.y - n2 * dc.y) * n3
+    };
+};
+/**
+ * @param {Array<XYCoords>} subjectPolygon - Can be any polygon.
+ * @param {Array<XYCoords>} clipPolygon - Must be convex.
+ */
+const sutherlandHodgman = (subjectPolygon, clipPolygon) => {
+    let cp1 = clipPolygon[clipPolygon.length - 1];
+    let cp2;
+    let s;
+    let e;
+    let outputList = subjectPolygon;
+    for (var j in clipPolygon) {
+        cp2 = clipPolygon[j];
+        var inputList = outputList;
+        outputList = [];
+        s = inputList[inputList.length - 1]; // last on the input list
+        for (var i in inputList) {
+            e = inputList[i];
+            if (inside(cp1, cp2, e)) {
+                if (!inside(cp1, cp2, s)) {
+                    outputList.push(intersection(cp1, cp2, s, e));
+                }
+                outputList.push(e);
+            }
+            else if (inside(cp1, cp2, s)) {
+                outputList.push(intersection(cp1, cp2, s, e));
+            }
+            s = e;
+        }
+        cp1 = cp2;
+    }
+    return outputList;
+};
+exports.sutherlandHodgman = sutherlandHodgman;
+//# sourceMappingURL=sutherlandHodgman.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sutherlandHodgman.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/sutherlandHodgman.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAMH;;;IAGI;AACJ,MAAM,MAAM,GAAG,CAAE,GAAc,EAAE,GAAc,EAAE,CAAY,EAAa,EAAE;IACxE,OAAO,CAAC,GAAG,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,YAAY,GAAG,CAAE,GAAc,EAAE,GAAc,EAAE,CAAY,EAAE,CAAY,EAAc,EAAE;IAC7F,MAAM,EAAE,GAAc;QACzB,CAAC,EAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC,EAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;KACb,CAAC;IACF,MAAM,EAAE,GAAc;QACzB,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACZ,CAAC,EAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACT,CAAC;IACF,MAAM,EAAE,GAAY,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAClD,MAAM,EAAE,GAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAY,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,OAAO,EAAE,CAAC,EAAG,CAAC,EAAE,GAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE;QACnC,CAAC,EAAG,CAAC,EAAE,GAAC,EAAE,CAAC,CAAC,GAAG,EAAE,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE;KAC7B,CAAC;AACN,CAAC,CAAC;AAGF;;;GAGG;AACI,MAAM,iBAAiB,GAAG,CAAE,cAAgC,EAC5D,WAA6B,EAAqB,EAAE;IAEvD,IAAI,GAAG,GAAc,WAAW,CAAC,WAAW,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC;IACvD,IAAI,GAAc,CAAC;IACnB,IAAI,CAAY,CAAC;IACjB,IAAI,CAAY,CAAC;IAEjB,IAAI,UAAU,GAAqB,cAAc,CAAC;IAElD,KAAK,IAAI,CAAC,IAAI,WAAW,EAAG,CAAC;QACzB,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,SAAS,GAAG,UAAU,CAAC;QAC3B,UAAU,GAAG,EAAE,CAAC;QAChB,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,yBAAyB;QAC9D,KAAK,IAAI,CAAC,IAAI,SAAS,EAAG,CAAC;YAC9B,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,MAAM,CAAC,GAAG,EAAC,GAAG,EAAC,CAAC,CAAC,EAAG,CAAC;gBACd,IAAI,CAAC,MAAM,CAAC,GAAG,EAAC,GAAG,EAAC,CAAC,CAAC,EAAG,CAAC;oBACpC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAC,GAAG,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;gBACjC,CAAC;gBACD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC;iBAAM,IAAI,MAAM,CAAC,GAAG,EAAC,GAAG,EAAC,CAAC,CAAC,EAAG,CAAC;gBACrB,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,EAAC,GAAG,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;YACD,CAAC,GAAG,CAAC,CAAC;QACH,CAAC;QACD,GAAG,GAAG,GAAG,CAAC;IACd,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC,CAAA;AA9BY,QAAA,iBAAiB,GAAjB,iBAAiB,CA8B7B"}

package/src/_esm/utils/cloneVertexArray.d.ts

@@ -0,0 +1,13 @@
+/**
+ * The name says it.
+ *
+ * @requires Vertex
+ *
+ * @author   Ikaros Kappler
+ * @date     2020-12-20
+ * @modified 2021-02-09 Ported to TypeScript.
+ * @version  1.0.0
+ */
+import { Vertex } from "../Vertex";
+import { XYCoords } from "../interfaces";
+export declare const cloneVertexArray: (vertices: Array<XYCoords>) => Array<Vertex>;

package/src/_esm/utils/cloneVertexArray.js

@@ -0,0 +1,23 @@
+"use strict";
+/**
+ * The name says it.
+ *
+ * @requires Vertex
+ *
+ * @author   Ikaros Kappler
+ * @date     2020-12-20
+ * @modified 2021-02-09 Ported to TypeScript.
+ * @version  1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cloneVertexArray = void 0;
+const Vertex_1 = require("../Vertex");
+const cloneVertexArray = (vertices) => {
+    const result = [];
+    for (var i = 0; i < vertices.length; i++) {
+        result.push(new Vertex_1.Vertex(vertices[i].x, vertices[i].y));
+    }
+    return result;
+};
+exports.cloneVertexArray = cloneVertexArray;
+//# sourceMappingURL=cloneVertexArray.js.map

package/src/_esm/utils/cloneVertexArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cloneVertexArray.js","sourceRoot":"","sources":["../../ts/utils/cloneVertexArray.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAEH,sCAAmC;AAG5B,MAAM,gBAAgB,GAAG,CAAE,QAA0B,EAAmB,EAAE;IAC7E,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;QAC/C,MAAM,CAAC,IAAI,CAAE,IAAI,eAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;IACrD,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AANW,QAAA,gBAAgB,GAAhB,gBAAgB,CAM3B"}

package/src/_esm/utils/createRandomizedPolygon.d.ts

@@ -0,0 +1,14 @@
+/**
+ * A helper function to generate randmoized non-intersecting polygons.
+ *
+ * @author  Ikaros Kappler
+ * @date    2025-03-23 (ported to Typescript from a helper script from 2024)
+ * @version 1.0.0
+ */
+import { Bounds } from "../Bounds";
+import { Polygon } from "../Polygon";
+/**
+ * @param numVertices
+ * @returns
+ */
+export declare const createRandomizedPolygon: (numVertices: number, viewport: Bounds, createClockwise?: boolean) => Polygon;

package/src/_esm/utils/createRandomizedPolygon.js

@@ -0,0 +1,32 @@
+"use strict";
+/**
+ * A helper function to generate randmoized non-intersecting polygons.
+ *
+ * @author  Ikaros Kappler
+ * @date    2025-03-23 (ported to Typescript from a helper script from 2024)
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createRandomizedPolygon = void 0;
+const Polygon_1 = require("../Polygon");
+const Vertex_1 = require("../Vertex");
+/**
+ * @param numVertices
+ * @returns
+ */
+const createRandomizedPolygon = (numVertices, viewport, createClockwise) => {
+    const polygon = new Polygon_1.Polygon();
+    for (var i = 0; i < numVertices; i++) {
+        const vert = new Vertex_1.Vertex(viewport.getMinDimension() * 0.33, 0.0);
+        vert.rotate(((Math.PI * 2) / numVertices) * i);
+        vert.addXY(viewport.width * 0.1 * (1.0 - Math.random() * 2), viewport.height * 0.1 * (1.0 - Math.random() * 2));
+        polygon.addVertex(vert);
+    }
+    if (createClockwise && !polygon.isClockwise()) {
+        // Reverse
+        polygon.vertices = polygon.vertices.reverse();
+    }
+    return polygon;
+};
+exports.createRandomizedPolygon = createRandomizedPolygon;
+//# sourceMappingURL=createRandomizedPolygon.js.map

package/src/_esm/utils/createRandomizedPolygon.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"createRandomizedPolygon.js","sourceRoot":"","sources":["../../ts/utils/createRandomizedPolygon.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAGH,wCAAqC;AACrC,sCAAmC;AAEnC;;;GAGG;AAEI,MAAM,uBAAuB,GAAG,CAAC,WAAmB,EAAE,QAAgB,EAAE,eAAyB,EAAE,EAAE;IAC1G,MAAM,OAAO,GAAG,IAAI,iBAAO,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,eAAM,CAAC,QAAQ,CAAC,eAAe,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QAChE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAChH,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,eAAe,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;QAC9C,UAAU;QACV,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;IAChD,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAbW,QAAA,uBAAuB,GAAvB,uBAAuB,CAalC"}

package/src/_esm/utils/datastructures/CircularIntervalSet.d.ts

@@ -0,0 +1,83 @@
+/**
+ * @classdesc A circular interval set.
+ *
+ * @author   Ikaros Kappler
+ * @date     2020-10-02
+ * @modified 2020-10-18 Ported to Typescript from vanilla JS.
+ * @modified 2020-10-22 Added the removeAt funcion.
+ * @version  1.0.1
+ * @name CircularIntervalSet
+ **/
+export declare class CircularIntervalSet {
+    /**
+     * @member {number} start
+     * @memberof CircularIntervalSet
+     * @type {number}
+     * @instance
+     */
+    readonly start: number;
+    /**
+     * @member {number} end
+     * @memberof CircularIntervalSet
+     * @type {number}
+     * @instance
+     */
+    readonly end: number;
+    /**
+     * @member {Array<Array<number>>} intervals
+     * @memberof CircularIntervalSet
+     * @type {Array<Array<number>>}
+     * @instance
+     */
+    intervals: Array<Array<number>>;
+    /**
+     * Create a new CircularIntervalSet with the given lower and upperBound (start and end).
+     *
+     * The intervals inside lower and upper bound will initially be added to this set (full range).
+     *
+     * @param {number} start
+     * @param {number} end
+     * @method clear
+     * @memberof CircularIntervalSet
+     **/
+    constructor(start: number, end: number);
+    /**
+     * Clear this set (will be empty after this operation).
+     *
+     * @method clear
+     * @instance
+     * @memberof CircularIntervalSet
+     * @return {void}
+     **/
+    clear(): void;
+    /**
+     * Remove the interval at given index.
+     *
+     * @param {number} index
+     * @method removeAt
+     * @instance
+     * @memberof CircularIntervalSet
+     * @return {void}
+     **/
+    removeAt(index: number): void;
+    /**
+     * Intersect all sub intervalls with the given range (must be inside bounds).
+     *
+     * @param {number} start
+     * @param {number} end
+     * @method intersect
+     * @instance
+     * @memberof CircularIntervalSet
+     * @return {void}
+     **/
+    intersect(start: number, end: number): void;
+    /**
+     * Convert this set to a human readable string.
+     *
+     * @method toString
+     * @instance
+     * @memberof CircularIntervalSet
+     * @return {string}
+     **/
+    toString(): string;
+}

package/src/_esm/utils/datastructures/CircularIntervalSet.js

@@ -0,0 +1,162 @@
+"use strict";
+/**
+ * @classdesc A circular interval set.
+ *
+ * @author   Ikaros Kappler
+ * @date     2020-10-02
+ * @modified 2020-10-18 Ported to Typescript from vanilla JS.
+ * @modified 2020-10-22 Added the removeAt funcion.
+ * @version  1.0.1
+ * @name CircularIntervalSet
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CircularIntervalSet = void 0;
+class CircularIntervalSet {
+    /**
+     * Create a new CircularIntervalSet with the given lower and upperBound (start and end).
+     *
+     * The intervals inside lower and upper bound will initially be added to this set (full range).
+     *
+     * @param {number} start
+     * @param {number} end
+     * @method clear
+     * @memberof CircularIntervalSet
+     **/
+    constructor(start, end) {
+        this.start = start;
+        this.end = end;
+        this.intervals = [[start, end]];
+    }
+    ;
+    /**
+     * Clear this set (will be empty after this operation).
+     *
+     * @method clear
+     * @instance
+     * @memberof CircularIntervalSet
+     * @return {void}
+     **/
+    clear() {
+        this.intervals = [];
+    }
+    ;
+    /**
+     * Remove the interval at given index.
+     *
+     * @param {number} index
+     * @method removeAt
+     * @instance
+     * @memberof CircularIntervalSet
+     * @return {void}
+     **/
+    // Todo: remove? (not in use any more?)
+    removeAt(index) {
+        if (index < 0 || index >= this.intervals.length)
+            return;
+        this.intervals.splice(index, 1);
+    }
+    ;
+    /**
+     * Intersect all sub intervalls with the given range (must be inside bounds).
+     *
+     * @param {number} start
+     * @param {number} end
+     * @method intersect
+     * @instance
+     * @memberof CircularIntervalSet
+     * @return {void}
+     **/
+    intersect(start, end) {
+        for (var i = 0; i < this.intervals.length;) {
+            if (start <= end) {
+                if ((this.intervals[i][0] >= end || this.intervals[i][1] <= start)) {
+                    // Current interval is fully outside range.
+                    // REMOVE
+                    this.intervals.splice(i, 1);
+                }
+                else if (this.intervals[i][0] >= start && this.intervals[i][1] <= end) {
+                    // Current interval is fully inside.
+                    // KEEP
+                    i++;
+                }
+                else if (this.intervals[i][0] <= start && this.intervals[i][1] >= end) {
+                    // Desired range lies inside current interval.
+                    // CUT OFF LEFT AND RIGHT.
+                    this.intervals.splice(i, 1, [start, end]);
+                    i++;
+                }
+                else if (this.intervals[i][0] <= start && this.intervals[i][1] < end) {
+                    // Right end is inside range.
+                    // CUT OFF LEFT.
+                    this.intervals[i][0] = start;
+                    i++;
+                }
+                else if (this.intervals[i][0] > start && this.intervals[i][1] >= end) {
+                    // LEFT end is inside range.
+                    // CUT OFF RIGHT.
+                    this.intervals[i][1] = end;
+                    i++;
+                }
+                else {
+                    // NOOP
+                    i++;
+                }
+            }
+            else {
+                // start > end
+                if (this.intervals[i][0] >= end && this.intervals[i][1] <= start) {
+                    // Current interval is fully outside range.
+                    // REMOVE
+                    this.intervals.splice(i, 1);
+                }
+                else if (this.intervals[i][0] >= start) {
+                    // Full inside (right range).
+                    // Keep.
+                    i++;
+                }
+                else if (this.intervals[i][1] <= end) {
+                    // Full inside (left range).
+                    // Keep.
+                    i++;
+                }
+                else if (this.intervals[i][0] >= end && this.intervals[i][1] > start) {
+                    // Right part inside.
+                    // Cut off left part.
+                    this.intervals.splice(i, 1, [start, this.intervals[i][1]]);
+                    i++;
+                }
+                else if (this.intervals[i][0] <= end && this.intervals[i][1] < start) {
+                    // Left part inside.
+                    // Cut off right part.
+                    this.intervals.splice(i, 1, [this.intervals[i][0], end]);
+                    i++;
+                }
+                else if (this.intervals[i][0] <= end && this.intervals[i][1] >= start) {
+                    // Start and end inside, inner part is not.
+                    // Cut into two.
+                    this.intervals.splice(i, 1, [this.intervals[i][0], end], [start, this.intervals[i][1]]);
+                    i += 2;
+                }
+                else {
+                    // NOOP
+                    i++;
+                }
+            }
+        }
+    }
+    ;
+    /**
+     * Convert this set to a human readable string.
+     *
+     * @method toString
+     * @instance
+     * @memberof CircularIntervalSet
+     * @return {string}
+     **/
+    toString() {
+        return JSON.stringify(this.intervals);
+    }
+    ;
+}
+exports.CircularIntervalSet = CircularIntervalSet;
+//# sourceMappingURL=CircularIntervalSet.js.map

package/src/_esm/utils/datastructures/CircularIntervalSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CircularIntervalSet.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/CircularIntervalSet.ts"],"names":[],"mappings":";AAAA;;;;;;;;;IASI;;;AAEJ;IA2BI;;;;;;;;;QASI;IACJ,YAAa,KAAY,EAAE,GAAU;QACxC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QAEf,IAAI,CAAC,SAAS,GAAG,CAAE,CAAC,KAAK,EAAE,GAAG,CAAC,CAAE,CAAC;IAC/B,CAAC;IAAA,CAAC;IAGF;;;;;;;QAOI;IACJ,KAAK;QACR,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACjB,CAAC;IAAA,CAAC;IAGF;;;;;;;;QAQI;IACJ,uCAAuC;IACvC,QAAQ,CAAC,KAAY;QACxB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3C,OAAO;QACX,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,KAAK,EAAE,CAAC,CAAE,CAAC;IAC/B,CAAC;IAAA,CAAC;IAGF;;;;;;;;;QASI;IACJ,SAAS,CAAE,KAAY,EAAE,GAAU;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAI,CAAC;YAC1C,IAAI,KAAK,IAAI,GAAG,EAAG,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,EAAG,CAAC;oBAClE,2CAA2C;oBAC3C,SAAS;oBACT,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;gBAClC,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAG,CAAC;oBACvE,oCAAoC;oBACpC,OAAO;oBACP,CAAC,EAAE,CAAC;gBACR,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAG,CAAC;oBACvE,8CAA8C;oBAC9C,0BAA0B;oBAC1B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAC,GAAG,CAAC,CAAE,CAAC;oBAC3C,CAAC,EAAE,CAAC;gBACR,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAG,CAAC;oBACtE,6BAA6B;oBAC7B,gBAAgB;oBAChB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBAC7B,CAAC,EAAE,CAAC;gBACR,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAG,CAAC;oBACtE,4BAA4B;oBAC5B,iBAAiB;oBACjB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;oBAC3B,CAAC,EAAE,CAAC;gBACR,CAAC;qBAAM,CAAC;oBACJ,OAAO;oBACP,CAAC,EAAE,CAAC;gBACR,CAAC;YACE,CAAC;iBAAM,CAAC;gBACX,cAAc;gBACd,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAG,CAAC;oBAChE,2CAA2C;oBAC3C,SAAS;oBACT,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;gBAClC,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAG,CAAC;oBACxC,6BAA6B;oBAC7B,QAAQ;oBACR,CAAC,EAAE,CAAC;gBACR,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAG,CAAC;oBACtC,4BAA4B;oBAC5B,QAAQ;oBACR,CAAC,EAAE,CAAC;gBACR,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAG,CAAC;oBACtE,qBAAqB;oBACrB,qBAAqB;oBACrB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;oBAC5D,CAAC,EAAE,CAAC;gBACR,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAG,CAAC;oBACtE,oBAAoB;oBACpB,sBAAsB;oBACtB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,GAAG,CAAC,CAAE,CAAC;oBAC1D,CAAC,EAAE,CAAC;gBACR,CAAC;qBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAG,CAAC;oBACvE,2CAA2C;oBAC3C,gBAAgB;oBAChB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;oBACxF,CAAC,IAAE,CAAC,CAAC;gBACT,CAAC;qBAAM,CAAC;oBACJ,OAAO;oBACP,CAAC,EAAE,CAAC;gBACR,CAAC;YAEE,CAAC;QACL,CAAC;IACE,CAAC;IAAA,CAAC;IAGF;;;;;;;QAOI;IACJ,QAAQ;QACX,OAAO,IAAI,CAAC,SAAS,CAAE,IAAI,CAAC,SAAS,CAAE,CAAC;IACrC,CAAC;IAAA,CAAC;CAEL"}