flo-mat 2.0.1 → 2.0.3

package/node/mat/add-to-cp-graph.js

@@ -1,31 +1,31 @@
-import { CpNode } from '../cp-node.js';
-import { getNeighbouringPoints } from './get-neighboring-cps.js';
-/**
- * @hidden
- * @param circle
- * @param orders
- * @param cpTrees
- * @param poss
- * @param neighbors
- * @hidden
- */
-function addToCpGraph(circle, orders, cpTrees, poss, neighbors) {
-    let newCps = poss.map((pos, i) => {
-        let cpTree = cpTrees.get(pos.curve.loop);
-        let newCp_ = { pointOnShape: pos, circle, order: orders[i], order2: 0 };
-        let neighboringCp = neighbors
-            ? neighbors[i]
-            : getNeighbouringPoints(cpTree, pos, orders[i], 0);
-        let newCp = CpNode.insert(false, false, cpTree, newCp_, neighboringCp[0]);
-        return newCp;
-    });
-    let len = poss.length;
-    for (let i = 0; i < len; i++) {
-        let indxPrev = i === 0 ? len - 1 : i - 1;
-        let indxNext = i === len - 1 ? 0 : i + 1;
-        newCps[i].prevOnCircle = newCps[indxPrev];
-        newCps[i].nextOnCircle = newCps[indxNext];
-    }
-}
-export { addToCpGraph };
+import { CpNode } from '../cp-node.js';
+import { getNeighbouringPoints } from './get-neighboring-cps.js';
+/**
+ * @hidden
+ * @param circle
+ * @param orders
+ * @param cpTrees
+ * @param poss
+ * @param neighbors
+ * @hidden
+ */
+function addToCpGraph(circle, orders, cpTrees, poss, neighbors) {
+    const newCps = poss.map((pos, i) => {
+        const cpTree = cpTrees.get(pos.curve.loop);
+        const newCp_ = { pointOnShape: pos, circle, order: orders[i], order2: 0 };
+        const neighboringCp = neighbors
+            ? neighbors[i]
+            : getNeighbouringPoints(cpTree, pos, orders[i], 0);
+        const newCp = CpNode.insert(false, false, cpTree, newCp_, neighboringCp[0]);
+        return newCp;
+    });
+    const len = poss.length;
+    for (let i = 0; i < len; i++) {
+        const indxPrev = i === 0 ? len - 1 : i - 1;
+        const indxNext = i === len - 1 ? 0 : i + 1;
+        newCps[i].prevOnCircle = newCps[indxPrev];
+        newCps[i].nextOnCircle = newCps[indxNext];
+    }
+}
+export { addToCpGraph };
 //# sourceMappingURL=add-to-cp-graph.js.map

package/node/mat/add-to-cp-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"add-to-cp-graph.js","sourceRoot":"","sources":["../../src/mat/add-to-cp-graph.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AACvC,OAAO,EAAE,qBAAqB,EAAE,MAAM,0BAA0B,CAAC;AAGjE;;;;;;;;GAQG;AACH,SAAS,YAAY,CACb,MAAgB,EAChB,MAAkB,EAClB,OAAoC,EACpC,IAAyB,EACzB,SAAuB;IAE3B,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC7B,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAEzC,IAAI,MAAM,GAAiB,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAEtF,IAAI,aAAa,GAAG,SAAS;YACzB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvD,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,CACjB,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,aAAa,CAAC,CAAC,CAAC,CACvB,CAAC;QAEF,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QACtB,IAAI,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAK,CAAC,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QACzC,IAAI,QAAQ,GAAG,CAAC,KAAK,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAK,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QAEzC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;KAC7C;AACL,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}
+{"version":3,"file":"add-to-cp-graph.js","sourceRoot":"","sources":["../../src/mat/add-to-cp-graph.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AACvC,OAAO,EAAE,qBAAqB,EAAE,MAAM,0BAA0B,CAAC;AAGjE;;;;;;;;GAQG;AACH,SAAS,YAAY,CACb,MAAgB,EAChB,MAAkB,EAClB,OAAoC,EACpC,IAAyB,EACzB,SAAuB;IAE3B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC/B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAE3C,MAAM,MAAM,GAAiB,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAExF,MAAM,aAAa,GAAG,SAAS;YAC3B,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,qBAAqB,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvD,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CACnB,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,aAAa,CAAC,CAAC,CAAC,CACvB,CAAC;QAEF,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IACxB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QACtB,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAK,CAAC,CAAC,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAG,CAAC,KAAK,GAAG,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAK,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC;QAE3C,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;KAC7C;AACL,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}

package/node/mat/bezier-piece.d.ts

@@ -1,12 +1,12 @@
-import { Curve } from '../curve.js';
-/**
- * @hidden
- * Represents a part of a bezier within the shape boundary.
- */
-interface BezierPiece {
-    /** A bezier curve within the shape boundary. */
-    curve: Curve;
-    /** The start and end t parameter values of the bezier curve. */
-    ts: number[];
-}
-export { BezierPiece };
+import { Curve } from '../curve.js';
+/**
+ * @hidden
+ * Represents a part of a bezier within the shape boundary.
+ */
+interface BezierPiece {
+    /** A bezier curve within the shape boundary. */
+    curve: Curve;
+    /** The start and end t parameter values of the bezier curve. */
+    ts: number[];
+}
+export { BezierPiece };

package/node/mat/bezier-piece.js

@@ -1,2 +1,2 @@
-export {};
+export {};
 //# sourceMappingURL=bezier-piece.js.map

package/node/mat/closest-boundary-point/closest-points-on-curve.d.ts

@@ -1,14 +1,14 @@
-import { Curve } from "../../curve.js";
-/**
- * @hidden
- * @param curve The curve
- * @param p 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 closestPointsOnCurve(curve: Curve, p: number[], [tS, tE]: number[], touchedCurve: Curve, t: number): {
-    p: number[];
-    t: number;
-}[];
-export { closestPointsOnCurve };
+import { Curve } from "../../curve.js";
+/**
+ * @hidden
+ * @param curve The curve
+ * @param p 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 closestPointsOnCurve(curve: Curve, p: number[], [tS, tE]: number[], touchedCurve: Curve, t: number): {
+    p: number[];
+    t: number;
+}[];
+export { closestPointsOnCurve };

package/node/mat/closest-boundary-point/closest-points-on-curve.js

@@ -1,74 +1,73 @@
-// qqq import { deflateQuad, allRootsMultiWithErrBounds, RootInterval } from 'flo-poly';
-// qqq import { getTangentPolyFromPointExact, evalDeCasteljau, evaluate, getFootpointPolyExact } from 'flo-bezier3';
-import { ddDeflate, allRootsCertified } from 'flo-poly';
-import { evaluate, getFootpointPolyDd } from 'flo-bezier3';
-/**
- * @hidden
- * @param curve The curve
- * @param p 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 closestPointsOnCurve(curve, p, [tS, tE] = [0, 1], touchedCurve, t) {
-    // qqq let poly = getTangentPolyFromPointExact(curve.ps, p);
-    const _poly = getFootpointPolyDd(curve.ps, p);
-    // qqq poly = deflateQuad(poly, t);
-    const poly = curve === touchedCurve
-        ? ddDeflate(_poly, t)
-        : _poly;
-    // let roots: Omit<RootInterval,'multiplicity'>[] = allRootsMultiWithErrBounds(
-    let roots;
-    roots = allRootsCertified(poly, tS, tE);
-    // Also test the endpoints
-    let push0 = true;
-    let push1 = true;
-    if ((t === 1 && curve === touchedCurve.next) ||
-        (t === 0 && curve === touchedCurve)) {
-        push0 = false;
-    }
-    if ((t === 0 && curve === touchedCurve.prev) ||
-        (t === 1 && curve === touchedCurve)) {
-        push1 = false;
-    }
-    if (tS === 0) {
-        if (push0) {
-            roots.push({ tS: 0, tE: 0 });
-        }
-    }
-    else if (tS === 1) {
-        if (push1) {
-            roots.push({ tS: 1, tE: 1 });
-        }
-    }
-    else {
-        roots.push({ tS: tS, tE: tS });
-    }
-    if (tE === 0) {
-        if (push0) {
-            roots.push({ tS: 0, tE: 0 });
-        }
-    }
-    else if (tE === 1) {
-        if (push1) {
-            roots.push({ tS: 1, tE: 1 });
-        }
-    }
-    else {
-        roots.push({ tS: tE, tE: tE });
-    }
-    let ps = roots.map(root => {
-        let tS = root.tS;
-        let tE = root.tE;
-        // TODO - tS, tE should always stay within [0,1] - modify findRootsMulti
-        let t = tS < 0
-            ? 0
-            : tE > 1 ? 1 : (tS + tE) / 2;
-        // TODO - why does evalDeCasteljau not work here?
-        return { p: evaluate(curve.ps, t), t };
-        //return { p: evalDeCasteljau(curve.ps,t), t }
-    });
-    return ps;
-}
-export { closestPointsOnCurve };
+// qqq import { deflateQuad, allRootsMultiWithErrBounds, RootInterval } from 'flo-poly';
+// qqq import { getTangentPolyFromPointExact, evalDeCasteljau, evaluate, getFootpointPolyExact } from 'flo-bezier3';
+import { ddDeflate, allRootsCertified } from 'flo-poly';
+import { evaluate, getFootpointPolyDd } from 'flo-bezier3';
+/**
+ * @hidden
+ * @param curve The curve
+ * @param p 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 closestPointsOnCurve(curve, p, [tS, tE] = [0, 1], touchedCurve, t) {
+    // qqq let poly = getTangentPolyFromPointExact(curve.ps, p);
+    const _poly = getFootpointPolyDd(curve.ps, p);
+    // qqq poly = deflateQuad(poly, t);
+    const poly = curve === touchedCurve
+        ? ddDeflate(_poly, t)
+        : _poly;
+    // let roots: Omit<RootInterval,'multiplicity'>[] = allRootsMultiWithErrBounds(
+    const roots = allRootsCertified(poly, tS, tE);
+    // Also test the endpoints
+    let push0 = true;
+    let push1 = true;
+    if ((t === 1 && curve === touchedCurve.next) ||
+        (t === 0 && curve === touchedCurve)) {
+        push0 = false;
+    }
+    if ((t === 0 && curve === touchedCurve.prev) ||
+        (t === 1 && curve === touchedCurve)) {
+        push1 = false;
+    }
+    if (tS === 0) {
+        if (push0) {
+            roots.push({ tS: 0, tE: 0 });
+        }
+    }
+    else if (tS === 1) {
+        if (push1) {
+            roots.push({ tS: 1, tE: 1 });
+        }
+    }
+    else {
+        roots.push({ tS: tS, tE: tS });
+    }
+    if (tE === 0) {
+        if (push0) {
+            roots.push({ tS: 0, tE: 0 });
+        }
+    }
+    else if (tE === 1) {
+        if (push1) {
+            roots.push({ tS: 1, tE: 1 });
+        }
+    }
+    else {
+        roots.push({ tS: tE, tE: tE });
+    }
+    const ps = roots.map(root => {
+        const tS = root.tS;
+        const tE = root.tE;
+        // TODO - tS, tE should always stay within [0,1] - modify findRootsMulti
+        const t = tS < 0
+            ? 0
+            : tE > 1 ? 1 : (tS + tE) / 2;
+        // TODO - why does evalDeCasteljau not work here?
+        return { p: evaluate(curve.ps, t), t };
+        //return { p: evalDeCasteljau(curve.ps,t), t }
+    });
+    return ps;
+}
+export { closestPointsOnCurve };
 //# sourceMappingURL=closest-points-on-curve.js.map

package/node/mat/closest-boundary-point/closest-points-on-curve.js.map

@@ -1 +1 @@
-{"version":3,"file":"closest-points-on-curve.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/closest-points-on-curve.ts"],"names":[],"mappings":"AAAA,wFAAwF;AACxF,oHAAoH;AACpH,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAgB,MAAM,UAAU,CAAC;AACtE,OAAO,EAAmB,QAAQ,EAAE,kBAAkB,EAAyB,MAAM,aAAa,CAAC;AAKnG;;;;;;;GAOG;AACH,SAAS,oBAAoB,CACrB,KAAY,EACZ,CAAW,EACX,CAAC,EAAE,EAAC,EAAE,IAAc,CAAC,CAAC,EAAC,CAAC,CAAC,EACzB,YAAmB,EACnB,CAAS;IAKb,4DAA4D;IAC5D,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE9C,mCAAmC;IACnC,MAAM,IAAI,GAAG,KAAK,KAAK,YAAY;QAC/B,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;QACrB,CAAC,CAAC,KAAK,CAAC;IAEZ,+EAA+E;IAC/E,IAAI,KAA0C,CAAC;IAC/C,KAAK,GAAG,iBAAiB,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAExC,0BAA0B;IAC1B,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,EAAE;QACrC,KAAK,GAAG,KAAK,CAAC;KACjB;IACD,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,EAAE;QACrC,KAAK,GAAG,KAAK,CAAC;KACjB;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAClC;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAClC;IAED,IAAI,EAAE,GAAG,KAAK,CAAC,GAAG,CACd,IAAI,CAAC,EAAE;QACH,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,wEAAwE;QACxE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC;YACV,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC;QAC/B,iDAAiD;QACjD,OAAO,EAAE,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAA;QACrC,8CAA8C;IAClD,CAAC,CACJ,CAAC;IAEF,OAAO,EAAE,CAAC;AACd,CAAC;AAGD,OAAO,EAAE,oBAAoB,EAAE,CAAA"}
+{"version":3,"file":"closest-points-on-curve.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/closest-points-on-curve.ts"],"names":[],"mappings":"AAAA,wFAAwF;AACxF,oHAAoH;AACpH,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAgB,MAAM,UAAU,CAAC;AACtE,OAAO,EAAmB,QAAQ,EAAE,kBAAkB,EAAyB,MAAM,aAAa,CAAC;AAKnG;;;;;;;GAOG;AACH,SAAS,oBAAoB,CACrB,KAAY,EACZ,CAAW,EACX,CAAC,EAAE,EAAC,EAAE,IAAc,CAAC,CAAC,EAAC,CAAC,CAAC,EACzB,YAAmB,EACnB,CAAS;IAKb,4DAA4D;IAC5D,MAAM,KAAK,GAAG,kBAAkB,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE9C,mCAAmC;IACnC,MAAM,IAAI,GAAG,KAAK,KAAK,YAAY;QAC/B,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;QACrB,CAAC,CAAC,KAAK,CAAC;IAEZ,+EAA+E;IAC/E,MAAM,KAAK,GAAwC,iBAAiB,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAEnF,0BAA0B;IAC1B,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,KAAK,GAAG,IAAI,CAAC;IACjB,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,EAAE;QACrC,KAAK,GAAG,KAAK,CAAC;KACjB;IACD,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,EAAE;QACrC,KAAK,GAAG,KAAK,CAAC;KACjB;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAClC;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACV,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE;QACjB,IAAI,KAAK,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;SAAE;KAC/C;SAAM;QACH,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;KAClC;IAED,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAChB,IAAI,CAAC,EAAE;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACnB,wEAAwE;QACxE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC;YACZ,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC;QAC/B,iDAAiD;QACjD,OAAO,EAAE,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAA;QACrC,8CAA8C;IAClD,CAAC,CACJ,CAAC;IAEF,OAAO,EAAE,CAAC;AACd,CAAC;AAGD,OAAO,EAAE,oBAAoB,EAAE,CAAA"}

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

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

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

@@ -1,20 +1,20 @@
-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';
-/**
- * @hidden
- * @param bezierPieces
- * @param p
- * @param extreme
- */
-function cullBezierPieces(bezierPieces, p) {
-    const CULL_THRESHOLD = 0;
-    if (bezierPieces.length > CULL_THRESHOLD) {
-        let bestSquaredDistance = getBestDistanceSquared(bezierPieces, p);
-        bezierPieces = cullByLooseBoundingBox(bezierPieces, p, bestSquaredDistance);
-        bezierPieces = cullByTightBoundingBox(bezierPieces, p, bestSquaredDistance);
-    }
-    return bezierPieces;
-}
-export { cullBezierPieces };
+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';
+/**
+ * @hidden
+ * @param bezierPieces
+ * @param p
+ * @param extreme
+ */
+function cullBezierPieces(bezierPieces, p) {
+    const CULL_THRESHOLD = 0;
+    if (bezierPieces.length > CULL_THRESHOLD) {
+        const bestSquaredDistance = getBestDistanceSquared(bezierPieces, p);
+        bezierPieces = cullByLooseBoundingBox(bezierPieces, p, bestSquaredDistance);
+        bezierPieces = cullByTightBoundingBox(bezierPieces, p, bestSquaredDistance);
+    }
+    return bezierPieces;
+}
+export { cullBezierPieces };
 //# sourceMappingURL=cull-bezier-pieces.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"cull-bezier-pieces.js","sourceRoot":"","sources":["../../../src/mat/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,gBAAgB,CACjB,YAA2B,EAC3B,CAAW;IAEf,MAAM,cAAc,GAAG,CAAC,CAAC;IAEzB,IAAI,YAAY,CAAC,MAAM,GAAG,cAAc,EAAE;QACtC,IAAI,mBAAmB,GAAG,sBAAsB,CAC5C,YAAY,EAAE,CAAC,CAClB,CAAC;QACF,YAAY,GAAG,sBAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;QAEF,YAAY,GAAG,sBAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;KACL;IAED,OAAO,YAAY,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}
+{"version":3,"file":"cull-bezier-pieces.js","sourceRoot":"","sources":["../../../src/mat/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,gBAAgB,CACjB,YAA2B,EAC3B,CAAW;IAEf,MAAM,cAAc,GAAG,CAAC,CAAC;IAEzB,IAAI,YAAY,CAAC,MAAM,GAAG,cAAc,EAAE;QACtC,MAAM,mBAAmB,GAAG,sBAAsB,CAC9C,YAAY,EAAE,CAAC,CAClB,CAAC;QACF,YAAY,GAAG,sBAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;QAEF,YAAY,GAAG,sBAAsB,CACjC,YAAY,EAAE,CAAC,EACf,mBAAmB,CACtB,CAAC;KACL;IAED,OAAO,YAAY,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}

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

@@ -1,11 +1,11 @@
-import { BezierPiece } from '../bezier-piece.js';
-/**
- * @hidden
- * When checking distances, ignore all those with closest possible distance
- * further than 'bestSquaredDistance', i.e. cull them.
- * @param bezierPieces
- * @param p
- * @param dSquared
- */
-declare function cullByLooseBoundingBox(bezierPieces: BezierPiece[], p: number[], dSquared: number): BezierPiece[];
-export { cullByLooseBoundingBox };
+import { BezierPiece } from '../bezier-piece.js';
+/**
+ * @hidden
+ * When checking distances, ignore all those with closest possible distance
+ * further than 'bestSquaredDistance', i.e. cull them.
+ * @param bezierPieces
+ * @param p
+ * @param dSquared
+ */
+declare function cullByLooseBoundingBox(bezierPieces: BezierPiece[], p: number[], dSquared: number): BezierPiece[];
+export { cullByLooseBoundingBox };

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

@@ -1,25 +1,25 @@
-import { getBoundingBox_ } from '../../get-bounding-box-.js';
-import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
-/**
- * @hidden
- * When checking distances, ignore all those with closest possible distance
- * further than 'bestSquaredDistance', i.e. cull them.
- * @param bezierPieces
- * @param p
- * @param dSquared
- */
-function cullByLooseBoundingBox(bezierPieces, p, dSquared) {
-    let candidateBezierPieces = [];
-    for (let i = 0; i < bezierPieces.length; i++) {
-        let bezierPiece = bezierPieces[i];
-        let ps = bezierPiece.curve.ps;
-        let boundingBox = getBoundingBox_(ps);
-        let d = getClosestSquareDistanceToRect(boundingBox, p);
-        if (d <= dSquared) {
-            candidateBezierPieces.push(bezierPiece);
-        }
-    }
-    return candidateBezierPieces;
-}
-export { cullByLooseBoundingBox };
+import { getBoundingBox_ } from '../../get-bounding-box-.js';
+import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
+/**
+ * @hidden
+ * When checking distances, ignore all those with closest possible distance
+ * further than 'bestSquaredDistance', i.e. cull them.
+ * @param bezierPieces
+ * @param p
+ * @param dSquared
+ */
+function cullByLooseBoundingBox(bezierPieces, p, dSquared) {
+    const candidateBezierPieces = [];
+    for (let i = 0; i < bezierPieces.length; i++) {
+        const bezierPiece = bezierPieces[i];
+        const ps = bezierPiece.curve.ps;
+        const boundingBox = getBoundingBox_(ps);
+        const d = getClosestSquareDistanceToRect(boundingBox, p);
+        if (d <= dSquared) {
+            candidateBezierPieces.push(bezierPiece);
+        }
+    }
+    return candidateBezierPieces;
+}
+export { cullByLooseBoundingBox };
 //# sourceMappingURL=cull-by-loose-bounding-box.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"cull-by-loose-bounding-box.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/cull-by-loose-bounding-box.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAE7D,OAAO,EAAE,8BAA8B,EAAE,MAAM,oDAAoD,CAAC;AAGpG;;;;;;;GAOG;AACH,SAAS,sBAAsB,CACvB,YAA2B,EAC3B,CAAW,EACX,QAAgB;IAEpB,IAAI,qBAAqB,GAAG,EAAE,CAAC;IAE/B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,IAAI,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QAE9B,IAAI,WAAW,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QAEtC,IAAI,CAAC,GAAG,8BAA8B,CAClC,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"}
+{"version":3,"file":"cull-by-loose-bounding-box.js","sourceRoot":"","sources":["../../../src/mat/closest-boundary-point/cull-by-loose-bounding-box.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAE7D,OAAO,EAAE,8BAA8B,EAAE,MAAM,oDAAoD,CAAC;AAGpG;;;;;;;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/cull-by-tight-boundary-box.d.ts

@@ -1,11 +1,11 @@
-import { BezierPiece } from "../bezier-piece.js";
-/**
- * @hidden
- * When checking distances, ignore all those with closest possible distance
- * further than 'bestSquaredDistance', i.e. cull them.
- * @param bezierPieces
- * @param p
- * @param bestSquaredDistance
- */
-declare function cullByTightBoundingBox(bezierPieces: BezierPiece[], p: number[], bestSquaredDistance: number): BezierPiece[];
-export { cullByTightBoundingBox };
+import { BezierPiece } from "../bezier-piece.js";
+/**
+ * @hidden
+ * When checking distances, ignore all those with closest possible distance
+ * further than 'bestSquaredDistance', i.e. cull them.
+ * @param bezierPieces
+ * @param p
+ * @param bestSquaredDistance
+ */
+declare function cullByTightBoundingBox(bezierPieces: BezierPiece[], p: number[], bestSquaredDistance: number): BezierPiece[];
+export { cullByTightBoundingBox };

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

@@ -1,27 +1,27 @@
-import { getBoundingBoxTight } from "flo-bezier3";
-import { memoize } from "flo-memoize";
-import { getClosestSquaredDistanceToRotatedRect } from '../geometry/get-closest-squared-distance-to-rotated-rect.js';
-const getBoundingBoxTight_ = memoize(getBoundingBoxTight);
-/**
- * @hidden
- * When checking distances, ignore all those with closest possible distance
- * further than 'bestSquaredDistance', i.e. cull them.
- * @param bezierPieces
- * @param p
- * @param bestSquaredDistance
- */
-function cullByTightBoundingBox(bezierPieces, p, bestSquaredDistance) {
-    let candidateBezierPieces = [];
-    for (let i = 0; i < bezierPieces.length; i++) {
-        let bezierPiece = bezierPieces[i];
-        let ps = bezierPiece.curve.ps;
-        let tightBoundingBox = getBoundingBoxTight_(ps);
-        let d = getClosestSquaredDistanceToRotatedRect(tightBoundingBox, p);
-        if (d <= bestSquaredDistance) {
-            candidateBezierPieces.push(bezierPiece);
-        }
-    }
-    return candidateBezierPieces;
-}
-export { cullByTightBoundingBox };
+import { getBoundingBoxTight } from "flo-bezier3";
+import { memoize } from "flo-memoize";
+import { getClosestSquaredDistanceToRotatedRect } from '../geometry/get-closest-squared-distance-to-rotated-rect.js';
+const getBoundingBoxTight_ = memoize(getBoundingBoxTight);
+/**
+ * @hidden
+ * When checking distances, ignore all those with closest possible distance
+ * further than 'bestSquaredDistance', i.e. cull them.
+ * @param bezierPieces
+ * @param p
+ * @param bestSquaredDistance
+ */
+function cullByTightBoundingBox(bezierPieces, p, bestSquaredDistance) {
+    const candidateBezierPieces = [];
+    for (let i = 0; i < bezierPieces.length; i++) {
+        const bezierPiece = bezierPieces[i];
+        const ps = bezierPiece.curve.ps;
+        const tightBoundingBox = getBoundingBoxTight_(ps);
+        const d = getClosestSquaredDistanceToRotatedRect(tightBoundingBox, p);
+        if (d <= bestSquaredDistance) {
+            candidateBezierPieces.push(bezierPiece);
+        }
+    }
+    return candidateBezierPieces;
+}
+export { cullByTightBoundingBox };
 //# sourceMappingURL=cull-by-tight-boundary-box.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"cull-by-tight-boundary-box.js","sourceRoot":"","sources":["../../../src/mat/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,IAAI,qBAAqB,GAAG,EAAE,CAAC;IAE/B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,IAAI,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QAE9B,IAAI,gBAAgB,GAAG,oBAAoB,CAAC,EAAE,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,sCAAsC,CACtC,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"}
+{"version":3,"file":"cull-by-tight-boundary-box.js","sourceRoot":"","sources":["../../../src/mat/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/mat/closest-boundary-point/get-best-distance-squared.d.ts

@@ -1,8 +1,8 @@
-import { BezierPiece } from "../bezier-piece.js";
-/**
- * @hidden
- * Finds an initial distance such that the closest point can not be further than
- * this distance away.
- */
-declare function getBestDistanceSquared(bezierPieces: BezierPiece[], p: number[]): number;
-export { getBestDistanceSquared };
+import { BezierPiece } from "../bezier-piece.js";
+/**
+ * @hidden
+ * Finds an initial distance such that the closest point can not be further than
+ * this distance away.
+ */
+declare function getBestDistanceSquared(bezierPieces: BezierPiece[], p: number[]): number;
+export { getBestDistanceSquared };

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

@@ -1,25 +1,25 @@
-import { evalDeCasteljau } from 'flo-bezier3';
-import { squaredDistanceBetween } from 'flo-vector2d';
-/**
- * @hidden
- * Finds an initial distance such that the closest point can not be further than
- * this distance away.
- */
-function getBestDistanceSquared(bezierPieces, p) {
-    let bestSquaredDistance = Number.POSITIVE_INFINITY;
-    for (let i = 0; i < bezierPieces.length; i++) {
-        let bezierPiece = bezierPieces[i];
-        let ps = bezierPiece.curve.ps;
-        let p1 = evalDeCasteljau(ps, bezierPiece.ts[0]);
-        let p2 = evalDeCasteljau(ps, bezierPiece.ts[1]);
-        let d = Math.min(squaredDistanceBetween(p, p1), squaredDistanceBetween(p, p2));
-        if (d < bestSquaredDistance) {
-            bestSquaredDistance = d;
-        }
-    }
-    // The extra multiplier is to account for floating point precision.
-    // TODO - remove delta (or base it on theory)
-    return bestSquaredDistance * 1.01;
-}
-export { getBestDistanceSquared };
+import { evalDeCasteljau } from 'flo-bezier3';
+import { squaredDistanceBetween } from 'flo-vector2d';
+/**
+ * @hidden
+ * Finds an initial distance such that the closest point can not be further than
+ * this distance away.
+ */
+function getBestDistanceSquared(bezierPieces, p) {
+    let bestSquaredDistance = Number.POSITIVE_INFINITY;
+    for (let i = 0; i < bezierPieces.length; i++) {
+        const bezierPiece = bezierPieces[i];
+        const ps = bezierPiece.curve.ps;
+        const p1 = evalDeCasteljau(ps, bezierPiece.ts[0]);
+        const p2 = evalDeCasteljau(ps, bezierPiece.ts[1]);
+        const d = Math.min(squaredDistanceBetween(p, p1), squaredDistanceBetween(p, p2));
+        if (d < bestSquaredDistance) {
+            bestSquaredDistance = d;
+        }
+    }
+    // The extra multiplier is to account for floating point precision.
+    // TODO - remove delta (or base it on theory)
+    return bestSquaredDistance * 1.01;
+}
+export { getBestDistanceSquared };
 //# sourceMappingURL=get-best-distance-squared.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"get-best-distance-squared.js","sourceRoot":"","sources":["../../../src/mat/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,IAAI,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAElC,IAAI,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QAE9B,IAAI,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhD,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CACZ,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,6CAA6C;IAC7C,OAAO,mBAAmB,GAAG,IAAI,CAAC;AACtC,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}
+{"version":3,"file":"get-best-distance-squared.js","sourceRoot":"","sources":["../../../src/mat/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,6CAA6C;IAC7C,OAAO,mBAAmB,GAAG,IAAI,CAAC;AACtC,CAAC;AAGD,OAAO,EAAE,sBAAsB,EAAE,CAAA"}