plotboilerplate 1.28.0 → 1.29.0

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

@@ -1,28 +0,0 @@
-/**
- * @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/_cjs/utils/algorithms/splitPolygonToNonIntersecting.js

@@ -1,102 +0,0 @@
-"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;
-var Line_1 = require("../../Line");
-var 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 = (function () {
-    /**
-     * @param {Array<Vertex>} vertices
-     * @param {number=10} maxDepth
-     */
-    var splitPolygonToNonIntersecting = function (vertices, maxDepth, insideBoundsOnly) {
-        if (typeof maxDepth === "undefined")
-            maxDepth = 10;
-        return _splitPolygonToNonIntersecting(vertices, maxDepth, insideBoundsOnly);
-    };
-    var _splitPolygonToNonIntersecting = function (vertices, maxDepth, insideBoundsOnly) {
-        if (maxDepth <= 0) {
-            // aborting at max depth
-            return [vertices];
-        }
-        if (vertices.length <= 3) {
-            // No intersections possible
-            return [vertices];
-        }
-        var n = vertices.length;
-        var lineA = new Line_1.Line(new Vertex_1.Vertex(), new Vertex_1.Vertex());
-        var 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]);
-                var intersectionPoint = lineA.intersection(lineB);
-                if (intersectionPoint &&
-                    lineA.hasPoint(intersectionPoint, insideBoundsOnly) &&
-                    lineB.hasPoint(intersectionPoint, insideBoundsOnly)) {
-                    // Cut polygon into two here
-                    var split = splitPolygonAt(vertices, a, b, intersectionPoint);
-                    // Split has 2 elements.
-                    var leftCleaned = _splitPolygonToNonIntersecting(split[0], maxDepth - 1, insideBoundsOnly);
-                    var 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
-    var splitPolygonAt = function (vertices, edgeIndexA, edgeIndexB, intersectionPoint) {
-        var 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/_cjs/utils/algorithms/splitPolygonToNonIntersecting.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"splitPolygonToNonIntersecting.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/splitPolygonToNonIntersecting.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAEH,mCAAkC;AAClC,uCAAsC;AAOtC;;;;;;;;;;;;;;;GAeG;AACU,QAAA,6BAA6B,GAAG,CAAC;IAC5C;;;OAGG;IACH,IAAM,6BAA6B,GAAG,UACpC,QAAuB,EACvB,QAAiB,EACjB,gBAA0B;QAE1B,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,IAAM,8BAA8B,GAAG,UACrC,QAAuB,EACvB,QAAgB,EAChB,gBAA0B;QAE1B,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,IAAM,CAAC,GAAW,QAAQ,CAAC,MAAM,CAAC;QAClC,IAAM,KAAK,GAAS,IAAI,WAAI,CAAC,IAAI,eAAM,EAAE,EAAE,IAAI,eAAM,EAAE,CAAC,CAAC;QACzD,IAAM,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,IAAM,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,IAAM,KAAK,GAAW,cAAc,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;oBAExE,wBAAwB;oBACxB,IAAM,WAAW,GAAyB,8BAA8B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;oBACnH,IAAM,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,IAAM,cAAc,GAAG,UAAC,QAAuB,EAAE,UAAkB,EAAE,UAAkB,EAAE,iBAAyB;QAChH,IAAM,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/_cjs/utils/algorithms/sutherlandHodgman.d.ts

@@ -1,16 +0,0 @@
-/**
- * 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/_cjs/utils/algorithms/sutherlandHodgman.js

@@ -1,76 +0,0 @@
-"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}
- **/
-var inside = function (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}
- */
-var intersection = function (cp1, cp2, s, e) {
-    var dc = {
-        x: cp1.x - cp2.x,
-        y: cp1.y - cp2.y
-    };
-    var dp = {
-        x: s.x - e.x,
-        y: s.y - e.y
-    };
-    var n1 = cp1.x * cp2.y - cp1.y * cp2.x;
-    var n2 = s.x * e.y - s.y * e.x;
-    var 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.
- */
-var sutherlandHodgman = function (subjectPolygon, clipPolygon) {
-    var cp1 = clipPolygon[clipPolygon.length - 1];
-    var cp2;
-    var s;
-    var e;
-    var 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/_cjs/utils/algorithms/sutherlandHodgman.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sutherlandHodgman.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/sutherlandHodgman.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAMH;;;IAGI;AACJ,IAAM,MAAM,GAAG,UAAE,GAAc,EAAE,GAAc,EAAE,CAAY;IACzD,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,IAAM,YAAY,GAAG,UAAE,GAAc,EAAE,GAAc,EAAE,CAAY,EAAE,CAAY;IAC7E,IAAM,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,IAAM,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,IAAM,EAAE,GAAY,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAClD,IAAM,EAAE,GAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1C,IAAM,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,IAAM,iBAAiB,GAAG,UAAE,cAAgC,EAC5D,WAA6B;IAEhC,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,qBA8B7B"}

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

@@ -1,13 +0,0 @@
-/**
- * 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/_cjs/utils/cloneVertexArray.js

@@ -1,23 +0,0 @@
-"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;
-var Vertex_1 = require("../Vertex");
-var cloneVertexArray = function (vertices) {
-    var 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/_cjs/utils/cloneVertexArray.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cloneVertexArray.js","sourceRoot":"","sources":["../../ts/utils/cloneVertexArray.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAEH,oCAAmC;AAG5B,IAAM,gBAAgB,GAAG,UAAE,QAA0B;IACxD,IAAM,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,oBAM3B"}

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

@@ -1,14 +0,0 @@
-/**
- * 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/_cjs/utils/createRandomizedPolygon.js

@@ -1,32 +0,0 @@
-"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;
-var Polygon_1 = require("../Polygon");
-var Vertex_1 = require("../Vertex");
-/**
- * @param numVertices
- * @returns
- */
-var createRandomizedPolygon = function (numVertices, viewport, createClockwise) {
-    var polygon = new Polygon_1.Polygon();
-    for (var i = 0; i < numVertices; i++) {
-        var 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/_cjs/utils/createRandomizedPolygon.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"createRandomizedPolygon.js","sourceRoot":"","sources":["../../ts/utils/createRandomizedPolygon.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAGH,sCAAqC;AACrC,oCAAmC;AAEnC;;;GAGG;AAEI,IAAM,uBAAuB,GAAG,UAAC,WAAmB,EAAE,QAAgB,EAAE,eAAyB;IACtG,IAAM,OAAO,GAAG,IAAI,iBAAO,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAM,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,2BAalC"}