pattapatta 0.3.0 → 0.4.0

package/dist/segmentSet/index.d.ts

@@ -1,5 +1,5 @@
-import { V as Vec2 } from '../vec2-CWyXN1Wj.js';
-import { S as Segment } from '../segment-BKuIFMKD.js';
+import { P as Path, V as Vec2 } from '../path-Boeshk9L.js';
+import { S as Segment } from '../segment-CpLILSd7.js';
 
 /**
  * Parallel segments through a center point (PGS `parallelSegments` semantics).
@@ -7,6 +7,41 @@ import { S as Segment } from '../segment-BKuIFMKD.js';
  * `angle` is radians along the segment; spacing is perpendicular.
  */
 declare function parallelSegments(centerX: number, centerY: number, length: number, spacing: number, angle: number, n: number): Segment[];
+/**
+ * Random non-intersecting segments in a box anchored at `(originX, originY)`
+ * with the given width/height (PGS `stochasticSegments`).
+ *
+ * Lengths are uniform in `[minLength, maxLength)` when the range differs;
+ * use equal min/max for fixed length. Seeded via mulberry32.
+ */
+declare function stochasticSegments(width: number, height: number, n: number, minLength?: number, maxLength?: number, seed?: number, originX?: number, originY?: number): Segment[];
+/**
+ * Fabric-like horizontal/vertical weave on a regular cell grid
+ * (PGS `weaveSegments` / ABC auxetics).
+ *
+ * Domain is `[originX, originX+width] × [originY, originY+height]`.
+ * A/B control weft/warp run lengths; C is the row phase shift (mod A+B).
+ */
+declare function weaveSegments(width: number, height: number, cellSize: number, A?: number, B?: number, C?: number, options?: WeaveSegmentsOptions): Segment[];
+type WeaveSegmentsOptions = {
+    originX?: number;
+    originY?: number;
+    /** Swap weft/warp roles. */
+    swapColors?: boolean;
+    /** Endpoint position inside run end cells (0.5..1 typical). Default `1`. */
+    cellFraction?: number;
+    /** Extend single-cell boundary runs to the grid edge. Default `true`. */
+    extendSingletonsToEdge?: boolean;
+};
+/** Per-sample length for {@link perpendicularPathSegments}. */
+type SegmentLengthFn = (x: number, y: number, posFrac: number, normalAngle: number) => number;
+/**
+ * Perpendicular ticks along each ring of `path`, centered on the boundary
+ * (PGS `perpendicularPathSegments`). Outline texture, not an area fill.
+ *
+ * Closed rings are oriented CW so the left-hand normal points outward.
+ */
+declare function perpendicularPathSegments(path: Path, interSegmentDistance: number, length: number | SegmentLengthFn, startOffset?: number): Segment[];
 declare function filterByMinLength(segments: Segment[], minLength: number): Segment[];
 declare function filterAxisAligned(segments: Segment[], angleDelta: number): Segment[];
 declare function segmentLength(s: Segment): number;
@@ -16,10 +51,13 @@ declare function segmentsToOpenPaths(segments: Segment[]): {
 }[];
 declare const segmentSet: {
     parallelSegments: typeof parallelSegments;
+    stochasticSegments: typeof stochasticSegments;
+    weaveSegments: typeof weaveSegments;
+    perpendicularPathSegments: typeof perpendicularPathSegments;
     filterByMinLength: typeof filterByMinLength;
     filterAxisAligned: typeof filterAxisAligned;
     segmentLength: typeof segmentLength;
     segmentsToOpenPaths: typeof segmentsToOpenPaths;
 };
 
-export { Vec2, filterAxisAligned, filterByMinLength, parallelSegments, segmentLength, segmentSet, segmentsToOpenPaths };
+export { type SegmentLengthFn, Vec2, type WeaveSegmentsOptions, filterAxisAligned, filterByMinLength, parallelSegments, perpendicularPathSegments, segmentLength, segmentSet, segmentsToOpenPaths, stochasticSegments, weaveSegments };

package/dist/segmentSet/index.js

@@ -73,6 +73,193 @@ function parallelSegments(centerX, centerY, length, spacing, angle, n) {
   }
   return edges;
 }
+function stochasticSegments(width, height, n, minLength, maxLength, seed = 1, originX = 0, originY = 0) {
+  const minL = minLength ?? 1;
+  const maxL = maxLength ?? Math.min(width, height);
+  if (n < 1 || width <= 0 || height <= 0) return [];
+  const monoLength = minL === maxL;
+  const rng = mulberry32(seed >>> 0);
+  const edges = [];
+  const maxAttempts = Math.max(1e4, n * 500);
+  let attempts = 0;
+  while (edges.length < n && attempts < maxAttempts) {
+    attempts++;
+    const length = monoLength ? minL : minL + rng() * (maxL - minL);
+    if (!(length > 0) || length * 2 >= width || length * 2 >= height) {
+      continue;
+    }
+    const ax = originX + rng() * (width - length * 2) + length;
+    const ay = originY + rng() * (height - length * 2) + length;
+    const theta = rng() * Math.PI * 2;
+    const bx = ax + Math.cos(theta) * length;
+    const by = ay + Math.sin(theta) * length;
+    const a = vec2(ax, ay);
+    const b = vec2(bx, by);
+    let hits = false;
+    for (const s of edges) {
+      if (segmentsIntersect(a, b, s.a, s.b)) {
+        hits = true;
+        break;
+      }
+    }
+    if (!hits) edges.push(segment(a, b));
+  }
+  return edges;
+}
+function weaveSegments(width, height, cellSize, A = 1, B = 1, C = 1, options = {}) {
+  if (!(cellSize > 0)) {
+    throw new Error("weaveSegments: cellSize must be > 0");
+  }
+  if (A <= 0 || B <= 0) {
+    throw new Error("weaveSegments: A and B must be > 0");
+  }
+  const {
+    originX = 0,
+    originY = 0,
+    swapColors = false,
+    cellFraction = 1,
+    extendSingletonsToEdge = true
+  } = options;
+  if (!(cellFraction > 0)) {
+    throw new Error("weaveSegments: cellFraction must be > 0");
+  }
+  const P = A + B;
+  const f = Math.max(0, Math.min(1, cellFraction));
+  const cols = Math.max(1, Math.floor(width / cellSize));
+  const rows = Math.max(1, Math.floor(height / cellSize));
+  const gridW = cols * cellSize;
+  const gridH = rows * cellSize;
+  const dx = originX + (width - gridW) * 0.5;
+  const dy = originY + (height - gridH) * 0.5;
+  const gridLeft = dx;
+  const gridRight = dx + gridW;
+  const gridBottom = dy;
+  const gridTop = dy + gridH;
+  const weft = Array.from(
+    { length: rows },
+    () => Array.from({ length: cols }, () => false)
+  );
+  for (let r = 0; r < rows; r++) {
+    const shift = floorMod(r * C, P);
+    for (let c = 0; c < cols; c++) {
+      const idx = floorMod(c + shift, P);
+      let isWeft = idx < A;
+      if (swapColors) isWeft = !isWeft;
+      weft[r][c] = isWeft;
+    }
+  }
+  const segs = [];
+  for (let r = 0; r < rows; r++) {
+    let c = 0;
+    while (c < cols) {
+      if (!weft[r][c]) {
+        c++;
+        continue;
+      }
+      const start = c;
+      while (c + 1 < cols && weft[r][c + 1]) c++;
+      const end = c;
+      const runLen = end - start + 1;
+      const y = dy + (r + 0.5) * cellSize;
+      let x0 = dx + (start + (1 - f)) * cellSize;
+      let x1 = dx + (end + f) * cellSize;
+      if (extendSingletonsToEdge && runLen === 1) {
+        const cx = dx + (start + 0.5) * cellSize;
+        if (start === 0) {
+          x0 = gridLeft;
+          x1 = cx;
+        } else if (end === cols - 1) {
+          x0 = cx;
+          x1 = gridRight;
+        }
+      }
+      x0 = clamp(x0, gridLeft, gridRight);
+      x1 = clamp(x1, gridLeft, gridRight);
+      segs.push(segment(vec2(x0, y), vec2(x1, y)));
+      c++;
+    }
+  }
+  for (let c = 0; c < cols; c++) {
+    let r = 0;
+    while (r < rows) {
+      if (weft[r][c]) {
+        r++;
+        continue;
+      }
+      const start = r;
+      while (r + 1 < rows && !weft[r + 1][c]) r++;
+      const end = r;
+      const runLen = end - start + 1;
+      const x = dx + (c + 0.5) * cellSize;
+      let y0 = dy + (start + (1 - f)) * cellSize;
+      let y1 = dy + (end + f) * cellSize;
+      if (extendSingletonsToEdge && runLen === 1) {
+        const cy = dy + (start + 0.5) * cellSize;
+        if (start === 0) {
+          y0 = gridBottom;
+          y1 = cy;
+        } else if (end === rows - 1) {
+          y0 = cy;
+          y1 = gridTop;
+        }
+      }
+      y0 = clamp(y0, gridBottom, gridTop);
+      y1 = clamp(y1, gridBottom, gridTop);
+      segs.push(segment(vec2(x, y0), vec2(x, y1)));
+      r++;
+    }
+  }
+  return segs;
+}
+function perpendicularPathSegments(path, interSegmentDistance, length, startOffset = 0) {
+  if (!(interSegmentDistance > 0)) return [];
+  const lengthFn = typeof length === "function" ? length : () => length;
+  const startNorm = (startOffset % 1 + 1) % 1;
+  const edges = [];
+  for (const ring of path.rings) {
+    if (ring.length < 2) continue;
+    const closed = path.closed;
+    let pts = ring.map((v) => vec2(v.x, v.y));
+    if (closed && shoelace(pts) > 0) {
+      pts = pts.slice().reverse();
+    }
+    const indexed = lengthIndex(pts, closed);
+    const end = indexed.total;
+    if (!(end > 0)) continue;
+    const count = Math.max(1, Math.round(end / interSegmentDistance));
+    const increment = 1 / count;
+    const eps = Math.max(
+      end * 1e-4,
+      Math.min(interSegmentDistance * 0.35, end * 0.01)
+    );
+    for (let i = 0; i < count; i++) {
+      const posFrac = (startNorm + i * increment) % 1;
+      const idx = posFrac * end;
+      const idxM = closed ? wrapIndex(idx - eps, end) : clamp(idx - eps, 0, end);
+      const idxP = closed ? wrapIndex(idx + eps, end) : clamp(idx + eps, 0, end);
+      const pm = indexed.pointAt(idxM);
+      const pp = indexed.pointAt(idxP);
+      const pc = indexed.pointAt(idx);
+      const tx = pp.x - pm.x;
+      const ty = pp.y - pm.y;
+      const tlen = Math.hypot(tx, ty);
+      if (tlen === 0) continue;
+      const nx = -ty / tlen;
+      const ny = tx / tlen;
+      const normalAngle = Math.atan2(ny, nx);
+      const L = lengthFn(pc.x, pc.y, posFrac, normalAngle);
+      if (!(L > 0)) continue;
+      const half = L * 0.5;
+      edges.push(
+        segment(
+          vec2(pc.x - nx * half, pc.y - ny * half),
+          vec2(pc.x + nx * half, pc.y + ny * half)
+        )
+      );
+    }
+  }
+  return edges;
+}
 function filterByMinLength(segments, minLength) {
   return segments.filter((s) => segmentLength(s) >= minLength);
 }
@@ -98,12 +285,85 @@ function segmentsToOpenPaths(segments) {
 }
 var segmentSet = {
   parallelSegments,
+  stochasticSegments,
+  weaveSegments,
+  perpendicularPathSegments,
   filterByMinLength,
   filterAxisAligned,
   segmentLength,
   segmentsToOpenPaths
 };
+function floorMod(n, m) {
+  return (n % m + m) % m;
+}
+function clamp(v, lo, hi) {
+  return Math.max(lo, Math.min(hi, v));
+}
+function wrapIndex(idx, end) {
+  if (end <= 0) return 0;
+  let x = idx % end;
+  if (x < 0) x += end;
+  return x;
+}
+function shoelace(ring) {
+  let sum = 0;
+  for (let i = 0; i < ring.length; i++) {
+    const a = ring[i];
+    const b = ring[(i + 1) % ring.length];
+    sum += a.x * b.y - b.x * a.y;
+  }
+  return sum / 2;
+}
+function segmentsIntersect(a, b, c, d) {
+  return ccw(a, c, d) !== ccw(b, c, d) && ccw(a, b, c) !== ccw(a, b, d);
+}
+function ccw(a, b, c) {
+  return (c.y - a.y) * (b.x - a.x) > (b.y - a.y) * (c.x - a.x);
+}
+function mulberry32(seed) {
+  return function() {
+    let t = seed += 1831565813;
+    t = Math.imul(t ^ t >>> 15, t | 1);
+    t ^= t + Math.imul(t ^ t >>> 7, t | 61);
+    return ((t ^ t >>> 14) >>> 0) / 4294967296;
+  };
+}
+function lengthIndex(ring, closed) {
+  const n = ring.length;
+  const edgeCount = closed ? n : n - 1;
+  const lengths = [];
+  let total = 0;
+  for (let i = 0; i < edgeCount; i++) {
+    const a = ring[i];
+    const b = ring[(i + 1) % n];
+    const L = Math.hypot(b.x - a.x, b.y - a.y);
+    lengths.push(L);
+    total += L;
+  }
+  return {
+    total,
+    pointAt(dist) {
+      let remain = dist;
+      if (remain <= 0) return { ...ring[0] };
+      if (remain >= total) return { ...ring[closed ? 0 : n - 1] };
+      for (let i = 0; i < lengths.length; i++) {
+        const L = lengths[i];
+        if (remain <= L || i === lengths.length - 1) {
+          const t = L < 1e-12 ? 0 : remain / L;
+          const a = ring[i];
+          const b = ring[(i + 1) % n];
+          return {
+            x: a.x + (b.x - a.x) * t,
+            y: a.y + (b.y - a.y) * t
+          };
+        }
+        remain -= L;
+      }
+      return { ...ring[0] };
+    }
+  };
+}
 
-export { filterAxisAligned, filterByMinLength, parallelSegments, segmentLength, segmentSet, segmentsToOpenPaths };
+export { filterAxisAligned, filterByMinLength, parallelSegments, perpendicularPathSegments, segmentLength, segmentSet, segmentsToOpenPaths, stochasticSegments, weaveSegments };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/segmentSet/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/types/vec2.ts","../../src/types/segment.ts","../../src/segmentSet/index.ts"],"names":[],"mappings":";AAMO,SAAS,IAAA,CAAK,GAAW,CAAA,EAAiB;AAC/C,EAAA,OAAO,EAAE,GAAG,CAAA,EAAE;AAChB;;;ACAO,SAAS,OAAA,CAAQ,GAAS,CAAA,EAAkB;AACjD,EAAA,OAAO,EAAE,GAAG,CAAA,EAAE;AAChB;;;ACNA,SAAS,IAAI,CAAA,EAAmB;AAC9B,EAAA,OAAO,IAAA,CAAK,OAAO,CAAC,CAAA;AACtB;AAOO,SAAS,iBACd,OAAA,EACA,OAAA,EACA,MAAA,EACA,OAAA,EACA,OACA,CAAA,EACW;AACX,EAAA,MAAM,QAAmB,EAAC;AAC1B,EAAA,IAAI,CAAA,GAAI,GAAG,OAAO,KAAA;AAElB,EAAA,MAAM,SAAS,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,EAAG,GAAA,CAAI,OAAO,CAAC,CAAA;AAC9C,EAAA,IAAI,EAAA,GAAK,IAAI,IAAA,CAAK,GAAA,CAAI,QAAQ,IAAA,CAAK,EAAA,GAAK,CAAC,CAAA,GAAI,OAAO,CAAA;AACpD,EAAA,IAAI,EAAA,GAAK,IAAI,IAAA,CAAK,GAAA,CAAI,QAAQ,IAAA,CAAK,EAAA,GAAK,CAAC,CAAA,GAAI,OAAO,CAAA;AACpD,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AAC/B,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AAC/B,EAAA,MAAM,CAAA,GAAI,IAAI,MAAM,CAAA;AAEpB,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,IAAA,GAAO,CAAA;AAEX,EAAA,IAAI,CAAA,GAAI,MAAM,CAAA,EAAG;AACf,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AAC/D,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,IAAI,GAAA,GAAM,CAAC,CAAC,CAAA,EAAG,IAAI,MAAA,CAAO,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjE,IAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AACxB,IAAA,CAAA,GAAI,CAAA;AAAA,EACN,CAAA,MAAO;AACL,IAAA,EAAA,GAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACf,IAAA,EAAA,GAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACf,IAAA,CAAA,GAAI,CAAA;AACJ,IAAA;AACE,MAAA,IAAI,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,CAAA,EAAG,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,CAAC,CAAA;AAC3D,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AACrD,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC1B;AACA,IAAA;AACE,MAAA,IAAI,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,IAAI,EAAA,GAAK,CAAC,CAAC,CAAA,EAAG,IAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,CAAC,CAAC,CAAA;AAC7D,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AACrD,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC1B;AACA,IAAA,CAAA,GAAI,CAAA;AACJ,IAAA,EAAA,GAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACf,IAAA,EAAA,GAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACf,IAAA,IAAA,GAAO,GAAA,CAAI,KAAK,CAAC,CAAA;AACjB,IAAA,IAAA,GAAO,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACnB;AAEA,EAAA,OAAO,IAAI,CAAA,GAAI,IAAA,CAAK,MAAM,CAAA,GAAI,CAAC,GAAG,CAAA,EAAA,EAAK;AACrC,IAAA;AACE,MAAA,IAAI,CAAA,GAAI,IAAA;AAAA,QACN,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,IAAI,IAAI,CAAA;AAAA,QAC5B,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,IAAI,IAAI;AAAA,OAC9B;AACA,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AACrD,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC1B;AACA,IAAA;AACE,MAAA,IAAI,CAAA,GAAI,IAAA;AAAA,QACN,IAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,IAAI,IAAI,CAAA;AAAA,QAC7B,IAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,IAAI,IAAI;AAAA,OAC/B;AACA,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AACrD,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC1B;AAAA,EACF;AAEA,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,iBAAA,CACd,UACA,SAAA,EACW;AACX,EAAA,OAAO,SAAS,MAAA,CAAO,CAAC,MAAM,aAAA,CAAc,CAAC,KAAK,SAAS,CAAA;AAC7D;AAEO,SAAS,iBAAA,CACd,UACA,UAAA,EACW;AACX,EAAA,OAAO,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM;AAC5B,IAAA,MAAM,MAAM,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA,CAAE,CAAC,CAAC,CAAA;AAC7D,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,GAAA,GAAM,IAAA,CAAK,IAAI,IAAA,CAAK,EAAA,GAAM,GAAA,GAAM,IAAA,CAAK,EAAG,CAAA;AAC9D,IAAA,MAAM,KAAA,GAAQ,QAAQ,UAAA,IAAc,IAAA,CAAK,IAAI,IAAA,GAAO,IAAA,CAAK,EAAE,CAAA,IAAK,UAAA;AAChE,IAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,OAAO,IAAA,CAAK,EAAA,GAAK,CAAC,CAAA,IAAK,UAAA;AAC9C,IAAA,OAAO,EAAE,KAAA,IAAS,KAAA,CAAA;AAAA,EACpB,CAAC,CAAA;AACH;AAEO,SAAS,cAAc,CAAA,EAAoB;AAChD,EAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,CAAE,CAAA;AACvB,EAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,CAAE,CAAA;AACvB,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAC1B;AAEO,SAAS,oBAAoB,QAAA,EAAqB;AACvD,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,IAC1B,OAAO,CAAC,CAAC,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAC,CAAA;AAAA,IAClB,MAAA,EAAQ;AAAA,GACV,CAAE,CAAA;AACJ;AAEO,IAAM,UAAA,GAAa;AAAA,EACxB,gBAAA;AAAA,EACA,iBAAA;AAAA,EACA,iBAAA;AAAA,EACA,aAAA;AAAA,EACA;AACF","file":"index.js","sourcesContent":["/** 2D point / vector. */\nexport type Vec2 = {\n  x: number\n  y: number\n}\n\nexport function vec2(x: number, y: number): Vec2 {\n  return { x, y }\n}\n\nexport function cloneVec2(v: Vec2): Vec2 {\n  return { x: v.x, y: v.y }\n}\n\nexport function equalsVec2(a: Vec2, b: Vec2, eps = 1e-9): boolean {\n  return Math.abs(a.x - b.x) <= eps && Math.abs(a.y - b.y) <= eps\n}\n","import type { Vec2 } from './vec2.js'\n\n/** Line segment between two points. */\nexport type Segment = {\n  a: Vec2\n  b: Vec2\n}\n\nexport function segment(a: Vec2, b: Vec2): Segment {\n  return { a, b }\n}\n","import type { Segment, Vec2 } from '../types/index.js'\nimport { segment, vec2 } from '../types/index.js'\n\n/** Match Processing `float` for PGS parity on hatch fixtures. */\nfunction f32(n: number): number {\n  return Math.fround(n)\n}\n\n/**\n * Parallel segments through a center point (PGS `parallelSegments` semantics).\n * `length` is the half-length along the segment direction; full span is `2 * length`.\n * `angle` is radians along the segment; spacing is perpendicular.\n */\nexport function parallelSegments(\n  centerX: number,\n  centerY: number,\n  length: number,\n  spacing: number,\n  angle: number,\n  n: number,\n): Segment[] {\n  const edges: Segment[] = []\n  if (n < 1) return edges\n\n  const center = vec2(f32(centerX), f32(centerY))\n  let dx = f32(Math.cos(angle + Math.PI / 2) * spacing)\n  let dy = f32(Math.sin(angle + Math.PI / 2) * spacing)\n  const cos = f32(Math.cos(angle))\n  const sin = f32(Math.sin(angle))\n  const l = f32(length)\n\n  let i: number\n  let offX = 0\n  let offY = 0\n\n  if (n % 2 === 1) {\n    const a = vec2(f32(center.x + cos * l), f32(center.y + sin * l))\n    const b = vec2(f32(center.x + cos * -l), f32(center.y + sin * -l))\n    edges.push(segment(a, b))\n    i = 1\n  } else {\n    dx = f32(dx / 2)\n    dy = f32(dy / 2)\n    i = 1\n    {\n      let a = vec2(f32(center.x + dx * i), f32(center.y + dy * i))\n      const b = vec2(f32(a.x + cos * l), f32(a.y + sin * l))\n      a = vec2(f32(a.x + cos * -l), f32(a.y + sin * -l))\n      edges.push(segment(a, b))\n    }\n    {\n      let a = vec2(f32(center.x + dx * -i), f32(center.y + dy * -i))\n      const b = vec2(f32(a.x + cos * l), f32(a.y + sin * l))\n      a = vec2(f32(a.x + cos * -l), f32(a.y + sin * -l))\n      edges.push(segment(a, b))\n    }\n    i = 2\n    dx = f32(dx * 2)\n    dy = f32(dy * 2)\n    offX = f32(dx / 2)\n    offY = f32(dy / 2)\n  }\n\n  for (; i < 1 + Math.floor(n / 2); i++) {\n    {\n      let a = vec2(\n        f32(center.x + dx * i - offX),\n        f32(center.y + dy * i - offY),\n      )\n      const b = vec2(f32(a.x + cos * l), f32(a.y + sin * l))\n      a = vec2(f32(a.x + cos * -l), f32(a.y + sin * -l))\n      edges.push(segment(a, b))\n    }\n    {\n      let a = vec2(\n        f32(center.x + dx * -i + offX),\n        f32(center.y + dy * -i + offY),\n      )\n      const b = vec2(f32(a.x + cos * l), f32(a.y + sin * l))\n      a = vec2(f32(a.x + cos * -l), f32(a.y + sin * -l))\n      edges.push(segment(a, b))\n    }\n  }\n\n  return edges\n}\n\nexport function filterByMinLength(\n  segments: Segment[],\n  minLength: number,\n): Segment[] {\n  return segments.filter((s) => segmentLength(s) >= minLength)\n}\n\nexport function filterAxisAligned(\n  segments: Segment[],\n  angleDelta: number,\n): Segment[] {\n  return segments.filter((s) => {\n    const ang = Math.abs(Math.atan2(s.b.y - s.a.y, s.b.x - s.a.x))\n    const norm = Math.min(ang % Math.PI, Math.PI - (ang % Math.PI))\n    const nearH = norm <= angleDelta || Math.abs(norm - Math.PI) <= angleDelta\n    const nearV = Math.abs(norm - Math.PI / 2) <= angleDelta\n    return !(nearH || nearV)\n  })\n}\n\nexport function segmentLength(s: Segment): number {\n  const dx = s.b.x - s.a.x\n  const dy = s.b.y - s.a.y\n  return Math.hypot(dx, dy)\n}\n\nexport function segmentsToOpenPaths(segments: Segment[]) {\n  return segments.map((s) => ({\n    rings: [[s.a, s.b]],\n    closed: false as const,\n  }))\n}\n\nexport const segmentSet = {\n  parallelSegments,\n  filterByMinLength,\n  filterAxisAligned,\n  segmentLength,\n  segmentsToOpenPaths,\n}\n\nexport type { Vec2 }\n"]}
+{"version":3,"sources":["../../src/types/vec2.ts","../../src/types/segment.ts","../../src/segmentSet/index.ts"],"names":[],"mappings":";AAMO,SAAS,IAAA,CAAK,GAAW,CAAA,EAAiB;AAC/C,EAAA,OAAO,EAAE,GAAG,CAAA,EAAE;AAChB;;;ACAO,SAAS,OAAA,CAAQ,GAAS,CAAA,EAAkB;AACjD,EAAA,OAAO,EAAE,GAAG,CAAA,EAAE;AAChB;;;ACNA,SAAS,IAAI,CAAA,EAAmB;AAC9B,EAAA,OAAO,IAAA,CAAK,OAAO,CAAC,CAAA;AACtB;AAOO,SAAS,iBACd,OAAA,EACA,OAAA,EACA,MAAA,EACA,OAAA,EACA,OACA,CAAA,EACW;AACX,EAAA,MAAM,QAAmB,EAAC;AAC1B,EAAA,IAAI,CAAA,GAAI,GAAG,OAAO,KAAA;AAElB,EAAA,MAAM,SAAS,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,EAAG,GAAA,CAAI,OAAO,CAAC,CAAA;AAC9C,EAAA,IAAI,EAAA,GAAK,IAAI,IAAA,CAAK,GAAA,CAAI,QAAQ,IAAA,CAAK,EAAA,GAAK,CAAC,CAAA,GAAI,OAAO,CAAA;AACpD,EAAA,IAAI,EAAA,GAAK,IAAI,IAAA,CAAK,GAAA,CAAI,QAAQ,IAAA,CAAK,EAAA,GAAK,CAAC,CAAA,GAAI,OAAO,CAAA;AACpD,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AAC/B,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,IAAA,CAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AAC/B,EAAA,MAAM,CAAA,GAAI,IAAI,MAAM,CAAA;AAEpB,EAAA,IAAI,CAAA;AACJ,EAAA,IAAI,IAAA,GAAO,CAAA;AACX,EAAA,IAAI,IAAA,GAAO,CAAA;AAEX,EAAA,IAAI,CAAA,GAAI,MAAM,CAAA,EAAG;AACf,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AAC/D,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,IAAI,GAAA,GAAM,CAAC,CAAC,CAAA,EAAG,IAAI,MAAA,CAAO,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjE,IAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AACxB,IAAA,CAAA,GAAI,CAAA;AAAA,EACN,CAAA,MAAO;AACL,IAAA,EAAA,GAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACf,IAAA,EAAA,GAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACf,IAAA,CAAA,GAAI,CAAA;AACJ,IAAA;AACE,MAAA,IAAI,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,CAAA,EAAG,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,CAAC,CAAA;AAC3D,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AACrD,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC1B;AACA,IAAA;AACE,MAAA,IAAI,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,IAAI,EAAA,GAAK,CAAC,CAAC,CAAA,EAAG,IAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,CAAC,CAAC,CAAA;AAC7D,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AACrD,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC1B;AACA,IAAA,CAAA,GAAI,CAAA;AACJ,IAAA,EAAA,GAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACf,IAAA,EAAA,GAAK,GAAA,CAAI,KAAK,CAAC,CAAA;AACf,IAAA,IAAA,GAAO,GAAA,CAAI,KAAK,CAAC,CAAA;AACjB,IAAA,IAAA,GAAO,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACnB;AAEA,EAAA,OAAO,IAAI,CAAA,GAAI,IAAA,CAAK,MAAM,CAAA,GAAI,CAAC,GAAG,CAAA,EAAA,EAAK;AACrC,IAAA;AACE,MAAA,IAAI,CAAA,GAAI,IAAA;AAAA,QACN,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,IAAI,IAAI,CAAA;AAAA,QAC5B,GAAA,CAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,IAAI,IAAI;AAAA,OAC9B;AACA,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AACrD,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC1B;AACA,IAAA;AACE,MAAA,IAAI,CAAA,GAAI,IAAA;AAAA,QACN,IAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,IAAI,IAAI,CAAA;AAAA,QAC7B,IAAI,MAAA,CAAO,CAAA,GAAI,EAAA,GAAK,CAAC,IAAI,IAAI;AAAA,OAC/B;AACA,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAA;AACrD,MAAA,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,MAAM,CAAC,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,GAAA,GAAM,CAAC,CAAC,CAAC,CAAA;AACjD,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC1B;AAAA,EACF;AAEA,EAAA,OAAO,KAAA;AACT;AASO,SAAS,kBAAA,CACd,KAAA,EACA,MAAA,EACA,CAAA,EACA,SAAA,EACA,SAAA,EACA,IAAA,GAAO,CAAA,EACP,OAAA,GAAU,CAAA,EACV,OAAA,GAAU,CAAA,EACC;AACX,EAAA,MAAM,OACJ,SAAA,IAAa,CAAA;AACf,EAAA,MAAM,IAAA,GACJ,SAAA,IAAa,IAAA,CAAK,GAAA,CAAI,OAAO,MAAM,CAAA;AACrC,EAAA,IAAI,IAAI,CAAA,IAAK,KAAA,IAAS,KAAK,MAAA,IAAU,CAAA,SAAU,EAAC;AAEhD,EAAA,MAAM,aAAa,IAAA,KAAS,IAAA;AAC5B,EAAA,MAAM,GAAA,GAAM,UAAA,CAAW,IAAA,KAAS,CAAC,CAAA;AACjC,EAAA,MAAM,QAAmB,EAAC;AAC1B,EAAA,MAAM,WAAA,GAAc,IAAA,CAAK,GAAA,CAAI,GAAA,EAAQ,IAAI,GAAG,CAAA;AAC5C,EAAA,IAAI,QAAA,GAAW,CAAA;AAEf,EAAA,OAAO,KAAA,CAAM,MAAA,GAAS,CAAA,IAAK,QAAA,GAAW,WAAA,EAAa;AACjD,IAAA,QAAA,EAAA;AACA,IAAA,MAAM,SAAS,UAAA,GAAa,IAAA,GAAO,IAAA,GAAO,GAAA,MAAS,IAAA,GAAO,IAAA,CAAA;AAC1D,IAAA,IAAI,EAAE,SAAS,CAAA,CAAA,IAAM,MAAA,GAAS,KAAK,KAAA,IAAS,MAAA,GAAS,KAAK,MAAA,EAAQ;AAChE,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAK,OAAA,GAAU,GAAA,EAAI,IAAK,KAAA,GAAQ,SAAS,CAAA,CAAA,GAAK,MAAA;AACpD,IAAA,MAAM,KAAK,OAAA,GAAU,GAAA,EAAI,IAAK,MAAA,GAAS,SAAS,CAAA,CAAA,GAAK,MAAA;AACrD,IAAA,MAAM,KAAA,GAAQ,GAAA,EAAI,GAAI,IAAA,CAAK,EAAA,GAAK,CAAA;AAChC,IAAA,MAAM,EAAA,GAAK,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAClC,IAAA,MAAM,EAAA,GAAK,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAClC,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AACrB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,EAAA,EAAI,EAAE,CAAA;AAErB,IAAA,IAAI,IAAA,GAAO,KAAA;AACX,IAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACrB,MAAA,IAAI,kBAAkB,CAAA,EAAG,CAAA,EAAG,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAA,EAAG;AACrC,QAAA,IAAA,GAAO,IAAA;AACP,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,CAAC,IAAA,EAAM,KAAA,CAAM,KAAK,OAAA,CAAQ,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,EACrC;AAEA,EAAA,OAAO,KAAA;AACT;AASO,SAAS,aAAA,CACd,KAAA,EACA,MAAA,EACA,QAAA,EACA,CAAA,GAAI,CAAA,EACJ,CAAA,GAAI,CAAA,EACJ,CAAA,GAAI,CAAA,EACJ,OAAA,GAAgC,EAAC,EACtB;AACX,EAAA,IAAI,EAAE,WAAW,CAAA,CAAA,EAAI;AACnB,IAAA,MAAM,IAAI,MAAM,qCAAqC,CAAA;AAAA,EACvD;AACA,EAAA,IAAI,CAAA,IAAK,CAAA,IAAK,CAAA,IAAK,CAAA,EAAG;AACpB,IAAA,MAAM,IAAI,MAAM,oCAAoC,CAAA;AAAA,EACtD;AAEA,EAAA,MAAM;AAAA,IACJ,OAAA,GAAU,CAAA;AAAA,IACV,OAAA,GAAU,CAAA;AAAA,IACV,UAAA,GAAa,KAAA;AAAA,IACb,YAAA,GAAe,CAAA;AAAA,IACf,sBAAA,GAAyB;AAAA,GAC3B,GAAI,OAAA;AAEJ,EAAA,IAAI,EAAE,eAAe,CAAA,CAAA,EAAI;AACvB,IAAA,MAAM,IAAI,MAAM,yCAAyC,CAAA;AAAA,EAC3D;AAEA,EAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,EAAA,MAAM,CAAA,GAAI,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,GAAA,CAAI,CAAA,EAAG,YAAY,CAAC,CAAA;AAE/C,EAAA,MAAM,IAAA,GAAO,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,KAAA,CAAM,KAAA,GAAQ,QAAQ,CAAC,CAAA;AACrD,EAAA,MAAM,IAAA,GAAO,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,KAAA,CAAM,MAAA,GAAS,QAAQ,CAAC,CAAA;AACtD,EAAA,MAAM,QAAQ,IAAA,GAAO,QAAA;AACrB,EAAA,MAAM,QAAQ,IAAA,GAAO,QAAA;AACrB,EAAA,MAAM,EAAA,GAAK,OAAA,GAAA,CAAW,KAAA,GAAQ,KAAA,IAAS,GAAA;AACvC,EAAA,MAAM,EAAA,GAAK,OAAA,GAAA,CAAW,MAAA,GAAS,KAAA,IAAS,GAAA;AAExC,EAAA,MAAM,QAAA,GAAW,EAAA;AACjB,EAAA,MAAM,YAAY,EAAA,GAAK,KAAA;AACvB,EAAA,MAAM,UAAA,GAAa,EAAA;AACnB,EAAA,MAAM,UAAU,EAAA,GAAK,KAAA;AAErB,EAAA,MAAM,OAAoB,KAAA,CAAM,IAAA;AAAA,IAAK,EAAE,QAAQ,IAAA,EAAK;AAAA,IAAG,MACrD,MAAM,IAAA,CAAK,EAAE,QAAQ,IAAA,EAAK,EAAG,MAAM,KAAK;AAAA,GAC1C;AACA,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAA,EAAK;AAC7B,IAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,CAAA,GAAI,CAAA,EAAG,CAAC,CAAA;AAC/B,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAA,EAAK;AAC7B,MAAA,MAAM,GAAA,GAAM,QAAA,CAAS,CAAA,GAAI,KAAA,EAAO,CAAC,CAAA;AACjC,MAAA,IAAI,SAAS,GAAA,GAAM,CAAA;AACnB,MAAA,IAAI,UAAA,WAAqB,CAAC,MAAA;AAC1B,MAAA,IAAA,CAAK,CAAC,CAAA,CAAG,CAAC,CAAA,GAAI,MAAA;AAAA,IAChB;AAAA,EACF;AAEA,EAAA,MAAM,OAAkB,EAAC;AAEzB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAA,EAAK;AAC7B,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,OAAO,IAAI,IAAA,EAAM;AACf,MAAA,IAAI,CAAC,IAAA,CAAK,CAAC,CAAA,CAAG,CAAC,CAAA,EAAG;AAChB,QAAA,CAAA,EAAA;AACA,QAAA;AAAA,MACF;AACA,MAAA,MAAM,KAAA,GAAQ,CAAA;AACd,MAAA,OAAO,CAAA,GAAI,IAAI,IAAA,IAAQ,IAAA,CAAK,CAAC,CAAA,CAAG,CAAA,GAAI,CAAC,CAAA,EAAG,CAAA,EAAA;AACxC,MAAA,MAAM,GAAA,GAAM,CAAA;AACZ,MAAA,MAAM,MAAA,GAAS,MAAM,KAAA,GAAQ,CAAA;AAC7B,MAAA,MAAM,CAAA,GAAI,EAAA,GAAA,CAAM,CAAA,GAAI,GAAA,IAAO,QAAA;AAC3B,MAAA,IAAI,EAAA,GAAK,EAAA,GAAA,CAAM,KAAA,IAAS,CAAA,GAAI,CAAA,CAAA,IAAM,QAAA;AAClC,MAAA,IAAI,EAAA,GAAK,EAAA,GAAA,CAAM,GAAA,GAAM,CAAA,IAAK,QAAA;AAE1B,MAAA,IAAI,sBAAA,IAA0B,WAAW,CAAA,EAAG;AAC1C,QAAA,MAAM,EAAA,GAAK,EAAA,GAAA,CAAM,KAAA,GAAQ,GAAA,IAAO,QAAA;AAChC,QAAA,IAAI,UAAU,CAAA,EAAG;AACf,UAAA,EAAA,GAAK,QAAA;AACL,UAAA,EAAA,GAAK,EAAA;AAAA,QACP,CAAA,MAAA,IAAW,GAAA,KAAQ,IAAA,GAAO,CAAA,EAAG;AAC3B,UAAA,EAAA,GAAK,EAAA;AACL,UAAA,EAAA,GAAK,SAAA;AAAA,QACP;AAAA,MACF;AAEA,MAAA,EAAA,GAAK,KAAA,CAAM,EAAA,EAAI,QAAA,EAAU,SAAS,CAAA;AAClC,MAAA,EAAA,GAAK,KAAA,CAAM,EAAA,EAAI,QAAA,EAAU,SAAS,CAAA;AAClC,MAAA,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,EAAA,EAAI,CAAC,GAAG,IAAA,CAAK,EAAA,EAAI,CAAC,CAAC,CAAC,CAAA;AAC3C,MAAA,CAAA,EAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAA,EAAK;AAC7B,IAAA,IAAI,CAAA,GAAI,CAAA;AACR,IAAA,OAAO,IAAI,IAAA,EAAM;AACf,MAAA,IAAI,IAAA,CAAK,CAAC,CAAA,CAAG,CAAC,CAAA,EAAG;AACf,QAAA,CAAA,EAAA;AACA,QAAA;AAAA,MACF;AACA,MAAA,MAAM,KAAA,GAAQ,CAAA;AACd,MAAA,OAAO,CAAA,GAAI,IAAI,IAAA,IAAQ,CAAC,KAAK,CAAA,GAAI,CAAC,CAAA,CAAG,CAAC,CAAA,EAAG,CAAA,EAAA;AACzC,MAAA,MAAM,GAAA,GAAM,CAAA;AACZ,MAAA,MAAM,MAAA,GAAS,MAAM,KAAA,GAAQ,CAAA;AAC7B,MAAA,MAAM,CAAA,GAAI,EAAA,GAAA,CAAM,CAAA,GAAI,GAAA,IAAO,QAAA;AAC3B,MAAA,IAAI,EAAA,GAAK,EAAA,GAAA,CAAM,KAAA,IAAS,CAAA,GAAI,CAAA,CAAA,IAAM,QAAA;AAClC,MAAA,IAAI,EAAA,GAAK,EAAA,GAAA,CAAM,GAAA,GAAM,CAAA,IAAK,QAAA;AAE1B,MAAA,IAAI,sBAAA,IAA0B,WAAW,CAAA,EAAG;AAC1C,QAAA,MAAM,EAAA,GAAK,EAAA,GAAA,CAAM,KAAA,GAAQ,GAAA,IAAO,QAAA;AAChC,QAAA,IAAI,UAAU,CAAA,EAAG;AACf,UAAA,EAAA,GAAK,UAAA;AACL,UAAA,EAAA,GAAK,EAAA;AAAA,QACP,CAAA,MAAA,IAAW,GAAA,KAAQ,IAAA,GAAO,CAAA,EAAG;AAC3B,UAAA,EAAA,GAAK,EAAA;AACL,UAAA,EAAA,GAAK,OAAA;AAAA,QACP;AAAA,MACF;AAEA,MAAA,EAAA,GAAK,KAAA,CAAM,EAAA,EAAI,UAAA,EAAY,OAAO,CAAA;AAClC,MAAA,EAAA,GAAK,KAAA,CAAM,EAAA,EAAI,UAAA,EAAY,OAAO,CAAA;AAClC,MAAA,IAAA,CAAK,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,CAAA,EAAG,EAAE,GAAG,IAAA,CAAK,CAAA,EAAG,EAAE,CAAC,CAAC,CAAA;AAC3C,MAAA,CAAA,EAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,IAAA;AACT;AA2BO,SAAS,yBAAA,CACd,IAAA,EACA,oBAAA,EACA,MAAA,EACA,cAAc,CAAA,EACH;AACX,EAAA,IAAI,EAAE,oBAAA,GAAuB,CAAA,CAAA,EAAI,OAAO,EAAC;AACzC,EAAA,MAAM,QAAA,GACJ,OAAO,MAAA,KAAW,UAAA,GAAa,SAAS,MAAM,MAAA;AAEhD,EAAA,MAAM,SAAA,GAAA,CAAc,WAAA,GAAc,CAAA,GAAK,CAAA,IAAK,CAAA;AAC5C,EAAA,MAAM,QAAmB,EAAC;AAE1B,EAAA,KAAA,MAAW,IAAA,IAAQ,KAAK,KAAA,EAAO;AAC7B,IAAA,IAAI,IAAA,CAAK,SAAS,CAAA,EAAG;AACrB,IAAA,MAAM,SAAS,IAAA,CAAK,MAAA;AACpB,IAAA,IAAI,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM,KAAK,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAC,CAAA;AACxC,IAAA,IAAI,MAAA,IAAU,QAAA,CAAS,GAAG,CAAA,GAAI,CAAA,EAAG;AAC/B,MAAA,GAAA,GAAM,GAAA,CAAI,KAAA,EAAM,CAAE,OAAA,EAAQ;AAAA,IAC5B;AAEA,IAAA,MAAM,OAAA,GAAU,WAAA,CAAY,GAAA,EAAK,MAAM,CAAA;AACvC,IAAA,MAAM,MAAM,OAAA,CAAQ,KAAA;AACpB,IAAA,IAAI,EAAE,MAAM,CAAA,CAAA,EAAI;AAEhB,IAAA,MAAM,KAAA,GAAQ,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,KAAA,CAAM,GAAA,GAAM,oBAAoB,CAAC,CAAA;AAChE,IAAA,MAAM,YAAY,CAAA,GAAI,KAAA;AACtB,IAAA,MAAM,MAAM,IAAA,CAAK,GAAA;AAAA,MACf,GAAA,GAAM,IAAA;AAAA,MACN,IAAA,CAAK,GAAA,CAAI,oBAAA,GAAuB,IAAA,EAAM,MAAM,IAAI;AAAA,KAClD;AAEA,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,EAAO,CAAA,EAAA,EAAK;AAC9B,MAAA,MAAM,OAAA,GAAA,CAAW,SAAA,GAAY,CAAA,GAAI,SAAA,IAAa,CAAA;AAC9C,MAAA,MAAM,MAAM,OAAA,GAAU,GAAA;AACtB,MAAA,MAAM,IAAA,GAAO,MAAA,GACT,SAAA,CAAU,GAAA,GAAM,GAAA,EAAK,GAAG,CAAA,GACxB,KAAA,CAAM,GAAA,GAAM,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA;AAC3B,MAAA,MAAM,IAAA,GAAO,MAAA,GACT,SAAA,CAAU,GAAA,GAAM,GAAA,EAAK,GAAG,CAAA,GACxB,KAAA,CAAM,GAAA,GAAM,GAAA,EAAK,CAAA,EAAG,GAAG,CAAA;AAE3B,MAAA,MAAM,EAAA,GAAK,OAAA,CAAQ,OAAA,CAAQ,IAAI,CAAA;AAC/B,MAAA,MAAM,EAAA,GAAK,OAAA,CAAQ,OAAA,CAAQ,IAAI,CAAA;AAC/B,MAAA,MAAM,EAAA,GAAK,OAAA,CAAQ,OAAA,CAAQ,GAAG,CAAA;AAE9B,MAAA,MAAM,EAAA,GAAK,EAAA,CAAG,CAAA,GAAI,EAAA,CAAG,CAAA;AACrB,MAAA,MAAM,EAAA,GAAK,EAAA,CAAG,CAAA,GAAI,EAAA,CAAG,CAAA;AACrB,MAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAC9B,MAAA,IAAI,SAAS,CAAA,EAAG;AAEhB,MAAA,MAAM,EAAA,GAAK,CAAC,EAAA,GAAK,IAAA;AACjB,MAAA,MAAM,KAAK,EAAA,GAAK,IAAA;AAChB,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AACrC,MAAA,MAAM,IAAI,QAAA,CAAS,EAAA,CAAG,GAAG,EAAA,CAAG,CAAA,EAAG,SAAS,WAAW,CAAA;AACnD,MAAA,IAAI,EAAE,IAAI,CAAA,CAAA,EAAI;AACd,MAAA,MAAM,OAAO,CAAA,GAAI,GAAA;AACjB,MAAA,KAAA,CAAM,IAAA;AAAA,QACJ,OAAA;AAAA,UACE,IAAA,CAAK,GAAG,CAAA,GAAI,EAAA,GAAK,MAAM,EAAA,CAAG,CAAA,GAAI,KAAK,IAAI,CAAA;AAAA,UACvC,IAAA,CAAK,GAAG,CAAA,GAAI,EAAA,GAAK,MAAM,EAAA,CAAG,CAAA,GAAI,KAAK,IAAI;AAAA;AACzC,OACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,KAAA;AACT;AAEO,SAAS,iBAAA,CACd,UACA,SAAA,EACW;AACX,EAAA,OAAO,SAAS,MAAA,CAAO,CAAC,MAAM,aAAA,CAAc,CAAC,KAAK,SAAS,CAAA;AAC7D;AAEO,SAAS,iBAAA,CACd,UACA,UAAA,EACW;AACX,EAAA,OAAO,QAAA,CAAS,MAAA,CAAO,CAAC,CAAA,KAAM;AAC5B,IAAA,MAAM,MAAM,IAAA,CAAK,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,EAAE,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAE,GAAG,CAAA,CAAE,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA,CAAE,CAAC,CAAC,CAAA;AAC7D,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,GAAA,GAAM,IAAA,CAAK,IAAI,IAAA,CAAK,EAAA,GAAM,GAAA,GAAM,IAAA,CAAK,EAAG,CAAA;AAC9D,IAAA,MAAM,KAAA,GAAQ,QAAQ,UAAA,IAAc,IAAA,CAAK,IAAI,IAAA,GAAO,IAAA,CAAK,EAAE,CAAA,IAAK,UAAA;AAChE,IAAA,MAAM,QAAQ,IAAA,CAAK,GAAA,CAAI,OAAO,IAAA,CAAK,EAAA,GAAK,CAAC,CAAA,IAAK,UAAA;AAC9C,IAAA,OAAO,EAAE,KAAA,IAAS,KAAA,CAAA;AAAA,EACpB,CAAC,CAAA;AACH;AAEO,SAAS,cAAc,CAAA,EAAoB;AAChD,EAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,CAAE,CAAA;AACvB,EAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,CAAE,CAAA;AACvB,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAC1B;AAEO,SAAS,oBAAoB,QAAA,EAAqB;AACvD,EAAA,OAAO,QAAA,CAAS,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,IAC1B,OAAO,CAAC,CAAC,EAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAC,CAAA;AAAA,IAClB,MAAA,EAAQ;AAAA,GACV,CAAE,CAAA;AACJ;AAEO,IAAM,UAAA,GAAa;AAAA,EACxB,gBAAA;AAAA,EACA,kBAAA;AAAA,EACA,aAAA;AAAA,EACA,yBAAA;AAAA,EACA,iBAAA;AAAA,EACA,iBAAA;AAAA,EACA,aAAA;AAAA,EACA;AACF;AAEA,SAAS,QAAA,CAAS,GAAW,CAAA,EAAmB;AAC9C,EAAA,OAAA,CAAS,CAAA,GAAI,IAAK,CAAA,IAAK,CAAA;AACzB;AAEA,SAAS,KAAA,CAAM,CAAA,EAAW,EAAA,EAAY,EAAA,EAAoB;AACxD,EAAA,OAAO,KAAK,GAAA,CAAI,EAAA,EAAI,KAAK,GAAA,CAAI,EAAA,EAAI,CAAC,CAAC,CAAA;AACrC;AAEA,SAAS,SAAA,CAAU,KAAa,GAAA,EAAqB;AACnD,EAAA,IAAI,GAAA,IAAO,GAAG,OAAO,CAAA;AACrB,EAAA,IAAI,IAAI,GAAA,GAAM,GAAA;AACd,EAAA,IAAI,CAAA,GAAI,GAAG,CAAA,IAAK,GAAA;AAChB,EAAA,OAAO,CAAA;AACT;AAEA,SAAS,SAAS,IAAA,EAAsB;AACtC,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAQ,CAAA,EAAA,EAAK;AACpC,IAAA,MAAM,CAAA,GAAI,KAAK,CAAC,CAAA;AAChB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAA,CAAM,CAAA,GAAI,CAAA,IAAK,KAAK,MAAM,CAAA;AACpC,IAAA,GAAA,IAAO,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA;AAAA,EAC7B;AACA,EAAA,OAAO,GAAA,GAAM,CAAA;AACf;AAGA,SAAS,iBAAA,CAAkB,CAAA,EAAS,CAAA,EAAS,CAAA,EAAS,CAAA,EAAkB;AACtE,EAAA,OACE,IAAI,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,KAAM,GAAA,CAAI,GAAG,CAAA,EAAG,CAAC,CAAA,IAAK,GAAA,CAAI,GAAG,CAAA,EAAG,CAAC,MAAM,GAAA,CAAI,CAAA,EAAG,GAAG,CAAC,CAAA;AAEjE;AAEA,SAAS,GAAA,CAAI,CAAA,EAAS,CAAA,EAAS,CAAA,EAAkB;AAC/C,EAAA,OAAA,CAAQ,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,KAAM,EAAE,CAAA,GAAI,CAAA,CAAE,CAAA,CAAA,GAAA,CAAM,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,KAAM,CAAA,CAAE,IAAI,CAAA,CAAE,CAAA,CAAA;AAC5D;AAEA,SAAS,WAAW,IAAA,EAA4B;AAC9C,EAAA,OAAO,WAAY;AACjB,IAAA,IAAI,IAAK,IAAA,IAAQ,UAAA;AACjB,IAAA,CAAA,GAAI,KAAK,IAAA,CAAK,CAAA,GAAK,CAAA,KAAM,EAAA,EAAK,IAAI,CAAC,CAAA;AACnC,IAAA,CAAA,IAAK,IAAI,IAAA,CAAK,IAAA,CAAK,IAAK,CAAA,KAAM,CAAA,EAAI,IAAI,EAAE,CAAA;AACxC,IAAA,OAAA,CAAA,CAAS,CAAA,GAAK,CAAA,KAAM,EAAA,MAAS,CAAA,IAAK,UAAA;AAAA,EACpC,CAAA;AACF;AAEA,SAAS,WAAA,CAAY,MAAc,MAAA,EAAiB;AAClD,EAAA,MAAM,IAAI,IAAA,CAAK,MAAA;AACf,EAAA,MAAM,SAAA,GAAY,MAAA,GAAS,CAAA,GAAI,CAAA,GAAI,CAAA;AACnC,EAAA,MAAM,UAAoB,EAAC;AAC3B,EAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,SAAA,EAAW,CAAA,EAAA,EAAK;AAClC,IAAA,MAAM,CAAA,GAAI,KAAK,CAAC,CAAA;AAChB,IAAA,MAAM,CAAA,GAAI,IAAA,CAAA,CAAM,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA;AAC1B,IAAA,MAAM,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA;AACzC,IAAA,OAAA,CAAQ,KAAK,CAAC,CAAA;AACd,IAAA,KAAA,IAAS,CAAA;AAAA,EACX;AACA,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,QAAQ,IAAA,EAAoB;AAC1B,MAAA,IAAI,MAAA,GAAS,IAAA;AACb,MAAA,IAAI,UAAU,CAAA,EAAG,OAAO,EAAE,GAAG,IAAA,CAAK,CAAC,CAAA,EAAG;AACtC,MAAA,IAAI,MAAA,IAAU,KAAA,EAAO,OAAO,EAAE,GAAG,KAAK,MAAA,GAAS,CAAA,GAAI,CAAA,GAAI,CAAC,CAAA,EAAG;AAC3D,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,OAAA,CAAQ,QAAQ,CAAA,EAAA,EAAK;AACvC,QAAA,MAAM,CAAA,GAAI,QAAQ,CAAC,CAAA;AACnB,QAAA,IAAI,MAAA,IAAU,CAAA,IAAK,CAAA,KAAM,OAAA,CAAQ,SAAS,CAAA,EAAG;AAC3C,UAAA,MAAM,CAAA,GAAI,CAAA,GAAI,KAAA,GAAQ,CAAA,GAAI,MAAA,GAAS,CAAA;AACnC,UAAA,MAAM,CAAA,GAAI,KAAK,CAAC,CAAA;AAChB,UAAA,MAAM,CAAA,GAAI,IAAA,CAAA,CAAM,CAAA,GAAI,CAAA,IAAK,CAAC,CAAA;AAC1B,UAAA,OAAO;AAAA,YACL,GAAG,CAAA,CAAE,CAAA,GAAA,CAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,IAAK,CAAA;AAAA,YACvB,GAAG,CAAA,CAAE,CAAA,GAAA,CAAK,CAAA,CAAE,CAAA,GAAI,EAAE,CAAA,IAAK;AAAA,WACzB;AAAA,QACF;AACA,QAAA,MAAA,IAAU,CAAA;AAAA,MACZ;AACA,MAAA,OAAO,EAAE,GAAG,IAAA,CAAK,CAAC,CAAA,EAAG;AAAA,IACvB;AAAA,GACF;AACF","file":"index.js","sourcesContent":["/** 2D point / vector. */\nexport type Vec2 = {\n  x: number\n  y: number\n}\n\nexport function vec2(x: number, y: number): Vec2 {\n  return { x, y }\n}\n\nexport function cloneVec2(v: Vec2): Vec2 {\n  return { x: v.x, y: v.y }\n}\n\nexport function equalsVec2(a: Vec2, b: Vec2, eps = 1e-9): boolean {\n  return Math.abs(a.x - b.x) <= eps && Math.abs(a.y - b.y) <= eps\n}\n","import type { Vec2 } from './vec2.js'\n\n/** Line segment between two points. */\nexport type Segment = {\n  a: Vec2\n  b: Vec2\n}\n\nexport function segment(a: Vec2, b: Vec2): Segment {\n  return { a, b }\n}\n","import type { Path, Segment, Vec2 } from '../types/index.js'\nimport { segment, vec2 } from '../types/index.js'\n\n/** Match Processing `float` for PGS parity on hatch fixtures. */\nfunction f32(n: number): number {\n  return Math.fround(n)\n}\n\n/**\n * Parallel segments through a center point (PGS `parallelSegments` semantics).\n * `length` is the half-length along the segment direction; full span is `2 * length`.\n * `angle` is radians along the segment; spacing is perpendicular.\n */\nexport function parallelSegments(\n  centerX: number,\n  centerY: number,\n  length: number,\n  spacing: number,\n  angle: number,\n  n: number,\n): Segment[] {\n  const edges: Segment[] = []\n  if (n < 1) return edges\n\n  const center = vec2(f32(centerX), f32(centerY))\n  let dx = f32(Math.cos(angle + Math.PI / 2) * spacing)\n  let dy = f32(Math.sin(angle + Math.PI / 2) * spacing)\n  const cos = f32(Math.cos(angle))\n  const sin = f32(Math.sin(angle))\n  const l = f32(length)\n\n  let i: number\n  let offX = 0\n  let offY = 0\n\n  if (n % 2 === 1) {\n    const a = vec2(f32(center.x + cos * l), f32(center.y + sin * l))\n    const b = vec2(f32(center.x + cos * -l), f32(center.y + sin * -l))\n    edges.push(segment(a, b))\n    i = 1\n  } else {\n    dx = f32(dx / 2)\n    dy = f32(dy / 2)\n    i = 1\n    {\n      let a = vec2(f32(center.x + dx * i), f32(center.y + dy * i))\n      const b = vec2(f32(a.x + cos * l), f32(a.y + sin * l))\n      a = vec2(f32(a.x + cos * -l), f32(a.y + sin * -l))\n      edges.push(segment(a, b))\n    }\n    {\n      let a = vec2(f32(center.x + dx * -i), f32(center.y + dy * -i))\n      const b = vec2(f32(a.x + cos * l), f32(a.y + sin * l))\n      a = vec2(f32(a.x + cos * -l), f32(a.y + sin * -l))\n      edges.push(segment(a, b))\n    }\n    i = 2\n    dx = f32(dx * 2)\n    dy = f32(dy * 2)\n    offX = f32(dx / 2)\n    offY = f32(dy / 2)\n  }\n\n  for (; i < 1 + Math.floor(n / 2); i++) {\n    {\n      let a = vec2(\n        f32(center.x + dx * i - offX),\n        f32(center.y + dy * i - offY),\n      )\n      const b = vec2(f32(a.x + cos * l), f32(a.y + sin * l))\n      a = vec2(f32(a.x + cos * -l), f32(a.y + sin * -l))\n      edges.push(segment(a, b))\n    }\n    {\n      let a = vec2(\n        f32(center.x + dx * -i + offX),\n        f32(center.y + dy * -i + offY),\n      )\n      const b = vec2(f32(a.x + cos * l), f32(a.y + sin * l))\n      a = vec2(f32(a.x + cos * -l), f32(a.y + sin * -l))\n      edges.push(segment(a, b))\n    }\n  }\n\n  return edges\n}\n\n/**\n * Random non-intersecting segments in a box anchored at `(originX, originY)`\n * with the given width/height (PGS `stochasticSegments`).\n *\n * Lengths are uniform in `[minLength, maxLength)` when the range differs;\n * use equal min/max for fixed length. Seeded via mulberry32.\n */\nexport function stochasticSegments(\n  width: number,\n  height: number,\n  n: number,\n  minLength?: number,\n  maxLength?: number,\n  seed = 1,\n  originX = 0,\n  originY = 0,\n): Segment[] {\n  const minL =\n    minLength ?? 1\n  const maxL =\n    maxLength ?? Math.min(width, height)\n  if (n < 1 || width <= 0 || height <= 0) return []\n\n  const monoLength = minL === maxL\n  const rng = mulberry32(seed >>> 0)\n  const edges: Segment[] = []\n  const maxAttempts = Math.max(10_000, n * 500)\n  let attempts = 0\n\n  while (edges.length < n && attempts < maxAttempts) {\n    attempts++\n    const length = monoLength ? minL : minL + rng() * (maxL - minL)\n    if (!(length > 0) || length * 2 >= width || length * 2 >= height) {\n      continue\n    }\n    const ax = originX + rng() * (width - length * 2) + length\n    const ay = originY + rng() * (height - length * 2) + length\n    const theta = rng() * Math.PI * 2\n    const bx = ax + Math.cos(theta) * length\n    const by = ay + Math.sin(theta) * length\n    const a = vec2(ax, ay)\n    const b = vec2(bx, by)\n\n    let hits = false\n    for (const s of edges) {\n      if (segmentsIntersect(a, b, s.a, s.b)) {\n        hits = true\n        break\n      }\n    }\n    if (!hits) edges.push(segment(a, b))\n  }\n\n  return edges\n}\n\n/**\n * Fabric-like horizontal/vertical weave on a regular cell grid\n * (PGS `weaveSegments` / ABC auxetics).\n *\n * Domain is `[originX, originX+width] × [originY, originY+height]`.\n * A/B control weft/warp run lengths; C is the row phase shift (mod A+B).\n */\nexport function weaveSegments(\n  width: number,\n  height: number,\n  cellSize: number,\n  A = 1,\n  B = 1,\n  C = 1,\n  options: WeaveSegmentsOptions = {},\n): Segment[] {\n  if (!(cellSize > 0)) {\n    throw new Error('weaveSegments: cellSize must be > 0')\n  }\n  if (A <= 0 || B <= 0) {\n    throw new Error('weaveSegments: A and B must be > 0')\n  }\n\n  const {\n    originX = 0,\n    originY = 0,\n    swapColors = false,\n    cellFraction = 1,\n    extendSingletonsToEdge = true,\n  } = options\n\n  if (!(cellFraction > 0)) {\n    throw new Error('weaveSegments: cellFraction must be > 0')\n  }\n\n  const P = A + B\n  const f = Math.max(0, Math.min(1, cellFraction))\n\n  const cols = Math.max(1, Math.floor(width / cellSize))\n  const rows = Math.max(1, Math.floor(height / cellSize))\n  const gridW = cols * cellSize\n  const gridH = rows * cellSize\n  const dx = originX + (width - gridW) * 0.5\n  const dy = originY + (height - gridH) * 0.5\n\n  const gridLeft = dx\n  const gridRight = dx + gridW\n  const gridBottom = dy\n  const gridTop = dy + gridH\n\n  const weft: boolean[][] = Array.from({ length: rows }, () =>\n    Array.from({ length: cols }, () => false),\n  )\n  for (let r = 0; r < rows; r++) {\n    const shift = floorMod(r * C, P)\n    for (let c = 0; c < cols; c++) {\n      const idx = floorMod(c + shift, P)\n      let isWeft = idx < A\n      if (swapColors) isWeft = !isWeft\n      weft[r]![c] = isWeft\n    }\n  }\n\n  const segs: Segment[] = []\n\n  for (let r = 0; r < rows; r++) {\n    let c = 0\n    while (c < cols) {\n      if (!weft[r]![c]) {\n        c++\n        continue\n      }\n      const start = c\n      while (c + 1 < cols && weft[r]![c + 1]) c++\n      const end = c\n      const runLen = end - start + 1\n      const y = dy + (r + 0.5) * cellSize\n      let x0 = dx + (start + (1 - f)) * cellSize\n      let x1 = dx + (end + f) * cellSize\n\n      if (extendSingletonsToEdge && runLen === 1) {\n        const cx = dx + (start + 0.5) * cellSize\n        if (start === 0) {\n          x0 = gridLeft\n          x1 = cx\n        } else if (end === cols - 1) {\n          x0 = cx\n          x1 = gridRight\n        }\n      }\n\n      x0 = clamp(x0, gridLeft, gridRight)\n      x1 = clamp(x1, gridLeft, gridRight)\n      segs.push(segment(vec2(x0, y), vec2(x1, y)))\n      c++\n    }\n  }\n\n  for (let c = 0; c < cols; c++) {\n    let r = 0\n    while (r < rows) {\n      if (weft[r]![c]) {\n        r++\n        continue\n      }\n      const start = r\n      while (r + 1 < rows && !weft[r + 1]![c]) r++\n      const end = r\n      const runLen = end - start + 1\n      const x = dx + (c + 0.5) * cellSize\n      let y0 = dy + (start + (1 - f)) * cellSize\n      let y1 = dy + (end + f) * cellSize\n\n      if (extendSingletonsToEdge && runLen === 1) {\n        const cy = dy + (start + 0.5) * cellSize\n        if (start === 0) {\n          y0 = gridBottom\n          y1 = cy\n        } else if (end === rows - 1) {\n          y0 = cy\n          y1 = gridTop\n        }\n      }\n\n      y0 = clamp(y0, gridBottom, gridTop)\n      y1 = clamp(y1, gridBottom, gridTop)\n      segs.push(segment(vec2(x, y0), vec2(x, y1)))\n      r++\n    }\n  }\n\n  return segs\n}\n\nexport type WeaveSegmentsOptions = {\n  originX?: number\n  originY?: number\n  /** Swap weft/warp roles. */\n  swapColors?: boolean\n  /** Endpoint position inside run end cells (0.5..1 typical). Default `1`. */\n  cellFraction?: number\n  /** Extend single-cell boundary runs to the grid edge. Default `true`. */\n  extendSingletonsToEdge?: boolean\n}\n\n/** Per-sample length for {@link perpendicularPathSegments}. */\nexport type SegmentLengthFn = (\n  x: number,\n  y: number,\n  posFrac: number,\n  normalAngle: number,\n) => number\n\n/**\n * Perpendicular ticks along each ring of `path`, centered on the boundary\n * (PGS `perpendicularPathSegments`). Outline texture, not an area fill.\n *\n * Closed rings are oriented CW so the left-hand normal points outward.\n */\nexport function perpendicularPathSegments(\n  path: Path,\n  interSegmentDistance: number,\n  length: number | SegmentLengthFn,\n  startOffset = 0,\n): Segment[] {\n  if (!(interSegmentDistance > 0)) return []\n  const lengthFn: SegmentLengthFn =\n    typeof length === 'function' ? length : () => length\n\n  const startNorm = ((startOffset % 1) + 1) % 1\n  const edges: Segment[] = []\n\n  for (const ring of path.rings) {\n    if (ring.length < 2) continue\n    const closed = path.closed\n    let pts = ring.map((v) => vec2(v.x, v.y))\n    if (closed && shoelace(pts) > 0) {\n      pts = pts.slice().reverse()\n    }\n\n    const indexed = lengthIndex(pts, closed)\n    const end = indexed.total\n    if (!(end > 0)) continue\n\n    const count = Math.max(1, Math.round(end / interSegmentDistance))\n    const increment = 1 / count\n    const eps = Math.max(\n      end * 1e-4,\n      Math.min(interSegmentDistance * 0.35, end * 0.01),\n    )\n\n    for (let i = 0; i < count; i++) {\n      const posFrac = (startNorm + i * increment) % 1\n      const idx = posFrac * end\n      const idxM = closed\n        ? wrapIndex(idx - eps, end)\n        : clamp(idx - eps, 0, end)\n      const idxP = closed\n        ? wrapIndex(idx + eps, end)\n        : clamp(idx + eps, 0, end)\n\n      const pm = indexed.pointAt(idxM)\n      const pp = indexed.pointAt(idxP)\n      const pc = indexed.pointAt(idx)\n\n      const tx = pp.x - pm.x\n      const ty = pp.y - pm.y\n      const tlen = Math.hypot(tx, ty)\n      if (tlen === 0) continue\n\n      const nx = -ty / tlen\n      const ny = tx / tlen\n      const normalAngle = Math.atan2(ny, nx)\n      const L = lengthFn(pc.x, pc.y, posFrac, normalAngle)\n      if (!(L > 0)) continue\n      const half = L * 0.5\n      edges.push(\n        segment(\n          vec2(pc.x - nx * half, pc.y - ny * half),\n          vec2(pc.x + nx * half, pc.y + ny * half),\n        ),\n      )\n    }\n  }\n\n  return edges\n}\n\nexport function filterByMinLength(\n  segments: Segment[],\n  minLength: number,\n): Segment[] {\n  return segments.filter((s) => segmentLength(s) >= minLength)\n}\n\nexport function filterAxisAligned(\n  segments: Segment[],\n  angleDelta: number,\n): Segment[] {\n  return segments.filter((s) => {\n    const ang = Math.abs(Math.atan2(s.b.y - s.a.y, s.b.x - s.a.x))\n    const norm = Math.min(ang % Math.PI, Math.PI - (ang % Math.PI))\n    const nearH = norm <= angleDelta || Math.abs(norm - Math.PI) <= angleDelta\n    const nearV = Math.abs(norm - Math.PI / 2) <= angleDelta\n    return !(nearH || nearV)\n  })\n}\n\nexport function segmentLength(s: Segment): number {\n  const dx = s.b.x - s.a.x\n  const dy = s.b.y - s.a.y\n  return Math.hypot(dx, dy)\n}\n\nexport function segmentsToOpenPaths(segments: Segment[]) {\n  return segments.map((s) => ({\n    rings: [[s.a, s.b]],\n    closed: false as const,\n  }))\n}\n\nexport const segmentSet = {\n  parallelSegments,\n  stochasticSegments,\n  weaveSegments,\n  perpendicularPathSegments,\n  filterByMinLength,\n  filterAxisAligned,\n  segmentLength,\n  segmentsToOpenPaths,\n}\n\nfunction floorMod(n: number, m: number): number {\n  return ((n % m) + m) % m\n}\n\nfunction clamp(v: number, lo: number, hi: number): number {\n  return Math.max(lo, Math.min(hi, v))\n}\n\nfunction wrapIndex(idx: number, end: number): number {\n  if (end <= 0) return 0\n  let x = idx % end\n  if (x < 0) x += end\n  return x\n}\n\nfunction shoelace(ring: Vec2[]): number {\n  let sum = 0\n  for (let i = 0; i < ring.length; i++) {\n    const a = ring[i]!\n    const b = ring[(i + 1) % ring.length]!\n    sum += a.x * b.y - b.x * a.y\n  }\n  return sum / 2\n}\n\n/** Proper segment intersection (shared endpoint counts as intersect). */\nfunction segmentsIntersect(a: Vec2, b: Vec2, c: Vec2, d: Vec2): boolean {\n  return (\n    ccw(a, c, d) !== ccw(b, c, d) && ccw(a, b, c) !== ccw(a, b, d)\n  )\n}\n\nfunction ccw(a: Vec2, b: Vec2, c: Vec2): boolean {\n  return (c.y - a.y) * (b.x - a.x) > (b.y - a.y) * (c.x - a.x)\n}\n\nfunction mulberry32(seed: number): () => number {\n  return function () {\n    let t = (seed += 0x6d2b79f5)\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n\nfunction lengthIndex(ring: Vec2[], closed: boolean) {\n  const n = ring.length\n  const edgeCount = closed ? n : n - 1\n  const lengths: number[] = []\n  let total = 0\n  for (let i = 0; i < edgeCount; i++) {\n    const a = ring[i]!\n    const b = ring[(i + 1) % n]!\n    const L = Math.hypot(b.x - a.x, b.y - a.y)\n    lengths.push(L)\n    total += L\n  }\n  return {\n    total,\n    pointAt(dist: number): Vec2 {\n      let remain = dist\n      if (remain <= 0) return { ...ring[0]! }\n      if (remain >= total) return { ...ring[closed ? 0 : n - 1]! }\n      for (let i = 0; i < lengths.length; i++) {\n        const L = lengths[i]!\n        if (remain <= L || i === lengths.length - 1) {\n          const t = L < 1e-12 ? 0 : remain / L\n          const a = ring[i]!\n          const b = ring[(i + 1) % n]!\n          return {\n            x: a.x + (b.x - a.x) * t,\n            y: a.y + (b.y - a.y) * t,\n          }\n        }\n        remain -= L\n      }\n      return { ...ring[0]! }\n    },\n  }\n}\n\nexport type { Vec2 }\n"]}

package/dist/shapeBoolean/index.d.ts

@@ -1,6 +1,5 @@
-import { P as Path } from '../path-0RjhYjJs.js';
-import { G as Group } from '../group-BNjVVYSQ.js';
-import '../vec2-CWyXN1Wj.js';
+import { P as Path } from '../path-Boeshk9L.js';
+import { G as Group } from '../group-YVmSJuGo.js';
 
 /** Union of two closed paths. */
 declare function union(a: Path, b: Path): Group;

package/dist/svg/index.d.ts

@@ -1,6 +1,5 @@
-import { G as Group } from '../group-BNjVVYSQ.js';
-import { R as Ring } from '../path-0RjhYjJs.js';
-import '../vec2-CWyXN1Wj.js';
+import { G as Group } from '../group-YVmSJuGo.js';
+import { R as Ring } from '../path-Boeshk9L.js';
 
 /**
  * Parse a subset of SVG into a geometry group.

package/dist/tiling/index.d.ts

@@ -1,6 +1,5 @@
-import { P as Path } from '../path-0RjhYjJs.js';
-import { G as Group } from '../group-BNjVVYSQ.js';
-import '../vec2-CWyXN1Wj.js';
+import { P as Path } from '../path-Boeshk9L.js';
+import { G as Group } from '../group-YVmSJuGo.js';
 
 /** Axis-aligned square cells covering a box. */
 declare function squareGrid(spacing: number, minX: number, minY: number, maxX: number, maxY: number): Group;
@@ -19,6 +18,12 @@ declare function triangleSubdivision(faces: Path[], depth?: number): Group;
 declare function sliceDivision(p: Path, spacing: number, angle?: number): Group;
 /** Parallel hatch-like strip division (alias of sliceDivision). */
 declare function hatchSubdivision(p: Path, spacing: number, angle?: number): Group;
+/**
+ * Cellular partition of a rectangle using arcs from circles seeded on the
+ * boundary (PGS `arcDivision`). Each circle radius is large enough to hit at
+ * least two distinct sides.
+ */
+declare function arcDivision(width: number, height: number, arcs: number, seed?: number, circlePoints?: number): Group;
 declare const tiling: {
     squareGrid: typeof squareGrid;
     hexTiling: typeof hexTiling;
@@ -27,6 +32,7 @@ declare const tiling: {
     triangleSubdivision: typeof triangleSubdivision;
     sliceDivision: typeof sliceDivision;
     hatchSubdivision: typeof hatchSubdivision;
+    arcDivision: typeof arcDivision;
 };
 
-export { hatchSubdivision, hexTiling, quadSubdivision, rectSubdivision, sliceDivision, squareGrid, tiling, triangleSubdivision };
+export { arcDivision, hatchSubdivision, hexTiling, quadSubdivision, rectSubdivision, sliceDivision, squareGrid, tiling, triangleSubdivision };