plotboilerplate 1.28.1 → 1.30.0

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

@@ -0,0 +1,69 @@
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * Inspired by https://github.com/rowanwins/smallest-enclosing-circle.
+ *
+ * @param {XYCoords[]} points
+ * @returns
+ */
+import { Circle } from "../../Circle";
+import { Triangle } from "../../Triangle";
+import { VertTuple } from "../../VertTuple";
+import { Vertex } from "../../Vertex";
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * @param {XYCoords[]} points
+ * @returns {Circle | null} The minimal containing circle or null if the point count is lower than 2.
+ */
+export const minimalContainingCircleFromPoints = (points) => {
+    if (points.length <= 1) {
+        return null;
+    }
+    const circleObject = wetzlsAlgorithm(points);
+    return new Circle(new Vertex(circleObject.center.x, circleObject.center.y), circleObject.radius);
+};
+/**
+ * This initiates the actual algorithm but return a shallow circle representation.
+ *
+ * @param points
+ * @returns
+ */
+const wetzlsAlgorithm = (points) => {
+    return minimumContainingCircle(points, points.length, [], 0);
+};
+/**
+ * Pre: points.length >= 2
+ * @param {Vertex[]} points
+ * @param n
+ * @param boundary
+ * @param boundaryLength
+ * @returns
+ */
+const minimumContainingCircle = (points, n, boundary, boundaryLength) => {
+    if (boundaryLength === 3) {
+        return Triangle.utils.calcCircumcircle(boundary[0], boundary[1], boundary[2]);
+    }
+    else if (n === 1 && boundaryLength === 0) {
+        return { center: { x: points[0].x, y: points[0].y }, radius: 0 };
+    }
+    else if (n === 0 && boundaryLength === 2) {
+        return VertTuple.vtutils.calcCircumcircle(boundary[0], boundary[1]);
+    }
+    else if (n === 1 && boundaryLength === 1) {
+        return VertTuple.vtutils.calcCircumcircle(boundary[0], points[0]);
+    }
+    else {
+        const localCircle = minimumContainingCircle(points, n - 1, boundary, boundaryLength);
+        if (!Circle.circleUtils.containsPoint(localCircle.center, localCircle.radius, points[n - 1])) {
+            boundary[boundaryLength++] = points[n - 1];
+            return minimumContainingCircle(points, n - 1, boundary, boundaryLength);
+        }
+        return localCircle;
+    }
+};
+//# sourceMappingURL=minimalContainingCircleFromPoints.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"minimalContainingCircleFromPoints.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/minimalContainingCircleFromPoints.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,MAAM,EAAW,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGtC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,iCAAiC,GAAG,CAAC,MAAkB,EAAiB,EAAE;IACrF,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC7C,OAAO,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;AACnG,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,MAAkB,EAAkB,EAAE;IAC7D,OAAO,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,uBAAuB,GAAG,CAAC,MAAkB,EAAE,CAAS,EAAE,QAAoB,EAAE,cAAsB,EAAW,EAAE;IACvH,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,QAAQ,CAAC,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACnE,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,SAAS,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,SAAS,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;SAAM,CAAC;QACN,MAAM,WAAW,GAAY,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC9F,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7F,QAAQ,CAAC,cAAc,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,OAAO,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC1E,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;AACH,CAAC,CAAC"}

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

@@ -0,0 +1,21 @@
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * Inspired by https://github.com/rowanwins/smallest-enclosing-circle.
+ *
+ * @param {XYCoords[]} points
+ * @returns
+ */
+import { Circle } from "../../Circle";
+import { XYCoords } from "../../interfaces";
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * @param {XYCoords[]} points
+ * @returns {Circle | null} The minimal containing circle or null if the point count is lower than 2.
+ */
+export declare const minimalEnclosingCircleFromPoints: (points: XYCoords[]) => Circle | null;

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

@@ -0,0 +1,69 @@
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * Inspired by https://github.com/rowanwins/smallest-enclosing-circle.
+ *
+ * @param {XYCoords[]} points
+ * @returns
+ */
+import { Circle } from "../../Circle";
+import { Triangle } from "../../Triangle";
+import { VertTuple } from "../../VertTuple";
+import { Vertex } from "../../Vertex";
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * @param {XYCoords[]} points
+ * @returns {Circle | null} The minimal containing circle or null if the point count is lower than 2.
+ */
+export const minimalEnclosingCircleFromPoints = (points) => {
+    if (points.length <= 1) {
+        return null;
+    }
+    const circleObject = wetzlsAlgorithm(points);
+    return new Circle(new Vertex(circleObject.center.x, circleObject.center.y), circleObject.radius);
+};
+/**
+ * This initiates the actual algorithm but return a shallow circle representation.
+ *
+ * @param points
+ * @returns
+ */
+const wetzlsAlgorithm = (points) => {
+    return minimumContainingCircle(points, points.length, [], 0);
+};
+/**
+ * Pre: points.length >= 2
+ * @param {Vertex[]} points
+ * @param n
+ * @param boundary
+ * @param boundaryLength
+ * @returns
+ */
+const minimumContainingCircle = (points, n, boundary, boundaryLength) => {
+    if (boundaryLength === 3) {
+        return Triangle.utils.calcCircumcircle(boundary[0], boundary[1], boundary[2]);
+    }
+    else if (n === 1 && boundaryLength === 0) {
+        return { center: { x: points[0].x, y: points[0].y }, radius: 0 };
+    }
+    else if (n === 0 && boundaryLength === 2) {
+        return VertTuple.vtutils.calcCircumcircle(boundary[0], boundary[1]);
+    }
+    else if (n === 1 && boundaryLength === 1) {
+        return VertTuple.vtutils.calcCircumcircle(boundary[0], points[0]);
+    }
+    else {
+        const localCircle = minimumContainingCircle(points, n - 1, boundary, boundaryLength);
+        if (!Circle.circleUtils.containsPoint(localCircle.center, localCircle.radius, points[n - 1])) {
+            boundary[boundaryLength++] = points[n - 1];
+            return minimumContainingCircle(points, n - 1, boundary, boundaryLength);
+        }
+        return localCircle;
+    }
+};
+//# sourceMappingURL=minimalEnclosingCircleFromPoints.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"minimalEnclosingCircleFromPoints.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/minimalEnclosingCircleFromPoints.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,MAAM,EAAW,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGtC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,MAAkB,EAAiB,EAAE;IACpF,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC7C,OAAO,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;AACnG,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,MAAkB,EAAkB,EAAE;IAC7D,OAAO,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,uBAAuB,GAAG,CAAC,MAAkB,EAAE,CAAS,EAAE,QAAoB,EAAE,cAAsB,EAAW,EAAE;IACvH,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,QAAQ,CAAC,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACnE,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,SAAS,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,SAAS,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;SAAM,CAAC;QACN,MAAM,WAAW,GAAY,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC9F,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7F,QAAQ,CAAC,cAAc,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,OAAO,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC1E,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;AACH,CAAC,CAAC"}

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

@@ -0,0 +1,21 @@
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * Inspired by https://github.com/rowanwins/smallest-enclosing-circle.
+ *
+ * @param {XYCoords[]} points
+ * @returns
+ */
+import { Circle } from "../../Circle";
+import { XYCoords } from "../../interfaces";
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * @param {XYCoords[]} points
+ * @returns {Circle | null} The minimal containing circle or null if the point count is lower than 2.
+ */
+export declare const pointsMinimalContainingCircle: (points: XYCoords[]) => Circle | null;

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

@@ -0,0 +1,69 @@
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * Inspired by https://github.com/rowanwins/smallest-enclosing-circle.
+ *
+ * @param {XYCoords[]} points
+ * @returns
+ */
+import { Circle } from "../../Circle";
+import { Triangle } from "../../Triangle";
+import { VertTuple } from "../../VertTuple";
+import { Vertex } from "../../Vertex";
+/**
+ * Calculate the minimal containing circle from a set of points.
+ *
+ * The number of points must be at least 2. Otherwise the function returns null.
+ *
+ * @param {XYCoords[]} points
+ * @returns {Circle | null} The minimal containing circle or null if the point count is lower than 2.
+ */
+export const pointsMinimalContainingCircle = (points) => {
+    if (points.length <= 1) {
+        return null;
+    }
+    const circleObject = wetzlsAlgorithm(points);
+    return new Circle(new Vertex(circleObject.center.x, circleObject.center.y), circleObject.radius);
+};
+/**
+ * This initiates the actual algorithm but return a shallow circle representation.
+ *
+ * @param points
+ * @returns
+ */
+const wetzlsAlgorithm = (points) => {
+    return minimumContainingCircle(points, points.length, [], 0);
+};
+/**
+ * Pre: points.length >= 2
+ * @param {Vertex[]} points
+ * @param n
+ * @param boundary
+ * @param boundaryLength
+ * @returns
+ */
+const minimumContainingCircle = (points, n, boundary, boundaryLength) => {
+    if (boundaryLength === 3) {
+        return Triangle.utils.calcCircumcircle(boundary[0], boundary[1], boundary[2]);
+    }
+    else if (n === 1 && boundaryLength === 0) {
+        return { center: { x: points[0].x, y: points[0].y }, radius: 0 };
+    }
+    else if (n === 0 && boundaryLength === 2) {
+        return VertTuple.vtutils.calcCircumcircle(boundary[0], boundary[1]);
+    }
+    else if (n === 1 && boundaryLength === 1) {
+        return VertTuple.vtutils.calcCircumcircle(boundary[0], points[0]);
+    }
+    else {
+        const localCircle = minimumContainingCircle(points, n - 1, boundary, boundaryLength);
+        if (!Circle.circleUtils.containsPoint(points[n - 1], localCircle)) {
+            boundary[boundaryLength++] = points[n - 1];
+            return minimumContainingCircle(points, n - 1, boundary, boundaryLength);
+        }
+        return localCircle;
+    }
+};
+//# sourceMappingURL=pointsMinimalContainingCircle.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"pointsMinimalContainingCircle.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/pointsMinimalContainingCircle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,MAAM,EAAW,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAGtC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,MAAkB,EAAiB,EAAE;IACjF,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC7C,OAAO,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;AACnG,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,MAAkB,EAAkB,EAAE;IAC7D,OAAO,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,uBAAuB,GAAG,CAAC,MAAkB,EAAE,CAAS,EAAE,QAAoB,EAAE,cAAsB,EAAW,EAAE;IACvH,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,QAAQ,CAAC,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAChF,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACnE,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,SAAS,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;SAAM,IAAI,CAAC,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QAC3C,OAAO,SAAS,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;SAAM,CAAC;QACN,MAAM,WAAW,GAAY,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC9F,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;YAClE,QAAQ,CAAC,cAAc,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,OAAO,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC1E,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;AACH,CAAC,CAAC"}

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

@@ -0,0 +1,69 @@
+/**
+ * A solver for the Apollonian circle problem:
+ *   find the circle that touches three other circles in extactly one point (each).
+ * The solution is not necesarily unique.
+ *
+ * For each of the three circles a boolean attribute can be passed that determines if the
+ * resultint circle should touch the input circle should be touched on the inside or outside.
+ *
+ * Not that there can be condition when the circle cannot be calculated (e.g. all circles
+ * have the same size and are colinear).
+ *
+ * Found at
+ *     https://stackoverflow.com/questions/79281573/algorithm-for-finding-enclosing-circles-for-3-other-circles
+ *
+ * solveApollonius(Coord c1, Coord c2, Coord c3, int s1, int s2, int s3) {
+        // https://github.com/DIKU-Steiner/ProGAL/blob/master/src/ProGAL/geom2d/ApolloniusSolver.java
+
+        var x1 = c1.x;
+        var y1 = c1.y;
+        var r1 = c1.z;
+        var x2 = c2.x;
+        var y2 = c2.y;
+        var r2 = c2.z;
+        var x3 = c3.x;
+        var y3 = c3.y;
+        var r3 = c3.z;
+
+        // Currently optimized for fewest multiplications.
+        var v11 = 2 * x2 - 2 * x1;
+        var v12 = 2 * y2 - 2 * y1;
+        var v13 = x1 * x1 - x2 * x2 + y1 * y1 - y2 * y2 - r1 * r1 + r2 * r2;
+        var v14 = 2 * s2 * r2 - 2 * s1 * r1;
+
+        var v21 = 2 * x3 - 2 * x2;
+        var v22 = 2 * y3 - 2 * y2;
+        var v23 = x2 * x2 - x3 * x3 + y2 * y2 - y3 * y3 - r2 * r2 + r3 * r3;
+        var v24 = 2 * s3 * r3 - 2 * s2 * r2;
+
+        var w12 = v12 / v11;
+        var w13 = v13 / v11;
+        var w14 = v14 / v11;
+
+        var w22 = v22 / v21 - w12;
+        var w23 = v23 / v21 - w13;
+        var w24 = v24 / v21 - w14;
+
+        var P = -w23 / w22;
+        var Q = w24 / w22;
+        var M = -w12 * P - w13;
+        var N = w14 - w12 * Q;
+
+        var a = N * N + Q * Q - 1;
+        var b = 2 * M * N - 2 * N * x1 + 2 * P * Q - 2 * Q * y1 + 2 * s1 * r1;
+        var c = x1 * x1 + M * M - 2 * M * x1 + P * P + y1 * y1 - 2 * P * y1 - r1 * r1;
+
+        // Find a root of a quadratic equation. This requires the circle centers not
+        // to be e.g. colinear
+        var D = b * b - 4 * a * c;
+        var rs = (-b - Math.sqrt(D)) / (2 * a);
+        var xs = M + N * rs;
+        var ys = P + Q * rs;
+
+        return (xs, ys, rs);
+    }
+ *
+ * @date 2026-07-03
+ */
+import { Circle, ICircle } from "../../Circle";
+export declare const solveApollonius3: (c1: ICircle, c2: ICircle, c3: ICircle, circle1Inside?: boolean, circle2Inside?: boolean, circle3Inside?: boolean) => Circle;

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

@@ -0,0 +1,114 @@
+/**
+ * A solver for the Apollonian circle problem:
+ *   find the circle that touches three other circles in extactly one point (each).
+ * The solution is not necesarily unique.
+ *
+ * For each of the three circles a boolean attribute can be passed that determines if the
+ * resultint circle should touch the input circle should be touched on the inside or outside.
+ *
+ * Not that there can be condition when the circle cannot be calculated (e.g. all circles
+ * have the same size and are colinear).
+ *
+ * Found at
+ *     https://stackoverflow.com/questions/79281573/algorithm-for-finding-enclosing-circles-for-3-other-circles
+ *
+ * solveApollonius(Coord c1, Coord c2, Coord c3, int s1, int s2, int s3) {
+        // https://github.com/DIKU-Steiner/ProGAL/blob/master/src/ProGAL/geom2d/ApolloniusSolver.java
+
+        var x1 = c1.x;
+        var y1 = c1.y;
+        var r1 = c1.z;
+        var x2 = c2.x;
+        var y2 = c2.y;
+        var r2 = c2.z;
+        var x3 = c3.x;
+        var y3 = c3.y;
+        var r3 = c3.z;
+
+        // Currently optimized for fewest multiplications.
+        var v11 = 2 * x2 - 2 * x1;
+        var v12 = 2 * y2 - 2 * y1;
+        var v13 = x1 * x1 - x2 * x2 + y1 * y1 - y2 * y2 - r1 * r1 + r2 * r2;
+        var v14 = 2 * s2 * r2 - 2 * s1 * r1;
+
+        var v21 = 2 * x3 - 2 * x2;
+        var v22 = 2 * y3 - 2 * y2;
+        var v23 = x2 * x2 - x3 * x3 + y2 * y2 - y3 * y3 - r2 * r2 + r3 * r3;
+        var v24 = 2 * s3 * r3 - 2 * s2 * r2;
+
+        var w12 = v12 / v11;
+        var w13 = v13 / v11;
+        var w14 = v14 / v11;
+
+        var w22 = v22 / v21 - w12;
+        var w23 = v23 / v21 - w13;
+        var w24 = v24 / v21 - w14;
+
+        var P = -w23 / w22;
+        var Q = w24 / w22;
+        var M = -w12 * P - w13;
+        var N = w14 - w12 * Q;
+
+        var a = N * N + Q * Q - 1;
+        var b = 2 * M * N - 2 * N * x1 + 2 * P * Q - 2 * Q * y1 + 2 * s1 * r1;
+        var c = x1 * x1 + M * M - 2 * M * x1 + P * P + y1 * y1 - 2 * P * y1 - r1 * r1;
+
+        // Find a root of a quadratic equation. This requires the circle centers not
+        // to be e.g. colinear
+        var D = b * b - 4 * a * c;
+        var rs = (-b - Math.sqrt(D)) / (2 * a);
+        var xs = M + N * rs;
+        var ys = P + Q * rs;
+
+        return (xs, ys, rs);
+    }
+ *
+ * @date 2026-07-03
+ */
+import { Circle } from "../../Circle";
+import { Vertex } from "../../Vertex";
+export const solveApollonius3 = (c1, c2, c3, circle1Inside, circle2Inside, circle3Inside) => {
+    // https://github.com/DIKU-Steiner/ProGAL/blob/master/src/ProGAL/geom2d/ApolloniusSolver.java
+    var x1 = c1.center.x;
+    var y1 = c1.center.y;
+    var r1 = c1.radius;
+    var x2 = c2.center.x;
+    var y2 = c2.center.y;
+    var r2 = c2.radius;
+    var x3 = c3.center.x;
+    var y3 = c3.center.y;
+    var r3 = c3.radius;
+    var s1 = Boolean(circle1Inside) ? 1 : -1;
+    var s2 = Boolean(circle2Inside) ? 1 : -1;
+    var s3 = Boolean(circle3Inside) ? 1 : -1;
+    // Currently optimized for fewest multiplications.
+    var v11 = 2 * x2 - 2 * x1;
+    var v12 = 2 * y2 - 2 * y1;
+    var v13 = x1 * x1 - x2 * x2 + y1 * y1 - y2 * y2 - r1 * r1 + r2 * r2;
+    var v14 = 2 * s2 * r2 - 2 * s1 * r1;
+    var v21 = 2 * x3 - 2 * x2;
+    var v22 = 2 * y3 - 2 * y2;
+    var v23 = x2 * x2 - x3 * x3 + y2 * y2 - y3 * y3 - r2 * r2 + r3 * r3;
+    var v24 = 2 * s3 * r3 - 2 * s2 * r2;
+    var w12 = v12 / v11;
+    var w13 = v13 / v11;
+    var w14 = v14 / v11;
+    var w22 = v22 / v21 - w12;
+    var w23 = v23 / v21 - w13;
+    var w24 = v24 / v21 - w14;
+    var P = -w23 / w22;
+    var Q = w24 / w22;
+    var M = -w12 * P - w13;
+    var N = w14 - w12 * Q;
+    var a = N * N + Q * Q - 1;
+    var b = 2 * M * N - 2 * N * x1 + 2 * P * Q - 2 * Q * y1 + 2 * s1 * r1;
+    var c = x1 * x1 + M * M - 2 * M * x1 + P * P + y1 * y1 - 2 * P * y1 - r1 * r1;
+    // Find a root of a quadratic equation. This requires the circle centers not
+    // to be e.g. colinear
+    var D = b * b - 4 * a * c;
+    var rs = (-b - Math.sqrt(D)) / (2 * a);
+    var xs = M + N * rs;
+    var ys = P + Q * rs;
+    return new Circle(new Vertex(xs, ys), Math.abs(rs));
+};
+//# sourceMappingURL=solveApollonius3.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"solveApollonius3.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/solveApollonius3.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkEG;AAEH,OAAO,EAAE,MAAM,EAAW,MAAM,cAAc,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,EAAW,EACX,EAAW,EACX,EAAW,EACX,aAAuB,EACvB,aAAuB,EACvB,aAAuB,EACf,EAAE;IACV,6FAA6F;IAE7F,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC;IACnB,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC;IACnB,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC;IAEnB,IAAI,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,IAAI,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,IAAI,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzC,kDAAkD;IAClD,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC1B,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC1B,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACpE,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAEpC,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC1B,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC1B,IAAI,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACpE,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAEpC,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACpB,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACpB,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAEpB,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAC1B,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAC1B,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAE1B,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;IACnB,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;IACvB,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;IAEtB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IACtE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAE9E,4EAA4E;IAC5E,sBAAsB;IACtB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IAEpB,OAAO,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,CAAC,CAAC"}

package/src/index-gl.js

@@ -16,7 +16,6 @@
   // Fetch the GET params
   let GUP = gup();
   var isDarkmode = detectDarkMode(GUP);
-  var isDarkmode = detectDarkMode(GUP);
 
   window.addEventListener("load", function () {
     // All config params are optional.
@@ -73,8 +72,11 @@
     // +---------------------------------------------------------------------------------
     // | Initialize dat.gui
     // +-------------------------------
-    pb.createGUI();
-    // END init dat.gui
+    try {
+      pb.createGUI();
+    } catch (e) {
+      console.error("Failed to initialize GUI", e);
+    }
 
     // +---------------------------------------------------------------------------------
     // | Add a mouse listener to track the mouse position.
@@ -88,7 +90,7 @@
     });
 
     // Use a helper function to build all demo-drawables.
-    var drawables = createDemoDrawables(pb.canvasSize, "example-image.png", function () {
+    var drawables = createDemoDrawables(pb, "example-image.png", function () {
       pb.redraw();
     });
     pb.add(drawables);

package/src/index.js

@@ -81,28 +81,36 @@
     // +---------------------------------------------------------------------------------
     // | Initialize dat.gui
     // +-------------------------------
-    pb.createGUI();
+    try {
+      pb.createGUI();
+    } catch (e) {
+      console.error("Failed to initialize GUI", e);
+    }
 
     // +---------------------------------------------------------------------------------
     // | Add stats.
     // +-------------------------------
-    var stats = {
-      mouseX: 0,
-      mouseY: 0
-    };
-    var uiStats = new UIStats(stats);
-    stats = uiStats.proxy;
-    uiStats.add("mouseX");
-    uiStats.add("mouseY");
+    try {
+      var stats = {
+        mouseX: 0,
+        mouseY: 0
+      };
+      var uiStats = new UIStats(stats);
+      stats = uiStats.proxy;
+      uiStats.add("mouseX");
+      uiStats.add("mouseY");
 
-    // +---------------------------------------------------------------------------------
-    // | Add a mouse listener to track the mouse position.
-    // +-------------------------------
-    new MouseHandler(pb.eventCatcher).move(function (e) {
-      var relPos = pb.transformMousePosition(e.params.pos.x, e.params.pos.y);
-      stats.mouseX = relPos.x;
-      stats.mouseY = relPos.y;
-    });
+      // +---------------------------------------------------------------------------------
+      // | Add a mouse listener to track the mouse position.
+      // +-------------------------------
+      new MouseHandler(pb.eventCatcher).move(function (e) {
+        var relPos = pb.transformMousePosition(e.params.pos.x, e.params.pos.y);
+        stats.mouseX = relPos.x;
+        stats.mouseY = relPos.y;
+      });
+    } catch (e) {
+      console.error("Failed to initialize stats and/or mouse handler.", e);
+    }
 
     // Use a helper function to build all demo-drawables.
     var drawables = createDemoDrawables(pb, "example-image.png", function () {