plotboilerplate 1.27.1 → 1.28.0

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

@@ -0,0 +1,22 @@
+/**
+ * A collection of SVG path generation tools.
+ *
+ * @author  Ikaros Kappler
+ * @date    2025-04-04
+ * @version 1.0.0
+ */
+import { Vertex } from "../Vertex";
+import { SVGPathParams } from "../interfaces";
+export declare const SVGPathUtils: {
+    /**
+     * Creates an SVG shape resembling a circlular ring sector.
+     *
+     * @param {Vertex} center - The center position of the ring.
+     * @param {number} innerRadius - The inner radius of the ring.
+     * @param {number} outerRadius - The outer radius of the ring.
+     * @param {number} startAngle - The start angle of the ring.
+     * @param {number} endAngle - The end angle of the ring.
+     * @returns {SVGPathParams} SVG path parmams for a closed shape representing the circular ring sector.
+     */
+    mkCircularRingSector: (center: Vertex, innerRadius: number, outerRadius: number, startAngle: number, endAngle: number) => SVGPathParams;
+};

package/src/_esm/src/ts/utils/SVGPathUtils.js

@@ -0,0 +1,42 @@
+/**
+ * A collection of SVG path generation tools.
+ *
+ * @author  Ikaros Kappler
+ * @date    2025-04-04
+ * @version 1.0.0
+ */
+import { Circle } from "../Circle";
+import { geomutils } from "../geomutils";
+export const SVGPathUtils = {
+    /**
+     * Creates an SVG shape resembling a circlular ring sector.
+     *
+     * @param {Vertex} center - The center position of the ring.
+     * @param {number} innerRadius - The inner radius of the ring.
+     * @param {number} outerRadius - The outer radius of the ring.
+     * @param {number} startAngle - The start angle of the ring.
+     * @param {number} endAngle - The end angle of the ring.
+     * @returns {SVGPathParams} SVG path parmams for a closed shape representing the circular ring sector.
+     */
+    mkCircularRingSector: (center, innerRadius, outerRadius, startAngle, endAngle) => {
+        const innerStart = Circle.circleUtils.vertAt(startAngle, innerRadius).add(center);
+        const innerEnd = Circle.circleUtils.vertAt(endAngle, innerRadius).add(center);
+        const outerStart = Circle.circleUtils.vertAt(startAngle, outerRadius).add(center);
+        const outerEnd = Circle.circleUtils.vertAt(endAngle, outerRadius).add(center);
+        const buffer = ["M", innerStart.x, innerStart.y];
+        // var isLargeArcRequired = geomutils.mapAngleTo2PI(Math.abs(startAngle - endAngle)) >= Math.PI;
+        // var isLargeArcRequired = Math.abs(geomutils.mapAngleTo2PI(startAngle) - geomutils.mapAngleTo2PI(endAngle)) >= Math.PI;
+        const isLargeArcRequired = geomutils.mapAngleTo2PI(geomutils.mapAngleTo2PI(startAngle) - geomutils.mapAngleTo2PI(endAngle)) >= Math.PI;
+        const rotation = 0.0;
+        const innerLargeArcFlag = isLargeArcRequired ? 0 : 1;
+        const innerSweepFlag = 1; // isLargeArcRequired ? 1 : 0; // 1;
+        const outerLargeArcFlag = isLargeArcRequired ? 0 : 1;
+        const outerSweepFlag = 0; // isLargeArcRequired ? 0 : 1; // 0;
+        buffer.push("A", innerRadius, innerRadius, rotation, innerLargeArcFlag, innerSweepFlag, innerEnd.x, innerEnd.y);
+        buffer.push("L", outerEnd.x, outerEnd.y);
+        buffer.push("A", outerRadius, outerRadius, rotation, outerLargeArcFlag, outerSweepFlag, outerStart.x, outerStart.y);
+        buffer.push("Z");
+        return buffer;
+    }
+};
+//# sourceMappingURL=SVGPathUtils.js.map

package/src/_esm/src/ts/utils/SVGPathUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SVGPathUtils.js","sourceRoot":"","sources":["../../../../ts/utils/SVGPathUtils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEnC,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAGzC,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B;;;;;;;;;OASG;IACH,oBAAoB,EAAE,CACpB,MAAc,EACd,WAAmB,EACnB,WAAmB,EACnB,UAAkB,EAClB,QAAgB,EACD,EAAE;QACjB,MAAM,UAAU,GAAW,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1F,MAAM,QAAQ,GAAW,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtF,MAAM,UAAU,GAAW,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1F,MAAM,QAAQ,GAAW,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEtF,MAAM,MAAM,GAAkB,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;QAChE,gGAAgG;QAChG,yHAAyH;QACzH,MAAM,kBAAkB,GACtB,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,SAAS,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;QAE9G,MAAM,QAAQ,GAAW,GAAG,CAAC;QAC7B,MAAM,iBAAiB,GAAW,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,cAAc,GAAW,CAAC,CAAC,CAAC,oCAAoC;QACtE,MAAM,iBAAiB,GAAW,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,cAAc,GAAW,CAAC,CAAC,CAAC,oCAAoC;QACtE,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QAChH,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,EAAE,iBAAiB,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;QACpH,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEjB,OAAO,MAAM,CAAC;IAChB,CAAC;CACF,CAAC"}

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

@@ -0,0 +1,35 @@
+/**
+ * @author   Ikaros Kappler
+ * @date     2018-11-10
+ * @modified 2020-10-23 Ported to Typescript.
+ * @modified 2020-10-30 Exporting each color under its name globally.
+ * @modified 2025-12-08 Replaying self defined colors by official web colors.
+ * @modified 2026-03-18 Fixing global `WebColors` array.
+ * @version  1.0.3
+ **/
+import { Color } from "./datastructures/Color";
+export declare const Red: Color;
+export declare const Pink: Color;
+export declare const Purple: Color;
+export declare const DeepPurple: Color;
+export declare const Indigo: Color;
+export declare const Blue: Color;
+export declare const LightBlue: Color;
+export declare const Cyan: Color;
+export declare const Teal: Color;
+export declare const Green: Color;
+export declare const LightGreen: Color;
+/**
+ * A set of beautiful web colors (I know, beauty is in the eye of the beholder).
+ *
+ * I found this color chart with 11 colors and think it is somewhat nice
+ *    https://www.pinterest.com/pin/229965124706497134/
+ *
+ * @requires Color
+ *
+ */
+export declare const WebColors: Array<Color>;
+/**
+ * A helper function to shuffle the colors into a new order.
+ */
+export declare const shuffleWebColors: (order: Array<number>) => Color[];

package/src/_esm/src/ts/utils/WebColors.js

@@ -0,0 +1,54 @@
+/**
+ * @author   Ikaros Kappler
+ * @date     2018-11-10
+ * @modified 2020-10-23 Ported to Typescript.
+ * @modified 2020-10-30 Exporting each color under its name globally.
+ * @modified 2025-12-08 Replaying self defined colors by official web colors.
+ * @modified 2026-03-18 Fixing global `WebColors` array.
+ * @version  1.0.3
+ **/
+import { Color } from "./datastructures/Color";
+export const Red = Color.Red; // Color.makeRGB(255,67,55);
+export const Pink = Color.Pink; // Color.makeRGB(232,31,100);
+export const Purple = Color.Purple; // Color.makeRGB(156,39,175);
+export const DeepPurple = Color.DeepPink; // Color.makeRGB(103,59,184);
+export const Indigo = Color.Indigo; // Color.makeRGB(64,81,181);
+export const Blue = Color.Blue; // Color.makeRGB(35,151,245);
+export const LightBlue = Color.LightBlue; // Color.makeRGB(6,170,245);
+export const Cyan = Color.Cyan; // Color.makeRGB(3,189,214);
+export const Teal = Color.Teal; // Color.makeRGB(1,150,137);
+export const Green = Color.Green; // Color.makeRGB(77,175,82);
+export const LightGreen = Color.LightGreen; // Color.makeRGB(141,195,67);
+/**
+ * A set of beautiful web colors (I know, beauty is in the eye of the beholder).
+ *
+ * I found this color chart with 11 colors and think it is somewhat nice
+ *    https://www.pinterest.com/pin/229965124706497134/
+ *
+ * @requires Color
+ *
+ */
+export const WebColors = [
+    Color.Red,
+    Color.Pink,
+    Color.Purple,
+    Color.DeepPink,
+    Color.Indigo,
+    Color.Blue,
+    Color.LightBlue,
+    Color.Cyan,
+    Color.Teal,
+    Color.Green,
+    Color.LightGreen
+];
+/**
+ * A helper function to shuffle the colors into a new order.
+ */
+export const shuffleWebColors = (order) => {
+    const result = Array(order.length);
+    for (var i = 0; i < order.length; i++) {
+        result[i] = WebColors[order[i] % WebColors.length];
+    }
+    return result;
+};
+//# sourceMappingURL=WebColors.js.map

package/src/_esm/src/ts/utils/WebColors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WebColors.js","sourceRoot":"","sources":["../../../../ts/utils/WebColors.ts"],"names":[],"mappings":"AAAA;;;;;;;;IAQI;AAEJ,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,MAAM,CAAC,MAAM,GAAG,GAAU,KAAK,CAAC,GAAG,CAAC,CAAC,4BAA4B;AACjE,MAAM,CAAC,MAAM,IAAI,GAAU,KAAK,CAAC,IAAI,CAAC,CAAC,6BAA6B;AACpE,MAAM,CAAC,MAAM,MAAM,GAAU,KAAK,CAAC,MAAM,CAAC,CAAC,6BAA6B;AACxE,MAAM,CAAC,MAAM,UAAU,GAAU,KAAK,CAAC,QAAQ,CAAC,CAAC,6BAA6B;AAC9E,MAAM,CAAC,MAAM,MAAM,GAAU,KAAK,CAAC,MAAM,CAAC,CAAC,4BAA4B;AACvE,MAAM,CAAC,MAAM,IAAI,GAAU,KAAK,CAAC,IAAI,CAAC,CAAC,6BAA6B;AACpE,MAAM,CAAC,MAAM,SAAS,GAAU,KAAK,CAAC,SAAS,CAAC,CAAC,4BAA4B;AAC7E,MAAM,CAAC,MAAM,IAAI,GAAU,KAAK,CAAC,IAAI,CAAC,CAAC,4BAA4B;AACnE,MAAM,CAAC,MAAM,IAAI,GAAU,KAAK,CAAC,IAAI,CAAC,CAAC,4BAA4B;AACnE,MAAM,CAAC,MAAM,KAAK,GAAU,KAAK,CAAC,KAAK,CAAC,CAAC,4BAA4B;AACrE,MAAM,CAAC,MAAM,UAAU,GAAU,KAAK,CAAC,UAAU,CAAC,CAAC,6BAA6B;AAEhF;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,SAAS,GAAiB;IACrC,KAAK,CAAC,GAAG;IACT,KAAK,CAAC,IAAI;IACV,KAAK,CAAC,MAAM;IACZ,KAAK,CAAC,QAAQ;IACd,KAAK,CAAC,MAAM;IACZ,KAAK,CAAC,IAAI;IACV,KAAK,CAAC,SAAS;IACf,KAAK,CAAC,IAAI;IACV,KAAK,CAAC,IAAI;IACV,KAAK,CAAC,KAAK;IACX,KAAK,CAAC,UAAU;CACjB,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,KAAoB,EAAE,EAAE;IACvD,MAAM,MAAM,GAAiB,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

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

@@ -0,0 +1,6 @@
+/**
+ * @requires Color
+ *
+ * @date 2020-10-27
+ **/
+export declare const WebColorsContrast: import("..").Color[];

package/src/_esm/src/ts/utils/WebColorsContrast.js

@@ -0,0 +1,9 @@
+/**
+ * @requires Color
+ *
+ * @date 2020-10-27
+ **/
+import { shuffleWebColors } from "./WebColors";
+const ORDER_CONTRAST = [8, 0, 6, 4, 1, 9, 2, 10, 3, 7, 5];
+export const WebColorsContrast = shuffleWebColors(ORDER_CONTRAST);
+//# sourceMappingURL=WebColorsContrast.js.map

package/src/_esm/src/ts/utils/WebColorsContrast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WebColorsContrast.js","sourceRoot":"","sources":["../../../../ts/utils/WebColorsContrast.ts"],"names":[],"mappings":"AAAA;;;;IAII;AAEJ,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C,MAAM,cAAc,GAAmB,CAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC;AAE5E,MAAM,CAAC,MAAM,iBAAiB,GAAG,gBAAgB,CAAE,cAAc,CAAE,CAAC"}

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

@@ -0,0 +1,12 @@
+/**
+ * @author   Ikaros Kappler
+ * @version  1.0.0
+ * @date     2018-11-11
+ **/
+import { Color } from "./datastructures/Color";
+/**
+ * A mix of green shades.
+ *
+ * @requires Color
+ */
+export declare const WebColorsMalachite: Array<Color>;

package/src/_esm/src/ts/utils/WebColorsMalachite.js

@@ -0,0 +1,25 @@
+/**
+ * @author   Ikaros Kappler
+ * @version  1.0.0
+ * @date     2018-11-11
+ **/
+import { Color } from "./datastructures/Color";
+/**
+ * A mix of green shades.
+ *
+ * @requires Color
+ */
+export const WebColorsMalachite = [
+    Color.makeRGB(0, 21, 6),
+    Color.makeRGB(0, 30, 12),
+    Color.makeRGB(0, 52, 28),
+    Color.makeRGB(0, 81, 47),
+    Color.makeRGB(21, 134, 88),
+    Color.makeRGB(0, 46, 19),
+    Color.makeRGB(0, 68, 40),
+    Color.makeRGB(11, 81, 55),
+    Color.makeRGB(0, 91, 46),
+    Color.makeRGB(0, 111, 46),
+    Color.makeRGB(33, 140, 106)
+];
+//# sourceMappingURL=WebColorsMalachite.js.map

package/src/_esm/src/ts/utils/WebColorsMalachite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WebColorsMalachite.js","sourceRoot":"","sources":["../../../../ts/utils/WebColorsMalachite.ts"],"names":[],"mappings":"AAAA;;;;IAII;AAEJ,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAG/C;;;;GAIG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAkB;IAC7C,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC,EAAE,EAAC,CAAC,CAAC;IACrB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC,EAAE,EAAC,EAAE,CAAC;IACtB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC,EAAE,EAAC,EAAE,CAAC;IACtB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC,EAAE,EAAC,EAAE,CAAC;IACtB,KAAK,CAAC,OAAO,CAAC,EAAE,EAAC,GAAG,EAAC,EAAE,CAAC;IACxB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC,EAAE,EAAC,EAAE,CAAC;IACtB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC,EAAE,EAAC,EAAE,CAAC;IACtB,KAAK,CAAC,OAAO,CAAC,EAAE,EAAC,EAAE,EAAC,EAAE,CAAC;IACvB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC,EAAE,EAAC,EAAE,CAAC;IACtB,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC,GAAG,EAAC,EAAE,CAAC;IACvB,KAAK,CAAC,OAAO,CAAC,EAAE,EAAC,GAAG,EAAC,GAAG,CAAC;CAC5B,CAAC"}

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

@@ -0,0 +1,60 @@
+/**
+ * @date     2020-04-15
+ * @author   Converted to a class by Ikaros Kappler
+ * @modified 2020-08-19 Ported this class from vanilla JS to TypeScript.
+ * @version  1.0.1
+ *
+ * @file CatmullRomPath
+ * @public
+ **/
+import { CubicBezierCurve } from "../../CubicBezierCurve";
+import { Vertex } from "../../Vertex";
+/**
+ * @classdesc Compute the Catmull-Rom spline path from a sequence of points (vertices).
+ *
+ * For comparison to the HobbyCurve I wanted to add a Catmull-Rom path (to show that the
+ * HobbyCurve is smoother).
+ *
+ * This demo implementation was inspired by this Codepen by Blake Bowen
+ * https://codepen.io/osublake/pen/BowJed
+ *
+ * @requires CubicBezierCurve
+ * @requires Vertex
+ */
+export declare class CatmullRomPath {
+    /**
+     * @member {Array<Vertex>} vertices
+     * @memberof CatmullRomPath
+     * @type {Array<Vertex>}
+     * @instance
+     **/
+    private vertices;
+    /**
+     * @constructor
+     * @name CatmullRomPath
+     * @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 CatmullRomPath
+     * @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 CatmullRomPath
+     * @instance
+     * @param {boolean=} circular - Specify if the path should be closed.
+     * @param {number=1} tension - (default=0) An optional tension parameter.
+     * @return Array<CubicBezierCurve>
+     **/
+    generateCurve(circular?: boolean, tension?: number): CubicBezierCurve[];
+    private solveOpen;
+    private solveClosed;
+}

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

@@ -0,0 +1,103 @@
+/**
+ * @date     2020-04-15
+ * @author   Converted to a class by Ikaros Kappler
+ * @modified 2020-08-19 Ported this class from vanilla JS to TypeScript.
+ * @version  1.0.1
+ *
+ * @file CatmullRomPath
+ * @public
+ **/
+import { CubicBezierCurve } from "../../CubicBezierCurve";
+import { Vertex } from "../../Vertex";
+/**
+ * @classdesc Compute the Catmull-Rom spline path from a sequence of points (vertices).
+ *
+ * For comparison to the HobbyCurve I wanted to add a Catmull-Rom path (to show that the
+ * HobbyCurve is smoother).
+ *
+ * This demo implementation was inspired by this Codepen by Blake Bowen
+ * https://codepen.io/osublake/pen/BowJed
+ *
+ * @requires CubicBezierCurve
+ * @requires Vertex
+ */
+export class CatmullRomPath {
+    /**
+     * @constructor
+     * @name CatmullRomPath
+     * @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 CatmullRomPath
+     * @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 CatmullRomPath
+     * @instance
+     * @param {boolean=} circular - Specify if the path should be closed.
+     * @param {number=1} tension - (default=0) An optional tension parameter.
+     * @return Array<CubicBezierCurve>
+     **/
+    generateCurve(circular, tension) {
+        if (typeof tension === 'undefined')
+            tension = 1.0;
+        if (circular)
+            return this.solveClosed(tension);
+        else
+            return this.solveOpen(tension);
+    }
+    ;
+    solveOpen(k) {
+        var curves = [];
+        if (k == null || typeof k === 'undefined')
+            k = 1;
+        var size = this.vertices.length;
+        var last = size - 2;
+        for (var i = 0; i < size - 1; i++) {
+            var p0 = i ? this.vertices[i - 1] : this.vertices[0];
+            var p1 = this.vertices[i + 0];
+            var p2 = this.vertices[i + 1];
+            var p3 = i !== last ? this.vertices[i + 2] : p2;
+            var cp1 = new Vertex(p1.x + (p2.x - p0.x) / 6 * k, p1.y + (p2.y - p0.y) / 6 * k);
+            var cp2 = new Vertex(p2.x - (p3.x - p1.x) / 6 * k, p2.y - (p3.y - p1.y) / 6 * k);
+            curves.push(new CubicBezierCurve(p1, p2, cp1, cp2));
+        }
+        return curves;
+    }
+    ; // END solveOpen
+    solveClosed(k) {
+        var curves = [];
+        if (k == null || typeof k === 'undefined')
+            k = 1;
+        var size = this.vertices.length;
+        var last = size - 1;
+        for (var i = 0; i < size; i++) {
+            var p0 = i ? this.vertices[i - 1] : this.vertices[last];
+            var p1 = this.vertices[i + 0];
+            var p2 = this.vertices[(i + 1) % size];
+            var p3 = this.vertices[(i + 2) % size];
+            var cp1 = new Vertex(p1.x + (p2.x - p0.x) / 6 * k, p1.y + (p2.y - p0.y) / 6 * k);
+            var cp2 = new Vertex(p2.x - (p3.x - p1.x) / 6 * k, p2.y - (p3.y - p1.y) / 6 * k);
+            curves.push(new CubicBezierCurve(p1, p2, cp1, cp2));
+        }
+        return curves;
+    }
+    ; // END solveClosed
+}
+; // END class
+//# sourceMappingURL=CatmullRomPath.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CatmullRomPath.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/CatmullRomPath.ts"],"names":[],"mappings":"AAAA;;;;;;;;IAQI;AAEJ,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGtC;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,cAAc;IAWvB;;;;QAII;IACJ,YAAa,QAAwB;QACxC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;IACtC,CAAC;IAAA,CAAC;IAGF;;;;;;;QAOI;IACJ,QAAQ,CAAE,CAAS;QACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAE,CAAC,CAAE,CAAC;IACrB,CAAC;IAAA,CAAC;IAGF;;;;;;;;;QASI;IACJ,aAAa,CAAG,QAAkB,EAAE,OAAgB;QACvD,IAAI,OAAO,OAAO,KAAK,WAAW;YAC9B,OAAO,GAAG,GAAG,CAAC;QAElB,IAAI,QAAQ;YACR,OAAO,IAAI,CAAC,WAAW,CAAE,OAAO,CAAE,CAAC;;YAEnC,OAAO,IAAI,CAAC,SAAS,CAAE,OAAO,CAAE,CAAC;IAClC,CAAC;IAAA,CAAC;IAEM,SAAS,CAAE,CAAQ;QAC9B,IAAI,MAAM,GAA6B,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,IAAI,IAAI,OAAO,CAAC,KAAK,WAAW;YAAG,CAAC,GAAG,CAAC,CAAC;QAClD,IAAI,IAAI,GAAY,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACzC,IAAI,IAAI,GAAY,IAAI,GAAG,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,EAAG,EAAG,CAAC;YAClC,IAAI,EAAE,GAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9D,IAAI,EAAE,GAAY,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,EAAE,GAAY,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,EAAE,GAAY,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACzD,IAAI,GAAG,GAAY,IAAI,MAAM,CAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAE,CAAC;YAC5F,IAAI,GAAG,GAAY,IAAI,MAAM,CAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAE,CAAC;YAC5F,MAAM,CAAC,IAAI,CAAE,IAAI,gBAAgB,CAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAE,CAAE,CAAC;QAC5D,CAAC;QACD,OAAO,MAAM,CAAC;IACX,CAAC;IAAA,CAAC,CAAC,gBAAgB;IAEX,WAAW,CAAE,CAAQ;QAChC,IAAI,MAAM,GAA6B,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,IAAI,IAAI,OAAO,CAAC,KAAK,WAAW;YAAG,CAAC,GAAG,CAAC,CAAC;QAClD,IAAI,IAAI,GAAY,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACzC,IAAI,IAAI,GAAY,IAAI,GAAG,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAG,EAAG,CAAC;YAC9B,IAAI,EAAE,GAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACjE,IAAI,EAAE,GAAY,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,EAAE,GAAY,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAChD,IAAI,EAAE,GAAY,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAChD,IAAI,GAAG,GAAY,IAAI,MAAM,CAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAE,CAAC;YAC5F,IAAI,GAAG,GAAY,IAAI,MAAM,CAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAE,CAAC;YAC5F,MAAM,CAAC,IAAI,CAAE,IAAI,gBAAgB,CAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAE,CAAE,CAAC;QAC5D,CAAC;QACD,OAAO,MAAM,CAAC;IACX,CAAC;IAAA,CAAC,CAAC,kBAAkB;CACxB;AAAA,CAAC,CAAC,YAAY"}

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

@@ -0,0 +1,170 @@
+/**
+ * @author   Ikaros Kappler
+ * @date     2020-10-05
+ * @modified 2021-02-08 Fixed a lot of es2015 compatibility issues.
+ * @modified 2024-02-23 Fixed some null-type conflicts.
+ * @version  1.0.2
+ * @file CircleIntersections
+ * @public
+ **/
+import { Circle } from "../../Circle";
+import { CircleSector } from "../../CircleSector";
+import { Line } from "../../Line";
+import { CircularIntervalSet } from "../datastructures/CircularIntervalSet";
+import { IndexPair, Matrix } from "../datastructures/interfaces";
+/**
+ * @classdesc A script for finding the intersection points of two or
+ * multiple circles (the 'radical lines').
+ *
+ * Based on the C++ implementation by Robert King
+ *    https://stackoverflow.com/questions/3349125/circle-circle-intersection-points
+ * and the 'Circles and spheres' article by Paul Bourke.
+ *    http://paulbourke.net/geometry/circlesphere/
+ *
+ * @requires arrayFill
+ * @requires matrixFill
+ * @requires Circle
+ * @requires IndexPair
+ * @requires Matrix
+ * @requires Interval
+ * @requires Line
+ * @requires CirularIntervalSet
+ */
+export declare class CircleIntersections {
+    /**
+     * Find all connected outer path partitions.
+     *
+     * @method findOuterPartitions
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @param {Array<CircularIntervalSet>} intervalSets - The determined interval sets (see `findOuterCircleIntervals`).
+     * @return {Array<Array<IndexPair>>} An array of paths, each defined by a sequence of IndexPairs adressing circle i and interval j.
+     **/
+    static findOuterPartitions(circles: Array<Circle>, intervalSets: Array<CircularIntervalSet>): Array<Array<IndexPair>>;
+    /**
+     * Find all connected outer path partitions (as CircleSectors).
+     *
+     * @method findOuterPartitionsAsSectors
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @param {Array<CircularIntervalSet>} intervalSets - The determined interval sets (see `findOuterCircleIntervals`).
+     * @return {Array<Array<CircleSector>>} An array of paths, each defined by a sequence of SircleSectors.
+     **/
+    static findOuterPartitionsAsSectors(circles: Array<Circle>, intervalSets: Array<CircularIntervalSet>): Array<Array<CircleSector>>;
+    /**
+     * Build the n*n intersection matrix: contains the radical line at (i,j) if circle i and circle j do intersect;
+     * conatins null at (i,j) otherwise.
+     *
+     * Note that this matrix is symmetrical: if circles (i,j) intersect with line (A,B), then also circles (j,i) intersect
+     * with line (B,A).
+     *
+     * The returned two-dimensional matrix (array) has exactly as many entries as the passed circle array.
+     *
+     * @method buildRadicalLineMatrix
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @return {Array<Array<Line>>} A 2d-matrix containing the radical lines where circles intersect.
+     **/
+    static buildRadicalLineMatrix(circles: Array<Circle>): Matrix<Line | null>;
+    /**
+     * Find all circles (indices) which are completely located inside another circle.
+     *
+     * The returned array conatins the array indices.
+     *
+     * @method findInnerCircles
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @return {Array<number>}
+     **/
+    static findInnerCircles(circles: Array<Circle>): Array<number>;
+    /**
+     * Calculate all outer circle intervals (sections that belong to the outermost line), dermined by the given
+     * circles and their radical lines.
+     *
+     * The returned array contains IntervalSets - one for each circle - indicating the remaining circle sections.
+     *
+     * @method findOuterCircleIntervals
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @param {Array<Line>} intersectionMatrix
+     * @return {Array<number>}
+     **/
+    static findOuterCircleIntervals(circles: Array<Circle>, intersectionMatrix: Matrix<Line>): Array<CircularIntervalSet>;
+    /**
+     * Calculate the next connected partition from the given set of circles and outer path intervals. The function
+     * will pick a random unused circle interval and detect all adjacent intervals until a closed partition
+     * was found.
+     *
+     * If an interval (circle section) was already visited will be stored in the `usedIntervalSetRecords` matrix (thus
+     * is must be large enough to map all sections).
+     *
+     * The returned array contains IndexPairs (i,j) - one for each circle i - indicating the used circle section j.
+     *
+     * @method findOuterPartition
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @param {Array<CircularIntervalSet>} intervalSets - The circle intervals that form the intersection outline.
+     * @param {Matrix<boolean>} usedIntervals - A matrix for remembering which circle intervals were always used.
+     * @return {Array<Indexpair>|null} The next partition or `null` if no more can be found.
+     **/
+    static findOuterPartition(circles: Array<Circle>, intervalSets: Array<CircularIntervalSet>, usedIntervals: Matrix<boolean>): Array<IndexPair> | null;
+    /**
+     * Convert a radical line (belonging to a circle) into an interval: start angle and end angle.
+     *
+     * @method radicalLineToInterval
+     * @static
+     * @private
+     * @memberof CircleIntersections
+     * @param {Circle} circle - The circle itself.
+     * @param {Line} radicaLine - The radical line to convert (must have two intersection points on the circle).
+     * @return {Interval} The interval `[startAngle,endAngle]` determined by the radical line.
+     **/
+    private static radicalLineToInterval;
+    /**
+     * This is a helper fuction used by `findOuterCircleIntervals`.
+     *
+     * It applies the passed radical line by intersecting the remaining circle sections with the new section.
+     *
+     * @method handleCircleInterval
+     * @static
+     * @private
+     * @memberof CircleIntersections
+     * @param {Circle} circle - The circles to find intersections for.
+     * @param {Line} radicalLine - The radical line to apply.
+     * @param {CircularIntervalSet} intervalSet - The CircularIntervalSet to use (must have left and right border: 0 and 2*PI).
+     * @return {void}
+     **/
+    private static handleCircleInterval;
+    /**
+     * Pick a random unused circle interval. This function is used by the `findOuterPartition` function, which
+     * starts the detection with any random section.
+     *
+     * @method randomUnusedInterval
+     * @static
+     * @private
+     * @memberof CircleIntersections
+     * @param {Array<CircularIntervalSet>} intervalSets - An array of all available interval sets/intervals.
+     * @param {Matrix<boolean>} usedIntervals - A matrix indicating which intervals have already been used/visited by the algorithm
+     * @return {IndexPair|null}
+     **/
+    private static randomUnusedInterval;
+    /**
+     * Find the next adjacent circle interval for the given interval.
+     * starts the detection with any random section.
+     *
+     * @method randomUnusedInterval
+     * @static
+     * @private
+     * @memberof CircleIntersections
+     * @param {Array<CircularIntervalSet>} intervalSets - An array of all available interval sets/intervals.
+     * @param {Matrix<boolean>} usedIntervals - A matrix indicating which intervals have already been used/visited by the algorithm
+     * @return {IndexPair|null}
+     **/
+    private static findAdjacentInterval;
+}