flo-mat 2.0.4 → 3.0.0

package/node/debug/two-prong-for-debugging.d.ts

@@ -1,20 +1,20 @@
-import { CpNode } from '../cp-node.js';
-import { IPointOnShape } from '../point-on-shape.js';
-import { Circle } from '../circle.js';
+import { CpNode } from '../cp-node/cp-node.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
+import { Circle } from '../geometry/circle.js';
 import { BezierPiece } from '../mat/bezier-piece.js';
 import { Generated } from './debug.js';
-/** @hidden */
+/** @internal */
 interface TwoProngForDebugging {
     generated: Generated;
     bezierPieces: BezierPiece[];
-    pos: IPointOnShape;
+    pos: PointOnShape;
     δ: CpNode[];
     z: number[];
     circle: Circle;
     xs: {
         x: number[];
-        y: IPointOnShape;
-        z: IPointOnShape;
+        y: PointOnShape;
+        z: PointOnShape;
         t: number;
     }[];
     failed: boolean;

package/node/error-analysis/gamma.d.ts

@@ -0,0 +1,26 @@
+/**
+ * The canonical floating point error function, γ.
+ *
+ * * roughly `=== n * (Number.EPSILON / 2)`
+ * * see e.g. [Algorithms for Accurate, Validated and Fast Polynomial Evaluation](https://hal.archives-ouvertes.fr/hal-00285603/document)
+ * @param n the parameter - typically a small positive integer, e.g. for
+ * polynomial evaluation this === 2*d + 1, where d is the degree of the
+ * polynomial
+ *
+ * @doc
+ */
+declare function γ(n: number): number;
+/**
+ * The canonical, once compensated (implying double-double precision),
+ * floating point error function.
+ *
+ * * roughly `=== n * (Number.EPSILON / 2)**2`
+ * * see e.g. [Algorithms for Accurate, Validated and Fast Polynomial Evaluation](https://hal.archives-ouvertes.fr/hal-00285603/document)
+ * @param n the parameter - typically a small positive integer, e.g. for
+ * polynomial evaluation this === 2*d + 1, where d is the degree of the
+ * polynomial
+ *
+ * @doc
+ */
+declare function γγ(n: number): number;
+export { γ, γγ };

package/node/error-analysis/gamma.js

@@ -0,0 +1,35 @@
+const u = Number.EPSILON / 2;
+const uu = u * u;
+/**
+ * The canonical floating point error function, γ.
+ *
+ * * roughly `=== n * (Number.EPSILON / 2)`
+ * * see e.g. [Algorithms for Accurate, Validated and Fast Polynomial Evaluation](https://hal.archives-ouvertes.fr/hal-00285603/document)
+ * @param n the parameter - typically a small positive integer, e.g. for
+ * polynomial evaluation this === 2*d + 1, where d is the degree of the
+ * polynomial
+ *
+ * @doc
+ */
+function γ(n) {
+    const nu = n * u;
+    return nu / (1 - nu);
+}
+/**
+ * The canonical, once compensated (implying double-double precision),
+ * floating point error function.
+ *
+ * * roughly `=== n * (Number.EPSILON / 2)**2`
+ * * see e.g. [Algorithms for Accurate, Validated and Fast Polynomial Evaluation](https://hal.archives-ouvertes.fr/hal-00285603/document)
+ * @param n the parameter - typically a small positive integer, e.g. for
+ * polynomial evaluation this === 2*d + 1, where d is the degree of the
+ * polynomial
+ *
+ * @doc
+ */
+function γγ(n) {
+    const nuu = n * uu;
+    return nuu / (1 - nuu);
+}
+export { γ, γγ };
+//# sourceMappingURL=gamma.js.map

package/node/error-analysis/gamma.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gamma.js","sourceRoot":"","sources":["../../src/error-analysis/gamma.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;AAC7B,MAAM,EAAE,GAAG,CAAC,GAAC,CAAC,CAAC;AAGf;;;;;;;;;;GAUG;AACH,SAAS,CAAC,CAAC,CAAS;IAChB,MAAM,EAAE,GAAG,CAAC,GAAC,CAAC,CAAC;IAEf,OAAO,EAAE,GAAC,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC;AACrB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,EAAE,CAAC,CAAS;IACjB,MAAM,GAAG,GAAG,CAAC,GAAC,EAAE,CAAC;IAEjB,OAAO,GAAG,GAAC,CAAC,CAAC,GAAC,GAAG,CAAC,CAAC;AACvB,CAAC;AAGD,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAA"}

package/node/find-2-prong/add-1-prong.d.ts

@@ -0,0 +1,12 @@
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { Loop } from 'flo-boolean';
+import { CpNode } from '../cp-node/cp-node.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
+/**
+ * @hidden
+ * Add a 1-prong to the MAT.
+ * @param cpGraphs
+ * @param pos
+ */
+declare function add1Prong(radius: number, center: number[], cpGraphs: Map<Loop, LlRbTree<CpNode>>, pos: PointOnShape): void;
+export { add1Prong };

package/node/{mat/find-mat → find-2-prong}/add-1-prong.js

@@ -1,13 +1,14 @@
-import { getOsculatingCircle, calcPosOrder, isPosDullCorner } from '../../point-on-shape.js';
-import { addToCpGraph } from '../add-to-cp-graph.js';
-import { isAnotherCpCloseby } from '../is-another-cp-closeby.js';
+import { addToCpGraph } from '../mat/add-to-cp-graph.js';
+import { isAnotherCpCloseby } from '../mat/is-another-cp-closeby.js';
+import { isPosDullCorner } from '../point-on-shape/is-pos-dull-corner.js';
+import { calcPosOrder } from '../point-on-shape/calc-pos-order.js';
 /**
  * @hidden
  * Add a 1-prong to the MAT.
  * @param cpGraphs
  * @param pos
  */
-function add1Prong(maxOsculatingCircleRadius, cpGraphs, pos) {
+function add1Prong(radius, center, cpGraphs, pos) {
     //if (PointOnShape.isDullCorner(pos)) {
     if (isPosDullCorner(pos)) {
         // This is a 1-prong at a dull corner.
@@ -21,22 +22,21 @@ function add1Prong(maxOsculatingCircleRadius, cpGraphs, pos) {
         // Afterthought: there is a better way - split points by two prongs.
         //toRemove.push(posNode); // this!
         if (typeof _debug_ !== 'undefined') {
-            _debug_.generated.elems.oneProngAtDullCorner.push(pos);
+            // _debug_.generated.elems.oneProngAtDullCorner.push(pos);
         }
         return;
     }
-    //let circle = PointOnShape.getOsculatingCircle(maxOsculatingCircleRadius, pos);
-    const circle = getOsculatingCircle(maxOsculatingCircleRadius, pos);
-    //const order = PointOnShape.calcOrder(circle, pos);
+    // const circle = getOsculatingCircle(maxOsculatingCircleRadius, pos);
+    const circle = { radius, center };
     const order = calcPosOrder(circle, pos);
     // Make sure there isn't already a ContactPoint close by - it can cause
     // floating point stability issues.
-    if (isAnotherCpCloseby(cpGraphs, pos, circle, order, 0, 1000, 'magenta')) {
+    if (isAnotherCpCloseby(cpGraphs, pos, circle, order, 0, 1000)) {
         return;
     }
-    addToCpGraph(circle, [-0.5, +0.5], cpGraphs, [pos, pos]);
+    const cpNodes = addToCpGraph(circle, [-0.5, +0.5], cpGraphs, [pos, pos]);
     if (typeof _debug_ !== 'undefined') {
-        _debug_.generated.elems.oneProng.push(pos);
+        _debug_.generated.elems.oneProng.push(cpNodes);
     }
 }
 export { add1Prong };

package/node/find-2-prong/add-1-prong.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-1-prong.js","sourceRoot":"","sources":["../../src/find-2-prong/add-1-prong.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAErE,OAAO,EAAE,eAAe,EAAE,MAAM,yCAAyC,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AAInE;;;;;GAKG;AACH,SAAS,SAAS,CAChB,MAAc,EACR,MAAgB,EAChB,QAAoC,EACpC,GAAiB;IAExB,uCAAuC;IACpC,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE;QAC5B,sCAAsC;QAEtC,kBAAkB;QAClB,gEAAgE;QAChE,wEAAwE;QACxE,mEAAmE;QACnE,mEAAmE;QACnE,qEAAqE;QAC/D,kEAAkE;QAClE,oEAAoE;QAE1E,kCAAkC;QAElC,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;YAC1B,0DAA0D;SAC7D;QAEP,OAAO;KACP;IAED,sEAAsE;IACnE,MAAM,MAAM,GAAW,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAE7C,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACxC,uEAAuE;IACvE,mCAAmC;IACnC,IAAI,kBAAkB,CAAC,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE;QAC9D,OAAO;KACP;IAEE,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAE5E,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAC7B,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;KAClD;AACL,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}

package/node/{mat/find-mat → find-2-prong}/add-2-prong.d.ts

@@ -1,10 +1,10 @@
 import { LlRbTree } from 'flo-ll-rb-tree';
-import { Loop } from '../../loop.js';
-import { CpNode } from '../../cp-node.js';
-import { Circle } from '../../circle.js';
-import { IPointOnShape } from '../../point-on-shape.js';
+import { Loop } from 'flo-boolean';
+import { CpNode } from '../cp-node/cp-node.js';
+import { Circle } from '../geometry/circle.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
 /**
- * @hidden
+ * @internal
  * Adds a 2-prong contact circle to the shape.
  * @param cpGraphs
  * @param circle Circle containing the 2 contact points
@@ -14,8 +14,5 @@ import { IPointOnShape } from '../../point-on-shape.js';
  * @param extreme The maximum coordinate value used to calculate floating point
  * tolerances.
  */
-declare function add2Prong(cpGraphs: Map<Loop, LlRbTree<CpNode>>, circle: Circle, posSource: IPointOnShape, posAntipodes: {
-    pos: IPointOnShape;
-    d: number;
-}[], holeClosing: boolean, extreme: number): CpNode;
+declare function add2Prong(cpGraphs: Map<Loop, LlRbTree<CpNode>>, circle: Circle, posSource: PointOnShape, posAntipodes: PointOnShape[], holeClosing: boolean, extreme: number): CpNode | undefined;
 export { add2Prong };

package/node/{mat/find-mat → find-2-prong}/add-2-prong.js

@@ -1,10 +1,10 @@
-import { exponent } from 'big-float-ts';
-import { CpNode } from '../../cp-node.js';
-import { PointOnShape, calcPosOrder } from '../../point-on-shape.js';
-import { isAnotherCpCloseby } from '../is-another-cp-closeby.js';
-import { getNeighbouringPoints } from '../get-neighboring-cps.js';
+import { insertCpNode } from '../cp-node/cp-node.js';
+import { calcPosOrder } from '../point-on-shape/calc-pos-order.js';
+import { createPos } from '../point-on-shape/create-pos.js';
+import { isAnotherCpCloseby } from '../mat/is-another-cp-closeby.js';
+import { getNeighbouringPoints } from '../mat/get-neighboring-cps.js';
 /**
- * @hidden
+ * @internal
  * Adds a 2-prong contact circle to the shape.
  * @param cpGraphs
  * @param circle Circle containing the 2 contact points
@@ -15,33 +15,25 @@ import { getNeighbouringPoints } from '../get-neighboring-cps.js';
  * tolerances.
  */
 function add2Prong(cpGraphs, circle, posSource, posAntipodes, holeClosing, extreme) {
-    //let orderSource   = PointOnShape.calcOrder(circle, posSource);
-    const orderSource = calcPosOrder(circle, posSource);
-    const orderAntipodes = posAntipodes.map(posAntipode => {
-        //console.log(circle.center)
-        //return PointOnShape.calcOrder(circle, posAntipode.pos);
-        return calcPosOrder(circle, posAntipode.pos);
-    });
     let t_s = posSource.t;
-    let curve;
     if (t_s === 0) {
         t_s = 1;
-        curve = posSource.curve.prev;
-        posSource = new PointOnShape(curve, t_s);
+        posSource = createPos(posSource.curve.prev, t_s, true);
     }
+    const orderSource = calcPosOrder(circle, posSource);
+    const orderAntipodes = posAntipodes.map(posAntipode => calcPosOrder(circle, posAntipode));
     // Make sure there isn't already a ContactPoint close by - it can cause
     // floating point stability issues.
-    // TODO - possibly combine n-prongs in this case
     let isCloseByAntipodes = false;
     for (let i = 0; i < posAntipodes.length; i++) {
         const posAntipode = posAntipodes[i];
         const orderAntipode = orderAntipodes[i];
-        if (isAnotherCpCloseby(cpGraphs, posAntipode.pos, circle, orderAntipode, 0, extreme, 'red')) {
+        if (!!isAnotherCpCloseby(cpGraphs, posAntipode, circle, orderAntipode, 0, extreme)) {
             isCloseByAntipodes = true;
             break;
         }
     }
-    if (isAnotherCpCloseby(cpGraphs, posSource, circle, orderSource, 0, extreme, 'red') ||
+    if (!!isAnotherCpCloseby(cpGraphs, posSource, circle, orderSource, 0, extreme) ||
         isCloseByAntipodes) {
         if (typeof _debug_ !== 'undefined') {
             if (holeClosing) {
@@ -62,22 +54,24 @@ function add2Prong(cpGraphs, circle, posSource, posAntipodes, holeClosing, extre
     for (let i = 0; i < posAntipodes.length; i++) {
         const posAntipode = posAntipodes[i];
         const orderAntipode = orderAntipodes[i];
-        const cpAntipode = { pointOnShape: posAntipode.pos, circle, order: orderAntipode, order2: 0 };
+        const cpAntipode = {
+            pointOnShape: posAntipode, circle, order: orderAntipode, order2: 0
+        };
         cpAntipodes.push(cpAntipode);
-        const loopAntipode = posAntipode.pos.curve.loop;
+        const loopAntipode = posAntipode.curve.loop;
         loopAntipodes.push(loopAntipode);
         const cpTreeAntipode = cpGraphs.get(loopAntipode);
         cpTreeAntipodes.push(cpTreeAntipode);
-        const deltaAntipode = getNeighbouringPoints(cpTreeAntipode, posAntipode.pos, orderAntipode, 0);
+        const deltaAntipode = getNeighbouringPoints(cpTreeAntipode, posAntipode, orderAntipode, 0);
         deltaAntipodes.push(deltaAntipode);
-        newCpAntipodes.push(CpNode.insert(holeClosing, false, cpTreeAntipode, cpAntipode, deltaAntipode[0]));
+        newCpAntipodes.push(insertCpNode(holeClosing, false, cpTreeAntipode, cpAntipode, deltaAntipode[0]));
     }
     // Source
     const cpSource = { pointOnShape: posSource, circle, order: orderSource, order2: 0 };
     const loopSource = posSource.curve.loop;
     const cpTreeSource = cpGraphs.get(loopSource);
     const deltaSource = getNeighbouringPoints(cpTreeSource, posSource, orderSource, 0);
-    const newCpSource = CpNode.insert(holeClosing, false, cpTreeSource, cpSource, deltaSource[0]);
+    const newCpSource = insertCpNode(holeClosing, false, cpTreeSource, cpSource, deltaSource[0]);
     // Connect graph
     if (newCpAntipodes.length === 1) {
         newCpSource.prevOnCircle = newCpAntipodes[0];
@@ -101,12 +95,12 @@ function add2Prong(cpGraphs, circle, posSource, posAntipodes, holeClosing, extre
         }
     }
     if (holeClosing) {
-        // TODO - important - take care of case where there are more than 1 antipode
+        // TODO - take care of case where there are more than 1 antipode
         // Duplicate ContactPoints
-        const cpB2 = { pointOnShape: posAntipodes[0].pos, circle, order: cpAntipodes[0].order, order2: +1 };
-        const newCpB2Node = CpNode.insert(true, false, cpTreeAntipodes[0], cpB2, newCpAntipodes[0]);
+        const cpB2 = { pointOnShape: posAntipodes[0], circle, order: cpAntipodes[0].order, order2: +1 };
+        const newCpB2Node = insertCpNode(true, false, cpTreeAntipodes[0], cpB2, newCpAntipodes[0]);
         const cpB1 = { pointOnShape: posSource, circle, order: cpSource.order, order2: -1 };
-        const newCpB1Node = CpNode.insert(true, false, cpTreeSource, cpB1, newCpSource.prev);
+        const newCpB1Node = insertCpNode(true, false, cpTreeSource, cpB1, newCpSource.prev);
         // Connect graph
         newCpB1Node.prevOnCircle = newCpB2Node;
         newCpB1Node.nextOnCircle = newCpB2Node;
@@ -133,60 +127,18 @@ function add2Prong(cpGraphs, circle, posSource, posAntipodes, holeClosing, extre
     }
     return newCpSource;
 }
-/** @hidden */
-function scale(n, exp) {
-    return n * (2 ** -(exp + 1));
-}
-/** @hidden */
-function getSize(x, y) {
-    // Get size of a
-    if (x > 0) {
-        if (x > 0.5) {
-            return y; // ~ -0.7 -> 0.7, i.e. -(sqrt(2)/2) -> +(sqrt(2)/2) 
-        }
-        else {
-            if (y < 0) {
-                return x - 2; // ~ -2.0 -> -1.3
-            }
-            else {
-                return -x + 2; // ~ 1.3 -> 2.0
-            }
-        }
-    }
-    else {
-        if (x < -0.5) {
-            return -y + 4; // ~ 3.3 -> 4.7
-        }
-        else {
-            if (y < 0) {
-                return x + 6; // ~ 5.3 -> 6.0
-            }
-            else {
-                return -x + 2; // ~ 2 -> 2.7
-            }
-        }
-    }
-}
-/** @hidden */
+/** @internal */
 function byAngle(circle) {
     const c = circle.center;
-    const r = circle.radius;
-    const exp = exponent(r);
     return function (_a, _b) {
         let a = _a.cp.pointOnShape.p;
         let b = _b.cp.pointOnShape.p;
         // Move onto origin
         a = [a[0] - c[0], a[1] - c[1]];
         b = [b[0] - c[0], b[1] - c[1]];
-        // Scale
-        const ax = scale(a[0], exp);
-        const ay = scale(a[1], exp);
-        const bx = scale(b[0], exp);
-        const by = scale(b[1], exp);
-        // Get 'size'
-        const sa = getSize(ax, ay);
-        const sb = getSize(bx, by);
-        return sb - sa;
+        const a_ = Math.atan2(a[1], a[0]);
+        const b_ = Math.atan2(b[1], b[0]);
+        return b_ - a_;
     };
 }
 export { add2Prong };

package/node/find-2-prong/add-2-prong.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-2-prong.js","sourceRoot":"","sources":["../../src/find-2-prong/add-2-prong.ts"],"names":[],"mappings":"AAOA,OAAO,EAAU,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAI7D,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AACnE,OAAO,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AACrE,OAAO,EAAE,qBAAqB,EAAE,MAAM,+BAA+B,CAAC;AAKtE;;;;;;;;;;GAUG;AACH,SAAS,SAAS,CAChB,QAA0C,EACpC,MAAsB,EACtB,SAA4B,EAClC,YAA8B,EAC9B,WAAuB,EACvB,OAAsB;IAEvB,IAAI,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC;IACtB,IAAI,GAAG,KAAK,CAAC,EAAE;QACd,GAAG,GAAG,CAAC,CAAC;QACR,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;KACvD;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACpD,MAAM,cAAc,GAAG,YAAY,CAAC,GAAG,CACtC,WAAW,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,CAAC,CAChD,CAAC;IAGF,uEAAuE;IACvE,mCAAmC;IAEnC,IAAI,kBAAkB,GAAG,KAAK,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAExC,IAAI,CAAC,CAAC,kBAAkB,CAAC,QAAQ,EAAE,WAAW,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE;YACnF,kBAAkB,GAAG,IAAI,CAAC;YAC1B,MAAM;SACN;KACD;IACD,IAAI,CAAC,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,OAAO,CAAC;QAC7E,kBAAkB,EAAE;QAEpB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;YACnC,IAAI,WAAW,EAAE;gBAChB,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC,GAAG,EAAE,CAAC;aACtD;iBAAM;gBACN,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,GAAG,EAAE,CAAC;aAClD;SACD;QACD,OAAO;KACP;IAED,WAAW;IACX,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,WAAW,GAAmB,EAAE,CAAC;IACvC,MAAM,eAAe,GAAuB,EAAE,CAAC;IAC/C,MAAM,cAAc,GAAe,EAAE,CAAC;IACtC,MAAM,aAAa,GAAW,EAAE,CAAC;IACjC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAExC,MAAM,UAAU,GAAiB;YAChC,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC;SAClE,CAAC;QACF,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC7B,MAAM,YAAY,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;QAC5C,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC;QACnD,eAAe,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACrC,MAAM,aAAa,GAAG,qBAAqB,CAC1C,cAAc,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC,CAC7C,CAAC;QACF,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAEnC,cAAc,CAAC,IAAI,CAAC,YAAY,CAC/B,WAAW,EACX,KAAK,EACL,cAAc,EACd,UAAU,EACV,aAAa,CAAC,CAAC,CAAC,CAChB,CAAC,CAAC;KACH;IAGD,SAAS;IACT,MAAM,QAAQ,GAAiB,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAClG,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;IACxC,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;IAC/C,MAAM,WAAW,GAAG,qBAAqB,CACxC,YAAY,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CACvC,CAAC;IACF,MAAM,WAAW,GAAG,YAAY,CAC/B,WAAW,EACX,KAAK,EACL,YAAY,EACZ,QAAQ,EACR,WAAW,CAAC,CAAC,CAAC,CACd,CAAC;IAGF,gBAAgB;IAChB,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;QAChC,WAAW,CAAC,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC7C,WAAW,CAAC,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAE7C,cAAc,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,WAAW,CAAC;QAC7C,cAAc,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,WAAW,CAAC;KAC7C;SAAM;QACN,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,EAAE,CAAC;QACvC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAE1B,wDAAwD;QACxD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACrD,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAEnD,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAClC,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;YAElC,UAAU,CAAC,YAAY,GAAG,UAAU,CAAC;YACrC,UAAU,CAAC,YAAY,GAAG,UAAU,CAAC;SACrC;KACD;IAGD,IAAI,WAAW,EAAE;QAChB,gEAAgE;QAChE,0BAA0B;QAC1B,MAAM,IAAI,GAAiB,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC;QAC9G,MAAM,WAAW,GAAG,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3F,MAAM,IAAI,GAAiB,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC;QAClG,MAAM,WAAW,GAAG,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC;QAEpF,gBAAgB;QAChB,WAAW,CAAC,YAAY,GAAG,WAAW,CAAC;QACvC,WAAW,CAAC,YAAY,GAAG,WAAW,CAAC;QACvC,WAAW,CAAC,YAAY,GAAG,WAAW,CAAC;QACvC,WAAW,CAAC,YAAY,GAAG,WAAW,CAAC;QAEvC,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,WAAW,CAAC;QACrC,WAAW,CAAC,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAErC,WAAW,CAAC,IAAI,GAAG,WAAW,CAAC;QAC/B,WAAW,CAAC,IAAI,GAAG,WAAW,CAAC;KAC/B;IAGD,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,IAAI,KAA6B,CAAC;QAClC,IAAI,WAAW,EAAE;YAChB,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC;SACxD;aAAM;YACN,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;SACpD;QAED,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC;QAEnC,IAAI,CAAC,WAAW,EAAE;YAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;SAAC;QACxC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;KAC1B;IAED,OAAO,WAAW,CAAC;AACpB,CAAC;AAGD,gBAAgB;AAChB,SAAS,OAAO,CAAC,MAAc;IAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,OAAO,UAAS,EAAU,EAAE,EAAU;QACrC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QAE7B,mBAAmB;QACnB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAElC,OAAO,EAAE,GAAG,EAAE,CAAC;IAChB,CAAC,CAAA;AACF,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}

package/node/find-2-prong/add-debug-info.d.ts

@@ -0,0 +1,8 @@
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
+import { Circle } from '../geometry/circle.js';
+import { CpNode } from '../cp-node/cp-node.js';
+import { BezierPiece } from '../mat/bezier-piece.js';
+import { TXForDebugging } from './x-for-debugging.js';
+/** @internal */
+declare function addDebugInfo(bezierPieces: BezierPiece[], failed: boolean, x: number[], y: PointOnShape, z: PointOnShape, circle: Circle, δ: CpNode[], xs: TXForDebugging[], holeClosing: boolean): void;
+export { addDebugInfo };

package/node/{mat/find-mat/find-2-prong → find-2-prong}/add-debug-info.js

@@ -1,10 +1,11 @@
-import { getTwoProngType } from '../../get-two-prong-type.js';
-/** @hidden */
-function addDebugInfo(bezierPieces, failed, pos, circle, z, δ, xs, holeClosing) {
+import { getTwoProngType } from '../mat/get-two-prong-type.js';
+/** @internal */
+function addDebugInfo(bezierPieces, failed, x, y, z, circle, δ, xs, holeClosing) {
+    xs.push({ x, y, z, t: y.t });
     const twoProng = {
         generated: _debug_.generated,
         bezierPieces,
-        pos,
+        pos: y,
         δ,
         z: z ? z.p : undefined,
         circle,

package/node/find-2-prong/add-debug-info.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-debug-info.js","sourceRoot":"","sources":["../../src/find-2-prong/add-debug-info.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAK/D,gBAAgB;AAChB,SAAS,YAAY,CACb,YAA2B,EAC3B,MAAe,EACf,CAAW,EACX,CAAe,EACf,CAAe,EACf,MAAc,EACd,CAAW,EACX,EAAoB,EACpB,WAAoB;IAExB,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE7B,MAAM,QAAQ,GAAyB;QAC/B,SAAS,EAAE,OAAO,CAAC,SAAS;QAC5B,YAAY;QACZ,GAAG,EAAE,CAAC;QACN,CAAC;QACD,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAU;QACvB,MAAM;QACN,EAAE;QACF,MAAM;QACN,WAAW;QACX,QAAQ,EAAE,KAAK;QACf,OAAO,EAAE,KAAK;QACd,MAAM,EAAE,SAAU;KACzB,CAAC;IAEF,MAAM,YAAY,GAAG,eAAe,CAAC,QAAQ,CAAsB,CAAC;IACpE,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AACzD,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}

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

@@ -0,0 +1,11 @@
+import { BezierPiece } from '../mat/bezier-piece.js';
+/**
+ * @internal
+ * Cull all bezierPieces not within given radius of a given point.
+ * @param extreme
+ * @param bezierPieces
+ * @param p
+ * @param rSquared
+ */
+declare function cullBezierPieces2(bezierPieces: BezierPiece[], p: number[], rSquared: number): BezierPiece[];
+export { cullBezierPieces2 };

package/node/find-2-prong/cull-bezier-pieces.js

@@ -0,0 +1,28 @@
+import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
+import { getBoundingBox_ } from '../geometry/get-bounding-box-.js';
+/**
+ * @internal
+ * Cull all bezierPieces not within given radius of a given point.
+ * @param extreme
+ * @param bezierPieces
+ * @param p
+ * @param rSquared
+ */
+function cullBezierPieces2(bezierPieces, p, rSquared) {
+    const TOLERANCE = 1 + 2 ** -10;
+    if (bezierPieces.length <= 1) {
+        return bezierPieces;
+    }
+    const newPieces = [];
+    for (const bezierPiece of bezierPieces) {
+        const ps = bezierPiece.curve.ps;
+        const rect = getBoundingBox_(ps);
+        const bd = getClosestSquareDistanceToRect(rect, p);
+        if (bd <= TOLERANCE * rSquared) {
+            newPieces.push(bezierPiece);
+        }
+    }
+    return newPieces;
+}
+export { cullBezierPieces2 };
+//# sourceMappingURL=cull-bezier-pieces.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cull-bezier-pieces.js","sourceRoot":"","sources":["../../src/find-2-prong/cull-bezier-pieces.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,8BAA8B,EAAE,MAAM,oDAAoD,CAAC;AAEpG,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAGnE;;;;;;;GAOG;AACH,SAAS,iBAAiB,CAClB,YAA2B,EAC3B,CAAW,EACX,QAAgB;IAEpB,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,IAAE,CAAC,EAAE,CAAC;IAE7B,IAAI,YAAY,CAAC,MAAM,IAAI,CAAC,EAAE;QAC1B,OAAO,YAAY,CAAC;KACvB;IAGD,MAAM,SAAS,GAAG,EAAE,CAAC;IACrB,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE;QACpC,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QAEhC,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,8BAA8B,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,EAAE,IAAI,SAAS,GAAC,QAAQ,EAAE;YAC1B,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC/B;KACJ;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAGD,OAAO,EAAE,iBAAiB,EAAE,CAAA"}

package/node/{mat/find-mat/find-2-prong → find-2-prong}/find-2-prong.d.ts

@@ -1,18 +1,17 @@
 import { LlRbTree } from 'flo-ll-rb-tree';
-import { CpNode } from '../../../cp-node.js';
-import { Loop } from '../../../loop.js';
-import { Circle } from '../../../circle.js';
-import { IPointOnShape } from '../../../point-on-shape.js';
+import { CpNode } from '../cp-node/cp-node.js';
+import { Loop } from 'flo-boolean';
+import { Circle } from '../geometry/circle.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
 /**
- * @hidden
+ * @internal
  * Adds a 2-prong to the MAT. The first point on the shape boundary is given and
  * the second one is found by the algorithm.
  *
  * A 2-prong is defined as a MAT circle that touches the shape at exactly 2
  * points.
  *
- * Before any 2-prongs are added the entire shape is our δΩ (1-prongs do not
- * reduce the boundary).
+ * Before any 2-prongs are added the entire shape is our δΩ.
  *
  * As per the paper by Choi, Choi, Moon and Wee:
  *   "The starting point of this algorithm is a choice of a circle Br(x)
@@ -27,11 +26,8 @@ import { IPointOnShape } from '../../../point-on-shape.js';
  * @param isHoleClosing True if this is a hole-closing two-prong, false otherwise
  * @param k The loop array index
  */
-declare function find2Prong(loops: Loop[], extreme: number, squaredDiagonalLength: number, cpTrees: Map<Loop, LlRbTree<CpNode>>, y: IPointOnShape, isHoleClosing: boolean, k: number): {
+declare function find2Prong(angle: number, loops: Loop[], extreme: number, squaredDiagonalLength: number, cpTrees: Map<Loop, LlRbTree<CpNode>>, y: PointOnShape, isHoleClosing: boolean, k: number, for1Prong: boolean): {
     circle: Circle;
-    zs: {
-        pos: IPointOnShape;
-        d: number;
-    }[];
-};
+    zs: PointOnShape[];
+} | undefined;
 export { find2Prong };

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

@@ -0,0 +1,144 @@
+import { distanceBetween, fromTo, interpolate, rotate, translate } from 'flo-vector2d';
+import { getOsculatingCircle } from '../point-on-shape/get-osculating-circle.js';
+import { addDebugInfo } from './add-debug-info.js';
+import { findEquidistantPointOnLineDd } from './find-equidistant-point-on-line-dd.js';
+import { getInitialBezierPieces } from './get-initial-bezier-pieces.js';
+import { getCloseBoundaryPointsCertified } from '../closest-boundary-point/get-close-boundary-points-certified.js';
+import { reduceRadius } from './reduce-radius.js';
+import { squaredDistanceBetweenDd } from './squared-distance-between-dd.js';
+import { cullBezierPieces2 } from './cull-bezier-pieces.js';
+import { add1Prong } from './add-1-prong.js';
+import { createPos } from '../point-on-shape/create-pos.js';
+const { sqrt, abs, sin, cos } = Math;
+/**
+ * @internal
+ * Adds a 2-prong to the MAT. The first point on the shape boundary is given and
+ * the second one is found by the algorithm.
+ *
+ * A 2-prong is defined as a MAT circle that touches the shape at exactly 2
+ * points.
+ *
+ * Before any 2-prongs are added the entire shape is our δΩ.
+ *
+ * As per the paper by Choi, Choi, Moon and Wee:
+ *   "The starting point of this algorithm is a choice of a circle Br(x)
+ *    centered at an interior point x which contains two boundary portions c and
+ *    d of dΩ as in Fig. 19."
+ * In fact, we (and they) start by fixing one point on the boundary beforehand.
+ * @param loops A shape represented by path loops
+ * @param extreme The extreme coordinate value of the shape
+ * @param squaredDiagonalLength The squared diagonal length of the shape
+ * bounding box.
+ * @param y The source point of the 2-prong to be found
+ * @param isHoleClosing True if this is a hole-closing two-prong, false otherwise
+ * @param k The loop array index
+ */
+function find2Prong(angle, loops, extreme, squaredDiagonalLength, cpTrees, y, isHoleClosing, k, for1Prong) {
+    const MAX_ITERATIONS = 25;
+    const squaredSeperationTolerance = ((2 ** -21) * extreme) ** 2;
+    const errorTolerance = (2 ** -46) * extreme;
+    const maxOsculatingCircleRadius = sqrt(squaredDiagonalLength);
+    const minCurvature = 1 / maxOsculatingCircleRadius;
+    let xO; // the original x to mitigate drift
+    const p = y.p;
+    let rO;
+    if (isHoleClosing) {
+        xO = [p[0], p[1] - maxOsculatingCircleRadius];
+        rO = maxOsculatingCircleRadius;
+    }
+    else {
+        if (angle === 0) {
+            ({ center: xO, radius: rO } = getOsculatingCircle(minCurvature, y));
+        }
+        else {
+            ({ center: xO, radius: rO } = getOsculatingCircle(minCurvature, y, true));
+            const v = fromTo(y.p, xO);
+            const v_ = rotate(sin(angle), cos(angle))(v);
+            xO = translate(y.p)(v_);
+        }
+    }
+    // The boundary piece that should contain the other point of 
+    // the 2-prong circle. (Defined by start and end points).
+    const { bezierPieces, δ } = getInitialBezierPieces(angle, isHoleClosing, k, loops, cpTrees, y, { center: xO, radius: rO });
+    /** The center of the two-prong (successively refined) */
+    let x = xO;
+    // The lines below is an optimization.
+    const r_ = sqrt(reduceRadius(extreme, bezierPieces, p, xO));
+    if (rO > r_) {
+        x = interpolate(p, xO, r_ / rO);
+    }
+    /** Trace the convergence (for debugging). */
+    const xs = [];
+    /** The antipode of the two-prong (successively refined) */
+    let zs = undefined;
+    let z = undefined;
+    let bezierPieces_ = bezierPieces;
+    let i = 0;
+    while (i < MAX_ITERATIONS) {
+        const xy = squaredDistanceBetweenDd(x, y.p);
+        if (i < 5) {
+            bezierPieces_ = cullBezierPieces2(bezierPieces_, x, xy);
+        }
+        zs = getCloseBoundaryPointsCertified(bezierPieces_, x, y.curve, y.t, for1Prong && i == 0 && rO !== 1 / minCurvature, angle).map(info => createPos(info.curve, info.t, false));
+        z = zs[0];
+        if (z === undefined) {
+            addDebugInfo2(isHoleClosing);
+            return undefined;
+        }
+        const xz = squaredDistanceBetweenDd(x, z.p);
+        const yz = squaredDistanceBetweenDd(y.p, z.p);
+        // if on first try
+        if (i === 0) {
+            if (rO < (1 - 2 ** -6) * sqrt(xz)) {
+                add1Prong(rO, xO, cpTrees, y);
+                return undefined;
+            }
+            // return undefined;
+        }
+        if (typeof _debug_ !== 'undefined') {
+            xs.push({ x, y, z: createPos(z.curve, z.t, false), t: y.t });
+        }
+        if (!isHoleClosing) {
+            if (yz <= squaredSeperationTolerance) {
+                // if (typeof _debug_ !== 'undefined') { console.log(`failed: seperation too small - ${sqrt(yz)}`); }
+                return undefined;
+            }
+        }
+        // Find the point on the line connecting y with x that is  
+        // equidistant from y and z. This will be our next x.
+        const nextX = findEquidistantPointOnLineDd(x, y.p, z.p);
+        const error = abs(sqrt(xy) - sqrt(xz));
+        // if (xy < xz) { return undefined; }
+        x = nextX;
+        if (error < errorTolerance) {
+            break;
+        }
+        i++;
+        if (i === MAX_ITERATIONS) {
+            // Convergence was too slow.
+            if (typeof _debug_ !== 'undefined') {
+                console.log('failed (slow): max iterations reached');
+            }
+            return undefined;
+        }
+    }
+    // const zs_ = zs;
+    // console.log(zs.length)
+    // const zPos = createPos(z.curve, z.t, false);
+    const circle = { center: x, radius: distanceBetween(x, z.p) };
+    if (typeof _debug_ !== 'undefined') {
+        addDebugInfo(bezierPieces, false, x, y, z, circle, δ, xs, isHoleClosing);
+    }
+    // return { circle, zs: zs_ };
+    return { circle, zs: zs };
+}
+function addDebugInfo2(isHoleClosing) {
+    if (typeof _debug_ !== 'undefined') {
+        const elems = _debug_.generated.elems;
+        const elem = isHoleClosing ? elems.twoProng_holeClosing : elems.twoProng_regular;
+        const elemStr = isHoleClosing ? 'hole-closing: ' + elem.length : 'regular: ' + elem.length;
+        console.log('failed: no closest point - ' + elemStr);
+    }
+}
+export { find2Prong };
+//# sourceMappingURL=find-2-prong.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"find-2-prong.js","sourceRoot":"","sources":["../../src/find-2-prong/find-2-prong.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAKvF,OAAO,EAAE,mBAAmB,EAAE,MAAM,4CAA4C,CAAC;AACjF,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,4BAA4B,EAAE,MAAM,wCAAwC,CAAC;AACtF,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EAAE,+BAA+B,EAAE,MAAM,kEAAkE,CAAC;AACnH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,wBAAwB,EAAE,MAAM,kCAAkC,CAAC;AAC5E,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAG5D,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAGrC;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,SAAS,UAAU,CACjB,KAAa,EACb,KAAa,EACb,OAAe,EACf,qBAA6B,EAC7B,OAAmC,EAC7B,CAAe,EACrB,aAAsB,EACtB,CAAS,EACT,SAAkB;IAEnB,MAAM,cAAc,GAAG,EAAE,CAAC;IAC1B,MAAM,0BAA0B,GAAG,CAAC,CAAC,CAAC,IAAE,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC,IAAE,CAAC,CAAC;IACzD,MAAM,cAAc,GAAG,CAAC,CAAC,IAAE,CAAC,EAAE,CAAC,GAAC,OAAO,CAAC;IACxC,MAAM,yBAAyB,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC;IAC9D,MAAM,YAAY,GAAG,CAAC,GAAC,yBAAyB,CAAC;IAEjD,IAAI,EAAY,CAAC,CAAE,mCAAmC;IACtD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACd,IAAI,EAAU,CAAC;IACf,IAAI,aAAa,EAAE;QAClB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,yBAAyB,CAAC,CAAC;QAC9C,EAAE,GAAG,yBAAyB,CAAC;KAC/B;SAAM;QACN,IAAI,KAAK,KAAK,CAAC,EAAE;YAChB,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,mBAAmB,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC;SACpE;aAAM;YACN,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,mBAAmB,CAAC,YAAY,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACxB;KACD;IAED,6DAA6D;IAC7D,yDAAyD;IACzD,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,GAAG,sBAAsB,CACjD,KAAK,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CACtE,CAAC;IAEF,yDAAyD;IACzD,IAAI,CAAC,GAAG,EAAE,CAAC;IAEX,sCAAsC;IACtC,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC5D,IAAI,EAAE,GAAG,EAAE,EAAE;QACZ,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,GAAC,EAAE,CAAC,CAAC;KAC9B;IAED,6CAA6C;IAC7C,MAAM,EAAE,GAAqB,EAAE,CAAC;IAChC,2DAA2D;IAC3D,IAAI,EAAE,GAAmB,SAAU,CAAC;IACpC,IAAI,CAAC,GAAiB,SAAU,CAAC;IACjC,IAAI,aAAa,GAAG,YAAY,CAAC;IAEjC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,cAAc,EAAE;QAC1B,MAAM,EAAE,GAAG,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE5C,IAAI,CAAC,GAAG,CAAC,EAAE;YAAE,aAAa,GAAG,iBAAiB,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;SAAE;QAEvE,EAAE,GAAG,+BAA+B,CACnC,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAC9B,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,GAAC,YAAY,EAC5C,KAAK,CACL,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;QAEpD,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAEV,IAAI,CAAC,KAAK,SAAS,EAAE;YACpB,aAAa,CAAC,aAAa,CAAC,CAAC;YAC7B,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,EAAE,GAAG,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,wBAAwB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9C,kBAAkB;QAClB,IAAI,CAAC,KAAK,CAAC,EAAE;YACZ,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,IAAE,CAAC,CAAC,CAAC,GAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBAC9B,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;gBAC9B,OAAO,SAAS,CAAC;aACjB;YACD,oBAAoB;SACpB;QAED,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;YAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SAAE;QAGrG,IAAI,CAAC,aAAa,EAAE;YACnB,IAAI,EAAE,IAAI,0BAA0B,EAAE;gBACrC,qGAAqG;gBACrG,OAAO,SAAS,CAAC;aACjB;SACD;QAED,2DAA2D;QAC3D,qDAAqD;QACrD,MAAM,KAAK,GAAG,4BAA4B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,qCAAqC;QAErC,CAAC,GAAG,KAAK,CAAC;QAEV,IAAI,KAAK,GAAG,cAAc,EAAE;YAC3B,MAAM;SACN;QAED,CAAC,EAAE,CAAC;QAEJ,IAAI,CAAC,KAAK,cAAc,EAAE;YACzB,4BAA4B;YAC5B,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;gBAAE,OAAO,CAAC,GAAG,CAAC,uCAAuC,CAAC,CAAC;aAAE;YAC7F,OAAO,SAAS,CAAC;SACjB;KACD;IAED,kBAAkB;IAClB,yBAAyB;IACzB,+CAA+C;IAE/C,MAAM,MAAM,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAE9D,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QAAE,YAAY,CAAC,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAO,EAAE,CAAE,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC;KAAE;IAEnH,8BAA8B;IAC9B,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;AAC3B,CAAC;AAGD,SAAS,aAAa,CAAC,aAAsB;IAC5C,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC;QACtC,MAAM,IAAI,GAAG,aAAa,CAAE,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAA;QACjF,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,gBAAgB,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3F,OAAO,CAAC,GAAG,CAAC,6BAA6B,GAAG,OAAO,CAAC,CAAC;KACrD;AACF,CAAC;AAED,OAAO,EAAE,UAAU,EAAE,CAAA"}