flo-mat 2.0.4 → 3.0.0

package/node/{compare-curvatures-at-interface.js → corner/compare-curvatures-at-interface.js}

@@ -91,8 +91,8 @@ function compareCurvaturesAtInterface(psI, psO) {
     // <=> (de - 3af)²b⁵ > (bg - 3ch)²d⁵
     // <=> i²b⁵ > j²d⁵
     // Get x′′′ and y′′′ for incoming curve evaluated at 1
-    const [dddxI, dddyI] = toPowerBasis_3rdDerivative(psI); // max bitlength increase === max shift === 6
-    const [dddxO, dddyO] = toPowerBasis_3rdDerivative(psO); // max bitlength increase === max shift === 6
+    const [[dddxI], [dddyI]] = toPowerBasis_3rdDerivative(psI); // max bitlength increase === max shift === 6
+    const [[dddxO], [dddyO]] = toPowerBasis_3rdDerivative(psO); // max bitlength increase === max shift === 6
     const e = eDiff(twoProduct(dxI, dddyI), twoProduct(dyI, dddxI));
     const f = fastExpansionSum(twoProduct(dxI, ddxI), twoProduct(dyI, ddyI));
     const g = eDiff(twoProduct(dxO, dddyO), twoProduct(dyO, dddxO));

package/node/corner/compare-curvatures-at-interface.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare-curvatures-at-interface.js","sourceRoot":"","sources":["../../src/corner/compare-curvatures-at-interface.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC5G,OAAO,EAAE,UAAU,EAAE,wBAAwB,EAAE,0BAA0B,EAAE,MAAM,aAAa,CAAC;AAG/F;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,4BAA4B,CAC7B,GAAe,EACf,GAAe;IAEnB,kDAAkD;IAClD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;IAC/E,oDAAoD;IACpD,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;IAE/F,kDAAkD;IAClD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;IAC/E,oDAAoD;IACpD,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,2CAA2C;IAE/F,iCAAiC;IACjC,iCAAiC;IAEjC,uEAAuE;IACvE,uCAAuC;IACvC,uCAAuC;IAEvC,yDAAyD;IACzD,4EAA4E;IAC5E,mCAAmC;IACnC,6BAA6B;IAC7B,+EAA+E;IAC/E,mBAAmB;IACnB,yBAAyB;IAEzB,mEAAmE;IACnE,uFAAuF;IACvF,mCAAmC;IACnC,mCAAmC;IACnC,mCAAmC;IACnC,yCAAyC;IACzC,mCAAmC;IACnC,mCAAmC;IACnC,mCAAmC;IAEnC,qEAAqE;IACrE,MAAM,CAAC,GAAG,KAAK,CACX,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EACrB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CACxB,CAAC;IACF,MAAM,CAAC,GAAG,KAAK,CACX,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EACrB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CACxB,CAAC;IAEF,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,KAAK,KAAK,KAAK,EAAE;QACjB,0BAA0B;QAC1B,OAAO,KAAK,GAAG,KAAK,CAAC;KACxB;IAED,MAAM,CAAC,GAAG,gBAAgB,CACtB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,EACpB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;IACF,MAAM,CAAC,GAAG,gBAAgB,CACtB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,EACpB,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CACvB,CAAC;IAEF,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAEnC,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;QAC5B,0BAA0B;QAC1B,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAElC,mEAAmE;QACnE,+DAA+D;QAC/D,wEAAwE;QACxE,wEAAwE;QACxE,mEAAmE;QAGnE,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAEhC,IAAI,EAAE,KAAK,CAAC,EAAE;YACV,0BAA0B;YAC1B,qDAAqD;YACrD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SAC/B;KACJ;IAED,0DAA0D;IAE1D,yEAAyE;IACzE,QAAQ;IACR,kFAAkF;IAClF,2FAA2F;IAC3F,0BAA0B;IAC1B,4FAA4F;IAC5F,0FAA0F;IAC1F,oCAAoC;IACpC,kBAAkB;IAElB,sDAAsD;IACtD,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,0BAA0B,CAAC,GAAG,CAAC,CAAC,CAAC,6CAA6C;IACzG,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,0BAA0B,CAAC,GAAG,CAAC,CAAC,CAAC,6CAA6C;IAEzG,MAAM,CAAC,GAAG,KAAK,CACX,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,EACtB,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CACzB,CAAC;IAEF,MAAM,CAAC,GAAG,gBAAgB,CACtB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EACrB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CACxB,CAAC;IAEF,MAAM,CAAC,GAAG,KAAK,CACX,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,EACtB,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CACzB,CAAC;IAEF,MAAM,CAAC,GAAG,gBAAgB,CACtB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,EACrB,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CACxB,CAAC;IAEF,gCAAgC;IAChC,cAAc;IACd,MAAM,CAAC,GAAG,KAAK,CACX,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,cAAc,CACV,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,CAAC,CACJ,CACJ,CAAC;IAEF,MAAM,CAAC,GAAG,KAAK,CACX,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,cAAc,CACV,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,CAAC,CACJ,CACJ,CAAC;IAEF,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,KAAK,KAAK,KAAK,EAAE;QACjB,OAAO,KAAK,GAAG,KAAK,CAAC;KACxB;IAED,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;QAC5B,iEAAiE;QACjE,OAAO,CAAC,CAAC;KACZ;IAED,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACnC,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACjC,MAAM,EAAE,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAEnC,MAAM,GAAG,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,gBAAgB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAEpC,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAEnC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAE9B,2EAA2E;IAC3E,2CAA2C;AAC/C,CAAC;AAGD,OAAO,EAAE,4BAA4B,EAAE,CAAA"}

package/node/{mat → corner}/corner.d.ts

@@ -1,5 +1,5 @@
 /**
- * @hidden
+ * @internal
  * Represents a corner on the shape boundary, i.e. a point where two bezier
  * curves meet. Typically used internally only.
  */

package/node/{mat → corner}/corner.js.map

@@ -1 +1 @@
-{"version":3,"file":"corner.js","sourceRoot":"","sources":["../../src/mat/corner.ts"],"names":[],"mappings":""}
+{"version":3,"file":"corner.js","sourceRoot":"","sources":["../../src/corner/corner.ts"],"names":[],"mappings":""}

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

@@ -0,0 +1,15 @@
+import { Corner } from "./corner";
+/**
+ * @internal
+ * Returns a new corner with properties.
+ *
+ * PRECONDITION: The beziers has control points with max bit-length of 26 and
+ * aligned to a 'grid' to have the same exponent. This is so the vectors between
+ * control points can be calculated exactly without resorting to adaptive
+ * infinite precision floating point operations.
+ *
+ * @param psI The incoming bezier that ends in the corner
+ * @param psO The outgoing bezier that starts at the corner
+ */
+declare function getCorner(psI: number[][], psO: number[][]): Corner;
+export { getCorner };

package/node/{curve.js → corner/get-corner.js}

@@ -1,8 +1,7 @@
-import { memoize } from 'flo-memoize';
-import { cross, dot, toUnitVector } from 'flo-vector2d';
+import { cross, dot, toUnitVector } from "flo-vector2d";
 import { getInterfaceCcw } from './get-interface-ccw.js';
 /**
- * @hidden
+ * @internal
  * Angle in degrees to radians.
  */
 const DEGREES = {
@@ -12,12 +11,12 @@ const DEGREES = {
     4: 0.0698,
     16: 0.2756,
 };
-/** @hidden */
+/** @internal */
 //const DEGREE_LIMIT = DEGREES[1];
 const DEGREE_LIMIT = DEGREES[4];
 //const DEGREE_LIMIT = DEGREES[16]; 
 /**
- * @hidden
+ * @internal
  * Returns a new corner with properties.
  *
  * PRECONDITION: The beziers has control points with max bit-length of 26 and
@@ -75,15 +74,5 @@ function getCorner(psI, psO) {
         isQuiteDull
     };
 }
-/**
- * @hidden
- * Returns information about the corner created at the end of this curve
- * (at t === 1) and the start of the next curve (at t === 0).
- */
-const getCornerAtEnd = memoize(function (curve) {
-    const psE = curve.ps;
-    const psS = curve.next.ps;
-    return getCorner(psE, psS);
-});
-export { getCorner, getCornerAtEnd };
-//# sourceMappingURL=curve.js.map
+export { getCorner };
+//# sourceMappingURL=get-corner.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"get-corner.js","sourceRoot":"","sources":["../../src/corner/get-corner.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAExD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAGzD;;;GAGG;AACH,MAAM,OAAO,GAAG;IACf,kBAAkB;IAClB,IAAI,EAAG,MAAM;IACb,CAAC,EAAM,MAAM;IACb,CAAC,EAAM,MAAM;IACb,EAAE,EAAK,MAAM;CACb,CAAC;AAGF,gBAAgB;AAChB,kCAAkC;AAClC,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAChC,oCAAoC;AAGpC;;;;;;;;;;;GAWG;AACH,SAAS,SAAS,CAChB,GAAe,EACf,GAAe;IAEhB,wEAAwE;IACxE,qDAAqD;IACrD,MAAM,GAAG,GAAG,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC;IACxB,MAAM,MAAM,GAAI,GAAG,GAAG,CAAC,CAAC;IAExB,uDAAuD;IACvD,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,YAAY,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAE7B,4DAA4D;IAC5D,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,cAAc,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAE/B,+CAA+C;IAC/C,MAAM,SAAS,GAAG;QACjB,YAAY,CAAC,YAAY,CAAC;QAC1B,YAAY,CAAC,cAAc,CAAC;KAC5B,CAAC;IAEF,wEAAwE;IACxE,cAAc;IACd,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,IAAI,YAAqB,CAAC;IAC1B,IAAI,WAAoB,CAAC;IACzB,MAAM,WAAW,GAAG,GAAG,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;IACtD,IAAI,WAAW,GAAG,CAAC,EAAE;QACpB,8BAA8B;QAC9B,YAAY,GAAG,aAAa,GAAG,CAAC,YAAY,CAAC;QAC7C,WAAW,GAAG,aAAa,GAAG,CAAC,YAAY,CAAC;KAC5C;SAAM;QACN,YAAY,GAAG,OAAO,CAAC;QACvB,WAAW,GAAI,MAAM,CAAC;KACtB;IAED,OAAO;QACN,QAAQ,EAAE,SAAS;QACnB,aAAa;QACb,OAAO;QACP,MAAM;QACN,YAAY;QACZ,WAAW;KACX,CAAC;AACH,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}

package/node/{get-interface-ccw.js → corner/get-interface-ccw.js}

@@ -1,4 +1,4 @@
-import { orient2d } from 'big-float-ts';
+import { eAdd, eEstimate, eMult, eNegativeOf, twoDiff } from 'big-float-ts';
 import { dot } from "flo-vector2d";
 import { compareCurvaturesAtInterface } from "./compare-curvatures-at-interface.js";
 /**
@@ -32,31 +32,6 @@ function getInterfaceCcw(psI, psO) {
     const p1 = psO[0];
     // second control point of outgoing curve
     const p2 = psO[1];
-    /*
-    if (typeof _bez_debug_ !== 'undefined') {
-        let maxBitLength = 25;
-        let p1_ = psI[lenI-1];
-        // ---- precondition: does endpoints coincide
-        if (p1_[0] !== p1[0] || p1_[1] !== p1[1]) {
-            throw new Error('Curve endpoints must coincide.');
-        }
-        // ---- precondition: are coordinates grid-aligned
-        // Get all coordinate values into an array
-        let xs: number[] = [];
-        [psI, psO].forEach(ps => ps.forEach(p => p.forEach(x => {
-            xs.push(x);
-        })));
-        
-        let msb = xs.reduce((prevX, x) => Math.max(prevX, msbExponent(x)), Number.NEGATIVE_INFINITY);
-        let lsb = xs.reduce((prevX, x) => Math.min(prevX, lsbExponent(x)), Number.POSITIVE_INFINITY);
-        let bitlengthAll = msb - lsb + 1;
-        if (bitlengthAll > maxBitLength) {
-            throw new Error(
-                `Curve control point coordinates must be bit-aligned and <= ${maxBitLength}. bitlength === ${bitlengthAll}, coordinates: ${xs}`
-            );
-        }
-    }
-    */
     // Max one bit can be added in the calculations below due to bit-alignment
     const xE = p1[0] - p0[0]; // tangent x-coordinate
     const yE = p1[1] - p0[1]; // tangent y-coordinate
@@ -68,17 +43,13 @@ function getInterfaceCcw(psI, psO) {
     const tangentAtEnd = [xE, yE];
     // (non-normalized) tangent of outgoing curve at t === 0
     const tangentAtStart = [xS, yS];
-    // The cross calculated below will have a max bitlength of 
-    // (2*(maxBitLength+1))+1 === e.g. (2*(25+1)) + 1 === 53
-    // If the preconditions are met it is exact
-    //let crossTangents = cross(tangentAtEnd, tangentAtStart);
-    // The cross below is exact by adaptive infinite precision
-    const crossTangents = orient2d(p0, p1, p2);
+    // const crossTangents = orient2d(p0, p1, p2);
+    const crossTangents = orient2dPrecise(p0, p1, p2);
     if (crossTangents !== 0) {
         return crossTangents;
     }
     // The dot calculated below will have a max bitlength of 
-    // (2*(maxBitLength+1))+1 === e.g. (2*(25+1)) + 1 === 53
+    // (2*(maxBitLength + 1)) + 1 === e.g. (2*(25 + 1)) + 1 === 53
     // If the preconditions are met it is exact
     const dotTangents = dot(tangentAtEnd, tangentAtStart);
     if (dotTangents > 0) {
@@ -94,5 +65,19 @@ function getInterfaceCcw(psI, psO) {
     // Look at curvature
     return compareCurvaturesAtInterface(psI.slice().reverse(), psO);
 }
+/** Returns the cross from A to B to C */
+function orient2dPrecise(A, B, C) {
+    // const detleft  = (A[0] - C[0]) * (B[1] - C[1]);
+    // const detright = (A[1] - C[1]) * (B[0] - C[0]);
+    // const det = detleft - detright;
+    const a = twoDiff(A[0], C[0]);
+    const b = twoDiff(B[1], C[1]);
+    const c = twoDiff(A[1], C[1]);
+    const d = twoDiff(B[0], C[0]);
+    const e = eMult(a, b);
+    const f = eMult(c, d);
+    const g = eAdd(e, eNegativeOf(f));
+    return eEstimate(g);
+}
 export { getInterfaceCcw };
 //# sourceMappingURL=get-interface-ccw.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"get-interface-ccw.js","sourceRoot":"","sources":["../../src/corner/get-interface-ccw.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAsB,OAAO,EAAE,MAAM,cAAc,CAAC;AAChG,OAAO,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC;AACnC,OAAO,EAAE,4BAA4B,EAAE,MAAM,sCAAsC,CAAC;AAGpF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,6DAA6D;AAC7D,SAAS,eAAe,CAAC,GAAe,EAAE,GAAe;IACrD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC;IAExB,8CAA8C;IAC9C,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,GAAC,CAAC,CAAC,CAAC;IACvB,yEAAyE;IACzE,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,yCAAyC;IACzC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAElB,0EAA0E;IAC1E,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IACrD,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAClD,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAC/C,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAE,uBAAuB;IAErD,0EAA0E;IACvE,qEAAqE;IAErE,wDAAwD;IACxD,MAAM,YAAY,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAC7B,wDAAwD;IAC3D,MAAM,cAAc,GAAG,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAE5B,8CAA8C;IAC9C,MAAM,aAAa,GAAG,eAAe,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAErD,IAAI,aAAa,KAAK,CAAC,EAAE;QACxB,OAAO,aAAa,CAAC;KAClB;IAED,yDAAyD;IACzD,8DAA8D;IAC9D,2CAA2C;IAC3C,MAAM,WAAW,GAAG,GAAG,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;IACtD,IAAI,WAAW,GAAG,CAAC,EAAE;QACjB,+DAA+D;QAC/D,kBAAkB;QAClB,uEAAuE;QACvE,0CAA0C;QAC1C,OAAO,CAAC,CAAC;KACZ;IAED,4EAA4E;IAC5E,qEAAqE;IACrE,sEAAsE;IAEtE,oBAAoB;IACpB,OAAO,4BAA4B,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC;AACpE,CAAC;AAGD,yCAAyC;AACzC,SAAS,eAAe,CAChB,CAAW,EACX,CAAW,EACX,CAAW;IAEf,kDAAkD;IAClD,kDAAkD;IAClD,kCAAkC;IAElC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IAErB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,EAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjC,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AACxB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

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

@@ -1,4 +1,4 @@
-import { CpNode } from "../cp-node.js";
+import { CpNode } from "./cp-node.js";
 /**
  * Returns a deep clone of this [[CpNode]]. Can be used to copy the MAT
  * since cloning a single [[CpNode]] necessarily implies cloning all

package/node/cp-node/clone.js

@@ -1,5 +1,5 @@
-import { CpNode } from "../cp-node.js";
-/** @hidden */
+import { createCpNode } from "./create-cp-node.js";
+/** @internal */
 const EDGES = ['prev', 'next', 'prevOnCircle', 'nextOnCircle'];
 /**
  * Returns a deep clone of this [[CpNode]]. Can be used to copy the MAT
@@ -10,7 +10,8 @@ function clone(cpNode) {
     // Don't change this function to be recursive, the call stack may 
     // overflow if there are too many CpNodes.
     const nodeMap = new Map();
-    const newCpNode = new CpNode(cpNode.cp, cpNode.isHoleClosing, cpNode.isIntersection);
+    // const newCpNode = new CpNode(cpNode.cp, cpNode.isHoleClosing, cpNode.isIntersection);
+    const newCpNode = createCpNode(cpNode.cp, cpNode.isHoleClosing, cpNode.isIntersection);
     nodeMap.set(cpNode, newCpNode);
     const cpStack = [{ cpNode, newCpNode }];
     while (cpStack.length) {
@@ -19,7 +20,8 @@ function clone(cpNode) {
             const node = cpNode[edge];
             let newNode = nodeMap.get(node);
             if (!newNode) {
-                newNode = new CpNode(node.cp, node.isHoleClosing, node.isIntersection);
+                // newNode = new CpNode(node.cp, node.isHoleClosing, node.isIntersection);
+                newNode = createCpNode(node.cp, node.isHoleClosing, node.isIntersection);
                 nodeMap.set(node, newNode);
                 cpStack.push({ cpNode: node, newCpNode: newNode });
             }

package/node/cp-node/clone.js.map

@@ -1 +1 @@
-{"version":3,"file":"clone.js","sourceRoot":"","sources":["../../src/cp-node/clone.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAUvC,cAAc;AACd,MAAM,KAAK,GAAW,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;AAGvE;;;;GAIG;AACH,SAAS,KAAK,CAAC,MAAc;IACzB,kEAAkE;IAClE,0CAA0C;IAE1C,MAAM,OAAO,GAAwB,IAAI,GAAG,EAAE,CAAC;IAE/C,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC;IAErF,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAExC,OAAO,OAAO,CAAC,MAAM,EAAE;QACnB,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;QAE5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACtB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,OAAO,EAAE;gBACV,OAAO,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;gBACvE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC3B,OAAO,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;aACrD;YACD,SAAS,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;SAC7B;KACJ;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAGD,OAAO,EAAE,KAAK,EAAE,CAAA"}
+{"version":3,"file":"clone.js","sourceRoot":"","sources":["../../src/cp-node/clone.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAUnD,gBAAgB;AAChB,MAAM,KAAK,GAAW,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;AAGvE;;;;GAIG;AACH,SAAS,KAAK,CAAC,MAAc;IACzB,kEAAkE;IAClE,0CAA0C;IAE1C,MAAM,OAAO,GAAwB,IAAI,GAAG,EAAE,CAAC;IAE/C,wFAAwF;IACxF,MAAM,SAAS,GAAG,YAAY,CAC1B,MAAM,CAAC,EAAE,EACT,MAAM,CAAC,aAAa,EACpB,MAAM,CAAC,cAAc,CACxB,CAAC;IAEF,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAExC,OAAO,OAAO,CAAC,MAAM,EAAE;QACnB,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,GAAG,EAAG,CAAC;QAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACtB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,OAAO,EAAE;gBACV,0EAA0E;gBAC1E,OAAO,GAAG,YAAY,CAClB,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,aAAa,EAClB,IAAI,CAAC,cAAc,CACtB,CAAC;gBACF,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC3B,OAAO,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;aACrD;YACD,SAAS,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC;SAC7B;KACJ;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAGD,OAAO,EAAE,KAAK,EAAE,CAAA"}

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

@@ -0,0 +1,196 @@
+import { LlRbTree } from 'flo-ll-rb-tree';
+import { ContactPoint } from '../contact-point/contact-point.js';
+import { removeCpNode } from './remove.js';
+/**
+ * The primary interface of the library.
+ *
+ * Since the MAT is a full representation of the shape boundary an instance of
+ * this class contains both the information of a boundary point and a medial
+ * axis point (and edge to the next point(s)). It also contains edges to other
+ * [[CpNode]]s which allows for traversal of the MAT and thus implictly
+ * represents the entire MAT.
+ *
+ * To get the maximal disk circle (of which the center is on the medial axis)
+ * use [[cp]].circle.
+ *
+ * To get the boundary point, use [[cp]].pointOnShape.
+ *
+ * The edge [[next]] (resp. [[prev]]) allows one to move anti-clockwise (resp.
+ * clockwise) on the shape boundary to the next [[CpNode]]. This also imposes a
+ * direction of traversal of the MAT edges and vertices.
+ *
+ * The edge [[nextOnCircle]] (resp. [[prevOnCircle]]) allows one to go
+ * anti-clockwise (resp. clockwise) around the maximal disks implied by
+ * the CpNode to the next maximal disk contact point. This is equivalent to
+ * following other branches on the MAT.
+ *
+ * Call [[getCurveBetween]](cpNodeFrom, cpNodeTo) or getCurveToNext(cpNode)
+ * (replacing the older CpNode.[[matCurveToNextVertex]]) to get a bezier curve
+ * from the maximal disk of this [[CpNode]] to the next [[CpNode]]'s
+ * maximal disk and thus directly representing a piece of the medial axis.
+ *
+ * The function, [[getChildren]], returns the children of this [[CpNode]] when
+ * seen as a MAT edge. Only children in a 'forward' direction are returned. These
+ * include all edges except the 'backward' edge given by [[prevOnCircle]]. For
+ * [[CpNode]]s having a maximal disk with 2 contact points (a 2-prong, the usual
+ * case) the children will be the single edge [[next]]. For a 3-prong this will
+ * be the edges [[next]] and [[nextOnCircle]], etc. [[getChildren]] allows one to
+ * easily traverse the MAT tree - see e.g. the implementation of [[traverseEdges]].
+ *
+ * The getter, [[vertexChildren]], is similar to [[getChildren]] but returns the
+ * child nodes of the tree when [[CpNode]] is seen as a MAT vertex point (as
+ * opposed to edge). In this way the dual graph of the tree can easily be
+ * traversed - see e.g. [[traverseVertices]]. Generally, however, traversing the
+ * edges is preferred as it returns the entire Medial Axis (by utilizing
+ * [[getCurveToNext]] on each returned edge).
+ *
+ * It may be worth mentioning that by traversing from the CpNode by following
+ * [[next]] repeatedly until one is back at the same CpNode allows one
+ * to 'go around' the shape boundary and at the same time traverse the MAT twice
+ * in opposite directions.
+ */
+interface CpNode {
+    /** The shape boundary contact point, i.e. a [[CpNode]] without its edges. */
+    cp: ContactPoint;
+    /** If true, this [[CpNode]] belongs to a hole-closing maximal disk. */
+    isHoleClosing: boolean;
+    /** true if this cpNode is at a shape boundary intersection point, false otherwise */
+    isIntersection: boolean;
+    /** The previous (going clockwise around the boundary) contact point ([[CpNode]]).*/
+    prev: CpNode;
+    /** The next (going anti-clockwise around the boundary) contact point ([[CpNode]]). */
+    next: CpNode;
+    /**
+     * The previous [[CpNode]] (going clockwise around the inscribed circle
+     * defined by the maximal disk).
+     */
+    prevOnCircle: CpNode;
+    /**
+     * The next [[CpNode]] (going anti-clockwise around
+     * the inscribed circle defined by the maximal disk).
+     */
+    nextOnCircle: CpNode;
+}
+/**
+ * Returns the bezier curve from the maximal disk of this [[CpNode]] to the
+ * next [[CpNode]]'s maximal disk and thus directly represents a piece of the
+ * medial axis.
+ * @deprecated Use [[getCurveToNext]] instead
+ * @param cpNode
+ */
+declare function matCurveToNextVertex(cpNode: CpNode): number[][];
+/**
+ * Primarily for internal use.
+ *
+ * Compares the order of two [[CpNode]]s. The order is cyclic and depends
+ * on a [[CpNode]]'s relative position along the shape boundary.
+ */
+declare const cpNodeComparator: (a: CpNode, b: CpNode) => number;
+/**
+ * Returns the children of this [[CpNode]] when seen as a MAT edge. Only
+ * children in a 'forward' direction are returned. These include all edges
+ * except the 'backward' edge given by [[prevOnCircle]], even terminating
+ * edges.
+ */
+declare function getChildren(cpNode: CpNode): CpNode[];
+/**
+ * Similar to [[getChildren]] but returns the child nodes of the tree when
+ * [[CpNode]] is seen as a MAT vertex point (as opposed to edge). In this
+ * way the dual graph of the tree can easily be traversed - see e.g.
+ * [[traverseVertices]]. Generally, however, traversing the edges is
+ * preferred as it returns the entire Medial Axis (by utilizing
+ * [[getCurveToNext]] on each returned edge).
+ */
+declare function vertexChildren(cpNode: CpNode): CpNode[];
+/**
+ * Returns all [[CpNode]]s on the MAT that this [[CpNode]] is part of
+ * starting from the current one and going anti-clockwise around the shape.
+ */
+declare function getAllOnLoop(cpNode: CpNode): CpNode[];
+/**
+ * Primarily for internal use.
+ *
+ * Insert a [[CpNode]] into the MAT tree graph after the specified point
+ * and returns the freshly inserted [[CpNode]].
+ * @param isHoleClosing True if this is a hole closing contact point.
+ * @param isIntersection True if this is a contact point at a shape boundary
+ * intersection point.
+ * @param cpTree The tree graph holding the [[CpNodes]] of the MAT.
+ * @param cp [[ContactPoint]] defining the [[CpNode]].
+ * @param prev_ Inserts the new [[CpNode]] right after this item if the
+ * loop is not empty, else insert the new [[CpNode]] as the only item in the
+ * loop.
+ */
+declare function insertCpNode(isHoleClosing: boolean, isIntersection: boolean, cpTree: LlRbTree<CpNode>, cp: ContactPoint, prev_: CpNode): CpNode;
+/**
+ * Return this (except if exclThis is truthy) and the the other CpNodes
+ * around the maximal disk vertex circle in an anti-clockwise order.
+ * @param exclThis If true the returned array does not include this
+ * [[CpNode]].
+ */
+declare function getCpNodesOnCircle(cpNode: CpNode, exclThis?: boolean): CpNode[];
+/**
+ * Returns true if the 2 given [[CpNode]]s are on the same maximal disk
+ * circle.
+ * @param cpNode1 A [[CpNode]].
+ * @param cpNode2 Another [[CpNode]]
+ */
+declare function isOnSameCircle(cpNode1: CpNode, cpNode2: CpNode): boolean;
+/**
+ * Returns true if this [[CpNode]] is terminating, i.e. implies a leaf MAT
+ * vertex.
+ *
+ * This is always the case for sharp corners and maximal disks with
+ * a single contact point. Note, however, that even in these cases there are
+ * two contact points stored (sitting 'on top' of each other) for the
+ * maximal disk. It can be seen as a limiting case of a two-prong where the
+ * distance between two of the contact points tend to zero. One point
+ * (represented by a [[CpNode]] of course) will be terminating with the
+ * other point being its [[next]], whereas the other point will *not* be
+ * terminating and 'points' back into the shape.
+ */
+declare function isTerminating(cpNode: CpNode): boolean;
+/**
+ * Like isTerminating() but only returns true if all cpNodes on the circle
+ * (except this.prevOnCircle) is terminating.
+ */
+declare function isFullyTerminating(cpNode: CpNode): boolean;
+/**
+ * Returns the first [[CpNode]] (from this one by successively applying
+ * .nextOnCircle) that exits the circle.
+ */
+declare function getFirstExit(cpNode: CpNode): CpNode | undefined;
+/**
+ * Returns true if this [[CpNode]] represents a sharp corner, i.e. the
+ * limiting case of a two-prong having zero radius.
+ *
+ * Note that two [[CpNode]]s are stored for each sharp corner, one being
+ * terminating and one not. See [[isTerminating]] for more details.
+ */
+declare function isSharp(cpNode: CpNode): boolean;
+/**
+ * Returns the number of contact points on the maximal disk circle implied
+ * by this [[CpNode]].
+ *
+ * Note, however, that even one-prongs and sharp corners will return 2 (see
+ * [[isTerminating]] for more details); if this is not desired use
+ * [[getRealProngCount]] instead which will return 1 in these cases.
+ */
+declare function getProngCount(cpNode: CpNode): number;
+/**
+ * Returns the number of contact points (up to planar coordinates) on the
+ * maximal disk circle implied by this [[CpNode]].
+ *
+ * See also [[getProngCount]].
+ */
+declare function getRealProngCount(cpNode: CpNode): number;
+/**
+ * Returns true if this [[CpNode]]'s maximal disk has only one contact point
+ * on the shape boundary (up to planar coordinates). These includes sharp
+ * corners.
+ *
+ * Note, however, that two [[CpNode]]s are stored for each such point to
+ * preserve symmetry - see [[isTerminating]] for more details.
+ */
+declare function isOneProng(cpNode: CpNode): boolean;
+export { CpNode, matCurveToNextVertex, getChildren, vertexChildren, getAllOnLoop, insertCpNode, getCpNodesOnCircle, isOnSameCircle, isTerminating, isFullyTerminating, getFirstExit, isSharp, isOneProng, getProngCount, getRealProngCount, cpNodeComparator, removeCpNode };