plotboilerplate 1.28.0 → 1.29.0

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

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

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

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

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

@@ -1,184 +0,0 @@
-/**
- * Calculate the inset of any non-self-overlapping polygon.
- *
- * The polygon may be
- *  - convex or non-convex
- *  - self-intersecting
- *
- * The algorithms will
- *  - first construct a general offset polygon which may be corrupt due to ouf-of-bounds or in illegal-area problems.
- *  - then dissect the possibly self-intersecting inset polygon into separate simple polygons.
- *  - then detect for each if it's out of bounds or in some illegal area.
- *  - keeping only the valid ones.
- *
- * @required sutherlandHodgman
- * @required splitPolygonToNonIntersecting
- *
- * @author   Ikaros Kappler
- * @date     2024-11-04 Ported the script to a class.
- * @modified 2024-12-02 Ported to Typescript.
- */
-import { Line } from "../../Line";
-import { Polygon } from "../../Polygon";
-import { Vertex } from "../../Vertex";
-export interface IPolygonInsetOptions {
-    innerPolygonOffset: number;
-    maxPolygonSplitDepth?: number;
-    intersectionEpsilon?: number;
-    removeEars?: boolean;
-}
-export declare class PolygonInset {
-    /**
-     * The polygon to work with.
-     */
-    readonly polygon: Polygon;
-    /**
-     * The input polygon, but without ear edges.
-     */
-    optimizedPolygon: Polygon;
-    /**
-     * The original polygon as a sequence of line objects. This is easier to use than a list of points.
-     */
-    originalPolygonLines: Array<Line>;
-    /**
-     * The simple inset lines, directly generated by offsetting the original polygon lines by the given amount.
-     */
-    insetLines: Array<Line>;
-    /**
-     * The cropped inset lines that makes up the first direct iteration of the inset polygon.
-     * This one will probably be self-intersecting.
-     */
-    insetPolygonLines: Array<Line>;
-    /**
-     * The inset polygon lines resembling an actual polygon instance (not just a sequence of lines).
-     */
-    insetPolygon: Polygon;
-    /**
-     * Each polygon line and it's offsetted inset-line resemble a rectangular polygon.
-     * Array<Polygon> with 4 vertices each
-     **/
-    insetRectanglePolygons: Array<Polygon>;
-    /**
-     * The inset polygon split up into simple non-self-intersecting polygons.
-     * Represented as a list of vertex-lists. Each sub-list represents a single polygon.
-     */
-    splitPolygons: Array<Array<Vertex>>;
-    /**
-     * The final result: all valid split-polygons. These are making up the actual polygon inset.
-     * Note: list may be empty. Depending on the offset amount there is not a guaranteed offset polygon existing.
-     */
-    filteredSplitPolygons: Array<Array<Vertex>>;
-    /**
-     * Constructs a new PolygonInset instance with the underlying given polygon to work with.
-     *
-     * Please note that the algorithm will reverse the vertex order if the given polygon
-     * is not clockwise.
-     *
-     * @param {Polygon} polygon - The polygon to calculate the offset for.
-     */
-    constructor(polygon: Polygon);
-    /**
-     * This is the main method.
-     *
-     * Call this with the required option params to compute your desired offset polygon(s).
-     *
-     * @param {number} options.innerPolygonOffset - The offset to use. Should be a positive number. Correct result for negative numbers are not guaranteed.
-     * @param {number?} options.maxPolygonSplitDepth - (default is the number of polygon.vertices) The maximum amount of recursive stepts to simplify the complex first iteration of the offset polygon.
-     * @param {number?} options.intersectionEpsilon - (default is 1.0) The epsilon to use for detecting overlapping polygons. This indicates a tolerance value, because directly adjecent polygons may have a little arithmetic intersection area.
-     * @returns {Array<Array<Vertex>>} A list of vertex-lists, each one representing a simple polygon from the offset-polygons.
-     */
-    computeOutputPolygons(options: IPolygonInsetOptions): Array<Array<Vertex>>;
-    /**
-     * This method transforms each polygon line into a new line
-     * by moving it to the inside direction of the polygon (by the given `insetAmount`).
-     *
-     * @param {Array<Line>} polygonLines
-     * @param {number} insetAmount
-     * @return {Array<Line>} The transformed lines. The result array has the same length and order as the input array.
-     */
-    private _collectInsetLines;
-    /**
-     * For a sequence of inset polygon lines get the inset polygon by detecting
-     * useful intersections (by cropping or extending them).
-     *
-     * The returned lines resemble a new polygon.
-     *
-     * Please note that the returned polygon can be self-intersecting!
-     *
-     * @param {Array<Line>} insetLines
-     * @returns {Array<Line>} The cropped or exented inset polygon lines.
-     */
-    private _collectInsetPolygonLines;
-    /**
-     * Converts two lists (same length) of original polygon lines and inset lines (interpreted as
-     * pairs) to a list of rectangular polyons.
-     *
-     * @static
-     * @param {Array<Line>} originalPolygonLines
-     * @param {Array<Line>} insetLines
-     * @returns {Array<Polygon>} A list of rectangular polygons; each returned polyon has exactly four vertices.
-     */
-    private _collectRectangularPolygonInsets;
-    /**
-     * Converts a sequence of (hopefully adjacent) lines to a polygon by using all second line vertices `b`.
-     *
-     * @static
-     * @param insetPolygonLines
-     * @returns
-     */
-    private static convertToBasicInsetPolygon;
-    /**
-     * Optimize the inset polygon by removing critical `ear` edges.
-     * Such an is identified by: the edge itself is completely located inside its neighbours inset rectangle.
-     *
-     * In this process multiple edges from the ear might be dropped and two adjacent edges get a new
-     * common intersection point.
-     *
-     * Note: this method is not working as expected in all cases and quite experimental.
-     *
-     * @param insetPolygon
-     * @param insetRectangles
-     */
-    private static _optimizeInsetPolygon;
-    private static _locateExcessiveEarEdge;
-    private static _rectangleFullyContainsLine;
-    /**
-     * Filter split polygons: only keep those whose vertices are all contained inside the original polygon.
-     * Reason: scaling too much will result in excessive translation beyond the opposite bounds of the polygon (like more than 200% of possible insetting).
-     *
-     * @param {Array<Array<Vertex>>} splitPolygonsVertices
-     * @param {Polygon} originalPolygon
-     * @return {Array<Array<Vertex>>} The filtered polygon list.
-     */
-    private static _filterInnerSplitPolygonsByOriginalBounds;
-    /**
-     * Filter split polygons: only keep those that do not (signifiantly) interset with any rectangles.
-     *
-     * @static
-     * @param {Array<Array<Vertex>>} splitPolygonsVertices
-     * @param {Array<Polygon>} insetRectanglePolygons
-     * @param {number?=1.0} intersectionEpsilon - (optional, default is 1.0) A epsislon to define a tolerance for checking if two polygons intersect.
-     */
-    private static _filterInnerSplitPolygonsByCoverage;
-    /**
-     * This private method will reverse each polygon's vertex order that's not clockwise.
-     *
-     * @param {Array<Vertex[]>} polygons
-     */
-    private static _assertAllPolygonsAreClockwise;
-    /**
-     * This private method will revert the vertex order if the polygon is not clockwise.
-     *
-     * @param {Vertex[]} polygonVerts
-     */
-    private static _assertPolygonIsClockwise;
-    /**
-     * For simplification I'm using a callback generator function here.
-     *
-     * @param splitPolyVerts
-     * @param eps
-     * @param _splitPolyIndex
-     * @returns {Function} The callback for an `Array.some` parameter.
-     */
-    private static _hasIntersectionCallback;
-}