flo-mat 4.1.4 → 5.0.1

package/node/add-n-prong.ts/join-spokes.js

@@ -1,3 +1,4 @@
+const { atan2 } = Math;
 function joinSpokes(circle, cpNodes) {
     cpNodes = cpNodes.slice().sort(byAngle(circle));
     const len = cpNodes.length;
@@ -16,8 +17,8 @@ function byAngle(circle) {
         // Move onto origin
         a = [a[0] - c[0], a[1] - c[1]];
         b = [b[0] - c[0], b[1] - c[1]];
-        const a_ = Math.atan2(a[1], a[0]);
-        const b_ = Math.atan2(b[1], b[0]);
+        const a_ = atan2(a[1], a[0]);
+        const b_ = atan2(b[1], b[0]);
         return b_ - a_;
     };
 }

package/node/add-n-prong.ts/join-spokes.js.map

@@ -1 +1 @@
-{"version":3,"file":"join-spokes.js","sourceRoot":"","sources":["../../src/add-n-prong.ts/join-spokes.ts"],"names":[],"mappings":"AAKA,SAAS,UAAU,CACX,MAAc,EACd,OAAiB;IAErB,OAAO,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAEhD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAoB,CAAC;QAC7C,MAAM,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAC,GAAG,CAAC,CAAC;IACrD,CAAC;AACL,CAAC;AAGD,gBAAgB;AAChB,SAAS,OAAO,CAAC,MAAc;IAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,OAAO,UAAS,EAAU,EAAE,EAAU;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAE1B,mBAAmB;QACnB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAElC,OAAO,EAAE,GAAG,EAAE,CAAC;IACnB,CAAC,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,UAAU,EAAE,CAAA"}
+{"version":3,"file":"join-spokes.js","sourceRoot":"","sources":["../../src/add-n-prong.ts/join-spokes.ts"],"names":[],"mappings":"AAIA,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;AAGvB,SAAS,UAAU,CACX,MAAc,EACd,OAAiB;IAErB,OAAO,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAEhD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAoB,CAAC;QAC7C,MAAM,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,CAAC,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAC,GAAG,CAAC,CAAC;IACrD,CAAC;AACL,CAAC;AAGD,gBAAgB;AAChB,SAAS,OAAO,CAAC,MAAc;IAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,OAAO,UAAS,EAAU,EAAE,EAAU;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAE1B,mBAAmB;QACnB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7B,OAAO,EAAE,GAAG,EAAE,CAAC;IACnB,CAAC,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,UAAU,EAAE,CAAA"}

package/node/closest-boundary-point/cull-curve-pieces.d.ts

@@ -0,0 +1,21 @@
+import type { CurvePiece } from '../mat/curve-piece.js';
+/**
+ * Returns the given curve pieces with those culled whose closest possible
+ * point to `p` is further than `sqrt(maxSquaredDistance)` away.
+ *
+ * * a piece is kept only if both its (cheap, axis-aligned) loose bounding box
+ *   and then its (rotated) tight bounding box come within the distance
+ * * the bounding boxes are those of the entire curves (not just the pieces)
+ *   and are memoized per curve
+ * * the given array is not modified (callers may reuse it for other points)
+ * * any tolerance for floating point error is the responsibility of the
+ *   caller (i.e. `maxSquaredDistance` should already include it)
+ *
+ * @param curvePieces the curve pieces to cull
+ * @param p the point
+ * @param maxSquaredDistance the squared distance beyond which to cull
+ *
+ * @internal
+ */
+declare function cullCurvePieces(curvePieces: CurvePiece[], p: number[], maxSquaredDistance: number): CurvePiece[];
+export { cullCurvePieces };

package/node/closest-boundary-point/cull-curve-pieces.js

@@ -0,0 +1,40 @@
+import { getBoundingBox$, getBoundingBoxTight$ } from '../geometry/get-bounding-box-.js';
+import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
+import { getClosestSquaredDistanceToRotatedRect } from '../geometry/get-closest-squared-distance-to-rotated-rect.js';
+/**
+ * Returns the given curve pieces with those culled whose closest possible
+ * point to `p` is further than `sqrt(maxSquaredDistance)` away.
+ *
+ * * a piece is kept only if both its (cheap, axis-aligned) loose bounding box
+ *   and then its (rotated) tight bounding box come within the distance
+ * * the bounding boxes are those of the entire curves (not just the pieces)
+ *   and are memoized per curve
+ * * the given array is not modified (callers may reuse it for other points)
+ * * any tolerance for floating point error is the responsibility of the
+ *   caller (i.e. `maxSquaredDistance` should already include it)
+ *
+ * @param curvePieces the curve pieces to cull
+ * @param p the point
+ * @param maxSquaredDistance the squared distance beyond which to cull
+ *
+ * @internal
+ */
+function cullCurvePieces(curvePieces, p, maxSquaredDistance) {
+    const culled = [];
+    for (let i = 0; i < curvePieces.length; i++) {
+        const curvePiece = curvePieces[i];
+        const { ps } = curvePiece.curve;
+        const d = getClosestSquareDistanceToRect(getBoundingBox$(ps), p);
+        if (d > maxSquaredDistance) {
+            continue;
+        }
+        const d2 = getClosestSquaredDistanceToRotatedRect(getBoundingBoxTight$(ps), p);
+        if (d2 > maxSquaredDistance) {
+            continue;
+        }
+        culled.push(curvePiece);
+    }
+    return culled;
+}
+export { cullCurvePieces };
+//# sourceMappingURL=cull-curve-pieces.js.map

package/node/closest-boundary-point/cull-curve-pieces.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cull-curve-pieces.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-curve-pieces.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,oBAAoB,EAAE,MAAM,kCAAkC,CAAC;AACzF,OAAO,EAAE,8BAA8B,EAAE,MAAM,oDAAoD,CAAC;AACpG,OAAO,EAAE,sCAAsC,EAAE,MAAM,6DAA6D,CAAC;AAGrH;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAS,eAAe,CAChB,WAAyB,EACzB,CAAW,EACX,kBAA0B;IAE9B,MAAM,MAAM,GAAiB,EAAE,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC;QAEhC,MAAM,CAAC,GAAG,8BAA8B,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,GAAG,kBAAkB,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QAEzC,MAAM,EAAE,GAAG,sCAAsC,CAAC,oBAAoB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,EAAE,GAAG,kBAAkB,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QAE1C,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/closest-boundary-point/get-close-boundary-points-certified.js

@@ -1,5 +1,6 @@
 import { getPotentialClosestPointsOnCurveCertified } from './get-potential-closest-points-on-curve-certified.js';
-import { cullCurvePieces1 } from './cull-bezier-pieces-1.js';
+import { cullCurvePieces } from './cull-curve-pieces.js';
+import { getBestDistanceSquared } from './get-best-distance-squared.js';
 import { toP } from '../point-on-shape/to-p.js';
 /**
  * Returns the closest boundary point to the given point, limited to the given
@@ -12,7 +13,9 @@ import { toP } from '../point-on-shape/to-p.js';
  * @internal
  */
 function getCloseBoundaryPointsCertified(curvePieces, x) {
-    curvePieces = cullCurvePieces1(curvePieces, x);
+    // cull the pieces that cannot contain the closest point (the best
+    // squared distance already includes a floating point tolerance)
+    curvePieces = cullCurvePieces(curvePieces, x, getBestDistanceSquared(curvePieces, x));
     const pInfos = [];
     for (let i = 0; i < curvePieces.length; i++) {
         const curvePiece = curvePieces[i];

package/node/closest-boundary-point/get-close-boundary-points-certified.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-close-boundary-points-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-close-boundary-points-certified.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,yCAAyC,EAAE,MAAM,sDAAsD,CAAC;AACjH,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,GAAG,EAAE,MAAM,2BAA2B,CAAC;AAGhD;;;;;;;;;GASG;AACH,SAAS,+BAA+B,CAChC,WAAyB,EACzB,CAAW;IAEf,WAAW,GAAG,gBAAgB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAE/C,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAElC,MAAM,OAAO,GAAG,yCAAyC,CACrD,UAAU,CAAC,KAAK,EAChB,CAAC,EACD,UAAU,CAAC,EAAqB,CACnC,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;IAC5B,CAAC;IAED,qCAAqC;IACrC,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,KAAK,CAAC;QACnB,CAAC;IACL,CAAC;IAED,MAAM,iBAAiB,GAA0B,EAAE,CAAC;IAEpD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAC9B,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED,OAAO,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QAChC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;QAC1B,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;QACrB,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAEnC,OAAO;YACH,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG;SACpC,CAAC;IACN,CAAC,CAAC,CAAC;AACP,CAAC;AAGD,OAAO,EAAE,+BAA+B,EAAE,CAAC"}
+{"version":3,"file":"get-close-boundary-points-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-close-boundary-points-certified.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,yCAAyC,EAAE,MAAM,sDAAsD,CAAC;AACjH,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EAAE,GAAG,EAAE,MAAM,2BAA2B,CAAC;AAGhD;;;;;;;;;GASG;AACH,SAAS,+BAA+B,CAChC,WAAyB,EACzB,CAAW;IAEf,kEAAkE;IAClE,gEAAgE;IAChE,WAAW,GAAG,eAAe,CAAC,WAAW,EAAE,CAAC,EAAE,sBAAsB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;IAEtF,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAElC,MAAM,OAAO,GAAG,yCAAyC,CACrD,UAAU,CAAC,KAAK,EAChB,CAAC,EACD,UAAU,CAAC,EAAqB,CACnC,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;IAC5B,CAAC;IAED,qCAAqC;IACrC,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,KAAK,CAAC;QACnB,CAAC;IACL,CAAC;IAED,MAAM,iBAAiB,GAA0B,EAAE,CAAC;IAEpD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAC9B,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED,OAAO,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QAChC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;QAC1B,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;QACrB,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAEnC,OAAO;YACH,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG;SACpC,CAAC;IACN,CAAC,CAAC,CAAC;AACP,CAAC;AAGD,OAAO,EAAE,+BAA+B,EAAE,CAAC"}

package/node/closest-boundary-point/get-endpoint-info.d.ts

@@ -0,0 +1,39 @@
+import type { Curve } from "flo-boolean";
+import type { FootAndEndpointInfo } from './foot-and-endpoint-info.js';
+/**
+ * Returns the `FootAndEndpointInfo` of the endpoint at parameter `t` of the
+ * given curve, i.e. the certified interval `dSquaredI` guaranteed to contain
+ * the squared distance from `x` to the point on the curve at `t` (`t` taken as
+ * exact).
+ *
+ * * the point is kept in double-double precision (including its evaluation
+ *   error bound) until the differences with `x` have been taken, so the only
+ *   rounding left is that of forming the interval in double precision, which
+ *   is accounted for exactly below
+ *
+ * Error analysis (`u = eps/2` the unit roundoff, `fl(a∘b) = (a∘b)(1+δ)`,
+ * `|δ| <= u`): let `a` be the exact magnitude of the double-double difference
+ * `dx` and `Δx` the true (exact) difference. Then
+ * * `|Δx| ∈ [a(1-ρ) - ex, a(1+ρ) + ex]` with `ρ = 2u²` (the relative error
+ *   bound of the double-double minus double subtraction) and `ex` the
+ *   evaluation error bound on the coordinate
+ * * `ax = |hi(dx)|` satisfies `|ax - a| <= u·ax` (the low part of a
+ *   normalized double-double is at most half an ulp of the high part)
+ * * the upper bound `(ax+ex)² + (ay+ey)²` is then computed with 3 roundings
+ *   (addition, square, sum) and widened with 1 more; it must dominate
+ *   `(a(1+ρ)+ex)² + ...` which requires `(1-u)⁴(1+WIDEN) >= (1+u+ρ)²`, i.e.
+ *   `WIDEN >= 6u + O(u²)`
+ * * the lower bound `(ax-ex)₊² + (ay-ey)₊²` likewise requires
+ *   `(1+u)⁴(1-WIDEN) <= (1-u-ρ)²`, i.e. `WIDEN >= 6u + O(u²)`, *except* that
+ *   when the true term is `0` (`a <= ex`) rounding may still leave
+ *   `ax - ex <= ax·u` positive, giving a spurious `(ax-ex)² <= 2u²·ax²`; this
+ *   is covered by subtracting `SLACK·(ax² + ay²)` with `SLACK >= 2u²`
+ *
+ * @param curve the curve
+ * @param x the point from which to check
+ * @param t the parameter value of the endpoint
+ *
+ * @internal
+ */
+declare function getEndpointInfoCertified(curve: Curve, x: number[], t: number): FootAndEndpointInfo;
+export { getEndpointInfoCertified };

package/node/closest-boundary-point/get-endpoint-info.js

@@ -0,0 +1,78 @@
+import { evalDeCasteljauWithErrDd } from 'flo-bezier3';
+import { ddDiffDouble } from 'double-double';
+import { eps } from '../error-analysis/gamma.js';
+const { abs, max } = Math;
+/**
+ * Relative widening of the interval bounds - see the error analysis in
+ * `getEndpointInfoCertified`: the exact first order requirement is `6u = 3eps`
+ * (`u = eps/2` the unit roundoff); `4eps = 2**-50` (exactly representable)
+ * leaves room for the `O(u²)` terms.
+ */
+const WIDEN = 4 * eps;
+/**
+ * Absolute slack (relative to `ax² + ay²`) for the lower bound - see the error
+ * analysis: the exact first order requirement is `2u² = eps²/2`.
+ */
+const SLACK = eps * eps;
+/**
+ * Returns the `FootAndEndpointInfo` of the endpoint at parameter `t` of the
+ * given curve, i.e. the certified interval `dSquaredI` guaranteed to contain
+ * the squared distance from `x` to the point on the curve at `t` (`t` taken as
+ * exact).
+ *
+ * * the point is kept in double-double precision (including its evaluation
+ *   error bound) until the differences with `x` have been taken, so the only
+ *   rounding left is that of forming the interval in double precision, which
+ *   is accounted for exactly below
+ *
+ * Error analysis (`u = eps/2` the unit roundoff, `fl(a∘b) = (a∘b)(1+δ)`,
+ * `|δ| <= u`): let `a` be the exact magnitude of the double-double difference
+ * `dx` and `Δx` the true (exact) difference. Then
+ * * `|Δx| ∈ [a(1-ρ) - ex, a(1+ρ) + ex]` with `ρ = 2u²` (the relative error
+ *   bound of the double-double minus double subtraction) and `ex` the
+ *   evaluation error bound on the coordinate
+ * * `ax = |hi(dx)|` satisfies `|ax - a| <= u·ax` (the low part of a
+ *   normalized double-double is at most half an ulp of the high part)
+ * * the upper bound `(ax+ex)² + (ay+ey)²` is then computed with 3 roundings
+ *   (addition, square, sum) and widened with 1 more; it must dominate
+ *   `(a(1+ρ)+ex)² + ...` which requires `(1-u)⁴(1+WIDEN) >= (1+u+ρ)²`, i.e.
+ *   `WIDEN >= 6u + O(u²)`
+ * * the lower bound `(ax-ex)₊² + (ay-ey)₊²` likewise requires
+ *   `(1+u)⁴(1-WIDEN) <= (1-u-ρ)²`, i.e. `WIDEN >= 6u + O(u²)`, *except* that
+ *   when the true term is `0` (`a <= ex`) rounding may still leave
+ *   `ax - ex <= ax·u` positive, giving a spurious `(ax-ex)² <= 2u²·ax²`; this
+ *   is covered by subtracting `SLACK·(ax² + ay²)` with `SLACK >= 2u²`
+ *
+ * @param curve the curve
+ * @param x the point from which to check
+ * @param t the parameter value of the endpoint
+ *
+ * @internal
+ */
+function getEndpointInfoCertified(curve, x, t) {
+    const { ps } = curve;
+    // the point in double-double precision with coordinate-wise absolute
+    // error bounds `pE`
+    const { p: pDd, pE } = evalDeCasteljauWithErrDd(ps, [0, t]);
+    // the coordinate differences in double-double precision
+    const dx = ddDiffDouble(pDd[0], x[0]);
+    const dy = ddDiffDouble(pDd[1], x[1]);
+    const ax = abs(dx[1]);
+    const ay = abs(dy[1]);
+    const [ex, ey] = pE;
+    const lo = max(ax - ex, 0) ** 2 + max(ay - ey, 0) ** 2;
+    const hi = (ax + ex) ** 2 + (ay + ey) ** 2;
+    const dSquaredI = [
+        max(lo * (1 - WIDEN) - SLACK * (ax * ax + ay * ay), 0),
+        hi * (1 + WIDEN)
+    ];
+    const t_ = t === 0 ? 1 : t;
+    const curve_ = t === 0 ? curve.prev : curve;
+    return {
+        curve: curve_,
+        t: t_,
+        dSquaredI
+    };
+}
+export { getEndpointInfoCertified };
+//# sourceMappingURL=get-endpoint-info.js.map

package/node/closest-boundary-point/get-endpoint-info.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-endpoint-info.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-endpoint-info.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,EAAE,GAAG,EAAE,MAAM,4BAA4B,CAAC;AAEjD,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAE1B;;;;;GAKG;AACH,MAAM,KAAK,GAAG,CAAC,GAAC,GAAG,CAAC;AACpB;;;GAGG;AACH,MAAM,KAAK,GAAG,GAAG,GAAC,GAAG,CAAC;AAGtB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,SAAS,wBAAwB,CACzB,KAAY,EACZ,CAAW,EACX,CAAS;IAEb,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IAErB,qEAAqE;IACrE,oBAAoB;IACpB,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,wBAAwB,CAAC,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;IAE3D,wDAAwD;IACxD,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtC,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;IAEpB,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,IAAE,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,IAAE,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC;IAEvC,MAAM,SAAS,GAAG;QACd,GAAG,CAAC,EAAE,GAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,GAAC,CAAC,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9C,EAAE,GAAC,CAAC,CAAC,GAAG,KAAK,CAAC;KACjB,CAAC;IAEF,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IAE5C,OAAO;QACH,KAAK,EAAE,MAAM;QACb,CAAC,EAAE,EAAE;QACL,SAAS;KACZ,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,wBAAwB,EAAE,CAAA"}

package/node/closest-boundary-point/get-potential-closest-points-on-curve-certified.js

@@ -1,8 +1,7 @@
 import { roots } from 'flo-poly';
-import { evalDeCasteljauDd, getFootPointsOnBezierPolysCertified, getIntervalBox } from 'flo-bezier3';
+import { getFootPointsOnBezierPolysCertified, getIntervalBox } from 'flo-bezier3';
 import { rootIntervalToDistanceSquaredInterval } from './root-interval-to-distance-squared-interval.js';
-import { squaredDistanceBetweenDd } from "../find-2-prong/squared-distance-between-dd.js";
-import { eps } from '../error-analysis/gamma.js';
+import { getEndpointInfoCertified } from './get-endpoint-info.js';
 /**
  * @internal
  *
@@ -31,22 +30,9 @@ function getPotentialClosestPointsOnCurveCertified(curve, x, tRange) {
             };
         }));
     }
-    const ts = tRange.slice();
-    if (tS === tE) {
-        ts.push(tS);
-    }
-    infos.push(...ts.map(t => {
-        const p = evalDeCasteljauDd(ps, [0, t]).map(v => v[0] + v[1]);
-        const d = squaredDistanceBetweenDd(p, x);
-        const dSquaredI = [d * (1 - eps), d * (1 + eps)];
-        const t_ = t === 0 ? 1 : t;
-        const curve_ = t === 0 ? curve.prev : curve;
-        return {
-            curve: curve_,
-            t: t_,
-            dSquaredI
-        };
-    }));
+    // the endpoints of the range (just the one if the range is a single point)
+    const ts = tS === tE ? [tS] : [tS, tE];
+    infos.push(...ts.map(t => getEndpointInfoCertified(curve, x, t)));
     return infos;
 }
 export { getPotentialClosestPointsOnCurveCertified };

package/node/closest-boundary-point/get-potential-closest-points-on-curve-certified.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-potential-closest-points-on-curve-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-potential-closest-points-on-curve-certified.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,iBAAiB,EAAE,mCAAmC,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AACrG,OAAO,EAAE,qCAAqC,EAAE,MAAM,iDAAiD,CAAC;AACxG,OAAO,EAAE,wBAAwB,EAAE,MAAM,gDAAgD,CAAC;AAC1F,OAAO,EAAE,GAAG,EAAE,MAAM,4BAA4B,CAAC;AAGjD;;;;;;GAMG;AACH,SAAS,yCAAyC,CAC1C,KAAY,EACZ,CAAW,EACX,MAAwB;IAE5B,MAAM,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,MAAM,CAAC;IACvB,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IAErB,MAAM,KAAK,GAA0B,EAAE,CAAC;IAExC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACZ,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,GAC5C,mCAAmC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE/C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC;QAEzD,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACvB,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;YAErC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAEvC,MAAM,GAAG,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAEzC,MAAM,SAAS,GAAG,qCAAqC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEhE,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;YAE5C,OAAO;gBACH,KAAK,EAAE,MAAM;gBACb,CAAC,EAAE,EAAE;gBACL,SAAS;aACZ,CAAA;QACL,CAAC,CAAC,CAAC,CAAC;IACR,CAAC;IAED,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;IAC1B,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACZ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACrB,MAAM,CAAC,GAAG,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7D,MAAM,CAAC,GAAG,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEzC,MAAM,SAAS,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAE7C,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;QAE5C,OAAO;YACH,KAAK,EAAE,MAAM;YACb,CAAC,EAAE,EAAE;YACL,SAAS;SACZ,CAAA;IACL,CAAC,CAAC,CAAC,CAAC;IAEJ,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,yCAAyC,EAAE,CAAA"}
+{"version":3,"file":"get-potential-closest-points-on-curve-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-potential-closest-points-on-curve-certified.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,mCAAmC,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClF,OAAO,EAAE,qCAAqC,EAAE,MAAM,iDAAiD,CAAC;AACxG,OAAO,EAAE,wBAAwB,EAAE,MAAM,wBAAwB,CAAC;AAGlE;;;;;;GAMG;AACH,SAAS,yCAAyC,CAC1C,KAAY,EACZ,CAAW,EACX,MAAwB;IAE5B,MAAM,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,MAAM,CAAC;IACvB,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IAErB,MAAM,KAAK,GAA0B,EAAE,CAAC;IAExC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACZ,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,GAC5C,mCAAmC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE/C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC;QAEzD,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACvB,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;YAErC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAEvC,MAAM,GAAG,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAEzC,MAAM,SAAS,GAAG,qCAAqC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEhE,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;YAE5C,OAAO;gBACH,KAAK,EAAE,MAAM;gBACb,CAAC,EAAE,EAAE;gBACL,SAAS;aACZ,CAAA;QACL,CAAC,CAAC,CAAC,CAAC;IACR,CAAC;IAED,2EAA2E;IAC3E,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAEvC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAElE,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,yCAAyC,EAAE,CAAA"}

package/node/closest-boundary-point/root-interval-to-distance-squared-interval.d.ts

@@ -1,11 +1,23 @@
 /**
- * Returns the distance interval squared given the root interval (currently
- * ignoring multiplicity).
+ * Returns an interval `[min, max]` guaranteed to contain the squared distance
+ * from the point `p` to *any* point of a curve piece, given an axis-aligned
+ * box that is guaranteed to engulf that piece (see `getIntervalBox`).
  *
- * * the result is returned as `[minPossibleSquared, maxPossibleSquared]` distance.
+ * * the minimum squared distance to the box is attained on its boundary (or
+ *   is `0` if `p` is inside): per axis the distance is the gap between `p` and
+ *   the box's range on that axis (`0` if `p` is within the range)
+ * * the maximum squared distance to the box is attained at a corner: per axis
+ *   it is the larger of the distances to the two range ends
  *
- * @param box
- * @param p
+ * Error analysis (`u = eps/2` the unit roundoff, `fl(a∘b) = (a∘b)(1+δ)`,
+ * `|δ| <= u`): all inputs are doubles and each bound is computed with 3
+ * roundings per term path (subtraction, square, sum - `max` is exact) and
+ * widened with 1 more, so the computed bound is within a factor `(1±u)⁴` of
+ * the exact one before widening and `WIDEN >= 4u + O(u²)` makes the interval
+ * rigorous. (A gap of `0` is exact: `fl(a-b)` has the sign of `a-b`.)
+ *
+ * @param box the engulfing box given as `[[minX, minY], [maxX, maxY]]`
+ * @param p the point
  *
  * @internal
  */

package/node/closest-boundary-point/root-interval-to-distance-squared-interval.js

@@ -1,60 +1,47 @@
-import { twoDiff, ddMultDd, ddAddDd } from 'double-double';
-const td = twoDiff;
-const qmq = ddMultDd;
-const qaq = ddAddDd;
-const eps = Number.EPSILON;
+import { eps } from '../error-analysis/gamma.js';
+const { max } = Math;
 /**
- * Returns the distance interval squared given the root interval (currently
- * ignoring multiplicity).
+ * Relative widening of the interval bounds - see the error analysis in
+ * `rootIntervalToDistanceSquaredInterval`: the exact first order requirement
+ * is `4u = 2eps` (`u = eps/2` the unit roundoff); `4eps = 2**-50` (exactly
+ * representable) leaves room for the `O(u²)` terms.
+ */
+const WIDEN = 4 * eps;
+/**
+ * Returns an interval `[min, max]` guaranteed to contain the squared distance
+ * from the point `p` to *any* point of a curve piece, given an axis-aligned
+ * box that is guaranteed to engulf that piece (see `getIntervalBox`).
+ *
+ * * the minimum squared distance to the box is attained on its boundary (or
+ *   is `0` if `p` is inside): per axis the distance is the gap between `p` and
+ *   the box's range on that axis (`0` if `p` is within the range)
+ * * the maximum squared distance to the box is attained at a corner: per axis
+ *   it is the larger of the distances to the two range ends
  *
- * * the result is returned as `[minPossibleSquared, maxPossibleSquared]` distance.
+ * Error analysis (`u = eps/2` the unit roundoff, `fl(a∘b) = (a∘b)(1+δ)`,
+ * `|δ| <= u`): all inputs are doubles and each bound is computed with 3
+ * roundings per term path (subtraction, square, sum - `max` is exact) and
+ * widened with 1 more, so the computed bound is within a factor `(1±u)⁴` of
+ * the exact one before widening and `WIDEN >= 4u + O(u²)` makes the interval
+ * rigorous. (A gap of `0` is exact: `fl(a-b)` has the sign of `a-b`.)
  *
- * @param box
- * @param p
+ * @param box the engulfing box given as `[[minX, minY], [maxX, maxY]]`
+ * @param p the point
  *
  * @internal
  */
 function rootIntervalToDistanceSquaredInterval(box, p) {
-    const bl = box[0];
-    const tr = box[1];
-    const minX = bl[0];
-    const minY = bl[1];
-    const maxX = tr[0];
-    const maxY = tr[1];
-    const x = p[0]; // <0>
-    const y = p[1]; // <0>
-    let minDSquared = +Infinity;
-    let maxDSquared = -Infinity;
-    // for each corner of the interval box
-    for (const [a, b] of [[minX, minY], [minX, maxY], [maxX, minY], [maxX, maxY]]) {
-        /*
-        // distance to 1st corner of interval box - `distance² = x² + y²`
-        const dc1 = (a - x)**2 + (b - y)**2;
-        // max absolute roundoff error of `dc1`
-        // <4>dc1 <-- <4>(<3>(<1>(a - x)**2) + <3>(<1>((b - y)**2))
-        const dc1E = 4*γ1*((a + x)**2 + (b + y)**2);
-        const dc1Min = dc1 - dc1E;  // distance minus max error
-        const dc1Max = dc1 + dc1E;  // distance plus max error
-        */
-        /** distance to 1st corner of interval box - `distance² = x² + y²` */
-        const ax = td(a, x); // a - x
-        const by = td(b, y); // b - y
-        // const dc1Exact = eadd(emult(ax,ax),emult(by,by));  // ax**2 + bx**2
-        // const dc1 = estimate(dc1Exact);
-        const dc1Dd = qaq(qmq(ax, ax), qmq(by, by)); // ax**2 + bx**2
-        const dc1 = dc1Dd[1];
-        // const dc1Min = dc1*(1 - 2**maxCoordPowerOf2*eps);  // distance minus max error
-        // const dc1Max = dc1*(1 + 2**maxCoordPowerOf2*eps);  // distance plus max error
-        const dc1Min = dc1 * (1 - eps); // distance minus max error
-        const dc1Max = dc1 * (1 + eps); // distance plus max error
-        if (dc1Min <= minDSquared) {
-            minDSquared = dc1Min;
-        }
-        if (dc1Max >= maxDSquared) {
-            maxDSquared = dc1Max;
-        }
-    }
-    return [minDSquared, maxDSquared];
+    const [[minX, minY], [maxX, maxY]] = box;
+    const [x, y] = p;
+    // per axis gap between `p` and the box (`0` if `p` is within range)
+    const dxMin = max(minX - x, 0, x - maxX);
+    const dyMin = max(minY - y, 0, y - maxY);
+    // per axis distance from `p` to the furthest end of the box's range
+    const dxMax = max(x - minX, maxX - x);
+    const dyMax = max(y - minY, maxY - y);
+    const minDSquared = dxMin * dxMin + dyMin * dyMin;
+    const maxDSquared = dxMax * dxMax + dyMax * dyMax;
+    return [minDSquared * (1 - WIDEN), maxDSquared * (1 + WIDEN)];
 }
 export { rootIntervalToDistanceSquaredInterval };
 //# sourceMappingURL=root-interval-to-distance-squared-interval.js.map

package/node/closest-boundary-point/root-interval-to-distance-squared-interval.js.map

@@ -1 +1 @@
-{"version":3,"file":"root-interval-to-distance-squared-interval.js","sourceRoot":"","sources":["../../src/closest-boundary-point/root-interval-to-distance-squared-interval.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAE3D,MAAM,EAAE,GAAG,OAAO,CAAC;AACnB,MAAM,GAAG,GAAG,QAAQ,CAAC;AACrB,MAAM,GAAG,GAAG,OAAO,CAAC;AAEpB,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC;AAG3B;;;;;;;;;;GAUG;AACH,SAAS,qCAAqC,CACtC,GAAe,EACf,CAAW;IAEf,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAEnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,MAAM;IACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,MAAM;IAEvB,IAAI,WAAW,GAAG,CAAC,QAAQ,CAAC;IAC5B,IAAI,WAAW,GAAG,CAAC,QAAQ,CAAC;IAE5B,sCAAsC;IACtC,KAAK,MAAM,CAAC,CAAC,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,EAAC,CAAC,IAAI,EAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACpE;;;;;;;;UAQE;QAEF,qEAAqE;QACrE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAE,QAAQ;QAC7B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAE,QAAQ;QAC7B,sEAAsE;QACtE,kCAAkC;QAClC,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,EAAC,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC,CAAE,gBAAgB;QAC3D,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAErB,iFAAiF;QACjF,gFAAgF;QAChF,MAAM,MAAM,GAAG,GAAG,GAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,2BAA2B;QAC1D,MAAM,MAAM,GAAG,GAAG,GAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,0BAA0B;QAEzD,IAAI,MAAM,IAAI,WAAW,EAAE,CAAC;YACxB,WAAW,GAAG,MAAM,CAAC;QACzB,CAAC;QAED,IAAI,MAAM,IAAI,WAAW,EAAE,CAAC;YACxB,WAAW,GAAG,MAAM,CAAC;QACzB,CAAC;IACL,CAAC;IAED,OAAO,CAAC,WAAW,EAAC,WAAW,CAAC,CAAC;AACrC,CAAC;AAGD,OAAO,EAAE,qCAAqC,EAAE,CAAA"}
+{"version":3,"file":"root-interval-to-distance-squared-interval.js","sourceRoot":"","sources":["../../src/closest-boundary-point/root-interval-to-distance-squared-interval.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,4BAA4B,CAAC;AAEjD,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAErB;;;;;GAKG;AACH,MAAM,KAAK,GAAG,CAAC,GAAC,GAAG,CAAC;AAGpB;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAS,qCAAqC,CACtC,GAAe,EACf,CAAW;IAEf,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IACzC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAEjB,oEAAoE;IACpE,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;IACzC,oEAAoE;IACpE,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;IAEtC,MAAM,WAAW,GAAG,KAAK,GAAC,KAAK,GAAG,KAAK,GAAC,KAAK,CAAC;IAC9C,MAAM,WAAW,GAAG,KAAK,GAAC,KAAK,GAAG,KAAK,GAAC,KAAK,CAAC;IAE9C,OAAO,CAAC,WAAW,GAAC,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,WAAW,GAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AAC9D,CAAC;AAGD,OAAO,EAAE,qCAAqC,EAAE,CAAA"}

package/node/corner/get-corner.d.ts

@@ -7,4 +7,21 @@ import type { Corner } from "./corner.js";
  * @param psO The outgoing bezier that starts at the corner
  */
 declare function getCorner(psI: number[][], psO: number[][]): Corner;
-export { getCorner };
+/**
+ * Memoized version of `getCorner` (keyed on the two control point arrays).
+ *
+ * @internal
+ */
+declare const getCorner$: typeof getCorner & {
+    readonly weakMapS: WeakMap<object, {
+        readonly weakMap: WeakMap<object, any>;
+        readonly map: Map<object, any>;
+    }>;
+    readonly mapS: Map<object, {
+        readonly weakMap: WeakMap<object, any>;
+        readonly map: Map<object, any>;
+    }>;
+    readonly clearCache: () => void;
+    readonly addToCache: (r: unknown, ...args: any) => void;
+};
+export { getCorner, getCorner$ };

package/node/corner/get-corner.js

@@ -1,3 +1,4 @@
+import { memoize } from 'flo-memoize';
 import { cross, toUnitVector } from "flo-vector2d";
 import { getInterfaceCcw } from './get-interface-ccw.js';
 /**
@@ -55,5 +56,11 @@ function getCorner(psI, psO) {
         isQuiteDull
     };
 }
-export { getCorner };
+/**
+ * Memoized version of `getCorner` (keyed on the two control point arrays).
+ *
+ * @internal
+ */
+const getCorner$ = memoize(getCorner);
+export { getCorner, getCorner$ };
 //# sourceMappingURL=get-corner.js.map

package/node/corner/get-corner.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-corner.js","sourceRoot":"","sources":["../../src/corner/get-corner.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAGzD;;;GAGG;AACH,MAAM,OAAO,GAAG;IACZ,kBAAkB;IAClB,IAAI,EAAG,MAAM;IACb,CAAC,EAAM,MAAM;IACb,CAAC,EAAM,MAAM;IACb,EAAE,EAAK,MAAM;CAChB,CAAC;AAGF,gBAAgB;AAChB,mCAAmC;AACnC,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAChC,oCAAoC;AAGpC;;;;;;GAMG;AACH,SAAS,SAAS,CACV,GAAe,EACf,GAAe;IAEnB,0EAA0E;IAC1E,sDAAsD;IACtD,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3E,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC;IACxB,MAAM,MAAM,GAAI,GAAG,GAAG,CAAC,CAAC;IAExB,+CAA+C;IAC/C,MAAM,YAAY,GAAG;QACjB,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACxC,CAAC;IAEF,wEAAwE;IACxE,cAAc;IACd,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9D,IAAI,YAAqB,CAAC;IAC1B,IAAI,WAAoB,CAAC;IACzB,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QAClB,8BAA8B;QAC9B,YAAY,GAAG,aAAa,GAAG,CAAC,YAAY,CAAC;QAC7C,WAAW,GAAG,aAAa,GAAG,CAAC,YAAY,CAAC;IAChD,CAAC;SAAM,CAAC;QACJ,YAAY,GAAG,OAAO,CAAC;QACvB,WAAW,GAAI,MAAM,CAAC;IAC1B,CAAC;IAED,OAAO;QACH,QAAQ,EAAE,YAAY;QACtB,OAAO;QACP,MAAM;QACN,YAAY;QACZ,WAAW;KACd,CAAC;AACN,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}
+{"version":3,"file":"get-corner.js","sourceRoot":"","sources":["../../src/corner/get-corner.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAGzD;;;GAGG;AACH,MAAM,OAAO,GAAG;IACZ,kBAAkB;IAClB,IAAI,EAAG,MAAM;IACb,CAAC,EAAM,MAAM;IACb,CAAC,EAAM,MAAM;IACb,EAAE,EAAK,MAAM;CAChB,CAAC;AAGF,gBAAgB;AAChB,mCAAmC;AACnC,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAChC,oCAAoC;AAGpC;;;;;;GAMG;AACH,SAAS,SAAS,CACV,GAAe,EACf,GAAe;IAEnB,0EAA0E;IAC1E,sDAAsD;IACtD,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3E,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC;IACxB,MAAM,MAAM,GAAI,GAAG,GAAG,CAAC,CAAC;IAExB,+CAA+C;IAC/C,MAAM,YAAY,GAAG;QACjB,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACxC,CAAC;IAEF,wEAAwE;IACxE,cAAc;IACd,MAAM,aAAa,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9D,IAAI,YAAqB,CAAC;IAC1B,IAAI,WAAoB,CAAC;IACzB,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QAClB,8BAA8B;QAC9B,YAAY,GAAG,aAAa,GAAG,CAAC,YAAY,CAAC;QAC7C,WAAW,GAAG,aAAa,GAAG,CAAC,YAAY,CAAC;IAChD,CAAC;SAAM,CAAC;QACJ,YAAY,GAAG,OAAO,CAAC;QACvB,WAAW,GAAI,MAAM,CAAC;IAC1B,CAAC;IAED,OAAO;QACH,QAAQ,EAAE,YAAY;QACtB,OAAO;QACP,MAAM;QACN,YAAY;QACZ,WAAW;KACd,CAAC;AACN,CAAC;AAGD;;;;GAIG;AACH,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;AAGtC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,CAAA"}

package/node/corner/get-interface-ccw.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-interface-ccw.js","sourceRoot":"","sources":["../../src/corner/get-interface-ccw.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAa,SAAS,EAAE,KAAK,EAAE,WAAW,EAAsB,OAAO,EAAE,MAAM,cAAc,CAAC;AAC3G,OAAO,EAAE,4BAA4B,EAAE,MAAM,sCAAsC,CAAC;AAGpF;;;;;;;;;;;;;;;GAeG;AACH,SAAS,eAAe,CAChB,GAAe,EACf,GAAe;IAQnB,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC;IAExB,8CAA8C;IAC9C,IAAI,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC;IACrB,yEAAyE;IACzE,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,yCAAyC;IACzC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhB,uDAAuD;IACvD,IAAI,WAAW,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC,CAAE,qBAAqB;IAC5C,CAAC;IACD,IAAI,WAAW,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,qBAAqB;IACvC,CAAC;IAED,MAAM,aAAa,GAAG,YAAY,CAAC,EAAE,EAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAE,uBAAuB;IAEtE,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACzD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACzD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACzD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAEzD,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACzB,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACzB,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,EAAC,QAAQ,CAAC,CAAC;IAElD,IAAI,aAAa,KAAK,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QACzC,OAAO;YACH,GAAG,EAAE,aAAa;YAClB,QAAQ;YACR,QAAQ;YACR,iBAAiB;YACjB,WAAW;SACd,CAAA;IACL,CAAC;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,sEAAsE;IAEtE,oBAAoB;IAEpB,SAAS;IACT,gEAAgE;IAChE,6DAA6D;IAC7D,oEAAoE;IACpE,mEAAmE;IACnE,cAAc;IACd,OAAO;QACH,GAAG,EAAE,4BAA4B,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC;QAC7D,QAAQ;QACR,QAAQ;QACR,WAAW;KACd,CAAA;AACL,CAAC;AAGD,SAAS,WAAW,CACZ,EAAY,EACZ,EAAY;IAEhB,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC;AAGD;;;;GAIG;AACH,SAAS,UAAU,CACX,QAAoB,EACpB,QAAoB;IAExB,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAC,GAAG,CAAC,CAAC;IAE1B,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAGD;;;;GAIG;AACH,SAAS,YAAY,CACb,EAAY,EACZ,EAAY,EACZ,EAAY;IAEhB,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IAErB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjC,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}
+{"version":3,"file":"get-interface-ccw.js","sourceRoot":"","sources":["../../src/corner/get-interface-ccw.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5E,OAAO,EAAE,4BAA4B,EAAE,MAAM,sCAAsC,CAAC;AAGpF;;;;;;;;;;;;;;;GAeG;AACH,SAAS,eAAe,CAChB,GAAe,EACf,GAAe;IAQnB,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC;IAExB,8CAA8C;IAC9C,IAAI,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC;IACrB,yEAAyE;IACzE,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,yCAAyC;IACzC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhB,uDAAuD;IACvD,IAAI,WAAW,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC,CAAE,qBAAqB;IAC5C,CAAC;IACD,IAAI,WAAW,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;QACrB,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,qBAAqB;IACvC,CAAC;IAED,MAAM,aAAa,GAAG,YAAY,CAAC,EAAE,EAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAE,uBAAuB;IAEtE,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACzD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACzD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACzD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAEzD,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACzB,MAAM,QAAQ,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACzB,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,EAAC,QAAQ,CAAC,CAAC;IAElD,IAAI,aAAa,KAAK,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QACzC,OAAO;YACH,GAAG,EAAE,aAAa;YAClB,QAAQ;YACR,QAAQ;YACR,iBAAiB;YACjB,WAAW;SACd,CAAA;IACL,CAAC;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,sEAAsE;IAEtE,oBAAoB;IAEpB,SAAS;IACT,gEAAgE;IAChE,6DAA6D;IAC7D,oEAAoE;IACpE,mEAAmE;IACnE,cAAc;IACd,OAAO;QACH,GAAG,EAAE,4BAA4B,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC;QAC7D,QAAQ;QACR,QAAQ;QACR,WAAW;KACd,CAAA;AACL,CAAC;AAGD,SAAS,WAAW,CACZ,EAAY,EACZ,EAAY;IAEhB,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC;AAGD;;;;GAIG;AACH,SAAS,UAAU,CACX,QAAoB,EACpB,QAAoB;IAExB,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAC,GAAG,CAAC,CAAC;IAE1B,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAGD;;;;GAIG;AACH,SAAS,YAAY,CACb,EAAY,EACZ,EAAY,EACZ,EAAY;IAEhB,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IAErB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjC,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/cp-node/cp-node.d.ts

@@ -23,9 +23,10 @@ import { PointOnShape } from '../point-on-shape/point-on-shape.js';
  * following other branches on the MAT.
  *
  * Call `getMatCurveBetween(cpNodeFrom, cpNodeTo)` or `getMatCurveToNext(cpNode)`
- * (replacing the older CpNode.`matCurveToNextVertex`) to get a bezier curve
- * from the maximal disk of this `CpNode` to the next `CpNode`'s
- * maximal disk and thus directly representing a piece of the medial axis.
+ * (replacing the older CpNode.`matCurveToNextVertex`) to get the bezier curves
+ * (1 or 2 lines or quadratics joined smoothly) from the maximal disk of this
+ * `CpNode` to the next `CpNode`'s maximal disk and thus directly representing
+ * a piece of the medial axis.
  *
  * The function, `getChildren`, returns the children of this `CpNode` when
  * seen as a MAT edge. Only children in a 'forward' direction are returned. These

package/node/cp-node/fs/enhance-cp-node.d.ts

@@ -4,6 +4,15 @@ import { CpNode } from "../cp-node.js";
  * @param cpNode
  */
 declare function enhanceCpNode(cpNode: CpNode): {
+    id: number;
+    pointOnShape: import("../../index.js").PointOnShape;
+    isHoleClosing: boolean;
+    isIntersection: boolean;
+    prev: CpNode;
+    next: CpNode;
+    prevOnCircle: CpNode;
+    nextOnCircle: CpNode;
+    holeCloserTwin?: CpNode | undefined;
     pos: import("../../index.js").PointOnShape;
     p: number[];
     t: number;
@@ -20,14 +29,5 @@ declare function enhanceCpNode(cpNode: CpNode): {
     };
     curve: import("flo-boolean").Curve;
     loop: import("flo-boolean").Loop;
-    id: number;
-    pointOnShape: import("../../index.js").PointOnShape;
-    isHoleClosing: boolean;
-    isIntersection: boolean;
-    prev: CpNode;
-    next: CpNode;
-    prevOnCircle: CpNode;
-    nextOnCircle: CpNode;
-    holeCloserTwin?: CpNode | undefined;
 };
 export { enhanceCpNode };

package/node/cp-node/fs/get-all-on-loop-by-loop.js

@@ -10,10 +10,6 @@ function getAllOnLoop_ByLoop(cpNode) {
     const cpNodess = [];
     const cpStarts = [cpNode];
     const cpStartSet = new Set(cpStarts);
-    if (cpNode.isHoleClosing) {
-        cpStartSet.add(cpNode.prevOnCircle.holeCloserTwin);
-    }
-    cpStartSet.add(cpNode);
     while (cpStarts.length > 0) {
         const cpNodes = [];
         const cpStart = cpStarts.pop();

package/node/cp-node/fs/get-all-on-loop-by-loop.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-all-on-loop-by-loop.js","sourceRoot":"","sources":["../../../src/cp-node/fs/get-all-on-loop-by-loop.ts"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,SAAS,mBAAmB,CACpB,MAAc;IAElB,MAAM,QAAQ,GAAe,EAAE,CAAC;IAEhC,MAAM,QAAQ,GAAa,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;QACvB,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,cAAe,CAAC,CAAC;IACxD,CAAC;IACD,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEvB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAC;QAChC,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;QAC9C,IAAI,MAAM,GAAG,OAAO,CAAC;QAErB,GAAG,CAAC;YACA,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;YAC5C,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;gBACrB,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,CAAC,cAAe,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACrB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,cAAe,CAAC,CAAC;gBAClD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;YAED,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,cAAe,CAAC;QACzC,CAAC,QAAQ,MAAM,KAAK,OAAO,EAAE;QAE7B,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED,OAAO,QAAQ,CAAC;AACpB,CAAC;AAGD,OAAO,EAAE,mBAAmB,EAAE,CAAA"}
+{"version":3,"file":"get-all-on-loop-by-loop.js","sourceRoot":"","sources":["../../../src/cp-node/fs/get-all-on-loop-by-loop.ts"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,SAAS,mBAAmB,CACpB,MAAc;IAElB,MAAM,QAAQ,GAAe,EAAE,CAAC;IAEhC,MAAM,QAAQ,GAAa,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAErC,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,EAAG,CAAC;QAChC,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;QAC9C,IAAI,MAAM,GAAG,OAAO,CAAC;QAErB,GAAG,CAAC;YACA,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;YAC5C,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACrB,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;gBACrB,SAAS;YACb,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,CAAC,cAAe,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACrB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,cAAe,CAAC,CAAC;gBAClD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;YAED,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,cAAe,CAAC;QACzC,CAAC,QAAQ,MAAM,KAAK,OAAO,EAAE;QAE7B,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED,OAAO,QAAQ,CAAC;AACpB,CAAC;AAGD,OAAO,EAAE,mBAAmB,EAAE,CAAA"}

package/node/cp-node/fs/get-angle-between-mat-curves.d.ts

@@ -1,4 +1,4 @@
-import { CpNode } from "../cp-node.js";
+import type { CpNode } from "../cp-node.js";
 /**
  *
  * @param cpNode1

package/node/cp-node/fs/get-angle-between-mat-curves.js

@@ -1,6 +1,7 @@
 import { tangent } from "flo-bezier3";
 import { cross, toUnitVector } from "flo-vector2d";
 import { getMatCurveToNext } from "./get-mat-curve-to-next.js";
+const { abs, asin, min, max, PI: π } = Math;
 /**
  *
  * @param cpNode1
@@ -8,10 +9,12 @@ import { getMatCurveToNext } from "./get-mat-curve-to-next.js";
  * @returns
  */
 function getInitialDegAngleBetweenMatCurves(cpNode1, cpNode2) {
-    const tan1 = toUnitVector(tangent(getMatCurveToNext(cpNode1), 0));
-    const tan2 = toUnitVector(tangent(getMatCurveToNext(cpNode2), 0));
-    const cross_ = cross(tan1, tan2);
-    const angle = Math.abs(Math.asin(cross_) * (180 / Math.PI));
+    const tan1 = toUnitVector(tangent(getMatCurveToNext(cpNode1)[0], 0));
+    const tan2 = toUnitVector(tangent(getMatCurveToNext(cpNode2)[0], 0));
+    // clamp: rounding can push the cross product of two unit vectors just
+    // outside [-1,1], which would make `asin` return `NaN`
+    const cross_ = max(-1, min(1, cross(tan1, tan2)));
+    const angle = abs(asin(cross_) * (180 / π));
     return angle;
 }
 export { getInitialDegAngleBetweenMatCurves };

package/node/cp-node/fs/get-angle-between-mat-curves.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-angle-between-mat-curves.js","sourceRoot":"","sources":["../../../src/cp-node/fs/get-angle-between-mat-curves.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAEnD,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAG/D;;;;;GAKG;AACH,SAAS,kCAAkC,CACnC,OAAe,EACf,OAAe;IAEnB,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAC7B,iBAAiB,CAAC,OAAO,CAAC,EAC1B,CAAC,CACJ,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAC7B,iBAAiB,CAAC,OAAO,CAAC,EAC1B,CAAC,CACJ,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,MAAM,CAAE,GAAG,CAAC,GAAG,GAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAE5D,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,kCAAkC,EAAE,CAAA"}
+{"version":3,"file":"get-angle-between-mat-curves.js","sourceRoot":"","sources":["../../../src/cp-node/fs/get-angle-between-mat-curves.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAE/D,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;AAG5C;;;;;GAKG;AACH,SAAS,kCAAkC,CACnC,OAAe,EACf,OAAe;IAEnB,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAC7B,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAC7B,CAAC,CACJ,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAC7B,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAC7B,CAAC,CACJ,CAAC,CAAC;IAEH,sEAAsE;IACtE,uDAAuD;IACvD,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAE,MAAM,CAAE,GAAG,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC;IAE5C,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,kCAAkC,EAAE,CAAA"}