flo-mat 4.1.4 → 5.0.1

package/node/mat/hausdorff-distance-one-sided-exceeds.js

@@ -0,0 +1,251 @@
+import { closestPointOnBezier, controlPointLinesLength, evalDeCasteljau, fromTo } from 'flo-bezier3';
+const { max, sqrt } = Math;
+/**
+ * Returns the closest point on the piecewise bezier curve given by `curves`
+ * to the point `p` (as a `Foot`), i.e. the piece-wise minimum of the
+ * (certified) `closestPointOnBezier` of `flo-bezier3`.
+ *
+ * @param p the point
+ * @param curves the pieces of the piecewise bezier curve
+ *
+ * @internal
+ */
+function closestPointOnCurves(p, curves) {
+    let best = { d: Infinity, q: p, k: 0, t: 0 };
+    for (let k = 0; k < curves.length; k++) {
+        const c = closestPointOnBezier(curves[k], p);
+        if (c.d < best.d) {
+            best = { d: c.d, q: c.p, k, t: c.t };
+        }
+    }
+    return best;
+}
+/**
+ * Returns the distance from the point `p` to the piecewise bezier curve given
+ * by `curves` (i.e. the minimum over the pieces of the distance to the piece).
+ *
+ * @param p the point
+ * @param curves the pieces of the piecewise bezier curve
+ *
+ * @internal
+ */
+function distanceToCurves(p, curves) {
+    return closestPointOnCurves(p, curves).d;
+}
+/**
+ * Evaluates the bezier curve `ps` (of order 1, 2 or 3) and its first two
+ * derivatives at `t`, returned as `[B, B', B'']`.
+ *
+ * @internal
+ */
+function evalWithDerivatives(ps, t) {
+    const [p0, p1] = ps;
+    if (ps.length === 2) {
+        return [
+            [p0[0] + t * (p1[0] - p0[0]), p0[1] + t * (p1[1] - p0[1])],
+            [p1[0] - p0[0], p1[1] - p0[1]],
+            [0, 0]
+        ];
+    }
+    const s = 1 - t;
+    if (ps.length === 3) {
+        const p2 = ps[2];
+        return [
+            [s * s * p0[0] + 2 * s * t * p1[0] + t * t * p2[0],
+                s * s * p0[1] + 2 * s * t * p1[1] + t * t * p2[1]],
+            [2 * (s * (p1[0] - p0[0]) + t * (p2[0] - p1[0])),
+                2 * (s * (p1[1] - p0[1]) + t * (p2[1] - p1[1]))],
+            [2 * (p2[0] - 2 * p1[0] + p0[0]),
+                2 * (p2[1] - 2 * p1[1] + p0[1])]
+        ];
+    }
+    const p2 = ps[2];
+    const p3 = ps[3];
+    return [
+        [s * s * s * p0[0] + 3 * s * s * t * p1[0] + 3 * s * t * t * p2[0] + t * t * t * p3[0],
+            s * s * s * p0[1] + 3 * s * s * t * p1[1] + 3 * s * t * t * p2[1] + t * t * t * p3[1]],
+        [3 * (s * s * (p1[0] - p0[0]) + 2 * s * t * (p2[0] - p1[0]) + t * t * (p3[0] - p2[0])),
+            3 * (s * s * (p1[1] - p0[1]) + 2 * s * t * (p2[1] - p1[1]) + t * t * (p3[1] - p2[1]))],
+        [6 * (s * (p2[0] - 2 * p1[0] + p0[0]) + t * (p3[0] - 2 * p2[0] + p1[0])),
+            6 * (s * (p2[1] - 2 * p1[1] + p0[1]) + t * (p3[1] - 2 * p2[1] + p1[1]))]
+    ];
+}
+/**
+ * Returns a point on piece `k` of `curves` close to `p` found by a few Newton
+ * iterations on the squared distance starting from parameter `t0`, as a
+ * `Foot`.
+ *
+ * * the returned distance is thus an *upper bound* on the distance from `p`
+ * to the piecewise curve (any point on the curve gives one) - it is not
+ * certified to be the minimum
+ *
+ * @internal
+ */
+function newtonFoot(p, curves, k, t0) {
+    const ps = curves[k];
+    if (ps.length === 1) {
+        const q = ps[0];
+        return { d: sqrt((q[0] - p[0]) ** 2 + (q[1] - p[1]) ** 2), q, k, t: 0 };
+    }
+    let t = t0;
+    let [q, dq, ddq] = evalWithDerivatives(ps, t);
+    let rx = q[0] - p[0];
+    let ry = q[1] - p[1];
+    let best = { d: sqrt(rx * rx + ry * ry), q, k, t };
+    for (let i = 0; i < 4; i++) {
+        // minimize g(t) = |B(t) - p|²/2: g' = r·B', g'' = B'·B' + r·B''
+        const g1 = rx * dq[0] + ry * dq[1];
+        const g2 = dq[0] * dq[0] + dq[1] * dq[1] + rx * ddq[0] + ry * ddq[1];
+        if (g2 <= 0) {
+            break;
+        }
+        let t_ = t - g1 / g2;
+        if (t_ < 0) {
+            t_ = 0;
+        }
+        else if (t_ > 1) {
+            t_ = 1;
+        }
+        if (t_ === t) {
+            break;
+        }
+        t = t_;
+        [q, dq, ddq] = evalWithDerivatives(ps, t);
+        rx = q[0] - p[0];
+        ry = q[1] - p[1];
+        const d = sqrt(rx * rx + ry * ry);
+        if (d < best.d) {
+            best = { d, q, k, t };
+        }
+    }
+    return best;
+}
+/**
+ * Returns the maximum distance from the point `q` to the control points of
+ * `ps` - an upper bound on the distance from `q` to any point on the bezier
+ * curve `ps` (which lies within the convex hull of its control points).
+ *
+ * @internal
+ */
+function maxDistanceToControlPoints(ps, q) {
+    let m = 0;
+    for (let i = 0; i < ps.length; i++) {
+        const c = ps[i];
+        const dd = (c[0] - q[0]) ** 2 + (c[1] - q[1]) ** 2;
+        if (dd > m) {
+            m = dd;
+        }
+    }
+    return sqrt(m);
+}
+/**
+ * Returns `true` if the one-sided Hausdorff distance from the bezier curve `A`
+ * to the piecewise bezier curve `B` exceeds `tolerance` and `false` otherwise.
+ *
+ * * this is a *decision procedure* and is thus much cheaper than computing the
+ * distance (e.g. via `hausdorffDistanceOneSided` from `flo-bezier3`) and then
+ * comparing it: it stops as soon as either a point on `A` further than
+ * `tolerance` from `B` is found (a certified *lower* bound exceeding the
+ * tolerance) or every piece of `A` is certified to be within `tolerance`
+ * (a certified *upper* bound)
+ * * `A` is bisected into parameter intervals; the upper bound on an interval
+ * `[tS,tE]` is the smaller of
+ *     * `(hS + hE + L)/2` where `hS`, `hE` are (upper bounds on) the
+ *       distances from its endpoints to `B` and `L` is the control polygon
+ *       length of `A` restricted to the interval (an upper bound on its arc
+ *       length): any point on the interval is within `L` of both endpoints so
+ *       its distance to `B` is at most `min(hS + l, hE + (L - l))` with `l`
+ *       the arc length from the start, maximized at `(hS + hE + L)/2`
+ *     * the maximum distance from the foot (on `B`) of either endpoint to the
+ *       control points of `A` restricted to the interval (the sub-curve lies
+ *       within the convex hull of its control points, within which the
+ *       distance to a fixed point is maximized at a vertex)
+ * * the distances from sample points on `A` to `B` are found cheaply by
+ * Newton iteration from the feet of the neighboring samples - these are upper
+ * bounds (any point on `B` gives one) which suffice for certifying the
+ * acceptance of an interval; only when such a bound exceeds the tolerance is
+ * the certified (and expensive) closest point computed to decide whether the
+ * tolerance is really exceeded
+ * * `B` need not be smooth, nor need its pieces be connected
+ * * the result is approximate only to the extent that the floating point
+ * evaluations are, i.e. a decision is only taken once it is certain up to
+ * roundoff
+ *
+ * @param A the 'from' bezier curve given by its control points
+ * @param B the 'to' piecewise bezier curve given as an array of bezier curves
+ * @param tolerance the distance to compare against
+ * @param maxIterations the maximum number of interval bisections (each
+ * costing one cheap closest point calculation) before giving up, in which
+ * case `true` is returned (the conservative answer for simplification
+ * purposes); defaults to `1000` (curves only just within tolerance may
+ * need many bisections, especially where they run nearly parallel to `B`)
+ *
+ * @internal
+ */
+function hausdorffDistanceOneSidedExceeds(A, B, tolerance, maxIterations = 1000) {
+    const fS = closestPointOnCurves(A[0], B);
+    if (fS.d > tolerance) {
+        return true;
+    }
+    const fE = closestPointOnCurves(A[A.length - 1], B);
+    if (fE.d > tolerance) {
+        return true;
+    }
+    if (A.length <= 2) {
+        // A point or a line: if `B` is a single line (a convex set) the
+        // distance is convex along `A` and thus maximal at an endpoint.
+        if (A.length === 1 || (B.length === 1 && B[0].length <= 2)) {
+            return false;
+        }
+    }
+    // Depth first; the stack never holds more than about `2*log2(iterations)`
+    // intervals.
+    const stack = [{ tS: 0, tE: 1, fS, fE }];
+    let iterations = 0;
+    while (stack.length > 0) {
+        const { tS, tE, fS, fE } = stack.pop();
+        const ps = tS === 0 && tE === 1 ? A : fromTo(A, tS, tE);
+        // the entire interval is certified within tolerance if either upper
+        // bound says so
+        if ((fS.d + fE.d + controlPointLinesLength(ps)) / 2 <= tolerance) {
+            continue;
+        }
+        if (maxDistanceToControlPoints(ps, fS.q) <= tolerance ||
+            maxDistanceToControlPoints(ps, fE.q) <= tolerance) {
+            continue;
+        }
+        if (iterations++ >= maxIterations) {
+            return true; // undecided - be conservative
+        }
+        const tM = (tS + tE) / 2;
+        const pM = evalDeCasteljau(A, tM);
+        // a cheap upper bound on the distance from `pM` to `B` - by Newton
+        // iteration from the feet of the endpoints
+        let fM = newtonFoot(pM, B, fS.k, fS.k === fE.k ? (fS.t + fE.t) / 2 : fS.t);
+        if (fS.k !== fE.k) {
+            const fM_ = newtonFoot(pM, B, fE.k, fE.t);
+            if (fM_.d < fM.d) {
+                fM = fM_;
+            }
+        }
+        if (fM.d > tolerance) {
+            // possibly exceeds - now get the certified closest point
+            fM = closestPointOnCurves(pM, B);
+            if (fM.d > tolerance) {
+                return true;
+            }
+        }
+        // push the half with the larger lower bound last so it is tried first
+        if (max(fS.d, fM.d) >= max(fM.d, fE.d)) {
+            stack.push({ tS: tM, tE, fS: fM, fE });
+            stack.push({ tS, tE: tM, fS, fE: fM });
+        }
+        else {
+            stack.push({ tS, tE: tM, fS, fE: fM });
+            stack.push({ tS: tM, tE, fS: fM, fE });
+        }
+    }
+    return false;
+}
+export { hausdorffDistanceOneSidedExceeds, distanceToCurves, closestPointOnCurves };
+//# sourceMappingURL=hausdorff-distance-one-sided-exceeds.js.map

package/node/mat/hausdorff-distance-one-sided-exceeds.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hausdorff-distance-one-sided-exceeds.js","sourceRoot":"","sources":["../../src/mat/hausdorff-distance-one-sided-exceeds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,uBAAuB,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErG,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAiB3B;;;;;;;;;GASG;AACH,SAAS,oBAAoB,CACrB,CAAW,EACX,MAAoB;IAExB,IAAI,IAAI,GAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACnD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;YACf,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzC,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAGD;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CACjB,CAAW,EACX,MAAoB;IAExB,OAAO,oBAAoB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAGD;;;;;GAKG;AACH,SAAS,mBAAmB,CACpB,EAAc,EACd,CAAS;IAEb,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;IAEpB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO;YACH,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC,CAAC,EAAE,CAAC,CAAC;SACT,CAAC;IACN,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAEhB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACjB,OAAO;YACH,CAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC;gBACnC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;SAChC,CAAC;IACN,CAAC;IAED,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,OAAO;QACH,CAAC,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC;YACzD,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACrE,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAClE,CAAC;AACN,CAAC;AAGD;;;;;;;;;;GAUG;AACH,SAAS,UAAU,CACX,CAAW,EACX,MAAoB,EACpB,CAAS,EACT,EAAU;IAEd,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAClB,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChB,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,mBAAmB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9C,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,IAAI,GAAS,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAErD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACrB,gEAAgE;QAChE,MAAM,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YAAC,MAAM;QAAC,CAAC;QAEvB,IAAI,EAAE,GAAG,CAAC,GAAG,EAAE,GAAC,EAAE,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAAC,EAAE,GAAG,CAAC,CAAC;QAAC,CAAC;aAAM,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAAC,EAAE,GAAG,CAAC,CAAC;QAAC,CAAC;QACpD,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YAAC,MAAM;QAAC,CAAC;QACxB,CAAC,GAAG,EAAE,CAAC;QAEP,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,mBAAmB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC1C,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;YAAC,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QAAC,CAAC;IAC9C,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAGD;;;;;;GAMG;AACH,SAAS,0BAA0B,CAC3B,EAAc,EACd,CAAW;IAEf,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAE,CAAC,CAAC;QAC/C,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAAC,CAAC,GAAG,EAAE,CAAC;QAAC,CAAC;IAC3B,CAAC;IAED,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAiBD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AACH,SAAS,gCAAgC,CACjC,CAAa,EACb,CAAe,EACf,SAAiB,EACjB,aAAa,GAAG,IAAI;IAExB,MAAM,EAAE,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,IAAI,EAAE,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;IACtC,MAAM,EAAE,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,IAAI,EAAE,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;IAEtC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAChB,gEAAgE;QAChE,gEAAgE;QAChE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC;YACzD,OAAO,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IAED,0EAA0E;IAC1E,aAAa;IACb,MAAM,KAAK,GAAe,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACrD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAExC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAExD,oEAAoE;QACpE,gBAAgB;QAChB,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,uBAAuB,CAAC,EAAE,CAAC,CAAC,GAAC,CAAC,IAAI,SAAS,EAAE,CAAC;YAC7D,SAAS;QACb,CAAC;QACD,IAAI,0BAA0B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,SAAS;YACjD,0BAA0B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;YACpD,SAAS;QACb,CAAC;QAED,IAAI,UAAU,EAAE,IAAI,aAAa,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC,CAAE,8BAA8B;QAChD,CAAC;QAED,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAElC,mEAAmE;QACnE,2CAA2C;QAC3C,IAAI,EAAE,GAAG,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzE,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;YAChB,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;gBAAC,EAAE,GAAG,GAAG,CAAC;YAAC,CAAC;QACnC,CAAC;QAED,IAAI,EAAE,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;YACnB,yDAAyD;YACzD,EAAE,GAAG,oBAAoB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACjC,IAAI,EAAE,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;gBAAC,OAAO,IAAI,CAAC;YAAC,CAAC;QAC1C,CAAC;QAED,sEAAsE;QACtE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACJ,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3C,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,gCAAgC,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,CAAA"}

package/node/mat/mat-meta.d.ts

@@ -1,16 +1,10 @@
 import type { Loop } from 'flo-boolean';
 import type { CpNode } from '../cp-node/cp-node.js';
-import type { Curve } from 'flo-boolean';
 import { RbTree } from 'flo-ll-rb-tree';
 interface MatMeta {
     /** The minimum power of 2 such that `2**maxCoordPowerOf2 >= "the max coordinate"` */
     readonly maxCoordPowerOf2: number;
     readonly squaredDiagonalLength: number;
-    readonly looseBoundingBoxes: number[][][];
-    readonly tightBoundingBoxes: number[][][];
-    readonly boundingHulls: number[][][];
-    readonly sharpCorners: Curve[];
-    readonly dullCorners: Curve[];
     readonly loops: Loop[];
     /**
      * Primarily for internal use. A tree structure storing the

package/node/mat/simplify-mat.d.ts

@@ -3,14 +3,31 @@ import type { Mat } from './mat.js';
  * Returns a new simplified MAT of the given one by replacing the piecewise
  * quad beziers composing the MAT with fewer ones to within a given tolerance.
  *
- * @param cpNode a representation of the MAT
- * @param anlgeTolerance tolerance given as the degrees difference of the unit
- * direction vectors at the interface between curves. A tolerance of zero means
- * perfect smoothness is required - defaults to 15
- * @param hausdorffTolerance the approximate maximum Hausdorff Distance tolerance -
- * defaults to `2**-3`
- * @param maxIterations the max iterations of the Hausdorff Distance calculation,
- * defaults to `50`
+ * * the vertices of the simplified MAT are a subset of those of the given one
+ * (so the endpoints of each new curve are endpoints of existing ones) and all
+ * 'special' vertices (leaves, 3-prongs and higher, hole-closers) are kept
+ * * each branch is simplified Douglas-Peucker style: the single curve from the
+ * start to the end of a span of edges is tried and, if some edge deviates from
+ * it by more than the tolerance, the span is split at the vertex of worst
+ * deviation and both halves are tried in turn; this is `O(n log n)` (in the
+ * number of edges `n` of a branch) Hausdorff distance checks as opposed to the
+ * `O(n²)` of greedily extending spans one vertex at a time
+ * * the deviation of an edge from the single curve is checked first by cheap
+ * sampled *lower* bounds (which already find most splits) and only then by
+ * the certified `hausdorffDistanceOneSidedExceeds`
+ * * the tolerance is a certified upper bound on the one-sided Hausdorff
+ * distance from the original MAT curves to the simplified ones (up to
+ * floating point roundoff)
+ *
+ * @param mat the MAT to simplify (it is not modified)
+ * @param hausdorffTolerance the maximum one-sided Hausdorff distance (in
+ * coordinate units) from the original to the simplified MAT - defaults to
+ * `2**-3`
+ * @param maxIterations the max bisections of each Hausdorff distance check
+ * (see `hausdorffDistanceOneSidedExceeds`) after which the check conservatively
+ * fails (so that the span is split rather than accepted) - defaults to `1000`;
+ * lower values trade simplification quality for a bound on the time spent on
+ * curves that are only just within tolerance
  */
 declare function simplifyMat(mat: Mat, hausdorffTolerance?: number, maxIterations?: number): Mat;
 export { simplifyMat };

package/node/mat/simplify-mat.js

@@ -1,84 +1,213 @@
-import { hausdorffDistanceOneSided } from 'flo-bezier3';
+import { evalDeCasteljau } from 'flo-bezier3';
 import { removeVertex } from '../vertex/remove-vertex.js';
 import { getBranches } from './get-branches.js';
 import { getMatCurveToNext } from '../cp-node/fs/get-mat-curve-to-next.js';
 import { getMatCurveBetween } from '../cp-node/fs/get-mat-curve-between.js';
 import { createNewCpTrees } from './create-new-cp-trees.js';
 import { clone } from '../cp-node/fs/clone.js';
-import { findFirst } from '../cp-node/fs/find-first.js';
 import { isTerminating } from '../cp-node/fs/is-terminating.js';
-import { isVertex } from '../cp-node/fs/is-vertex.js';
+import { isSpecial } from '../cp-node/fs/is-special.js';
 import { getProngCount } from '../cp-node/fs/get-prong-count.js';
-const { max } = Math;
-// FUTURE could be made faster by binary "search" on hausdorff curves?
+import { distanceToCurves, hausdorffDistanceOneSidedExceeds } from './hausdorff-distance-one-sided-exceeds.js';
+const { abs } = Math;
+/**
+ * Spans of at least this many edges whose worst vertex lies within
+ * `END_FRACTION` of either end are additionally split at their middle - this
+ * guards against the degenerate case where each split peels off only a few
+ * edges at an end (making the recursion depth, and the total work, quadratic
+ * in the branch length) at the cost of at most one extra curve per occurrence.
+ *
+ * @internal
+ */
+const MIN_EDGES_FOR_BALANCED_SPLIT = 32;
+/** @internal */
+const END_FRACTION = 1 / 8;
 /**
  * Returns a new simplified MAT of the given one by replacing the piecewise
  * quad beziers composing the MAT with fewer ones to within a given tolerance.
  *
- * @param cpNode a representation of the MAT
- * @param anlgeTolerance tolerance given as the degrees difference of the unit
- * direction vectors at the interface between curves. A tolerance of zero means
- * perfect smoothness is required - defaults to 15
- * @param hausdorffTolerance the approximate maximum Hausdorff Distance tolerance -
- * defaults to `2**-3`
- * @param maxIterations the max iterations of the Hausdorff Distance calculation,
- * defaults to `50`
+ * * the vertices of the simplified MAT are a subset of those of the given one
+ * (so the endpoints of each new curve are endpoints of existing ones) and all
+ * 'special' vertices (leaves, 3-prongs and higher, hole-closers) are kept
+ * * each branch is simplified Douglas-Peucker style: the single curve from the
+ * start to the end of a span of edges is tried and, if some edge deviates from
+ * it by more than the tolerance, the span is split at the vertex of worst
+ * deviation and both halves are tried in turn; this is `O(n log n)` (in the
+ * number of edges `n` of a branch) Hausdorff distance checks as opposed to the
+ * `O(n²)` of greedily extending spans one vertex at a time
+ * * the deviation of an edge from the single curve is checked first by cheap
+ * sampled *lower* bounds (which already find most splits) and only then by
+ * the certified `hausdorffDistanceOneSidedExceeds`
+ * * the tolerance is a certified upper bound on the one-sided Hausdorff
+ * distance from the original MAT curves to the simplified ones (up to
+ * floating point roundoff)
+ *
+ * @param mat the MAT to simplify (it is not modified)
+ * @param hausdorffTolerance the maximum one-sided Hausdorff distance (in
+ * coordinate units) from the original to the simplified MAT - defaults to
+ * `2**-3`
+ * @param maxIterations the max bisections of each Hausdorff distance check
+ * (see `hausdorffDistanceOneSidedExceeds`) after which the check conservatively
+ * fails (so that the span is split rather than accepted) - defaults to `1000`;
+ * lower values trade simplification quality for a bound on the time spent on
+ * curves that are only just within tolerance
  */
-function simplifyMat(mat, hausdorffTolerance = 2 ** -3, maxIterations = 50) {
+function simplifyMat(mat, hausdorffTolerance = 2 ** -3, maxIterations = 1000) {
     let cpNode = clone(mat.cpNode);
-    // Start from a leaf
+    // The clone gets its own `cpTrees` (removing vertices below must not
+    // touch the trees of the given `mat`) - they are kept up to date by
+    // `removeVertex`.
+    const meta = { ...mat.meta, cpTrees: createNewCpTrees(cpNode) };
+    // Start from a leaf (which is never removed so it can be returned)
     while (!isTerminating(cpNode)) {
         cpNode = cpNode.next;
     }
     const branches = getBranches(cpNode);
-    const canDeletes = new Set();
+    const toRemove = [];
     for (let k = 0; k < branches.length; k++) {
-        const branch = branches[k];
-        // Try to remove some
-        let j = 0;
-        while (j < branch.length) {
-            const i = j;
-            while (true) {
-                j++;
-                if (j === branch.length) {
-                    break;
-                }
-                const hd = getTotalHausdorffDistance(i, j, branch, maxIterations);
-                if (hd > hausdorffTolerance) {
-                    break;
+        simplifyBranch(branches[k], hausdorffTolerance, maxIterations, toRemove);
+    }
+    for (const cpNode of toRemove) {
+        removeVertex(cpNode, meta);
+    }
+    return { cpNode, meta };
+}
+/**
+ * Simplifies the given branch by adding the `CpNode`s of the vertices that
+ * can be removed to `toRemove`.
+ *
+ * * edge `k` of the branch runs from `branch[k]` to `branch[k].next`; vertex
+ * `k` (for `0 < k < branch.length`) is the interior vertex `branch[k]` between
+ * edges `k-1` and `k`
+ * * a span of edges `i..j` is simplified to the single curve from the start
+ * of edge `i` to the end of edge `j`, removing the interior vertices `i+1..j`
+ *
+ * @internal
+ */
+function simplifyBranch(branch, tolerance, maxIterations, toRemove) {
+    const n = branch.length; // the number of edges
+    if (n < 2) {
+        return;
+    }
+    // the MAT curves of the edges of the branch - computed once per branch
+    const curves = branch.map(getMatCurveToNext);
+    const vertexPoints = branch.map(cpNode => cpNode.pointOnShape.circle.center);
+    // The spans still to be processed; interior vertices that cannot be
+    // removed must be kept so the branch is pre-split there: the 'special'
+    // ones (e.g. hole-closers) and those whose circle carries more than 2
+    // `CpNode`s (e.g. a 2-prong having a terminating sharp corner contact,
+    // which `getBranch` passes through but `removeVertex` cannot remove).
+    const spans = [];
+    let a = 0;
+    for (let k = 1; k < n; k++) {
+        if (isSpecial(branch[k]) || getProngCount(branch[k]) !== 2) {
+            spans.push([a, k - 1]);
+            a = k;
+        }
+    }
+    spans.push([a, n - 1]);
+    while (spans.length > 0) {
+        const [i, j] = spans.pop();
+        if (j <= i) {
+            continue;
+        } // a single edge - nothing to remove
+        const longCurves = getMatCurveBetween(branch[i], branch[j].next);
+        //------------------------------------------------------------------
+        // 1. Cheap pass: sampled lower bounds on the deviation of each edge -
+        //    the interior vertices and the piece midpoints.
+        //------------------------------------------------------------------
+        let worstD = 0;
+        let worstV = -1;
+        for (let k = i; k <= j; k++) {
+            if (k > i) {
+                const d = distanceToCurves(vertexPoints[k], longCurves);
+                if (d > worstD) {
+                    worstD = d;
+                    worstV = k;
                 }
-                else {
-                    canDeletes.add(branch[j]);
+            }
+            const pieces = curves[k];
+            for (let m = 0; m < pieces.length; m++) {
+                const d = distanceToCurves(evalDeCasteljau(pieces[m], 0.5), longCurves);
+                if (d > worstD) {
+                    worstD = d;
+                    worstV = getSplitVertexForEdge(i, j, k, m, pieces.length);
                 }
             }
-            if (i + 1 === j) {
-                continue; // no simplification occured
+        }
+        if (worstD > tolerance) {
+            split(spans, i, j, worstV);
+            continue;
+        }
+        //------------------------------------------------------------------
+        // 2. Certified pass - split at the first edge found to exceed the
+        //    tolerance.
+        //------------------------------------------------------------------
+        let splitV = -1;
+        outer: for (let k = i; k <= j; k++) {
+            const pieces = curves[k];
+            for (let m = 0; m < pieces.length; m++) {
+                if (hausdorffDistanceOneSidedExceeds(pieces[m], longCurves, tolerance, maxIterations)) {
+                    splitV = getSplitVertexForEdge(i, j, k, m, pieces.length);
+                    break outer;
+                }
             }
         }
-    }
-    // cpNode = findFirst(cpNode_ => isTerminating(cpNode_) ? cpNode_ : undefined, cpNode)!;
-    cpNode = findFirst(isTerminating, cpNode);
-    for (const cpNode of canDeletes) {
-        if (!isVertex(cpNode => (getProngCount(cpNode) !== 2) &&
-            !cpNode.isHoleClosing)(cpNode)) {
-            removeVertex(cpNode, mat.meta);
+        if (splitV !== -1) {
+            split(spans, i, j, splitV);
+            continue;
         }
-    }
-    return {
-        cpNode,
-        meta: {
-            ...mat.meta,
-            cpTrees: createNewCpTrees(cpNode)
+        //------------------------------------------------------------------
+        // 3. Accept the span.
+        //------------------------------------------------------------------
+        for (let k = i + 1; k <= j; k++) {
+            toRemove.push(branch[k]);
         }
-    };
+    }
+}
+/**
+ * Returns the vertex (in `(i,j]`) at which to split the span of edges `i..j`
+ * given that piece `m` (of `numPieces`) of edge `k` deviates too much: one of
+ * the edge's two endpoint vertices - the one on the side of the piece if the
+ * edge has 2 pieces, else the one nearer the middle of the span (for a more
+ * balanced recursion).
+ *
+ * @internal
+ */
+function getSplitVertexForEdge(i, j, k, m, numPieces) {
+    const canUseStart = k > i;
+    const canUseEnd = k + 1 <= j;
+    if (!canUseStart) {
+        return k + 1;
+    }
+    if (!canUseEnd) {
+        return k;
+    }
+    if (numPieces === 2) {
+        return m === 0 ? k : k + 1;
+    }
+    const mid = (i + 1 + j) / 2; // middle of the interior vertices `i+1..j`
+    return abs(k - mid) <= abs(k + 1 - mid) ? k : k + 1;
 }
-function getTotalHausdorffDistance(i, j, branch, hausdorffSpacing) {
-    const hds = [];
-    const longCurve = getMatCurveBetween(branch[i], branch[j].next);
-    for (; i < j + 1; i++) {
-        hds.push(hausdorffDistanceOneSided(getMatCurveToNext(branch[i]), longCurve, hausdorffSpacing));
+/**
+ * Splits the span of edges `i..j` at the vertex `v` (in `(i,j]`) and pushes
+ * the resulting spans (for very long spans with `v` near an end also split at
+ * the middle - see `MIN_EDGES_FOR_BALANCED_SPLIT`).
+ *
+ * @internal
+ */
+function split(spans, i, j, v) {
+    const numEdges = j - i + 1;
+    if (numEdges >= MIN_EDGES_FOR_BALANCED_SPLIT) {
+        const margin = numEdges * END_FRACTION;
+        if (v - i < margin || j + 1 - v < margin) {
+            const vMid = (i + j + 1) >>> 1; // an interior vertex near the middle
+            const [v1, v2] = v < vMid ? [v, vMid] : [vMid, v];
+            spans.push([v2, j], [v1, v2 - 1], [i, v1 - 1]);
+            return;
+        }
     }
-    return max(...hds);
+    spans.push([v, j], [i, v - 1]);
 }
 export { simplifyMat };
 //# sourceMappingURL=simplify-mat.js.map

package/node/mat/simplify-mat.js.map

@@ -1 +1 @@
-{"version":3,"file":"simplify-mat.js","sourceRoot":"","sources":["../../src/mat/simplify-mat.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,yBAAyB,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,iBAAiB,EAAE,MAAM,wCAAwC,CAAC;AAC3E,OAAO,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AAC5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,kCAAkC,CAAC;AAEjE,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAGrB,sEAAsE;AACtE;;;;;;;;;;;;GAYG;AACH,SAAS,WAAW,CACZ,GAAQ,EACR,kBAAkB,GAAG,CAAC,IAAE,CAAC,CAAC,EAC1B,aAAa,GAAG,EAAE;IAEtB,IAAI,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAE/B,oBAAoB;IACpB,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;QAAC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IAAC,CAAC;IAExD,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAErC,MAAM,UAAU,GAAgB,IAAI,GAAG,EAAE,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE3B,qBAAqB;QACrB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,CAAC;YACZ,OAAO,IAAI,EAAE,CAAC;gBACV,CAAC,EAAE,CAAC;gBAEJ,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;oBAAC,MAAM;gBAAC,CAAC;gBAEnC,MAAM,EAAE,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;gBAElE,IAAI,EAAE,GAAG,kBAAkB,EAAE,CAAC;oBAC1B,MAAM;gBACV,CAAC;qBAAM,CAAC;oBACJ,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,CAAC;YACL,CAAC;YAED,IAAI,CAAC,GAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,SAAS,CAAE,4BAA4B;YAC3C,CAAC;QACL,CAAC;IACL,CAAC;IAED,wFAAwF;IACxF,MAAM,GAAG,SAAS,CAAC,aAAa,EAAE,MAAM,CAAE,CAAC;IAE3C,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CACf,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC,MAAM,CAAC,aAAa,CACxB,CAAC,MAAM,CAAC,EAAE,CAAC;YAEZ,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;IACL,CAAC;IAGD,OAAO;QACH,MAAM;QACN,IAAI,EAAE;YACF,GAAG,GAAG,CAAC,IAAI;YACX,OAAO,EAAE,gBAAgB,CAAC,MAAM,CAAC;SACpC;KACJ,CAAA;AACL,CAAC;AAGD,SAAS,yBAAyB,CAC1B,CAAS,EACT,CAAS,EACT,MAAgB,EAChB,gBAAwB;IAE5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,SAAS,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAChE,OAAO,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChB,GAAG,CAAC,IAAI,CAAC,yBAAyB,CAC9B,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAC5B,SAAS,EACT,gBAAgB,CACnB,CAAC,CAAC;IACP,CAAC;IAED,OAAO,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACvB,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}
+{"version":3,"file":"simplify-mat.js","sourceRoot":"","sources":["../../src/mat/simplify-mat.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,iBAAiB,EAAE,MAAM,wCAAwC,CAAC;AAC3E,OAAO,EAAE,kBAAkB,EAAE,MAAM,wCAAwC,CAAC;AAC5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,kCAAkC,CAAC;AACjE,OAAO,EAAE,gBAAgB,EAAE,gCAAgC,EAAE,MAAM,2CAA2C,CAAC;AAE/G,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAGrB;;;;;;;;GAQG;AACH,MAAM,4BAA4B,GAAG,EAAE,CAAC;AACxC,gBAAgB;AAChB,MAAM,YAAY,GAAG,CAAC,GAAC,CAAC,CAAC;AAGzB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,SAAS,WAAW,CACZ,GAAQ,EACR,kBAAkB,GAAG,CAAC,IAAE,CAAC,CAAC,EAC1B,aAAa,GAAG,IAAI;IAExB,IAAI,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,qEAAqE;IACrE,oEAAoE;IACpE,kBAAkB;IAClB,MAAM,IAAI,GAAY,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;IAEzE,mEAAmE;IACnE,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;QAAC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;IAAC,CAAC;IAExD,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAErC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,kBAAkB,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;IAC7E,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC5B,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC;AAGD;;;;;;;;;;;GAWG;AACH,SAAS,cAAc,CACf,MAAgB,EAChB,SAAiB,EACjB,aAAqB,EACrB,QAAkB;IAEtB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAE,sBAAsB;IAChD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAAC,OAAO;IAAC,CAAC;IAEtB,uEAAuE;IACvE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;IAC7C,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE7E,oEAAoE;IACpE,uEAAuE;IACvE,sEAAsE;IACtE,uEAAuE;IACvE,sEAAsE;IACtE,MAAM,KAAK,GAAsB,EAAE,CAAC;IACpC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACrB,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACzD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,GAAG,CAAC,CAAC;QACV,CAAC;IACL,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC;IAErB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC,CAAE,oCAAoC;QAE/D,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAEjE,oEAAoE;QACpE,sEAAsE;QACtE,oDAAoD;QACpD,oEAAoE;QACpE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,IAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACR,MAAM,CAAC,GAAG,gBAAgB,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;gBACxD,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC;oBAAC,MAAM,GAAG,CAAC,CAAC;oBAAC,MAAM,GAAG,CAAC,CAAC;gBAAC,CAAC;YAC/C,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,MAAM,CAAC,GAAG,gBAAgB,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;gBACxE,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC;oBACb,MAAM,GAAG,CAAC,CAAC;oBACX,MAAM,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC9D,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;YACrB,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAC3B,SAAS;QACb,CAAC;QAED,oEAAoE;QACpE,kEAAkE;QAClE,gBAAgB;QAChB,oEAAoE;QACpE,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAChB,KAAK,EAAE,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,IAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjC,IAAI,gCAAgC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,aAAa,CAAC,EAAE,CAAC;oBACpF,MAAM,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC1D,MAAM,KAAK,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;YAChB,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAC3B,SAAS;QACb,CAAC;QAED,oEAAoE;QACpE,sBAAsB;QACtB,oEAAoE;QACpE,KAAK,IAAI,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,IAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACxB,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;IACL,CAAC;AACL,CAAC;AAGD;;;;;;;;GAQG;AACH,SAAS,qBAAqB,CACtB,CAAS,EACT,CAAS,EACT,CAAS,EACT,CAAS,EACT,SAAiB;IAErB,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1B,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAE7B,IAAI,CAAC,WAAW,EAAE,CAAC;QAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAAC,CAAC;IACnC,IAAI,CAAC,SAAS,EAAE,CAAC;QAAC,OAAO,CAAC,CAAC;IAAC,CAAC;IAE7B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAC,CAAC,CAAC,CAAE,2CAA2C;IAEvE,OAAO,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACxD,CAAC;AAGD;;;;;;GAMG;AACH,SAAS,KAAK,CACN,KAAwB,EACxB,CAAS,EACT,CAAS,EACT,CAAS;IAEb,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,QAAQ,IAAI,4BAA4B,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,QAAQ,GAAC,YAAY,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,qCAAqC;YACtE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAClD,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,GAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,OAAO;QACX,CAAC;IACL,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC;AACjC,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

package/node/mat/trim-mat.d.ts

@@ -3,7 +3,9 @@ import type { Mat } from './mat.js';
  * Trims the given Medial Axis Transform so that only cycles remain. Similar to
  * toScaleAxis(mat, Infinity).
  *
- * @param mat The MAT to trim.
+ * * returns `undefined` if the MAT has no cycles (i.e. the shape has no holes)
+ *
+ * @param mat The MAT to trim (it is not modified).
  */
-declare function trimMat(mat: Mat): Mat;
+declare function trimMat(mat: Mat): Mat | undefined;
 export { trimMat };

package/node/mat/trim-mat.js

@@ -5,7 +5,9 @@ import { clone } from '../cp-node/fs/clone.js';
  * Trims the given Medial Axis Transform so that only cycles remain. Similar to
  * toScaleAxis(mat, Infinity).
  *
- * @param mat The MAT to trim.
+ * * returns `undefined` if the MAT has no cycles (i.e. the shape has no holes)
+ *
+ * @param mat The MAT to trim (it is not modified).
  */
 function trimMat(mat) {
     // FUTURE - clone entire `Mat` instead (the function already exists)