plotboilerplate 1.28.1 → 1.29.0

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

@@ -73,8 +73,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.

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 () {

package/src/ts/Circle.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";
@@ -23,8 +31,15 @@ import { UIDGenerator } from "./UIDGenerator";
 import { Vector } from "./Vector";
 import { VertTuple } from "./VertTuple";
 import { Vertex } from "./Vertex";
+import { geomutils } from "./geomutils";
 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.
  *
@@ -36,7 +51,7 @@ import { IBounded, Intersectable, SVGSerializable, UID, XYCoords } from "./inter
  * @requires UID
  * @requires UIDGenerator
  **/
-export class Circle implements IBounded, Intersectable, SVGSerializable {
+export class Circle implements IBounded, ICircle, Intersectable, SVGSerializable {
   /**
    * Required to generate proper CSS classes and other class related IDs.
    **/
@@ -88,6 +103,21 @@ export class Circle implements IBounded, Intersectable, SVGSerializable {
     this.radius = radius;
   }
 
+  /**
+   * 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 {
+    this.radius = radius;
+    return this;
+  }
+
   /**
    * Move the circle by the given amount.
    *
@@ -112,7 +142,8 @@ export class Circle implements IBounded, Intersectable, SVGSerializable {
    * @return {boolean} `true` if the given point is inside this circle.
    */
   containsPoint(point: XYCoords): boolean {
-    return this.center.distance(point) < this.radius;
+    // return this.center.distance(point) < this.radius;//
+    return Circle.circleUtils.containsPoint(this.center, this.radius, point);
   }
 
   /**
@@ -124,8 +155,12 @@ export 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 {
-    return this.center.distance(circle.center) + circle.radius < this.radius;
+  containsCircle(circle: Circle, epsilon?: number): boolean {
+    if (typeof epsilon === "undefined" || Number.isNaN(epsilon)) {
+      return this.center.distance(circle.center) + circle.radius < this.radius;
+    } else {
+      return this.center.distance(circle.center) + circle.radius < this.radius + Math.abs(epsilon);
+    }
   }
 
   /**
@@ -347,6 +382,43 @@ export class Circle implements IBounded, Intersectable, SVGSerializable {
   }
   //--- END --- Implement interface `Intersectable`
 
+  /**
+   * 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 {
+    var helperCircle = Circle.circleUtils.createRadicalAxisHelperCircle(this, circleB);
+    var intersectionLineA = this.circleIntersection(helperCircle);
+    var intersectionLineB = circleB.circleIntersection(helperCircle);
+    var intersection = this.circleIntersection(circleB);
+
+    if (!intersectionLineA || !intersectionLineB) {
+      console.error("Critical error: none of the two intersections must be null.");
+      return intersection; // Fallback
+    }
+    var lineA = new Line(intersectionLineA.a, intersectionLineA.b);
+    var lineB = new Line(intersectionLineB.a, intersectionLineB.b);
+    var firstRadicalAxisPoint = lineA.intersection(lineB);
+    var centerConnectLine = new Line(this.center, circleB.center);
+    var secondRadicalAxisPoint = centerConnectLine.getClosestPoint(firstRadicalAxisPoint);
+    // Create a mirrored version of the second radical axis point so both are located
+    // symmetrical from the circle connect point.
+    // (currently the second point is located ON the connect line)
+    var secondRadicalAxisPoint_mirrored = secondRadicalAxisPoint.clone().scale(2.0, firstRadicalAxisPoint);
+
+    var radicalAxis = new Line(firstRadicalAxisPoint, secondRadicalAxisPoint_mirrored);
+    return intersection && intersection.length() > radicalAxis.length() ? intersection : radicalAxis;
+  }
+
   /**
    * Calculate the closest point on the outline of this circle to the given point.
    *
@@ -370,6 +442,77 @@ export class Circle implements IBounded, Intersectable, SVGSerializable {
     }
   }
 
+  /**
+   * 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] {
+    // Inspired by
+    //   https://www.omnicalculator.com/math/tangent-circle
+    const centerDistance: number = this.center.distance(vert);
+    const tangentLength: number = Math.sqrt(centerDistance * centerDistance - this.radius * this.radius);
+    // console.log("this.radius ", this.radius, "centerDistance", centerDistance, "tangentLength", tangentLength);
+    if (Number.isNaN(tangentLength)) {
+      // vertex is inside circle
+      console.log("tangentLength is NaN", tangentLength);
+      return null;
+    }
+
+    const helperCircle = new Circle(vert, tangentLength);
+    const intersection = this.circleIntersection(helperCircle);
+    if (!intersection) {
+      // No intersection (vertex is inside circle)
+      return null;
+    }
+
+    return [new Vector(intersection.a, vert), new Vector(intersection.b, vert)];
+  }
+
+  /**
+   * 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 {
+    return new Circle(this.center.clone(), this.radius);
+  }
+
+  static fromICircle(obj: ICircle): Circle {
+    return new Circle(new Vertex(obj.center), obj.radius);
+  }
+
+  // static fromObject(obj: object): Circle {
+  //   if (!obj) {
+  //     return null;
+  //   }
+  //   if (typeof obj !== "object") {
+  //     return null;
+  //   }
+  //   if (!obj.hasOwnProperty("center") || typeof (obj as any).center != "object") {
+  //     return null;
+  //   }
+  //   if (!obj.hasOwnProperty("radius") || typeof !(obj as any).radius != "number") {
+  //     return null;
+  //   }
+  //   var center = (obj as any).center;
+  //   if (!center.hasOwnProperty("x") || typeof (center as any).x != "number") {
+  //     return null;
+  //   }
+  //   if (!center.hasOwnProperty("y") || typeof (center as any).y != "number") {
+  //     return null;
+  //   }
+  //   return new Circle(new Vertex(center), (obj as any).radius);
+  // }
+
   /**
    * 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
@@ -385,6 +528,36 @@ export class Circle implements IBounded, Intersectable, SVGSerializable {
       /* return new Vertex( Math.sin(angle) * radius,
 			       Math.cos(angle) * radius ); */
       return new Vertex(Math.cos(angle) * radius, Math.sin(angle) * radius);
+    },
+
+    containsPoint: (circleCenter: XYCoords, circleRadius: number, point: XYCoords): boolean => {
+      // TODO: cleanup
+      // return (
+      //   (circle.center.x - point.x) * (circle.center.x - point.x) + (circle.center.y - point.y) * (circle.center.y - point.y) <=
+      //   circle.radius * circle.radius
+      // );
+      return geomutils.dist4(point.x, point.y, circleCenter.x, circleCenter.y) < circleRadius;
+    },
+
+    createRadicalAxisHelperCircle: (circleA: Circle, circleB: Circle): Circle => {
+      // We need to create a helper circle that intersects BOTH other circles,
+      // each in TWO points.
+      var circleConnectLine = new Vector(circleA.center.clone(), circleB.center);
+      circleConnectLine.a.set(circleConnectLine.vertAt(0.5));
+      // Get the perpendicular by half the circle distance.
+      var bisector = circleConnectLine.perp();
+      var bisectorLength = Math.max(circleA.radius, circleB.radius, bisector.length());
+      bisector.setLength(bisectorLength);
+      return new Circle(bisector.b, bisector.b.distance(circleA.center));
+    },
+
+    /**
+     * 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 => {
+      return circleA.center.distance(circleB.center) - circleA.radius - circleB.radius;
     }
   };
 } // END class