plotboilerplate 1.27.0 → 1.28.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"clearPolygonDuplicateVertices.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/clearPolygonDuplicateVertices.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAE,QAAsB,EAAE,OAAe,EAAmB,EAAE;IACvG,MAAM,CAAC,GAAY,QAAQ,CAAC,MAAM,CAAC;IACnC,IAAI,CAAC,KAAK,CAAC;QACd,OAAO,EAAE,CAAC;IAEP,6EAA6E;IAC7E,IAAI,OAAO,OAAO,KAAK,WAAW;QACrC,OAAO,GAAG,CAAC,CAAC;IAET,oDAAoD;IACpD,MAAM,UAAU,GAAG,CAAE,CAAQ,EAAE,CAAQ,EAAa,EAAE;QACzD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,CAAC,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;eAC7D,CAAC,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,OAAO,CAAE,CAAC;IACzD,CAAC,CAAC;IAEF,6EAA6E;IAC7E,MAAM,YAAY,GAAG,CAAE,KAAY,EAAY,EAAE;QACpD,IAAI,CAAC,GAAY,KAAK,CAAC;QACvB,OAAO,UAAU,CAAC,KAAK,EAAC,CAAC,GAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,GAAC,CAAC,EAAG,CAAC;YAC3C,CAAC,EAAE,CAAC;QACR,CAAC;QACD,OAAO,CAAC,CAAC;IACN,CAAC,CAAC;IAEF,IAAI,KAAK,GAAY,YAAY,CAAC,CAAC,CAAC,CAAC;IACrC,sCAAsC;IACtC,IAAI,CAAC,GAAY,CAAC,CAAC;IACnB,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAG,CAAC;QACpC,IAAI,CAAC,UAAU,CAAC,KAAK,GAAC,CAAC,EAAC,KAAK,GAAC,CAAC,CAAC,EAAG,CAAC;YAChC,MAAM,CAAC,IAAI,CAAE,QAAQ,CAAC,CAAC,KAAK,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAE,CAAC;YACrC,CAAC,GAAG,CAAC,CAAC;QACV,CAAC;IACE,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC"}

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

@@ -0,0 +1,23 @@
+/**
+ * @author   Rosettcode, rewritten and ported to TypeScript by Ikaros Kappler
+ * @date     2020-05-04
+ * @modified 2020-08-17 Ported this function from vanilla JS to TypeScript.
+ * @version  1.0.1
+ *
+ * @file convexHull
+ * @public
+ **/
+import { XYCoords } from "../../interfaces";
+/**
+ * @description The Convex Hull algorithm, found at RosettaCode:
+ *
+ * https://rosettacode.org/wiki/Convex_hull#JavaScript
+ *
+ * @requires XYCoords
+ *
+ * @global
+ * @name convexHull
+ * @param {Array<XYCoords>} points - The points on the 2D plane to find the convex hull for.
+ * @return {Array<XYCoords>} A ordered array of points defining the convex hull.
+ **/
+export declare const getConvexHull: (points: Array<XYCoords>) => Array<XYCoords>;

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

@@ -0,0 +1,67 @@
+/**
+ * @author   Rosettcode, rewritten and ported to TypeScript by Ikaros Kappler
+ * @date     2020-05-04
+ * @modified 2020-08-17 Ported this function from vanilla JS to TypeScript.
+ * @version  1.0.1
+ *
+ * @file convexHull
+ * @public
+ **/
+/**
+ * @description The Convex Hull algorithm, found at RosettaCode:
+ *
+ * https://rosettacode.org/wiki/Convex_hull#JavaScript
+ *
+ * @requires XYCoords
+ *
+ * @global
+ * @name convexHull
+ * @param {Array<XYCoords>} points - The points on the 2D plane to find the convex hull for.
+ * @return {Array<XYCoords>} A ordered array of points defining the convex hull.
+ **/
+export const getConvexHull = (points) => {
+    points.sort(comparison);
+    const L = [];
+    for (var i = 0; i < points.length; i++) {
+        while (L.length >= 2 && cross(L[L.length - 2], L[L.length - 1], points[i]) <= 0) {
+            L.pop();
+        }
+        L.push(points[i]);
+    }
+    const U = [];
+    for (var i = points.length - 1; i >= 0; i--) {
+        while (U.length >= 2 && cross(U[U.length - 2], U[U.length - 1], points[i]) <= 0) {
+            U.pop();
+        }
+        U.push(points[i]);
+    }
+    L.pop();
+    U.pop();
+    return L.concat(U);
+};
+/**
+ * Compare two vertices to create an order on the 2D plane.
+ *
+ * @name comparison
+ * @private
+ * @param {XYCoords} a - The first of the two points to compare.
+ * @param {XYCoords} b - The second of the two points to compare.
+ * @return {number} A number indicating the order (negative if `a` is 'smaller', 0 if both are equal, positive if `a` is 'larger').
+ **/
+const comparison = (a, b) => {
+    return a.x == b.x ? a.y - b.y : a.x - b.x;
+};
+/**
+ * Calculate the cross product of the three coordinates, interpreted as vectors.
+ *
+ * @name cross
+ * @private
+ * @param {XYCoords} a
+ * @param {XYCoords} b
+ * @param {XYCoords} o
+ * @return {number} The cross product of the three 'vectors'.
+ **/
+const cross = (a, b, o) => {
+    return (a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x);
+};
+//# sourceMappingURL=convexHull.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"convexHull.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/convexHull.ts"],"names":[],"mappings":"AAAA;;;;;;;;IAQI;AAIJ;;;;;;;;;;;IAWI;AACJ,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,MAAsB,EAAoB,EAAE;IACtE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACxB,MAAM,CAAC,GAAqB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACrF,CAAC,CAAC,GAAG,EAAE,CAAC;QACL,CAAC;QACD,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,CAAC,GAAqB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACrF,CAAC,CAAC,GAAG,EAAE,CAAC;QACL,CAAC;QACD,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,CAAC,CAAC,GAAG,EAAE,CAAC;IACR,CAAC,CAAC,GAAG,EAAE,CAAC;IACR,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC,CAAC;AAGF;;;;;;;;IAQI;AACJ,MAAM,UAAU,GAAG,CAAC,CAAU,EAAE,CAAU,EAAW,EAAE;IACnD,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC,CAAC;AAGF;;;;;;;;;IASI;AACJ,MAAM,KAAK,GAAG,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU,EAAW,EAAE;IAC1D,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC,CAAC"}

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

@@ -0,0 +1,41 @@
+/**
+ * @author   mbostock, extended and ported to TypeScript by Ikaros Kappler
+ * @date     2020-05-19
+ * @modified 2021-02-08 Fixed a lot of es2015 compatibility issues.
+ * @modified 2024-03-24 Fixing some unstrict types to match with the new Typescript settings.
+ * @version  1.0.3
+ * @file     contextPolygonIncircle
+ * @public
+ */
+import { Circle } from "../../Circle";
+import { Polygon } from "../../Polygon";
+import { Triangle } from "../../Triangle";
+export interface PolygonIncircle {
+    circle: Circle;
+    triangle: Triangle;
+}
+/**
+ * Compute the max sized inlying circle in the given convex (!) polygon - also called the
+ * convex-polygon incircle.
+ *
+ * The function will return an object with either: the circle, and the triangle that defines
+ * the three tangent points where the circle touches the polygon.
+ *
+ * Inspired by
+ *  https://observablehq.com/@mbostock/convex-polygon-incircle
+ *  https://observablehq.com/@mbostock/circle-tangent-to-three-lines
+ *
+ *
+ * @requires Circle
+ * @requires Line
+ * @requires Vertex
+ * @requires Triangle
+ * @requires nsectAngle
+ * @requires geomutils
+ *
+ * @global
+ * @name convexPolygonIncircle
+ * @param {Polygon} convexHull - The actual convex polygon.
+ * @return {PolygonIncircle} A pair of a circle (the incircle) and a triangle (the three points where the circle is touching the polygon).
+ */
+export declare const convexPolygonIncircle: (convexHull: Polygon) => PolygonIncircle;

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

@@ -0,0 +1,141 @@
+/**
+ * @author   mbostock, extended and ported to TypeScript by Ikaros Kappler
+ * @date     2020-05-19
+ * @modified 2021-02-08 Fixed a lot of es2015 compatibility issues.
+ * @modified 2024-03-24 Fixing some unstrict types to match with the new Typescript settings.
+ * @version  1.0.3
+ * @file     contextPolygonIncircle
+ * @public
+ */
+import { Circle } from "../../Circle";
+import { geomutils } from "../../geomutils";
+import { Line } from "../../Line";
+import { Triangle } from "../../Triangle";
+/**
+ * For circle-polygon-intersection-count detection we need an epsilon to
+ * eliminate smaller precision errors.
+ */
+const EPS = 0.000001;
+/**
+ * Compute the max sized inlying circle in the given convex (!) polygon - also called the
+ * convex-polygon incircle.
+ *
+ * The function will return an object with either: the circle, and the triangle that defines
+ * the three tangent points where the circle touches the polygon.
+ *
+ * Inspired by
+ *  https://observablehq.com/@mbostock/convex-polygon-incircle
+ *  https://observablehq.com/@mbostock/circle-tangent-to-three-lines
+ *
+ *
+ * @requires Circle
+ * @requires Line
+ * @requires Vertex
+ * @requires Triangle
+ * @requires nsectAngle
+ * @requires geomutils
+ *
+ * @global
+ * @name convexPolygonIncircle
+ * @param {Polygon} convexHull - The actual convex polygon.
+ * @return {PolygonIncircle} A pair of a circle (the incircle) and a triangle (the three points where the circle is touching the polygon).
+ */
+export const convexPolygonIncircle = (convexHull) => {
+    var n = convexHull.vertices.length;
+    var bestCircle = null;
+    var bestTriangle = null;
+    for (var a = 0; a < n; a++) {
+        for (var b = a + 1; b < n; b++) {
+            for (var c = b + 1; c < n; c++) {
+                // As these lines are part of the convex hull, we know that
+                //  * line a preceeds line b and
+                //  * line b preceeds line c :)
+                let lineA = new Line(convexHull.vertices[a], convexHull.vertices[(a + 1) % n]);
+                let lineB = new Line(convexHull.vertices[b], convexHull.vertices[(b + 1) % n]);
+                let lineC = new Line(convexHull.vertices[c], convexHull.vertices[(c + 1) % n]);
+                // Find intersections by expanding the lines
+                let vertB = lineA.intersection(lineB);
+                let vertC = lineB.intersection(lineC);
+                if (!vertB || !vertC) {
+                    continue;
+                }
+                // An object: { center: Vertex, radius: number }
+                let triangle = getTangentTriangle4(lineA.a, vertB, vertC, lineC.b);
+                if (!triangle) {
+                    continue;
+                }
+                // Workaround. There will be a future version where the 'getCircumCircle()' functions
+                // returns a real Circle instance.
+                let _circle = triangle.getCircumcircle();
+                let circle = new Circle(_circle.center, _circle.radius);
+                // Count the number of intersections with the convex hull:
+                // If there are exactly three, we have found an in-lying circle.
+                //  * Check if this one is better (bigger) than the old one.
+                //  * Also check if the circle is located inside the polygon;
+                //    The construction can, in some cases, produce an out-lying circle.
+                if (!convexHull.containsVert(circle.center)) {
+                    continue;
+                }
+                var circleIntersections = findCircleIntersections(convexHull, circle);
+                if (circleIntersections.length == 3 && (bestCircle == undefined || bestCircle.radius < circle.radius)) {
+                    bestCircle = circle;
+                    bestTriangle = triangle;
+                }
+            }
+        }
+    }
+    return { circle: bestCircle, triangle: bestTriangle };
+};
+/**
+ * This function computes the three points for the inner maximum circle
+ * lying tangential to the three subsequential lines (given by four points).
+ *
+ * Compute the circle from that triangle by using Triangle.getCircumcircle().
+ *
+ * Not all three lines should be parallel, otherwise the circle might have infinite radius.
+ *
+ * LineA := [vertA, vertB]
+ * LineB := [vertB, vertC]
+ * LineC := [vertC, vertD]
+ *
+ * @param {Vertex} vertA - The first point of the three connected lines.
+ * @param {Vertex} vertB - The second point of the three connected lines.
+ * @param {Vertex} vertC - The third point of the three connected lines.
+ * @param {Vertex} vertD - The fourth point of the three connected lines.
+ * @return {Triangle} The triangle of the circular tangential points with the given lines (3 or 4 of them).
+ */
+const getTangentTriangle4 = (vertA, vertB, vertC, vertD) => {
+    const lineA = new Line(vertA, vertB);
+    const lineB = new Line(vertB, vertC);
+    const lineC = new Line(vertC, vertD);
+    const bisector1 = geomutils.nsectAngle(vertB, vertA, vertC, 2)[0]; // bisector of first triangle
+    const bisector2 = geomutils.nsectAngle(vertC, vertB, vertD, 2)[0]; // bisector of second triangle
+    const intersection = bisector1.intersection(bisector2);
+    if (!intersection) {
+        return null;
+    }
+    // Find the closest points on one of the polygon lines (all have same distance by construction)
+    const circleIntersA = lineA.getClosestPoint(intersection);
+    const circleIntersB = lineB.getClosestPoint(intersection);
+    const circleIntersC = lineC.getClosestPoint(intersection);
+    return new Triangle(circleIntersA, circleIntersB, circleIntersC);
+};
+/**
+ * Find all intersecting lines (indices) on the polyon that intersect the circle.
+ *
+ * @param {Polygon} convexHull - The polygon to detect the intersections on (here this is the convex hull given).
+ * @param {Circle} circle - The circle to detect the intersections with.
+ * @return {Array<number>} The indices of those lines that intersect (or touch) the circle.
+ **/
+const findCircleIntersections = (convexHull, circle) => {
+    const result = [];
+    for (var i = 0; i < convexHull.vertices.length; i++) {
+        var line = new Line(convexHull.vertices[i], convexHull.vertices[(i + 1) % convexHull.vertices.length]);
+        // Use an epsilon here because circle coordinates can be kind of unprecise in the detail.
+        if (circle.lineDistance(line) < EPS) {
+            result.push(i);
+        }
+    }
+    return result;
+};
+//# sourceMappingURL=convexPolygonIncircle.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"convexPolygonIncircle.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/convexPolygonIncircle.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG1C;;;GAGG;AACH,MAAM,GAAG,GAAW,QAAQ,CAAC;AAO7B;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,UAAmB,EAAmB,EAAE;IAC5E,IAAI,CAAC,GAAW,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC3C,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,YAAY,GAAoB,IAAI,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,2DAA2D;gBAC3D,gCAAgC;gBAChC,+BAA+B;gBAC/B,IAAI,KAAK,GAAS,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrF,IAAI,KAAK,GAAS,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrF,IAAI,KAAK,GAAS,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAErF,4CAA4C;gBAC5C,IAAI,KAAK,GAAkB,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBACrD,IAAI,KAAK,GAAkB,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBAErD,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;oBACrB,SAAS;gBACX,CAAC;gBAED,gDAAgD;gBAChD,IAAI,QAAQ,GAAoB,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpF,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACd,SAAS;gBACX,CAAC;gBAED,qFAAqF;gBACrF,kCAAkC;gBAClC,IAAI,OAAO,GAAW,QAAQ,CAAC,eAAe,EAAE,CAAC;gBACjD,IAAI,MAAM,GAAW,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBAEhE,0DAA0D;gBAC1D,gEAAgE;gBAChE,4DAA4D;gBAC5D,6DAA6D;gBAC7D,uEAAuE;gBACvE,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC5C,SAAS;gBACX,CAAC;gBACD,IAAI,mBAAmB,GAAkB,uBAAuB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;gBACrF,IAAI,mBAAmB,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,SAAS,IAAI,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;oBACtG,UAAU,GAAG,MAAM,CAAC;oBACpB,YAAY,GAAG,QAAQ,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,UAAoB,EAAE,QAAQ,EAAE,YAAwB,EAAE,CAAC;AAC9E,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,mBAAmB,GAAG,CAAC,KAAa,EAAE,KAAa,EAAE,KAAa,EAAE,KAAa,EAAmB,EAAE;IAC1G,MAAM,KAAK,GAAS,IAAI,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAS,IAAI,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAS,IAAI,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAE3C,MAAM,SAAS,GAAS,SAAS,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,6BAA6B;IACtG,MAAM,SAAS,GAAS,SAAS,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,8BAA8B;IACvG,MAAM,YAAY,GAAkB,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;IAEtE,IAAI,CAAC,YAAY,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,+FAA+F;IAC/F,MAAM,aAAa,GAAW,KAAK,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;IAClE,MAAM,aAAa,GAAW,KAAK,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;IAClE,MAAM,aAAa,GAAW,KAAK,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;IAElE,OAAO,IAAI,QAAQ,CAAC,aAAa,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;AACnE,CAAC,CAAC;AAEF;;;;;;IAMI;AACJ,MAAM,uBAAuB,GAAG,CAAC,UAAmB,EAAE,MAAc,EAAiB,EAAE;IACrF,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,IAAI,IAAI,GAAS,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7G,yFAAyF;QACzF,IAAI,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

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

@@ -0,0 +1,30 @@
+/**
+ * @modified_by Ikaros Kappler
+ * @date_init   2012-10-17
+ * @date        2017-07-31
+ * @modified    2020-08-17 Ported from vanilla JS to TypeScript.
+ * @version     2.0.1
+ **/
+import { Triangle } from "../../Triangle";
+import { Vertex } from "../../Vertex";
+import { Line as Edge } from "../../Line";
+/**
+ * @classdesc A Delaunay pointset triangulation implementation.  Inspired by
+ *    http://www.travellermap.com/tmp/delaunay.htm
+ *
+ * License: Public Domain
+ *          Original C++ code by Joshua Bell
+ *
+ * @requires Triangle
+ * @requires Line
+ * @requires Vertex
+ */
+export declare class Delaunay {
+    private pointList;
+    constructor(pointList: Array<Vertex>);
+    triangulate(): Array<Triangle>;
+    Triangulate(vertices: Array<Vertex>): Array<Triangle>;
+    createBoundingTriangle(vertices: Array<Vertex>): Triangle;
+    AddVertex(vertex: Vertex, triangles: Array<Triangle>): void;
+    mkUniqueEdges(edges: Array<Edge>): Array<Edge>;
+}

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

@@ -0,0 +1,153 @@
+/**
+ * @modified_by Ikaros Kappler
+ * @date_init   2012-10-17
+ * @date        2017-07-31
+ * @modified    2020-08-17 Ported from vanilla JS to TypeScript.
+ * @version     2.0.1
+ **/
+import { Triangle } from "../../Triangle";
+import { Vertex } from "../../Vertex";
+import { Line as Edge } from "../../Line";
+// TODO: cleanup? This seems not to be used.
+// const EPSILON : number = 1.0e-6;
+/**
+ * @classdesc A Delaunay pointset triangulation implementation.  Inspired by
+ *    http://www.travellermap.com/tmp/delaunay.htm
+ *
+ * License: Public Domain
+ *          Original C++ code by Joshua Bell
+ *
+ * @requires Triangle
+ * @requires Line
+ * @requires Vertex
+ */
+export class Delaunay {
+    constructor(pointList) {
+        this.pointList = pointList;
+    }
+    triangulate() {
+        return this.Triangulate(this.pointList);
+    }
+    ////////////////////////////////////////////////////////////////////////////////
+    //
+    // Delaunay Triangulation Code, by Joshua Bell
+    //
+    // Inspired by: http://www.codeguru.com/cpp/data/mfc_database/misc/article.php/c8901/
+    //
+    // This work is hereby released into the Public Domain. To view a copy of the public 
+    // domain dedication, visit http://creativecommons.org/licenses/publicdomain/ or send 
+    // a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, 
+    // California, 94105, USA.
+    //
+    ////////////////////////////////////////////////////////////////////////////////
+    //------------------------------------------------------------
+    // Triangulate
+    //
+    // Perform the Delaunay Triangulation of a set of vertices.
+    //
+    // vertices: Array of Vertex objects
+    //
+    // returns: Array of Triangles
+    //------------------------------------------------------------
+    Triangulate(vertices) {
+        const triangles = [];
+        // First, create a "supertriangle" that bounds all vertices  
+        var st = this.createBoundingTriangle(vertices);
+        triangles.push(st);
+        // begin the triangulation one vertex at a time
+        for (var i in vertices) {
+            // NOTE: This is O(n^2) - can be optimized by sorting vertices
+            // along the x-axis and only considering triangles that have 
+            // potentially overlapping circumcircles
+            this.AddVertex(vertices[i], triangles);
+        }
+        // Remove triangles that shared edges with "supertriangle"
+        for (var i in triangles) {
+            var triangle = triangles[i];
+            if (triangle.a == st.a || triangle.a == st.b || triangle.a == st.c ||
+                triangle.b == st.a || triangle.b == st.b || triangle.b == st.c ||
+                triangle.c == st.a || triangle.c == st.b || triangle.c == st.c) {
+                delete triangles[i];
+            }
+        }
+        return triangles;
+    }
+    ; // Triangulate
+    // Internal: create a triangle that bounds the given vertices, with room to spare
+    createBoundingTriangle(vertices) {
+        // NOTE: There's a bit of a heuristic here. If the bounding triangle 
+        // is too large and you see overflow/underflow errors. If it is too small 
+        // you end up with a non-convex hull.
+        var minx, miny, maxx, maxy;
+        for (var i in vertices) {
+            var vertex = vertices[i];
+            if (minx === undefined || vertex.x < minx) {
+                minx = vertex.x;
+            }
+            if (miny === undefined || vertex.y < miny) {
+                miny = vertex.y;
+            }
+            if (maxx === undefined || vertex.x > maxx) {
+                maxx = vertex.x;
+            }
+            if (maxy === undefined || vertex.y > maxy) {
+                maxy = vertex.y;
+            }
+        }
+        var dx = (maxx - minx) * 10;
+        var dy = (maxy - miny) * 10;
+        var stv0 = new Vertex(minx - dx, miny - dy * 3);
+        var stv1 = new Vertex(minx - dx, maxy + dy);
+        var stv2 = new Vertex(maxx + dx * 3, maxy + dy);
+        return new Triangle(stv0, stv1, stv2);
+    }
+    ; // END createBoundingTriangle
+    // Internal: update triangulation with a vertex 
+    AddVertex(vertex, triangles) {
+        var edges = [];
+        // Remove triangles with circumcircles containing the vertex
+        for (var i in triangles) {
+            var triangle = triangles[i];
+            if (triangle.inCircumcircle(vertex)) {
+                edges.push(new Edge(triangle.a, triangle.b));
+                edges.push(new Edge(triangle.b, triangle.c));
+                edges.push(new Edge(triangle.c, triangle.a));
+                delete triangles[i];
+            }
+        }
+        edges = this.mkUniqueEdges(edges);
+        // Create new triangles from the unique edges and new vertex
+        for (var i in edges) {
+            // console.log( 'adding triangle' );
+            var edge = edges[i];
+            triangles.push(new Triangle(edge.a, edge.b, vertex));
+        }
+    }
+    ; // END AddVertex
+    // Internal: remove duplicate edges from an array
+    mkUniqueEdges(edges) {
+        // TODO: This is O(n^2), make it O(n) with a hash or some such
+        const uniqueEdges = [];
+        for (var i in edges) {
+            let edge1 = edges[i];
+            let unique = true;
+            for (var j in edges) {
+                if (i != j) {
+                    let edge2 = edges[j];
+                    if ((edge1.a == edge2.a && edge1.b == edge2.b) ||
+                        (edge1.a == edge2.b && edge1.b == edge2.a)) {
+                        unique = false;
+                        break;
+                    }
+                }
+            }
+            if (unique) {
+                uniqueEdges.push(edge1);
+            }
+        }
+        return uniqueEdges;
+    }
+    ; // END mkUniqueEdges
+}
+; // END class
+//# sourceMappingURL=delaunay.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"delaunay.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/delaunay.ts"],"names":[],"mappings":"AAAA;;;;;;IAMI;AAGJ,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,IAAI,IAAI,IAAI,EAAE,MAAM,YAAY,CAAC;AAE1C,4CAA4C;AAC5C,mCAAmC;AAGnC;;;;;;;;;;GAUG;AACH,MAAM,OAAO,QAAQ;IAKjB,YAAa,SAAuB;QACvC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IACxB,CAAC;IAED,WAAW;QACd,OAAO,IAAI,CAAC,WAAW,CAAE,IAAI,CAAC,SAAS,CAAE,CAAC;IACvC,CAAC;IAGD,gFAAgF;IAChF,EAAE;IACF,8CAA8C;IAC9C,EAAE;IACF,qFAAqF;IACrF,EAAE;IACF,qFAAqF;IACrF,sFAAsF;IACtF,8EAA8E;IAC9E,0BAA0B;IAC1B,EAAE;IACF,gFAAgF;IAIhF,8DAA8D;IAC9D,cAAc;IACd,EAAE;IACF,2DAA2D;IAC3D,EAAE;IACF,oCAAoC;IACpC,EAAE;IACF,8BAA8B;IAC9B,8DAA8D;IAC9D,WAAW,CAAE,QAAsB;QACtC,MAAM,SAAS,GAAqB,EAAE,CAAC;QAEvC,6DAA6D;QAC7D,IAAI,EAAE,GAAc,IAAI,CAAC,sBAAsB,CAAE,QAAQ,CAAE,CAAC;QAE5D,SAAS,CAAC,IAAI,CAAE,EAAE,CAAE,CAAC;QAErB,+CAA+C;QAC/C,KAAK,IAAI,CAAC,IAAI,QAAQ,EAAG,CAAC;YACtB,8DAA8D;YAC9D,6DAA6D;YAC7D,wCAAwC;YAExC,IAAI,CAAC,SAAS,CAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAE,CAAC;QAC7C,CAAC;QAED,0DAA0D;QAC1D,KAAK,IAAI,CAAC,IAAI,SAAS,EAAG,CAAC;YACvB,IAAI,QAAQ,GAAc,SAAS,CAAC,CAAC,CAAC,CAAC;YAEvC,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;gBACrE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC9D,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAG,CAAC;gBAClE,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACL,CAAC;QAED,OAAO,SAAS,CAAC;IAEd,CAAC;IAAA,CAAC,CAAC,cAAc;IAGjB,iFAAiF;IACjF,sBAAsB,CAAE,QAAsB;QACjD,qEAAqE;QACrE,0EAA0E;QAC1E,qCAAqC;QAErC,IAAI,IAAW,EAAE,IAAW,EAAE,IAAW,EAAE,IAAW,CAAC;QACvD,KAAK,IAAI,CAAC,IAAI,QAAQ,EACtB,CAAC;YACG,IAAI,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,EAAG,CAAC;gBAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;YAAC,CAAC;YAChE,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,EAAG,CAAC;gBAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;YAAC,CAAC;YAChE,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,EAAG,CAAC;gBAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;YAAC,CAAC;YAChE,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,EAAG,CAAC;gBAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;YAAC,CAAC;QACpE,CAAC;QAED,IAAI,EAAE,GAAG,CAAE,IAAI,GAAG,IAAI,CAAE,GAAG,EAAE,CAAC;QAC9B,IAAI,EAAE,GAAG,CAAE,IAAI,GAAG,IAAI,CAAE,GAAG,EAAE,CAAC;QAE9B,IAAI,IAAI,GAAY,IAAI,MAAM,CAAE,IAAI,GAAG,EAAE,EAAI,IAAI,GAAG,EAAE,GAAC,CAAC,CAAE,CAAC;QAC3D,IAAI,IAAI,GAAY,IAAI,MAAM,CAAE,IAAI,GAAG,EAAE,EAAI,IAAI,GAAG,EAAE,CAAI,CAAC;QAC3D,IAAI,IAAI,GAAY,IAAI,MAAM,CAAE,IAAI,GAAG,EAAE,GAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAI,CAAC;QAE3D,OAAO,IAAI,QAAQ,CAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAE,CAAC;IACrC,CAAC;IAAA,CAAC,CAAC,6BAA6B;IAGhC,gDAAgD;IAChD,SAAS,CAAE,MAAa,EAAE,SAAyB;QACtD,IAAI,KAAK,GAAiB,EAAE,CAAC;QAE7B,4DAA4D;QAC5D,KAAK,IAAI,CAAC,IAAI,SAAS,EAAG,CAAC;YACvB,IAAI,QAAQ,GAAc,SAAS,CAAC,CAAC,CAAC,CAAC;YAEvC,IAAI,QAAQ,CAAC,cAAc,CAAE,MAAM,CAAE,EAAG,CAAC;gBAC5C,KAAK,CAAC,IAAI,CAAE,IAAI,IAAI,CAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAE,CAAC;gBACjD,KAAK,CAAC,IAAI,CAAE,IAAI,IAAI,CAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAE,CAAC;gBACjD,KAAK,CAAC,IAAI,CAAE,IAAI,IAAI,CAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAE,CAAC;gBAEjD,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACL,CAAC;QAED,KAAK,GAAG,IAAI,CAAC,aAAa,CAAE,KAAK,CAAE,CAAC;QAEpC,4DAA4D;QAC5D,KAAK,IAAI,CAAC,IAAI,KAAK,EAAG,CAAC;YACnB,oCAAoC;YACpC,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,SAAS,CAAC,IAAI,CAAE,IAAI,QAAQ,CAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,MAAM,CAAE,CAAE,CAAC;QAC7D,CAAC;IACE,CAAC;IAAA,CAAC,CAAC,gBAAgB;IAGnB,iDAAiD;IACjD,aAAa,CAAE,KAAiB;QACnC,8DAA8D;QAC9D,MAAM,WAAW,GAAiB,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,IAAI,KAAK,EAAG,CAAC;YACnB,IAAI,KAAK,GAAU,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,MAAM,GAAG,IAAI,CAAC;YAElB,KAAK,IAAI,CAAC,IAAI,KAAK,EAAG,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,EAAG,CAAC;oBACV,IAAI,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAErB,IAAI,CAAE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE;wBACnD,CAAE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,EAAG,CAAC;wBAChD,MAAM,GAAG,KAAK,CAAC;wBACf,MAAM;oBACH,CAAC;gBACL,CAAC;YACE,CAAC;YAED,IAAI,MAAM,EAAG,CAAC;gBACjB,WAAW,CAAC,IAAI,CAAE,KAAK,CAAE,CAAC;YACvB,CAAC;QACL,CAAC;QAED,OAAO,WAAW,CAAC;IAChB,CAAC;IAAA,CAAC,CAAC,oBAAoB;CAC1B;AAAA,CAAC,CAAC,YAAY"}

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

@@ -0,0 +1,25 @@
+/**
+ * @author   Ikaros Kappler
+ * @date     2018-04-07
+ * @modified 2018-04-11 Using VoronoiCells now (was array before).
+ * @modified 2020-08-15 Ported from vanilla JS to TypeScript.
+ * @version  1.0.2
+ **/
+import { Triangle } from "../../Triangle";
+import { Vertex } from "../../Vertex";
+import { VoronoiCell } from "../datastructures/VoronoiCell";
+/**
+ * @classdesc Create the voronoi diagram from the given delaunay triangulation (they are dual graphs).
+ *
+ * @requires VoronoiCell
+ * @requires Triangle
+ */
+export declare class delaunay2voronoi {
+    failedTriangleSets: Array<Triangle>;
+    hasErrors: boolean;
+    private pointList;
+    private triangles;
+    constructor(pointList: Array<Vertex>, triangles: Array<Triangle>);
+    build(): Array<VoronoiCell>;
+    private subsetToPath;
+}

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

@@ -0,0 +1,99 @@
+/**
+ * @author   Ikaros Kappler
+ * @date     2018-04-07
+ * @modified 2018-04-11 Using VoronoiCells now (was array before).
+ * @modified 2020-08-15 Ported from vanilla JS to TypeScript.
+ * @version  1.0.2
+ **/
+import { VoronoiCell } from "../datastructures/VoronoiCell";
+/**
+ * @classdesc Create the voronoi diagram from the given delaunay triangulation (they are dual graphs).
+ *
+ * @requires VoronoiCell
+ * @requires Triangle
+ */
+export class delaunay2voronoi {
+    constructor(pointList, triangles) {
+        this.failedTriangleSets = [];
+        this.hasErrors = false;
+        this.pointList = pointList;
+        this.triangles = triangles;
+    }
+    ;
+    // +---------------------------------------------------------------------------------
+    // | Convert the triangle set to the Voronoi diagram.
+    // +-------------------------------
+    build() {
+        const voronoiDiagram = [];
+        for (var p in this.pointList) {
+            var point = this.pointList[p];
+            // Find adjacent triangles for first point
+            var adjacentSubset = [];
+            for (var t in this.triangles) {
+                if (this.triangles[t].a.equals(point) || this.triangles[t].b.equals(point) || this.triangles[t].c.equals(point))
+                    adjacentSubset.push(this.triangles[t]);
+            }
+            var path = this.subsetToPath(adjacentSubset);
+            if (path) // There may be errors
+                voronoiDiagram.push(new VoronoiCell(path, point));
+        }
+        return voronoiDiagram;
+    }
+    ;
+    // +---------------------------------------------------------------------------------
+    // | Re-order a tiangle subset so the triangle define a single path.
+    // |
+    // | It is required that all passed triangles are connected to a
+    // | path. Otherwise this function will RAISE AN EXCEPTION.
+    // |
+    // | The function has a failsafe recursive call for the case the first
+    // | element in the array is inside the path (no border element).
+    // +-------------------------------
+    subsetToPath(triangleSet, startPosition, tryOnce) {
+        if (triangleSet.length == 0)
+            return [];
+        if (typeof startPosition === 'undefined')
+            startPosition = 0;
+        let t = startPosition;
+        const result = [triangleSet[t]];
+        const visited = [t];
+        let i = 0;
+        while (result.length < triangleSet.length && i < triangleSet.length) {
+            let u = (startPosition + i) % triangleSet.length;
+            if (t != u && visited.indexOf(u) == -1 && triangleSet[t].isAdjacent(triangleSet[u])) {
+                result.push(triangleSet[u]);
+                visited.push(u);
+                t = u;
+                i = 0;
+            }
+            else {
+                i++;
+            }
+        }
+        // If not all triangles were used the passed set is NOT CIRCULAR.
+        // But in this case the triangle at position t is at one end of the path :)
+        // -> Restart with t.
+        if (result.length < triangleSet.length) {
+            if (tryOnce) {
+                // Possibility A (try to fix this): split the triangle set into two arrays and restart with each.
+                // Possibility B (no fix for this): throw an error and terminate.
+                // Possibility C (temp solution): Store the error for later reporting and continue.
+                // this.failedTriangleSets.push( triangleSet );
+                this.failedTriangleSets = triangleSet;
+                this.hasErrors = true;
+                // throw "Error: this triangle set is not connected: " + JSON.stringify(triangleSet);
+                return null;
+            }
+            else {
+                // Triangle inside path found. Rearrange.
+                return this.subsetToPath(triangleSet, t, true);
+            }
+        }
+        else {
+            return result;
+        }
+    }
+    ;
+}
+; // END delaunay2voronoi
+//# sourceMappingURL=delaunay2voronoi.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"delaunay2voronoi.js","sourceRoot":"","sources":["../../../../../ts/utils/algorithms/delaunay2voronoi.ts"],"names":[],"mappings":"AAAA;;;;;;IAMI;AAIJ,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAE5D;;;;;GAKG;AACH,MAAM,OAAO,gBAAgB;IAQzB,YAAa,SAAuB,EAAE,SAAyB;QAElE,IAAI,CAAC,kBAAkB,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAY,KAAK,CAAC;QAEhC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IACxB,CAAC;IAAA,CAAC;IAEF,qFAAqF;IACrF,qDAAqD;IACrD,mCAAmC;IACnC,KAAK;QACR,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,EAAG,CAAC;YAC5B,IAAI,KAAK,GAAY,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACvC,0CAA0C;YAC1C,IAAI,cAAc,GAAqB,EAAE,CAAC;YAC1C,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,EAAG,CAAC;gBACnC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;oBAC3G,cAAc,CAAC,IAAI,CAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAE,CAAC;YAE1C,CAAC;YACD,IAAI,IAAI,GAAqB,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;YAC/D,IAAI,IAAI,EAAG,sBAAsB;gBACpC,cAAc,CAAC,IAAI,CAAE,IAAI,WAAW,CAAC,IAAI,EAAC,KAAK,CAAC,CAAE,CAAC;QACpD,CAAC;QACD,OAAO,cAAc,CAAC;IACnB,CAAC;IAAA,CAAC;IAGF,qFAAqF;IACrF,oEAAoE;IACpE,IAAI;IACJ,gEAAgE;IAChE,2DAA2D;IAC3D,IAAI;IACJ,sEAAsE;IACtE,iEAAiE;IACjE,mCAAmC;IAC3B,YAAY,CAAE,WAA4B,EACjD,aAAqB,EACrB,OAAgB;QACpB,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC;YACvB,OAAO,EAAE,CAAC;QAEd,IAAI,OAAO,aAAa,KAAK,WAAW;YACpC,aAAa,GAAG,CAAC,CAAC;QAEtB,IAAI,CAAC,GAAY,aAAa,CAAC;QAC/B,MAAM,MAAM,GAAqB,CAAE,WAAW,CAAC,CAAC,CAAC,CAAE,CAAC;QACpD,MAAM,OAAO,GAAmB,CAAE,CAAC,CAAE,CAAC;QACtC,IAAI,CAAC,GAAY,CAAC,CAAC;QACnB,OAAO,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,EAAG,CAAC;YACnE,IAAI,CAAC,GAAY,CAAC,aAAa,GAAC,CAAC,CAAC,GAAC,WAAW,CAAC,MAAM,CAAC;YACtD,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAG,CAAC;gBAC1F,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,CAAC,GAAG,CAAC,CAAC;gBACN,CAAC,GAAG,CAAC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACX,CAAC,EAAE,CAAC;YACD,CAAC;QACL,CAAC;QACD,iEAAiE;QACjE,2EAA2E;QAC3E,qBAAqB;QACrB,IAAI,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,EAAG,CAAC;YACtC,IAAI,OAAO,EAAG,CAAC;gBAClB,iGAAiG;gBACjG,iEAAiE;gBACjE,mFAAmF;gBACnF,+CAA+C;gBAC/C,IAAI,CAAC,kBAAkB,GAAG,WAAW,CAAC;gBACtC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;gBACtB,qFAAqF;gBACrF,OAAO,IAAI,CAAC;YACT,CAAC;iBAAM,CAAC;gBACX,yCAAyC;gBACzC,OAAO,IAAI,CAAC,YAAY,CAAE,WAAW,EAAE,CAAC,EAAE,IAAI,CAAE,CAAC;YAC9C,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,OAAO,MAAM,CAAC;QAClB,CAAC;IACE,CAAC;IAAA,CAAC;CAEL;AAAA,CAAC,CAAC,uBAAuB"}

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

@@ -0,0 +1,21 @@
+/**
+ * A function to detect connected paths on the plane given by a random set of segments.
+ *
+ * Note that is algorithm operates IN PLACE and will ALTER your INPUT array.
+ *
+ * @author  Ikaros Kappler
+ * @version 1.0.0
+ * @date    2022-10-17
+ */
+import { PathSegment } from "../../interfaces";
+import { GenericPath } from "../datastructures/GenericPath";
+/**
+ * Run a path detection on the given set of path segments.
+ *
+ * Note that the array and some path segments may be altered (like reversal) IN PLACE.
+ *
+ * @param {Array<PathSegment>} segments - The total set (array) of available path segments.
+ * @param {number=1.0} epsilon - (optional) An epsilon to use to tell if two plane points should be considered 'equal'.
+ * @returns {Array<GenericPath>} An array containing all detected path (consisting of adjacent path segments of the original set).
+ */
+export declare const detectPaths: (segments: Array<PathSegment>, epsilon?: number) => Array<GenericPath>;