plotboilerplate 1.28.0 → 1.29.0

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

@@ -0,0 +1,73 @@
+"use strict";
+/**
+ * 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
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.minimalEnclosingCircleFromPoints = void 0;
+var Circle_1 = require("../../Circle");
+var Triangle_1 = require("../../Triangle");
+var VertTuple_1 = require("../../VertTuple");
+var Vertex_1 = require("../../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.
+ */
+var minimalEnclosingCircleFromPoints = function (points) {
+    if (points.length <= 1) {
+        return null;
+    }
+    var circleObject = wetzlsAlgorithm(points);
+    return new Circle_1.Circle(new Vertex_1.Vertex(circleObject.center.x, circleObject.center.y), circleObject.radius);
+};
+exports.minimalEnclosingCircleFromPoints = minimalEnclosingCircleFromPoints;
+/**
+ * This initiates the actual algorithm but return a shallow circle representation.
+ *
+ * @param points
+ * @returns
+ */
+var wetzlsAlgorithm = function (points) {
+    return minimumContainingCircle(points, points.length, [], 0);
+};
+/**
+ * Pre: points.length >= 2
+ * @param {Vertex[]} points
+ * @param n
+ * @param boundary
+ * @param boundaryLength
+ * @returns
+ */
+var minimumContainingCircle = function (points, n, boundary, boundaryLength) {
+    if (boundaryLength === 3) {
+        return Triangle_1.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_1.VertTuple.vtutils.calcCircumcircle(boundary[0], boundary[1]);
+    }
+    else if (n === 1 && boundaryLength === 1) {
+        return VertTuple_1.VertTuple.vtutils.calcCircumcircle(boundary[0], points[0]);
+    }
+    else {
+        var localCircle = minimumContainingCircle(points, n - 1, boundary, boundaryLength);
+        if (!Circle_1.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/cjs/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,uCAA+C;AAC/C,2CAA0C;AAC1C,6CAA4C;AAC5C,uCAAsC;AAGtC;;;;;;;GAOG;AACI,IAAM,gCAAgC,GAAG,UAAC,MAAkB;IACjE,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC7C,OAAO,IAAI,eAAM,CAAC,IAAI,eAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;AACnG,CAAC,CAAC;AANW,QAAA,gCAAgC,oCAM3C;AAEF;;;;;GAKG;AACH,IAAM,eAAe,GAAG,UAAC,MAAkB;IACzC,OAAO,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,IAAM,uBAAuB,GAAG,UAAC,MAAkB,EAAE,CAAS,EAAE,QAAoB,EAAE,cAAsB;IAC1G,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,mBAAQ,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,qBAAS,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,qBAAS,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;SAAM,CAAC;QACN,IAAM,WAAW,GAAY,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC9F,IAAI,CAAC,eAAM,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/cjs/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/cjs/utils/algorithms/pointsMinimalContainingCircle.js

@@ -0,0 +1,73 @@
+"use strict";
+/**
+ * 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
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.pointsMinimalContainingCircle = void 0;
+var Circle_1 = require("../../Circle");
+var Triangle_1 = require("../../Triangle");
+var VertTuple_1 = require("../../VertTuple");
+var Vertex_1 = require("../../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.
+ */
+var pointsMinimalContainingCircle = function (points) {
+    if (points.length <= 1) {
+        return null;
+    }
+    var circleObject = wetzlsAlgorithm(points);
+    return new Circle_1.Circle(new Vertex_1.Vertex(circleObject.center.x, circleObject.center.y), circleObject.radius);
+};
+exports.pointsMinimalContainingCircle = pointsMinimalContainingCircle;
+/**
+ * This initiates the actual algorithm but return a shallow circle representation.
+ *
+ * @param points
+ * @returns
+ */
+var wetzlsAlgorithm = function (points) {
+    return minimumContainingCircle(points, points.length, [], 0);
+};
+/**
+ * Pre: points.length >= 2
+ * @param {Vertex[]} points
+ * @param n
+ * @param boundary
+ * @param boundaryLength
+ * @returns
+ */
+var minimumContainingCircle = function (points, n, boundary, boundaryLength) {
+    if (boundaryLength === 3) {
+        return Triangle_1.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_1.VertTuple.vtutils.calcCircumcircle(boundary[0], boundary[1]);
+    }
+    else if (n === 1 && boundaryLength === 1) {
+        return VertTuple_1.VertTuple.vtutils.calcCircumcircle(boundary[0], points[0]);
+    }
+    else {
+        var localCircle = minimumContainingCircle(points, n - 1, boundary, boundaryLength);
+        if (!Circle_1.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/cjs/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,uCAA+C;AAC/C,2CAA0C;AAC1C,6CAA4C;AAC5C,uCAAsC;AAGtC;;;;;;;GAOG;AACI,IAAM,6BAA6B,GAAG,UAAC,MAAkB;IAC9D,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC7C,OAAO,IAAI,eAAM,CAAC,IAAI,eAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;AACnG,CAAC,CAAC;AANW,QAAA,6BAA6B,iCAMxC;AAEF;;;;;GAKG;AACH,IAAM,eAAe,GAAG,UAAC,MAAkB;IACzC,OAAO,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,IAAM,uBAAuB,GAAG,UAAC,MAAkB,EAAE,CAAS,EAAE,QAAoB,EAAE,cAAsB;IAC1G,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,mBAAQ,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,qBAAS,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,qBAAS,CAAC,OAAO,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;SAAM,CAAC;QACN,IAAM,WAAW,GAAY,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QAC9F,IAAI,CAAC,eAAM,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/cjs/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/cjs/utils/algorithms/solveApollonius3.js

@@ -0,0 +1,118 @@
+"use strict";
+/**
+ * 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
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.solveApollonius3 = void 0;
+var Circle_1 = require("../../Circle");
+var Vertex_1 = require("../../Vertex");
+var solveApollonius3 = function (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_1.Circle(new Vertex_1.Vertex(xs, ys), Math.abs(rs));
+};
+exports.solveApollonius3 = solveApollonius3;
+//# sourceMappingURL=solveApollonius3.js.map

package/src/cjs/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,uCAA+C;AAC/C,uCAAsC;AAE/B,IAAM,gBAAgB,GAAG,UAC9B,EAAW,EACX,EAAW,EACX,EAAW,EACX,aAAuB,EACvB,aAAuB,EACvB,aAAuB;IAEvB,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,eAAM,CAAC,IAAI,eAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,CAAC,CAAC;AA5DW,QAAA,gBAAgB,oBA4D3B"}

package/src/esm/Circle.d.ts

@@ -14,7 +14,15 @@
  * @modified 2022-08-23 Added the `closestPoint` function.
  * @modified 2025-04-09 Added the `Circle.move(amount: XYCoords)` method.
  * @modified 2025-04-16 Class `Circle` now implements interface `Intersectable`.
- * @version  1.5.0
+ * @modified 2026-06-10 Adding the utility function `Circle.circleUtils.containsPoint`.
+ * @modified 2026-06-10 Adding the `Circle.clone` method.
+ * @modified 2026-01-13 Adding helper function `Circle.circleUtils.containsPoint` and refactored the member method `containsPoint`.
+ * @modified 2026-07-03 Adding the optional `epsilon` parameter to the `Circle.containsCircle` method.
+ * @modified 2026-07-03 Fixing the `Circle.clone` method; the center had not been cloned at all, this was fixed.
+ * @modified 2026-07-08 Adding the `Circle.setRadius` method (for chaining).
+ * @mofified 2026-07-31 Adding the `radicalAxis(Circle)` method. Added the `Circle.circleUtils.createRadicalAxisHelperCircle` and `.circleDistance` helper methods.
+ * @modified 2026-08-03 Adding `Circle.tangentsFromPoint`.
+ * @version  1.7.0
  **/
 import { Bounds } from "./Bounds";
 import { Line } from "./Line";
@@ -22,6 +30,11 @@ import { Vector } from "./Vector";
 import { VertTuple } from "./VertTuple";
 import { Vertex } from "./Vertex";
 import { IBounded, Intersectable, SVGSerializable, UID, XYCoords } from "./interfaces";
+export interface ICircle {
+    center: XYCoords;
+    radius: number;
+    radius_squared?: number;
+}
 /**
  * @classdesc A simple circle: center point and radius.
  *
@@ -33,7 +46,7 @@ import { IBounded, Intersectable, SVGSerializable, UID, XYCoords } from "./inter
  * @requires UID
  * @requires UIDGenerator
  **/
-export declare class Circle implements IBounded, Intersectable, SVGSerializable {
+export declare class Circle implements IBounded, ICircle, Intersectable, SVGSerializable {
     /**
      * Required to generate proper CSS classes and other class related IDs.
      **/
@@ -75,6 +88,17 @@ export declare class Circle implements IBounded, Intersectable, SVGSerializable
      * @param {number} radius - The radius of the circle.
      */
     constructor(center: Vertex, radius: number);
+    /**
+     * Set the radius of this circle.
+     * The method is meant for chaining, you may also alter the `radius` attribute directly.
+     *
+     * @method setRadius
+     * @param {number} radius - The amount to move.
+     * @instance
+     * @memberof Circle
+     * @return {Circle} this for chaining
+     **/
+    setRadius(radius: number): Circle;
     /**
      * Move the circle by the given amount.
      *
@@ -104,7 +128,7 @@ export declare class Circle implements IBounded, Intersectable, SVGSerializable
      * @memberof Circle
      * @return {boolean} `true` if any only if the given circle is completely inside this circle.
      */
-    containsCircle(circle: Circle): boolean;
+    containsCircle(circle: Circle, epsilon?: number): boolean;
     /**
      * Calculate the distance from this circle to the given line.
      *
@@ -192,6 +216,20 @@ export declare class Circle implements IBounded, Intersectable, SVGSerializable
      * @returns
      */
     lineIntersectionTangents(line: VertTuple<any>, inVectorBoundsOnly?: boolean): Array<Vector>;
+    /**
+     * Calculate the radical axis of this and a different circle.
+     * The two circles must not be co-centric.
+     *
+     * See this article for details:
+     *    https://www.cut-the-knot.org/Curriculum/Geometry/GeoGebra/RadicalAxes.shtml
+     *
+     * @method radicalAxis
+     * @instance
+     * @memberof Circle
+     * @param {Circle} circleB - The second circle to calculated the radical axis for.
+     * @return {Line} A line defining the radical axis of the two circles.
+     **/
+    radicalAxis(circleB: Circle): Line;
     /**
      * Calculate the closest point on the outline of this circle to the given point.
      *
@@ -202,6 +240,27 @@ export declare class Circle implements IBounded, Intersectable, SVGSerializable
      * @return {Vertex} The closest point on this circle.
      **/
     closestPoint(vert: XYCoords): Vertex;
+    /**
+     * Get the two tangent vectors for the given point.
+     * If the point is on or in the circle then null is returned.
+     *
+     * @method tangentsFromPoint
+     * @instance
+     * @memberof Circle
+     * @param {Vertex} vert - The point to find the two tangents for.
+     * @return {[Vector,Vector]} The two tangent vector
+     **/
+    tangentsFromPoint(vert: Vertex): [Vector, Vector];
+    /**
+     * Create a deep copy of this circle.
+     *
+     * @method clone
+     * @return {Circle} A new circle, an exact copy of this one.
+     * @instance
+     * @memberof Circle
+     **/
+    clone(): Circle;
+    static fromICircle(obj: ICircle): Circle;
     /**
      * This function should invalidate any installed listeners and invalidate this object.
      * After calling this function the object might not hold valid data any more and
@@ -210,5 +269,13 @@ export declare class Circle implements IBounded, Intersectable, SVGSerializable
     destroy(): void;
     static circleUtils: {
         vertAt: (angle: number, radius: number) => Vertex;
+        containsPoint: (circleCenter: XYCoords, circleRadius: number, point: XYCoords) => boolean;
+        createRadicalAxisHelperCircle: (circleA: Circle, circleB: Circle) => Circle;
+        /**
+         * Calculate the outer distance between two circles. If the circles touch then the
+         * distance is 0.0.
+         * If the circles intersect then the distance in negative.
+         */
+        circleDistance: (circleA: Circle, circleB: Circle) => number;
     };
 }