plotboilerplate 1.20.2 → 1.22.0

package/src/esm/utils/algorithms/ContourLineDetection.d.ts

@@ -0,0 +1,150 @@
+/**
+ * A function to detect contour lines from 3D terrain data.
+ *
+ * For usage see demo `./demos/48-contour-plot`.
+ *
+ * @requires detectPaths
+ * @requires GenericPath
+ * @author   Ikaros Kappler
+ * @date     2023-11-05
+ * @modified 2023-11-20 Addig path detection on a triangle based grid.
+ * @version  1.0.0
+ */
+import { Line } from "../../Line";
+import { IDataGrid2d } from "../datastructures/DataGrid2d";
+import { GenericPath } from "../datastructures/GenericPath";
+export declare class ContourLineDetection {
+    private dataGrid;
+    private rawLinearPathSegments;
+    static CLOSE_GAP_TYPE_NONE: number;
+    static CLOSE_GAP_TYPE_ABOVE: number;
+    static CLOSE_GAP_TYPE_BELOW: number;
+    debugMode: boolean;
+    /**
+     * Creates a new instance for calculating contour lines from the given data grid.
+     * @param {IDataGrid2d<number>} dataGrid - The data grid to use. Must not contain any NaN or null values.
+     * @param {boolean=?} debugMode - (optional) Pass `true` to log warnings on (rare) critical edge cases where the algorithm might fail.
+     */
+    constructor(dataGrid: IDataGrid2d<number>, debugMode?: boolean);
+    /**
+     * Detect contour paths from the underlying data source.
+     *
+     * @param {number} criticalHeightValue - The height value. If above data's maximum or below data's minimum then the result will be empty (no intersections).
+     * @param {number} options.closeGapType - `CLOSE_GAP_TYPE_NONE` or `CLOSE_GAP_TYPE_ABOVE` or `CLOSE_GAP_TYPE_BELOW`.
+     * @param {boolean=false} options.useTriangles - If set to true the detection will split each face3 quad into two triangle faces.
+     * @param {pathDetectEpsilon=0.000001} options.pathDetectEpsilon - (optional) The epsilon to tell if two points are located 'in the same place'. Used for connected path detection. If not specified the value `0.0000001` is used.
+     * @param {pointEliminationEpsilon=0.0000001} options.pointEliminationEpsilon - (optional) The epsilon for duplicate point elimination (default is 0.000001).
+     * @param {function?} onRawSegmentsDetected - (optional) Get the interim result of all detected single lines before path detection starts; DO NOT MODIFY the array.
+     * @returns {Array<GenericPath>} - A list of connected paths that resemble the contour lines of the data/terrain at the given height value.
+     */
+    detectContourPaths(criticalHeightValue: number, options?: {
+        closeGapType: number;
+        useTriangles?: boolean;
+        pointEliminationEpsilon?: number;
+        pathDetectEpsilon?: number;
+        onRawSegmentsDetected?: (rawSegmentsDoNotModifiy: Array<Line>) => void;
+    }): Array<GenericPath>;
+    /**
+     * This function will calculate a single intersecion line of the given face4 data
+     * segment. If the given face does not intersect with the plane at the given `heightValue`
+     * then no segments will be stored.
+     *
+     * @param {number} xIndex - The x position (index) of the data face.
+     * @param {number} yIndex - The y position (index) of the data face.
+     * @param {[[number,number],[number,number]]} heightFace - The data sample that composes the face4 as a two-dimensional number array.
+     * @param {number} heightValue - The height value of the intersection plane to check for.
+     * @returns {Line|null}
+     */
+    private findHeight4FaceIntersectionLine;
+    /**
+     * This function will calculate a single intersecion line of the given face4 data
+     * segment. If the given face does not intersect with the plane at the given `heightValue`
+     * then no segments will be stored.
+     *
+     * @param {number} xIndex - The x position (index) of the data face.
+     * @param {number} yIndex - The y position (index) of the data face.
+     * @param {[[number,number],[number,number]]} heightFace - The data sample that composes the face4 as a two-dimensional number array.
+     * @param {number} heightValue - The height value of the intersection plane to check for.
+     * @returns {Line|null}
+     */
+    private findHeightFaceIntersectionLines;
+    /**
+     * This function will calculate a single intersecion line of the given face3 data
+     * segment. If the given face does not intersect with the plane at the given `heightValue`
+     * then no segments will be stored.
+     *
+     * @param {number} xIndexA - The x position (index) of the first triangle data point.
+     * @param {number} yIndexA - The y position (index) of the first triangle data point.
+     * @param {[[number,number],[number,number]]} heightFace - The data sample that composes the face4 as a two-dimensional number array.
+     * @param {number} heightValue - The height value of the intersection plane to check for.
+     * @returns {Line|null}
+     */
+    private findHeighteFace3IntersectionLine;
+    /**
+     * This procedure will look at the face4 at the ((x,y),(nextX,nextY)) position – which are four values –
+     * and determines the local contour lines for these cases.
+     *
+     * This is used to detect and calculate edge cases on the borders of the underliying height data:
+     *  * left and right border (x=0, x=data.xSegmentCount)
+     *  * top and bottom border (x=y, x=data.ySegmentCount)
+     *
+     * Resulting path segments will be stored in the global `rawLinearPathSegments` array for further processing.
+     *
+     * @param {number} x
+     * @param {number} y
+     * @param {number} nextX
+     * @param {number} nextY
+     * @param {number} criticalHeightValue
+     * @param {number} closeGapType - CLOSE_GAP_TYPE_ABOVE or CLOSE_GAP_TYPE_BELOW.
+     * @return {void}
+     */
+    detectAboveBelowLerpSegment(x: number, y: number, nextX: number, nextY: number, criticalHeightValue: number, closeGapType: number): void;
+    /**
+     * Checks if both value are on the same side of the critical value (above or below). The `closeGapType`
+     * indictes if `CLOSE_GAP_TYPE_BELOW` or `CLOSE_GAP_TYPE_ABOVE` should be used as a rule.
+     *
+     * @param {number} valueA
+     * @param {number} valueB
+     * @param {number} criticalValue
+     * @param {number} closeGapType
+     * @returns {boolean}
+     */
+    private areBothValuesOnRequiredPlaneSide;
+    /**
+     * Test if a given numeric value (`curValue`) is between the given values `valA` and `valB`.
+     * Value A and B don't need to be in ascending order, so `valA <= curValue <= valB` and `valB <= curvalue <= valA`
+     * will do the job.
+     *
+     * @param {number} valA - The first of the two bounds.
+     * @param {number} valB - The second of the two bounds.
+     * @param {number} curValue - The value to check if it is between (or equal) to the given bounds.
+     * @returns {boolean}
+     */
+    private isBetween;
+    /**
+     * Get a 'lerp' value - which is some sort of percentage/ratio for the `curValue` inside the
+     * range of the given interval `[valA ... valB]`.
+     *
+     * Examples:
+     *  * getLerpRatio(0,100,50) === 0.5
+     *  * getLerpRatio(50,100,75) === 0.5
+     *  * getLerpRatio(0,100,0) === 0.0
+     *  * getLerpRatio(0,100,100) === 1.0
+     *  * getLerpRatio(0,100,-50) === -0.5
+     *
+     * @param {number} valA
+     * @param {number} valB
+     * @param {number} curValue
+     * @returns
+     */
+    private getLerpRatio;
+    /**
+     * Helper function to lerp a numeric value.
+     *
+     * @param {number} min - The min (start) value. Doesn't necesarily need to be the smaller one.
+     * @param {number} max - The max (end) value. Doesn't necesarily need to be the larger one.
+     * @param {number} ratio - The lerp ratio; usually a value between 0.0 and 1.0, but other values a valid for linear interpolation, too.
+     * @returns {number}
+     */
+    private lerp;
+}

package/src/esm/utils/algorithms/ContourLineDetection.js

@@ -0,0 +1,362 @@
+/**
+ * A function to detect contour lines from 3D terrain data.
+ *
+ * For usage see demo `./demos/48-contour-plot`.
+ *
+ * @requires detectPaths
+ * @requires GenericPath
+ * @author   Ikaros Kappler
+ * @date     2023-11-05
+ * @modified 2023-11-20 Addig path detection on a triangle based grid.
+ * @version  1.0.0
+ */
+import { Line } from "../../Line";
+import { Vertex } from "../../Vertex";
+import { detectPaths } from "./detectPaths";
+import { clearDuplicateVertices } from "./clearDuplicateVertices";
+export class ContourLineDetection {
+    /**
+     * Creates a new instance for calculating contour lines from the given data grid.
+     * @param {IDataGrid2d<number>} dataGrid - The data grid to use. Must not contain any NaN or null values.
+     * @param {boolean=?} debugMode - (optional) Pass `true` to log warnings on (rare) critical edge cases where the algorithm might fail.
+     */
+    constructor(dataGrid, debugMode) {
+        this.rawLinearPathSegments = [];
+        // Activates/deactivates warning messages on rare edge cases where local path detection fails.
+        this.debugMode = false;
+        this.dataGrid = dataGrid;
+        this.debugMode = Boolean(debugMode);
+    }
+    /**
+     * Detect contour paths from the underlying data source.
+     *
+     * @param {number} criticalHeightValue - The height value. If above data's maximum or below data's minimum then the result will be empty (no intersections).
+     * @param {number} options.closeGapType - `CLOSE_GAP_TYPE_NONE` or `CLOSE_GAP_TYPE_ABOVE` or `CLOSE_GAP_TYPE_BELOW`.
+     * @param {boolean=false} options.useTriangles - If set to true the detection will split each face3 quad into two triangle faces.
+     * @param {pathDetectEpsilon=0.000001} options.pathDetectEpsilon - (optional) The epsilon to tell if two points are located 'in the same place'. Used for connected path detection. If not specified the value `0.0000001` is used.
+     * @param {pointEliminationEpsilon=0.0000001} options.pointEliminationEpsilon - (optional) The epsilon for duplicate point elimination (default is 0.000001).
+     * @param {function?} onRawSegmentsDetected - (optional) Get the interim result of all detected single lines before path detection starts; DO NOT MODIFY the array.
+     * @returns {Array<GenericPath>} - A list of connected paths that resemble the contour lines of the data/terrain at the given height value.
+     */
+    detectContourPaths(criticalHeightValue, options) {
+        var _a, _b;
+        options = options || { closeGapType: ContourLineDetection.CLOSE_GAP_TYPE_NONE };
+        // First: clear the buffer
+        this.rawLinearPathSegments = [];
+        // Imagine a face4 element like this
+        //    (x,y)       (x+1,y)
+        //         A-----B
+        //         |   / |
+        //         | /   |
+        //         D-----C
+        //  (x,y+1)        (x+1,y+1)
+        //	   then result in the buffer will be
+        //   [ [A,B],
+        //     [D,C] ]
+        // Note that the diagonal line (used for triangles) is optional; depends on `options.useTriangles`.
+        const heightFace = [
+            [0, 0],
+            [0, 0]
+        ];
+        for (var y = 0; y + 1 < this.dataGrid.ySegmentCount; y++) {
+            for (var x = 0; x + 1 < this.dataGrid.xSegmentCount; x++) {
+                this.dataGrid.getDataFace4At(x, y, heightFace);
+                this.findHeightFaceIntersectionLines(x, y, heightFace, criticalHeightValue, (_a = options.pointEliminationEpsilon) !== null && _a !== void 0 ? _a : 0.0000001, options.useTriangles);
+            }
+        }
+        // Collect value above/below on the y axis
+        if (options.closeGapType == ContourLineDetection.CLOSE_GAP_TYPE_ABOVE ||
+            options.closeGapType == ContourLineDetection.CLOSE_GAP_TYPE_BELOW) {
+            const xExtremes = [0, this.dataGrid.xSegmentCount - 1];
+            for (var i = 0; i < xExtremes.length; i++) {
+                const x = xExtremes[i];
+                for (var y = 0; y + 1 < this.dataGrid.ySegmentCount; y++) {
+                    const nextX = x;
+                    const nextY = y + 1;
+                    this.detectAboveBelowLerpSegment(x, y, nextX, nextY, criticalHeightValue, options.closeGapType);
+                }
+            }
+            const yExtremes = [0, this.dataGrid.ySegmentCount - 1];
+            for (var j = 0; j < yExtremes.length; j++) {
+                var y = yExtremes[j];
+                for (var x = 0; x + 1 < this.dataGrid.xSegmentCount; x++) {
+                    const nextX = x + 1;
+                    const nextY = y;
+                    this.detectAboveBelowLerpSegment(x, y, nextX, nextY, criticalHeightValue, options.closeGapType);
+                }
+            }
+        }
+        if (options.onRawSegmentsDetected) {
+            options.onRawSegmentsDetected(this.rawLinearPathSegments);
+        }
+        // Detect connected paths
+        let pathSegments = detectPaths(this.rawLinearPathSegments, (_b = options.pathDetectEpsilon) !== null && _b !== void 0 ? _b : 0.0000001); // Epsilon
+        // Filter out segments with only a single line of length~=0
+        pathSegments = pathSegments.filter(function (pathSegment) {
+            return (pathSegment.segments.length != 1 ||
+                (pathSegment.segments.length === 1 && pathSegment.segments[0].length() > 0.1));
+        });
+        return pathSegments;
+    }
+    /**
+     * This function will calculate a single intersecion line of the given face4 data
+     * segment. If the given face does not intersect with the plane at the given `heightValue`
+     * then no segments will be stored.
+     *
+     * @param {number} xIndex - The x position (index) of the data face.
+     * @param {number} yIndex - The y position (index) of the data face.
+     * @param {[[number,number],[number,number]]} heightFace - The data sample that composes the face4 as a two-dimensional number array.
+     * @param {number} heightValue - The height value of the intersection plane to check for.
+     * @returns {Line|null}
+     */
+    findHeight4FaceIntersectionLine(xIndex, yIndex, heightFace, heightValue, pointEliminationEpsilon) {
+        const heightValueA = heightFace[0][0]; // value at (x,y)
+        const heightValueB = heightFace[1][0];
+        const heightValueC = heightFace[1][1];
+        const heightValueD = heightFace[0][1];
+        if (heightValueA === null || heightValueB === null || heightValueC === null || heightValueD === null) {
+            throw `[findHeightFace4IntersectionLine] Cannot extract data face at (${xIndex},${yIndex}). Some values are null.`;
+        }
+        let points = [];
+        // Case A: use full quad face
+        if (this.isBetween(heightValueA, heightValueB, heightValue)) {
+            const lerpValueByHeight = this.getLerpRatio(heightValueA, heightValueB, heightValue);
+            points.push(new Vertex(this.lerp(xIndex, xIndex + 1, lerpValueByHeight), yIndex));
+        }
+        if (this.isBetween(heightValueB, heightValueC, heightValue)) {
+            const lerpValueByHeight = this.getLerpRatio(heightValueB, heightValueC, heightValue);
+            points.push(new Vertex(xIndex + 1, this.lerp(yIndex, yIndex + 1, lerpValueByHeight)));
+        }
+        if (this.isBetween(heightValueC, heightValueD, heightValue)) {
+            const lerpValueByHeight = this.getLerpRatio(heightValueC, heightValueD, heightValue);
+            points.push(new Vertex(this.lerp(xIndex + 1, xIndex, lerpValueByHeight), yIndex + 1));
+        }
+        if (this.isBetween(heightValueD, heightValueA, heightValue)) {
+            const lerpValueByHeight = this.getLerpRatio(heightValueD, heightValueA, heightValue);
+            points.push(new Vertex(xIndex, this.lerp(yIndex + 1, yIndex, lerpValueByHeight)));
+        }
+        // Warning: if a plane intersection point is located EXACTLY on the corner
+        // edge of a face, then the two adjacent edges will result in 2x the same
+        // intersecion point. This must be handled as one, so filter the point list
+        // by an epsilon.
+        points = clearDuplicateVertices(points, pointEliminationEpsilon); // 0.000001);
+        if (points.length >= 2) {
+            const startPoint = points[0];
+            const endPoint = points[1];
+            if (this.debugMode && points.length > 2) {
+                console.warn("[findHeightFace4IntersectionLine] Detected more than 2 points on one face whre only 0 or 2 should appear. At ", xIndex, yIndex, points);
+            }
+            return new Line(startPoint, endPoint);
+        }
+        else {
+            if (this.debugMode && points.length === 1) {
+                console.warn("[findHeightFace4IntersectionLine] Point list has only one point (should not happen).");
+            }
+            return null;
+        }
+    }
+    /**
+     * This function will calculate a single intersecion line of the given face4 data
+     * segment. If the given face does not intersect with the plane at the given `heightValue`
+     * then no segments will be stored.
+     *
+     * @param {number} xIndex - The x position (index) of the data face.
+     * @param {number} yIndex - The y position (index) of the data face.
+     * @param {[[number,number],[number,number]]} heightFace - The data sample that composes the face4 as a two-dimensional number array.
+     * @param {number} heightValue - The height value of the intersection plane to check for.
+     * @returns {Line|null}
+     */
+    findHeightFaceIntersectionLines(xIndex, yIndex, heightFace, criticalHeightValue, pointEliminationEpsilon, useTriangles) {
+        // Imagine a face4 element like this
+        //    (x,y)       (x+1,y)
+        //         A-----B
+        //         |   / |
+        //         | /   |
+        //         D-----C
+        //  (x,y+1)        (x+1,y+1)
+        //	   then result in the buffer will be
+        //   [ [A,B],
+        //     [D,C] ]
+        if (useTriangles) {
+            const lineA = this.findHeighteFace3IntersectionLine(xIndex, yIndex, xIndex, yIndex + 1, xIndex + 1, yIndex, [heightFace[0][0], heightFace[0][1], heightFace[1][0]], criticalHeightValue, pointEliminationEpsilon);
+            if (lineA) {
+                this.rawLinearPathSegments.push(lineA);
+            }
+            const lineB = this.findHeighteFace3IntersectionLine(xIndex, yIndex + 1, xIndex + 1, yIndex + 1, xIndex + 1, yIndex, [heightFace[0][1], heightFace[1][1], heightFace[1][0]], criticalHeightValue, pointEliminationEpsilon);
+            if (lineB) {
+                this.rawLinearPathSegments.push(lineB);
+            }
+        }
+        else {
+            const line = this.findHeight4FaceIntersectionLine(xIndex, yIndex, heightFace, criticalHeightValue, pointEliminationEpsilon);
+            if (line) {
+                this.rawLinearPathSegments.push(line);
+            }
+        }
+    }
+    /**
+     * This function will calculate a single intersecion line of the given face3 data
+     * segment. If the given face does not intersect with the plane at the given `heightValue`
+     * then no segments will be stored.
+     *
+     * @param {number} xIndexA - The x position (index) of the first triangle data point.
+     * @param {number} yIndexA - The y position (index) of the first triangle data point.
+     * @param {[[number,number],[number,number]]} heightFace - The data sample that composes the face4 as a two-dimensional number array.
+     * @param {number} heightValue - The height value of the intersection plane to check for.
+     * @returns {Line|null}
+     */
+    findHeighteFace3IntersectionLine(xIndexA, yIndexA, xIndexB, yIndexB, xIndexC, yIndexC, heightFace, heightValue, pointEliminationEpsilon) {
+        const heightValueA = heightFace[0]; // value at (x,y)
+        const heightValueB = heightFace[1];
+        const heightValueC = heightFace[2];
+        if (heightValueA === null || heightValueB === null || heightValueC === null) {
+            throw `[findHeightFace3IntersectionLine] Cannot extract data face at (${xIndexA},${yIndexA}). Some values are null.`;
+        }
+        let points = [];
+        // Case A: use full quad face
+        if (this.isBetween(heightValueA, heightValueB, heightValue)) {
+            const lerpValueByHeight = this.getLerpRatio(heightValueA, heightValueB, heightValue);
+            points.push(new Vertex(this.lerp(xIndexA, xIndexB, lerpValueByHeight), this.lerp(yIndexA, yIndexB, lerpValueByHeight)));
+        }
+        if (this.isBetween(heightValueB, heightValueC, heightValue)) {
+            const lerpValueByHeight = this.getLerpRatio(heightValueB, heightValueC, heightValue);
+            // points.push(new Vertex(xIndex + 1, this.lerp(yIndex, yIndex + 1, lerpValueByHeight)));
+            points.push(new Vertex(this.lerp(xIndexB, xIndexC, lerpValueByHeight), this.lerp(yIndexB, yIndexC, lerpValueByHeight)));
+        }
+        if (this.isBetween(heightValueC, heightValueA, heightValue)) {
+            const lerpValueByHeight = this.getLerpRatio(heightValueC, heightValueA, heightValue);
+            // points.push(new Vertex(this.lerp(xIndex + 1, xIndex, lerpValueByHeight), yIndex + 1));
+            points.push(new Vertex(this.lerp(xIndexC, xIndexA, lerpValueByHeight), this.lerp(yIndexC, yIndexA, lerpValueByHeight)));
+        }
+        // Warning: if a plane intersection point is located EXACTLY on the corner
+        // edge of a face, then the two adjacent edges will result in 2x the same
+        // intersecion point. This must be handled as one, so filter the point list
+        // by an epsilon.
+        points = clearDuplicateVertices(points, pointEliminationEpsilon); // 0.0000001);
+        if (points.length >= 2) {
+            const startPoint = points[0];
+            const endPoint = points[1];
+            if (this.debugMode && points.length > 2) {
+                console.warn("[findHeightFace3IntersectionLine] Detected more than 2 points on one face whre only 0 or 2 should appear. At ", xIndexA, yIndexA, points);
+            }
+            return new Line(startPoint, endPoint);
+        }
+        else {
+            if (this.debugMode && points.length === 1) {
+                console.warn("[findHeightFace3IntersectionLine] Point list has only one point (should not happen).");
+            }
+            return null;
+        }
+    }
+    /**
+     * This procedure will look at the face4 at the ((x,y),(nextX,nextY)) position – which are four values –
+     * and determines the local contour lines for these cases.
+     *
+     * This is used to detect and calculate edge cases on the borders of the underliying height data:
+     *  * left and right border (x=0, x=data.xSegmentCount)
+     *  * top and bottom border (x=y, x=data.ySegmentCount)
+     *
+     * Resulting path segments will be stored in the global `rawLinearPathSegments` array for further processing.
+     *
+     * @param {number} x
+     * @param {number} y
+     * @param {number} nextX
+     * @param {number} nextY
+     * @param {number} criticalHeightValue
+     * @param {number} closeGapType - CLOSE_GAP_TYPE_ABOVE or CLOSE_GAP_TYPE_BELOW.
+     * @return {void}
+     */
+    detectAboveBelowLerpSegment(x, y, nextX, nextY, criticalHeightValue, closeGapType) {
+        const heightValueA = this.dataGrid.getDataValueAt(x, y);
+        const heightValueB = this.dataGrid.getDataValueAt(nextX, nextY);
+        //   if (heightValueA >= criticalHeightValue && heightValueB >= criticalHeightValue) {
+        if (this.areBothValuesOnRequiredPlaneSide(heightValueA, heightValueB, criticalHeightValue, closeGapType)) {
+            //  Both above
+            const line = new Line(new Vertex(x, y), new Vertex(nextX, nextY));
+            this.rawLinearPathSegments.push(line);
+        }
+        else if ((closeGapType == ContourLineDetection.CLOSE_GAP_TYPE_ABOVE &&
+            heightValueA >= criticalHeightValue &&
+            heightValueB <= criticalHeightValue) ||
+            (closeGapType == ContourLineDetection.CLOSE_GAP_TYPE_BELOW &&
+                heightValueA <= criticalHeightValue &&
+                heightValueB >= criticalHeightValue)) {
+            // Only one of both (first) is above -> interpolate to find exact intersection point
+            const lerpValueByHeight = this.getLerpRatio(heightValueA, heightValueB, criticalHeightValue);
+            const interpLine = new Line(new Vertex(x, y), new Vertex(this.lerp(x, nextX, lerpValueByHeight), this.lerp(y, nextY, lerpValueByHeight)));
+            this.rawLinearPathSegments.push(interpLine);
+        }
+        else if ((closeGapType == ContourLineDetection.CLOSE_GAP_TYPE_ABOVE &&
+            heightValueA <= criticalHeightValue &&
+            heightValueB >= criticalHeightValue) ||
+            (closeGapType == ContourLineDetection.CLOSE_GAP_TYPE_BELOW &&
+                heightValueA >= criticalHeightValue &&
+                heightValueB <= criticalHeightValue)) {
+            // Only one of both (second) is above -> interpolate to find exact intersection point
+            const lerpValueByHeight = this.getLerpRatio(heightValueA, heightValueB, criticalHeightValue);
+            const interpLine = new Line(new Vertex(this.lerp(x, nextX, lerpValueByHeight), this.lerp(y, nextY, lerpValueByHeight)), new Vertex(nextX, nextY));
+            this.rawLinearPathSegments.push(interpLine);
+        }
+    }
+    /**
+     * Checks if both value are on the same side of the critical value (above or below). The `closeGapType`
+     * indictes if `CLOSE_GAP_TYPE_BELOW` or `CLOSE_GAP_TYPE_ABOVE` should be used as a rule.
+     *
+     * @param {number} valueA
+     * @param {number} valueB
+     * @param {number} criticalValue
+     * @param {number} closeGapType
+     * @returns {boolean}
+     */
+    areBothValuesOnRequiredPlaneSide(valueA, valueB, criticalValue, closeGapType) {
+        return ((closeGapType == ContourLineDetection.CLOSE_GAP_TYPE_BELOW && valueA <= criticalValue && valueB <= criticalValue) ||
+            (closeGapType == ContourLineDetection.CLOSE_GAP_TYPE_ABOVE && valueA >= criticalValue && valueB >= criticalValue));
+    }
+    /**
+     * Test if a given numeric value (`curValue`) is between the given values `valA` and `valB`.
+     * Value A and B don't need to be in ascending order, so `valA <= curValue <= valB` and `valB <= curvalue <= valA`
+     * will do the job.
+     *
+     * @param {number} valA - The first of the two bounds.
+     * @param {number} valB - The second of the two bounds.
+     * @param {number} curValue - The value to check if it is between (or equal) to the given bounds.
+     * @returns {boolean}
+     */
+    isBetween(valA, valB, curValue) {
+        return (valA <= curValue && curValue <= valB) || (valB <= curValue && curValue <= valA);
+    }
+    /**
+     * Get a 'lerp' value - which is some sort of percentage/ratio for the `curValue` inside the
+     * range of the given interval `[valA ... valB]`.
+     *
+     * Examples:
+     *  * getLerpRatio(0,100,50) === 0.5
+     *  * getLerpRatio(50,100,75) === 0.5
+     *  * getLerpRatio(0,100,0) === 0.0
+     *  * getLerpRatio(0,100,100) === 1.0
+     *  * getLerpRatio(0,100,-50) === -0.5
+     *
+     * @param {number} valA
+     * @param {number} valB
+     * @param {number} curValue
+     * @returns
+     */
+    getLerpRatio(valA, valB, curValue) {
+        return (curValue - valA) / (valB - valA);
+    }
+    /**
+     * Helper function to lerp a numeric value.
+     *
+     * @param {number} min - The min (start) value. Doesn't necesarily need to be the smaller one.
+     * @param {number} max - The max (end) value. Doesn't necesarily need to be the larger one.
+     * @param {number} ratio - The lerp ratio; usually a value between 0.0 and 1.0, but other values a valid for linear interpolation, too.
+     * @returns {number}
+     */
+    lerp(min, max, ratio) {
+        return min + (max - min) * ratio;
+    }
+}
+ContourLineDetection.CLOSE_GAP_TYPE_NONE = 0;
+ContourLineDetection.CLOSE_GAP_TYPE_ABOVE = 1;
+ContourLineDetection.CLOSE_GAP_TYPE_BELOW = 2;
+//# sourceMappingURL=ContourLineDetection.js.map

package/src/esm/utils/algorithms/ContourLineDetection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ContourLineDetection.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/ContourLineDetection.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAQlE,MAAM,OAAO,oBAAoB;IAY/B;;;;OAIG;IACH,YAAY,QAA6B,EAAE,SAAmB;QAdtD,0BAAqB,GAAgB,EAAE,CAAC;QAMhD,8FAA8F;QACvF,cAAS,GAAY,KAAK,CAAC;QAQhC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAED;;;;;;;;;;OAUG;IACH,kBAAkB,CAChB,mBAA2B,EAC3B,OAMC;;QAED,OAAO,GAAG,OAAO,IAAI,EAAE,YAAY,EAAE,oBAAoB,CAAC,mBAAmB,EAAE,CAAC;QAEhF,0BAA0B;QAC1B,IAAI,CAAC,qBAAqB,GAAG,EAAE,CAAC;QAEhC,oCAAoC;QACpC,yBAAyB;QACzB,kBAAkB;QAClB,kBAAkB;QAClB,kBAAkB;QAClB,kBAAkB;QAClB,4BAA4B;QAC5B,uCAAuC;QACvC,aAAa;QACb,cAAc;QACd,mGAAmG;QACnG,MAAM,UAAU,GAA0B;YACxC,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;SACP,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;YACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;gBACxD,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;gBAC/C,IAAI,CAAC,+BAA+B,CAClC,CAAC,EACD,CAAC,EACD,UAAU,EACV,mBAAmB,QACnB,OAAO,CAAC,uBAAuB,mCAAI,SAAS,EAC5C,OAAO,CAAC,YAAY,CACrB,CAAC;aACH;SACF;QAED,0CAA0C;QAC1C,IACE,OAAO,CAAC,YAAY,IAAI,oBAAoB,CAAC,oBAAoB;YACjE,OAAO,CAAC,YAAY,IAAI,oBAAoB,CAAC,oBAAoB,EACjE;YACA,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;YACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACzC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;oBACxD,MAAM,KAAK,GAAG,CAAC,CAAC;oBAChB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;oBACpB,IAAI,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;iBACjG;aACF;YACD,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;YACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACzC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;oBACxD,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;oBACpB,MAAM,KAAK,GAAG,CAAC,CAAC;oBAChB,IAAI,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;iBACjG;aACF;SACF;QAED,IAAI,OAAO,CAAC,qBAAqB,EAAE;YACjC,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;SAC3D;QAED,yBAAyB;QACzB,IAAI,YAAY,GAAuB,WAAW,CAAC,IAAI,CAAC,qBAAqB,QAAE,OAAO,CAAC,iBAAiB,mCAAI,SAAS,CAAC,CAAC,CAAC,UAAU;QAClI,2DAA2D;QAC3D,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,WAAW;YACtD,OAAO,CACL,WAAW,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC;gBAChC,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAK,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAU,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CACxF,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;;;;;OAUG;IACK,+BAA+B,CACrC,MAAc,EACd,MAAc,EACd,UAAiC,EACjC,WAAmB,EACnB,uBAA+B;QAE/B,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB;QACxD,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtC,IAAI,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,IAAI,EAAE;YACpG,MAAM,kEAAkE,MAAM,IAAI,MAAM,0BAA0B,CAAC;SACpH;QAED,IAAI,MAAM,GAAkB,EAAE,CAAC;QAE/B,6BAA6B;QAC7B,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE;YAC3D,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACrF,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE,iBAAiB,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;SACnF;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE;YAC3D,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACrF,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;SACvF;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE;YAC3D,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACrF,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,iBAAiB,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;SACvF;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE;YAC3D,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACrF,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;SACnF;QAED,0EAA0E;QAC1E,yEAAyE;QACzE,2EAA2E;QAC3E,iBAAiB;QACjB,MAAM,GAAG,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC,CAAC,aAAa;QAE/E,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE;YACtB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvC,OAAO,CAAC,IAAI,CACV,+GAA+G,EAC/G,MAAM,EACN,MAAM,EACN,MAAM,CACP,CAAC;aACH;YACD,OAAO,IAAI,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;SACvC;aAAM;YACL,IAAI,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;gBACzC,OAAO,CAAC,IAAI,CAAC,sFAAsF,CAAC,CAAC;aACtG;YACD,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACK,+BAA+B,CACrC,MAAc,EACd,MAAc,EACd,UAAiC,EACjC,mBAA2B,EAC3B,uBAA+B,EAC/B,YAAsB;QAEtB,oCAAoC;QACpC,yBAAyB;QACzB,kBAAkB;QAClB,kBAAkB;QAClB,kBAAkB;QAClB,kBAAkB;QAClB,4BAA4B;QAC5B,uCAAuC;QACvC,aAAa;QACb,cAAc;QACd,IAAI,YAAY,EAAE;YAChB,MAAM,KAAK,GAAG,IAAI,CAAC,gCAAgC,CACjD,MAAM,EACN,MAAM,EACN,MAAM,EACN,MAAM,GAAG,CAAC,EACV,MAAM,GAAG,CAAC,EACV,MAAM,EACN,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACtD,mBAAmB,EACnB,uBAAuB,CACxB,CAAC;YACF,IAAI,KAAK,EAAE;gBACT,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACxC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC,gCAAgC,CACjD,MAAM,EACN,MAAM,GAAG,CAAC,EACV,MAAM,GAAG,CAAC,EACV,MAAM,GAAG,CAAC,EACV,MAAM,GAAG,CAAC,EACV,MAAM,EACN,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACtD,mBAAmB,EACnB,uBAAuB,CACxB,CAAC;YACF,IAAI,KAAK,EAAE;gBACT,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACxC;SACF;aAAM;YACL,MAAM,IAAI,GAAG,IAAI,CAAC,+BAA+B,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,mBAAmB,EAAE,uBAAuB,CAAC,CAAC;YAC5H,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACvC;SACF;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACK,gCAAgC,CACtC,OAAe,EACf,OAAe,EACf,OAAe,EACf,OAAe,EACf,OAAe,EACf,OAAe,EACf,UAAiC,EACjC,WAAmB,EACnB,uBAA+B;QAE/B,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAiB;QACrD,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAEnC,IAAI,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,IAAI,EAAE;YAC3E,MAAM,kEAAkE,OAAO,IAAI,OAAO,0BAA0B,CAAC;SACtH;QAED,IAAI,MAAM,GAAkB,EAAE,CAAC;QAE/B,6BAA6B;QAC7B,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE;YAC3D,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACrF,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,iBAAiB,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;SACzH;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE;YAC3D,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACrF,yFAAyF;YACzF,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,iBAAiB,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;SACzH;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE;YAC3D,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACrF,yFAAyF;YACzF,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,iBAAiB,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;SACzH;QAED,0EAA0E;QAC1E,yEAAyE;QACzE,2EAA2E;QAC3E,iBAAiB;QACjB,MAAM,GAAG,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC,CAAC,cAAc;QAEhF,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE;YACtB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvC,OAAO,CAAC,IAAI,CACV,+GAA+G,EAC/G,OAAO,EACP,OAAO,EACP,MAAM,CACP,CAAC;aACH;YACD,OAAO,IAAI,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;SACvC;aAAM;YACL,IAAI,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;gBACzC,OAAO,CAAC,IAAI,CAAC,sFAAsF,CAAC,CAAC;aACtG;YACD,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,2BAA2B,CACzB,CAAS,EACT,CAAS,EACT,KAAa,EACb,KAAa,EACb,mBAA2B,EAC3B,YAAoB;QAEpB,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAChE,sFAAsF;QACtF,IAAI,IAAI,CAAC,gCAAgC,CAAC,YAAY,EAAE,YAAY,EAAE,mBAAmB,EAAE,YAAY,CAAC,EAAE;YACxG,cAAc;YACd,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YAClE,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACvC;aAAM,IACL,CAAC,YAAY,IAAI,oBAAoB,CAAC,oBAAoB;YACxD,YAAY,IAAI,mBAAmB;YACnC,YAAY,IAAI,mBAAmB,CAAC;YACtC,CAAC,YAAY,IAAI,oBAAoB,CAAC,oBAAoB;gBACxD,YAAY,IAAI,mBAAmB;gBACnC,YAAY,IAAI,mBAAmB,CAAC,EACtC;YACA,oFAAoF;YACpF,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,mBAAmB,CAAC,CAAC;YAC7F,MAAM,UAAU,GAAG,IAAI,IAAI,CACzB,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAChB,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,iBAAiB,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAC3F,CAAC;YACF,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SAC7C;aAAM,IACL,CAAC,YAAY,IAAI,oBAAoB,CAAC,oBAAoB;YACxD,YAAY,IAAI,mBAAmB;YACnC,YAAY,IAAI,mBAAmB,CAAC;YACtC,CAAC,YAAY,IAAI,oBAAoB,CAAC,oBAAoB;gBACxD,YAAY,IAAI,mBAAmB;gBACnC,YAAY,IAAI,mBAAmB,CAAC,EACtC;YACA,qFAAqF;YACrF,MAAM,iBAAiB,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,YAAY,EAAE,mBAAmB,CAAC,CAAC;YAC7F,MAAM,UAAU,GAAG,IAAI,IAAI,CACzB,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,iBAAiB,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAC,EAC1F,IAAI,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CACzB,CAAC;YACF,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SAC7C;IACH,CAAC;IAED;;;;;;;;;OASG;IACK,gCAAgC,CAAC,MAAc,EAAE,MAAc,EAAE,aAAqB,EAAE,YAAoB;QAClH,OAAO,CACL,CAAC,YAAY,IAAI,oBAAoB,CAAC,oBAAoB,IAAI,MAAM,IAAI,aAAa,IAAI,MAAM,IAAI,aAAa,CAAC;YACjH,CAAC,YAAY,IAAI,oBAAoB,CAAC,oBAAoB,IAAI,MAAM,IAAI,aAAa,IAAI,MAAM,IAAI,aAAa,CAAC,CAClH,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACK,SAAS,CAAC,IAAY,EAAE,IAAY,EAAE,QAAgB;QAC5D,OAAO,CAAC,IAAI,IAAI,QAAQ,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,IAAI,QAAQ,IAAI,IAAI,CAAC,CAAC;IAC1F,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACK,YAAY,CAAC,IAAY,EAAE,IAAY,EAAE,QAAgB;QAC/D,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;OAOG;IACK,IAAI,CAAC,GAAW,EAAE,GAAW,EAAE,KAAa;QAClD,OAAO,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;IACnC,CAAC;;AArcM,wCAAmB,GAAG,CAAC,CAAC;AACxB,yCAAoB,GAAG,CAAC,CAAC;AACzB,yCAAoB,GAAG,CAAC,CAAC"}

package/src/esm/utils/algorithms/clearDuplicateVertices.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Remove duplicate vertices (2d) from an array.
+ *
+ * This method war taken and refactored from an older demo.
+ *
+ * @author   Ikaros Kappler
+ * @date     2021-07-13
+ * @modified 2023-10-28 Refactored and ported to Typescript.
+ * @version  1.0.0
+ */
+import { Vertex } from "../../Vertex";
+/**
+ * Filter the array and clear all duplicates.
+ *
+ * The original array is left unchanged. The vertices in the array are not cloned.
+ *
+ * @param {Vertex[]} vertices
+ * @param {number=EPS} epsilon
+ * @return {Vertex[]}
+ */
+export declare const clearDuplicateVertices: (vertices: Vertex[], epsilon?: number) => Vertex[];

package/src/esm/utils/algorithms/clearDuplicateVertices.js

@@ -0,0 +1,44 @@
+/**
+ * Remove duplicate vertices (2d) from an array.
+ *
+ * This method war taken and refactored from an older demo.
+ *
+ * @author   Ikaros Kappler
+ * @date     2021-07-13
+ * @modified 2023-10-28 Refactored and ported to Typescript.
+ * @version  1.0.0
+ */
+const EPS = 0.000001;
+/**
+ * Filter the array and clear all duplicates.
+ *
+ * The original array is left unchanged. The vertices in the array are not cloned.
+ *
+ * @param {Vertex[]} vertices
+ * @param {number=EPS} epsilon
+ * @return {Vertex[]}
+ */
+export const clearDuplicateVertices = (vertices, epsilon) => {
+    if (typeof epsilon === "undefined") {
+        epsilon = EPS;
+    }
+    const result = [];
+    for (var i = 0; i < vertices.length; i++) {
+        if (!containsElementFrom(vertices, vertices[i], i + 1, epsilon)) {
+            result.push(vertices[i]);
+        }
+    }
+    return result;
+};
+const isCloseTo = (vertA, vertB, eps) => {
+    return vertA.distance(vertB) < eps;
+};
+const containsElementFrom = (vertices, vertex, fromIndex, epsilon) => {
+    for (var i = fromIndex; i < vertices.length; i++) {
+        if (isCloseTo(vertices[i], vertex, epsilon)) {
+            return true;
+        }
+    }
+    return false;
+};
+//# sourceMappingURL=clearDuplicateVertices.js.map

package/src/esm/utils/algorithms/clearDuplicateVertices.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clearDuplicateVertices.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/clearDuplicateVertices.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,MAAM,GAAG,GAAW,QAAQ,CAAC;AAE7B;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,QAAkB,EAAE,OAAgB,EAAE,EAAE;IAC7E,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAClC,OAAO,GAAG,GAAG,CAAC;KACf;IACD,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACxC,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,EAAE;YAC/D,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;SAC1B;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,GAAW,EAAW,EAAE;IACvE,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;AACrC,CAAC,CAAC;AAEF,MAAM,mBAAmB,GAAG,CAAC,QAAuB,EAAE,MAAc,EAAE,SAAiB,EAAE,OAAe,EAAW,EAAE;IACnH,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAChD,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;YAC3C,OAAO,IAAI,CAAC;SACb;KACF;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/src/esm/utils/datastructures/DataGrid2d.d.ts

@@ -0,0 +1,47 @@
+/**
+ * A 2D datagrid interface for getting/storing data in some 2 dimensional array style types.
+ *
+ *  _|---- xIndex --->
+ *  |       d[0][0], d[1][0], d[2][0], ..., d[xSegmentCount-1][0]
+ *  yIndex
+ *  |       d[0][1], d[1][1], d[2][1], ..., d[xSegmentCount-1][1]
+ *  |
+ *  v       ...
+ *
+ *          d[0][ySegmentCount-1], ..., ..., d[xSegmentCount-1][ySegmentCount-1]
+ *
+ *
+ * @date    2023-11-04
+ * @author  Ikaros Kappler
+ * @version 1.0.0
+ */
+export declare type DataGridFace4<T> = [[T | null, T | null], [T | null, T | null]];
+export interface IDataGrid2d<T> {
+    readonly xSegmentCount: number;
+    readonly ySegmentCount: number;
+    getMinDataValue(): T;
+    getMaxDataValue(): T;
+    getDataValueAt(xIndex: number, yIndex: number): T | null;
+    /**
+     * Extract a 2x2 matrix (a "face4") from the underlyting data.
+     *
+     * Imagine a face4 element like this
+     *     (x,y)       (x+1,y)
+     *          A-----B
+     *          |     |
+     *          |     |
+     *          D-----C
+     *   (x,y+1)        (x+1,y+1)
+     *
+     * then result in the buffer will be
+     *   [ [A,B],
+     *     [D,C] ]
+     *
+     * If any index is invalid then the resulting buffer element will be null.
+     *
+     * @param {number} xIndex - The x index in `0 <= xIndex < xSegmentCount`.
+     * @param {number} yIndex - The y index in `0 <= yIndex < ySegmentCount`.
+     * @param {[[T,T],[T,T]]} buffer - The result buffer for four elements.
+     */
+    getDataFace4At(xIndex: number, yIndex: number, buffer: DataGridFace4<T>): void;
+}