@faicad/faijs 0.13.0

package/dist/vendored/brepjs/2d/lib/intersections.d.ts

@@ -0,0 +1,34 @@
+import { Curve2D } from './curve2D.js';
+import type { Point2D } from './definitions.js';
+import { type Result } from '../../core/result.js';
+interface IntersectionResult {
+    intersections: Point2D[];
+    commonSegments: Curve2D[];
+    commonSegmentsPoints: Point2D[];
+}
+/**
+ * Compute intersection points and common segments between two 2D curves.
+ *
+ * Uses an early bounding-box rejection test before delegating to the kernel
+ * `Geom2dAPI_InterCurveCurve` algorithm.
+ *
+ * @returns `Ok` with intersection points, common segments, and the endpoints of those segments;
+ *   or an error result when the kernel intersector fails.
+ *
+ * @example
+ * ```ts
+ * const result = intersectCurves(circle, line);
+ * if (isOk(result)) {
+ *   console.log(result.value.intersections); // Point2D[]
+ * }
+ * ```
+ */
+export declare const intersectCurves: (first: Curve2D, second: Curve2D, precision?: number) => Result<IntersectionResult>;
+/**
+ * Find self-intersection points on a single 2D curve.
+ *
+ * @returns `Ok` with the array of self-intersection points, or an error result on failure.
+ */
+export declare const selfIntersections: (curve: Curve2D, precision?: number) => Result<Point2D[]>;
+export {};
+//# sourceMappingURL=intersections.d.ts.map

package/dist/vendored/brepjs/2d/lib/intersections.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersections.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/intersections.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAEhD,OAAO,EAAE,KAAK,MAAM,EAAW,MAAM,sBAAsB,CAAC;AAG5D,UAAU,kBAAkB;IAC1B,aAAa,EAAE,OAAO,EAAE,CAAC;IACzB,cAAc,EAAE,OAAO,EAAE,CAAC;IAC1B,oBAAoB,EAAE,OAAO,EAAE,CAAC;CACjC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,eAAe,GAC1B,OAAO,OAAO,EACd,QAAQ,OAAO,EACf,kBAAgB,KACf,MAAM,CAAC,kBAAkB,CAsC3B,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,GAAI,OAAO,OAAO,EAAE,kBAAgB,KAAG,MAAM,CAAC,OAAO,EAAE,CAiBpF,CAAC"}

package/dist/vendored/brepjs/2d/lib/intersections.js

@@ -0,0 +1,77 @@
+import { getKernel2D } from '../../kernel/index.js';
+import { Curve2D } from './curve2D.js';
+import { samePoint } from './vectorOperations.js';
+import { ok, err } from '../../core/result.js';
+import { computationError } from '../../core/errors.js';
+/**
+ * Compute intersection points and common segments between two 2D curves.
+ *
+ * Uses an early bounding-box rejection test before delegating to the kernel
+ * `Geom2dAPI_InterCurveCurve` algorithm.
+ *
+ * @returns `Ok` with intersection points, common segments, and the endpoints of those segments;
+ *   or an error result when the kernel intersector fails.
+ *
+ * @example
+ * ```ts
+ * const result = intersectCurves(circle, line);
+ * if (isOk(result)) {
+ *   console.log(result.value.intersections); // Point2D[]
+ * }
+ * ```
+ */
+export const intersectCurves = (first, second, precision = 1e-9) => {
+    if (first.boundingBox.isOut(second.boundingBox))
+        return ok({ intersections: [], commonSegments: [], commonSegmentsPoints: [] });
+    const kernel = getKernel2D();
+    let intersections;
+    let commonSegments;
+    try {
+        const result = kernel.intersectCurves2d(first.wrapped, second.wrapped, precision);
+        intersections = result.points;
+        commonSegments = result.segments.map((h) => new Curve2D(h));
+    }
+    catch (e) {
+        return err(computationError('INTERSECTION_FAILED', 'Intersections failed between curves', e));
+    }
+    // Coincident endpoints alone do not make a common segment degenerate: a
+    // closed overlap — two identical circles share their whole outline — starts
+    // and ends at the same point while spanning the entire curve. Demoting on
+    // the endpoints alone discards that overlap before any boolean sees it, so
+    // require the midpoint to sit on the endpoints too.
+    const isDegenerate = (c) => {
+        if (!samePoint(c.firstPoint, c.lastPoint, precision))
+            return false;
+        const mid = c.value((c.firstParameter + c.lastParameter) / 2);
+        return samePoint(mid, c.firstPoint, precision);
+    };
+    const segmentsAsPoints = commonSegments.filter(isDegenerate).map((c) => c.firstPoint);
+    if (segmentsAsPoints.length) {
+        intersections.push(...segmentsAsPoints);
+        commonSegments = commonSegments.filter((c) => !isDegenerate(c));
+    }
+    const commonSegmentsPoints = commonSegments.flatMap((c) => [c.firstPoint, c.lastPoint]);
+    return ok({ intersections, commonSegments, commonSegmentsPoints });
+};
+/**
+ * Find self-intersection points on a single 2D curve.
+ *
+ * @returns `Ok` with the array of self-intersection points, or an error result on failure.
+ */
+export const selfIntersections = (curve, precision = 1e-9) => {
+    const kernel = getKernel2D();
+    let intersections;
+    try {
+        const result = kernel.intersectCurves2d(curve.wrapped, curve.wrapped, precision);
+        intersections = result.points;
+        // Clean up segment handles we don't need
+        for (const seg of result.segments) {
+            seg.delete();
+        }
+    }
+    catch (e) {
+        return err(computationError('SELF_INTERSECTION_FAILED', 'Self intersection failed', e));
+    }
+    return ok(intersections);
+};
+//# sourceMappingURL=intersections.js.map

package/dist/vendored/brepjs/2d/lib/intersections.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intersections.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/intersections.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAQxD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,KAAc,EACd,MAAe,EACf,SAAS,GAAG,IAAI,EACY,EAAE;IAC9B,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC;QAC7C,OAAO,EAAE,CAAC,EAAE,aAAa,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,oBAAoB,EAAE,EAAE,EAAE,CAAC,CAAC;IAEjF,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;IAE7B,IAAI,aAAwB,CAAC;IAC7B,IAAI,cAAyB,CAAC;IAE9B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAClF,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC;QAC9B,cAAc,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,GAAG,CAAC,gBAAgB,CAAC,qBAAqB,EAAE,qCAAqC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IAED,wEAAwE;IACxE,4EAA4E;IAC5E,0EAA0E;IAC1E,2EAA2E;IAC3E,oDAAoD;IACpD,MAAM,YAAY,GAAG,CAAC,CAAU,EAAW,EAAE;QAC3C,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC;QACnE,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACjD,CAAC,CAAC;IAEF,MAAM,gBAAgB,GAAG,cAAc,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAEtF,IAAI,gBAAgB,CAAC,MAAM,EAAE,CAAC;QAC5B,aAAa,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC;QACxC,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,MAAM,oBAAoB,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAExF,OAAO,EAAE,CAAC,EAAE,aAAa,EAAE,cAAc,EAAE,oBAAoB,EAAE,CAAC,CAAC;AACrE,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,KAAc,EAAE,SAAS,GAAG,IAAI,EAAqB,EAAE;IACvF,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;IAE7B,IAAI,aAAwB,CAAC;IAE7B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACjF,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC;QAC9B,yCAAyC;QACzC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YAClC,GAAG,CAAC,MAAM,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,GAAG,CAAC,gBAAgB,CAAC,0BAA0B,EAAE,0BAA0B,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1F,CAAC;IAED,OAAO,EAAE,CAAC,aAAa,CAAC,CAAC;AAC3B,CAAC,CAAC","sourcesContent":["import { getKernel2D } from '../../kernel/index.js';\nimport { Curve2D } from './curve2D.js';\nimport type { Point2D } from './definitions.js';\nimport { samePoint } from './vectorOperations.js';\nimport { type Result, ok, err } from '../../core/result.js';\nimport { computationError } from '../../core/errors.js';\n\ninterface IntersectionResult {\n  intersections: Point2D[];\n  commonSegments: Curve2D[];\n  commonSegmentsPoints: Point2D[];\n}\n\n/**\n * Compute intersection points and common segments between two 2D curves.\n *\n * Uses an early bounding-box rejection test before delegating to the kernel\n * `Geom2dAPI_InterCurveCurve` algorithm.\n *\n * @returns `Ok` with intersection points, common segments, and the endpoints of those segments;\n *   or an error result when the kernel intersector fails.\n *\n * @example\n * ```ts\n * const result = intersectCurves(circle, line);\n * if (isOk(result)) {\n *   console.log(result.value.intersections); // Point2D[]\n * }\n * ```\n */\nexport const intersectCurves = (\n  first: Curve2D,\n  second: Curve2D,\n  precision = 1e-9\n): Result<IntersectionResult> => {\n  if (first.boundingBox.isOut(second.boundingBox))\n    return ok({ intersections: [], commonSegments: [], commonSegmentsPoints: [] });\n\n  const kernel = getKernel2D();\n\n  let intersections: Point2D[];\n  let commonSegments: Curve2D[];\n\n  try {\n    const result = kernel.intersectCurves2d(first.wrapped, second.wrapped, precision);\n    intersections = result.points;\n    commonSegments = result.segments.map((h) => new Curve2D(h));\n  } catch (e) {\n    return err(computationError('INTERSECTION_FAILED', 'Intersections failed between curves', e));\n  }\n\n  // Coincident endpoints alone do not make a common segment degenerate: a\n  // closed overlap — two identical circles share their whole outline — starts\n  // and ends at the same point while spanning the entire curve. Demoting on\n  // the endpoints alone discards that overlap before any boolean sees it, so\n  // require the midpoint to sit on the endpoints too.\n  const isDegenerate = (c: Curve2D): boolean => {\n    if (!samePoint(c.firstPoint, c.lastPoint, precision)) return false;\n    const mid = c.value((c.firstParameter + c.lastParameter) / 2);\n    return samePoint(mid, c.firstPoint, precision);\n  };\n\n  const segmentsAsPoints = commonSegments.filter(isDegenerate).map((c) => c.firstPoint);\n\n  if (segmentsAsPoints.length) {\n    intersections.push(...segmentsAsPoints);\n    commonSegments = commonSegments.filter((c) => !isDegenerate(c));\n  }\n\n  const commonSegmentsPoints = commonSegments.flatMap((c) => [c.firstPoint, c.lastPoint]);\n\n  return ok({ intersections, commonSegments, commonSegmentsPoints });\n};\n\n/**\n * Find self-intersection points on a single 2D curve.\n *\n * @returns `Ok` with the array of self-intersection points, or an error result on failure.\n */\nexport const selfIntersections = (curve: Curve2D, precision = 1e-9): Result<Point2D[]> => {\n  const kernel = getKernel2D();\n\n  let intersections: Point2D[];\n\n  try {\n    const result = kernel.intersectCurves2d(curve.wrapped, curve.wrapped, precision);\n    intersections = result.points;\n    // Clean up segment handles we don't need\n    for (const seg of result.segments) {\n      seg.delete();\n    }\n  } catch (e) {\n    return err(computationError('SELF_INTERSECTION_FAILED', 'Self intersection failed', e));\n  }\n\n  return ok(intersections);\n};\n"]}

package/dist/vendored/brepjs/2d/lib/makeCurves.d.ts

@@ -0,0 +1,63 @@
+import { type Result } from '../../core/result.js';
+import type { Point2D } from './definitions.js';
+import { Curve2D } from './curve2D.js';
+/**
+ * Creates a 2D segment curve between two points.
+ *
+ * @category Planar curves
+ */
+export declare const make2dSegmentCurve: (startPoint: Point2D, endPoint: Point2D) => Curve2D;
+/**
+ * Creates a 2D arc curve defined by three points.
+ *
+ * @category Planar curves
+ */
+export declare const make2dThreePointArc: (startPoint: Point2D, midPoint: Point2D, endPoint: Point2D) => Curve2D;
+/**
+ * Creates a 2D tangent arc curve.
+ *
+ * @category Planar curves
+ */
+export declare const make2dTangentArc: (startPoint: Point2D, tangent: Point2D, endPoint: Point2D) => Curve2D;
+/**
+ * Creates a 2D circle curve.
+ *
+ * @category Planar curves
+ */
+export declare const make2dCircle: (radius: number, center?: Point2D) => Curve2D;
+/**
+ * Creates a 2D ellipse curve.
+ *
+ * @category Planar curves
+ */
+export declare const make2dEllipse: (majorRadius: number, minorRadius: number, xDir?: Point2D, center?: Point2D, direct?: boolean) => Curve2D;
+/**
+ * Creates a 2D ellipse arc curve.
+ *
+ * @category Planar curves
+ */
+export declare const make2dEllipseArc: (majorRadius: number, minorRadius: number, startAngle: number, endAngle: number, center: Point2D | undefined, xDir: Point2D, direct?: boolean) => Curve2D;
+/**
+ * Creates a 2D Bezier curve defined by a start point, control points, and an end point.
+ *
+ * @category Planar curves
+ */
+export declare const make2dBezierCurve: (startPoint: Point2D, controls: Point2D[], endPoint: Point2D) => Curve2D;
+/**
+ * Create a 2D interpolated B-spline curve through the given points.
+ *
+ * @category Planar curves
+ */
+export declare function make2dInerpolatedBSplineCurve(points: Point2D[], { tolerance, smoothing, degMax, degMin, }?: {
+    tolerance?: number;
+    smoothing?: null | [number, number, number];
+    degMax?: number;
+    degMin?: number;
+}): Result<Curve2D>;
+/**
+ * Create a 2D arc given its endpoints and center point.
+ *
+ * @category Planar curves
+ */
+export declare const make2dArcFromCenter: (startPoint: Point2D, endPoint: Point2D, center: Point2D, longArc?: boolean) => Curve2D;
+//# sourceMappingURL=makeCurves.d.ts.map

package/dist/vendored/brepjs/2d/lib/makeCurves.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"makeCurves.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/makeCurves.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,MAAM,EAAW,MAAM,sBAAsB,CAAC;AAG5D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAEhD,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAUvC;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,GAAI,YAAY,OAAO,EAAE,UAAU,OAAO,KAAG,OAQ3E,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,GAC9B,YAAY,OAAO,EACnB,UAAU,OAAO,EACjB,UAAU,OAAO,KAChB,OAoBF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,GAC3B,YAAY,OAAO,EACnB,SAAS,OAAO,EAChB,UAAU,OAAO,KAChB,OAoBF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,YAAY,GAAI,QAAQ,MAAM,EAAE,SAAQ,OAAgB,KAAG,OAEvE,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,aAAa,GACxB,aAAa,MAAM,EACnB,aAAa,MAAM,EACnB,OAAM,OAAgB,EACtB,SAAQ,OAAgB,EACxB,gBAAa,KACZ,OAYF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,GAC3B,aAAa,MAAM,EACnB,aAAa,MAAM,EACnB,YAAY,MAAM,EAClB,UAAU,MAAM,EAChB,QAAQ,OAAO,YAAS,EACxB,MAAM,OAAO,EACb,gBAAa,KACZ,OAcF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,GAC5B,YAAY,OAAO,EACnB,UAAU,OAAO,EAAE,EACnB,UAAU,OAAO,KAChB,OAOF,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,6BAA6B,CAC3C,MAAM,EAAE,OAAO,EAAE,EACjB,EACE,SAAgB,EAChB,SAAgB,EAChB,MAAU,EACV,MAAU,GACX,GAAE;IACD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACZ,GACL,MAAM,CAAC,OAAO,CAAC,CAcjB;AAED;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,GAC9B,YAAY,OAAO,EACnB,UAAU,OAAO,EACjB,QAAQ,OAAO,EACf,iBAAe,YAWhB,CAAC"}

package/dist/vendored/brepjs/2d/lib/makeCurves.js

@@ -0,0 +1,117 @@
+import { getKernel } from '../../kernel/index.js';
+import { ok, err } from '../../core/result.js';
+import { computationError } from '../../core/errors.js';
+import { Curve2D } from './curve2D.js';
+import { add2d, distance2d, normalize2d, samePoint, scalarMultiply2d, subtract2d, } from './vectorOperations.js';
+/**
+ * Creates a 2D segment curve between two points.
+ *
+ * @category Planar curves
+ */
+export const make2dSegmentCurve = (startPoint, endPoint) => {
+    const curve = new Curve2D(getKernel().makeLine2d(startPoint[0], startPoint[1], endPoint[0], endPoint[1]));
+    if (!samePoint(curve.firstPoint, startPoint)) {
+        curve.reverse();
+    }
+    return curve;
+};
+/**
+ * Creates a 2D arc curve defined by three points.
+ *
+ * @category Planar curves
+ */
+export const make2dThreePointArc = (startPoint, midPoint, endPoint) => {
+    const handle = getKernel().makeArc2dThreePoints(startPoint[0], startPoint[1], midPoint[0], midPoint[1], endPoint[0], endPoint[1]);
+    let curve = new Curve2D(handle);
+    if (!samePoint(curve.firstPoint, startPoint)) {
+        const trimmed = getKernel().trimCurve2d(curve.wrapped, curve.lastParameter, curve.firstParameter);
+        curve.delete();
+        curve = new Curve2D(trimmed);
+    }
+    return curve;
+};
+/**
+ * Creates a 2D tangent arc curve.
+ *
+ * @category Planar curves
+ */
+export const make2dTangentArc = (startPoint, tangent, endPoint) => {
+    const handle = getKernel().makeArc2dTangent(startPoint[0], startPoint[1], tangent[0], tangent[1], endPoint[0], endPoint[1]);
+    let curve = new Curve2D(handle);
+    if (!samePoint(curve.firstPoint, startPoint)) {
+        const trimmed = getKernel().trimCurve2d(curve.wrapped, curve.lastParameter, curve.firstParameter);
+        curve.delete();
+        curve = new Curve2D(trimmed);
+    }
+    return curve;
+};
+/**
+ * Creates a 2D circle curve.
+ *
+ * @category Planar curves
+ */
+export const make2dCircle = (radius, center = [0, 0]) => {
+    return new Curve2D(getKernel().makeCircle2d(center[0], center[1], radius, true));
+};
+/**
+ * Creates a 2D ellipse curve.
+ *
+ * @category Planar curves
+ */
+export const make2dEllipse = (majorRadius, minorRadius, xDir = [1, 0], center = [0, 0], direct = true) => {
+    return new Curve2D(getKernel().makeEllipse2d(center[0], center[1], majorRadius, minorRadius, xDir[0], xDir[1], direct));
+};
+/**
+ * Creates a 2D ellipse arc curve.
+ *
+ * @category Planar curves
+ */
+export const make2dEllipseArc = (majorRadius, minorRadius, startAngle, endAngle, center = [0, 0], xDir, direct = true) => {
+    return new Curve2D(getKernel().makeEllipseArc2d(center[0], center[1], majorRadius, minorRadius, startAngle, endAngle, xDir[0], xDir[1], direct));
+};
+/**
+ * Creates a 2D Bezier curve defined by a start point, control points, and an end point.
+ *
+ * @category Planar curves
+ */
+export const make2dBezierCurve = (startPoint, controls, endPoint) => {
+    const allPoints = [
+        [startPoint[0], startPoint[1]],
+        ...controls.map((p) => [p[0], p[1]]),
+        [endPoint[0], endPoint[1]],
+    ];
+    return new Curve2D(getKernel().makeBezier2d(allPoints));
+};
+/**
+ * Create a 2D interpolated B-spline curve through the given points.
+ *
+ * @category Planar curves
+ */
+export function make2dInerpolatedBSplineCurve(points, { tolerance = 1e-3, smoothing = null, degMax = 3, degMin = 1, } = {}) {
+    try {
+        const pts = points.map((p) => [p[0], p[1]]);
+        const handle = getKernel().makeBSpline2d(pts, {
+            tolerance,
+            smoothing: smoothing,
+            degMax,
+            degMin,
+            continuity: 'C2',
+        });
+        return ok(new Curve2D(handle));
+    }
+    catch (e) {
+        return err(computationError('BSPLINE_2D_FAILED', 'B-spline approximation failed', e));
+    }
+}
+/**
+ * Create a 2D arc given its endpoints and center point.
+ *
+ * @category Planar curves
+ */
+export const make2dArcFromCenter = (startPoint, endPoint, center, longArc = false) => {
+    const midChord = scalarMultiply2d(add2d(startPoint, endPoint), 0.5);
+    const orientedRadius = distance2d(center, startPoint) * (longArc ? -1 : 1);
+    const midChordDir = normalize2d(subtract2d(midChord, center));
+    return make2dThreePointArc(startPoint, add2d(scalarMultiply2d(midChordDir, orientedRadius), center), endPoint);
+};
+//# sourceMappingURL=makeCurves.js.map

package/dist/vendored/brepjs/2d/lib/makeCurves.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"makeCurves.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/makeCurves.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAe,EAAE,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAC5D,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAIxD,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EACL,KAAK,EACL,UAAU,EACV,WAAW,EACX,SAAS,EACT,gBAAgB,EAChB,UAAU,GACX,MAAM,uBAAuB,CAAC;AAE/B;;;;GAIG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,UAAmB,EAAE,QAAiB,EAAW,EAAE;IACpF,MAAM,KAAK,GAAG,IAAI,OAAO,CACvB,SAAS,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAC/E,CAAC;IACF,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC;QAC7C,KAAK,CAAC,OAAO,EAAE,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CACjC,UAAmB,EACnB,QAAiB,EACjB,QAAiB,EACR,EAAE;IACX,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC,oBAAoB,CAC7C,UAAU,CAAC,CAAC,CAAC,EACb,UAAU,CAAC,CAAC,CAAC,EACb,QAAQ,CAAC,CAAC,CAAC,EACX,QAAQ,CAAC,CAAC,CAAC,EACX,QAAQ,CAAC,CAAC,CAAC,EACX,QAAQ,CAAC,CAAC,CAAC,CACZ,CAAC;IACF,IAAI,KAAK,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,SAAS,EAAE,CAAC,WAAW,CACrC,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,aAAa,EACnB,KAAK,CAAC,cAAc,CACrB,CAAC;QACF,KAAK,CAAC,MAAM,EAAE,CAAC;QACf,KAAK,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,UAAmB,EACnB,OAAgB,EAChB,QAAiB,EACR,EAAE;IACX,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC,gBAAgB,CACzC,UAAU,CAAC,CAAC,CAAC,EACb,UAAU,CAAC,CAAC,CAAC,EACb,OAAO,CAAC,CAAC,CAAC,EACV,OAAO,CAAC,CAAC,CAAC,EACV,QAAQ,CAAC,CAAC,CAAC,EACX,QAAQ,CAAC,CAAC,CAAC,CACZ,CAAC;IACF,IAAI,KAAK,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,SAAS,EAAE,CAAC,WAAW,CACrC,KAAK,CAAC,OAAO,EACb,KAAK,CAAC,aAAa,EACnB,KAAK,CAAC,cAAc,CACrB,CAAC;QACF,KAAK,CAAC,MAAM,EAAE,CAAC;QACf,KAAK,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,MAAc,EAAE,SAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAW,EAAE;IAChF,OAAO,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;AACnF,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,WAAmB,EACnB,WAAmB,EACnB,OAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,SAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EACxB,MAAM,GAAG,IAAI,EACJ,EAAE;IACX,OAAO,IAAI,OAAO,CAChB,SAAS,EAAE,CAAC,aAAa,CACvB,MAAM,CAAC,CAAC,CAAC,EACT,MAAM,CAAC,CAAC,CAAC,EACT,WAAW,EACX,WAAW,EACX,IAAI,CAAC,CAAC,CAAC,EACP,IAAI,CAAC,CAAC,CAAC,EACP,MAAM,CACP,CACF,CAAC;AACJ,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,WAAmB,EACnB,WAAmB,EACnB,UAAkB,EAClB,QAAgB,EAChB,SAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EACxB,IAAa,EACb,MAAM,GAAG,IAAI,EACJ,EAAE;IACX,OAAO,IAAI,OAAO,CAChB,SAAS,EAAE,CAAC,gBAAgB,CAC1B,MAAM,CAAC,CAAC,CAAC,EACT,MAAM,CAAC,CAAC,CAAC,EACT,WAAW,EACX,WAAW,EACX,UAAU,EACV,QAAQ,EACR,IAAI,CAAC,CAAC,CAAC,EACP,IAAI,CAAC,CAAC,CAAC,EACP,MAAM,CACP,CACF,CAAC;AACJ,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAC/B,UAAmB,EACnB,QAAmB,EACnB,QAAiB,EACR,EAAE;IACX,MAAM,SAAS,GAAuB;QACpC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;KAC3B,CAAC;IACF,OAAO,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC;AAC1D,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,6BAA6B,CAC3C,MAAiB,EACjB,EACE,SAAS,GAAG,IAAI,EAChB,SAAS,GAAG,IAAI,EAChB,MAAM,GAAG,CAAC,EACV,MAAM,GAAG,CAAC,MAMR,EAAE;IAEN,IAAI,CAAC;QACH,MAAM,GAAG,GAAuB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE;YAC5C,SAAS;YACT,SAAS,EAAE,SAAS;YACpB,MAAM;YACN,MAAM;YACN,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,OAAO,EAAE,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IACjC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,GAAG,CAAC,gBAAgB,CAAC,mBAAmB,EAAE,+BAA+B,EAAE,CAAC,CAAC,CAAC,CAAC;IACxF,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CACjC,UAAmB,EACnB,QAAiB,EACjB,MAAe,EACf,OAAO,GAAG,KAAK,EACf,EAAE;IACF,MAAM,QAAQ,GAAG,gBAAgB,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;IACpE,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;IAE9D,OAAO,mBAAmB,CACxB,UAAU,EACV,KAAK,CAAC,gBAAgB,CAAC,WAAW,EAAE,cAAc,CAAC,EAAE,MAAM,CAAC,EAC5D,QAAQ,CACT,CAAC;AACJ,CAAC,CAAC","sourcesContent":["import { getKernel } from '../../kernel/index.js';\nimport { type Result, ok, err } from '../../core/result.js';\nimport { computationError } from '../../core/errors.js';\n\nimport type { Point2D } from './definitions.js';\n\nimport { Curve2D } from './curve2D.js';\nimport {\n  add2d,\n  distance2d,\n  normalize2d,\n  samePoint,\n  scalarMultiply2d,\n  subtract2d,\n} from './vectorOperations.js';\n\n/**\n * Creates a 2D segment curve between two points.\n *\n * @category Planar curves\n */\nexport const make2dSegmentCurve = (startPoint: Point2D, endPoint: Point2D): Curve2D => {\n  const curve = new Curve2D(\n    getKernel().makeLine2d(startPoint[0], startPoint[1], endPoint[0], endPoint[1])\n  );\n  if (!samePoint(curve.firstPoint, startPoint)) {\n    curve.reverse();\n  }\n  return curve;\n};\n\n/**\n * Creates a 2D arc curve defined by three points.\n *\n * @category Planar curves\n */\nexport const make2dThreePointArc = (\n  startPoint: Point2D,\n  midPoint: Point2D,\n  endPoint: Point2D\n): Curve2D => {\n  const handle = getKernel().makeArc2dThreePoints(\n    startPoint[0],\n    startPoint[1],\n    midPoint[0],\n    midPoint[1],\n    endPoint[0],\n    endPoint[1]\n  );\n  let curve = new Curve2D(handle);\n  if (!samePoint(curve.firstPoint, startPoint)) {\n    const trimmed = getKernel().trimCurve2d(\n      curve.wrapped,\n      curve.lastParameter,\n      curve.firstParameter\n    );\n    curve.delete();\n    curve = new Curve2D(trimmed);\n  }\n  return curve;\n};\n\n/**\n * Creates a 2D tangent arc curve.\n *\n * @category Planar curves\n */\nexport const make2dTangentArc = (\n  startPoint: Point2D,\n  tangent: Point2D,\n  endPoint: Point2D\n): Curve2D => {\n  const handle = getKernel().makeArc2dTangent(\n    startPoint[0],\n    startPoint[1],\n    tangent[0],\n    tangent[1],\n    endPoint[0],\n    endPoint[1]\n  );\n  let curve = new Curve2D(handle);\n  if (!samePoint(curve.firstPoint, startPoint)) {\n    const trimmed = getKernel().trimCurve2d(\n      curve.wrapped,\n      curve.lastParameter,\n      curve.firstParameter\n    );\n    curve.delete();\n    curve = new Curve2D(trimmed);\n  }\n  return curve;\n};\n\n/**\n * Creates a 2D circle curve.\n *\n * @category Planar curves\n */\nexport const make2dCircle = (radius: number, center: Point2D = [0, 0]): Curve2D => {\n  return new Curve2D(getKernel().makeCircle2d(center[0], center[1], radius, true));\n};\n\n/**\n * Creates a 2D ellipse curve.\n *\n * @category Planar curves\n */\nexport const make2dEllipse = (\n  majorRadius: number,\n  minorRadius: number,\n  xDir: Point2D = [1, 0],\n  center: Point2D = [0, 0],\n  direct = true\n): Curve2D => {\n  return new Curve2D(\n    getKernel().makeEllipse2d(\n      center[0],\n      center[1],\n      majorRadius,\n      minorRadius,\n      xDir[0],\n      xDir[1],\n      direct\n    )\n  );\n};\n\n/**\n * Creates a 2D ellipse arc curve.\n *\n * @category Planar curves\n */\nexport const make2dEllipseArc = (\n  majorRadius: number,\n  minorRadius: number,\n  startAngle: number,\n  endAngle: number,\n  center: Point2D = [0, 0],\n  xDir: Point2D,\n  direct = true\n): Curve2D => {\n  return new Curve2D(\n    getKernel().makeEllipseArc2d(\n      center[0],\n      center[1],\n      majorRadius,\n      minorRadius,\n      startAngle,\n      endAngle,\n      xDir[0],\n      xDir[1],\n      direct\n    )\n  );\n};\n\n/**\n * Creates a 2D Bezier curve defined by a start point, control points, and an end point.\n *\n * @category Planar curves\n */\nexport const make2dBezierCurve = (\n  startPoint: Point2D,\n  controls: Point2D[],\n  endPoint: Point2D\n): Curve2D => {\n  const allPoints: [number, number][] = [\n    [startPoint[0], startPoint[1]],\n    ...controls.map((p): [number, number] => [p[0], p[1]]),\n    [endPoint[0], endPoint[1]],\n  ];\n  return new Curve2D(getKernel().makeBezier2d(allPoints));\n};\n\n/**\n * Create a 2D interpolated B-spline curve through the given points.\n *\n * @category Planar curves\n */\nexport function make2dInerpolatedBSplineCurve(\n  points: Point2D[],\n  {\n    tolerance = 1e-3,\n    smoothing = null,\n    degMax = 3,\n    degMin = 1,\n  }: {\n    tolerance?: number;\n    smoothing?: null | [number, number, number];\n    degMax?: number;\n    degMin?: number;\n  } = {}\n): Result<Curve2D> {\n  try {\n    const pts: [number, number][] = points.map((p) => [p[0], p[1]]);\n    const handle = getKernel().makeBSpline2d(pts, {\n      tolerance,\n      smoothing: smoothing,\n      degMax,\n      degMin,\n      continuity: 'C2',\n    });\n    return ok(new Curve2D(handle));\n  } catch (e) {\n    return err(computationError('BSPLINE_2D_FAILED', 'B-spline approximation failed', e));\n  }\n}\n\n/**\n * Create a 2D arc given its endpoints and center point.\n *\n * @category Planar curves\n */\nexport const make2dArcFromCenter = (\n  startPoint: Point2D,\n  endPoint: Point2D,\n  center: Point2D,\n  longArc = false\n) => {\n  const midChord = scalarMultiply2d(add2d(startPoint, endPoint), 0.5);\n  const orientedRadius = distance2d(center, startPoint) * (longArc ? -1 : 1);\n  const midChordDir = normalize2d(subtract2d(midChord, center));\n\n  return make2dThreePointArc(\n    startPoint,\n    add2d(scalarMultiply2d(midChordDir, orientedRadius), center),\n    endPoint\n  );\n};\n"]}

package/dist/vendored/brepjs/2d/lib/offset.d.ts

@@ -0,0 +1,30 @@
+import { Curve2D } from './curve2D.js';
+import type { Point2D } from './definitions.js';
+/**
+ * Compute the offset of a 2D curve by a signed distance.
+ *
+ * Circles and lines are offset analytically. Other curve types are approximated
+ * as B-splines via {@link approximateAsBSpline}. When the offset causes the
+ * curve to collapse (e.g. an arc whose radius shrinks to zero, or a
+ * self-intersecting offset), a `{ collapsed: true }` sentinel is returned
+ * instead of a `Curve2D`.
+ *
+ * @param curve - The source curve to offset.
+ * @param offset - Signed offset distance (positive = left of curve direction).
+ *
+ * @remarks Self-intersecting offset curves are replaced with a collapsed
+ *   sentinel. This is a known simplification; a more robust trimming strategy
+ *   may be added in the future.
+ *
+ * @example
+ * ```ts
+ * const result = make2dOffset(line, 2);
+ * if (result instanceof Curve2D) { /* use the offset curve *\/ }
+ * ```
+ */
+export declare const make2dOffset: (curve: Curve2D, offset: number) => Curve2D | {
+    collapsed: true;
+    firstPoint: Point2D;
+    lastPoint: Point2D;
+};
+//# sourceMappingURL=offset.d.ts.map

package/dist/vendored/brepjs/2d/lib/offset.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"offset.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/offset.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAmBhD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,eAAO,MAAM,YAAY,GACvB,OAAO,OAAO,EACd,QAAQ,MAAM,KACb,OAAO,GAAG;IAAE,SAAS,EAAE,IAAI,CAAC;IAAC,UAAU,EAAE,OAAO,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAoFtE,CAAC"}

package/dist/vendored/brepjs/2d/lib/offset.js

@@ -0,0 +1,109 @@
+import { getKernel2D } from '../../kernel/index.js';
+import { approximateAsBSpline } from './approximations.js';
+import { Curve2D } from './curve2D.js';
+import { selfIntersections } from './intersections.js';
+import { unwrap } from '../../core/result.js';
+import { make2dSegmentCurve } from './makeCurves.js';
+import { add2d, normalize2d, subtract2d } from './vectorOperations.js';
+import { wasmIndex } from '../../utils/vec3.js';
+const offsetEndPoints = (firstPoint, lastPoint, offset) => {
+    const tangent = normalize2d(subtract2d(lastPoint, firstPoint));
+    const normal = [tangent[1], -tangent[0]];
+    const offsetVec = [wasmIndex(normal, 0) * offset, wasmIndex(normal, 1) * offset];
+    return {
+        firstPoint: add2d(firstPoint, offsetVec),
+        lastPoint: add2d(lastPoint, offsetVec),
+    };
+};
+/**
+ * Compute the offset of a 2D curve by a signed distance.
+ *
+ * Circles and lines are offset analytically. Other curve types are approximated
+ * as B-splines via {@link approximateAsBSpline}. When the offset causes the
+ * curve to collapse (e.g. an arc whose radius shrinks to zero, or a
+ * self-intersecting offset), a `{ collapsed: true }` sentinel is returned
+ * instead of a `Curve2D`.
+ *
+ * @param curve - The source curve to offset.
+ * @param offset - Signed offset distance (positive = left of curve direction).
+ *
+ * @remarks Self-intersecting offset curves are replaced with a collapsed
+ *   sentinel. This is a known simplification; a more robust trimming strategy
+ *   may be added in the future.
+ *
+ * @example
+ * ```ts
+ * const result = make2dOffset(line, 2);
+ * if (result instanceof Curve2D) { /* use the offset curve *\/ }
+ * ```
+ */
+export const make2dOffset = (curve, offset) => {
+    const curveType = curve.geomType;
+    const kernel = getKernel2D();
+    if (curveType === 'CIRCLE') {
+        const circleData = kernel.getCurve2dCircleData(curve.wrapped);
+        if (!circleData)
+            return make2dSegmentCurve(curve.firstPoint, curve.lastPoint);
+        const { cx, cy, radius, isDirect } = circleData;
+        const orientationCorrection = isDirect ? 1 : -1;
+        const orientedOffset = offset * orientationCorrection;
+        const newRadius = radius + orientedOffset;
+        if (newRadius < 1e-10) {
+            const center = [cx, cy];
+            // We replace collapsed arcs by a segment of line
+            const offsetViaCenter = (point) => {
+                const [x, y] = normalize2d(subtract2d(point, center));
+                return add2d(point, [orientedOffset * x, orientedOffset * y]);
+            };
+            return {
+                collapsed: true,
+                firstPoint: offsetViaCenter(curve.firstPoint),
+                lastPoint: offsetViaCenter(curve.lastPoint),
+            };
+        }
+        const circleHandle = kernel.makeCircle2d(cx, cy, newRadius, isDirect);
+        const fullCircle = new Curve2D(circleHandle);
+        let trimmedHandle;
+        try {
+            trimmedHandle = kernel.trimCurve2d(fullCircle.wrapped, curve.firstParameter, curve.lastParameter);
+        }
+        finally {
+            fullCircle.delete();
+        }
+        return new Curve2D(trimmedHandle);
+    }
+    if (curveType === 'LINE') {
+        const { firstPoint, lastPoint } = offsetEndPoints(curve.firstPoint, curve.lastPoint, offset);
+        return make2dSegmentCurve(firstPoint, lastPoint);
+    }
+    // Compute the analytic offset, then approximate as a B-spline (the kernel
+    // misbehaves on the raw offset handle after transforms like mirroring).
+    const offsetHandle = kernel.offsetCurve2d(curve.wrapped, offset);
+    const offsetCurve = new Curve2D(offsetHandle);
+    const approximation = approximateAsBSpline(offsetCurve);
+    offsetCurve.delete();
+    // Self-intersecting single-curve offsets are collapsed to a straight-line
+    // sentinel rather than trimmed. This happens when a concave region is offset
+    // outward (or convex inward) by more than the local radius of curvature,
+    // producing a loop in the offset curve.
+    //
+    // The blueprint-level Cavalier-Contours algorithm (blueprints/offset.ts →
+    // offsetBlueprint) DOES handle multi-curve self-intersections via
+    // split/prune/stitch. However, single-curve self-intersections are collapsed
+    // here before reaching that stage. Routing self-intersecting curves through
+    // the blueprint trimmer would require not collapsing + propagating the raw
+    // curve upward — a non-trivial architectural change.
+    const selfIntersects = unwrap(selfIntersections(approximation));
+    if (selfIntersects.length) {
+        const firstPoint = approximation.firstPoint;
+        const lastPoint = approximation.lastPoint;
+        approximation.delete();
+        return {
+            collapsed: true,
+            firstPoint,
+            lastPoint,
+        };
+    }
+    return approximation;
+};
+//# sourceMappingURL=offset.js.map

package/dist/vendored/brepjs/2d/lib/offset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"offset.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/offset.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACvE,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAEhD,MAAM,eAAe,GAAG,CAAC,UAAmB,EAAE,SAAkB,EAAE,MAAc,EAAE,EAAE;IAClF,MAAM,OAAO,GAAG,WAAW,CAAC,UAAU,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzC,MAAM,SAAS,GAAY,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAE1F,OAAO;QACL,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,CAAC;QACxC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,SAAS,CAAC;KACvC,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAc,EACd,MAAc,EAC0D,EAAE;IAC1E,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC;IACjC,MAAM,MAAM,GAAG,WAAW,EAAE,CAAC;IAE7B,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;QAC3B,MAAM,UAAU,GAAG,MAAM,CAAC,oBAAoB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,UAAU;YAAE,OAAO,kBAAkB,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QAE9E,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC;QAEhD,MAAM,qBAAqB,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,cAAc,GAAG,MAAM,GAAG,qBAAqB,CAAC;QAEtD,MAAM,SAAS,GAAG,MAAM,GAAG,cAAc,CAAC;QAE1C,IAAI,SAAS,GAAG,KAAK,EAAE,CAAC;YACtB,MAAM,MAAM,GAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAEjC,iDAAiD;YACjD,MAAM,eAAe,GAAG,CAAC,KAAc,EAAW,EAAE;gBAClD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;gBACtD,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC;YAChE,CAAC,CAAC;YAEF,OAAO;gBACL,SAAS,EAAE,IAAI;gBACf,UAAU,EAAE,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC;gBAC7C,SAAS,EAAE,eAAe,CAAC,KAAK,CAAC,SAAS,CAAC;aAC5C,CAAC;QACJ,CAAC;QAED,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QACtE,MAAM,UAAU,GAAG,IAAI,OAAO,CAAC,YAAY,CAAC,CAAC;QAC7C,IAAI,aAAa,CAAC;QAClB,IAAI,CAAC;YACH,aAAa,GAAG,MAAM,CAAC,WAAW,CAChC,UAAU,CAAC,OAAO,EAClB,KAAK,CAAC,cAAc,EACpB,KAAK,CAAC,aAAa,CACpB,CAAC;QACJ,CAAC;gBAAS,CAAC;YACT,UAAU,CAAC,MAAM,EAAE,CAAC;QACtB,CAAC;QAED,OAAO,IAAI,OAAO,CAAC,aAAa,CAAC,CAAC;IACpC,CAAC;IAED,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACzB,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAE7F,OAAO,kBAAkB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IAED,0EAA0E;IAC1E,wEAAwE;IACxE,MAAM,YAAY,GAAG,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACjE,MAAM,WAAW,GAAG,IAAI,OAAO,CAAC,YAAY,CAAC,CAAC;IAC9C,MAAM,aAAa,GAAG,oBAAoB,CAAC,WAAW,CAAC,CAAC;IACxD,WAAW,CAAC,MAAM,EAAE,CAAC;IAErB,0EAA0E;IAC1E,6EAA6E;IAC7E,yEAAyE;IACzE,wCAAwC;IACxC,EAAE;IACF,0EAA0E;IAC1E,kEAAkE;IAClE,6EAA6E;IAC7E,4EAA4E;IAC5E,2EAA2E;IAC3E,qDAAqD;IACrD,MAAM,cAAc,GAAG,MAAM,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC,CAAC;IAChE,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,UAAU,GAAG,aAAa,CAAC,UAAU,CAAC;QAC5C,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC;QAC1C,aAAa,CAAC,MAAM,EAAE,CAAC;QACvB,OAAO;YACL,SAAS,EAAE,IAAI;YACf,UAAU;YACV,SAAS;SACV,CAAC;IACJ,CAAC;IAED,OAAO,aAAa,CAAC;AACvB,CAAC,CAAC","sourcesContent":["import { getKernel2D } from '../../kernel/index.js';\nimport { approximateAsBSpline } from './approximations.js';\nimport { Curve2D } from './curve2D.js';\nimport type { Point2D } from './definitions.js';\nimport { selfIntersections } from './intersections.js';\nimport { unwrap } from '../../core/result.js';\nimport { make2dSegmentCurve } from './makeCurves.js';\nimport { add2d, normalize2d, subtract2d } from './vectorOperations.js';\nimport { wasmIndex } from '../../utils/vec3.js';\n\nconst offsetEndPoints = (firstPoint: Point2D, lastPoint: Point2D, offset: number) => {\n  const tangent = normalize2d(subtract2d(lastPoint, firstPoint));\n  const normal = [tangent[1], -tangent[0]];\n\n  const offsetVec: Point2D = [wasmIndex(normal, 0) * offset, wasmIndex(normal, 1) * offset];\n\n  return {\n    firstPoint: add2d(firstPoint, offsetVec),\n    lastPoint: add2d(lastPoint, offsetVec),\n  };\n};\n\n/**\n * Compute the offset of a 2D curve by a signed distance.\n *\n * Circles and lines are offset analytically. Other curve types are approximated\n * as B-splines via {@link approximateAsBSpline}. When the offset causes the\n * curve to collapse (e.g. an arc whose radius shrinks to zero, or a\n * self-intersecting offset), a `{ collapsed: true }` sentinel is returned\n * instead of a `Curve2D`.\n *\n * @param curve - The source curve to offset.\n * @param offset - Signed offset distance (positive = left of curve direction).\n *\n * @remarks Self-intersecting offset curves are replaced with a collapsed\n *   sentinel. This is a known simplification; a more robust trimming strategy\n *   may be added in the future.\n *\n * @example\n * ```ts\n * const result = make2dOffset(line, 2);\n * if (result instanceof Curve2D) { /* use the offset curve *\\/ }\n * ```\n */\nexport const make2dOffset = (\n  curve: Curve2D,\n  offset: number\n): Curve2D | { collapsed: true; firstPoint: Point2D; lastPoint: Point2D } => {\n  const curveType = curve.geomType;\n  const kernel = getKernel2D();\n\n  if (curveType === 'CIRCLE') {\n    const circleData = kernel.getCurve2dCircleData(curve.wrapped);\n    if (!circleData) return make2dSegmentCurve(curve.firstPoint, curve.lastPoint);\n\n    const { cx, cy, radius, isDirect } = circleData;\n\n    const orientationCorrection = isDirect ? 1 : -1;\n    const orientedOffset = offset * orientationCorrection;\n\n    const newRadius = radius + orientedOffset;\n\n    if (newRadius < 1e-10) {\n      const center: Point2D = [cx, cy];\n\n      // We replace collapsed arcs by a segment of line\n      const offsetViaCenter = (point: Point2D): Point2D => {\n        const [x, y] = normalize2d(subtract2d(point, center));\n        return add2d(point, [orientedOffset * x, orientedOffset * y]);\n      };\n\n      return {\n        collapsed: true,\n        firstPoint: offsetViaCenter(curve.firstPoint),\n        lastPoint: offsetViaCenter(curve.lastPoint),\n      };\n    }\n\n    const circleHandle = kernel.makeCircle2d(cx, cy, newRadius, isDirect);\n    const fullCircle = new Curve2D(circleHandle);\n    let trimmedHandle;\n    try {\n      trimmedHandle = kernel.trimCurve2d(\n        fullCircle.wrapped,\n        curve.firstParameter,\n        curve.lastParameter\n      );\n    } finally {\n      fullCircle.delete();\n    }\n\n    return new Curve2D(trimmedHandle);\n  }\n\n  if (curveType === 'LINE') {\n    const { firstPoint, lastPoint } = offsetEndPoints(curve.firstPoint, curve.lastPoint, offset);\n\n    return make2dSegmentCurve(firstPoint, lastPoint);\n  }\n\n  // Compute the analytic offset, then approximate as a B-spline (the kernel\n  // misbehaves on the raw offset handle after transforms like mirroring).\n  const offsetHandle = kernel.offsetCurve2d(curve.wrapped, offset);\n  const offsetCurve = new Curve2D(offsetHandle);\n  const approximation = approximateAsBSpline(offsetCurve);\n  offsetCurve.delete();\n\n  // Self-intersecting single-curve offsets are collapsed to a straight-line\n  // sentinel rather than trimmed. This happens when a concave region is offset\n  // outward (or convex inward) by more than the local radius of curvature,\n  // producing a loop in the offset curve.\n  //\n  // The blueprint-level Cavalier-Contours algorithm (blueprints/offset.ts →\n  // offsetBlueprint) DOES handle multi-curve self-intersections via\n  // split/prune/stitch. However, single-curve self-intersections are collapsed\n  // here before reaching that stage. Routing self-intersecting curves through\n  // the blueprint trimmer would require not collapsing + propagating the raw\n  // curve upward — a non-trivial architectural change.\n  const selfIntersects = unwrap(selfIntersections(approximation));\n  if (selfIntersects.length) {\n    const firstPoint = approximation.firstPoint;\n    const lastPoint = approximation.lastPoint;\n    approximation.delete();\n    return {\n      collapsed: true,\n      firstPoint,\n      lastPoint,\n    };\n  }\n\n  return approximation;\n};\n"]}

package/dist/vendored/brepjs/2d/lib/precision.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Shared precision constants for the 2D module — re-exports from Layer 0.
+ *
+ * ADR-0006: src/utils/vec2d.ts is the canonical source.
+ *
+ * Hierarchy (from tightest to loosest):
+ *  - PRECISION_INTERSECTION (1e-9): curve intersection, parameter lookups
+ *  - PRECISION_OFFSET       (1e-8): offset operations (scaled ×10, ÷100, ×100 internally)
+ *  - PRECISION_POINT        (1e-6): point-equality checks (default for samePoint)
+ */
+export { PRECISION_INTERSECTION, PRECISION_OFFSET, PRECISION_POINT } from '../../utils/vec2d.js';
+//# sourceMappingURL=precision.d.ts.map

package/dist/vendored/brepjs/2d/lib/precision.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"precision.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/precision.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/vendored/brepjs/2d/lib/precision.js

@@ -0,0 +1,12 @@
+/**
+ * Shared precision constants for the 2D module — re-exports from Layer 0.
+ *
+ * ADR-0006: src/utils/vec2d.ts is the canonical source.
+ *
+ * Hierarchy (from tightest to loosest):
+ *  - PRECISION_INTERSECTION (1e-9): curve intersection, parameter lookups
+ *  - PRECISION_OFFSET       (1e-8): offset operations (scaled ×10, ÷100, ×100 internally)
+ *  - PRECISION_POINT        (1e-6): point-equality checks (default for samePoint)
+ */
+export { PRECISION_INTERSECTION, PRECISION_OFFSET, PRECISION_POINT } from '../../utils/vec2d.js';
+//# sourceMappingURL=precision.js.map

package/dist/vendored/brepjs/2d/lib/precision.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"precision.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/precision.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC","sourcesContent":["/**\n * Shared precision constants for the 2D module — re-exports from Layer 0.\n *\n * ADR-0006: src/utils/vec2d.ts is the canonical source.\n *\n * Hierarchy (from tightest to loosest):\n *  - PRECISION_INTERSECTION (1e-9): curve intersection, parameter lookups\n *  - PRECISION_OFFSET       (1e-8): offset operations (scaled ×10, ÷100, ×100 internally)\n *  - PRECISION_POINT        (1e-6): point-equality checks (default for samePoint)\n */\n\nexport { PRECISION_INTERSECTION, PRECISION_OFFSET, PRECISION_POINT } from '../../utils/vec2d.js';\n"]}

package/dist/vendored/brepjs/2d/lib/stitching.d.ts

@@ -0,0 +1,15 @@
+import type { Curve2D } from './curve2D.js';
+/**
+ * Group a flat list of curves into connected chains by matching endpoints.
+ *
+ * Uses a Flatbush spatial index for fast nearest-neighbour lookups.
+ * Each returned sub-array is a connected sequence where each curve's
+ * start point matches the previous curve's end point within the given
+ * precision.
+ *
+ * @param curves - Unordered input curves to stitch.
+ * @param precision - Maximum distance to consider two endpoints coincident.
+ * @returns An array of connected curve chains.
+ */
+export declare const stitchCurves: (curves: Curve2D[], precision?: number) => Curve2D[][];
+//# sourceMappingURL=stitching.d.ts.map

package/dist/vendored/brepjs/2d/lib/stitching.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stitching.d.ts","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/stitching.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAG5C;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,YAAY,GAAI,QAAQ,OAAO,EAAE,EAAE,kBAAgB,KAAG,OAAO,EAAE,EAoE3E,CAAC"}

package/dist/vendored/brepjs/2d/lib/stitching.js

@@ -0,0 +1,67 @@
+import Flatbush from 'flatbush';
+import { bug } from '../../core/errors.js';
+import { wasmIndex } from '../../utils/vec3.js';
+/**
+ * Group a flat list of curves into connected chains by matching endpoints.
+ *
+ * Uses a Flatbush spatial index for fast nearest-neighbour lookups.
+ * Each returned sub-array is a connected sequence where each curve's
+ * start point matches the previous curve's end point within the given
+ * precision.
+ *
+ * @param curves - Unordered input curves to stitch.
+ * @param precision - Maximum distance to consider two endpoints coincident.
+ * @returns An array of connected curve chains.
+ */
+export const stitchCurves = (curves, precision = 1e-7) => {
+    // Flatbush's constructor rejects numItems === 0; an empty curve set has no chains.
+    if (curves.length === 0)
+        return [];
+    // We create a spacial index of the startpoints
+    const startPoints = new Flatbush(curves.length);
+    curves.forEach((c) => {
+        const [x, y] = c.firstPoint;
+        startPoints.add(x - precision, y - precision, x + precision, y + precision);
+    });
+    startPoints.finish();
+    const stitchedCurves = [];
+    const visited = new Set();
+    curves.forEach((curve, index) => {
+        if (visited.has(index))
+            return;
+        const connectedCurves = [curve];
+        let currentIndex = index;
+        visited.add(index);
+        // Once we have started a connected curve segment, we look for the next
+        let maxLoops = curves.length;
+        // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition -- intentional infinite loop with break
+        while (true) {
+            if (maxLoops-- < 0) {
+                bug('stitchCurves', 'Infinite loop detected');
+            }
+            const lastPoint = wasmIndex(connectedCurves, connectedCurves.length - 1).lastPoint;
+            const [x, y] = lastPoint;
+            const neighbors = startPoints.search(x - precision, y - precision, x + precision, y + precision);
+            const indexDistance = (otherIndex) => Math.abs((currentIndex - otherIndex) % curves.length);
+            const potentialNextCurves = neighbors
+                .filter((neighborIndex) => !visited.has(neighborIndex))
+                .map((neighborIndex) => [
+                wasmIndex(curves, neighborIndex),
+                neighborIndex,
+                indexDistance(neighborIndex),
+            ])
+                .sort(([, , a], [, , b]) => a - b);
+            if (potentialNextCurves.length === 0) {
+                // No more curves to connect we should have wrapped
+                stitchedCurves.push(connectedCurves);
+                break;
+            }
+            const [nextCurve, nextCurveIndex] = wasmIndex(potentialNextCurves, 0);
+            connectedCurves.push(nextCurve);
+            visited.add(nextCurveIndex);
+            currentIndex = nextCurveIndex;
+        }
+    });
+    return stitchedCurves;
+};
+//# sourceMappingURL=stitching.js.map

package/dist/vendored/brepjs/2d/lib/stitching.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stitching.js","sourceRoot":"","sources":["../../../../../src/vendored/brepjs/2d/lib/stitching.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,UAAU,CAAC;AAChC,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAE3C,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAEhD;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,MAAiB,EAAE,SAAS,GAAG,IAAI,EAAe,EAAE;IAC/E,mFAAmF;IACnF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,+CAA+C;IAC/C,MAAM,WAAW,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAChD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACnB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;QAC5B,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;IAC9E,CAAC,CAAC,CAAC;IACH,WAAW,CAAC,MAAM,EAAE,CAAC;IAErB,MAAM,cAAc,GAAgB,EAAE,CAAC;IACvC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QAC9B,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO;QAE/B,MAAM,eAAe,GAAc,CAAC,KAAK,CAAC,CAAC;QAC3C,IAAI,YAAY,GAAG,KAAK,CAAC;QAEzB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEnB,uEAAuE;QAEvE,IAAI,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;QAE7B,+GAA+G;QAC/G,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnB,GAAG,CAAC,cAAc,EAAE,wBAAwB,CAAC,CAAC;YAChD,CAAC;YAED,MAAM,SAAS,GAAG,SAAS,CAAC,eAAe,EAAE,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;YAEnF,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;YACzB,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAClC,CAAC,GAAG,SAAS,EACb,CAAC,GAAG,SAAS,EACb,CAAC,GAAG,SAAS,EACb,CAAC,GAAG,SAAS,CACd,CAAC;YAEF,MAAM,aAAa,GAAG,CAAC,UAAkB,EAAE,EAAE,CAC3C,IAAI,CAAC,GAAG,CAAC,CAAC,YAAY,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,mBAAmB,GAAG,SAAS;iBAClC,MAAM,CAAC,CAAC,aAAqB,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;iBAC9D,GAAG,CAAC,CAAC,aAAqB,EAA6B,EAAE,CAAC;gBACzD,SAAS,CAAC,MAAM,EAAE,aAAa,CAAC;gBAChC,aAAa;gBACb,aAAa,CAAC,aAAa,CAAC;aAC7B,CAAC;iBACD,IAAI,CAAC,CAAC,CAAC,EAAE,AAAD,EAAG,CAAC,CAA4B,EAAE,CAAC,EAAE,AAAD,EAAG,CAAC,CAA4B,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAE3F,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACrC,mDAAmD;gBACnD,cAAc,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBACrC,MAAM;YACR,CAAC;YAED,MAAM,CAAC,SAAS,EAAE,cAAc,CAAC,GAAG,SAAS,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAC;YAEtE,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;YAC5B,YAAY,GAAG,cAAc,CAAC;QAChC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,cAAc,CAAC;AACxB,CAAC,CAAC","sourcesContent":["import Flatbush from 'flatbush';\nimport { bug } from '../../core/errors.js';\nimport type { Curve2D } from './curve2D.js';\nimport { wasmIndex } from '../../utils/vec3.js';\n\n/**\n * Group a flat list of curves into connected chains by matching endpoints.\n *\n * Uses a Flatbush spatial index for fast nearest-neighbour lookups.\n * Each returned sub-array is a connected sequence where each curve's\n * start point matches the previous curve's end point within the given\n * precision.\n *\n * @param curves - Unordered input curves to stitch.\n * @param precision - Maximum distance to consider two endpoints coincident.\n * @returns An array of connected curve chains.\n */\nexport const stitchCurves = (curves: Curve2D[], precision = 1e-7): Curve2D[][] => {\n  // Flatbush's constructor rejects numItems === 0; an empty curve set has no chains.\n  if (curves.length === 0) return [];\n  // We create a spacial index of the startpoints\n  const startPoints = new Flatbush(curves.length);\n  curves.forEach((c) => {\n    const [x, y] = c.firstPoint;\n    startPoints.add(x - precision, y - precision, x + precision, y + precision);\n  });\n  startPoints.finish();\n\n  const stitchedCurves: Curve2D[][] = [];\n  const visited = new Set<number>();\n\n  curves.forEach((curve, index) => {\n    if (visited.has(index)) return;\n\n    const connectedCurves: Curve2D[] = [curve];\n    let currentIndex = index;\n\n    visited.add(index);\n\n    // Once we have started a connected curve segment, we look for the next\n\n    let maxLoops = curves.length;\n\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition -- intentional infinite loop with break\n    while (true) {\n      if (maxLoops-- < 0) {\n        bug('stitchCurves', 'Infinite loop detected');\n      }\n\n      const lastPoint = wasmIndex(connectedCurves, connectedCurves.length - 1).lastPoint;\n\n      const [x, y] = lastPoint;\n      const neighbors = startPoints.search(\n        x - precision,\n        y - precision,\n        x + precision,\n        y + precision\n      );\n\n      const indexDistance = (otherIndex: number) =>\n        Math.abs((currentIndex - otherIndex) % curves.length);\n      const potentialNextCurves = neighbors\n        .filter((neighborIndex: number) => !visited.has(neighborIndex))\n        .map((neighborIndex: number): [Curve2D, number, number] => [\n          wasmIndex(curves, neighborIndex),\n          neighborIndex,\n          indexDistance(neighborIndex),\n        ])\n        .sort(([, , a]: [Curve2D, number, number], [, , b]: [Curve2D, number, number]) => a - b);\n\n      if (potentialNextCurves.length === 0) {\n        // No more curves to connect we should have wrapped\n        stitchedCurves.push(connectedCurves);\n        break;\n      }\n\n      const [nextCurve, nextCurveIndex] = wasmIndex(potentialNextCurves, 0);\n\n      connectedCurves.push(nextCurve);\n      visited.add(nextCurveIndex);\n      currentIndex = nextCurveIndex;\n    }\n  });\n\n  return stitchedCurves;\n};\n"]}