@faicad/faijs 0.13.0

package/dist/vendored/brepjs/2d/blueprints/segmentAssembly.js

@@ -0,0 +1,226 @@
+import zip from '../../utils/zip.js';
+import { wasmIndex } from '../../utils/vec3.js';
+import { make2dSegmentCurve, crossProduct2d, subtract2d } from '../../2d/lib/index.js';
+import Blueprint from './blueprint.js';
+import { organiseBlueprints } from './lib.js';
+import { samePoint, curveMidPoint, reverseSegment } from './booleanHelpers.js';
+import { blueprintsIntersectionSegments } from './intersectionSegments.js';
+// ---------------------------------------------------------------------------
+// Collinear segment merging
+// ---------------------------------------------------------------------------
+/**
+ * Merge adjacent collinear line segments into single segments.
+ *
+ * Boolean operations can split a line at intersection points that lie on the
+ * line itself (e.g. when a cut rectangle's edge is collinear with the
+ * profile's edge). The extra split creates a C0 discontinuity in swept
+ * surfaces. Merging eliminates unnecessary vertices.
+ */
+function mergeCollinearSegments(curves) {
+    if (curves.length < 2)
+        return curves;
+    const result = [];
+    let i = 0;
+    while (i < curves.length) {
+        const current = wasmIndex(curves, i);
+        if (current.geomType !== 'LINE') {
+            result.push(current);
+            i++;
+            continue;
+        }
+        // Accumulate consecutive collinear lines
+        let endPoint = current.lastPoint;
+        let j = i + 1;
+        while (j < curves.length) {
+            const next = wasmIndex(curves, j);
+            if (next.geomType !== 'LINE')
+                break;
+            if (!samePoint(endPoint, next.firstPoint))
+                break;
+            const dir1 = subtract2d(endPoint, current.firstPoint);
+            const dir2 = subtract2d(next.lastPoint, next.firstPoint);
+            if (Math.abs(crossProduct2d(dir1, dir2)) > 1e-9)
+                break;
+            endPoint = next.lastPoint;
+            j++;
+        }
+        if (j > i + 1) {
+            result.push(make2dSegmentCurve(current.firstPoint, endPoint));
+        }
+        else {
+            result.push(current);
+        }
+        i = j;
+    }
+    return result;
+}
+// ---------------------------------------------------------------------------
+// Path splitting: detect discontinuities and split into separate loops
+// ---------------------------------------------------------------------------
+/**
+ * Split an array of curves into separate continuous paths. A discontinuity
+ * occurs where one curve's lastPoint does not match the next curve's
+ * firstPoint.
+ */
+export function splitPaths(curves) {
+    const startPoints = curves.map((c) => c.firstPoint);
+    const shiftedEndPoints = curves.map((c) => c.lastPoint);
+    // Rotate endPoints so endPoints[i] is the lastPoint of the previous curve
+    const endPoints = shiftedEndPoints.slice(-1).concat(shiftedEndPoints.slice(0, -1));
+    const discontinuities = zip([startPoints, endPoints])
+        .map(([startPoint, endPoint], index) => {
+        if (startPoint === undefined || endPoint === undefined)
+            return null;
+        return samePoint(startPoint, endPoint) ? null : index;
+    })
+        .filter((f) => f !== null);
+    if (discontinuities.length === 0)
+        return [curves];
+    // Build paths between consecutive discontinuities
+    const paths = zip([discontinuities.slice(0, -1), discontinuities.slice(1)]).map(([start, end]) => curves.slice(start, end));
+    // Handle the wrap-around path (from last discontinuity back to first)
+    let lastPath = curves.slice(discontinuities[discontinuities.length - 1]);
+    const firstDiscontinuity = discontinuities[0];
+    if (firstDiscontinuity !== undefined && firstDiscontinuity !== 0) {
+        lastPath = lastPath.concat(curves.slice(0, firstDiscontinuity));
+    }
+    paths.push(lastPath);
+    return paths;
+}
+/**
+ * Handle the case where two segments overlap ("same"). The decision depends
+ * on how many segments are entering the current intersection node.
+ */
+function handleSameSegment(firstSegment, segmentsIn, lastWasSame) {
+    if (segmentsIn === 1) {
+        return { curves: [...firstSegment], segmentsIn: 1, lastWasSame: null };
+    }
+    if (segmentsIn === 2 || segmentsIn === 0) {
+        return { curves: [], segmentsIn: null, lastWasSame: null };
+    }
+    // segmentsIn === null: accumulate same-segments until we can resolve
+    if (segmentsIn === null) {
+        const accumulated = lastWasSame ? [...lastWasSame, ...firstSegment] : firstSegment;
+        return { curves: [], segmentsIn: null, lastWasSame: accumulated };
+    }
+    // Should not reach here
+    return { curves: [], segmentsIn, lastWasSame };
+}
+/**
+ * Determine which non-overlapping segments to keep based on
+ * inside/outside status relative to the other blueprint.
+ */
+function selectSegments(firstSegment, secondSegment, first, second, config, segmentsIn, lastWasSame) {
+    let segments = [];
+    let segmentsOut = 0;
+    // Check first segment
+    const firstCurve = firstSegment[0];
+    if (firstCurve !== undefined) {
+        const firstSegmentPoint = curveMidPoint(firstCurve);
+        const firstInSecond = second.isInside(firstSegmentPoint);
+        if ((config.firstInside === 'keep' && firstInSecond) ||
+            (config.firstInside === 'remove' && !firstInSecond)) {
+            segmentsOut += 1;
+            segments.push(...firstSegment);
+        }
+    }
+    // Check second segment
+    const secondCurve = secondSegment[0];
+    if (secondCurve !== undefined) {
+        const secondSegmentPoint = curveMidPoint(secondCurve);
+        const secondInFirst = first.isInside(secondSegmentPoint);
+        if ((config.secondInside === 'keep' && secondInFirst) ||
+            (config.secondInside === 'remove' && !secondInFirst)) {
+            let segmentsToAdd = secondSegment;
+            // When there are only two segments we cannot know if we are in the
+            // same direction until here, so it is possible they are mismatched.
+            if (segmentsOut === 1) {
+                segmentsToAdd = reverseSegment(secondSegment);
+            }
+            segmentsOut += 1;
+            segments.push(...segmentsToAdd);
+        }
+    }
+    // When the previous node had unknown segment info and only one segment
+    // was selected, prepend the accumulated same-segments
+    if (segmentsIn === null && segmentsOut === 1 && lastWasSame !== null) {
+        segments = [...lastWasSame, ...segments];
+    }
+    const newSegmentsIn = segmentsOut === 1 ? segmentsOut : segmentsIn;
+    const newLastWasSame = segmentsOut === 1 ? null : lastWasSame;
+    return { curves: segments, segmentsIn: newSegmentsIn, lastWasSame: newLastWasSame };
+}
+/**
+ * Core boolean operation between two simple (non-compound) blueprints.
+ *
+ * Segments both blueprints at their intersection points, then selects which
+ * segments to keep based on the `firstInside`/`secondInside` configuration.
+ */
+export function booleanOperation(first, second, config) {
+    const segments = blueprintsIntersectionSegments(first, second);
+    // No intersections: determine containment relationship
+    if (segments === null) {
+        return buildNoIntersectionResult(first, second);
+    }
+    // If all segments are identical, the blueprints are the same shape
+    if (segments.every(([, secondSegment]) => secondSegment === 'same')) {
+        return { identical: true };
+    }
+    // Assemble output curves by iterating through paired segments
+    let segmentsIn = null;
+    let lastWasSame = null;
+    let assembledCurves = segments.flatMap(([firstSegment, secondSegment]) => {
+        if (secondSegment === 'same') {
+            const result = handleSameSegment(firstSegment, segmentsIn, lastWasSame);
+            segmentsIn = result.segmentsIn;
+            lastWasSame = result.lastWasSame;
+            return result.curves;
+        }
+        const result = selectSegments(firstSegment, secondSegment, first, second, config, segmentsIn, lastWasSame);
+        segmentsIn = result.segmentsIn;
+        lastWasSame = result.lastWasSame;
+        return result.curves;
+    });
+    // Resolve any trailing same-segments that were accumulated but never flushed.
+    // handleSameSegment accumulates into lastWasSame only when segmentsIn is null,
+    // and clears it when segmentsIn is 1. The combined state (lastWasSame != null
+    // AND segmentsIn == 1) occurs when: trailing 'same' segments accumulate at the
+    // end of the sequence, then a non-same segment resolves segmentsIn to 1 but
+    // the loop ends before the accumulated curves can be prepended by selectSegments.
+    // Note: segmentsIn and lastWasSame are mutated inside the flatMap callback;
+    // TypeScript narrows them to their initial values, so we cast to the actual type.
+    const finalLastWasSame = lastWasSame;
+    const finalSegmentsIn = segmentsIn;
+    if (finalLastWasSame !== null && finalSegmentsIn === 1) {
+        assembledCurves = [...finalLastWasSame, ...assembledCurves];
+    }
+    // Merge collinear lines created by splits at intersection points, then
+    // split into separate paths and build blueprints.
+    const paths = splitPaths(mergeCollinearSegments(assembledCurves))
+        .filter((b) => b.length > 0)
+        .map((b) => new Blueprint(b));
+    if (paths.length === 0)
+        return null;
+    if (paths.length === 1) {
+        const single = paths[0];
+        if (single === undefined)
+            return null;
+        return single;
+    }
+    return organiseBlueprints(paths);
+}
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+function buildNoIntersectionResult(first, second) {
+    const firstCurve = first.curves[0];
+    const secondCurve = second.curves[0];
+    const firstCurveInSecond = firstCurve !== undefined && second.isInside(curveMidPoint(firstCurve));
+    const secondCurveInFirst = secondCurve !== undefined && first.isInside(curveMidPoint(secondCurve));
+    return {
+        identical: false,
+        firstCurveInSecond,
+        secondCurveInFirst,
+    };
+}
+//# sourceMappingURL=segmentAssembly.js.map

package/dist/vendored/brepjs/2d/blueprints/segmentAssembly.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"segmentAssembly.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/segmentAssembly.ts"],"names":[],"mappings":"AAAA,OAAO,GAAG,MAAM,oBAAoB,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAEhD,OAAO,EAAE,kBAAkB,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAEvF,OAAO,SAAS,MAAM,gBAAgB,CAAC;AAEvC,OAAO,EAAE,kBAAkB,EAAE,MAAM,UAAU,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAE/E,OAAO,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAE3E,8EAA8E;AAC9E,4BAA4B;AAC5B,8EAA8E;AAE9E;;;;;;;GAOG;AACH,SAAS,sBAAsB,CAAC,MAAiB;IAC/C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC;IACrC,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAErC,IAAI,OAAO,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QAED,yCAAyC;QACzC,IAAI,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC;QACjC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEd,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM;gBAAE,MAAM;YACpC,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC;gBAAE,MAAM;YAEjD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;YACtD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACzD,IAAI,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI;gBAAE,MAAM;YAEvD,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;YAC1B,CAAC,EAAE,CAAC;QACN,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;QAChE,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;QACD,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,uEAAuE;AACvE,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,MAAiB;IAC1C,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IACpD,MAAM,gBAAgB,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACxD,0EAA0E;IAC1E,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnF,MAAM,eAAe,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;SAClD,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAiB,EAAE;QACpD,IAAI,UAAU,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACpE,OAAO,SAAS,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IACxD,CAAC,CAAC;SACD,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAE1C,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,MAAM,CAAC,CAAC;IAElD,kDAAkD;IAClD,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,CAC/F,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CACzB,CAAC;IAEF,sEAAsE;IACtE,IAAI,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACzE,MAAM,kBAAkB,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAC9C,IAAI,kBAAkB,KAAK,SAAS,IAAI,kBAAkB,KAAK,CAAC,EAAE,CAAC;QACjE,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAClE,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAErB,OAAO,KAAK,CAAC;AACf,CAAC;AA4BD;;;GAGG;AACH,SAAS,iBAAiB,CACxB,YAAqB,EACrB,UAAyB,EACzB,WAA2B;IAM3B,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,MAAM,EAAE,CAAC,GAAG,YAAY,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;IACzE,CAAC;IAED,IAAI,UAAU,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;IAC7D,CAAC;IAED,qEAAqE;IACrE,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACxB,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;QACnF,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,CAAC;IACpE,CAAC;IAED,wBAAwB;IACxB,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CACrB,YAAqB,EACrB,aAAsB,EACtB,KAAgB,EAChB,MAAiB,EACjB,MAA8B,EAC9B,UAAyB,EACzB,WAA2B;IAM3B,IAAI,QAAQ,GAAY,EAAE,CAAC;IAC3B,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,sBAAsB;IACtB,MAAM,UAAU,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,MAAM,iBAAiB,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;QACpD,MAAM,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC;QACzD,IACE,CAAC,MAAM,CAAC,WAAW,KAAK,MAAM,IAAI,aAAa,CAAC;YAChD,CAAC,MAAM,CAAC,WAAW,KAAK,QAAQ,IAAI,CAAC,aAAa,CAAC,EACnD,CAAC;YACD,WAAW,IAAI,CAAC,CAAC;YACjB,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,MAAM,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IACrC,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,kBAAkB,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;QACtD,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC;QACzD,IACE,CAAC,MAAM,CAAC,YAAY,KAAK,MAAM,IAAI,aAAa,CAAC;YACjD,CAAC,MAAM,CAAC,YAAY,KAAK,QAAQ,IAAI,CAAC,aAAa,CAAC,EACpD,CAAC;YACD,IAAI,aAAa,GAAG,aAAa,CAAC;YAClC,mEAAmE;YACnE,oEAAoE;YACpE,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;gBACtB,aAAa,GAAG,cAAc,CAAC,aAAa,CAAC,CAAC;YAChD,CAAC;YACD,WAAW,IAAI,CAAC,CAAC;YACjB,QAAQ,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,sDAAsD;IACtD,IAAI,UAAU,KAAK,IAAI,IAAI,WAAW,KAAK,CAAC,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;QACrE,QAAQ,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,QAAQ,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM,aAAa,GAAG,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC;IACnE,MAAM,cAAc,GAAG,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC;IAE9D,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,CAAC;AACtF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAgB,EAChB,MAAiB,EACjB,MAA8B;IAE9B,MAAM,QAAQ,GAAG,8BAA8B,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAE/D,uDAAuD;IACvD,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,OAAO,yBAAyB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IAED,mEAAmE;IACnE,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,aAAa,KAAK,MAAM,CAAC,EAAE,CAAC;QACpE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,8DAA8D;IAC9D,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,WAAW,GAAmB,IAAI,CAAC;IAEvC,IAAI,eAAe,GAAc,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,EAAE,aAAa,CAAC,EAAE,EAAE;QAClF,IAAI,aAAa,KAAK,MAAM,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,iBAAiB,CAAC,YAAY,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;YACxE,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;YAC/B,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;YACjC,OAAO,MAAM,CAAC,MAAM,CAAC;QACvB,CAAC;QAED,MAAM,MAAM,GAAG,cAAc,CAC3B,YAAY,EACZ,aAAa,EACb,KAAK,EACL,MAAM,EACN,MAAM,EACN,UAAU,EACV,WAAW,CACZ,CAAC;QACF,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;QAC/B,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;QACjC,OAAO,MAAM,CAAC,MAAM,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,8EAA8E;IAC9E,+EAA+E;IAC/E,8EAA8E;IAC9E,+EAA+E;IAC/E,4EAA4E;IAC5E,kFAAkF;IAClF,4EAA4E;IAC5E,kFAAkF;IAClF,MAAM,gBAAgB,GAAG,WAA6B,CAAC;IACvD,MAAM,eAAe,GAAG,UAA2B,CAAC;IACpD,IAAI,gBAAgB,KAAK,IAAI,IAAI,eAAe,KAAK,CAAC,EAAE,CAAC;QACvD,eAAe,GAAG,CAAC,GAAG,gBAAgB,EAAE,GAAG,eAAe,CAAC,CAAC;IAC9D,CAAC;IAED,uEAAuE;IACvE,kDAAkD;IAClD,MAAM,KAAK,GAAG,UAAU,CAAC,sBAAsB,CAAC,eAAe,CAAC,CAAC;SAC9D,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO,kBAAkB,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,SAAS,yBAAyB,CAAC,KAAgB,EAAE,MAAiB;IACpE,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAErC,MAAM,kBAAkB,GAAG,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC;IAClG,MAAM,kBAAkB,GACtB,WAAW,KAAK,SAAS,IAAI,KAAK,CAAC,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC;IAE1E,OAAO;QACL,SAAS,EAAE,KAAK;QAChB,kBAAkB;QAClB,kBAAkB;KACnB,CAAC;AACJ,CAAC","sourcesContent":["import zip from '../../utils/zip.js';\nimport { wasmIndex } from '../../utils/vec3.js';\nimport type { Curve2D } from '../../2d/lib/index.js';\nimport { make2dSegmentCurve, crossProduct2d, subtract2d } from '../../2d/lib/index.js';\n\nimport Blueprint from './blueprint.js';\nimport type Blueprints from './blueprints.js';\nimport { organiseBlueprints } from './lib.js';\nimport { samePoint, curveMidPoint, reverseSegment } from './booleanHelpers.js';\nimport type { Segment } from './booleanHelpers.js';\nimport { blueprintsIntersectionSegments } from './intersectionSegments.js';\n\n// ---------------------------------------------------------------------------\n// Collinear segment merging\n// ---------------------------------------------------------------------------\n\n/**\n * Merge adjacent collinear line segments into single segments.\n *\n * Boolean operations can split a line at intersection points that lie on the\n * line itself (e.g. when a cut rectangle's edge is collinear with the\n * profile's edge). The extra split creates a C0 discontinuity in swept\n * surfaces. Merging eliminates unnecessary vertices.\n */\nfunction mergeCollinearSegments(curves: Curve2D[]): Curve2D[] {\n  if (curves.length < 2) return curves;\n  const result: Curve2D[] = [];\n  let i = 0;\n\n  while (i < curves.length) {\n    const current = wasmIndex(curves, i);\n\n    if (current.geomType !== 'LINE') {\n      result.push(current);\n      i++;\n      continue;\n    }\n\n    // Accumulate consecutive collinear lines\n    let endPoint = current.lastPoint;\n    let j = i + 1;\n\n    while (j < curves.length) {\n      const next = wasmIndex(curves, j);\n      if (next.geomType !== 'LINE') break;\n      if (!samePoint(endPoint, next.firstPoint)) break;\n\n      const dir1 = subtract2d(endPoint, current.firstPoint);\n      const dir2 = subtract2d(next.lastPoint, next.firstPoint);\n      if (Math.abs(crossProduct2d(dir1, dir2)) > 1e-9) break;\n\n      endPoint = next.lastPoint;\n      j++;\n    }\n\n    if (j > i + 1) {\n      result.push(make2dSegmentCurve(current.firstPoint, endPoint));\n    } else {\n      result.push(current);\n    }\n    i = j;\n  }\n\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Path splitting: detect discontinuities and split into separate loops\n// ---------------------------------------------------------------------------\n\n/**\n * Split an array of curves into separate continuous paths. A discontinuity\n * occurs where one curve's lastPoint does not match the next curve's\n * firstPoint.\n */\nexport function splitPaths(curves: Curve2D[]): Curve2D[][] {\n  const startPoints = curves.map((c) => c.firstPoint);\n  const shiftedEndPoints = curves.map((c) => c.lastPoint);\n  // Rotate endPoints so endPoints[i] is the lastPoint of the previous curve\n  const endPoints = shiftedEndPoints.slice(-1).concat(shiftedEndPoints.slice(0, -1));\n\n  const discontinuities = zip([startPoints, endPoints])\n    .map(([startPoint, endPoint], index): number | null => {\n      if (startPoint === undefined || endPoint === undefined) return null;\n      return samePoint(startPoint, endPoint) ? null : index;\n    })\n    .filter((f): f is number => f !== null);\n\n  if (discontinuities.length === 0) return [curves];\n\n  // Build paths between consecutive discontinuities\n  const paths = zip([discontinuities.slice(0, -1), discontinuities.slice(1)]).map(([start, end]) =>\n    curves.slice(start, end)\n  );\n\n  // Handle the wrap-around path (from last discontinuity back to first)\n  let lastPath = curves.slice(discontinuities[discontinuities.length - 1]);\n  const firstDiscontinuity = discontinuities[0];\n  if (firstDiscontinuity !== undefined && firstDiscontinuity !== 0) {\n    lastPath = lastPath.concat(curves.slice(0, firstDiscontinuity));\n  }\n  paths.push(lastPath);\n\n  return paths;\n}\n\n// ---------------------------------------------------------------------------\n// Boolean operation result types\n// ---------------------------------------------------------------------------\n\ninterface NoIntersectionResult {\n  readonly identical: false;\n  readonly firstCurveInSecond: boolean;\n  readonly secondCurveInFirst: boolean;\n}\n\ninterface IdenticalResult {\n  readonly identical: true;\n}\n\nexport type BooleanOperationResult =\n  Blueprint | Blueprints | null | IdenticalResult | NoIntersectionResult;\n\n// ---------------------------------------------------------------------------\n// Boolean operation core\n// ---------------------------------------------------------------------------\n\ninterface BooleanOperationConfig {\n  readonly firstInside: 'keep' | 'remove';\n  readonly secondInside: 'keep' | 'remove';\n}\n\n/**\n * Handle the case where two segments overlap (\"same\"). The decision depends\n * on how many segments are entering the current intersection node.\n */\nfunction handleSameSegment(\n  firstSegment: Segment,\n  segmentsIn: number | null,\n  lastWasSame: Segment | null\n): {\n  curves: Segment;\n  segmentsIn: number | null;\n  lastWasSame: Segment | null;\n} {\n  if (segmentsIn === 1) {\n    return { curves: [...firstSegment], segmentsIn: 1, lastWasSame: null };\n  }\n\n  if (segmentsIn === 2 || segmentsIn === 0) {\n    return { curves: [], segmentsIn: null, lastWasSame: null };\n  }\n\n  // segmentsIn === null: accumulate same-segments until we can resolve\n  if (segmentsIn === null) {\n    const accumulated = lastWasSame ? [...lastWasSame, ...firstSegment] : firstSegment;\n    return { curves: [], segmentsIn: null, lastWasSame: accumulated };\n  }\n\n  // Should not reach here\n  return { curves: [], segmentsIn, lastWasSame };\n}\n\n/**\n * Determine which non-overlapping segments to keep based on\n * inside/outside status relative to the other blueprint.\n */\nfunction selectSegments(\n  firstSegment: Segment,\n  secondSegment: Segment,\n  first: Blueprint,\n  second: Blueprint,\n  config: BooleanOperationConfig,\n  segmentsIn: number | null,\n  lastWasSame: Segment | null\n): {\n  curves: Segment;\n  segmentsIn: number | null;\n  lastWasSame: Segment | null;\n} {\n  let segments: Segment = [];\n  let segmentsOut = 0;\n\n  // Check first segment\n  const firstCurve = firstSegment[0];\n  if (firstCurve !== undefined) {\n    const firstSegmentPoint = curveMidPoint(firstCurve);\n    const firstInSecond = second.isInside(firstSegmentPoint);\n    if (\n      (config.firstInside === 'keep' && firstInSecond) ||\n      (config.firstInside === 'remove' && !firstInSecond)\n    ) {\n      segmentsOut += 1;\n      segments.push(...firstSegment);\n    }\n  }\n\n  // Check second segment\n  const secondCurve = secondSegment[0];\n  if (secondCurve !== undefined) {\n    const secondSegmentPoint = curveMidPoint(secondCurve);\n    const secondInFirst = first.isInside(secondSegmentPoint);\n    if (\n      (config.secondInside === 'keep' && secondInFirst) ||\n      (config.secondInside === 'remove' && !secondInFirst)\n    ) {\n      let segmentsToAdd = secondSegment;\n      // When there are only two segments we cannot know if we are in the\n      // same direction until here, so it is possible they are mismatched.\n      if (segmentsOut === 1) {\n        segmentsToAdd = reverseSegment(secondSegment);\n      }\n      segmentsOut += 1;\n      segments.push(...segmentsToAdd);\n    }\n  }\n\n  // When the previous node had unknown segment info and only one segment\n  // was selected, prepend the accumulated same-segments\n  if (segmentsIn === null && segmentsOut === 1 && lastWasSame !== null) {\n    segments = [...lastWasSame, ...segments];\n  }\n\n  const newSegmentsIn = segmentsOut === 1 ? segmentsOut : segmentsIn;\n  const newLastWasSame = segmentsOut === 1 ? null : lastWasSame;\n\n  return { curves: segments, segmentsIn: newSegmentsIn, lastWasSame: newLastWasSame };\n}\n\n/**\n * Core boolean operation between two simple (non-compound) blueprints.\n *\n * Segments both blueprints at their intersection points, then selects which\n * segments to keep based on the `firstInside`/`secondInside` configuration.\n */\nexport function booleanOperation(\n  first: Blueprint,\n  second: Blueprint,\n  config: BooleanOperationConfig\n): BooleanOperationResult {\n  const segments = blueprintsIntersectionSegments(first, second);\n\n  // No intersections: determine containment relationship\n  if (segments === null) {\n    return buildNoIntersectionResult(first, second);\n  }\n\n  // If all segments are identical, the blueprints are the same shape\n  if (segments.every(([, secondSegment]) => secondSegment === 'same')) {\n    return { identical: true };\n  }\n\n  // Assemble output curves by iterating through paired segments\n  let segmentsIn: number | null = null;\n  let lastWasSame: Segment | null = null;\n\n  let assembledCurves: Curve2D[] = segments.flatMap(([firstSegment, secondSegment]) => {\n    if (secondSegment === 'same') {\n      const result = handleSameSegment(firstSegment, segmentsIn, lastWasSame);\n      segmentsIn = result.segmentsIn;\n      lastWasSame = result.lastWasSame;\n      return result.curves;\n    }\n\n    const result = selectSegments(\n      firstSegment,\n      secondSegment,\n      first,\n      second,\n      config,\n      segmentsIn,\n      lastWasSame\n    );\n    segmentsIn = result.segmentsIn;\n    lastWasSame = result.lastWasSame;\n    return result.curves;\n  });\n\n  // Resolve any trailing same-segments that were accumulated but never flushed.\n  // handleSameSegment accumulates into lastWasSame only when segmentsIn is null,\n  // and clears it when segmentsIn is 1. The combined state (lastWasSame != null\n  // AND segmentsIn == 1) occurs when: trailing 'same' segments accumulate at the\n  // end of the sequence, then a non-same segment resolves segmentsIn to 1 but\n  // the loop ends before the accumulated curves can be prepended by selectSegments.\n  // Note: segmentsIn and lastWasSame are mutated inside the flatMap callback;\n  // TypeScript narrows them to their initial values, so we cast to the actual type.\n  const finalLastWasSame = lastWasSame as Segment | null;\n  const finalSegmentsIn = segmentsIn as number | null;\n  if (finalLastWasSame !== null && finalSegmentsIn === 1) {\n    assembledCurves = [...finalLastWasSame, ...assembledCurves];\n  }\n\n  // Merge collinear lines created by splits at intersection points, then\n  // split into separate paths and build blueprints.\n  const paths = splitPaths(mergeCollinearSegments(assembledCurves))\n    .filter((b) => b.length > 0)\n    .map((b) => new Blueprint(b));\n\n  if (paths.length === 0) return null;\n  if (paths.length === 1) {\n    const single = paths[0];\n    if (single === undefined) return null;\n    return single;\n  }\n\n  return organiseBlueprints(paths);\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction buildNoIntersectionResult(first: Blueprint, second: Blueprint): NoIntersectionResult {\n  const firstCurve = first.curves[0];\n  const secondCurve = second.curves[0];\n\n  const firstCurveInSecond = firstCurve !== undefined && second.isInside(curveMidPoint(firstCurve));\n  const secondCurveInFirst =\n    secondCurve !== undefined && first.isInside(curveMidPoint(secondCurve));\n\n  return {\n    identical: false,\n    firstCurveInSecond,\n    secondCurveInFirst,\n  };\n}\n"]}

package/dist/vendored/brepjs/2d/blueprints/svg.d.ts

@@ -0,0 +1,22 @@
+import type { BoundingBox2d } from '../../2d/lib/index.js';
+/**
+ * Compute an SVG `viewBox` attribute string from a 2D bounding box.
+ *
+ * The Y axis is flipped (negated) to match SVG's top-left-origin convention.
+ *
+ * @param bbox - Source bounding box.
+ * @param margin - Extra padding in drawing units on each side.
+ */
+export declare const viewbox: (bbox: BoundingBox2d, margin?: number) => string;
+/**
+ * Wrap an SVG body string in a complete `<svg>` document element.
+ *
+ * Sets sensible defaults: no fill, black stroke at 0.6% width, and
+ * `vector-effect="non-scaling-stroke"`.
+ *
+ * @param body - SVG element markup to embed (e.g., `<path>` or `<g>`).
+ * @param boundingBox - Bounding box used to derive the `viewBox`.
+ * @param margin - Extra padding around the bounding box.
+ */
+export declare const asSVG: (body: string, boundingBox: BoundingBox2d, margin?: number) => string;
+//# sourceMappingURL=svg.d.ts.map

package/dist/vendored/brepjs/2d/blueprints/svg.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"svg.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/svg.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE3D;;;;;;;GAOG;AACH,eAAO,MAAM,OAAO,GAAI,MAAM,aAAa,EAAE,eAAU,WAKtD,CAAC;AAEF;;;;;;;;;GASG;AACH,eAAO,MAAM,KAAK,GAAI,MAAM,MAAM,EAAE,aAAa,aAAa,EAAE,eAAU,WAKzE,CAAC"}

package/dist/vendored/brepjs/2d/blueprints/svg.js

@@ -0,0 +1,30 @@
+/**
+ * Compute an SVG `viewBox` attribute string from a 2D bounding box.
+ *
+ * The Y axis is flipped (negated) to match SVG's top-left-origin convention.
+ *
+ * @param bbox - Source bounding box.
+ * @param margin - Extra padding in drawing units on each side.
+ */
+export const viewbox = (bbox, margin = 1) => {
+    const minX = bbox.bounds[0][0] - margin;
+    const minY = -bbox.bounds[1][1] - margin;
+    return `${minX} ${minY} ${bbox.width + 2 * margin} ${bbox.height + 2 * margin}`;
+};
+/**
+ * Wrap an SVG body string in a complete `<svg>` document element.
+ *
+ * Sets sensible defaults: no fill, black stroke at 0.6% width, and
+ * `vector-effect="non-scaling-stroke"`.
+ *
+ * @param body - SVG element markup to embed (e.g., `<path>` or `<g>`).
+ * @param boundingBox - Bounding box used to derive the `viewBox`.
+ * @param margin - Extra padding around the bounding box.
+ */
+export const asSVG = (body, boundingBox, margin = 1) => {
+    const vbox = viewbox(boundingBox, margin);
+    return `<svg version="1.1" xmlns="http://www.w3.org/2000/svg" viewBox="${vbox}" fill="none" stroke="black" stroke-width="0.6%" vector-effect="non-scaling-stroke">
+    ${body}
+</svg>`;
+};
+//# sourceMappingURL=svg.js.map

package/dist/vendored/brepjs/2d/blueprints/svg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"svg.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/blueprints/svg.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAmB,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE;IACzD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IACxC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IAEzC,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC;AAClF,CAAC,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,WAA0B,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE;IAC5E,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAC1C,OAAO,kEAAkE,IAAI;MACzE,IAAI;OACH,CAAC;AACR,CAAC,CAAC","sourcesContent":["import type { BoundingBox2d } from '../../2d/lib/index.js';\n\n/**\n * Compute an SVG `viewBox` attribute string from a 2D bounding box.\n *\n * The Y axis is flipped (negated) to match SVG's top-left-origin convention.\n *\n * @param bbox - Source bounding box.\n * @param margin - Extra padding in drawing units on each side.\n */\nexport const viewbox = (bbox: BoundingBox2d, margin = 1) => {\n  const minX = bbox.bounds[0][0] - margin;\n  const minY = -bbox.bounds[1][1] - margin;\n\n  return `${minX} ${minY} ${bbox.width + 2 * margin} ${bbox.height + 2 * margin}`;\n};\n\n/**\n * Wrap an SVG body string in a complete `<svg>` document element.\n *\n * Sets sensible defaults: no fill, black stroke at 0.6% width, and\n * `vector-effect=\"non-scaling-stroke\"`.\n *\n * @param body - SVG element markup to embed (e.g., `<path>` or `<g>`).\n * @param boundingBox - Bounding box used to derive the `viewBox`.\n * @param margin - Extra padding around the bounding box.\n */\nexport const asSVG = (body: string, boundingBox: BoundingBox2d, margin = 1) => {\n  const vbox = viewbox(boundingBox, margin);\n  return `<svg version=\"1.1\" xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"${vbox}\" fill=\"none\" stroke=\"black\" stroke-width=\"0.6%\" vector-effect=\"non-scaling-stroke\">\n    ${body}\n</svg>`;\n};\n"]}

package/dist/vendored/brepjs/2d/curve2dGeometryFns.d.ts

@@ -0,0 +1,124 @@
+/**
+ * Public functional API for 2D curve geometry.
+ *
+ * Wraps {@link Kernel2DCapability} methods with branded {@link Curve2DHandle}
+ * types, `Result<T>` error handling, and `Disposable` support.
+ *
+ * All functions call `getKernel2D()` internally — the kernel must be
+ * initialised before use.
+ *
+ * @module
+ */
+import type { Curve2DHandle } from '../core/curve2dHandle.js';
+import type { Point2D } from '../2d/lib/definitions.js';
+import type { Plane } from '../core/planeTypes.js';
+import type { Edge, Face } from '../core/shapeTypes.js';
+import { type Result } from '../core/result.js';
+/** Create a 2D line segment between two points. */
+export declare function line2d(from: Point2D, to: Point2D): Result<Curve2DHandle>;
+/** Create a full 2D circle. */
+export declare function circle2d(center: Point2D, radius: number, sense?: boolean): Result<Curve2DHandle>;
+/** Create a 2D arc through three points. */
+export declare function arc2d(p1: Point2D, mid: Point2D, p2: Point2D): Result<Curve2DHandle>;
+/** Create a 2D arc from a start point, tangent direction, and end point. */
+export declare function arc2dTangent(start: Point2D, tangent: Point2D, end: Point2D): Result<Curve2DHandle>;
+/** Options for ellipse construction. */
+export interface Ellipse2dOptions {
+    /** X-axis direction for the major axis (default: [1, 0]). */
+    readonly xDir?: Point2D;
+    /** Orientation sense (default: true = counter-clockwise). */
+    readonly sense?: boolean;
+}
+/** Create a full 2D ellipse. */
+export declare function ellipse2d(center: Point2D, majorRadius: number, minorRadius: number, options?: Ellipse2dOptions): Result<Curve2DHandle>;
+/** Create a 2D elliptical arc. */
+export declare function ellipseArc2d(center: Point2D, majorRadius: number, minorRadius: number, startAngle: number, endAngle: number, options?: Ellipse2dOptions): Result<Curve2DHandle>;
+/** Create a 2D Bezier curve through control points. */
+export declare function bezier2d(points: Point2D[]): Result<Curve2DHandle>;
+/** Options for B-spline construction. */
+export interface BSpline2dOptions {
+    readonly degMin?: number;
+    readonly degMax?: number;
+    readonly continuity?: 'C0' | 'C1' | 'C2' | 'C3';
+    readonly tolerance?: number;
+    readonly smoothing?: [number, number, number] | null;
+}
+/** Create a 2D B-spline curve interpolating through points. */
+export declare function bspline2d(points: Point2D[], options?: BSpline2dOptions): Result<Curve2DHandle>;
+/** Translate a 2D curve by (dx, dy). Returns a new curve. */
+export declare function translateCurve2d(curve: Curve2DHandle, dx: number, dy: number): Result<Curve2DHandle>;
+/** Rotate a 2D curve by an angle (radians) around a center point. Returns a new curve. */
+export declare function rotateCurve2d(curve: Curve2DHandle, angle: number, center?: Point2D): Result<Curve2DHandle>;
+/** Scale a 2D curve by a factor around a center point. Returns a new curve. */
+export declare function scaleCurve2d(curve: Curve2DHandle, factor: number, center?: Point2D): Result<Curve2DHandle>;
+/** Mirror a 2D curve across a point. Returns a new curve. */
+export declare function mirrorCurve2d(curve: Curve2DHandle, point: Point2D): Result<Curve2DHandle>;
+/** Mirror a 2D curve across an axis defined by origin and direction. Returns a new curve. */
+export declare function mirrorCurve2dAcrossAxis(curve: Curve2DHandle, origin: Point2D, direction: Point2D): Result<Curve2DHandle>;
+/** Offset a 2D curve by a distance. Returns a new curve. */
+export declare function offsetCurve2d(curve: Curve2DHandle, distance: number): Result<Curve2DHandle>;
+/** Evaluate a point on a 2D curve at a parameter value. */
+export declare function evaluateCurve2d(curve: Curve2DHandle, param: number): Result<Point2D>;
+/** Evaluate point and tangent on a 2D curve at a parameter value. */
+export declare function tangentCurve2d(curve: Curve2DHandle, param: number): Result<{
+    point: Point2D;
+    tangent: Point2D;
+}>;
+/** Get the parameter bounds of a 2D curve. */
+export declare function boundsCurve2d(curve: Curve2DHandle): Result<{
+    first: number;
+    last: number;
+}>;
+/** Get the geometric type of a 2D curve (e.g., "Line", "Circle", "BSpline"). */
+export declare function typeCurve2d(curve: Curve2DHandle): Result<string>;
+/**
+ * Find intersection points and overlap segments between two 2D curves.
+ *
+ * Returned `segments` are individually disposable — callers must dispose
+ * each element when done.
+ *
+ * @param tolerance - Intersection tolerance (default: `1e-7`).
+ */
+export declare function intersectCurves2d(c1: Curve2DHandle, c2: Curve2DHandle, tolerance?: number): Result<{
+    points: Point2D[];
+    segments: Curve2DHandle[];
+}>;
+/**
+ * Project a point onto a 2D curve, finding the closest parameter.
+ *
+ * Returns `ok(null)` when no projection exists (valid geometric outcome),
+ * not an error. Only kernel failures produce `err()`.
+ */
+export declare function projectPointOnCurve2d(curve: Curve2DHandle, point: Point2D): Result<{
+    param: number;
+    distance: number;
+} | null>;
+/**
+ * Compute the minimum distance between two 2D curves.
+ *
+ * @param bounds1 - Optional parameter range for c1 (default: full curve bounds).
+ * @param bounds2 - Optional parameter range for c2 (default: full curve bounds).
+ */
+export declare function distanceBetweenCurves2d(c1: Curve2DHandle, c2: Curve2DHandle, bounds1?: {
+    first: number;
+    last: number;
+}, bounds2?: {
+    first: number;
+    last: number;
+}): Result<number>;
+/**
+ * Lift a 2D curve onto a 3D plane, producing a 3D edge.
+ *
+ * Decomposes the `Plane` into kernel arguments:
+ * `plane.origin` → `planeOrigin`, `plane.zDir` → `planeZ`, `plane.xDir` → `planeX`.
+ */
+export declare function liftCurve2dToPlane(curve: Curve2DHandle, plane: Plane): Result<Edge>;
+/** Extract the 2D parametric curve of a 3D edge on a face. */
+export declare function extractCurve2dFromEdge(edge: Edge, face: Face): Result<Curve2DHandle>;
+/** Trim a 2D curve to a sub-range of its parameter domain. */
+export declare function trimCurve2d(curve: Curve2DHandle, start: number, end: number): Result<Curve2DHandle>;
+/** Create an independent deep copy of a 2D curve. */
+export declare function copyCurve2d(curve: Curve2DHandle): Result<Curve2DHandle>;
+/** Split a 2D curve at the given parameter values. */
+export declare function splitCurve2d(curve: Curve2DHandle, params: number[]): Result<Curve2DHandle[]>;
+//# sourceMappingURL=curve2dGeometryFns.d.ts.map

package/dist/vendored/brepjs/2d/curve2dGeometryFns.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"curve2dGeometryFns.d.ts","sourceRoot":"","sources":["../../../../src/vendored/brepjs/2d/curve2dGeometryFns.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAE9D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACxD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,EAAE,KAAK,MAAM,EAAW,MAAM,mBAAmB,CAAC;AA4DzD,mDAAmD;AACnD,wBAAgB,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,GAAG,MAAM,CAAC,aAAa,CAAC,CAMxE;AAED,+BAA+B;AAC/B,wBAAgB,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC,aAAa,CAAC,CAWhG;AAED,4CAA4C;AAC5C,wBAAgB,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,GAAG,MAAM,CAAC,aAAa,CAAC,CAMnF;AAED,4EAA4E;AAC5E,wBAAgB,YAAY,CAC1B,KAAK,EAAE,OAAO,EACd,OAAO,EAAE,OAAO,EAChB,GAAG,EAAE,OAAO,GACX,MAAM,CAAC,aAAa,CAAC,CAOvB;AAED,wCAAwC;AACxC,MAAM,WAAW,gBAAgB;IAC/B,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC;IACxB,6DAA6D;IAC7D,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED,gCAAgC;AAChC,wBAAgB,SAAS,CACvB,MAAM,EAAE,OAAO,EACf,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,MAAM,EACnB,OAAO,CAAC,EAAE,gBAAgB,GACzB,MAAM,CAAC,aAAa,CAAC,CAiBvB;AAED,kCAAkC;AAClC,wBAAgB,YAAY,CAC1B,MAAM,EAAE,OAAO,EACf,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,MAAM,EACnB,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,gBAAgB,GACzB,MAAM,CAAC,aAAa,CAAC,CAmBvB;AAED,uDAAuD;AACvD,wBAAgB,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC,aAAa,CAAC,CAcjE;AAED,yCAAyC;AACzC,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,UAAU,CAAC,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;IAChD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;CACtD;AAED,+DAA+D;AAC/D,wBAAgB,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,gBAAgB,GAAG,MAAM,CAAC,aAAa,CAAC,CAc9F;AAMD,6DAA6D;AAC7D,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,aAAa,EACpB,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,GACT,MAAM,CAAC,aAAa,CAAC,CAMvB;AAED,0FAA0F;AAC1F,wBAAgB,aAAa,CAC3B,KAAK,EAAE,aAAa,EACpB,KAAK,EAAE,MAAM,EACb,MAAM,GAAE,OAAgB,GACvB,MAAM,CAAC,aAAa,CAAC,CAMvB;AAED,+EAA+E;AAC/E,wBAAgB,YAAY,CAC1B,KAAK,EAAE,aAAa,EACpB,MAAM,EAAE,MAAM,EACd,MAAM,GAAE,OAAgB,GACvB,MAAM,CAAC,aAAa,CAAC,CAMvB;AAED,6DAA6D;AAC7D,wBAAgB,aAAa,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAAC,aAAa,CAAC,CAMzF;AAED,6FAA6F;AAC7F,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,aAAa,EACpB,MAAM,EAAE,OAAO,EACf,SAAS,EAAE,OAAO,GACjB,MAAM,CAAC,aAAa,CAAC,CAavB;AAED,4DAA4D;AAC5D,wBAAgB,aAAa,CAAC,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,CAM3F;AAMD,2DAA2D;AAC3D,wBAAgB,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAMpF;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAC5B,KAAK,EAAE,aAAa,EACpB,KAAK,EAAE,MAAM,GACZ,MAAM,CAAC;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAAC,CAM9C;AAED,8CAA8C;AAC9C,wBAAgB,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,CAAC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,CAM3F;AAED,gFAAgF;AAChF,wBAAgB,WAAW,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAMhE;AAMD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,EAAE,EAAE,aAAa,EACjB,EAAE,EAAE,aAAa,EACjB,SAAS,SAAO,GACf,MAAM,CAAC;IAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IAAC,QAAQ,EAAE,aAAa,EAAE,CAAA;CAAE,CAAC,CAqB1D;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,aAAa,EACpB,KAAK,EAAE,OAAO,GACb,MAAM,CAAC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAAC,CAMpD;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,EAAE,EAAE,aAAa,EACjB,EAAE,EAAE,aAAa,EACjB,OAAO,CAAC,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,EACzC,OAAO,CAAC,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACxC,MAAM,CAAC,MAAM,CAAC,CAWhB;AAMD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAcnF;AAED,8DAA8D;AAC9D,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC,aAAa,CAAC,CAMpF;AAMD,8DAA8D;AAC9D,wBAAgB,WAAW,CACzB,KAAK,EAAE,aAAa,EACpB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,GACV,MAAM,CAAC,aAAa,CAAC,CAMvB;AAED,qDAAqD;AACrD,wBAAgB,WAAW,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC,CAMvE;AAED,sDAAsD;AACtD,wBAAgB,YAAY,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC,CAS5F"}