plotboilerplate 1.27.0 → 1.28.0

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

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

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

@@ -0,0 +1,107 @@
+"use strict";
+/**
+ * @date     2020-04-15
+ * @author   Converted to a class by Ikaros Kappler
+ * @modified 2020-08-19 Ported this class from vanilla JS to TypeScript.
+ * @version  1.0.1
+ *
+ * @file CatmullRomPath
+ * @public
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CatmullRomPath = void 0;
+const CubicBezierCurve_1 = require("../../CubicBezierCurve");
+const Vertex_1 = require("../../Vertex");
+/**
+ * @classdesc Compute the Catmull-Rom spline path from a sequence of points (vertices).
+ *
+ * For comparison to the HobbyCurve I wanted to add a Catmull-Rom path (to show that the
+ * HobbyCurve is smoother).
+ *
+ * This demo implementation was inspired by this Codepen by Blake Bowen
+ * https://codepen.io/osublake/pen/BowJed
+ *
+ * @requires CubicBezierCurve
+ * @requires Vertex
+ */
+class CatmullRomPath {
+    /**
+     * @constructor
+     * @name CatmullRomPath
+     * @param {Array<Vertex>=} vertices? - An optional array of vertices to initialize the path with.
+     **/
+    constructor(vertices) {
+        this.vertices = vertices ? vertices : [];
+    }
+    ;
+    /**
+     * Add a new point to the end of the vertex sequence.
+     *
+     * @name addPoint
+     * @memberof CatmullRomPath
+     * @instance
+     * @param {Vertex} p - The vertex (point) to add.
+     **/
+    addPoint(p) {
+        this.vertices.push(p);
+    }
+    ;
+    /**
+     * Generate a sequence of cubic Bézier curves from the point set.
+     *
+     * @name generateCurve
+     * @memberof CatmullRomPath
+     * @instance
+     * @param {boolean=} circular - Specify if the path should be closed.
+     * @param {number=1} tension - (default=0) An optional tension parameter.
+     * @return Array<CubicBezierCurve>
+     **/
+    generateCurve(circular, tension) {
+        if (typeof tension === 'undefined')
+            tension = 1.0;
+        if (circular)
+            return this.solveClosed(tension);
+        else
+            return this.solveOpen(tension);
+    }
+    ;
+    solveOpen(k) {
+        var curves = [];
+        if (k == null || typeof k === 'undefined')
+            k = 1;
+        var size = this.vertices.length;
+        var last = size - 2;
+        for (var i = 0; i < size - 1; i++) {
+            var p0 = i ? this.vertices[i - 1] : this.vertices[0];
+            var p1 = this.vertices[i + 0];
+            var p2 = this.vertices[i + 1];
+            var p3 = i !== last ? this.vertices[i + 2] : p2;
+            var cp1 = new Vertex_1.Vertex(p1.x + (p2.x - p0.x) / 6 * k, p1.y + (p2.y - p0.y) / 6 * k);
+            var cp2 = new Vertex_1.Vertex(p2.x - (p3.x - p1.x) / 6 * k, p2.y - (p3.y - p1.y) / 6 * k);
+            curves.push(new CubicBezierCurve_1.CubicBezierCurve(p1, p2, cp1, cp2));
+        }
+        return curves;
+    }
+    ; // END solveOpen
+    solveClosed(k) {
+        var curves = [];
+        if (k == null || typeof k === 'undefined')
+            k = 1;
+        var size = this.vertices.length;
+        var last = size - 1;
+        for (var i = 0; i < size; i++) {
+            var p0 = i ? this.vertices[i - 1] : this.vertices[last];
+            var p1 = this.vertices[i + 0];
+            var p2 = this.vertices[(i + 1) % size];
+            var p3 = this.vertices[(i + 2) % size];
+            var cp1 = new Vertex_1.Vertex(p1.x + (p2.x - p0.x) / 6 * k, p1.y + (p2.y - p0.y) / 6 * k);
+            var cp2 = new Vertex_1.Vertex(p2.x - (p3.x - p1.x) / 6 * k, p2.y - (p3.y - p1.y) / 6 * k);
+            curves.push(new CubicBezierCurve_1.CubicBezierCurve(p1, p2, cp1, cp2));
+        }
+        return curves;
+    }
+    ; // END solveClosed
+}
+exports.CatmullRomPath = CatmullRomPath;
+; // END class
+//# sourceMappingURL=CatmullRomPath.js.map

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

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

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

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

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

@@ -0,0 +1,307 @@
+"use strict";
+/**
+ * @author   Ikaros Kappler
+ * @date     2020-10-05
+ * @modified 2021-02-08 Fixed a lot of es2015 compatibility issues.
+ * @modified 2024-02-23 Fixed some null-type conflicts.
+ * @version  1.0.2
+ * @file CircleIntersections
+ * @public
+ **/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CircleIntersections = void 0;
+const arrayFill_1 = require("./arrayFill");
+const matrixFill_1 = require("./matrixFill");
+const CircleSector_1 = require("../../CircleSector");
+const Line_1 = require("../../Line");
+const CircularIntervalSet_1 = require("../datastructures/CircularIntervalSet");
+/**
+ * @classdesc A script for finding the intersection points of two or
+ * multiple circles (the 'radical lines').
+ *
+ * Based on the C++ implementation by Robert King
+ *    https://stackoverflow.com/questions/3349125/circle-circle-intersection-points
+ * and the 'Circles and spheres' article by Paul Bourke.
+ *    http://paulbourke.net/geometry/circlesphere/
+ *
+ * @requires arrayFill
+ * @requires matrixFill
+ * @requires Circle
+ * @requires IndexPair
+ * @requires Matrix
+ * @requires Interval
+ * @requires Line
+ * @requires CirularIntervalSet
+ */
+class CircleIntersections {
+    /**
+     * Find all connected outer path partitions.
+     *
+     * @method findOuterPartitions
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @param {Array<CircularIntervalSet>} intervalSets - The determined interval sets (see `findOuterCircleIntervals`).
+     * @return {Array<Array<IndexPair>>} An array of paths, each defined by a sequence of IndexPairs adressing circle i and interval j.
+     **/
+    static findOuterPartitions(circles, intervalSets) {
+        // For tracking which interval we already used for detecting the partition
+        // we need a matrix; find the maximal interval length.
+        let maxSetLength = 0;
+        for (var i = 0; i < intervalSets.length; i++) {
+            maxSetLength = Math.max(maxSetLength, intervalSets[i].intervals.length);
+        }
+        const usedIntervals = (0, matrixFill_1.matrixFill)(intervalSets.length, maxSetLength, false);
+        var path = null;
+        var pathList = [];
+        while ((path = CircleIntersections.findOuterPartition(circles, intervalSets, usedIntervals)) != null) {
+            pathList.push(path);
+        }
+        return pathList;
+    }
+    /**
+     * Find all connected outer path partitions (as CircleSectors).
+     *
+     * @method findOuterPartitionsAsSectors
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @param {Array<CircularIntervalSet>} intervalSets - The determined interval sets (see `findOuterCircleIntervals`).
+     * @return {Array<Array<CircleSector>>} An array of paths, each defined by a sequence of SircleSectors.
+     **/
+    static findOuterPartitionsAsSectors(circles, intervalSets) {
+        const partitions = CircleIntersections.findOuterPartitions(circles, intervalSets);
+        const partitionsAsArcs = [];
+        for (var p = 0; p < partitions.length; p++) {
+            const path = partitions[p];
+            const pathAsArcs = [];
+            for (var i = 0; i < path.length; i++) {
+                const circleIndex = path[i].i;
+                const circle = circles[circleIndex];
+                var interval = intervalSets[path[i].i].intervals[path[i].j];
+                // Params: circle, startAngle, endAngle
+                pathAsArcs.push(new CircleSector_1.CircleSector(circle, interval[0], interval[1]));
+            } // END for
+            partitionsAsArcs.push(pathAsArcs);
+        } // END for
+        return partitionsAsArcs;
+    }
+    /**
+     * Build the n*n intersection matrix: contains the radical line at (i,j) if circle i and circle j do intersect;
+     * conatins null at (i,j) otherwise.
+     *
+     * Note that this matrix is symmetrical: if circles (i,j) intersect with line (A,B), then also circles (j,i) intersect
+     * with line (B,A).
+     *
+     * The returned two-dimensional matrix (array) has exactly as many entries as the passed circle array.
+     *
+     * @method buildRadicalLineMatrix
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @return {Array<Array<Line>>} A 2d-matrix containing the radical lines where circles intersect.
+     **/
+    static buildRadicalLineMatrix(circles) {
+        var radicalLines = [];
+        for (var i = 0; i < circles.length; i++) {
+            if (!radicalLines[i]) {
+                radicalLines[i] = (0, arrayFill_1.arrayFill)(circles.length, null);
+            }
+            for (var j = 0; j < circles.length; j++) {
+                if (i == j)
+                    continue;
+                if (radicalLines[i][j])
+                    continue;
+                radicalLines[i][j] = circles[i].circleIntersection(circles[j]);
+                // Build symmetrical matrix
+                var tmpRadLine = radicalLines[i][j];
+                if (tmpRadLine) {
+                    if (!radicalLines[j]) {
+                        radicalLines[j] = (0, arrayFill_1.arrayFill)(circles.length, null);
+                    }
+                    // Use reverse line
+                    radicalLines[j][i] = new Line_1.Line(tmpRadLine.b, tmpRadLine.a);
+                }
+            }
+        }
+        return radicalLines;
+    }
+    /**
+     * Find all circles (indices) which are completely located inside another circle.
+     *
+     * The returned array conatins the array indices.
+     *
+     * @method findInnerCircles
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @return {Array<number>}
+     **/
+    static findInnerCircles(circles) {
+        const innerCircleIndices = [];
+        for (var i = 0; i < circles.length; i++) {
+            for (var j = 0; j < circles.length; j++) {
+                if (i == j)
+                    continue;
+                if (circles[j].containsCircle(circles[i])) {
+                    innerCircleIndices.push(i);
+                }
+            }
+        }
+        return innerCircleIndices;
+    }
+    /**
+     * Calculate all outer circle intervals (sections that belong to the outermost line), dermined by the given
+     * circles and their radical lines.
+     *
+     * The returned array contains IntervalSets - one for each circle - indicating the remaining circle sections.
+     *
+     * @method findOuterCircleIntervals
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @param {Array<Line>} intersectionMatrix
+     * @return {Array<number>}
+     **/
+    static findOuterCircleIntervals(circles, intersectionMatrix) {
+        const intervalSets = [];
+        for (var i = 0; i < circles.length; i++) {
+            intervalSets[i] = new CircularIntervalSet_1.CircularIntervalSet(0, 2 * Math.PI);
+            for (var j = 0; j < circles.length; j++) {
+                if (i == j)
+                    continue;
+                if (intersectionMatrix[i][j] !== null) {
+                    // const interval : Interval = CircleIntersections.radicalLineToInterval( circle, radicalLine );
+                    CircleIntersections.handleCircleInterval(circles[i], intersectionMatrix[i][j], intervalSets[i]);
+                }
+                else if (circles[j].containsCircle(circles[i])) {
+                    intervalSets[i].clear();
+                }
+            }
+        }
+        return intervalSets;
+    }
+    /**
+     * Calculate the next connected partition from the given set of circles and outer path intervals. The function
+     * will pick a random unused circle interval and detect all adjacent intervals until a closed partition
+     * was found.
+     *
+     * If an interval (circle section) was already visited will be stored in the `usedIntervalSetRecords` matrix (thus
+     * is must be large enough to map all sections).
+     *
+     * The returned array contains IndexPairs (i,j) - one for each circle i - indicating the used circle section j.
+     *
+     * @method findOuterPartition
+     * @static
+     * @memberof CircleIntersections
+     * @param {Array<Circle>} circles - The circles to find intersections for.
+     * @param {Array<CircularIntervalSet>} intervalSets - The circle intervals that form the intersection outline.
+     * @param {Matrix<boolean>} usedIntervals - A matrix for remembering which circle intervals were always used.
+     * @return {Array<Indexpair>|null} The next partition or `null` if no more can be found.
+     **/
+    static findOuterPartition(circles, intervalSets, usedIntervals) {
+        let intLocation = CircleIntersections.randomUnusedInterval(intervalSets, usedIntervals);
+        const path = [];
+        while (intLocation != null) {
+            path.push(intLocation);
+            usedIntervals[intLocation.i][intLocation.j] = true;
+            intLocation = CircleIntersections.findAdjacentInterval(circles, intLocation, intervalSets, usedIntervals, 0.001);
+        }
+        return path.length == 0 ? null : path;
+    }
+    /**
+     * Convert a radical line (belonging to a circle) into an interval: start angle and end angle.
+     *
+     * @method radicalLineToInterval
+     * @static
+     * @private
+     * @memberof CircleIntersections
+     * @param {Circle} circle - The circle itself.
+     * @param {Line} radicaLine - The radical line to convert (must have two intersection points on the circle).
+     * @return {Interval} The interval `[startAngle,endAngle]` determined by the radical line.
+     **/
+    static radicalLineToInterval(circle, radicalLine) {
+        // Get angle sections in the circles
+        const lineA = new Line_1.Line(circle.center, radicalLine.a);
+        const lineB = new Line_1.Line(circle.center, radicalLine.b);
+        let angleA = lineA.angle();
+        let angleB = lineB.angle();
+        // Map angles to [0 ... 2*PI]
+        // (the angle() function might return negative angles in [-PI .. 0 .. PI])
+        if (angleA < 0)
+            angleA = Math.PI * 2 + angleA;
+        if (angleB < 0)
+            angleB = Math.PI * 2 + angleB;
+        return [angleA, angleB];
+    }
+    /**
+     * This is a helper fuction used by `findOuterCircleIntervals`.
+     *
+     * It applies the passed radical line by intersecting the remaining circle sections with the new section.
+     *
+     * @method handleCircleInterval
+     * @static
+     * @private
+     * @memberof CircleIntersections
+     * @param {Circle} circle - The circles to find intersections for.
+     * @param {Line} radicalLine - The radical line to apply.
+     * @param {CircularIntervalSet} intervalSet - The CircularIntervalSet to use (must have left and right border: 0 and 2*PI).
+     * @return {void}
+     **/
+    static handleCircleInterval(circle, radicalLine, intervalSet) {
+        const interval = CircleIntersections.radicalLineToInterval(circle, radicalLine);
+        intervalSet.intersect(interval[1], interval[0]);
+    }
+    /**
+     * Pick a random unused circle interval. This function is used by the `findOuterPartition` function, which
+     * starts the detection with any random section.
+     *
+     * @method randomUnusedInterval
+     * @static
+     * @private
+     * @memberof CircleIntersections
+     * @param {Array<CircularIntervalSet>} intervalSets - An array of all available interval sets/intervals.
+     * @param {Matrix<boolean>} usedIntervals - A matrix indicating which intervals have already been used/visited by the algorithm
+     * @return {IndexPair|null}
+     **/
+    static randomUnusedInterval(intervalSets, usedIntervals) {
+        for (var i = 0; i < intervalSets.length; i++) {
+            for (var j = 0; j < intervalSets[i].intervals.length; j++) {
+                if (!usedIntervals[i][j]) {
+                    return { i: i, j: j };
+                }
+            }
+        }
+        return null;
+    }
+    /**
+     * Find the next adjacent circle interval for the given interval.
+     * starts the detection with any random section.
+     *
+     * @method randomUnusedInterval
+     * @static
+     * @private
+     * @memberof CircleIntersections
+     * @param {Array<CircularIntervalSet>} intervalSets - An array of all available interval sets/intervals.
+     * @param {Matrix<boolean>} usedIntervals - A matrix indicating which intervals have already been used/visited by the algorithm
+     * @return {IndexPair|null}
+     **/
+    static findAdjacentInterval(circles, intLocation, intervalSets, usedIntervalSetRecords, epsilon) {
+        var curInterval = intervalSets[intLocation.i].intervals[intLocation.j];
+        var curEndPoint = circles[intLocation.i].vertAt(curInterval[1]);
+        for (var i = 0; i < intervalSets.length; i++) {
+            for (var j = 0; j < intervalSets[i].intervals.length; j++) {
+                if (usedIntervalSetRecords[i][j]) {
+                    continue;
+                }
+                var interval = intervalSets[i].intervals[j];
+                var startPoint = circles[i].vertAt(interval[0]);
+                if (curEndPoint.distance(startPoint) < epsilon)
+                    return { i: i, j: j };
+            }
+        }
+        return null;
+    }
+}
+exports.CircleIntersections = CircleIntersections;
+//# sourceMappingURL=CircleIntersections.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CircleIntersections.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/CircleIntersections.ts"],"names":[],"mappings":";AAAA;;;;;;;;IAQI;;;AAEJ,2CAAwC;AACxC,6CAA0C;AAE1C,qDAAkD;AAClD,qCAAkC;AAClC,+EAA4E;AAG5E;;;;;;;;;;;;;;;;;GAiBG;AACH;IACE;;;;;;;;;QASI;IACJ,MAAM,CAAC,mBAAmB,CAAC,OAAsB,EAAE,YAAwC;QACzF,0EAA0E;QAC1E,sDAAsD;QACtD,IAAI,YAAY,GAAW,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC1E,CAAC;QACD,MAAM,aAAa,GAAoB,IAAA,uBAAU,EAAU,YAAY,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;QAErG,IAAI,IAAI,GAA4B,IAAI,CAAC;QACzC,IAAI,QAAQ,GAA4B,EAAE,CAAC;QAC3C,OAAO,CAAC,IAAI,GAAG,mBAAmB,CAAC,kBAAkB,CAAC,OAAO,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;YACrG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;;;QASI;IACJ,MAAM,CAAC,4BAA4B,CACjC,OAAsB,EACtB,YAAwC;QAExC,MAAM,UAAU,GAA4B,mBAAmB,CAAC,mBAAmB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAE3G,MAAM,gBAAgB,GAA+B,EAAE,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAqB,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,UAAU,GAAwB,EAAE,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,WAAW,GAAW,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,MAAM,GAAW,OAAO,CAAC,WAAW,CAAC,CAAC;gBAC5C,IAAI,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5D,uCAAuC;gBACvC,UAAU,CAAC,IAAI,CAAC,IAAI,2BAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,CAAC,CAAC,UAAU;YACZ,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpC,CAAC,CAAC,UAAU;QACZ,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAED;;;;;;;;;;;;;;QAcI;IACJ,MAAM,CAAC,sBAAsB,CAAC,OAAsB;QAClD,IAAI,YAAY,GAA8B,EAAE,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrB,YAAY,CAAC,CAAC,CAAC,GAAG,IAAA,qBAAS,EAAc,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACjE,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACrB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAE,SAAS;gBACjC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/D,2BAA2B;gBAC3B,IAAI,UAAU,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,IAAI,UAAU,EAAE,CAAC;oBACf,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;wBACrB,YAAY,CAAC,CAAC,CAAC,GAAG,IAAA,qBAAS,EAAc,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBACjE,CAAC;oBACD,mBAAmB;oBACnB,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,WAAI,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC5D,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;;;;;QAUI;IACJ,MAAM,CAAC,gBAAgB,CAAC,OAAsB;QAC5C,MAAM,kBAAkB,GAAkB,EAAE,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACrB,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1C,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED;;;;;;;;;;;;QAYI;IACJ,MAAM,CAAC,wBAAwB,CAAC,OAAsB,EAAE,kBAAgC;QACtF,MAAM,YAAY,GAA+B,EAAE,CAAC;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,yCAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACrB,IAAI,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;oBACtC,gGAAgG;oBAChG,mBAAmB,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClG,CAAC;qBAAM,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjD,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;;;;;;;;;;;;QAiBI;IACJ,MAAM,CAAC,kBAAkB,CACvB,OAAsB,EACtB,YAAwC,EACxC,aAA8B;QAE9B,IAAI,WAAW,GAAqB,mBAAmB,CAAC,oBAAoB,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;QAC1G,MAAM,IAAI,GAAqB,EAAE,CAAC;QAClC,OAAO,WAAW,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACvB,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACnD,WAAW,GAAG,mBAAmB,CAAC,oBAAoB,CAAC,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;QACnH,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACxC,CAAC;IAED;;;;;;;;;;QAUI;IACI,MAAM,CAAC,qBAAqB,CAAC,MAAc,EAAE,WAAiB;QACpE,oCAAoC;QACpC,MAAM,KAAK,GAAS,IAAI,WAAI,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAS,IAAI,WAAI,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;QAE3D,IAAI,MAAM,GAAW,KAAK,CAAC,KAAK,EAAE,CAAC;QACnC,IAAI,MAAM,GAAW,KAAK,CAAC,KAAK,EAAE,CAAC;QAEnC,6BAA6B;QAC7B,0EAA0E;QAC1E,IAAI,MAAM,GAAG,CAAC;YAAE,MAAM,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;QAC9C,IAAI,MAAM,GAAG,CAAC;YAAE,MAAM,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;QAE9C,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;;;;;;;;;QAaI;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAc,EAAE,WAAiB,EAAE,WAAgC;QACrG,MAAM,QAAQ,GAAa,mBAAmB,CAAC,qBAAqB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1F,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;;;;;;QAWI;IACI,MAAM,CAAC,oBAAoB,CACjC,YAAwC,EACxC,aAA8B;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1D,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACzB,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;;QAWI;IACI,MAAM,CAAC,oBAAoB,CACjC,OAAsB,EACtB,WAAsB,EACtB,YAAwC,EACxC,sBAAuC,EACvC,OAAe;QAEf,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACvE,IAAI,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1D,IAAI,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjC,SAAS;gBACX,CAAC;gBACD,IAAI,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC5C,IAAI,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChD,IAAI,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,OAAO;oBAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YACxE,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}