plotboilerplate 1.27.0 → 1.28.0

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

@@ -0,0 +1,154 @@
+"use strict";
+/**
+ * A DataGrid2d implementation on 2 dimensional arrays.
+ *
+ * @author   Ikaros Kappler
+ * @date     2025-10-16
+ * @modified 2025-10-28 Added `DataGrid2dArrayMatrix.setAll(function)`.
+ * @modified 2025-10-28 Fixed a bug in the `DataGrid2dArrayMatrix.toString()` method.
+ * @version  1.0.0
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DataGrid2dArrayMatrix = void 0;
+const arrayFill_1 = require("../algorithms/arrayFill");
+class DataGrid2dArrayMatrix {
+    /**
+     * Create a new DataGrid2d from the given
+     * @throws Error if xSegmentCount*ySegmentCount is larger than the capacity of the array/list.
+     * @param list
+     * @param xSegmentCount
+     * @param ySegmentCount
+     */
+    constructor(xSegmentCount, ySegmentCount, initialValue) {
+        if (xSegmentCount <= 0) {
+            throw `Cannot create DataGrid2dArray, xSegmentCount (${xSegmentCount}) must be > 0.`;
+        }
+        if (ySegmentCount <= 0) {
+            throw `Cannot create DataGrid2dArray, ySegmentCount (${ySegmentCount}) must be > 0.`;
+        }
+        // this.canvas = document.getElementById(canvasId);
+        this.xSegmentCount = xSegmentCount;
+        this.ySegmentCount = ySegmentCount;
+        this._matrix = [];
+        for (var i = 0; i < ySegmentCount; i++) {
+            this._matrix.push((0, arrayFill_1.arrayFill)(xSegmentCount, initialValue));
+        }
+    }
+    /**
+     * Set the matrix value at the given (x,y) position to a new value.
+     *
+     * @param {number} xIndex - The horizontal matrix position to set.
+     * @param {number} yIndex - The vertical matrix position to set.
+     * @param {T} value - The new value.
+     */
+    set(xIndex, yIndex, value) {
+        this._matrix[yIndex][xIndex] = value;
+    }
+    /**
+     * Getthe matrix value at the given (x,y) position.
+     *
+     * @param {number} xIndex - The horizontal matrix position to set.
+     * @param {number} yIndex - The vertical matrix position to set.
+     * @return {T} value - The new value.
+     */
+    get(xIndex, yIndex) {
+        return this.getDataValueAt(xIndex, yIndex);
+    }
+    /**
+     * Set all matrix values. The passed factory function must accept respective (x,y) positions.
+     *
+     * @param {Function} factory - The factory function to determine the new values to set.
+     * @return {DataGrid2dArrayMatrix<T>} this - for chaning.
+     */
+    setAll(factory) {
+        for (var x = 0; x < this.xSegmentCount; x++) {
+            for (var y = 0; y < this.ySegmentCount; y++) {
+                this.set(x, y, factory(x, y));
+            }
+        }
+        return this;
+    }
+    find(condition) {
+        for (var x = 0; x < this.xSegmentCount; x++) {
+            for (var y = 0; y < this.ySegmentCount; y++) {
+                if (condition(this.get(x, y), x, y, this)) {
+                    return {
+                        xIndex: x,
+                        yIndex: y,
+                        xRel: x / this.xSegmentCount,
+                        yRel: y / this.ySegmentCount
+                    };
+                }
+            }
+        }
+        return null;
+    }
+    /**
+     * @override
+     */
+    getMinDataValue() {
+        return this.minDataValue;
+    }
+    /**
+     * @override
+     */
+    getMaxDataValue() {
+        return this.maxDataValue;
+    }
+    /**
+     * @override
+     */
+    getDataValueAt(xIndex, yIndex, isDebug) {
+        return this._matrix[yIndex][xIndex];
+    }
+    /**
+     * @override
+     */
+    getDataFace4At(xIndex, yIndex, buffer) {
+        // buffer: array[2][2]
+        buffer[0][0] = this.getDataValueAt(xIndex, yIndex);
+        buffer[1][0] = this.getDataValueAt(xIndex + 1, yIndex);
+        buffer[1][1] = this.getDataValueAt(xIndex + 1, yIndex + 1);
+        buffer[0][1] = this.getDataValueAt(xIndex, yIndex + 1);
+    }
+    /**
+     * A helper method to convert a boolean matrix to a parsable string.
+     *
+     * @param {DataGrid2dArrayMatrix<boolean>} matrix
+     * @returns {string}
+     */
+    static toString(matrix) {
+        const buffer = [];
+        for (var y = 0; y < matrix.ySegmentCount; y++) {
+            for (var x = 0; x < matrix.xSegmentCount; x++) {
+                buffer.push(matrix.get(x, y) ? "X" : ".");
+            }
+            buffer.push("\n");
+        }
+        return buffer.join("");
+    }
+    /**
+     * Simple way to parse a data matrix from a string. `false` should be coded as '.' character,
+     * `true` must be coded as 'X' character.
+     *
+     * @param {string} str - The input string.
+     * @param {number} width - The desired width of the matrix (xSegmentCount).
+     * @param {number} height - The desired height of the matrix (ySegmentCount).
+     * @returns {DataGrid2dArrayMatrix<boolean>}
+     */
+    static parseBooleanMatrix(str, width, height) {
+        const matrix = new DataGrid2dArrayMatrix(width, height, false);
+        const lines = str.trim().split("\n");
+        for (var y = 0; y < lines.length && y < height; y++) {
+            lines[y] = lines[y].trim();
+            for (var x = 0; x < lines[y].length && x < width; x++) {
+                if (y < height && x < width && lines[y].charAt(x) === "X") {
+                    matrix.set(x, y, true);
+                }
+            }
+        }
+        return matrix;
+    }
+}
+exports.DataGrid2dArrayMatrix = DataGrid2dArrayMatrix;
+//# sourceMappingURL=DataGrid2dArrayMatrix.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"DataGrid2dArrayMatrix.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/DataGrid2dArrayMatrix.ts"],"names":[],"mappings":";AAAA;;;;;;;;IAQI;;;AAEJ,uDAAoD;AAGpD;IAiBE;;;;;;OAMG;IACH,YAAY,aAAqB,EAAE,aAAqB,EAAE,YAAe;QACvE,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;YACvB,MAAM,iDAAiD,aAAa,gBAAgB,CAAC;QACvF,CAAC;QACD,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;YACvB,MAAM,iDAAiD,aAAa,gBAAgB,CAAC;QACvF,CAAC;QAED,mDAAmD;QACnD,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QAEnC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAA,qBAAS,EAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACI,GAAG,CAAC,MAAc,EAAE,MAAc,EAAE,KAAQ;QACjD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;IACvC,CAAC;IAED;;;;;;OAMG;IACI,GAAG,CAAC,MAAc,EAAE,MAAc;QACvC,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,OAA8C;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,IAAI,CACT,SAAwG;QAExG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC1C,OAAO;wBACL,MAAM,EAAE,CAAC;wBACT,MAAM,EAAE,CAAC;wBACT,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa;wBAC5B,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa;qBAC7B,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,MAAc,EAAE,OAAiB;QAC9D,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,MAAc,EAAE,MAAwB;QACrE,sBAAsB;QACtB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,QAAQ,CAAC,MAAsC;QACpD,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5C,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CAAC,kBAAkB,CAAC,GAAW,EAAE,KAAa,EAAE,MAAc;QAClE,MAAM,MAAM,GAAG,IAAI,qBAAqB,CAAU,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACxE,MAAM,KAAK,GAAa,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtD,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;oBAC1D,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

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

@@ -0,0 +1,59 @@
+/**
+ * A DataGrid2d implementation on a linear array of triplets/Vector3.
+ *
+ * @author   Ikaros Kappler
+ * @date     2023-10-28
+ * @modified 2023-11-04 Converted to a Typescript class.
+ * @version  1.0.0
+ **/
+import { DataGridFace4, IDataGrid2d, RasterPosition } from "./DataGrid2d";
+type Triplet<T> = {
+    x: T;
+    y: T;
+    z: T;
+};
+export declare class DataGrid2dListAdapter<T> implements IDataGrid2d<T> {
+    /**
+     * @override
+     */
+    readonly xSegmentCount: number;
+    /**
+     * @override
+     */
+    readonly ySegmentCount: number;
+    minDataValue: T;
+    maxDataValue: T;
+    minXValue: T;
+    maxXValue: T;
+    minYValue: T;
+    maxYValue: T;
+    private _dataList;
+    /**
+     * Create a new DataGrid2d from the given
+     * @throws Error if xSegmentCount*ySegmentCount is larger than the capacity of the array/list.
+     * @param list
+     * @param xSegmentCount
+     * @param ySegmentCount
+     */
+    constructor(list: Array<Triplet<T>>, xSegmentCount: number, ySegmentCount: number);
+    getIndicesFromBufferIndex(bufferIndex: number): RasterPosition;
+    getCoordsFromBufferIndex(bufferIndex: number): RasterPosition;
+    coordinateIndicesToBufferIndex(xIndex: number, yIndex: number): number;
+    /**
+     * @override
+     */
+    getMinDataValue(): T;
+    /**
+     * @override
+     */
+    getMaxDataValue(): T;
+    /**
+     * @override
+     */
+    getDataValueAt(xIndex: number, yIndex: number, isDebug?: boolean): T | null;
+    /**
+     * @override
+     */
+    getDataFace4At(xIndex: number, yIndex: number, buffer: DataGridFace4<T>): void;
+}
+export {};

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

@@ -0,0 +1,83 @@
+"use strict";
+/**
+ * A DataGrid2d implementation on a linear array of triplets/Vector3.
+ *
+ * @author   Ikaros Kappler
+ * @date     2023-10-28
+ * @modified 2023-11-04 Converted to a Typescript class.
+ * @version  1.0.0
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DataGrid2dListAdapter = void 0;
+class DataGrid2dListAdapter {
+    /**
+     * Create a new DataGrid2d from the given
+     * @throws Error if xSegmentCount*ySegmentCount is larger than the capacity of the array/list.
+     * @param list
+     * @param xSegmentCount
+     * @param ySegmentCount
+     */
+    constructor(list, xSegmentCount, ySegmentCount) {
+        if (xSegmentCount * ySegmentCount > list.length) {
+            throw `Cannot create DataGrid2dListAdapter, the list (length ${list.length}) does not provide enough items for ${xSegmentCount}x${ySegmentCount} required entries.`;
+        }
+        // this.canvas = document.getElementById(canvasId);
+        this.xSegmentCount = xSegmentCount;
+        this.ySegmentCount = ySegmentCount;
+        this._dataList = list;
+    }
+    getIndicesFromBufferIndex(bufferIndex) {
+        return { xIndex: Math.floor(bufferIndex % this.xSegmentCount), yIndex: Math.floor(bufferIndex / this.xSegmentCount) };
+    }
+    getCoordsFromBufferIndex(bufferIndex) {
+        var index = this.getIndicesFromBufferIndex(bufferIndex);
+        // Note that the xSegmentCount and ySegmentCount counts plane squares, each consisting of four vertices
+        index.xRel = index.xIndex / (this.xSegmentCount - 1);
+        index.yRel = index.yIndex / (this.ySegmentCount - 1);
+        return index;
+    }
+    coordinateIndicesToBufferIndex(xIndex, yIndex) {
+        return yIndex * this.xSegmentCount + xIndex;
+    }
+    /**
+     * @override
+     */
+    getMinDataValue() {
+        return this.minDataValue;
+    }
+    /**
+     * @override
+     */
+    getMaxDataValue() {
+        return this.maxDataValue;
+    }
+    /**
+     * @override
+     */
+    getDataValueAt(xIndex, yIndex, isDebug) {
+        // var bufferIndex = yIndex * this.xSegmentCount + xIndex;
+        var bufferIndex = this.coordinateIndicesToBufferIndex(xIndex, yIndex);
+        // if (isDebug) {
+        //   console.log("xIndex", xIndex, "yIndex", yIndex, "bufferIndex", bufferIndex);
+        // }
+        if (bufferIndex > this._dataList.length) {
+            console.error("ERR buffer index is out of bounds! xIndex", xIndex, "yIndex", yIndex, "bufferIndex", bufferIndex);
+        }
+        if (!this._dataList[bufferIndex]) {
+            console.error("ERR buffer element is null! xIndex", xIndex, "yIndex", yIndex, "bufferIndex", bufferIndex);
+        }
+        return this._dataList && bufferIndex < this._dataList.length ? this._dataList[bufferIndex].z : null;
+    }
+    /**
+     * @override
+     */
+    getDataFace4At(xIndex, yIndex, buffer) {
+        // buffer: array[2][2]
+        buffer[0][0] = this.getDataValueAt(xIndex, yIndex);
+        buffer[1][0] = this.getDataValueAt(xIndex + 1, yIndex);
+        buffer[1][1] = this.getDataValueAt(xIndex + 1, yIndex + 1);
+        buffer[0][1] = this.getDataValueAt(xIndex, yIndex + 1);
+    }
+}
+exports.DataGrid2dListAdapter = DataGrid2dListAdapter;
+//# sourceMappingURL=DataGrid2dListAdapter.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"DataGrid2dListAdapter.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/DataGrid2dListAdapter.ts"],"names":[],"mappings":";AAAA;;;;;;;IAOI;;;AAUJ;IAmBE;;;;;;OAMG;IACH,YAAY,IAAuB,EAAE,aAAqB,EAAE,aAAqB;QAC/E,IAAI,aAAa,GAAG,aAAa,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAChD,MAAM,yDAAyD,IAAI,CAAC,MAAM,uCAAuC,aAAa,IAAI,aAAa,oBAAoB,CAAC;QACtK,CAAC;QAED,mDAAmD;QACnD,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QAEnC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACxB,CAAC;IAED,yBAAyB,CAAC,WAAmB;QAC3C,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;IACxH,CAAC;IAED,wBAAwB,CAAC,WAAmB;QAC1C,IAAI,KAAK,GAAG,IAAI,CAAC,yBAAyB,CAAC,WAAW,CAAC,CAAC;QACxD,uGAAuG;QACvG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QACrD,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;QACrD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8BAA8B,CAAC,MAAc,EAAE,MAAc;QAC3D,OAAO,MAAM,GAAG,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,MAAc,EAAE,OAAiB;QAC9D,0DAA0D;QAC1D,IAAI,WAAW,GAAG,IAAI,CAAC,8BAA8B,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACtE,iBAAiB;QACjB,iFAAiF;QACjF,IAAI;QACJ,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YACxC,OAAO,CAAC,KAAK,CAAC,2CAA2C,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;QACnH,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;YACjC,OAAO,CAAC,KAAK,CAAC,oCAAoC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;QAC5G,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,IAAI,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACtG,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,MAAc,EAAE,MAAwB;QACrE,sBAAsB;QACtB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3D,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IACzD,CAAC;CACF"}

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

@@ -0,0 +1,86 @@
+/**
+ * @author   Ikaros Kappler
+ * @version  1.1.0
+ * @date     2022-10-17
+ * @modified 2023-11-27 Added the `GenericPath.getAllStartEndPoints()` function.
+ */
+import { Path, PathSegment } from "../../interfaces/additionals";
+import { Vertex } from "../../Vertex";
+export declare class GenericPath implements Path {
+    segments: Array<PathSegment>;
+    constructor(startSegment: PathSegment);
+    /**
+     * Get the number of segments in this path.
+     *
+     * @method getSegmentCount
+     * @memberof Path
+     * @return {number} The number (integer) of path segments.
+     */
+    getSegmentCount(): number;
+    /**
+     * Get the path segment at the given index.
+     *
+     * @method getSegmentAt
+     * @memberof Path
+     * @return {PathSegment} The paths segment at the given index.
+     */
+    getSegmentAt(index: number): PathSegment;
+    /**
+     * Create a deep clone of this path.
+     *
+     * @method clone
+     * @memberof Path
+     * @return {Path} A deep clone/copy of this path.
+     */
+    clone(): GenericPath;
+    /**
+     * Reverse this path (swap start and end and thus – the direction) in-place.
+     *
+     * @method reverse
+     * @memberof Path
+     * @return {PathSegment} This path instance.
+     */
+    reverse(): this;
+    /**
+     * Get the start point of this path segment.
+     *
+     * @method getStartPoint
+     * @memberof PathSegment
+     * @return {Vertex} The start point of this path segment.
+     */
+    getStartPoint(): Vertex;
+    /**
+     * Get the end point of this path segment.
+     *
+     * @method getEndPoint
+     * @memberof PathSegment
+     * @return {Vertex} The end point of this path segment.
+     */
+    getEndPoint(): Vertex;
+    /**
+     * Get the tangent's end point at the start point of this segment.
+     *
+     * @method getStartTangent
+     * @memberof PathSegment
+     * @return {Vertex} The end point of the starting point's tangent.
+     */
+    getStartTangent(): Vertex;
+    /**
+     * Get the tangent's end point at the end point of this segment.
+     *
+     * @method getEndTangent
+     * @memberof PathSegment
+     * @return {Vertex} The end point of the ending point's tangent.
+     */
+    getEndTangent(): Vertex;
+    /**
+     * Get the sequence of all start/end points of this path.
+     * Assumption is: each path segment's end point is located on the next segment's start point
+     * to shape a full connected path.
+     *
+     * No arcs are considered here, just plain linear segments.
+     *
+     * @returns {Array<Vertex>}
+     */
+    getAllStartEndPoints(): Array<Vertex>;
+}

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

@@ -0,0 +1,121 @@
+"use strict";
+/**
+ * @author   Ikaros Kappler
+ * @version  1.1.0
+ * @date     2022-10-17
+ * @modified 2023-11-27 Added the `GenericPath.getAllStartEndPoints()` function.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GenericPath = void 0;
+class GenericPath {
+    constructor(startSegment) {
+        this.segments = [startSegment];
+    }
+    /**
+     * Get the number of segments in this path.
+     *
+     * @method getSegmentCount
+     * @memberof Path
+     * @return {number} The number (integer) of path segments.
+     */
+    getSegmentCount() {
+        return this.segments.length;
+    }
+    /**
+     * Get the path segment at the given index.
+     *
+     * @method getSegmentAt
+     * @memberof Path
+     * @return {PathSegment} The paths segment at the given index.
+     */
+    getSegmentAt(index) {
+        return this.segments[index];
+    }
+    /**
+     * Create a deep clone of this path.
+     *
+     * @method clone
+     * @memberof Path
+     * @return {Path} A deep clone/copy of this path.
+     */
+    clone() {
+        const newPath = new GenericPath(this.segments[this.segments.length - 1].clone().reverse());
+        for (var i = this.segments.length - 2; i >= 0; i--) {
+            newPath.segments.push(this.segments[i].clone().reverse());
+        }
+        return newPath;
+    }
+    /**
+     * Reverse this path (swap start and end and thus – the direction) in-place.
+     *
+     * @method reverse
+     * @memberof Path
+     * @return {PathSegment} This path instance.
+     */
+    reverse() {
+        const newSegments = [];
+        for (var i = this.segments.length - 1; i >= 0; i--) {
+            newSegments.push(this.segments[i].reverse());
+        }
+        this.segments = newSegments;
+        return this;
+    }
+    /**
+     * Get the start point of this path segment.
+     *
+     * @method getStartPoint
+     * @memberof PathSegment
+     * @return {Vertex} The start point of this path segment.
+     */
+    getStartPoint() {
+        return this.segments[0].getStartPoint();
+    }
+    /**
+     * Get the end point of this path segment.
+     *
+     * @method getEndPoint
+     * @memberof PathSegment
+     * @return {Vertex} The end point of this path segment.
+     */
+    getEndPoint() {
+        return this.segments[this.segments.length - 1].getEndPoint();
+    }
+    /**
+     * Get the tangent's end point at the start point of this segment.
+     *
+     * @method getStartTangent
+     * @memberof PathSegment
+     * @return {Vertex} The end point of the starting point's tangent.
+     */
+    getStartTangent() {
+        return this.segments[0].getStartTangent();
+    }
+    /**
+     * Get the tangent's end point at the end point of this segment.
+     *
+     * @method getEndTangent
+     * @memberof PathSegment
+     * @return {Vertex} The end point of the ending point's tangent.
+     */
+    getEndTangent() {
+        return this.segments[this.segments.length - 1].getEndTangent();
+    }
+    /**
+     * Get the sequence of all start/end points of this path.
+     * Assumption is: each path segment's end point is located on the next segment's start point
+     * to shape a full connected path.
+     *
+     * No arcs are considered here, just plain linear segments.
+     *
+     * @returns {Array<Vertex>}
+     */
+    getAllStartEndPoints() {
+        const verts = [this.segments[0].getStartPoint()];
+        this.segments.forEach((segment) => {
+            verts.push(segment.getEndPoint());
+        });
+        return verts;
+    }
+}
+exports.GenericPath = GenericPath;
+//# sourceMappingURL=GenericPath.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GenericPath.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/GenericPath.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAKH;IAGE,YAAY,YAAyB;QACnC,IAAI,CAAC,QAAQ,GAAG,CAAC,YAAY,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,KAAa;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,KAAK;QACH,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QAC3F,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,MAAM,WAAW,GAAuB,EAAE,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;IAC/D,CAAC;IAED;;;;;;OAMG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC;IAC5C,CAAC;IAED;;;;;;OAMG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjE,CAAC;IAED;;;;;;;;OAQG;IACH,oBAAoB;QAClB,MAAM,KAAK,GAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAoB,EAAE,EAAE;YAC7C,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

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

@@ -0,0 +1,49 @@
+/**
+ * Adapted from the 3D geometry datastuctured from demo-33 (depth mesh).
+ *
+ * Refactored the strucure into a class.
+ *
+ * @author   Ikaros Kappler
+ * @date     2025-11-14
+ * @modified 2025-11-17 Moved `getBounds` and `normalizeGeometry` from helper functions to this class.
+ * @version  1.0.0
+ */
+export type Vertex2 = {
+    x: number;
+    y: number;
+};
+export type Vertex3 = {
+    x: number;
+    y: number;
+    z: number;
+};
+export declare class GeometryMesh<T extends Vertex2 | Vertex3> {
+    /**
+     * A set (array) of vertices (points) used in this mesh. Can be 2d or 3d.
+     *
+     * @member {Array<T>}
+     * @memberof GeometryMesh
+     * @type {Array<T>}
+     * @instance
+     */
+    vertices: Array<T>;
+    /**
+     * A set (array) of edges used in this mesh.
+     * Each edge consist of two indices indicating the vertex position.
+     *
+     * @member {Array<T>}
+     * @memberof GeometryMesh
+     * @type {Array<T>}
+     * @instance
+     */
+    edges: Array<[number, number]>;
+    constructor(vertices?: Array<T>, edges?: Array<[number, number]>);
+    normalize(): void;
+    getGeometryBounds(): {
+        min: Vertex3;
+        max: Vertex3;
+        width: number;
+        height: number;
+        depth: number;
+    };
+}

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

@@ -0,0 +1,57 @@
+"use strict";
+/**
+ * Adapted from the 3D geometry datastuctured from demo-33 (depth mesh).
+ *
+ * Refactored the strucure into a class.
+ *
+ * @author   Ikaros Kappler
+ * @date     2025-11-14
+ * @modified 2025-11-17 Moved `getBounds` and `normalizeGeometry` from helper functions to this class.
+ * @version  1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GeometryMesh = void 0;
+class GeometryMesh {
+    constructor(vertices, edges) {
+        this.vertices = vertices || [];
+        this.edges = edges || [];
+    }
+    normalize() {
+        // Desired bounds is a max bounding box. The object will be scaled keeping aspect ratio
+        // in that way that the largest axis size touches the desired bounds.
+        var desiredBounds = { min: { x: -1, y: -1, z: -1 }, max: { x: 1, y: 1, z: 1 } };
+        var bounds = this.getGeometryBounds();
+        var sizeX = bounds.max.x - bounds.min.x;
+        var sizeY = bounds.max.y - bounds.min.y;
+        var sizeZ = bounds.max.z - bounds.min.z;
+        // Scale uniform so the dimension with the max expansion fits into [-1,1]
+        var maxDimension = Math.max(sizeX, sizeY, sizeZ);
+        var desiredSizeX = (desiredBounds.max.x - desiredBounds.min.x) / maxDimension;
+        var desiredSizeY = (desiredBounds.max.y - desiredBounds.min.y) / maxDimension;
+        var desiredSizeZ = (desiredBounds.max.z - desiredBounds.min.z) / maxDimension;
+        for (var i in this.vertices) {
+            var vert = this.vertices[i]; // TODO: Check if this is safe
+            vert.x = desiredBounds.min.x + (bounds.max.x - vert.x) * desiredSizeX;
+            vert.y = desiredBounds.min.y + (bounds.max.y - vert.y) * desiredSizeY;
+            vert.z = desiredBounds.min.z + (bounds.max.z - vert.z) * desiredSizeZ;
+        }
+    }
+    getGeometryBounds() {
+        // var min = new Vert3(Number.MAX_VALUE, Number.MAX_VALUE, Number.MAX_VALUE);
+        // var max = new Vert3(Number.MIN_VALUE, Number.MIN_VALUE, Number.MIN_VALUE);
+        var min = { x: Number.MAX_VALUE, y: Number.MAX_VALUE, z: Number.MAX_VALUE };
+        var max = { x: Number.MIN_VALUE, y: Number.MIN_VALUE, z: Number.MIN_VALUE };
+        for (var i in this.vertices) {
+            var vert = this.vertices[i];
+            min.x = Math.min(vert.x, min.x);
+            min.y = Math.min(vert.y, min.y);
+            min.z = Math.min(vert.z, min.z);
+            max.x = Math.max(vert.x, max.x);
+            max.y = Math.max(vert.y, max.y);
+            max.z = Math.max(vert.z, max.z);
+        }
+        return { min: min, max: max, width: max.x - min.x, height: max.y - min.y, depth: max.z - min.z };
+    }
+}
+exports.GeometryMesh = GeometryMesh;
+//# sourceMappingURL=GeometryMesh.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GeometryMesh.js","sourceRoot":"","sources":["../../../ts/utils/datastructures/GeometryMesh.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAKH;IAsBE,YAAY,QAAmB,EAAE,KAA+B;QAC9D,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,KAAK,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED,SAAS;QACP,uFAAuF;QACvF,qEAAqE;QACrE,IAAI,aAAa,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChF,IAAI,MAAM,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACtC,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,yEAAyE;QACzE,IAAI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACjD,IAAI,YAAY,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;QAC9E,IAAI,YAAY,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;QAC9E,IAAI,YAAY,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;QAC9E,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAY,CAAC,CAAC,8BAA8B;YACtE,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;YACtE,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;YACtE,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;QACxE,CAAC;IACH,CAAC;IAED,iBAAiB;QACf,6EAA6E;QAC7E,6EAA6E;QAC7E,IAAI,GAAG,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC;QAC5E,IAAI,GAAG,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC;QAC5E,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAY,CAAC;YACvC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;IACnG,CAAC;CACF"}