plotboilerplate 1.27.1 → 1.28.0

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

@@ -0,0 +1,81 @@
+/**
+ * @classdesc A HobbyCurve/HobbyPath calculation class: compute a set of optimal
+ *            cubic Bézier curves from a sequence of vertices.
+ *
+ * This Hobby curve (path) implementation was strongly inspired by
+ * the one by Prof. Dr. Edmund Weitz:
+ * Here's the website:
+ *  http://weitz.de/hobby/
+ *
+ * @date     2020-04-07
+ * @author   Transformed to a JS-class by Ikaros Kappler
+ * @modified 2020-08-19 Ported from vanilla JS to TypeScript.
+ * @version 1.0.1
+ *
+ * @file HobbyPath
+ * @public
+ **/
+import { CubicBezierCurve } from "../../CubicBezierCurve";
+import { Vertex } from "../../Vertex";
+/**
+ * @classdesc A HobbyCurve/HobbyPath calculation class: compute a set of optimal
+ *            cubic Bézier curves from a sequence of vertices.
+ *
+ * @requires CubicBezierCurve
+ * @requires Vertex
+ */
+export declare class HobbyPath {
+    /**
+     * @member {Array<Vertex>} vertices
+     * @memberof HobbyPath
+     * @type {Array<Vertex>}
+     * @instance
+     **/
+    private vertices;
+    /**
+     * @constructor
+     * @name HobbyPath
+     * @param {Array<Vertex>=} vertices? - An optional array of vertices to initialize the path with.
+     **/
+    constructor(vertices?: Array<Vertex>);
+    /**
+     * Add a new point to the end of the vertex sequence.
+     *
+     * @name addPoint
+     * @memberof HobbyPath
+     * @instance
+     * @param {Vertex} p - The vertex (point) to add.
+     **/
+    addPoint(p: Vertex): void;
+    /**
+     * Generate a sequence of cubic Bézier curves from the point set.
+     *
+     * @name generateCurve
+     * @memberof HobbyPath
+     * @instance
+     * @param {boolean=} circular - Specify if the path should be closed.
+     * @param {number=0} omega - (default=0) An optional tension parameter.
+     * @return Array<CubicBezierCurve>
+     **/
+    generateCurve(circular?: boolean, omega?: number): Array<CubicBezierCurve>;
+    /**
+     * Computes the control point coordinates for a Hobby curve through
+     * the points given.
+     *
+     * @name hobbyControls
+     * @memberof HobbyPath
+     * @instance
+     * @param {boolean}  circular - If true, then the path will be closed.
+     * @param {number=0} omega    - The 'curl' or the path.
+     * @return {IControlPoints} An object with two members: startControlPoints and endControlPoints (Array<Vertex>).
+     **/
+    private hobbyControls;
+    static utils: {
+        rotate: (vert: Vertex, sin: number, cos: number) => Vertex;
+        rotateAngle: (vert: Vertex, alpha: number) => Vertex;
+        normalize: (vec: Vertex) => Vertex;
+        rho: (a: number, b: number) => number;
+        thomas: (a: Array<number>, b: Array<number>, c: Array<number>, d: Array<number>) => Array<number>;
+        sherman: (a: Array<number>, b: Array<number>, c: Array<number>, d: Array<number>, s: number, t: number) => Array<number>;
+    };
+}

package/src/_esm/src/ts/utils/algorithms/HobbyPath.js

@@ -0,0 +1,273 @@
+/**
+ * @classdesc A HobbyCurve/HobbyPath calculation class: compute a set of optimal
+ *            cubic Bézier curves from a sequence of vertices.
+ *
+ * This Hobby curve (path) implementation was strongly inspired by
+ * the one by Prof. Dr. Edmund Weitz:
+ * Here's the website:
+ *  http://weitz.de/hobby/
+ *
+ * @date     2020-04-07
+ * @author   Transformed to a JS-class by Ikaros Kappler
+ * @modified 2020-08-19 Ported from vanilla JS to TypeScript.
+ * @version 1.0.1
+ *
+ * @file HobbyPath
+ * @public
+ **/
+import { CubicBezierCurve } from "../../CubicBezierCurve";
+import { Vertex } from "../../Vertex";
+;
+/**
+ * @classdesc A HobbyCurve/HobbyPath calculation class: compute a set of optimal
+ *            cubic Bézier curves from a sequence of vertices.
+ *
+ * @requires CubicBezierCurve
+ * @requires Vertex
+ */
+export class HobbyPath {
+    /**
+     * @constructor
+     * @name HobbyPath
+     * @param {Array<Vertex>=} vertices? - An optional array of vertices to initialize the path with.
+     **/
+    constructor(vertices) {
+        this.vertices = vertices ? vertices : [];
+    }
+    ;
+    /**
+     * Add a new point to the end of the vertex sequence.
+     *
+     * @name addPoint
+     * @memberof HobbyPath
+     * @instance
+     * @param {Vertex} p - The vertex (point) to add.
+     **/
+    addPoint(p) {
+        this.vertices.push(p);
+    }
+    ;
+    /**
+     * Generate a sequence of cubic Bézier curves from the point set.
+     *
+     * @name generateCurve
+     * @memberof HobbyPath
+     * @instance
+     * @param {boolean=} circular - Specify if the path should be closed.
+     * @param {number=0} omega - (default=0) An optional tension parameter.
+     * @return Array<CubicBezierCurve>
+     **/
+    generateCurve(circular, omega) {
+        let n = this.vertices.length;
+        if (n > 1) {
+            if (n == 2) {
+                // for two points, just draw a straight line
+                return [new CubicBezierCurve(this.vertices[0], this.vertices[1], this.vertices[0], this.vertices[1])];
+            }
+            else {
+                const curves = [];
+                let controlPoints = this.hobbyControls(circular, omega);
+                for (let i = 0; i < n - (circular ? 0 : 1); i++) {
+                    // if i is n-1, the "next" point is the first one
+                    let j = (i + 1) % n; // Use a succ function here?
+                    curves.push(new CubicBezierCurve(this.vertices[i], this.vertices[j], controlPoints.startControlPoints[i], controlPoints.endControlPoints[i]));
+                }
+                return curves;
+            }
+        }
+        else {
+            return [];
+        }
+    }
+    ;
+    /**
+     * Computes the control point coordinates for a Hobby curve through
+     * the points given.
+     *
+     * @name hobbyControls
+     * @memberof HobbyPath
+     * @instance
+     * @param {boolean}  circular - If true, then the path will be closed.
+     * @param {number=0} omega    - The 'curl' or the path.
+     * @return {IControlPoints} An object with two members: startControlPoints and endControlPoints (Array<Vertex>).
+     **/
+    hobbyControls(circular, omega) {
+        // This is a version that works for both, closed and non-closed paths.
+        if (typeof omega === 'undefined')
+            omega = 0;
+        let n = this.vertices.length - (circular ? 0 : 1);
+        let D = new Array(n);
+        let ds = new Array(n);
+        var succ = (i) => { return circular ? ((i + 1) % n) : (i + 1); };
+        var pred = (i) => { return circular ? ((i + n - 1) % n) : (i - 1); };
+        for (let i = 0; i < n; i++) {
+            // the "next" point in a modular way
+            let j = succ(i);
+            ds[i] = this.vertices[i].difference(this.vertices[j]);
+            D[i] = Math.sqrt(ds[i].x * ds[i].x + ds[i].y * ds[i].y);
+        }
+        let gamma = new Array(n + (circular ? 0 : 1));
+        for (let i = (circular ? 0 : 1); i < n; i++) {
+            // the "previous" point in a modular way
+            let k = pred(i);
+            let sin = ds[k].y / D[k];
+            let cos = ds[k].x / D[k];
+            let vec = HobbyPath.utils.rotate(ds[i], -sin, cos);
+            gamma[i] = Math.atan2(vec.y, vec.x);
+        }
+        if (!circular)
+            gamma[n] = 0;
+        let a = new Array(n + (circular ? 0 : 1));
+        let b = new Array(n + (circular ? 0 : 1));
+        let c = new Array(n + (circular ? 0 : 1));
+        let d = new Array(n + (circular ? 0 : 1));
+        for (let i = (circular ? 0 : 1); i < n; i++) {
+            // j is the "next" point, k the "previous" one
+            let j = succ(i);
+            let k = pred(i);
+            // see video for the equations
+            a[i] = 1 / D[k];
+            b[i] = (2 * D[k] + 2 * D[i]) / (D[k] * D[i]);
+            c[i] = 1 / D[i];
+            d[i] = -(2 * gamma[i] * D[i] + gamma[j] * D[k]) / (D[k] * D[i]);
+        }
+        // make matrix tridiagonal in preparation for the "sherman" function
+        var alpha;
+        var beta;
+        if (circular) {
+            let s = a[0] * omega; // Use omega here?
+            a[0] = 0;
+            let t = c[n - 1] * omega; // Use omega here?
+            c[n - 1] = 0;
+            alpha = HobbyPath.utils.sherman(a, b, c, d, s, t);
+            beta = new Array(n);
+            for (let i = 0; i < n - (circular ? 0 : 1); i++) {
+                // "next" point
+                let j = succ(i);
+                beta[i] = -gamma[j] - alpha[j];
+            }
+        }
+        else {
+            // see the Jackowski article for the following values; the result
+            // will be that the curvature at the first point is identical to the
+            // curvature at the second point (and likewise for the last and
+            // second-to-last)
+            b[0] = 2 + omega;
+            c[0] = 2 * omega + 1;
+            d[0] = -c[0] * gamma[1];
+            a[n] = 2 * omega + 1;
+            b[n] = 2 + omega;
+            d[n] = 0;
+            // solve system for the angles called "alpha" in the video
+            alpha = HobbyPath.utils.thomas(a, b, c, d);
+            // compute "beta" angles from "alpha" angles
+            beta = new Array(n);
+            for (let i = 0; i < n - 1; i++)
+                beta[i] = -gamma[i + 1] - alpha[i + 1];
+            // again, see Jackowski article
+            beta[n - 1] = -alpha[n];
+        }
+        let startControlPoints = new Array(n);
+        let endControlPoints = new Array(n);
+        for (let i = 0; i < n; i++) {
+            let j = succ(i);
+            let a = HobbyPath.utils.rho(alpha[i], beta[i]) * D[i] / 3;
+            let b = HobbyPath.utils.rho(beta[i], alpha[i]) * D[i] / 3;
+            let v = HobbyPath.utils.normalize(HobbyPath.utils.rotateAngle(ds[i], alpha[i]));
+            startControlPoints[i] = new Vertex(this.vertices[i].x + a * v.x, this.vertices[i].y + a * v.y);
+            v = HobbyPath.utils.normalize(HobbyPath.utils.rotateAngle(ds[i], -beta[i]));
+            endControlPoints[i] = new Vertex(this.vertices[j].x - b * v.x, this.vertices[j].y - b * v.y);
+        }
+        return { startControlPoints: startControlPoints,
+            endControlPoints: endControlPoints
+        };
+    }
+}
+HobbyPath.utils = {
+    // rotates a vector [x, y] about an angle; the angle is implicitly
+    // determined by its sine and cosine
+    rotate: (vert, sin, cos) => {
+        return new Vertex(vert.x * cos - vert.y * sin, vert.x * sin + vert.y * cos);
+    },
+    // rotates a vector [x, y] about the angle alpha
+    rotateAngle: (vert, alpha) => {
+        return HobbyPath.utils.rotate(vert, Math.sin(alpha), Math.cos(alpha));
+    },
+    // returns a normalized version of the vector
+    normalize: (vec) => {
+        let n = Math.hypot(vec.x, vec.y);
+        if (n == 0)
+            return new Vertex(0, 0);
+        else
+            return new Vertex(vec.x / n, vec.y / n); // TODO: do in-place
+    },
+    // the "velocity function" (also called rho in the video); a and b are
+    // the angles alpha and beta, the return value is the distance between
+    // a control point and its neighboring point; to compute sigma(a,b)
+    // we'll simply use rho(b,a)
+    rho: (a, b) => {
+        // see video for formula
+        let sa = Math.sin(a);
+        let sb = Math.sin(b);
+        let ca = Math.cos(a);
+        let cb = Math.cos(b);
+        let s5 = Math.sqrt(5);
+        let num = 4 + Math.sqrt(8) * (sa - sb / 16) * (sb - sa / 16) * (ca - cb);
+        let den = 2 + (s5 - 1) * ca + (3 - s5) * cb;
+        return num / den;
+    },
+    // Implements the Thomas algorithm for a tridiagonal system with i-th
+    // row a[i]x[i-1] + b[i]x[i] + c[i]x[i+1] = d[i] starting with row
+    // i=0, ending with row i=n-1 and with a[0] = c[n-1] = 0.  Returns the
+    // values x[i] as an array.
+    thomas: (a, b, c, d) => {
+        let n = a.length;
+        let cc = new Array(n);
+        let dd = new Array(n);
+        // forward sweep
+        cc[0] = c[0] / b[0];
+        dd[0] = d[0] / b[0];
+        for (let i = 1; i < n; i++) {
+            let den = b[i] - cc[i - 1] * a[i];
+            cc[i] = c[i] / den;
+            dd[i] = (d[i] - dd[i - 1] * a[i]) / den;
+        }
+        let x = new Array(n);
+        // back substitution
+        x[n - 1] = dd[n - 1];
+        for (let i = n - 2; i >= 0; i--)
+            x[i] = dd[i] - cc[i] * x[i + 1];
+        return x;
+    },
+    // Solves an "almost" tridiagonal linear system with i-th row
+    // a[i]x[i-1] + b[i]x[i] + c[i]x[i+1] = d[i] starting with row i=0,
+    // ending with row i=n-1 and with a[0] = c[n-1] = 0.  Returns the
+    // values x[i] as an array.  The system is not really tridiagonal
+    // because the 0-th row is b[0]x[0] + c[0]x[1] + sx[n-1] = d[0] and
+    // row n-1 is tx[0] + a[n-1]x[n-2] + b[n-1]x[n-1] = d[n-1].  The
+    // Sherman-Morrison-Woodbury formula is used so that the function
+    // "thomas" can be called to solve the system.
+    sherman: (a, b, c, d, s, t) => {
+        const n = a.length;
+        const u = new Array(n);
+        u.fill(0, 1, n - 1);
+        u[0] = 1;
+        u[n - 1] = 1;
+        let v = new Array(n);
+        v.fill(0, 1, n - 1);
+        v[0] = t;
+        v[n - 1] = s;
+        b[0] -= t;
+        b[n - 1] -= s;
+        // this would be more efficient if computed in parallel, but hey...
+        const Td = HobbyPath.utils.thomas(a, b, c, d);
+        const Tu = HobbyPath.utils.thomas(a, b, c, u);
+        const factor = (t * Td[0] + s * Td[n - 1]) / (1 + t * Tu[0] + s * Tu[n - 1]);
+        const x = new Array(n);
+        for (let i = 0; i < n; i++)
+            x[i] = Td[i] - factor * Tu[i];
+        return x;
+    }
+};
+; // END class
+//# sourceMappingURL=HobbyPath.js.map

package/src/_esm/src/ts/utils/algorithms/HobbyPath.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HobbyPath.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/HobbyPath.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;IAgBI;AAEJ,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAKrC,CAAC;AAGF;;;;;;GAMG;AACH,MAAM,OAAO,SAAS;IAUlB;;;;QAII;IACJ,YAAa,QAAuB;QACvC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,CAAC;IAAA,CAAC;IAGF;;;;;;;QAOI;IACJ,QAAQ,CAAC,CAAS;QACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAE,CAAC,CAAE,CAAC;IACrB,CAAC;IAAA,CAAC;IAGF;;;;;;;;;QASI;IACJ,aAAa,CAAE,QAAiB,EAAE,KAAa;QAClD,IAAI,CAAC,GAAY,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACtC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACR,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChB,4CAA4C;gBAC5C,OAAO,CAAE,IAAI,gBAAgB,CACzB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAChB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAChB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAChB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CACnB,CAAE,CAAC;YACD,CAAC;iBAAM,CAAC;gBACX,MAAM,MAAM,GAA6B,EAAE,CAAC;gBAC5C,IAAI,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAC,KAAK,CAAC,CAAC;gBACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,iDAAiD;oBACjD,IAAI,CAAC,GAAY,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,4BAA4B;oBACxD,MAAM,CAAC,IAAI,CAAE,IAAI,gBAAgB,CACpC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAChB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAChB,aAAa,CAAC,kBAAkB,CAAC,CAAC,CAAC,EACnC,aAAa,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAC7B,CAAE,CAAC;gBACR,CAAC;gBACD,OAAO,MAAM,CAAC;YACX,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,OAAO,EAAE,CAAC;QACd,CAAC;IACE,CAAC;IAAA,CAAC;IAGF;;;;;;;;;;QAUI;IACI,aAAa,CAAC,QAAiB,EAAE,KAAa;QACzD,sEAAsE;QAEtE,IAAI,OAAO,KAAK,KAAK,WAAW;YAC5B,KAAK,GAAG,CAAC,CAAC;QAEd,IAAI,CAAC,GAAY,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,IAAI,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAE7C,IAAI,EAAE,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC9C,IAAI,IAAI,GAAG,CAAC,CAAQ,EAAW,EAAE,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAA,CAAC,CAAC,CAAC;QAC1E,IAAI,IAAI,GAAG,CAAC,CAAQ,EAAW,EAAE,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAA,CAAC,CAAC,CAAC;QAElF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,oCAAoC;YACpC,IAAI,CAAC,GAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAC;YACxD,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,KAAK,GAAmB,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,CAAC,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,wCAAwC;YACxC,IAAI,CAAC,GAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACnD,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,IAAI,CAAC,QAAQ;YACT,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,GAAmB,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,GAAmB,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,GAAmB,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,GAAmB,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,CAAC,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,8CAA8C;YAC9C,IAAI,CAAC,GAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,GAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,8BAA8B;YAC9B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,oEAAoE;QACpE,IAAI,KAAqB,CAAC;QAC1B,IAAI,IAAoB,CAAC;QACzB,IAAI,QAAQ,EAAG,CAAC;YACZ,IAAI,CAAC,GAAY,CAAC,CAAC,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,kBAAkB;YAC/C,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,IAAI,CAAC,GAAY,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,kBAAkB;YACjD,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAA,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,eAAe;gBACf,IAAI,CAAC,GAAY,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,iEAAiE;YACjE,oEAAoE;YACpE,+DAA+D;YAC/D,kBAAkB;YAClB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YACjB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACrB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACrB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YACjB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,0DAA0D;YAC1D,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,4CAA4C;YAC5C,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACjC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,IAAI,kBAAkB,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC9C,IAAI,gBAAgB,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzB,IAAI,CAAC,GAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,GAAY,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnE,IAAI,CAAC,GAAY,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnE,IAAI,CAAC,GAAY,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzF,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YACjG,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACnG,CAAC;QACD,OAAO,EAAE,kBAAkB,EAAG,kBAAkB;YAC9C,gBAAgB,EAAE,gBAAgB;SAC5B,CAAC;IACN,CAAC;CAmGJ;AAjGU,eAAK,GAAG;IAClB,kEAAkE;IAClE,oCAAoC;IACpC,MAAM,EAAG,CAAC,IAAY,EACnB,GAAW,EACX,GAAW,EAAW,EAAE;QACvB,OAAO,IAAI,MAAM,CAAE,IAAI,CAAC,CAAC,GAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAC,GAAG,EAAE,IAAI,CAAC,CAAC,GAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAC,GAAG,CAAE,CAAC;IAC1E,CAAC;IACD,gDAAgD;IAChD,WAAW,EAAE,CAAC,IAAY,EAAE,KAAa,EAAW,EAAE;QAClD,OAAO,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1E,CAAC;IACD,6CAA6C;IAC7C,SAAS,EAAG,CAAC,GAAW,EAAW,EAAE;QACjC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC;YACb,OAAO,IAAI,MAAM,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;;YAEvB,OAAO,IAAI,MAAM,CAAE,GAAG,CAAC,CAAC,GAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAC,CAAC,CAAE,CAAC,CAAC,oBAAoB;IAC5D,CAAC;IACD,sEAAsE;IACtE,sEAAsE;IACtE,mEAAmE;IACnE,4BAA4B;IAC5B,GAAG,EAAG,CAAC,CAAS,EACT,CAAS,EAAW,EAAE;QACzB,wBAAwB;QACxB,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACrE,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QAC5C,OAAO,GAAG,GAAC,GAAG,CAAC;IACnB,CAAC;IACD,qEAAqE;IACrE,kEAAkE;IAClE,sEAAsE;IACtE,2BAA2B;IAC3B,MAAM,EAAG,CAAC,CAAgB,EACvB,CAAgB,EAChB,CAAgB,EAChB,CAAgB,EAAkB,EAAE;QACnC,IAAI,CAAC,GAAY,CAAC,CAAC,MAAM,CAAC;QAC1B,IAAI,EAAE,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC9C,IAAI,EAAE,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC9C,gBAAgB;QAChB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,GAAG,GAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACnB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC7C,oBAAoB;QACpB,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAChC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QACzB,OAAO,CAAC,CAAC;IACb,CAAC;IACD,6DAA6D;IAC7D,mEAAmE;IACnE,iEAAiE;IACjE,iEAAiE;IACjE,mEAAmE;IACnE,gEAAgE;IAChE,iEAAiE;IACjE,8CAA8C;IAC9C,OAAO,EAAG,CAAE,CAAgB,EACvB,CAAgB,EAChB,CAAgB,EAChB,CAAgB,EAChB,CAAS,EACT,CAAS,EAAkB,EAAE;QAC9B,MAAM,CAAC,GAAY,CAAC,CAAC,MAAM,CAAC;QAC5B,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACT,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACT,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACV,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACZ,mEAAmE;QACnE,MAAM,EAAE,GAAmB,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,GAAmB,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAY,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC7B,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,CAAC,CAAC;IACb,CAAC;CACG,CAAC;AACL,CAAC,CAAC,YAAY"}

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

@@ -0,0 +1,30 @@
+/**
+ * Algorithm:
+ *  Input Circles
+ *      -> filter out fully contained circles
+ *      -> build outer containing circles (given by detect radius)
+ *      -> find radical lines
+ *
+ * This implementation currently does not detect any holes.
+ *
+ * @author  Ikaros Kappler
+ * @version 1.0.0
+ * @date    2024-03-01
+ */
+import { Circle } from "../../Circle";
+interface MetaballsOptions {
+    metaRadiusAddon: number;
+}
+export declare class Metaballs {
+    private circleIsFullyContained;
+    private inputCircles;
+    private circlesOfInterest;
+    private containingCircles;
+    private inverseCirclesPairs;
+    constructor(inputCircles: Array<Circle>);
+    rebuild(options: MetaballsOptions): void;
+    private checkCircleFullyContained;
+    private detectContainmentStatus;
+    private rebuildContainingCircles;
+}
+export {};

package/src/_esm/src/ts/utils/algorithms/Metaballs.js

@@ -0,0 +1,109 @@
+/**
+ * Algorithm:
+ *  Input Circles
+ *      -> filter out fully contained circles
+ *      -> build outer containing circles (given by detect radius)
+ *      -> find radical lines
+ *
+ * This implementation currently does not detect any holes.
+ *
+ * @author  Ikaros Kappler
+ * @version 1.0.0
+ * @date    2024-03-01
+ */
+import { Circle } from "../../Circle";
+import { CircleIntersections } from "./CircleIntersections";
+export class Metaballs {
+    constructor(inputCircles) {
+        this.circleIsFullyContained = []; // Array<boolean>
+        this.inputCircles = [];
+        this.circlesOfInterest = [];
+        this.containingCircles = [];
+        // Array< { baseCircleIndexA, baseCircleIndexB,
+        //          baseCircleA, baseCircleB,
+        //          circleA, circleB,
+        //          inverseCircleA, inverseCircleB,
+        //          doIntersect, circlePointsA:[], circlePointsB:[] } >
+        this.inverseCirclesPairs = [];
+        this.inputCircles = inputCircles;
+    }
+    rebuild(options) {
+        this.detectContainmentStatus();
+        this.rebuildContainingCircles(options);
+        this.inverseCirclesPairs = [];
+        const radicalLineMatrix = CircleIntersections.buildRadicalLineMatrix(this.containingCircles);
+        for (var i = 0; i < this.containingCircles.length; i++) {
+            var circleA = this.containingCircles[i];
+            var centerCircleA = this.circlesOfInterest[i];
+            for (var j = i + 1; j < this.containingCircles.length; j++) {
+                var radicalLine = radicalLineMatrix[i][j];
+                if (radicalLine == null) {
+                    // The two circles do not have an intersection.
+                    // console.log("Circles", i, j, "do not have any intersections");
+                    continue;
+                }
+                var circleB = this.containingCircles[j];
+                var centerCircleB = this.circlesOfInterest[j];
+                // But if they have -> compute. outer circle(s).
+                // They are symmetrical.
+                var inverseCircle1 = new Circle(radicalLine.a, options.metaRadiusAddon);
+                var inverseCircle2 = new Circle(radicalLine.b, options.metaRadiusAddon);
+                var doIntersect = inverseCircle1.circleIntersection(inverseCircle2) != null;
+                // console.log("doIntersect", doIntersect);
+                // Now find the intersection points between inner and outer circles.
+                // We will need them later.
+                var circlePointsA = [
+                    centerCircleA.closestPoint(inverseCircle1.center),
+                    centerCircleA.closestPoint(inverseCircle2.center)
+                ];
+                var circlePointsB = [
+                    centerCircleB.closestPoint(inverseCircle1.center),
+                    centerCircleB.closestPoint(inverseCircle2.center)
+                ];
+                this.inverseCirclesPairs.push({
+                    baseCircleIndexA: i,
+                    baseCircleIndexB: j,
+                    baseCircleA: this.circlesOfInterest[i],
+                    baseCircleB: this.circlesOfInterest[j],
+                    circleA: circleA,
+                    inverseCircleA: inverseCircle1,
+                    circleB: circleB,
+                    inverseCircleB: inverseCircle2,
+                    doIntersect: doIntersect,
+                    circlePointsA: circlePointsA,
+                    circlePointsB: circlePointsB
+                });
+            } // END for j
+        } // END for i
+    }
+    //   public getInnerPath;
+    checkCircleFullyContained(circleIndex) {
+        for (var i = 0; i < this.inputCircles.length; i++) {
+            if (circleIndex == i) {
+                continue;
+            }
+            if (this.inputCircles[i].containsCircle(this.inputCircles[circleIndex])) {
+                return true;
+            }
+        }
+        return false;
+    }
+    detectContainmentStatus() {
+        this.circleIsFullyContained = [];
+        this.circlesOfInterest = [];
+        for (var i = 0; i < this.inputCircles.length; i++) {
+            this.circleIsFullyContained[i] = this.checkCircleFullyContained(i);
+            if (!this.circleIsFullyContained[i]) {
+                this.circlesOfInterest.push(this.inputCircles[i]);
+            }
+        }
+    }
+    rebuildContainingCircles(options) {
+        this.containingCircles = [];
+        for (var i = 0; i < this.circlesOfInterest.length; i++) {
+            var containingCircle = new Circle(this.circlesOfInterest[i].center, this.circlesOfInterest[i].radius + options.metaRadiusAddon);
+            this.containingCircles.push(containingCircle);
+        }
+    }
+}
+//# sourceMappingURL=Metaballs.js.map

package/src/_esm/src/ts/utils/algorithms/Metaballs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Metaballs.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/Metaballs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAsB5D,MAAM,OAAO,SAAS;IAapB,YAAY,YAA2B;QAZ/B,2BAAsB,GAAmB,EAAE,CAAC,CAAC,iBAAiB;QAC9D,iBAAY,GAAkB,EAAE,CAAC;QACjC,sBAAiB,GAAkB,EAAE,CAAC;QACtC,sBAAiB,GAAkB,EAAE,CAAC;QAE9C,+CAA+C;QAC/C,qCAAqC;QACrC,6BAA6B;QAC7B,2CAA2C;QAC3C,+DAA+D;QACvD,wBAAmB,GAA6B,EAAE,CAAC;QAGzD,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IACnC,CAAC;IAEM,OAAO,CAAC,OAAyB;QACtC,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QAEvC,IAAI,CAAC,mBAAmB,GAAG,EAAE,CAAC;QAE9B,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,sBAAsB,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,IAAI,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3D,IAAI,WAAW,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;oBACxB,+CAA+C;oBAC/C,iEAAiE;oBACjE,SAAS;gBACX,CAAC;gBACD,IAAI,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBACxC,IAAI,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC9C,gDAAgD;gBAChD,wBAAwB;gBACxB,IAAI,cAAc,GAAG,IAAI,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,CAAC;gBACxE,IAAI,cAAc,GAAG,IAAI,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,CAAC;gBACxE,IAAI,WAAW,GAAG,cAAc,CAAC,kBAAkB,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC;gBAC5E,2CAA2C;gBAC3C,oEAAoE;gBACpE,2BAA2B;gBAC3B,IAAI,aAAa,GAAiB;oBAChC,aAAa,CAAC,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC;oBACjD,aAAa,CAAC,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC;iBAClD,CAAC;gBACF,IAAI,aAAa,GAAiB;oBAChC,aAAa,CAAC,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC;oBACjD,aAAa,CAAC,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC;iBAClD,CAAC;gBAEF,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC;oBAC5B,gBAAgB,EAAE,CAAC;oBACnB,gBAAgB,EAAE,CAAC;oBACnB,WAAW,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;oBACtC,WAAW,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;oBACtC,OAAO,EAAE,OAAO;oBAChB,cAAc,EAAE,cAAc;oBAC9B,OAAO,EAAE,OAAO;oBAChB,cAAc,EAAE,cAAc;oBAC9B,WAAW,EAAE,WAAW;oBACxB,aAAa,EAAE,aAAa;oBAC5B,aAAa,EAAE,aAAa;iBAC7B,CAAC,CAAC;YACL,CAAC,CAAC,YAAY;QAChB,CAAC,CAAC,YAAY;IAChB,CAAC;IAED,yBAAyB;IAEjB,yBAAyB,CAAC,WAAmB;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;gBACrB,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC;gBACxE,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,uBAAuB;QAC7B,IAAI,CAAC,sBAAsB,GAAG,EAAE,CAAC;QACjC,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;YACnE,IAAI,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpC,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;IACH,CAAC;IAEO,wBAAwB,CAAC,OAAyB;QACxD,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvD,IAAI,gBAAgB,GAAG,IAAI,MAAM,CAC/B,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,MAAM,EAChC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC,eAAe,CAC3D,CAAC;YACF,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;CACF"}