flo-mat 2.0.4 → 3.0.0

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

@@ -0,0 +1,9 @@
+import { BezierPiece } from '../mat/bezier-piece.js';
+/**
+ * @internal
+ * @param bezierPieces
+ * @param p
+ * @param extreme
+ */
+declare function cullBezierPieces1(bezierPieces: BezierPiece[], p: number[]): BezierPiece[];
+export { cullBezierPieces1 };

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

@@ -0,0 +1,17 @@
+import { getBestDistanceSquared } from './get-best-distance-squared.js';
+import { cullByLooseBoundingBox } from './cull-by-loose-bounding-box.js';
+import { cullByTightBoundingBox } from './cull-by-tight-boundary-box.js';
+/**
+ * @internal
+ * @param bezierPieces
+ * @param p
+ * @param extreme
+ */
+function cullBezierPieces1(bezierPieces, p) {
+    const bestSquaredDistance = getBestDistanceSquared(bezierPieces, p);
+    bezierPieces = cullByLooseBoundingBox(bezierPieces, p, bestSquaredDistance);
+    bezierPieces = cullByTightBoundingBox(bezierPieces, p, bestSquaredDistance);
+    return bezierPieces;
+}
+export { cullBezierPieces1 };
+//# sourceMappingURL=cull-bezier-pieces.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cull-bezier-pieces.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-bezier-pieces.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AACzE,OAAO,EAAE,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAGzE;;;;;GAKG;AACH,SAAS,iBAAiB,CAClB,YAA2B,EAC3B,CAAW;IAEf,MAAM,mBAAmB,GAAG,sBAAsB,CAC9C,YAAY,EAAE,CAAC,CAClB,CAAC;IACF,YAAY,GAAG,sBAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;IAEF,YAAY,GAAG,sBAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;IAGF,OAAO,YAAY,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,iBAAiB,EAAE,CAAA"}

package/node/{mat/closest-boundary-point → closest-boundary-point}/cull-by-loose-bounding-box.d.ts

@@ -1,6 +1,6 @@
-import { BezierPiece } from '../bezier-piece.js';
+import { BezierPiece } from '../mat/bezier-piece.js';
 /**
- * @hidden
+ * @internal
  * When checking distances, ignore all those with closest possible distance
  * further than 'bestSquaredDistance', i.e. cull them.
  * @param bezierPieces

package/node/{mat/closest-boundary-point → closest-boundary-point}/cull-by-loose-bounding-box.js

@@ -1,7 +1,7 @@
-import { getBoundingBox_ } from '../../get-bounding-box-.js';
 import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
+import { getBoundingBox_ } from '../geometry/get-bounding-box-.js';
 /**
- * @hidden
+ * @internal
  * When checking distances, ignore all those with closest possible distance
  * further than 'bestSquaredDistance', i.e. cull them.
  * @param bezierPieces

package/node/closest-boundary-point/cull-by-loose-bounding-box.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cull-by-loose-bounding-box.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-by-loose-bounding-box.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,8BAA8B,EAAE,MAAM,oDAAoD,CAAC;AACpG,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAGnE;;;;;;;GAOG;AACH,SAAS,sBAAsB,CACvB,YAA2B,EAC3B,CAAW,EACX,QAAgB;IAEpB,MAAM,qBAAqB,GAAG,EAAE,CAAC;IAEjC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QAEhC,MAAM,WAAW,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAExC,MAAM,CAAC,GAAG,8BAA8B,CACpC,WAAW,EACX,CAAC,CACJ,CAAC;QACF,IAAI,CAAC,IAAI,QAAQ,EAAE;YACf,qBAAqB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC3C;KACJ;IAED,OAAO,qBAAqB,CAAC;AACjC,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}

package/node/{mat/closest-boundary-point → closest-boundary-point}/cull-by-tight-boundary-box.d.ts

@@ -1,6 +1,6 @@
-import { BezierPiece } from "../bezier-piece.js";
+import { BezierPiece } from "../mat/bezier-piece.js";
 /**
- * @hidden
+ * @internal
  * When checking distances, ignore all those with closest possible distance
  * further than 'bestSquaredDistance', i.e. cull them.
  * @param bezierPieces

package/node/{mat/closest-boundary-point → closest-boundary-point}/cull-by-tight-boundary-box.js

@@ -3,7 +3,7 @@ import { memoize } from "flo-memoize";
 import { getClosestSquaredDistanceToRotatedRect } from '../geometry/get-closest-squared-distance-to-rotated-rect.js';
 const getBoundingBoxTight_ = memoize(getBoundingBoxTight);
 /**
- * @hidden
+ * @internal
  * When checking distances, ignore all those with closest possible distance
  * further than 'bestSquaredDistance', i.e. cull them.
  * @param bezierPieces

package/node/closest-boundary-point/cull-by-tight-boundary-box.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cull-by-tight-boundary-box.js","sourceRoot":"","sources":["../../src/closest-boundary-point/cull-by-tight-boundary-box.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,OAAO,EAAE,sCAAsC,EAAE,MAAM,6DAA6D,CAAC;AAGrH,MAAM,oBAAoB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC;AAG1D;;;;;;;GAOG;AACH,SAAS,sBAAsB,CACvB,YAA2B,EAC3B,CAAW,EACX,mBAA2B;IAE/B,MAAM,qBAAqB,GAAG,EAAE,CAAC;IAEjC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QAEhC,MAAM,gBAAgB,GAAG,oBAAoB,CAAC,EAAE,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,sCAAsC,CACxC,gBAAgB,EAChB,CAAC,CACR,CAAC;QACF,IAAI,CAAC,IAAI,mBAAmB,EAAE;YAC1B,qBAAqB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC3C;KACJ;IAED,OAAO,qBAAqB,CAAC;AACjC,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}

package/node/closest-boundary-point/dd-deflate-with-running-error.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Deflates the given polynomial *approximately* by removing a factor (x - t).
+ *
+ * @param p a polynomial with coefficients given densely as an array of
+ * double-double precision floating point numbers from highest to lowest power,
+ * e.g. `[[0,5],[0,-3],[0,0]]` represents the polynomial `5x^2 - 3x`
+ * @param pE the coefficient-wise absolute error of the input polynomial that
+ * still need to be multiplied by γγ3, i.e. it is `γγ3` times too big.
+ * @param t an evaluation point of the polynomial.
+ *
+ * @example
+ * ```typescript
+ * // The polynomial x^3 - 5x^2 + 8x - 4 has a root at 1 and a double root at 2
+ * ddDeflate([[0,1], [0,-5], [0,8], [0,-4]], [0,2]); //=> [[0,1], [0,-3], [0,2]]
+ * ddDeflate([[0,1], [0,-3], [0,2], [0,2]);          //=> [[0,1], [0,-1]]
+ * ddDeflate([[0,1], [0,-1]], [0,1]);                //=> [[0,1]]
+ * ```
+ *
+ * @doc
+ */
+declare function ddDeflateWithRunningError(p: number[][], pE: number[], t: number): {
+    coeffs: number[][];
+    errBound: number[];
+};
+export { ddDeflateWithRunningError };

package/node/closest-boundary-point/dd-deflate-with-running-error.js

@@ -0,0 +1,68 @@
+// TODO - import from `flo-poly` in the future
+import { ddMultDouble2 } from "double-double";
+import { ddAddDd } from "double-double";
+import { γγ } from '../error-analysis/gamma.js';
+// We *have* to do the below❗ The assignee is a getter❗ The assigned is a pure function❗ Otherwise code is too slow❗
+const qmd = ddMultDouble2;
+const qaq = ddAddDd;
+const { abs } = Math;
+const γγ3 = γγ(3);
+/**
+ * Deflates the given polynomial *approximately* by removing a factor (x - t).
+ *
+ * @param p a polynomial with coefficients given densely as an array of
+ * double-double precision floating point numbers from highest to lowest power,
+ * e.g. `[[0,5],[0,-3],[0,0]]` represents the polynomial `5x^2 - 3x`
+ * @param pE the coefficient-wise absolute error of the input polynomial that
+ * still need to be multiplied by γγ3, i.e. it is `γγ3` times too big.
+ * @param t an evaluation point of the polynomial.
+ *
+ * @example
+ * ```typescript
+ * // The polynomial x^3 - 5x^2 + 8x - 4 has a root at 1 and a double root at 2
+ * ddDeflate([[0,1], [0,-5], [0,8], [0,-4]], [0,2]); //=> [[0,1], [0,-3], [0,2]]
+ * ddDeflate([[0,1], [0,-3], [0,2], [0,2]);          //=> [[0,1], [0,-1]]
+ * ddDeflate([[0,1], [0,-1]], [0,1]);                //=> [[0,1]]
+ * ```
+ *
+ * @doc
+ */
+function ddDeflateWithRunningError(p, pE, t) {
+    //--------------------------------------------------------------------------
+    // `var` -> a variable
+    // `$var` -> the double precision approximation to `var`
+    // `_var` -> the absolute value of $var (a prefix underscore on a variable means absolute value)
+    // `var_` -> the error in var (a postfix underscore means error bound but should still be multiplied by 3*γ²)
+    // `_var_` -> means both absolute value and absolute error bound
+    // recall: `a*b`, where both `a` and `b` have errors |a| and |b| we get for the
+    //   * error bound of (a*b) === a_|b| + |a|b_ + |a*b|   (when either of a and b is double)
+    //   * error bound of (a*b) === a_|b| + |a|b_ + 2|a*b|  (when both a and b is double-double)
+    //   * error bound of (a+b) === a_ + b_ + |a+b|         (when a and/or b is double or double-double)
+    // * the returned errors need to be multiplied by 3γ² to get the true error
+    // * can use either `$var` or `var[var.length-1]` (the approx value) in error calculations
+    //   due to multiplication by 3*γ² and not 3*u²
+    //--------------------------------------------------------------------------
+    const d = p.length - 1;
+    const bs = [p[0]]; // coefficients
+    let b_ = pE[0]; // running error
+    const bEs = [b_]; // coefficient-wise error bound
+    for (let i = 1; i < d; i++) {
+        // p[i] + t*bs[i-1];
+        const a = bs[i - 1];
+        const $m = t * a[1];
+        const _t = abs(t);
+        const m_ = _t * b_ + abs($m);
+        const pi = p[i];
+        const p_ = pE[i];
+        b_ = p_ + m_ + abs(pi[1] + $m);
+        const b = qaq(pi, qmd(t, a));
+        bs.push(b);
+        bEs.push(b_);
+    }
+    return {
+        coeffs: bs,
+        errBound: bEs.map(e => γγ3 * e)
+    };
+}
+export { ddDeflateWithRunningError };
+//# sourceMappingURL=dd-deflate-with-running-error.js.map

package/node/closest-boundary-point/dd-deflate-with-running-error.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dd-deflate-with-running-error.js","sourceRoot":"","sources":["../../src/closest-boundary-point/dd-deflate-with-running-error.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,EAAE,EAAE,MAAM,4BAA4B,CAAC;AAGhD,oHAAoH;AACpH,MAAM,GAAG,GAAG,aAAa,CAAC;AAC1B,MAAM,GAAG,GAAG,OAAO,CAAC;AAEpB,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAErB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAGlB;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,yBAAyB,CAChC,CAAa,EACb,EAAY,EACZ,CAAS;IAKV,4EAA4E;IACzE,sBAAsB;IACtB,wDAAwD;IACxD,gGAAgG;IAChG,6GAA6G;IAC7G,gEAAgE;IAChE,+EAA+E;IAC/E,0FAA0F;IAC1F,4FAA4F;IAC5F,oGAAoG;IACpG,2EAA2E;IAC3E,0FAA0F;IAC1F,+CAA+C;IAC/C,4EAA4E;IAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,eAAe;IAClC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAO,gBAAgB;IACzC,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAK,+BAA+B;IAErD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjB,oBAAoB;QAE1B,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,EAAE,GAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;QAE3B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACjB,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAE/B,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,EAAC,GAAG,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC;QAE3B,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACb;IAED,OAAO;QACA,MAAM,EAAE,EAAE;QACV,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,GAAC,CAAC,CAAC;KAChC,CAAC;AACN,CAAC;AAGD,OAAO,EAAE,yBAAyB,EAAE,CAAA"}

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

@@ -0,0 +1,10 @@
+import { Curve } from "../curve/curve";
+type FootAndEndpointInfo = {
+    curve: Curve;
+    p: number[];
+    t: number;
+    d: number;
+    box: number[][];
+    dSquaredI: number[];
+};
+export { FootAndEndpointInfo };

package/node/closest-boundary-point/foot-and-endpoint-info.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=foot-and-endpoint-info.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"foot-and-endpoint-info.js","sourceRoot":"","sources":["../../src/closest-boundary-point/foot-and-endpoint-info.ts"],"names":[],"mappings":""}

package/node/{mat/closest-boundary-point → closest-boundary-point}/get-best-distance-squared.d.ts

@@ -1,6 +1,6 @@
-import { BezierPiece } from "../bezier-piece.js";
+import { BezierPiece } from "../mat/bezier-piece.js";
 /**
- * @hidden
+ * @internal
  * Finds an initial distance such that the closest point can not be further than
  * this distance away.
  */

package/node/{mat/closest-boundary-point → closest-boundary-point}/get-best-distance-squared.js

@@ -1,7 +1,7 @@
 import { evalDeCasteljau } from 'flo-bezier3';
 import { squaredDistanceBetween } from 'flo-vector2d';
 /**
- * @hidden
+ * @internal
  * Finds an initial distance such that the closest point can not be further than
  * this distance away.
  */
@@ -18,8 +18,7 @@ function getBestDistanceSquared(bezierPieces, p) {
         }
     }
     // The extra multiplier is to account for floating point precision.
-    // TODO - remove delta (or base it on theory)
-    return bestSquaredDistance * 1.01;
+    return (1 + 2 ** -10) * bestSquaredDistance;
 }
 export { getBestDistanceSquared };
 //# sourceMappingURL=get-best-distance-squared.js.map

package/node/closest-boundary-point/get-best-distance-squared.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-best-distance-squared.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-best-distance-squared.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAItD;;;;GAIG;AACH,SAAS,sBAAsB,CACvB,YAA2B,EAC3B,CAAW;IAEf,IAAI,mBAAmB,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACnD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAEpC,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QAEhC,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAElD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CACd,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,EAC7B,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,CAChC,CAAC;QAEF,IAAI,CAAC,GAAG,mBAAmB,EAAE;YACzB,mBAAmB,GAAG,CAAC,CAAC;SAC3B;KACJ;IAED,mEAAmE;IACnE,OAAO,CAAC,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,CAAC,GAAC,mBAAmB,CAAC;AAC5C,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}

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

@@ -0,0 +1,15 @@
+import { BezierPiece } from '../mat/bezier-piece.js';
+import { Curve } from '../curve/curve.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
+/**
+ * @internal
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param x
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+declare function getCloseBoundaryPointsCertified(bezierPieces: BezierPiece[], x: number[], touchedCurve?: Curve | undefined, t?: number | undefined, for1Prong?: boolean, angle?: number): PointOnShape[];
+export { getCloseBoundaryPointsCertified };

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

@@ -0,0 +1,40 @@
+import { getPotentialClosestPointsOnCurveCertified } from './get-potential-closest-points-on-curve-certified.js';
+import { cullBezierPieces1 } from './cull-bezier-pieces.js';
+import { createPos } from '../point-on-shape/create-pos.js';
+/**
+ * @internal
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param x
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+function getCloseBoundaryPointsCertified(bezierPieces, x, touchedCurve = undefined, t = undefined, for1Prong = false, angle = 0) {
+    bezierPieces = cullBezierPieces1(bezierPieces, x);
+    const pInfoss = [];
+    for (let i = 0; i < bezierPieces.length; i++) {
+        const bezierPiece = bezierPieces[i];
+        const pInfos = getPotentialClosestPointsOnCurveCertified(bezierPiece.curve, x, bezierPiece.ts, touchedCurve, t, for1Prong, angle);
+        pInfoss.push(...pInfos);
+    }
+    /** the minimum max interval value */
+    let minMax = Number.POSITIVE_INFINITY;
+    for (let i = 0; i < pInfoss.length; i++) {
+        const diMax = pInfoss[i].dSquaredI[1];
+        if (diMax < minMax) {
+            minMax = diMax;
+        }
+    }
+    const closestPointInfos = [];
+    for (let i = 0; i < pInfoss.length; i++) {
+        const info = pInfoss[i];
+        if (info.dSquaredI[0] <= minMax) {
+            closestPointInfos.push(info);
+        }
+    }
+    return closestPointInfos.map(info => createPos(info.curve, info.t, false));
+}
+export { getCloseBoundaryPointsCertified };
+//# sourceMappingURL=get-close-boundary-points-certified.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"get-close-boundary-points-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-close-boundary-points-certified.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,yCAAyC,EAAE,MAAM,sDAAsD,CAAC;AACjH,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAI5D,OAAO,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAG5D;;;;;;;;;GASG;AACH,SAAS,+BAA+B,CAChC,YAA2B,EAC3B,CAAW,EACjB,eAAkC,SAAS,EAC3C,IAAwB,SAAS,EACjC,SAAS,GAAG,KAAK,EACjB,KAAK,GAAG,CAAC;IAEV,YAAY,GAAG,iBAAiB,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IAElD,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAEpC,MAAM,MAAM,GAAG,yCAAyC,CACvD,WAAW,CAAC,KAAK,EACjB,CAAC,EACD,WAAW,CAAC,EAAE,EACd,YAAY,EACZ,CAAC,EACD,SAAS,EACT,KAAK,CACL,CAAC;QAEF,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;KACxB;IAED,qCAAqC;IACrC,IAAI,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACtC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,KAAK,GAAG,MAAM,EAAE;YACnB,MAAM,GAAG,KAAK,CAAC;SACf;KACD;IAED,MAAM,iBAAiB,GAA0B,EAAE,CAAC;IAEpD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE;YAChC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC7B;KACD;IAED,OAAO,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AAC5E,CAAC;AAGD,OAAO,EAAE,+BAA+B,EAAE,CAAC"}

package/node/closest-boundary-point/get-closest-boundary-point-certified.d.ts

@@ -0,0 +1,15 @@
+import { Curve } from '../curve/curve.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
+import { BezierPiece } from '../mat/bezier-piece.js';
+/**
+ * @internal
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param x
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+declare function getClosestBoundaryPointCertified(angle: number, bezierPieces: BezierPiece[], x: number[], touchedCurve: Curve, t: number, for1Prong: boolean): PointOnShape;
+export { getClosestBoundaryPointCertified };

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

@@ -0,0 +1,42 @@
+import { getObjClosestTo } from 'flo-vector2d';
+import { createPos } from '../point-on-shape/create-pos.js';
+import { cullBezierPieces1 } from './cull-bezier-pieces.js';
+import { getPotentialClosestPointsOnCurveCertified } from './get-potential-closest-points-on-curve-certified.js';
+import { squaredDistanceBetweenDd } from '../find-2-prong/squared-distance-between-dd.js';
+/**
+ * @internal
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param x
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+function getClosestBoundaryPointCertified(angle, bezierPieces, x, touchedCurve, t, for1Prong) {
+    bezierPieces = cullBezierPieces1(bezierPieces, x);
+    let bestDistance = Number.POSITIVE_INFINITY;
+    let pos;
+    for (let i = 0; i < bezierPieces.length; i++) {
+        const bezierPiece = bezierPieces[i];
+        const ps = getPotentialClosestPointsOnCurveCertified(bezierPiece.curve, x, bezierPiece.ts, touchedCurve, t, for1Prong, angle);
+        const p = getObjClosestTo(x, ps, p => p.p);
+        if (p === undefined) {
+            continue;
+        }
+        const d = squaredDistanceBetweenDd(p.p, x);
+        let curve = bezierPiece.curve;
+        let t_ = p.t;
+        if (d < bestDistance) {
+            if (t_ === 0) {
+                t_ = 1;
+                curve = bezierPiece.curve.prev;
+            }
+            pos = createPos(curve, t_, false);
+            bestDistance = d;
+        }
+    }
+    return pos;
+}
+export { getClosestBoundaryPointCertified };
+//# sourceMappingURL=get-closest-boundary-point-certified.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"get-closest-boundary-point-certified.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-closest-boundary-point-certified.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAG/C,OAAO,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAE5D,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,yCAAyC,EAAE,MAAM,sDAAsD,CAAC;AACjH,OAAO,EAAE,wBAAwB,EAAE,MAAM,gDAAgD,CAAC;AAG1F;;;;;;;;;GASG;AACH,SAAS,gCAAgC,CACvC,KAAa,EACP,YAA2B,EAC3B,CAAW,EACjB,YAAmB,EACnB,CAAS,EACT,SAAkB;IAEnB,YAAY,GAAG,iBAAiB,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IAElD,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAC5C,IAAI,GAAiB,CAAC;IACtB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAE9B,MAAM,EAAE,GAAG,yCAAyC,CAChD,WAAW,CAAC,KAAK,EACjB,CAAC,EACD,WAAW,CAAC,EAAE,EACd,YAAY,EACZ,CAAC,EACV,SAAS,EACT,KAAK,CACC,CAAC;QAER,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAE1C,IAAI,CAAC,KAAK,SAAS,EAAE;YAAE,SAAS;SAAE;QAElC,MAAM,CAAC,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3C,IAAI,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;QAC9B,IAAI,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC;QAEZ,IAAI,CAAC,GAAG,YAAY,EAAE;YACrB,IAAI,EAAE,KAAK,CAAC,EAAE;gBACb,EAAE,GAAG,CAAC,CAAC;gBACP,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;aAC/B;YAED,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;YAClC,YAAY,GAAG,CAAC,CAAC;SACjB;KACD;IAED,OAAO,GAAI,CAAC;AACb,CAAC;AAGD,OAAO,EAAE,gCAAgC,EAAE,CAAC"}

package/node/closest-boundary-point/get-p-from-box.d.ts

@@ -0,0 +1,3 @@
+/** @internal */
+declare function getPFromBox(box: number[][]): number[];
+export { getPFromBox };

package/node/closest-boundary-point/get-p-from-box.js

@@ -0,0 +1,11 @@
+/** @internal */
+function getPFromBox(box) {
+    const tl = box[0];
+    const br = box[1];
+    return [
+        (tl[0] + br[0]) / 2,
+        (tl[1] + br[1]) / 2,
+    ];
+}
+export { getPFromBox };
+//# sourceMappingURL=get-p-from-box.js.map

package/node/closest-boundary-point/get-p-from-box.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-p-from-box.js","sourceRoot":"","sources":["../../src/closest-boundary-point/get-p-from-box.ts"],"names":[],"mappings":"AACA,gBAAgB;AAChB,SAAS,WAAW,CAAC,GAAe;IAChC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAElB,OAAO;QACH,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC;QACjB,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC;KACpB,CAAC;AACN,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

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

@@ -0,0 +1,12 @@
+import { Curve } from "../curve/curve.js";
+import { FootAndEndpointInfo } from './foot-and-endpoint-info.js';
+/**
+ * @internal
+ * @param curve The curve
+ * @param x The point from which to check
+ * @param tRange The allowed t range
+ * @param touchedCurve The bezier on which p is located
+ * @param t The t value of the bezier that locates p
+ */
+declare function getPotentialClosestPointsOnCurveCertified(curve: Curve, x: number[], [tS, tE]?: number[], touchedCurve?: Curve | undefined, t?: number | undefined, for1Prong?: boolean, angle?: number): FootAndEndpointInfo[];
+export { getPotentialClosestPointsOnCurveCertified };

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

@@ -0,0 +1,93 @@
+import { allRootsCertified } from 'flo-poly';
+import { getFootPointsOnBezierPolysCertified, getIntervalBox } from 'flo-bezier3';
+import { ddDeflateWithRunningError } from './dd-deflate-with-running-error.js';
+import { eDeflate } from 'flo-poly';
+import { γγ } from '../error-analysis/gamma.js';
+import { rootIntervalToDistanceSquaredInterval } from './root-interval-to-distance-squared-interval.js';
+import { getPFromBox } from './get-p-from-box.js';
+const γγ3 = γγ(3);
+const { sqrt } = Math;
+/**
+ * @internal
+ * @param curve The curve
+ * @param x The point from which to check
+ * @param tRange The allowed t range
+ * @param touchedCurve The bezier on which p is located
+ * @param t The t value of the bezier that locates p
+ */
+function getPotentialClosestPointsOnCurveCertified(curve, x, [tS, tE] = [0, 1], touchedCurve = undefined, t = undefined, for1Prong = false, angle = 0) {
+    const ps = curve.ps;
+    const shouldDeflate = angle === 0 && curve === touchedCurve;
+    let { polyDd: polyDdO, polyE: polyEO, getPolyExact: getPolyExactO } = getFootPointsOnBezierPolysCertified(ps, x);
+    const def = shouldDeflate
+        ? ddDeflateWithRunningError(polyDdO, polyEO.map(e => e / γγ3), t)
+        : undefined;
+    const def2 = for1Prong && shouldDeflate
+        ? ddDeflateWithRunningError(def.coeffs, def.errBound.map(e => e / γγ3), t)
+        : undefined;
+    const def3 = for1Prong && shouldDeflate
+        ? ddDeflateWithRunningError(def2.coeffs, def2.errBound.map(e => e / γγ3), t)
+        : undefined;
+    const { polyDd, polyE, getPolyExact } = def3 !== undefined
+        ? { polyDd: def3.coeffs, polyE: def3.errBound.map(e => e / γγ3), getPolyExact: () => eDeflate(eDeflate(eDeflate(getPolyExactO(), t), t), t) }
+        : def !== undefined
+            ? { polyDd: def.coeffs, polyE: def.errBound.map(e => e / γγ3), getPolyExact: () => eDeflate(getPolyExactO(), t) }
+            : { polyDd: polyDdO, polyE: polyEO, getPolyExact: getPolyExactO };
+    const ris = allRootsCertified(polyDd, tS, tE, polyE, getPolyExact);
+    const dontPush0 = ((t === 1 && curve === touchedCurve.next) ||
+        (t === 0 && curve === touchedCurve));
+    const dontPush1 = ((t === 0 && curve === touchedCurve.prev) ||
+        (t === 1 && curve === touchedCurve));
+    if (tS === 0) {
+        if (!dontPush0) {
+            ris.push({ tS: 0, tE: 0, multiplicity: 1 });
+        }
+    }
+    else if (tS === 1) {
+        if (!dontPush1) {
+            ris.push({ tS: 1, tE: 1, multiplicity: 1 });
+        }
+    }
+    else {
+        ris.push({ tS: tS, tE: tS, multiplicity: 1 });
+    }
+    if (tE === 0) {
+        if (!dontPush0) {
+            ris.push({ tS: 0, tE: 0, multiplicity: 1 });
+        }
+    }
+    else if (tE === 1) {
+        if (!dontPush1) {
+            ris.push({ tS: 1, tE: 1, multiplicity: 1 });
+        }
+    }
+    else {
+        ris.push({ tS: tE, tE: tE, multiplicity: 1 });
+    }
+    const infos = ris
+        .map(ri => {
+        const { tS: ts, tE: te } = ri;
+        if (te < tS || ts > tE) {
+            return undefined;
+        }
+        const _t = (ts + te) / 2;
+        const t = _t < 0 ? 0 : _t > 1 ? 1 : _t;
+        const box = getIntervalBox(ps, [ts, te]);
+        const p_ = getPFromBox(box);
+        const dSquaredI = rootIntervalToDistanceSquaredInterval(box, x);
+        const t_ = t === 0 ? 1 : t;
+        const curve_ = t === 0 ? curve.prev : curve;
+        return {
+            curve: curve_,
+            p: p_,
+            t: t_,
+            d: (sqrt(dSquaredI[0]) + sqrt(dSquaredI[1])) / 2,
+            dSquaredI,
+            box,
+        };
+    });
+    const infos_ = infos.filter(info => info !== undefined);
+    return infos_;
+}
+export { getPotentialClosestPointsOnCurveCertified };
+//# sourceMappingURL=get-potential-closest-points-on-curve-certified.js.map

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

@@ -0,0 +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":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,mCAAmC,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElF,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACpC,OAAO,EAAE,EAAE,EAAE,MAAM,4BAA4B,CAAC;AAChD,OAAO,EAAE,qCAAqC,EAAE,MAAM,iDAAiD,CAAC;AACxG,OAAO,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAIlD,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAElB,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAGtB;;;;;;;GAOG;AACH,SAAS,yCAAyC,CAC1C,KAAY,EACZ,CAAW,EACX,CAAC,EAAE,EAAC,EAAE,IAAc,CAAC,CAAC,EAAC,CAAC,CAAC,EACzB,eAAkC,SAAS,EAC3C,IAAwB,SAAS,EACjC,SAAS,GAAG,KAAK,EACjB,KAAK,GAAG,CAAC;IAEb,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;IAEpB,MAAM,aAAa,GAAG,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC;IAE5D,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,GAC/D,mCAAmC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE/C,MAAM,GAAG,GAAG,aAAa;QACjB,CAAC,CAAC,yBAAyB,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAChE,CAAC,CAAC,SAAS,CAAC;IAEpB,MAAM,IAAI,GAAG,SAAS,IAAI,aAAa;QAC/B,CAAC,CAAC,yBAAyB,CAAC,GAAI,CAAC,MAAM,EAAE,GAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC3E,CAAC,CAAC,SAAS,CAAC;IAEpB,MAAM,IAAI,GAAG,SAAS,IAAI,aAAa;QAC/B,CAAC,CAAC,yBAAyB,CAAC,IAAK,CAAC,MAAM,EAAE,IAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC7E,CAAC,CAAC,SAAS,CAAC;IAEpB,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAC3B,IAAI,KAAK,SAAS;QACpB,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,EAAE,YAAY,EAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAE,CAAC,EAAE,CAAE,CAAC,EAAE,CAAE,CAAC,EAAE;QAC/I,CAAC,CAAC,GAAG,KAAK,SAAS;YACnB,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAE,CAAC,EAAE;YAChH,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC;IAE1E,MAAM,GAAG,GAAG,iBAAiB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IAEnE,MAAM,SAAS,GAAG,CACd,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAa,CAAC,IAAI,CAAC;QACzC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,CACtC,CAAC;IACF,MAAM,SAAS,GAAG,CACd,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAa,CAAC,IAAI,CAAC;QACzC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,CACtC,CAAC;IAEF,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,CAAC,SAAS,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KACnE;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,CAAC,SAAS,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KACnE;SAAM;QACH,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;KACjD;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,CAAC,SAAS,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KACnE;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,CAAC,SAAS,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KACnE;SAAM;QACH,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;KACjD;IAED,MAAM,KAAK,GAAG,GAAG;SAChB,GAAG,CAAC,EAAE,CAAC,EAAE;QACN,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;QAE9B,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;YACpB,OAAO,SAAS,CAAC;SACpB;QAED,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC;QACvB,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;QAEvC,MAAM,GAAG,GAAG,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAE5B,MAAM,SAAS,GAAG,qCAAqC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEhE,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,CAAC,EAAE,EAAE;YACL,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC;YAC9C,SAAS;YACT,GAAG;SACN,CAAA;IACL,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,SAAS,CAA0B,CAAC;IAEjF,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,yCAAyC,EAAE,CAAA"}

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

@@ -0,0 +1,13 @@
+/**
+ * Returns the distance interval squared given the root interval (currently
+ * ignoring multiplicity).
+ *
+ * * the result is returned as `[minPossibleSquared, maxPossibleSquared]` distance.
+ *
+ * @param box
+ * @param p
+ *
+ * @internal
+ */
+declare function rootIntervalToDistanceSquaredInterval(box: number[][], p: number[]): number[];
+export { rootIntervalToDistanceSquaredInterval };

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

@@ -0,0 +1,58 @@
+import { twoDiff, eEstimate, eMult, eAdd } from 'big-float-ts';
+// We *have* to do the below to improve performance with bundlers❗ The assignee is a getter❗ The assigned is a pure function❗
+const estimate = eEstimate;
+const td = twoDiff;
+const emult = eMult;
+const eadd = eAdd;
+const eps = Number.EPSILON;
+/**
+ * Returns the distance interval squared given the root interval (currently
+ * ignoring multiplicity).
+ *
+ * * the result is returned as `[minPossibleSquared, maxPossibleSquared]` distance.
+ *
+ * @param box
+ * @param p
+ *
+ * @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 = Number.POSITIVE_INFINITY;
+    let maxDSquared = Number.NEGATIVE_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 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];
+}
+export { rootIntervalToDistanceSquaredInterval };
+//# sourceMappingURL=root-interval-to-distance-squared-interval.js.map

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

@@ -0,0 +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,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAG/D,6HAA6H;AAC7H,MAAM,QAAQ,GAAG,SAAS,CAAC;AAC3B,MAAM,EAAE,GAAG,OAAO,CAAC;AACnB,MAAM,KAAK,GAAG,KAAK,CAAC;AACpB,MAAM,IAAI,GAAG,IAAI,CAAC;AAElB,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,MAAM,CAAC,iBAAiB,CAAC;IAC3C,IAAI,WAAW,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAE3C,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;QACnE;;;;;;;;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,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,EAAC,EAAE,CAAC,EAAC,KAAK,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC,CAAE,gBAAgB;QACnE,MAAM,GAAG,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAE/B,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;YACvB,WAAW,GAAG,MAAM,CAAC;SACxB;QAED,IAAI,MAAM,IAAI,WAAW,EAAE;YACvB,WAAW,GAAG,MAAM,CAAC;SACxB;KACJ;IAED,OAAO,CAAC,WAAW,EAAC,WAAW,CAAC,CAAC;AACrC,CAAC;AAGD,OAAO,EAAE,qCAAqC,EAAE,CAAA"}

package/node/{contact-point.d.ts → contact-point/contact-point.d.ts}

@@ -1,12 +1,12 @@
-import { IPointOnShape } from './point-on-shape.js';
-import { Circle } from './circle.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
+import { Circle } from '../geometry/circle.js';
 /**
  * Represents a point on the shape boundary for which MAT data has been
  * calculated.
  */
 interface ContactPoint {
     /** Identifies the point on the shape boundary. */
-    pointOnShape: IPointOnShape;
+    pointOnShape: PointOnShape;
     /** The maximal disk circle touching this point. */
     circle: Circle;
     /** Internally used to order two points lying at the same planar point. */

package/node/{contact-point.js → contact-point/contact-point.js}

@@ -1,4 +1,4 @@
-import { comparePoss } from './point-on-shape.js';
+import { comparePoss } from '../point-on-shape/compare-poss.js';
 /**
  * Primarily for internal use.
  *
@@ -8,11 +8,7 @@ import { comparePoss } from './point-on-shape.js';
  * @param b The second contact point.
  */
 function compareCps(a, b) {
-    //let res = PointOnShape.compare(a.pointOnShape, b.pointOnShape);
     let res = comparePoss(a.pointOnShape, b.pointOnShape);
-    if (res === undefined) {
-        return undefined;
-    }
     if (res !== 0) {
         return res;
     }

package/node/contact-point/contact-point.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contact-point.js","sourceRoot":"","sources":["../../src/contact-point/contact-point.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AAoBhE;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,CAAe,EAAE,CAAe;IACnD,IAAI,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;IAEtD,IAAI,GAAG,KAAK,CAAC,EAAE;QAAE,OAAO,GAAG,CAAC;KAAE;IAE9B,GAAG,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IACxB,IAAI,GAAG,KAAK,CAAC,EAAE;QAAE,OAAO,GAAG,CAAC;KAAE;IAE9B,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;AAC5B,CAAC;AAGD,OAAO,EAAgB,UAAU,EAAE,CAAA"}