flo-mat 3.0.15 → 4.0.1

package/node/find-2-prong/find-and-add-hole-closing-2-prongs.d.ts

@@ -1,13 +1,11 @@
-import { CpNode } from '../cp-node/cp-node.js';
-import { MatMeta } from '../mat/mat-meta.js';
+import type { CpNode } from '../cp-node/cp-node.js';
+import type { MatMeta } from '../mat/mat-meta.js';
 /**
+ * Find and add two-prongs that close any holes in the shape.
+ *
+ * @param meta
+ *
  * @internal
- * Find and add two-prongs that remove any holes in the shape.
- * @param loops The loops (that as a precondition must be ordered from
- * highest (i.e. smallest y-value) topmost point loops to lowest)
- * @param cpTrees
- * @param maxCoordinate The maximum coordinate value used to calculate floating point
- * tolerances.
  */
 declare function findAndAddHoleClosing2Prongs(meta: MatMeta): CpNode | undefined;
 export { findAndAddHoleClosing2Prongs };

package/node/find-2-prong/find-and-add-hole-closing-2-prongs.js

@@ -2,30 +2,29 @@ import { getMinYPos } from '../svg/get-min-y-pos.js';
 import { find2Prong } from './find-2-prong.js';
 import { add2Prong } from './add-2-prong.js';
 /**
+ * Find and add two-prongs that close any holes in the shape.
+ *
+ * @param meta
+ *
  * @internal
- * Find and add two-prongs that remove any holes in the shape.
- * @param loops The loops (that as a precondition must be ordered from
- * highest (i.e. smallest y-value) topmost point loops to lowest)
- * @param cpTrees
- * @param maxCoordinate The maximum coordinate value used to calculate floating point
- * tolerances.
  */
 function findAndAddHoleClosing2Prongs(meta) {
     const { loops } = meta;
     // Find the topmost points on each loop.
     const minYs = loops.map(getMinYPos);
     let cpNode;
+    const find2Prong_ = find2Prong(meta);
     // We start at 1 since 0 is the outer (root) loop
     for (let k = 1; k < minYs.length; k++) {
-        const posSource = minYs[k];
-        const holeClosingTwoProng = find2Prong(meta, true, false, 0, posSource);
-        if (!holeClosingTwoProng) {
+        const pposSource = minYs[k];
+        const posAntipode = find2Prong_(true, false, 0, pposSource);
+        if (!posAntipode) {
             throw new Error(`Unable to find hole-closing 2-prong`);
         }
-        // TODO important - handle case of n-prong, i.e. more than one antipode
+        // FUTURE - handle case of n-prong, i.e. more than one antipode
         // - currently we only handle case of single antipode (the general case)
-        const { circle, zs: posAntipodes } = holeClosingTwoProng;
-        const _cpNode = add2Prong(meta, circle, [posSource, posAntipodes[0]], true);
+        const { circle, z } = posAntipode;
+        const _cpNode = add2Prong(meta, circle, pposSource, z, true);
         cpNode = cpNode === undefined ? _cpNode : cpNode;
     }
     return cpNode;

package/node/find-2-prong/find-and-add-hole-closing-2-prongs.js.map

@@ -1 +1 @@
-{"version":3,"file":"find-and-add-hole-closing-2-prongs.js","sourceRoot":"","sources":["../../src/find-2-prong/find-and-add-hole-closing-2-prongs.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAI7C;;;;;;;;GAQG;AACH,SAAS,4BAA4B,CAC7B,IAAa;IAEjB,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IAEvB,wCAAwC;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAEpC,IAAI,MAA0B,CAAC;IAE/B,iDAAiD;IACjD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAE3B,MAAM,mBAAmB,GAAG,UAAU,CAClC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,CAClC,CAAC;QAEF,IAAI,CAAC,mBAAmB,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAC3D,CAAC;QAED,uEAAuE;QACvE,wEAAwE;QACxE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,GAAG,mBAAmB,CAAC;QAEzD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAE5E,MAAM,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;IACrD,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}
+{"version":3,"file":"find-and-add-hole-closing-2-prongs.js","sourceRoot":"","sources":["../../src/find-2-prong/find-and-add-hole-closing-2-prongs.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAG7C;;;;;;GAMG;AACH,SAAS,4BAA4B,CAC7B,IAAa;IAEjB,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IAEvB,wCAAwC;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAEpC,IAAI,MAA0B,CAAC;IAE/B,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAErC,iDAAiD;IACjD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAE5B,MAAM,WAAW,GAAG,WAAW,CAC3B,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,CAC7B,CAAC;QAEF,IAAI,CAAC,WAAW,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAC3D,CAAC;QAED,+DAA+D;QAC/D,wEAAwE;QACxE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,WAAW,CAAC;QAElC,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAE7D,MAAM,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;IACrD,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}

package/node/find-2-prong/get-initial-bezier-pieces.d.ts

@@ -1,8 +1,7 @@
-import { Loop } from 'flo-boolean';
-import { CurvePiece } from '../mat/curve-piece.js';
-import { PointOnShape } from '../point-on-shape/point-on-shape.js';
-import { Circle } from '../geometry/circle.js';
-import { MatMeta } from '../index.js';
+import type { Loop } from 'flo-boolean';
+import type { CurvePiece } from '../mat/curve-piece.js';
+import type { PrePointOnShape } from '../point-on-shape/point-on-shape.js';
+import type { MatMeta } from '../mat/mat-meta.js';
 /** @internal */
-declare function getInitialCurvePieces(angle: number, isHoleClosing: boolean, loop: Loop, loops: Loop[], meta: MatMeta, y: PointOnShape, circle: Circle): CurvePiece[];
+declare function getInitialCurvePieces(angle: number, isHoleClosing: boolean, loop: Loop, loops: Loop[], meta: MatMeta, yPos: PrePointOnShape, xO: number[]): CurvePiece[];
 export { getInitialCurvePieces };

package/node/find-2-prong/get-initial-bezier-pieces.js

@@ -2,11 +2,9 @@ import { getCpNodeToLeftOrSame } from '../mat/get-cp-node-to-left-or-same.js';
 import { getBoundaryPieceBeziers } from '../mat/get-boundary-piece-beziers.js';
 import { calcPosOrder } from '../point-on-shape/calc-pos-order.js';
 import { isPosCorner } from '../point-on-shape/is-pos-corner.js';
-import { getPosCorner } from '../point-on-shape/get-pos-corner.js';
+import { getPosCorner$ } from '../point-on-shape/get-pos-corner.js';
 /** @internal */
-function getInitialCurvePieces(angle, isHoleClosing, loop, loops, 
-// cpTrees: Map<Loop,LlRbTree<CpNode>>,
-meta, y, circle) {
+function getInitialCurvePieces(angle, isHoleClosing, loop, loops, meta, yPos, xO) {
     const { cpTrees } = meta;
     if (isHoleClosing) {
         return loops
@@ -14,20 +12,19 @@ meta, y, circle) {
             .flatMap(loop => loop.curves
             .map(curve => ({ curve, ts: [0, 1] })));
     }
-    const order = isPosCorner(y) && getPosCorner(y).isDull
-        ? y.t === 1 && angle === 0
+    const order = isPosCorner(yPos) && getPosCorner$(yPos).isDull
+        ? yPos.t === 1 && angle === 0
             ? -1
-            : y.t === 0
+            : yPos.t === 0
                 ? +1
-                : calcPosOrder(circle, y)
+                : calcPosOrder(xO, yPos)
         : 0;
-    const cpNode = getCpNodeToLeftOrSame(cpTrees.get(loop), y, order, 0);
+    const cpNode = getCpNodeToLeftOrSame(cpTrees.get(loop), yPos, order, 0);
     if (!cpNode ||
         // The special case if there is only a single sharp corner or 
         // two-way terminating 2-prong currently in the MAT. Don't remove!
         (cpNode === cpNode.next.next)) {
-        return loop.curves
-            .map(curve => ({ curve, ts: [0, 1] }));
+        return loop.curves.map(curve => ({ curve, ts: [0, 1] }));
     }
     return getBoundaryPieceBeziers([cpNode, cpNode]);
 }

package/node/find-2-prong/get-initial-bezier-pieces.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-initial-bezier-pieces.js","sourceRoot":"","sources":["../../src/find-2-prong/get-initial-bezier-pieces.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,qBAAqB,EAAE,MAAM,uCAAuC,CAAC;AAC9E,OAAO,EAAE,uBAAuB,EAAE,MAAM,sCAAsC,CAAC;AAI/E,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AAEnE,OAAO,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACjE,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AAInE,gBAAgB;AAChB,SAAS,qBAAqB,CACtB,KAAa,EACb,aAAsB,EACtB,IAAU,EACV,KAAa;AACb,uCAAuC;AACvC,IAAa,EACb,CAAe,EACf,MAAc;IAElB,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAEzB,IAAI,aAAa,EAAE,CAAC;QAChB,OAAO,KAAK;aACX,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;aAC/B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM;aACvB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM;QAClD,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;YACtB,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACX,CAAC,CAAC,CAAC,CAAC;gBACJ,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC,CAAC;IAER,MAAM,MAAM,GAAG,qBAAqB,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IACtE,IAAI,CAAC,MAAM;QACP,8DAA8D;QAC9D,kEAAkE;QAClE,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAC/B,CAAC;QACC,OAAO,IAAI,CAAC,MAAM;aACjB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,uBAAuB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AACrD,CAAC;AAGD,OAAO,EAAE,qBAAqB,EAAE,CAAA"}
+{"version":3,"file":"get-initial-bezier-pieces.js","sourceRoot":"","sources":["../../src/find-2-prong/get-initial-bezier-pieces.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,qBAAqB,EAAE,MAAM,uCAAuC,CAAC;AAC9E,OAAO,EAAE,uBAAuB,EAAE,MAAM,sCAAsC,CAAC;AAC/E,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AACnE,OAAO,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACjE,OAAO,EAAE,aAAa,EAAE,MAAM,qCAAqC,CAAC;AAGpE,gBAAgB;AAChB,SAAS,qBAAqB,CACtB,KAAa,EACb,aAAsB,EACtB,IAAU,EACV,KAAa,EACb,IAAa,EACb,IAAqB,EACrB,EAAY;IAEhB,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAEzB,IAAI,aAAa,EAAE,CAAC;QAChB,OAAO,KAAK;aACX,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;aAC/B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM;aACvB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CACxC,CAAC;IACN,CAAC;IAED,MAAM,KAAK,GACP,WAAW,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM;QAC3C,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;YACzB,CAAC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC;gBACd,CAAC,CAAC,CAAC,CAAC;gBACJ,CAAC,CAAC,YAAY,CAAC,EAAE,EAAE,IAAI,CAAC;QAC5B,CAAC,CAAC,CAAC,CAAC;IAEZ,MAAM,MAAM,GAAG,qBAAqB,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IACzE,IAAI,CAAC,MAAM;QACP,8DAA8D;QAC9D,kEAAkE;QAClE,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAEhC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,uBAAuB,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AACrD,CAAC;AAGD,OAAO,EAAE,qBAAqB,EAAE,CAAA"}

package/node/find-2-prong/get-initial-x.d.ts

@@ -0,0 +1,12 @@
+import type { PrePointOnShape } from '../point-on-shape/point-on-shape.js';
+/**
+ *
+ * @param angle
+ * @param isHoleClosing `true` if this is a hole-closing two-prong, `false` otherwise
+ * @param maxOscRadius the maximum that the osculating circle radius can be
+ * @param yPos the source point of the 2-prong to be found
+ *
+ * @internal
+*/
+declare function getInitialX(angle: number, isHoleClosing: boolean, maxOscRadius: number, yPos: PrePointOnShape, nnorm: number[]): [number[], number];
+export { getInitialX };

package/node/find-2-prong/get-initial-x.js

@@ -0,0 +1,35 @@
+import { getOsculatingCircle } from '../point-on-shape/get-osculating-circle.js';
+const { sqrt } = Math;
+/**
+ *
+ * @param angle
+ * @param isHoleClosing `true` if this is a hole-closing two-prong, `false` otherwise
+ * @param maxOscRadius the maximum that the osculating circle radius can be
+ * @param yPos the source point of the 2-prong to be found
+ *
+ * @internal
+*/
+function getInitialX(angle, isHoleClosing, maxOscRadius, yPos, nnorm) {
+    let xO;
+    let rO;
+    const { p: y } = yPos;
+    if (isHoleClosing) {
+        return [
+            [y[0], y[1] - maxOscRadius], // xO
+            maxOscRadius // rO
+        ];
+    }
+    if (angle === 0) {
+        return getOsculatingCircle(maxOscRadius, yPos, nnorm);
+    }
+    const { p } = yPos;
+    const [tx, ty] = nnorm;
+    const l = sqrt(tx * tx + ty * ty);
+    const scale = maxOscRadius / l;
+    const v = [tx * scale, ty * scale];
+    xO = [p[0] + v[0], p[1] + v[1]];
+    rO = maxOscRadius;
+    return [xO, rO];
+}
+export { getInitialX };
+//# sourceMappingURL=get-initial-x.js.map

package/node/find-2-prong/get-initial-x.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-initial-x.js","sourceRoot":"","sources":["../../src/find-2-prong/get-initial-x.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,mBAAmB,EAAE,MAAM,4CAA4C,CAAC;AAEjF,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAGtB;;;;;;;;EAQE;AACF,SAAS,WAAW,CACZ,KAAa,EACb,aAAsB,EACtB,YAAoB,EACpB,IAAqB,EACrB,KAAe;IAEnB,IAAI,EAAY,CAAC;IACjB,IAAI,EAAU,CAAC;IAEf,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;IAEtB,IAAI,aAAa,EAAE,CAAC;QAChB,OAAO;YACH,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,EAAG,KAAK;YACnC,YAAY,CAAkB,KAAK;SACtC,CAAC;IACN,CAAC;IAED,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QACd,OAAO,mBAAmB,CAAC,YAAY,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;IACnB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC;IACvB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,YAAY,GAAC,CAAC,CAAC;IAE7B,MAAM,CAAC,GAAG,CAAC,EAAE,GAAC,KAAK,EAAE,EAAE,GAAC,KAAK,CAAC,CAAC;IAC/B,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,EAAE,GAAG,YAAY,CAAC;IAElB,OAAO,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;AACnB,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

package/node/find-2-prong/get-medial/antipodal-point.d.ts

@@ -0,0 +1,8 @@
+import type { Curve } from "flo-boolean";
+interface AntipodalPoint {
+    readonly curve: Curve;
+    readonly s: number;
+    readonly d: number;
+    readonly x: number[];
+}
+export type { AntipodalPoint };

package/node/find-2-prong/get-medial/antipodal-point.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=antipodal-point.js.map

package/node/find-2-prong/get-medial/antipodal-point.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"antipodal-point.js","sourceRoot":"","sources":["../../../src/find-2-prong/get-medial/antipodal-point.ts"],"names":[],"mappings":""}

package/node/find-2-prong/get-medial/get-antipodal-points.d.ts

@@ -0,0 +1,18 @@
+import type { CurvePiece } from '../../mat/curve-piece.js';
+import type { PrePointOnShape } from '../../point-on-shape/point-on-shape.js';
+import type { AntipodalPoint } from './antipodal-point.js';
+/**
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ *
+ * @param maxCoordPowerOf2
+ * @param nnorm
+ * @param yPos
+ * @param for1Prong defaults to `false`;
+ * @param angle angle from normal
+ * @param curvePieces
+ *
+ * @internal
+ */
+declare function getAntipodalPoints(maxCoordPowerOf2: number, nnorm: number[], yPos: PrePointOnShape, for1Prong: boolean, angle: number, curvePieces: CurvePiece[]): AntipodalPoint[];
+export { getAntipodalPoints };

package/node/find-2-prong/get-medial/get-antipodal-points.js

@@ -0,0 +1,41 @@
+import { getClosestPoint } from './get-closest-points.js';
+/**
+ * Returns the closest boundary point to the given point, limited to the given
+ * bezier pieces, including the beziers actually checked after culling.
+ *
+ * @param maxCoordPowerOf2
+ * @param nnorm
+ * @param yPos
+ * @param for1Prong defaults to `false`;
+ * @param angle angle from normal
+ * @param curvePieces
+ *
+ * @internal
+ */
+function getAntipodalPoints(maxCoordPowerOf2, nnorm, yPos, for1Prong, angle, curvePieces) {
+    const pInfoss = [];
+    for (let i = 0; i < curvePieces.length; i++) {
+        const curvePiece = curvePieces[i];
+        const pInfos = getClosestPoint(maxCoordPowerOf2, nnorm, yPos, for1Prong, angle, curvePiece);
+        pInfoss.push(...pInfos);
+    }
+    /** the minimum max value */
+    let minMax = Infinity;
+    for (let i = 0; i < pInfoss.length; i++) {
+        const diMax = pInfoss[i].d * (1 + 2 ** -46);
+        if (diMax < minMax) {
+            minMax = diMax;
+        }
+    }
+    const antipodalPoints = [];
+    for (let i = 0; i < pInfoss.length; i++) {
+        const info = pInfoss[i];
+        const d = info.d * (1 - 2 ** -46);
+        if (d <= minMax) {
+            antipodalPoints.push(info);
+        }
+    }
+    return antipodalPoints;
+}
+export { getAntipodalPoints };
+//# sourceMappingURL=get-antipodal-points.js.map

package/node/find-2-prong/get-medial/get-antipodal-points.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-antipodal-points.js","sourceRoot":"","sources":["../../../src/find-2-prong/get-medial/get-antipodal-points.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAG1D;;;;;;;;;;;;GAYG;AACH,SAAS,kBAAkB,CACnB,gBAAwB,EACxB,KAAe,EACf,IAAqB,EACrB,SAAkB,EAClB,KAAa,EACb,WAAyB;IAE7B,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,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,MAAM,GAAG,eAAe,CAC1B,gBAAgB,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAC/C,UAAU,CACb,CAAC;QAEF,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;IAC5B,CAAC;IAGD,4BAA4B;IAC5B,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,KAAK,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,KAAK,CAAC;QACnB,CAAC;IACL,CAAC;IAED,MAAM,eAAe,GAAqB,EAAE,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;YACd,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC;IAED,OAAO,eAAe,CAAC;AAC3B,CAAC;AAGD,OAAO,EAAE,kBAAkB,EAAE,CAAA"}

package/node/find-2-prong/get-medial/get-closest-points.d.ts

@@ -0,0 +1,15 @@
+import type { CurvePiece } from "../../mat/curve-piece.js";
+import type { PrePointOnShape } from "../../point-on-shape/point-on-shape.js";
+import type { AntipodalPoint } from './antipodal-point.js';
+/**
+ * @param maxCoordPowerOf2
+ * @param nnorm
+ * @param yPos The point on the shape
+ * @param for1Prong defaults to `false`;
+ * @param angle defaults to `0`;
+ * @param curvePiece The curve piece
+ *
+ * @internal
+ */
+declare function getClosestPoint(maxCoordPowerOf2: number, nnorm: number[], yPos: PrePointOnShape, for1Prong: boolean, angle: number, curvePiece: CurvePiece): AntipodalPoint[];
+export { getClosestPoint };

package/node/find-2-prong/get-medial/get-closest-points.js

@@ -0,0 +1,163 @@
+import { lengthSquared } from "flo-vector2d";
+import { roots, deflate, Horner } from 'flo-poly';
+import { evalDeCasteljau, getMedialPointCoeffs, getMedialPointCoeffsBez0 } from 'flo-bezier3';
+const { sqrt, abs, max } = Math;
+/**
+ * @param maxCoordPowerOf2
+ * @param nnorm
+ * @param yPos The point on the shape
+ * @param for1Prong defaults to `false`;
+ * @param angle defaults to `0`;
+ * @param curvePiece The curve piece
+ *
+ * @internal
+ */
+function getClosestPoint(maxCoordPowerOf2, nnorm, yPos, for1Prong, angle, curvePiece) {
+    const { curve, ts: [tS, tE] } = curvePiece;
+    const { ps } = curve;
+    const { curve: touchedCurve, t, p: y } = yPos;
+    const shouldDeflate = angle === 0 && curve === touchedCurve;
+    const infos = [];
+    // let onePushed = false;
+    let startPushed = false;
+    let endPushed = false;
+    let ss;
+    if (tS !== tE) {
+        const { A, B, C, D, H } = getMedialPointCoeffs(y, nnorm, ps);
+        const def = shouldDeflate ? deflate(H, t) : undefined;
+        const def2 = for1Prong && shouldDeflate
+            ? deflate(def, t)
+            : undefined;
+        const def3 = for1Prong && shouldDeflate
+            ? deflate(def2, t)
+            : undefined;
+        const pDd = def3 ?? def ?? H;
+        ss = roots(pDd, tS, tE) || [];
+        //-----------------------
+        for (let i = 0; i < ss.length; i++) {
+            const ri = ss[i];
+            const { tS: sS, tE: sE, t: _s } = ri;
+            if (ri.multiplicity > 1) {
+                continue;
+            }
+            if (sE < tS || sS > tE) {
+                continue;
+            } // outside curve piece
+            const s = _s < 0 ? 0 : _s > 1 ? 1 : _s; // clip to [0,1]
+            //-----------------------
+            const AS = Horner(A, s);
+            const BS = Horner(B, s);
+            const CS = Horner(C, s);
+            const DS = Horner(D, s);
+            const _AS = abs(AS);
+            const _CS = abs(CS);
+            if (max(_AS, _CS) < 2 ** -40) {
+                continue;
+            }
+            const w = _AS > _CS
+                ? -BS / AS
+                : -DS / CS; // alternative
+            if (w <= 0) {
+                // If `w` is negative the circle radius is negative -> discard
+                continue;
+            }
+            const V = [w * nnorm[0], w * nnorm[1]];
+            const d = sqrt(lengthSquared(V));
+            if (d <= 2 ** (maxCoordPowerOf2 - 40)) {
+                // If `w` <= 2**-40 -> discard
+                continue;
+            }
+            const x = [y[0] + V[0], y[1] + V[1]];
+            //-----------------------
+            if (ri.tS <= tS && ri.tE >= tS) {
+                startPushed = true;
+            }
+            if (ri.tS <= tE && ri.tE >= tE) {
+                endPushed = true;
+            }
+            // If the point is the first control point of the curve then we
+            // ensure the point becomes the last control point of the prior
+            // curve to induce some symmetery and simplify the algorithm.
+            const s_ = s === 0 ? 1 : s;
+            const curve_ = s === 0 ? curve.prev : curve;
+            const info = {
+                curve: curve_,
+                s: s_,
+                d, x
+            };
+            infos.push(info);
+        }
+    }
+    //------------------------------------------
+    const pLast = ps[ps.length - 1];
+    let dontPush1 = ((t === 0 && curve === touchedCurve.prev) ||
+        (t === 1 && curve === touchedCurve));
+    //--------------------------------------
+    // Also check curve start control point
+    //--------------------------------------
+    const PS = [];
+    if (tS === 0) {
+        // We never check points at `t === 0` since they are covered by the previous curve's endpoint
+        // which cannot be culled if this curve`s `t === 0` is included
+    }
+    else if (tS === 1) {
+        if (!dontPush1 && !startPushed) {
+            PS.push({ P: pLast, t: 1 });
+        }
+    }
+    else {
+        if (!startPushed) {
+            const pp = evalDeCasteljau(ps, tS);
+            PS.push({ P: pp, t: tS });
+        }
+    }
+    //--------------------------------------
+    // Also check curve end control point
+    //--------------------------------------
+    if (tS !== tE) {
+        if (tE === 0) {
+            // We never check points at `t === 0` since they are covered by the previous curve's endpoint
+            // which cannot be culled if this curve`s `t === 0` is included
+        }
+        else if (tE === 1) {
+            if (!dontPush1 && !endPushed) {
+                PS.push({ P: pLast, t: 1 });
+                dontPush1 = true;
+            }
+        }
+        else {
+            if (!endPushed) {
+                const pp = evalDeCasteljau(ps, tE);
+                PS.push({ P: pp, t: tE });
+            }
+        }
+    }
+    //------------------------------------------
+    for (let i = 0; i < PS.length; i++) {
+        //-----------------------
+        const { P, t: s } = PS[i];
+        const { a0, b0 } = getMedialPointCoeffsBez0(y, nnorm, P);
+        if (abs(a0) <= 2 ** -40 || abs(b0) <= 2 ** -40) {
+            continue;
+        }
+        const w = -b0 / a0;
+        // too close to point of origin *or* negative;
+        if (w < 2 ** -40) {
+            continue;
+        }
+        const V = [w * nnorm[0], w * nnorm[1]];
+        const d = sqrt(lengthSquared(V));
+        const x = [y[0] + V[0], y[1] + V[1]];
+        const s_ = s === 0 ? 1 : s;
+        const curve_ = s === 0 ? curve.prev : curve;
+        const info = {
+            curve: curve_,
+            s: s_,
+            d, x
+        };
+        infos.push(info);
+    }
+    return infos;
+}
+export { getClosestPoint };
+//# sourceMappingURL=get-closest-points.js.map

package/node/find-2-prong/get-medial/get-closest-points.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-closest-points.js","sourceRoot":"","sources":["../../../src/find-2-prong/get-medial/get-closest-points.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClD,OAAO,EAAE,eAAe,EAAE,oBAAoB,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAC;AAE9F,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAGhC;;;;;;;;;GASG;AACH,SAAS,eAAe,CAChB,gBAAwB,EACxB,KAAe,EACf,IAAqB,EACrB,SAAkB,EAClB,KAAa,EACb,UAAsB;IAE1B,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,GAAG,UAAU,CAAC;IAC1C,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC;IACrB,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;IAE9C,MAAM,aAAa,GAAG,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC;IAE5D,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,yBAAyB;IACzB,IAAI,WAAW,GAAG,KAAK,CAAC;IACxB,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,IAAI,EAAkB,CAAC;IACvB,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACZ,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,oBAAoB,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAE7D,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEvD,MAAM,IAAI,GAAG,SAAS,IAAI,aAAa;YACnC,CAAC,CAAC,OAAO,CAAC,GAAI,EAAE,CAAE,CAAC;YACnB,CAAC,CAAC,SAAS,CAAC;QAEhB,MAAM,IAAI,GAAG,SAAS,IAAI,aAAa;YACnC,CAAC,CAAC,OAAO,CAAC,IAAK,EAAE,CAAE,CAAC;YACpB,CAAC,CAAC,SAAS,CAAC;QAEhB,MAAM,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC,CAAC;QAE7B,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9B,yBAAyB;QAEzB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;YACrC,IAAI,EAAE,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;gBACtB,SAAS;YACb,CAAC;YAED,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;gBAAC,SAAS;YAAC,CAAC,CAAE,sBAAsB;YAE7D,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,CAAE,gBAAgB;YAEzD,yBAAyB;YACzB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAExB,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;YAEpB,IAAI,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,EAAE,CAAC;gBAAC,SAAS;YAAC,CAAC;YAEzC,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG;gBACf,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE;gBACV,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAE,cAAc;YAE/B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACT,8DAA8D;gBAC9D,SAAS;YACb,CAAC;YAED,MAAM,CAAC,GAAG,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;YAEjC,IAAI,CAAC,IAAI,CAAC,IAAE,CAAC,gBAAgB,GAAG,EAAE,CAAC,EAAE,CAAC;gBAClC,8BAA8B;gBAC9B,SAAS;YACb,CAAC;YAED,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,yBAAyB;YAEzB,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC7B,WAAW,GAAG,IAAI,CAAC;YACvB,CAAC;YACD,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC7B,SAAS,GAAG,IAAI,CAAC;YACrB,CAAC;YAGD,+DAA+D;YAC/D,+DAA+D;YAC/D,6DAA6D;YAC7D,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,MAAM,IAAI,GAAmB;gBACzB,KAAK,EAAE,MAAM;gBACb,CAAC,EAAE,EAAE;gBACL,CAAC,EAAE,CAAC;aACP,CAAC;YAEF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACL,CAAC;IAID,4CAA4C;IAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEhC,IAAI,SAAS,GAAG,CACZ,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAa,CAAC,IAAI,CAAC;QACzC,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,YAAY,CAAC,CACtC,CAAC;IAGF,wCAAwC;IACxC,uCAAuC;IACvC,wCAAwC;IACxC,MAAM,EAAE,GAAiC,EAAE,CAAC;IAC5C,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACX,6FAA6F;QAC7F,+DAA+D;IACnE,CAAC;SAAM,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,IAAI,CAAC,WAAW,EAAE,CAAC;YAC7B,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;IACL,CAAC;SAAM,CAAC;QACJ,IAAI,CAAC,WAAW,EAAE,CAAC;YACf,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACnC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,wCAAwC;IACxC,qCAAqC;IACrC,wCAAwC;IACxC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACZ,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACX,6FAA6F;YAC7F,+DAA+D;QACnE,CAAC;aAAM,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC3B,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBAAC,SAAS,GAAG,IAAI,CAAC;YAClD,CAAC;QACL,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,SAAS,EAAE,CAAC;gBACb,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACnC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9B,CAAC;QACL,CAAC;IACL,CAAC;IACD,4CAA4C;IAG5C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,yBAAyB;QACzB,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,wBAAwB,CAAC,CAAC,EAAC,KAAK,EAAC,CAAC,CAAC,CAAC;QAEvD,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAE,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAE,CAAC,EAAE,EAAE,CAAC;YACzC,SAAS;QACb,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;QAEnB,8CAA8C;QAC9C,IAAI,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,EAAE,CAAC;YACb,SAAS;QACb,CAAC;QAED,MAAM,CAAC,GAAG,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAErC,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,MAAM,IAAI,GAAmB;YACzB,KAAK,EAAE,MAAM;YACb,CAAC,EAAE,EAAE;YACL,CAAC,EAAE,CAAC;SACP,CAAC;QAEF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/find-2-prong/reduce-radius.d.ts

@@ -1,8 +1,8 @@
-import { CurvePiece } from '../mat/curve-piece.js';
+import type { CurvePiece } from '../mat/curve-piece.js';
 /**
- * @internal
- *
  * Reduces the circle radius initially as an optimization step.
+ *
+ * @internal
  */
-declare function reduceRadius(extreme: number, curvePieces: CurvePiece[], p: number[], x: number[]): number;
+declare function reduceRadius(maxCoordPowerOf2: number, curvePieces: CurvePiece[], y: number[], nnorm: number[]): number;
 export { reduceRadius };

package/node/find-2-prong/reduce-radius.js

@@ -1,63 +1,43 @@
-import { evalDeCasteljau } from "flo-bezier3";
-import { dot, lineLineIntersection, squaredDistanceBetween } from "flo-vector2d";
+import { getMedialPointCoeffsBez0 } from "flo-bezier3";
+import { lengthSquared, squaredDistanceBetween } from "flo-vector2d";
+const { abs } = Math;
+const TOLERANCE = 1 + 2 ** -20;
 /**
- * @internal
- *
  * Reduces the circle radius initially as an optimization step.
+ *
+ * @internal
  */
-function reduceRadius(extreme, curvePieces, p, x) {
-    const TOLERANCE = 1 + 2 ** -10;
-    let minRadius = Number.POSITIVE_INFINITY;
+function reduceRadius(maxCoordPowerOf2, curvePieces, y, nnorm) {
+    let minRadius = Infinity;
+    let x = [y[0] + nnorm[0], y[1] + nnorm[1]];
     for (let i = 0; i < curvePieces.length; i++) {
         const curvePiece = curvePieces[i];
-        const ps = curvePiece.curve.ps;
-        // let min = Number.POSITIVE_INFINITY;
-        const num = 2;
-        for (let j = 0; j < (num + 1); j++) {
-            const p_ = evalDeCasteljau(ps, curvePiece.ts[j / num]);
-            const cc = getCircleCenterFrom2PointsAndNormal(extreme, p, x, p_);
-            if (cc) {
-                let r = squaredDistanceBetween(p, cc);
-                if (r < minRadius) {
-                    minRadius = r;
-                }
+        const { ps } = curvePiece.curve;
+        const pS = ps[0];
+        const pE = ps[ps.length - 1];
+        for (const P of [pS, pE]) {
+            if (squaredDistanceBetween(x, P) > minRadius) {
+                continue; // short-circuit
+            }
+            const { a0, b0 } = getMedialPointCoeffsBez0(y, nnorm, P);
+            if (abs(a0) <= 2 ** -40 || abs(b0) <= 2 ** -40) {
+                continue;
+            }
+            const w = -b0 / a0;
+            // too close to point of origin *or* negative;
+            if (w < 2 ** -40) {
+                continue;
+            }
+            const N = [w * nnorm[0], w * nnorm[1]];
+            const r = lengthSquared(N);
+            if (r < minRadius) {
+                minRadius = r;
+                x = [y[0] + N[0], y[1] + N[1]];
             }
         }
     }
     // The extra bit is to account for floating point precision.
     return TOLERANCE * minRadius;
 }
-/**
- * @internal
- * @param p A point on the circle with normal pointing to x towards the center
- * of the circle.
- * @param x
- * @param p1 Another point on the circle.
- */
-function getCircleCenterFrom2PointsAndNormal(extreme, p, x, p1) {
-    const TOLERANCE = (2 ** -14 * extreme) ** 2;
-    // Ignore if p and p1 are too close together
-    if (squaredDistanceBetween(p, p1) < TOLERANCE) {
-        return undefined;
-    }
-    /** The perpindicular bisector between the two given points on the circle */
-    const pb = [
-        (p[0] + p1[0]) / 2,
-        (p[1] + p1[1]) / 2,
-    ];
-    const tan = [p1[0] - p[0], p1[1] - p[1]];
-    const norm = [-tan[1], tan[0]]; // Rotate by 90 degrees
-    const pb2 = [pb[0] + norm[0], pb[1] + norm[1]];
-    const res = lineLineIntersection([p, x], [pb, pb2]);
-    if (!res) {
-        return undefined;
-    }
-    const resO = [res[0] - p[0], res[1] - p[1]];
-    const xO = [x[0] - p[0], x[1] - p[1]];
-    if (dot(resO, xO) < 0) {
-        return undefined;
-    }
-    return res;
-}
 export { reduceRadius };
 //# sourceMappingURL=reduce-radius.js.map

package/node/find-2-prong/reduce-radius.js.map

@@ -1 +1 @@
-{"version":3,"file":"reduce-radius.js","sourceRoot":"","sources":["../../src/find-2-prong/reduce-radius.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,GAAG,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAIjF;;;;GAIG;AACH,SAAS,YAAY,CACb,OAAe,EACf,WAAyB,EACzB,CAAW,EACX,CAAW;IAEf,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,CAAC;IAE7B,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,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,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAE/B,sCAAsC;QACtC,MAAM,GAAG,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC,CAAC;YACrD,MAAM,EAAE,GAAG,mCAAmC,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,EAAE,EAAE,CAAC;gBACL,IAAI,CAAC,GAAG,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACtC,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC;oBAChB,SAAS,GAAG,CAAC,CAAC;gBAClB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,4DAA4D;IAC5D,OAAO,SAAS,GAAC,SAAS,CAAC;AAC/B,CAAC;AAGD;;;;;;GAMG;AACH,SAAS,mCAAmC,CACpC,OAAe,EACf,CAAW,EACX,CAAW,EACX,EAAY;IAEhB,MAAM,SAAS,GAAG,CAAC,CAAC,IAAE,CAAC,EAAE,GAAC,OAAO,CAAC,IAAE,CAAC,CAAC;IAEtC,4CAA4C;IAC5C,IAAI,sBAAsB,CAAC,CAAC,EAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC;QAC3C,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,4EAA4E;IAC5E,MAAM,EAAE,GAAG;QACP,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAClB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;KACrB,CAAC;IACF,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,IAAI,GAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB;IACxD,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/C,MAAM,GAAG,GAAG,oBAAoB,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAEnD,IAAI,CAAC,GAAG,EAAE,CAAC;QAAC,OAAO,SAAS,CAAC;IAAC,CAAC;IAE/B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACpB,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,OAAO,GAAG,CAAC;AACf,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}
+{"version":3,"file":"reduce-radius.js","sourceRoot":"","sources":["../../src/find-2-prong/reduce-radius.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,wBAAwB,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAErE,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAGrB,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,CAAC;AAG7B;;;;GAIG;AACH,SAAS,YAAY,CACb,gBAAwB,EACxB,WAAyB,EACzB,CAAW,EACX,KAAe;IAEnB,IAAI,SAAS,GAAG,QAAQ,CAAC;IACzB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3C,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,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC;QAEhC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE7B,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,EAAC,EAAE,CAAC,EAAE,CAAC;YACtB,IAAI,sBAAsB,CAAC,CAAC,EAAC,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;gBAC1C,SAAS,CAAE,gBAAgB;YAC/B,CAAC;YAED,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,wBAAwB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;YAEzD,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAE,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,SAAS;YACb,CAAC;YAED,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;YAEnB,8CAA8C;YAC9C,IAAI,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,EAAE,CAAC;gBAAC,SAAS;YAAC,CAAC;YAE7B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAE3B,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC;gBAChB,SAAS,GAAG,CAAC,CAAC;gBACd,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;QACL,CAAC;IACL,CAAC;IAED,4DAA4D;IAC5D,OAAO,SAAS,GAAC,SAAS,CAAC;AAC/B,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}

package/node/find-3-prong/calc-better-x.d.ts

@@ -0,0 +1,22 @@
+import type { PrePointOnShape } from '../point-on-shape/point-on-shape.js';
+import type { CurvePiece } from '../mat/curve-piece.js';
+/**
+ * Find new `x` and `ps` that are better estimates of the 3-prong circle.
+ *
+ * The potential function, V, is defined as the distance to the actual 3 prong
+ * circle center.
+ *
+ * @param maxCoordPowerOf2
+ * @param curvePiece3s The three boundary pieces, each of which should contain
+ * a point of the 3-prong to be found.
+ * @param x The currently best guess at the center of the 3-prong circle.
+ * @param vectorToZeroV
+ *
+ * @internal
+ */
+declare function calcBetterX(maxCoordPowerOf2: number, curvePiece3s: CurvePiece[][], x: number[], vectorToZeroV: number[]): {
+    newX: number[];
+    newV: number;
+    newPoss: PrePointOnShape[];
+};
+export { calcBetterX };