@faicad/faijs 0.18.3 → 0.22.2

package/dist/geometry2d/bbox2d.js

@@ -0,0 +1,123 @@
+/**
+ * Axis-aligned 2D bounding box (pure-data; faijs port of brepjs `BoundingBox2d`).
+ * brepjs backs this with a kernel `Bnd_Box2d`; here it's plain numbers.
+ *
+ * License: adapted from brepjs (Apache-2.0).
+ * @module
+ */
+/**
+ * Create an empty (inverted) bounding box.
+ * @returns a fresh BBox2d whose mins are +Infinity and maxes are -Infinity.
+ */
+export function createBBox2d() {
+    return { xMin: Infinity, yMin: Infinity, xMax: -Infinity, yMax: -Infinity };
+}
+/**
+ * True when the box holds no finite extent yet.
+ * @param bb - the bounding box to test.
+ * @returns true when any corner is non-finite or the box is inverted.
+ */
+export function isEmpty(bb) {
+    return (!isFinite(bb.xMin) || !isFinite(bb.yMin) || !isFinite(bb.xMax) || !isFinite(bb.yMax) ||
+        bb.xMax < bb.xMin || bb.yMax < bb.yMin);
+}
+/**
+ * Expand `bb` to include the given corner points.
+ * @param bb - the bounding box to expand in place.
+ * @param pts - the corner points to include.
+ */
+export function addPoints(bb, pts) {
+    for (const [x, y] of pts) {
+        if (x < bb.xMin)
+            bb.xMin = x;
+        if (y < bb.yMin)
+            bb.yMin = y;
+        if (x > bb.xMax)
+            bb.xMax = x;
+        if (y > bb.yMax)
+            bb.yMax = y;
+    }
+}
+/**
+ * Expand `bb` to include all points of `other`.
+ * @param bb - the box to expand in place.
+ * @param other - the box whose extent is folded into `bb`.
+ */
+export function mergeBBox(bb, other) {
+    if (other.xMin < bb.xMin)
+        bb.xMin = other.xMin;
+    if (other.yMin < bb.yMin)
+        bb.yMin = other.yMin;
+    if (other.xMax > bb.xMax)
+        bb.xMax = other.xMax;
+    if (other.yMax > bb.yMax)
+        bb.yMax = other.yMax;
+}
+/**
+ * Return `[min, max]` corner points.
+ * @param bb - the bounding box to read from.
+ * @returns the lower-left and upper-right corners as `[[xMin,yMin],[xMax,yMax]]`.
+ */
+export function boundsOf(bb) {
+    return [
+        [bb.xMin, bb.yMin],
+        [bb.xMax, bb.yMax],
+    ];
+}
+/**
+ * Compute the center point of the box.
+ * @param bb - the bounding box to read from.
+ * @returns the midpoint `[x, y]` between the min and max corners.
+ */
+export function centerOf(bb) {
+    return [(bb.xMin + bb.xMax) / 2, (bb.yMin + bb.yMax) / 2];
+}
+/**
+ * Compute the width of the box.
+ * @param bb - the bounding box to read from.
+ * @returns the absolute horizontal extent.
+ */
+export function widthOf(bb) {
+    return Math.abs(bb.xMax - bb.xMin);
+}
+/**
+ * Compute the height of the box.
+ * @param bb - the bounding box to read from.
+ * @returns the absolute vertical extent.
+ */
+export function heightOf(bb) {
+    return Math.abs(bb.yMax - bb.yMin);
+}
+/**
+ * Point guaranteed outside (to the upper-right of) the box.
+ * @param bb - the bounding box to read from.
+ * @param paddingPercent - the padding as a percent of the box extent (default 1).
+ * @returns a point offset to the upper-right of `bb`.
+ */
+export function outsidePointOf(bb, paddingPercent = 1) {
+    const width = bb.xMax - bb.xMin;
+    const height = bb.yMax - bb.yMin;
+    return [bb.xMax + (width / 100) * paddingPercent, bb.yMax + (height / 100) * paddingPercent * 0.9];
+}
+/**
+ * True if `bb` and `other` are completely disjoint.
+ * @param bb - the first bounding box.
+ * @param other - the second bounding box.
+ * @returns true when the two boxes do not overlap (empty boxes count as disjoint).
+ */
+export function isBBoxOut(bb, other) {
+    // Handles degenerate (empty) boxes by treating them as disjoint.
+    if (isEmpty(bb) || isEmpty(other))
+        return true;
+    return other.xMax < bb.xMin || other.xMin > bb.xMax || other.yMax < bb.yMin || other.yMin > bb.yMax;
+}
+/**
+ * True if the point lies inside (or on the boundary of) the box.
+ * @param bb - the bounding box to test against.
+ * @param pt - the 2D point to test, `[x, y]`.
+ * @returns true when `pt` is within (or on) the box.
+ */
+export function containsPoint(bb, pt) {
+    return (pt[0] >= bb.xMin && pt[0] <= bb.xMax && pt[1] >= bb.yMin && pt[1] <= bb.yMax);
+}
+//# sourceMappingURL=bbox2d.js.map

package/dist/geometry2d/bbox2d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bbox2d.js","sourceRoot":"","sources":["../../src/geometry2d/bbox2d.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AASH;;;GAGG;AACH,MAAM,UAAU,YAAY;IAC1B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAA;AAC7E,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,EAAU;IAChC,OAAO,CACL,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC;QACpF,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CACvC,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,EAAU,EAAE,GAA6C;IACjF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI;YAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAA;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI;YAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAA;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI;YAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAA;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI;YAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAA;IAC9B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,EAAU,EAAE,KAAa;IACjD,IAAI,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI;QAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;IAC9C,IAAI,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI;QAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;IAC9C,IAAI,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI;QAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;IAC9C,IAAI,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI;QAAE,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,EAAU;IACjC,OAAO;QACL,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC;QAClB,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC;KACnB,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,EAAU;IACjC,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;AAC3D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,EAAU;IAChC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;AACpC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,EAAU;IACjC,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;AACpC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,EAAU,EAAE,cAAc,GAAG,CAAC;IAC3D,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAA;IAC/B,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAA;IAChC,OAAO,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,cAAc,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,cAAc,GAAG,GAAG,CAAC,CAAA;AACpG,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,EAAU,EAAE,KAAa;IACjD,iEAAiE;IACjE,IAAI,OAAO,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IAC9C,OAAO,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAA;AACrG,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,EAAU,EAAE,EAA6B;IACrE,OAAO,CACL,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAC7E,CAAA;AACH,CAAC","sourcesContent":["/**\n * Axis-aligned 2D bounding box (pure-data; faijs port of brepjs `BoundingBox2d`).\n * brepjs backs this with a kernel `Bnd_Box2d`; here it's plain numbers.\n *\n * License: adapted from brepjs (Apache-2.0).\n * @module\n */\n\nexport interface BBox2d {\n  xMin: number\n  yMin: number\n  xMax: number\n  yMax: number\n}\n\n/**\n * Create an empty (inverted) bounding box.\n * @returns a fresh BBox2d whose mins are +Infinity and maxes are -Infinity.\n */\nexport function createBBox2d(): BBox2d {\n  return { xMin: Infinity, yMin: Infinity, xMax: -Infinity, yMax: -Infinity }\n}\n\n/**\n * True when the box holds no finite extent yet.\n * @param bb - the bounding box to test.\n * @returns true when any corner is non-finite or the box is inverted.\n */\nexport function isEmpty(bb: BBox2d): boolean {\n  return (\n    !isFinite(bb.xMin) || !isFinite(bb.yMin) || !isFinite(bb.xMax) || !isFinite(bb.yMax) ||\n    bb.xMax < bb.xMin || bb.yMax < bb.yMin\n  )\n}\n\n/**\n * Expand `bb` to include the given corner points.\n * @param bb - the bounding box to expand in place.\n * @param pts - the corner points to include.\n */\nexport function addPoints(bb: BBox2d, pts: ReadonlyArray<readonly [number, number]>): void {\n  for (const [x, y] of pts) {\n    if (x < bb.xMin) bb.xMin = x\n    if (y < bb.yMin) bb.yMin = y\n    if (x > bb.xMax) bb.xMax = x\n    if (y > bb.yMax) bb.yMax = y\n  }\n}\n\n/**\n * Expand `bb` to include all points of `other`.\n * @param bb - the box to expand in place.\n * @param other - the box whose extent is folded into `bb`.\n */\nexport function mergeBBox(bb: BBox2d, other: BBox2d): void {\n  if (other.xMin < bb.xMin) bb.xMin = other.xMin\n  if (other.yMin < bb.yMin) bb.yMin = other.yMin\n  if (other.xMax > bb.xMax) bb.xMax = other.xMax\n  if (other.yMax > bb.yMax) bb.yMax = other.yMax\n}\n\n/**\n * Return `[min, max]` corner points.\n * @param bb - the bounding box to read from.\n * @returns the lower-left and upper-right corners as `[[xMin,yMin],[xMax,yMax]]`.\n */\nexport function boundsOf(bb: BBox2d): [[number, number], [number, number]] {\n  return [\n    [bb.xMin, bb.yMin],\n    [bb.xMax, bb.yMax],\n  ]\n}\n\n/**\n * Compute the center point of the box.\n * @param bb - the bounding box to read from.\n * @returns the midpoint `[x, y]` between the min and max corners.\n */\nexport function centerOf(bb: BBox2d): [number, number] {\n  return [(bb.xMin + bb.xMax) / 2, (bb.yMin + bb.yMax) / 2]\n}\n\n/**\n * Compute the width of the box.\n * @param bb - the bounding box to read from.\n * @returns the absolute horizontal extent.\n */\nexport function widthOf(bb: BBox2d): number {\n  return Math.abs(bb.xMax - bb.xMin)\n}\n\n/**\n * Compute the height of the box.\n * @param bb - the bounding box to read from.\n * @returns the absolute vertical extent.\n */\nexport function heightOf(bb: BBox2d): number {\n  return Math.abs(bb.yMax - bb.yMin)\n}\n\n/**\n * Point guaranteed outside (to the upper-right of) the box.\n * @param bb - the bounding box to read from.\n * @param paddingPercent - the padding as a percent of the box extent (default 1).\n * @returns a point offset to the upper-right of `bb`.\n */\nexport function outsidePointOf(bb: BBox2d, paddingPercent = 1): [number, number] {\n  const width = bb.xMax - bb.xMin\n  const height = bb.yMax - bb.yMin\n  return [bb.xMax + (width / 100) * paddingPercent, bb.yMax + (height / 100) * paddingPercent * 0.9]\n}\n\n/**\n * True if `bb` and `other` are completely disjoint.\n * @param bb - the first bounding box.\n * @param other - the second bounding box.\n * @returns true when the two boxes do not overlap (empty boxes count as disjoint).\n */\nexport function isBBoxOut(bb: BBox2d, other: BBox2d): boolean {\n  // Handles degenerate (empty) boxes by treating them as disjoint.\n  if (isEmpty(bb) || isEmpty(other)) return true\n  return other.xMax < bb.xMin || other.xMin > bb.xMax || other.yMax < bb.yMin || other.yMin > bb.yMax\n}\n\n/**\n * True if the point lies inside (or on the boundary of) the box.\n * @param bb - the bounding box to test against.\n * @param pt - the 2D point to test, `[x, y]`.\n * @returns true when `pt` is within (or on) the box.\n */\nexport function containsPoint(bb: BBox2d, pt: readonly [number, number]): boolean {\n  return (\n    pt[0] >= bb.xMin && pt[0] <= bb.xMax && pt[1] >= bb.yMin && pt[1] <= bb.yMax\n  )\n}"]}

package/dist/geometry2d/blueprint-sketcher.d.ts

@@ -0,0 +1,27 @@
+/**
+ * geometry2d — `BlueprintSketcher` (C2): a pen that packages its curves as a
+ * `Blueprint`.
+ *
+ * Ported from brepjs `2d/blueprints/blueprintSketcher.ts` (Apache-2.0). Built
+ * on the pure `BaseSketcher2d`. `done()` returns the still-open contour as a
+ * `Blueprint`; callers that want a closed contour draw the closing segment
+ * (the base `close()` does this) and wrap the result.
+ *
+ * @module
+ */
+import { Blueprint } from './blueprint.js';
+import { BaseSketcher2d } from './pen-sketcher.js';
+/**
+ * A `BaseSketcher2d` that packages the drawn contour as a `Blueprint`.
+ *
+ * Extends the pen with a `done()` result owner; closes still go through:
+ * `new Blueprint(pen.close())` yields the closed contour as a `Blueprint`.
+ */
+export declare class BlueprintSketcher extends BaseSketcher2d {
+    /**
+     * Package the accumulated curves as a `Blueprint` without closing.
+     * @returns the open Blueprint of the drawn contour.
+     */
+    done(): Blueprint;
+}
+//# sourceMappingURL=blueprint-sketcher.d.ts.map

package/dist/geometry2d/blueprint-sketcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blueprint-sketcher.d.ts","sourceRoot":"","sources":["../../src/geometry2d/blueprint-sketcher.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAE/C;;;;;GAKG;AACH,qBAAa,iBAAkB,SAAQ,cAAc;IACnD;;;OAGG;IACH,IAAI,IAAI,SAAS;CAGlB"}

package/dist/geometry2d/blueprint-sketcher.js

@@ -0,0 +1,29 @@
+/**
+ * geometry2d — `BlueprintSketcher` (C2): a pen that packages its curves as a
+ * `Blueprint`.
+ *
+ * Ported from brepjs `2d/blueprints/blueprintSketcher.ts` (Apache-2.0). Built
+ * on the pure `BaseSketcher2d`. `done()` returns the still-open contour as a
+ * `Blueprint`; callers that want a closed contour draw the closing segment
+ * (the base `close()` does this) and wrap the result.
+ *
+ * @module
+ */
+import { Blueprint } from './blueprint.js';
+import { BaseSketcher2d } from './pen-sketcher.js';
+/**
+ * A `BaseSketcher2d` that packages the drawn contour as a `Blueprint`.
+ *
+ * Extends the pen with a `done()` result owner; closes still go through:
+ * `new Blueprint(pen.close())` yields the closed contour as a `Blueprint`.
+ */
+export class BlueprintSketcher extends BaseSketcher2d {
+    /**
+     * Package the accumulated curves as a `Blueprint` without closing.
+     * @returns the open Blueprint of the drawn contour.
+     */
+    done() {
+        return new Blueprint([...this.pendingCurves]);
+    }
+}
+//# sourceMappingURL=blueprint-sketcher.js.map

package/dist/geometry2d/blueprint-sketcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blueprint-sketcher.js","sourceRoot":"","sources":["../../src/geometry2d/blueprint-sketcher.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACvC,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAE/C;;;;;GAKG;AACH,MAAM,OAAO,iBAAkB,SAAQ,cAAc;IACnD;;;OAGG;IACH,IAAI;QACF,OAAO,IAAI,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAA;IAC/C,CAAC;CACF","sourcesContent":["/**\n * geometry2d — `BlueprintSketcher` (C2): a pen that packages its curves as a\n * `Blueprint`.\n *\n * Ported from brepjs `2d/blueprints/blueprintSketcher.ts` (Apache-2.0). Built\n * on the pure `BaseSketcher2d`. `done()` returns the still-open contour as a\n * `Blueprint`; callers that want a closed contour draw the closing segment\n * (the base `close()` does this) and wrap the result.\n *\n * @module\n */\n\nimport { Blueprint } from './blueprint'\nimport { BaseSketcher2d } from './pen-sketcher'\n\n/**\n * A `BaseSketcher2d` that packages the drawn contour as a `Blueprint`.\n *\n * Extends the pen with a `done()` result owner; closes still go through:\n * `new Blueprint(pen.close())` yields the closed contour as a `Blueprint`.\n */\nexport class BlueprintSketcher extends BaseSketcher2d {\n  /**\n   * Package the accumulated curves as a `Blueprint` without closing.\n   * @returns the open Blueprint of the drawn contour.\n   */\n  done(): Blueprint {\n    return new Blueprint([...this.pendingCurves])\n  }\n}"]}

package/dist/geometry2d/blueprint.d.ts

@@ -0,0 +1,102 @@
+/**
+ * Blueprint — ordered 2D profile of `Curve2dObj` segments (pure-data port of
+ * brepjs `Blueprint`, Apache-2.0).
+ *
+ * Key adaptation: brepjs stores kernel-backed `Curve2D` handles that must be
+ * disposed; faijs stores plain `Curve2dObj` objects (no handles, no dispose).
+ * Kernel-coupling methods (sketchOnPlane / sketchOnFace / subFace / punchHole)
+ * intentionally live in `geometry2d/bridge`, not here.
+ *
+ * @module
+ */
+import type { Curve2dObj } from './curve2d.js';
+import { type BBox2d } from './bbox2d.js';
+/** 2D point. */
+export type Point2 = [number, number];
+/**
+ * True when `(x,y)` is within `tol` of curve `c`.
+ * @param c - the curve to test against.
+ * @param pt - the 2D point to test, `[x, y]`.
+ * @param tol - the distance tolerance (default 1e-9).
+ * @returns true when the point lies within `tol` of the curve.
+ */
+export declare function isOnCurve(c: Curve2dObj, pt: readonly [number, number], tol?: number): boolean;
+/**
+ * A planar 2D profile = an ordered sequence of 2D curves.
+ * Shared base for `cad.profile`, `cad.draw` and (solved) `cad.sketch` outputs on
+ * their way to `sketchOnPlane`/`sketchOnFace`.
+ */
+export declare class Blueprint {
+    /** Ordered 2D curve segments composing this blueprint. */
+    readonly curves: Curve2dObj[];
+    private _bbox;
+    private _orientation;
+    private _guessedOrientation;
+    constructor(curves: Curve2dObj[]);
+    /**
+     * Return a shallow copy of this blueprint (new container, same curve objects).
+     * @returns a new Blueprint with the same curves.
+     */
+    clone(): Blueprint;
+    /** Bounding box (cached). */
+    get boundingBox(): BBox2d;
+    /** Winding orientation via shoelace (curve midpoints for non-lines). */
+    get orientation(): 'clockwise' | 'counterClockwise';
+    /**
+     * Scale the blueprint about a center point.
+     * @param factor - the scale factor to apply.
+     * @param center - the scaling center `[x, y]` (defaults to the bounding-box center).
+     * @returns a new Blueprint with every curve scaled about the center.
+     */
+    scale(factor: number, center?: Point2): Blueprint;
+    /**
+     * Translate the whole blueprint by a delta.
+     * @param dxOrPoint - the x delta, or a full `[dx, dy]` offset point.
+     * @param dy - the y delta (default 0, ignored when `dxOrPoint` is a point).
+     * @returns a new Blueprint with every curve translated.
+     */
+    translate(dxOrPoint: number | Point2, dy?: number): Blueprint;
+    /**
+     * Rotate the whole blueprint about a center point.
+     * @param angleDeg - the rotation angle in degrees.
+     * @param center - the rotation center `[x, y]` (defaults to the origin).
+     * @returns a new Blueprint with every curve rotated.
+     */
+    rotate(angleDeg: number, center?: Point2): Blueprint;
+    /**
+     * Mirror the whole blueprint.
+     * @param centerOrDirection - the mirror center (mode `center`) or the mirror axis direction.
+     * @param origin - the axis origin `[x, y]` when mirroring across a plane (defaults to the origin).
+     * @param mode - `center` mirrors about a point; `plane` mirrors across an axis.
+     * @returns a new Blueprint with every curve mirrored.
+     */
+    mirror(centerOrDirection: Point2, origin?: Point2, mode?: 'center' | 'plane'): Blueprint;
+    /**
+     * The starting point of the first curve.
+     * @returns the 2D point where this blueprint begins.
+     */
+    get firstPoint(): Point2;
+    /**
+     * The ending point of the last curve.
+     * @returns the 2D point where this blueprint ends.
+     */
+    get lastPoint(): Point2;
+    /**
+     * True when the profile closes back on itself.
+     * @returns true when the first and last points coincide.
+     */
+    isClosed(): boolean;
+    /**
+     * True when a point is strictly inside (ray-cast); false on the boundary.
+     * @param point - the 2D point to test, `[x, y]`.
+     * @returns true when the point is strictly inside, false on/outside the boundary.
+     */
+    isInside(point: readonly [number, number]): boolean;
+    /**
+     * True when any curve of `this` intersects any curve of `other`.
+     * @param other - the blueprint to test for intersections against.
+     * @returns true when any pair of curves intersects.
+     */
+    intersects(other: Blueprint): boolean;
+}
+//# sourceMappingURL=blueprint.d.ts.map

package/dist/geometry2d/blueprint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blueprint.d.ts","sourceRoot":"","sources":["../../src/geometry2d/blueprint.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAA;AAE3C,OAAO,EAAgE,KAAK,MAAM,EAAE,MAAM,UAAU,CAAA;AAEpG,gBAAgB;AAChB,MAAM,MAAM,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAcrC;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,GAAG,SAAO,GAAG,OAAO,CAa3F;AAED;;;;GAIG;AACH,qBAAa,SAAS;IACpB,0DAA0D;IAC1D,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,CAAA;IAE7B,OAAO,CAAC,KAAK,CAAsB;IACnC,OAAO,CAAC,YAAY,CAAgD;IACpE,OAAO,CAAC,mBAAmB,CAAgD;gBAE/D,MAAM,EAAE,UAAU,EAAE;IAKhC;;;OAGG;IACH,KAAK,IAAI,SAAS;IAIlB,6BAA6B;IAC7B,IAAI,WAAW,IAAI,MAAM,CAOxB;IAED,wEAAwE;IACxE,IAAI,WAAW,IAAI,WAAW,GAAG,kBAAkB,CAiBlD;IAED;;;;;OAKG;IACH,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS;IAKjD;;;;;OAKG;IACH,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS;IAK7D;;;;;OAKG;IACH,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS;IAMpD;;;;;;OAMG;IACH,MAAM,CAAC,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,GAAE,QAAQ,GAAG,OAAkB,GAAG,SAAS;IAUlG;;;OAGG;IACH,IAAI,UAAU,IAAI,MAAM,CAEvB;IAED;;;OAGG;IACH,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED;;;OAGG;IACH,QAAQ,IAAI,OAAO;IAMnB;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,OAAO;IAsBnD;;;;OAIG;IACH,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;CAWtC"}

package/dist/geometry2d/blueprint.js

@@ -0,0 +1,225 @@
+import { addCurveToBBox, evaluateCurve2d, curveBounds, intersectCurves2dFn, makeLine2d, mirrorAcrossAxis, mirrorAtPoint, rotateCurve2d, scaleCurve2d, translateCurve2d } from './curve2d.js';
+import { centerOf, createBBox2d, isBBoxOut, mergeBBox, outsidePointOf } from './bbox2d.js';
+// `addCurveToBBox` writes xMin/yMin/xMax/yMax — same fields as BBox2d, so the
+// structural subtype is satisfied by passing a plain BBox2d.
+function curveBBox(c) {
+    const bb = createBBox2d();
+    addCurveToBBox(bb, c, 1e-9);
+    return bb;
+}
+function containsBoxPoint(bb, pt) {
+    return pt[0] >= bb.xMin && pt[0] <= bb.xMax && pt[1] >= bb.yMin && pt[1] <= bb.yMax;
+}
+/**
+ * True when `(x,y)` is within `tol` of curve `c`.
+ * @param c - the curve to test against.
+ * @param pt - the 2D point to test, `[x, y]`.
+ * @param tol - the distance tolerance (default 1e-9).
+ * @returns true when the point lies within `tol` of the curve.
+ */
+export function isOnCurve(c, pt, tol = 1e-9) {
+    const bb = curveBBox(c);
+    if (!containsBoxPoint(bb, pt))
+        return false;
+    const b = curveBounds(c);
+    const N = 32;
+    let best = Infinity;
+    for (let i = 0; i <= N; i++) {
+        const t = b.first + ((b.last - b.first) * i) / N;
+        const [px, py] = evaluateCurve2d(c, t);
+        const d2 = (px - pt[0]) ** 2 + (py - pt[1]) ** 2;
+        if (d2 < best)
+            best = d2;
+    }
+    return best <= tol * tol;
+}
+/**
+ * A planar 2D profile = an ordered sequence of 2D curves.
+ * Shared base for `cad.profile`, `cad.draw` and (solved) `cad.sketch` outputs on
+ * their way to `sketchOnPlane`/`sketchOnFace`.
+ */
+export class Blueprint {
+    /** Ordered 2D curve segments composing this blueprint. */
+    curves;
+    _bbox = null;
+    _orientation = null;
+    _guessedOrientation = null;
+    constructor(curves) {
+        if (curves.length === 0)
+            throw new Error('Blueprint requires at least one curve');
+        this.curves = curves;
+    }
+    /**
+     * Return a shallow copy of this blueprint (new container, same curve objects).
+     * @returns a new Blueprint with the same curves.
+     */
+    clone() {
+        return new Blueprint([...this.curves]);
+    }
+    /** Bounding box (cached). */
+    get boundingBox() {
+        if (!this._bbox) {
+            const bb = createBBox2d();
+            for (const c of this.curves)
+                mergeBBox(bb, curveBBox(c));
+            this._bbox = bb;
+        }
+        return this._bbox;
+    }
+    /** Winding orientation via shoelace (curve midpoints for non-lines). */
+    get orientation() {
+        if (this._orientation)
+            return this._orientation;
+        if (this._guessedOrientation)
+            return this._guessedOrientation;
+        const vertices = [];
+        for (const c of this.curves) {
+            const b = curveBounds(c);
+            vertices.push(firstPointOf(c));
+            if (c.kind2d !== 'line')
+                vertices.push(evaluate(c, (b.first + b.last) / 2));
+        }
+        let area = 0;
+        for (let i = 0; i < vertices.length; i++) {
+            const v1 = vertices[i];
+            const v2 = vertices[(i + 1) % vertices.length];
+            area += (v2[0] - v1[0]) * (v2[1] + v1[1]);
+        }
+        this._guessedOrientation = area > 0 ? 'clockwise' : 'counterClockwise';
+        return this._guessedOrientation;
+    }
+    /**
+     * Scale the blueprint about a center point.
+     * @param factor - the scale factor to apply.
+     * @param center - the scaling center `[x, y]` (defaults to the bounding-box center).
+     * @returns a new Blueprint with every curve scaled about the center.
+     */
+    scale(factor, center) {
+        const [cx, cy] = center ?? centerOf(this.boundingBox);
+        return new Blueprint(this.curves.map((c) => scaleCurve2d(c, factor, cx, cy)));
+    }
+    /**
+     * Translate the whole blueprint by a delta.
+     * @param dxOrPoint - the x delta, or a full `[dx, dy]` offset point.
+     * @param dy - the y delta (default 0, ignored when `dxOrPoint` is a point).
+     * @returns a new Blueprint with every curve translated.
+     */
+    translate(dxOrPoint, dy) {
+        const [dx, yy] = typeof dxOrPoint === 'number' ? [dxOrPoint, dy ?? 0] : [dxOrPoint[0], dxOrPoint[1]];
+        return new Blueprint(this.curves.map((c) => translateCurve2d(c, dx, yy)));
+    }
+    /**
+     * Rotate the whole blueprint about a center point.
+     * @param angleDeg - the rotation angle in degrees.
+     * @param center - the rotation center `[x, y]` (defaults to the origin).
+     * @returns a new Blueprint with every curve rotated.
+     */
+    rotate(angleDeg, center) {
+        const a = (angleDeg * Math.PI) / 180;
+        const [cx, cy] = center ?? [0, 0];
+        return new Blueprint(this.curves.map((c) => rotateCurve2d(c, a, cx, cy)));
+    }
+    /**
+     * Mirror the whole blueprint.
+     * @param centerOrDirection - the mirror center (mode `center`) or the mirror axis direction.
+     * @param origin - the axis origin `[x, y]` when mirroring across a plane (defaults to the origin).
+     * @param mode - `center` mirrors about a point; `plane` mirrors across an axis.
+     * @returns a new Blueprint with every curve mirrored.
+     */
+    mirror(centerOrDirection, origin, mode = 'center') {
+        if (mode === 'plane') {
+            const [ox, oy] = origin ?? [0, 0];
+            const [dx, dy] = centerOrDirection;
+            return new Blueprint(this.curves.map((c) => mirrorAcrossAxis(c, ox, oy, dx, dy)));
+        }
+        const [cx, cy] = centerOrDirection;
+        return new Blueprint(this.curves.map((c) => mirrorAtPoint(c, cx, cy)));
+    }
+    /**
+     * The starting point of the first curve.
+     * @returns the 2D point where this blueprint begins.
+     */
+    get firstPoint() {
+        return firstPointOf(this.curves[0]);
+    }
+    /**
+     * The ending point of the last curve.
+     * @returns the 2D point where this blueprint ends.
+     */
+    get lastPoint() {
+        return lastPointOf(this.curves[this.curves.length - 1]);
+    }
+    /**
+     * True when the profile closes back on itself.
+     * @returns true when the first and last points coincide.
+     */
+    isClosed() {
+        const fp = this.firstPoint;
+        const lp = this.lastPoint;
+        return Math.abs(fp[0] - lp[0]) < 1e-9 && Math.abs(fp[1] - lp[1]) < 1e-9;
+    }
+    /**
+     * True when a point is strictly inside (ray-cast); false on the boundary.
+     * @param point - the 2D point to test, `[x, y]`.
+     * @returns true when the point is strictly inside, false on/outside the boundary.
+     */
+    isInside(point) {
+        const bbox = this.boundingBox;
+        const p = [point[0], point[1]];
+        if (!containsBoxPoint(bbox, p))
+            return false;
+        if (this.curves.some((c) => isOnCurve(c, p)))
+            return false;
+        const outside = outsidePointOf(bbox);
+        const segment = makeLine2d(p[0], p[1], outside[0], outside[1]);
+        const seen = [];
+        let crossCount = 0;
+        for (const c of this.curves) {
+            if (isBBoxOut(curveBBox(segment), curveBBox(c)))
+                continue;
+            const r = intersectCurves2dFn(segment, c, 1e-9);
+            for (const pt of r.points) {
+                if (!seen.some((s) => samePoint(s, pt))) {
+                    seen.push(pt);
+                    crossCount++;
+                }
+            }
+        }
+        return crossCount % 2 === 1;
+    }
+    /**
+     * True when any curve of `this` intersects any curve of `other`.
+     * @param other - the blueprint to test for intersections against.
+     * @returns true when any pair of curves intersects.
+     */
+    intersects(other) {
+        if (isBBoxOut(this.boundingBox, other.boundingBox))
+            return false;
+        for (const a of this.curves) {
+            for (const b of other.curves) {
+                if (isBBoxOut(curveBBox(a), curveBBox(b)))
+                    continue;
+                const r = intersectCurves2dFn(a, b, 1e-9);
+                if (r.points.length || r.segments.length)
+                    return true;
+            }
+        }
+        return false;
+    }
+}
+// ---------------------------------------------------------------------------
+// Pure helpers
+// ---------------------------------------------------------------------------
+function evaluate(c, t) {
+    return evaluateCurve2d(c, t);
+}
+function firstPointOf(c) {
+    return evaluateCurve2d(c, curveBounds(c).first);
+}
+function lastPointOf(c) {
+    return evaluateCurve2d(c, curveBounds(c).last);
+}
+function samePoint(a, b, tol = 1e-9) {
+    return Math.abs(a[0] - b[0]) < tol && Math.abs(a[1] - b[1]) < tol;
+}
+//# sourceMappingURL=blueprint.js.map

package/dist/geometry2d/blueprint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blueprint.js","sourceRoot":"","sources":["../../src/geometry2d/blueprint.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,WAAW,EAAE,mBAAmB,EAAE,UAAU,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAA;AACzL,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,EAAe,MAAM,UAAU,CAAA;AAKpG,8EAA8E;AAC9E,6DAA6D;AAC7D,SAAS,SAAS,CAAC,CAAa;IAC9B,MAAM,EAAE,GAAG,YAAY,EAAE,CAAA;IACzB,cAAc,CAAC,EAAW,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;IACpC,OAAO,EAAE,CAAA;AACX,CAAC;AAED,SAAS,gBAAgB,CAAC,EAAU,EAAE,EAA6B;IACjE,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAA;AACrF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,CAAa,EAAE,EAA6B,EAAE,GAAG,GAAG,IAAI;IAChF,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IACvB,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC;QAAE,OAAO,KAAK,CAAA;IAC3C,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;IACxB,MAAM,CAAC,GAAG,EAAE,CAAA;IACZ,IAAI,IAAI,GAAG,QAAQ,CAAA;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAChD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACtC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAChD,IAAI,EAAE,GAAG,IAAI;YAAE,IAAI,GAAG,EAAE,CAAA;IAC1B,CAAC;IACD,OAAO,IAAI,IAAI,GAAG,GAAG,GAAG,CAAA;AAC1B,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,SAAS;IACpB,0DAA0D;IACjD,MAAM,CAAc;IAErB,KAAK,GAAkB,IAAI,CAAA;IAC3B,YAAY,GAA4C,IAAI,CAAA;IAC5D,mBAAmB,GAA4C,IAAI,CAAA;IAE3E,YAAY,MAAoB;QAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAA;QACjF,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;IACtB,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,OAAO,IAAI,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAA;IACxC,CAAC;IAED,6BAA6B;IAC7B,IAAI,WAAW;QACb,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,EAAE,GAAG,YAAY,EAAE,CAAA;YACzB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM;gBAAE,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;YACxD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAA;QACjB,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED,wEAAwE;IACxE,IAAI,WAAW;QACb,IAAI,IAAI,CAAC,YAAY;YAAE,OAAO,IAAI,CAAC,YAAY,CAAA;QAC/C,IAAI,IAAI,CAAC,mBAAmB;YAAE,OAAO,IAAI,CAAC,mBAAmB,CAAA;QAC7D,MAAM,QAAQ,GAAa,EAAE,CAAA;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;YACxB,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;YAC9B,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM;gBAAE,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAW,CAAC,CAAA;QACvF,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAA;YACvB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAE,CAAA;YAC/C,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3C,CAAC;QACD,IAAI,CAAC,mBAAmB,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,kBAAkB,CAAA;QACtE,OAAO,IAAI,CAAC,mBAAmB,CAAA;IACjC,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,MAAc,EAAE,MAAe;QACnC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;QACrD,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IAC/E,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,SAA0B,EAAE,EAAW;QAC/C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;QACpG,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IAC3E,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,QAAgB,EAAE,MAAe;QACtC,MAAM,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAA;QACpC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACjC,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IAC3E,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,iBAAyB,EAAE,MAAe,EAAE,OAA2B,QAAQ;QACpF,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YACrB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACjC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,iBAAiB,CAAA;YAClC,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;QACnF,CAAC;QACD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,iBAAiB,CAAA;QAClC,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IACxE,CAAC;IAED;;;OAGG;IACH,IAAI,UAAU;QACZ,OAAO,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAA;IACtC,CAAC;IAED;;;OAGG;IACH,IAAI,SAAS;QACX,OAAO,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,CAAA;IAC1D,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAA;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAA;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;IACzE,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,KAAgC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAA;QAC7B,MAAM,CAAC,GAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACtC,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QAC5C,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QAC1D,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAA;QACpC,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9D,MAAM,IAAI,GAAa,EAAE,CAAA;QACzB,IAAI,UAAU,GAAG,CAAC,CAAA;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,IAAI,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;gBAAE,SAAQ;YACzD,MAAM,CAAC,GAAG,mBAAmB,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;YAC/C,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;oBACxC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;oBACb,UAAU,EAAE,CAAA;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,UAAU,GAAG,CAAC,KAAK,CAAC,CAAA;IAC7B,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,KAAgB;QACzB,IAAI,SAAS,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;YAAE,OAAO,KAAK,CAAA;QAChE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC7B,IAAI,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;oBAAE,SAAQ;gBACnD,MAAM,CAAC,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;gBACzC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM;oBAAE,OAAO,IAAI,CAAA;YACvD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;CACF;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E,SAAS,QAAQ,CAAC,CAAa,EAAE,CAAS;IACxC,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC9B,CAAC;AAED,SAAS,YAAY,CAAC,CAAa;IACjC,OAAO,eAAe,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;AACjD,CAAC;AAED,SAAS,WAAW,CAAC,CAAa;IAChC,OAAO,eAAe,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;AAChD,CAAC;AAED,SAAS,SAAS,CAAC,CAA4B,EAAE,CAA4B,EAAE,GAAG,GAAG,IAAI;IACvF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;AACnE,CAAC","sourcesContent":["/**\n * Blueprint — ordered 2D profile of `Curve2dObj` segments (pure-data port of\n * brepjs `Blueprint`, Apache-2.0).\n *\n * Key adaptation: brepjs stores kernel-backed `Curve2D` handles that must be\n * disposed; faijs stores plain `Curve2dObj` objects (no handles, no dispose).\n * Kernel-coupling methods (sketchOnPlane / sketchOnFace / subFace / punchHole)\n * intentionally live in `geometry2d/bridge`, not here.\n *\n * @module\n */\nimport type { Curve2dObj } from './curve2d'\nimport { addCurveToBBox, evaluateCurve2d, curveBounds, intersectCurves2dFn, makeLine2d, mirrorAcrossAxis, mirrorAtPoint, rotateCurve2d, scaleCurve2d, translateCurve2d } from './curve2d'\nimport { centerOf, createBBox2d, isBBoxOut, mergeBBox, outsidePointOf, type BBox2d } from './bbox2d'\n\n/** 2D point. */\nexport type Point2 = [number, number]\n\n// `addCurveToBBox` writes xMin/yMin/xMax/yMax — same fields as BBox2d, so the\n// structural subtype is satisfied by passing a plain BBox2d.\nfunction curveBBox(c: Curve2dObj): BBox2d {\n  const bb = createBBox2d()\n  addCurveToBBox(bb as never, c, 1e-9)\n  return bb\n}\n\nfunction containsBoxPoint(bb: BBox2d, pt: readonly [number, number]): boolean {\n  return pt[0] >= bb.xMin && pt[0] <= bb.xMax && pt[1] >= bb.yMin && pt[1] <= bb.yMax\n}\n\n/**\n * True when `(x,y)` is within `tol` of curve `c`.\n * @param c - the curve to test against.\n * @param pt - the 2D point to test, `[x, y]`.\n * @param tol - the distance tolerance (default 1e-9).\n * @returns true when the point lies within `tol` of the curve.\n */\nexport function isOnCurve(c: Curve2dObj, pt: readonly [number, number], tol = 1e-9): boolean {\n  const bb = curveBBox(c)\n  if (!containsBoxPoint(bb, pt)) return false\n  const b = curveBounds(c)\n  const N = 32\n  let best = Infinity\n  for (let i = 0; i <= N; i++) {\n    const t = b.first + ((b.last - b.first) * i) / N\n    const [px, py] = evaluateCurve2d(c, t)\n    const d2 = (px - pt[0]) ** 2 + (py - pt[1]) ** 2\n    if (d2 < best) best = d2\n  }\n  return best <= tol * tol\n}\n\n/**\n * A planar 2D profile = an ordered sequence of 2D curves.\n * Shared base for `cad.profile`, `cad.draw` and (solved) `cad.sketch` outputs on\n * their way to `sketchOnPlane`/`sketchOnFace`.\n */\nexport class Blueprint {\n  /** Ordered 2D curve segments composing this blueprint. */\n  readonly curves: Curve2dObj[]\n\n  private _bbox: BBox2d | null = null\n  private _orientation: 'clockwise' | 'counterClockwise' | null = null\n  private _guessedOrientation: 'clockwise' | 'counterClockwise' | null = null\n\n  constructor(curves: Curve2dObj[]) {\n    if (curves.length === 0) throw new Error('Blueprint requires at least one curve')\n    this.curves = curves\n  }\n\n  /**\n   * Return a shallow copy of this blueprint (new container, same curve objects).\n   * @returns a new Blueprint with the same curves.\n   */\n  clone(): Blueprint {\n    return new Blueprint([...this.curves])\n  }\n\n  /** Bounding box (cached). */\n  get boundingBox(): BBox2d {\n    if (!this._bbox) {\n      const bb = createBBox2d()\n      for (const c of this.curves) mergeBBox(bb, curveBBox(c))\n      this._bbox = bb\n    }\n    return this._bbox\n  }\n\n  /** Winding orientation via shoelace (curve midpoints for non-lines). */\n  get orientation(): 'clockwise' | 'counterClockwise' {\n    if (this._orientation) return this._orientation\n    if (this._guessedOrientation) return this._guessedOrientation\n    const vertices: Point2[] = []\n    for (const c of this.curves) {\n      const b = curveBounds(c)\n      vertices.push(firstPointOf(c))\n      if (c.kind2d !== 'line') vertices.push(evaluate(c, (b.first + b.last) / 2) as Point2)\n    }\n    let area = 0\n    for (let i = 0; i < vertices.length; i++) {\n      const v1 = vertices[i]!\n      const v2 = vertices[(i + 1) % vertices.length]!\n      area += (v2[0] - v1[0]) * (v2[1] + v1[1])\n    }\n    this._guessedOrientation = area > 0 ? 'clockwise' : 'counterClockwise'\n    return this._guessedOrientation\n  }\n\n  /**\n   * Scale the blueprint about a center point.\n   * @param factor - the scale factor to apply.\n   * @param center - the scaling center `[x, y]` (defaults to the bounding-box center).\n   * @returns a new Blueprint with every curve scaled about the center.\n   */\n  scale(factor: number, center?: Point2): Blueprint {\n    const [cx, cy] = center ?? centerOf(this.boundingBox)\n    return new Blueprint(this.curves.map((c) => scaleCurve2d(c, factor, cx, cy)))\n  }\n\n  /**\n   * Translate the whole blueprint by a delta.\n   * @param dxOrPoint - the x delta, or a full `[dx, dy]` offset point.\n   * @param dy - the y delta (default 0, ignored when `dxOrPoint` is a point).\n   * @returns a new Blueprint with every curve translated.\n   */\n  translate(dxOrPoint: number | Point2, dy?: number): Blueprint {\n    const [dx, yy] = typeof dxOrPoint === 'number' ? [dxOrPoint, dy ?? 0] : [dxOrPoint[0], dxOrPoint[1]]\n    return new Blueprint(this.curves.map((c) => translateCurve2d(c, dx, yy)))\n  }\n\n  /**\n   * Rotate the whole blueprint about a center point.\n   * @param angleDeg - the rotation angle in degrees.\n   * @param center - the rotation center `[x, y]` (defaults to the origin).\n   * @returns a new Blueprint with every curve rotated.\n   */\n  rotate(angleDeg: number, center?: Point2): Blueprint {\n    const a = (angleDeg * Math.PI) / 180\n    const [cx, cy] = center ?? [0, 0]\n    return new Blueprint(this.curves.map((c) => rotateCurve2d(c, a, cx, cy)))\n  }\n\n  /**\n   * Mirror the whole blueprint.\n   * @param centerOrDirection - the mirror center (mode `center`) or the mirror axis direction.\n   * @param origin - the axis origin `[x, y]` when mirroring across a plane (defaults to the origin).\n   * @param mode - `center` mirrors about a point; `plane` mirrors across an axis.\n   * @returns a new Blueprint with every curve mirrored.\n   */\n  mirror(centerOrDirection: Point2, origin?: Point2, mode: 'center' | 'plane' = 'center'): Blueprint {\n    if (mode === 'plane') {\n      const [ox, oy] = origin ?? [0, 0]\n      const [dx, dy] = centerOrDirection\n      return new Blueprint(this.curves.map((c) => mirrorAcrossAxis(c, ox, oy, dx, dy)))\n    }\n    const [cx, cy] = centerOrDirection\n    return new Blueprint(this.curves.map((c) => mirrorAtPoint(c, cx, cy)))\n  }\n\n  /**\n   * The starting point of the first curve.\n   * @returns the 2D point where this blueprint begins.\n   */\n  get firstPoint(): Point2 {\n    return firstPointOf(this.curves[0]!)\n  }\n\n  /**\n   * The ending point of the last curve.\n   * @returns the 2D point where this blueprint ends.\n   */\n  get lastPoint(): Point2 {\n    return lastPointOf(this.curves[this.curves.length - 1]!)\n  }\n\n  /**\n   * True when the profile closes back on itself.\n   * @returns true when the first and last points coincide.\n   */\n  isClosed(): boolean {\n    const fp = this.firstPoint\n    const lp = this.lastPoint\n    return Math.abs(fp[0] - lp[0]) < 1e-9 && Math.abs(fp[1] - lp[1]) < 1e-9\n  }\n\n  /**\n   * True when a point is strictly inside (ray-cast); false on the boundary.\n   * @param point - the 2D point to test, `[x, y]`.\n   * @returns true when the point is strictly inside, false on/outside the boundary.\n   */\n  isInside(point: readonly [number, number]): boolean {\n    const bbox = this.boundingBox\n    const p: Point2 = [point[0], point[1]]\n    if (!containsBoxPoint(bbox, p)) return false\n    if (this.curves.some((c) => isOnCurve(c, p))) return false\n    const outside = outsidePointOf(bbox)\n    const segment = makeLine2d(p[0], p[1], outside[0], outside[1])\n    const seen: Point2[] = []\n    let crossCount = 0\n    for (const c of this.curves) {\n      if (isBBoxOut(curveBBox(segment), curveBBox(c))) continue\n      const r = intersectCurves2dFn(segment, c, 1e-9)\n      for (const pt of r.points) {\n        if (!seen.some((s) => samePoint(s, pt))) {\n          seen.push(pt)\n          crossCount++\n        }\n      }\n    }\n    return crossCount % 2 === 1\n  }\n\n  /**\n   * True when any curve of `this` intersects any curve of `other`.\n   * @param other - the blueprint to test for intersections against.\n   * @returns true when any pair of curves intersects.\n   */\n  intersects(other: Blueprint): boolean {\n    if (isBBoxOut(this.boundingBox, other.boundingBox)) return false\n    for (const a of this.curves) {\n      for (const b of other.curves) {\n        if (isBBoxOut(curveBBox(a), curveBBox(b))) continue\n        const r = intersectCurves2dFn(a, b, 1e-9)\n        if (r.points.length || r.segments.length) return true\n      }\n    }\n    return false\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Pure helpers\n// ---------------------------------------------------------------------------\n\nfunction evaluate(c: Curve2dObj, t: number): [number, number] {\n  return evaluateCurve2d(c, t)\n}\n\nfunction firstPointOf(c: Curve2dObj): Point2 {\n  return evaluateCurve2d(c, curveBounds(c).first)\n}\n\nfunction lastPointOf(c: Curve2dObj): Point2 {\n  return evaluateCurve2d(c, curveBounds(c).last)\n}\n\nfunction samePoint(a: readonly [number, number], b: readonly [number, number], tol = 1e-9): boolean {\n  return Math.abs(a[0] - b[0]) < tol && Math.abs(a[1] - b[1]) < tol\n}"]}

package/dist/geometry2d/blueprints.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Blueprints — collection of disjoint 2D profiles (pure-data port of brepjs,
+ * Apache-2.0). Typical result of boolean operations producing multiple regions.
+ * @module
+ */
+import { Blueprint, type Point2 } from './blueprint.js';
+import { CompoundBlueprint } from './compound-blueprint.js';
+import { type BBox2d } from './bbox2d.js';
+/**
+ * Blueprints — collection of disjoint 2D profiles.
+ * Typical result of boolean operations producing multiple independent regions.
+ */
+export declare class Blueprints {
+    /** The independent profiles in this collection. */
+    readonly blueprints: Array<Blueprint | CompoundBlueprint>;
+    private _bbox;
+    constructor(blueprints: Array<Blueprint | CompoundBlueprint>);
+    /**
+     * Return a copy of this collection.
+     * @returns a new Blueprints whose profiles are clones of the originals.
+     */
+    clone(): Blueprints;
+    /**
+     * Bounding box (cached). The box spanning all contained profiles.
+     * @returns a BBox2d enclosing every profile in this collection.
+     */
+    get boundingBox(): BBox2d;
+    /**
+     * Scale every profile about a center point.
+     * @param factor - the scale factor to apply.
+     * @param center - the scaling center `[x, y]` (defaults to the bounding-box center).
+     * @returns a new Blueprints with every profile scaled.
+     */
+    scale(factor: number, center?: Point2): Blueprints;
+    /**
+     * Translate every profile by a delta.
+     * @param dxOrPoint - the x delta, or a full `[dx, dy]` offset point.
+     * @param dy - the y delta (default 0, ignored when `dxOrPoint` is a point).
+     * @returns a new Blueprints with every profile translated.
+     */
+    translate(dxOrPoint: number | Point2, dy?: number): Blueprints;
+    /**
+     * Rotate every profile about a center point.
+     * @param angleDeg - the rotation angle in degrees.
+     * @param center - the rotation center `[x, y]` (defaults to the origin).
+     * @returns a new Blueprints with every profile rotated.
+     */
+    rotate(angleDeg: number, center?: Point2): Blueprints;
+    /**
+     * Mirror every profile.
+     * @param centerOrDirection - the mirror center (mode `center`) or the mirror axis direction.
+     * @param origin - the axis origin `[x, y]` when mirroring across a plane (defaults to the origin).
+     * @param mode - `center` mirrors about a point; `plane` mirrors across an axis.
+     * @returns a new Blueprints with every profile mirrored.
+     */
+    mirror(centerOrDirection: Point2, origin?: Point2, mode?: 'center' | 'plane'): Blueprints;
+}
+//# sourceMappingURL=blueprints.d.ts.map

package/dist/geometry2d/blueprints.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blueprints.d.ts","sourceRoot":"","sources":["../../src/geometry2d/blueprints.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,SAAS,EAAE,KAAK,MAAM,EAAE,MAAM,aAAa,CAAA;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AACxD,OAAO,EAAqC,KAAK,MAAM,EAAE,MAAM,UAAU,CAAA;AAEzE;;;GAGG;AACH,qBAAa,UAAU;IACrB,mDAAmD;IACnD,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC,SAAS,GAAG,iBAAiB,CAAC,CAAA;IAEzD,OAAO,CAAC,KAAK,CAAsB;gBAEvB,UAAU,EAAE,KAAK,CAAC,SAAS,GAAG,iBAAiB,CAAC;IAI5D;;;OAGG;IACH,KAAK,IAAI,UAAU;IAInB;;;OAGG;IACH,IAAI,WAAW,IAAI,MAAM,CAOxB;IAED;;;;;OAKG;IACH,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,UAAU;IAKlD;;;;;OAKG;IACH,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,UAAU;IAI9D;;;;;OAKG;IACH,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,UAAU;IAIrD;;;;;;OAMG;IACH,MAAM,CAAC,iBAAiB,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,GAAE,QAAQ,GAAG,OAAkB,GAAG,UAAU;CAGpG"}