plotboilerplate 1.27.1 → 1.28.0

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

@@ -0,0 +1,174 @@
+"use strict";
+/**
+ * @author   Ikaros Kappler (ported from basic script to class).
+ * @date     2020-04-15
+ * @modified 2020-08-19 Ported this class from vanilla JS to TypeScript.
+ * @version  1.0.0
+ *
+ * @file CubicSplinePath
+ * @public
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CubicSplinePath = void 0;
+const CubicBezierCurve_1 = require("../../CubicBezierCurve");
+const HobbyPath_1 = require("./HobbyPath");
+const Vertex_1 = require("../../Vertex");
+;
+/**
+ * @classdesc Compute a natural cubic Bézier spline path from a given sequence of points/vertices.
+ *
+ * Inspired by http://weitz.de/hobby/
+ *
+ * @requires CubicBezierCurve
+ * @requires HobbyPath
+ * @requires Vertex
+ */
+class CubicSplinePath {
+    /**
+     * @constructor
+     * @name CubicSplinePath
+     * @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 CubicSplinePath
+    * @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 CubicSplinePath
+     * @instance
+     * @param {boolean=} circular - Specify if the path should be closed.
+     * @return Array<CubicBezierCurve>
+     **/
+    generateCurve(circular) {
+        const xs = [];
+        const ys = [];
+        for (var i = 0; i < this.vertices.length; i++) {
+            xs.push(this.vertices[i].x);
+            ys.push(this.vertices[i].y);
+        }
+        const curves = [];
+        let n = this.vertices.length;
+        if (n > 1) {
+            if (n == 2) {
+                // for two points, just draw a straight line
+                curves.push(new CubicBezierCurve_1.CubicBezierCurve(this.vertices[0], this.vertices[1], this.vertices[0], this.vertices[1]));
+            }
+            else {
+                if (!circular) {
+                    // open curve
+                    // x1 and y1 contain the coordinates of the first control
+                    // points, x2 and y2 those of the second
+                    const controlsX = CubicSplinePath.utils.naturalControlsOpen(xs);
+                    const controlsY = CubicSplinePath.utils.naturalControlsOpen(ys);
+                    for (let i = 1; i < n; i++) {
+                        // add Bézier segment - two control points and next node
+                        curves.push(new CubicBezierCurve_1.CubicBezierCurve(this.vertices[i - 1], this.vertices[i], new Vertex_1.Vertex(controlsX.start[i - 1], controlsY.start[i - 1]), // x1[i-1], y1[i-1]), // new Vertex(x1[i-1], y1[i-1]),
+                        new Vertex_1.Vertex(controlsX.end[i - 1], controlsY.end[i - 1]) // new Vertex(x2[i-1], y2[i-1])
+                        ));
+                    }
+                }
+                else {
+                    // closed curve, i.e. endpoints are connected
+                    // see comments for open curve
+                    let controlsX = CubicSplinePath.utils.naturalControlsClosed(xs);
+                    let controlsY = CubicSplinePath.utils.naturalControlsClosed(ys);
+                    for (let i = 0; i < n; i++) {
+                        // if i is n-1, the "next" point is the first one
+                        let j = (i + 1) % n;
+                        curves.push(new CubicBezierCurve_1.CubicBezierCurve(this.vertices[i], this.vertices[j], new Vertex_1.Vertex(controlsX.start[i], controlsY.start[i]), // new Vertex(x1[i], y1[i]),
+                        new Vertex_1.Vertex(controlsX.end[i], controlsY.end[i]) // new Vertex(x2[i], y2[i])
+                        ));
+                    }
+                }
+            }
+        }
+        return curves;
+    }
+    ;
+}
+exports.CubicSplinePath = CubicSplinePath;
+CubicSplinePath.utils = {
+    naturalControlsClosed: (coords) => {
+        const n = coords.length;
+        // a, b, and c are the diagonals of the tridiagonal matrix, d is the
+        // right side
+        const a = new Array(n);
+        const b = new Array(n);
+        const c = new Array(n);
+        const d = new Array(n);
+        // the video explains why the matrix is filled this way
+        b[0] = 4;
+        c[0] = 1;
+        d[0] = 4 * coords[0] + 2 * coords[1];
+        a[n - 1] = 1;
+        b[n - 1] = 4;
+        d[n - 1] = 4 * coords[n - 1] + 2 * coords[0];
+        for (let i = 1; i < n - 1; i++) {
+            a[i] = 1;
+            b[i] = 4;
+            c[i] = 1;
+            d[i] = 4 * coords[i] + 2 * coords[i + 1];
+        }
+        // add a one to the two empty corners and solve the system for the
+        // first control points
+        const x1 = HobbyPath_1.HobbyPath.utils.sherman(a, b, c, d, 1, 1);
+        // compute second controls points from first
+        const x2 = new Array(n);
+        for (let i = 0; i < n - 1; i++)
+            x2[i] = 2 * coords[i + 1] - x1[i + 1];
+        x2[n - 1] = 2 * coords[0] - x1[0];
+        return { start: x1, end: x2 };
+    },
+    // computes two arrays for the first and second controls points for a
+    // natural cubic spline through the points in K, an "open" curve where
+    // the curve doesn't return to the starting point; the function works
+    // with one coordinate at a time, i.e. it has to be called twice
+    naturalControlsOpen: (coords) => {
+        const n = coords.length - 1;
+        // a, b, and c are the diagonals of the tridiagonal matrix, d is the
+        // right side
+        const a = new Array(n);
+        const b = new Array(n);
+        const c = new Array(n);
+        const d = new Array(n);
+        // the video explains why the matrix is filled this way
+        b[0] = 2;
+        c[0] = 1;
+        d[0] = coords[0] + 2 * coords[1];
+        a[n - 1] = 2;
+        b[n - 1] = 7;
+        d[n - 1] = 8 * coords[n - 1] + coords[n];
+        for (let i = 1; i < n - 1; i++) {
+            a[i] = 1;
+            b[i] = 4;
+            c[i] = 1;
+            d[i] = 4 * coords[i] + 2 * coords[i + 1];
+        }
+        // solve the system to get the first control points
+        const x1 = HobbyPath_1.HobbyPath.utils.thomas(a, b, c, d);
+        // compute second controls points from first
+        const x2 = new Array(n);
+        for (let i = 0; i < n - 1; i++) {
+            x2[i] = 2 * coords[i + 1] - x1[i + 1];
+        }
+        x2[n - 1] = (coords[n] + x1[n - 1]) / 2;
+        return { start: x1, end: x2 };
+    }
+}; // END utils
+; // END class
+//# sourceMappingURL=CubicSplinePath.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CubicSplinePath.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/CubicSplinePath.ts"],"names":[],"mappings":";AAAA;;;;;;;;IAQI;;;AAEJ,6DAA0D;AAC1D,2CAAwC;AACxC,yCAAsC;AAKrC,CAAC;AAIF;;;;;;;;GAQG;AACH;IAWI;;;;QAII;IACJ,YAAa,QAAwB;QACxC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,CAAC;IAAA,CAAC;IAGD;;;;;;;OAOG;IACJ,QAAQ,CAAG,CAAS;QACvB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAE,CAAC,CAAE,CAAC;IACrB,CAAC;IAAA,CAAC;IAEF;;;;;;;;QAQI;IACJ,aAAa,CAAG,QAAiB;QACpC,MAAM,EAAE,GAAmB,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAmB,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YAC7C,EAAE,CAAC,IAAI,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;YAC9B,EAAE,CAAC,IAAI,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;QAClC,CAAC;QACD,MAAM,MAAM,GAA6B,EAAE,CAAC;QAE5C,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,MAAM,CAAC,IAAI,CAAE,IAAI,mCAAgB,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAE,CAAC;YAC3G,CAAC;iBAAM,CAAC;gBACX,IAAI,CAAC,QAAQ,EAAG,CAAC;oBACb,aAAa;oBACb,yDAAyD;oBACzD,wCAAwC;oBACxC,MAAM,SAAS,GAAoB,eAAe,CAAC,KAAK,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;oBACjF,MAAM,SAAS,GAAoB,eAAe,CAAC,KAAK,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;oBACjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChC,wDAAwD;wBACxD,MAAM,CAAC,IAAI,CAAE,IAAI,mCAAgB,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAC,CAAC,CAAC,EAC9C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAChB,IAAI,eAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAC,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,EAAE,sDAAsD;wBAC9G,IAAI,eAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAE,+BAA+B;yBACpF,CAAE,CAAA;oBACL,CAAC;gBACL,CAAC;qBAAM,CAAC;oBACJ,6CAA6C;oBAC7C,8BAA8B;oBAC9B,IAAI,SAAS,GAAoB,eAAe,CAAC,KAAK,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;oBACjF,IAAI,SAAS,GAAoB,eAAe,CAAC,KAAK,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;oBACjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChC,iDAAiD;wBACjD,IAAI,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAClB,MAAM,CAAC,IAAI,CAAE,IAAI,mCAAgB,CAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAC5C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAChB,IAAI,eAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,4BAA4B;wBAChF,IAAI,eAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,2BAA2B;yBAC5E,CAAE,CAAA;oBACL,CAAC;gBACL,CAAC;YACE,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IACX,CAAC;IAAA,CAAC;CAyEL;;AAtEU,qBAAK,GAAG;IAClB,qBAAqB,EAAG,CAAE,MAAoB,EAAoB,EAAE;QAChE,MAAM,CAAC,GAAY,MAAM,CAAC,MAAM,CAAC;QACjC,oEAAoE;QACpE,aAAa;QACb,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,uDAAuD;QACvD,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QACD,kEAAkE;QAClE,uBAAuB;QACvB,MAAM,EAAE,GAAmB,qBAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,4CAA4C;QAC5C,MAAM,EAAE,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE;YAC/B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAC7B,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9B,OAAO,EAAE,KAAK,EAAG,EAAE,EAAE,GAAG,EAAG,EAAE,EAAE,CAAC;IACpC,CAAC;IAGD,qEAAqE;IACrE,sEAAsE;IACtE,qEAAqE;IACrE,gEAAgE;IAChE,mBAAmB,EAAG,CAAE,MAAqB,EAAoB,EAAE;QAC/D,MAAM,CAAC,GAAY,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACrC,oEAAoE;QACpE,aAAa;QACb,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAC/C,uDAAuD;QACvD,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACT,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QACD,mDAAmD;QACnD,MAAM,EAAE,GAAmB,qBAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,4CAA4C;QAC5C,MAAM,EAAE,GAAmB,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;QACD,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,OAAO,EAAE,KAAK,EAAG,EAAE,EAAE,GAAG,EAAG,EAAE,EAAE,CAAC;IACpC,CAAC;CACG,CAAC,CAAC,YAAY;AAClB,CAAC,CAAC,YAAY"}

package/src/_esm/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/utils/algorithms/HobbyPath.js

@@ -0,0 +1,277 @@
+"use strict";
+/**
+ * @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
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HobbyPath = void 0;
+const CubicBezierCurve_1 = require("../../CubicBezierCurve");
+const Vertex_1 = require("../../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
+ */
+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_1.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_1.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_1.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_1.Vertex(this.vertices[j].x - b * v.x, this.vertices[j].y - b * v.y);
+        }
+        return { startControlPoints: startControlPoints,
+            endControlPoints: endControlPoints
+        };
+    }
+}
+exports.HobbyPath = HobbyPath;
+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_1.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_1.Vertex(0, 0);
+        else
+            return new Vertex_1.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/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,6DAA0D;AAC1D,yCAAsC;AAKrC,CAAC;AAGF;;;;;;GAMG;AACH;IAUI;;;;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,mCAAgB,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,mCAAgB,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,eAAM,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,eAAM,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,eAAM,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,eAAM,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;;YAEvB,OAAO,IAAI,eAAM,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/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 {};