pattapatta 0.2.0

package/dist/tiling/index.js

@@ -0,0 +1,344 @@
+import { FillRule, intersectD, isPositiveD, pointInPolygonD, PointInPolygonResult } from 'clipper2-ts';
+
+// src/types/vec2.ts
+function vec2(x, y) {
+  return { x, y };
+}
+function cloneVec2(v) {
+  return { x: v.x, y: v.y };
+}
+function equalsVec2(a, b, eps = 1e-9) {
+  return Math.abs(a.x - b.x) <= eps && Math.abs(a.y - b.y) <= eps;
+}
+
+// src/types/path.ts
+function path(rings, closed = true) {
+  return {
+    rings: rings.map((ring) => ring.map(cloneVec2)),
+    closed
+  };
+}
+function polygon(exterior, holes = []) {
+  return path([exterior, ...holes], true);
+}
+function normalizeRing(ring, eps = 1e-9) {
+  if (ring.length < 2) return ring.map(cloneVec2);
+  const first = ring[0];
+  const last = ring[ring.length - 1];
+  if (first && last && equalsVec2(first, last, eps)) {
+    return ring.slice(0, -1).map(cloneVec2);
+  }
+  return ring.map(cloneVec2);
+}
+function clonePath(p) {
+  return {
+    closed: p.closed,
+    rings: p.rings.map((ring) => ring.map(cloneVec2))
+  };
+}
+
+// src/types/group.ts
+function group(paths = []) {
+  return { paths: paths.map(clonePath) };
+}
+var DEFAULT_FILL_RULE = FillRule.NonZero;
+function ringToPathD(ring) {
+  const pts = [];
+  for (const v of normalizeRing(ring)) {
+    pts.push({ x: v.x, y: v.y, z: 0 });
+  }
+  return pts;
+}
+function pathToPathsD(p) {
+  if (!p.closed || p.rings.length === 0) {
+    throw new Error("Boolean ops require a closed path with at least one ring");
+  }
+  return p.rings.map((ring) => ringToPathD(ring));
+}
+function pathsDToGroup(paths) {
+  if (paths.length === 0) return group([]);
+  const outers = [];
+  const holes = [];
+  for (const pd of paths) {
+    const ring = pathDToRing(pd);
+    if (ring.length < 3) continue;
+    if (isPositiveD(pd)) {
+      outers.push({ ring, holes: [] });
+    } else {
+      holes.push(ring);
+    }
+  }
+  for (const hole of holes) {
+    const sample = hole[0];
+    if (!sample) continue;
+    let assigned = false;
+    for (const outer of outers) {
+      if (pointInRing(sample, outer.ring)) {
+        outer.holes.push(hole);
+        assigned = true;
+        break;
+      }
+    }
+    if (!assigned) {
+      outers.push({ ring: [...hole].reverse(), holes: [] });
+    }
+  }
+  return group(outers.map((o) => path([o.ring, ...o.holes], true)));
+}
+function pathDToRing(pd) {
+  return normalizeRing(pd.map((p) => vec2(p.x, p.y)));
+}
+function pointInRing(point, ring) {
+  const result = pointInPolygonD(
+    { x: point.x, y: point.y, z: 0 },
+    ringToPathD(ring)
+  );
+  return result === PointInPolygonResult.IsInside || result === PointInPolygonResult.IsOn;
+}
+function clipIntersect(a, b) {
+  return intersectD(a, b, DEFAULT_FILL_RULE);
+}
+
+// src/predicates/index.ts
+function bounds(p) {
+  let minX = Infinity;
+  let minY = Infinity;
+  let maxX = -Infinity;
+  let maxY = -Infinity;
+  for (const ring of p.rings) {
+    for (const v of ring) {
+      minX = Math.min(minX, v.x);
+      minY = Math.min(minY, v.y);
+      maxX = Math.max(maxX, v.x);
+      maxY = Math.max(maxY, v.y);
+    }
+  }
+  if (!Number.isFinite(minX)) {
+    return { minX: 0, minY: 0, maxX: 0, maxY: 0 };
+  }
+  return { minX, minY, maxX, maxY };
+}
+
+// src/construction/index.ts
+function createRect(x, y, width, height) {
+  return polygon([
+    { x, y },
+    { x: x + width, y },
+    { x: x + width, y: y + height },
+    { x, y: y + height }
+  ]);
+}
+
+// src/shapeBoolean/index.ts
+function ensureClosed(p) {
+  if (!p.closed) {
+    throw new Error("shapeBoolean requires closed paths");
+  }
+  return p;
+}
+function intersect(a, b) {
+  const result = clipIntersect(
+    pathToPathsD(ensureClosed(a)),
+    pathToPathsD(ensureClosed(b))
+  );
+  return pathsDToGroup(result);
+}
+
+// src/processing/index.ts
+function slice(p, a, b) {
+  const dx = b.x - a.x;
+  const dy = b.y - a.y;
+  const len = Math.hypot(dx, dy);
+  if (len < 1e-12) return group([p]);
+  const nx = -dy / len;
+  const ny = dx / len;
+  const bb = bounds(p);
+  const span = Math.hypot(bb.maxX - bb.minX, bb.maxY - bb.minY) * 4 + 10;
+  const left = halfPlanePoly(a, nx, ny, span);
+  const right = halfPlanePoly(a, -nx, -ny, span);
+  const parts = [];
+  for (const half of [left, right]) {
+    parts.push(...intersect(p, half).paths);
+  }
+  return group(parts);
+}
+function halfPlanePoly(origin, nx, ny, span) {
+  const tx = -ny;
+  const ty = nx;
+  const o = origin;
+  return polygon([
+    {
+      x: o.x - tx * span + nx * 1e-9,
+      y: o.y - ty * span + ny * 1e-9
+    },
+    {
+      x: o.x + tx * span + nx * 1e-9,
+      y: o.y + ty * span + ny * 1e-9
+    },
+    {
+      x: o.x + tx * span + nx * span,
+      y: o.y + ty * span + ny * span
+    },
+    {
+      x: o.x - tx * span + nx * span,
+      y: o.y - ty * span + ny * span
+    }
+  ]);
+}
+
+// src/tiling/index.ts
+function squareGrid(spacing, minX, minY, maxX, maxY) {
+  const s = Math.max(spacing, 1e-9);
+  const paths = [];
+  for (let x = minX; x < maxX - 1e-12; x += s) {
+    for (let y = minY; y < maxY - 1e-12; y += s) {
+      const w = Math.min(s, maxX - x);
+      const h = Math.min(s, maxY - y);
+      if (w > 1e-12 && h > 1e-12) paths.push(createRect(x, y, w, h));
+    }
+  }
+  return group(paths);
+}
+function hexTiling(spacing, minX, minY, maxX, maxY) {
+  const s = Math.max(spacing, 1e-9);
+  const r = s / 2;
+  const dx = s * 0.75;
+  const dy = s * Math.sqrt(3) * 0.5;
+  const paths = [];
+  let row = 0;
+  for (let y = minY + r; y <= maxY + r; y += dy, row++) {
+    const x0 = minX + r + (row % 2 === 0 ? 0 : dx * 0.5);
+    for (let x = x0; x <= maxX + r; x += dx) {
+      paths.push(hexagon(x, y, r));
+    }
+  }
+  return group(paths);
+}
+function hexagon(cx, cy, r) {
+  const ring = [];
+  for (let i = 0; i < 6; i++) {
+    const t = Math.PI / 180 * (60 * i - 30);
+    ring.push({ x: cx + Math.cos(t) * r, y: cy + Math.sin(t) * r });
+  }
+  return polygon(ring);
+}
+function rectSubdivision(p, nx, ny) {
+  const b = bounds(p);
+  const cols = Math.max(1, Math.floor(nx));
+  const rows = Math.max(1, Math.floor(ny));
+  const dw = (b.maxX - b.minX) / cols;
+  const dh = (b.maxY - b.minY) / rows;
+  const paths = [];
+  for (let i = 0; i < cols; i++) {
+    for (let j = 0; j < rows; j++) {
+      const cell = createRect(
+        b.minX + i * dw,
+        b.minY + j * dh,
+        dw,
+        dh
+      );
+      paths.push(...intersect(p, cell).paths);
+    }
+  }
+  return group(paths);
+}
+function quadSubdivision(faces, depth = 1) {
+  let cur = faces;
+  const d = Math.max(0, Math.floor(depth));
+  for (let i = 0; i < d; i++) {
+    const next = [];
+    for (const f of cur) {
+      next.push(...subdivideQuad(f));
+    }
+    cur = next;
+  }
+  return group(cur);
+}
+function subdivideQuad(p) {
+  const ring = p.rings[0];
+  if (!ring || ring.length < 4) return [p];
+  const [a, b, c, d] = ring;
+  if (!a || !b || !c || !d) return [p];
+  const mab = mid(a, b);
+  const mbc = mid(b, c);
+  const mcd = mid(c, d);
+  const mda = mid(d, a);
+  const cen = mid(mid(a, c), mid(b, d));
+  return [
+    polygon([a, mab, cen, mda]),
+    polygon([mab, b, mbc, cen]),
+    polygon([cen, mbc, c, mcd]),
+    polygon([mda, cen, mcd, d])
+  ];
+}
+function triangleSubdivision(faces, depth = 1) {
+  let cur = faces;
+  const d = Math.max(0, Math.floor(depth));
+  for (let i = 0; i < d; i++) {
+    const next = [];
+    for (const f of cur) {
+      next.push(...subdivideTriangle(f));
+    }
+    cur = next;
+  }
+  return group(cur);
+}
+function subdivideTriangle(p) {
+  const ring = p.rings[0];
+  if (!ring || ring.length < 3) return [p];
+  const a = ring[0];
+  const b = ring[1];
+  const c = ring[2];
+  const mab = mid(a, b);
+  const mbc = mid(b, c);
+  const mca = mid(c, a);
+  return [
+    polygon([a, mab, mca]),
+    polygon([mab, b, mbc]),
+    polygon([mca, mbc, c]),
+    polygon([mab, mbc, mca])
+  ];
+}
+function sliceDivision(p, spacing, angle = 0) {
+  const s = Math.max(spacing, 1e-9);
+  const b = bounds(p);
+  const cx = (b.minX + b.maxX) / 2;
+  const cy = (b.minY + b.maxY) / 2;
+  const diag = Math.hypot(b.maxX - b.minX, b.maxY - b.minY) + s;
+  const ux = Math.cos(angle);
+  const uy = Math.sin(angle);
+  const nx = -uy;
+  const ny = ux;
+  const parts = [p];
+  for (let t = -diag; t <= diag; t += s) {
+    const a = { x: cx + nx * t - ux * diag, y: cy + ny * t - uy * diag };
+    const bb = { x: cx + nx * t + ux * diag, y: cy + ny * t + uy * diag };
+    const next = [];
+    for (const piece of parts) {
+      const g = slice(piece, a, bb);
+      next.push(...g.paths.length ? g.paths : [piece]);
+    }
+    parts.length = 0;
+    parts.push(...next);
+  }
+  return group(parts);
+}
+function hatchSubdivision(p, spacing, angle = 0) {
+  return sliceDivision(p, spacing, angle);
+}
+function mid(a, b) {
+  return { x: (a.x + b.x) / 2, y: (a.y + b.y) / 2 };
+}
+var tiling = {
+  squareGrid,
+  hexTiling,
+  rectSubdivision,
+  quadSubdivision,
+  triangleSubdivision,
+  sliceDivision,
+  hatchSubdivision
+};
+
+export { hatchSubdivision, hexTiling, quadSubdivision, rectSubdivision, sliceDivision, squareGrid, tiling, triangleSubdivision };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/dist/tiling/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/types/vec2.ts","../../src/types/path.ts","../../src/types/group.ts","../../src/clipper/convert.ts","../../src/predicates/index.ts","../../src/construction/index.ts","../../src/shapeBoolean/index.ts","../../src/processing/index.ts","../../src/tiling/index.ts"],"names":[],"mappings":";;;AAMO,SAAS,IAAA,CAAK,GAAW,CAAA,EAAiB;AAC/C,EAAA,OAAO,EAAE,GAAG,CAAA,EAAE;AAChB;AAEO,SAAS,UAAU,CAAA,EAAe;AACvC,EAAA,OAAO,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,EAAE,CAAA,EAAE;AAC1B;AAEO,SAAS,UAAA,CAAW,CAAA,EAAS,CAAA,EAAS,GAAA,GAAM,IAAA,EAAe;AAChE,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,EAAE,CAAC,CAAA,IAAK,GAAA,IAAO,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,CAAA,IAAK,GAAA;AAC9D;;;ACAO,SAAS,IAAA,CAAK,KAAA,EAAe,MAAA,GAAS,IAAA,EAAY;AACvD,EAAA,OAAO;AAAA,IACL,KAAA,EAAO,MAAM,GAAA,CAAI,CAAC,SAAS,IAAA,CAAK,GAAA,CAAI,SAAS,CAAC,CAAA;AAAA,IAC9C;AAAA,GACF;AACF;AAMO,SAAS,OAAA,CAAQ,QAAA,EAAgB,KAAA,GAAgB,EAAC,EAAS;AAChE,EAAA,OAAO,KAAK,CAAC,QAAA,EAAU,GAAG,KAAK,GAAG,IAAI,CAAA;AACxC;AAGO,SAAS,aAAA,CAAc,IAAA,EAAY,GAAA,GAAM,IAAA,EAAY;AAC1D,EAAA,IAAI,KAAK,MAAA,GAAS,CAAA,EAAG,OAAO,IAAA,CAAK,IAAI,SAAS,CAAA;AAC9C,EAAA,MAAM,KAAA,GAAQ,KAAK,CAAC,CAAA;AACpB,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AACjC,EAAA,IAAI,SAAS,IAAA,IAAQ,UAAA,CAAW,KAAA,EAAO,IAAA,EAAM,GAAG,CAAA,EAAG;AACjD,IAAA,OAAO,KAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA,CAAE,IAAI,SAAS,CAAA;AAAA,EACxC;AACA,EAAA,OAAO,IAAA,CAAK,IAAI,SAAS,CAAA;AAC3B;AAEO,SAAS,UAAU,CAAA,EAAe;AACvC,EAAA,OAAO;AAAA,IACL,QAAQ,CAAA,CAAE,MAAA;AAAA,IACV,KAAA,EAAO,EAAE,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,GAAA,CAAI,SAAS,CAAC;AAAA,GAClD;AACF;;;ACrCO,SAAS,KAAA,CAAM,KAAA,GAAgB,EAAC,EAAU;AAC/C,EAAA,OAAO,EAAE,KAAA,EAAO,KAAA,CAAM,GAAA,CAAI,SAAS,CAAA,EAAE;AACvC;ACKO,IAAM,oBAAoB,QAAA,CAAS,OAAA;AAEnC,SAAS,YAAY,IAAA,EAAmB;AAC7C,EAAA,MAAM,MAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,CAAA,IAAK,aAAA,CAAc,IAAI,CAAA,EAAG;AACnC,IAAA,GAAA,CAAI,IAAA,CAAK,EAAE,CAAA,EAAG,CAAA,CAAE,CAAA,EAAG,GAAG,CAAA,CAAE,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA;AAAA,EACnC;AACA,EAAA,OAAO,GAAA;AACT;AAGO,SAAS,aAAa,CAAA,EAAiB;AAC5C,EAAA,IAAI,CAAC,CAAA,CAAE,MAAA,IAAU,CAAA,CAAE,KAAA,CAAM,WAAW,CAAA,EAAG;AACrC,IAAA,MAAM,IAAI,MAAM,0DAA0D,CAAA;AAAA,EAC5E;AACA,EAAA,OAAO,EAAE,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS,WAAA,CAAY,IAAI,CAAC,CAAA;AAChD;AAEO,SAAS,cAAc,KAAA,EAAsB;AAClD,EAAA,IAAI,MAAM,MAAA,KAAW,CAAA,EAAG,OAAO,KAAA,CAAM,EAAE,CAAA;AAEvC,EAAA,MAAM,SAA0C,EAAC;AACjD,EAAA,MAAM,QAAgB,EAAC;AAEvB,EAAA,KAAA,MAAW,MAAM,KAAA,EAAO;AACtB,IAAA,MAAM,IAAA,GAAO,YAAY,EAAE,CAAA;AAC3B,IAAA,IAAI,IAAA,CAAK,SAAS,CAAA,EAAG;AACrB,IAAA,IAAI,WAAA,CAAY,EAAE,CAAA,EAAG;AACnB,MAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,KAAA,EAAO,IAAI,CAAA;AAAA,IACjC,CAAA,MAAO;AACL,MAAA,KAAA,CAAM,KAAK,IAAI,CAAA;AAAA,IACjB;AAAA,EACF;AAEA,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,MAAM,MAAA,GAAS,KAAK,CAAC,CAAA;AACrB,IAAA,IAAI,CAAC,MAAA,EAAQ;AACb,IAAA,IAAI,QAAA,GAAW,KAAA;AACf,IAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,MAAA,IAAI,WAAA,CAAY,MAAA,EAAQ,KAAA,CAAM,IAAI,CAAA,EAAG;AACnC,QAAA,KAAA,CAAM,KAAA,CAAM,KAAK,IAAI,CAAA;AACrB,QAAA,QAAA,GAAW,IAAA;AACX,QAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,IAAI,CAAC,QAAA,EAAU;AAEb,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,CAAC,GAAG,IAAI,CAAA,CAAE,OAAA,EAAQ,EAAG,KAAA,EAAO,EAAC,EAAG,CAAA;AAAA,IACtD;AAAA,EACF;AAEA,EAAA,OAAO,KAAA,CAAM,MAAA,CAAO,GAAA,CAAI,CAAC,MAAM,IAAA,CAAK,CAAC,CAAA,CAAE,IAAA,EAAM,GAAG,CAAA,CAAE,KAAK,CAAA,EAAG,IAAI,CAAC,CAAC,CAAA;AAClE;AAEO,SAAS,YAAY,EAAA,EAAiB;AAC3C,EAAA,OAAO,aAAA,CAAc,EAAA,CAAG,GAAA,CAAI,CAAC,CAAA,KAAM,IAAA,CAAK,CAAA,CAAE,CAAA,EAAG,CAAA,CAAE,CAAC,CAAC,CAAC,CAAA;AACpD;AAEO,SAAS,WAAA,CAAY,OAAa,IAAA,EAAqB;AAC5D,EAAA,MAAM,MAAA,GAAS,eAAA;AAAA,IACb,EAAE,GAAG,KAAA,CAAM,CAAA,EAAG,GAAG,KAAA,CAAM,CAAA,EAAG,GAAG,CAAA,EAAE;AAAA,IAC/B,YAAY,IAAI;AAAA,GAClB;AACA,EAAA,OACE,MAAA,KAAW,oBAAA,CAAqB,QAAA,IAChC,MAAA,KAAW,oBAAA,CAAqB,IAAA;AAEpC;AAMO,SAAS,aAAA,CAAc,GAAW,CAAA,EAAmB;AAC1D,EAAA,OAAO,UAAA,CAAW,CAAA,EAAG,CAAA,EAAG,iBAAiB,CAAA;AAC3C;;;ACjBO,SAAS,OAAO,CAAA,EAKrB;AACA,EAAA,IAAI,IAAA,GAAO,QAAA;AACX,EAAA,IAAI,IAAA,GAAO,QAAA;AACX,EAAA,IAAI,IAAA,GAAO,CAAA,QAAA;AACX,EAAA,IAAI,IAAA,GAAO,CAAA,QAAA;AACX,EAAA,KAAA,MAAW,IAAA,IAAQ,EAAE,KAAA,EAAO;AAC1B,IAAA,KAAA,MAAW,KAAK,IAAA,EAAM;AACpB,MAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,CAAC,CAAA;AACzB,MAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,CAAC,CAAA;AACzB,MAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,CAAC,CAAA;AACzB,MAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,IAAA,EAAM,CAAA,CAAE,CAAC,CAAA;AAAA,IAC3B;AAAA,EACF;AACA,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,IAAI,CAAA,EAAG;AAC1B,IAAA,OAAO,EAAE,MAAM,CAAA,EAAG,IAAA,EAAM,GAAG,IAAA,EAAM,CAAA,EAAG,MAAM,CAAA,EAAE;AAAA,EAC9C;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,IAAA,EAAK;AAClC;;;ACpFO,SAAS,UAAA,CACd,CAAA,EACA,CAAA,EACA,KAAA,EACA,MAAA,EACM;AACN,EAAA,OAAO,OAAA,CAAQ;AAAA,IACb,EAAE,GAAG,CAAA,EAAE;AAAA,IACP,EAAE,CAAA,EAAG,CAAA,GAAI,KAAA,EAAO,CAAA,EAAE;AAAA,IAClB,EAAE,CAAA,EAAG,CAAA,GAAI,KAAA,EAAO,CAAA,EAAG,IAAI,MAAA,EAAO;AAAA,IAC9B,EAAE,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,MAAA;AAAO,GACpB,CAAA;AACH;;;ACdA,SAAS,aAAa,CAAA,EAAe;AACnC,EAAA,IAAI,CAAC,EAAE,MAAA,EAAQ;AACb,IAAA,MAAM,IAAI,MAAM,oCAAoC,CAAA;AAAA,EACtD;AACA,EAAA,OAAO,CAAA;AACT;AAmBO,SAAS,SAAA,CAAU,GAAS,CAAA,EAAgB;AACjD,EAAA,MAAM,MAAA,GAAS,aAAA;AAAA,IACb,YAAA,CAAa,YAAA,CAAa,CAAC,CAAC,CAAA;AAAA,IAC5B,YAAA,CAAa,YAAA,CAAa,CAAC,CAAC;AAAA,GAC9B;AACA,EAAA,OAAO,cAAc,MAAM,CAAA;AAC7B;;;AC4GO,SAAS,KAAA,CAAM,CAAA,EAAS,CAAA,EAAS,CAAA,EAAgB;AACtD,EAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,EAAA,MAAM,EAAA,GAAK,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA;AACnB,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,KAAA,CAAM,EAAA,EAAI,EAAE,CAAA;AAC7B,EAAA,IAAI,MAAM,KAAA,EAAO,OAAO,KAAA,CAAM,CAAC,CAAC,CAAC,CAAA;AACjC,EAAA,MAAM,EAAA,GAAK,CAAC,EAAA,GAAK,GAAA;AACjB,EAAA,MAAM,KAAK,EAAA,GAAK,GAAA;AAChB,EAAA,MAAM,EAAA,GAAK,OAAO,CAAC,CAAA;AACnB,EAAA,MAAM,IAAA,GACJ,IAAA,CAAK,KAAA,CAAM,EAAA,CAAG,IAAA,GAAO,EAAA,CAAG,IAAA,EAAM,EAAA,CAAG,IAAA,GAAO,EAAA,CAAG,IAAI,CAAA,GAAI,CAAA,GAAI,EAAA;AACzD,EAAA,MAAM,IAAA,GAAO,aAAA,CAAc,CAAA,EAAG,EAAA,EAAI,IAAI,IAAI,CAAA;AAC1C,EAAA,MAAM,QAAQ,aAAA,CAAc,CAAA,EAAG,CAAC,EAAA,EAAI,CAAC,IAAI,IAAI,CAAA;AAC7C,EAAA,MAAM,QAAgB,EAAC;AACvB,EAAA,KAAA,MAAW,IAAA,IAAQ,CAAC,IAAA,EAAM,KAAK,CAAA,EAAG;AAChC,IAAA,KAAA,CAAM,KAAK,GAAG,SAAA,CAAU,CAAA,EAAG,IAAI,EAAE,KAAK,CAAA;AAAA,EACxC;AACA,EAAA,OAAO,MAAM,KAAK,CAAA;AACpB;AAkCA,SAAS,aAAA,CACP,MAAA,EACA,EAAA,EACA,EAAA,EACA,IAAA,EACM;AAEN,EAAA,MAAM,KAAK,CAAC,EAAA;AACZ,EAAA,MAAM,EAAA,GAAK,EAAA;AACX,EAAA,MAAM,CAAA,GAAI,MAAA;AACV,EAAA,OAAO,OAAA,CAAQ;AAAA,IACb;AAAA,MACE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAA,GAAK,OAAO,EAAA,GAAK,IAAA;AAAA,MAC1B,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAA,GAAK,OAAO,EAAA,GAAK;AAAA,KAC5B;AAAA,IACA;AAAA,MACE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAA,GAAK,OAAO,EAAA,GAAK,IAAA;AAAA,MAC1B,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAA,GAAK,OAAO,EAAA,GAAK;AAAA,KAC5B;AAAA,IACA;AAAA,MACE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAA,GAAK,OAAO,EAAA,GAAK,IAAA;AAAA,MAC1B,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAA,GAAK,OAAO,EAAA,GAAK;AAAA,KAC5B;AAAA,IACA;AAAA,MACE,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAA,GAAK,OAAO,EAAA,GAAK,IAAA;AAAA,MAC1B,CAAA,EAAG,CAAA,CAAE,CAAA,GAAI,EAAA,GAAK,OAAO,EAAA,GAAK;AAAA;AAC5B,GACD,CAAA;AACH;;;AC5NO,SAAS,UAAA,CACd,OAAA,EACA,IAAA,EACA,IAAA,EACA,MACA,IAAA,EACO;AACP,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,IAAI,CAAA;AAChC,EAAA,MAAM,QAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,IAAI,IAAA,EAAM,CAAA,GAAI,IAAA,GAAO,KAAA,EAAO,KAAK,CAAA,EAAG;AAC3C,IAAA,KAAA,IAAS,IAAI,IAAA,EAAM,CAAA,GAAI,IAAA,GAAO,KAAA,EAAO,KAAK,CAAA,EAAG;AAC3C,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,OAAO,CAAC,CAAA;AAC9B,MAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,OAAO,CAAC,CAAA;AAC9B,MAAA,IAAI,CAAA,GAAI,KAAA,IAAS,CAAA,GAAI,KAAA,EAAO,KAAA,CAAM,IAAA,CAAK,UAAA,CAAW,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC/D;AAAA,EACF;AACA,EAAA,OAAO,MAAM,KAAK,CAAA;AACpB;AAGO,SAAS,SAAA,CACd,OAAA,EACA,IAAA,EACA,IAAA,EACA,MACA,IAAA,EACO;AACP,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,IAAI,CAAA;AAChC,EAAA,MAAM,IAAI,CAAA,GAAI,CAAA;AACd,EAAA,MAAM,KAAK,CAAA,GAAI,IAAA;AACf,EAAA,MAAM,EAAA,GAAK,CAAA,GAAI,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,GAAI,GAAA;AAC9B,EAAA,MAAM,QAAgB,EAAC;AACvB,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,KAAA,IAAS,CAAA,GAAI,OAAO,CAAA,EAAG,CAAA,IAAK,OAAO,CAAA,EAAG,CAAA,IAAK,IAAI,GAAA,EAAA,EAAO;AACpD,IAAA,MAAM,KAAK,IAAA,GAAO,CAAA,IAAK,MAAM,CAAA,KAAM,CAAA,GAAI,IAAI,EAAA,GAAK,GAAA,CAAA;AAChD,IAAA,KAAA,IAAS,IAAI,EAAA,EAAI,CAAA,IAAK,IAAA,GAAO,CAAA,EAAG,KAAK,EAAA,EAAI;AACvC,MAAA,KAAA,CAAM,IAAA,CAAK,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,CAAC,CAAC,CAAA;AAAA,IAC7B;AAAA,EACF;AACA,EAAA,OAAO,MAAM,KAAK,CAAA;AACpB;AAEA,SAAS,OAAA,CAAQ,EAAA,EAAY,EAAA,EAAY,CAAA,EAAiB;AACxD,EAAA,MAAM,OAAe,EAAC;AACtB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,MAAM,CAAA,GAAK,IAAA,CAAK,EAAA,GAAK,GAAA,IAAQ,KAAK,CAAA,GAAI,EAAA,CAAA;AACtC,IAAA,IAAA,CAAK,KAAK,EAAE,CAAA,EAAG,EAAA,GAAK,IAAA,CAAK,IAAI,CAAC,CAAA,GAAI,CAAA,EAAG,CAAA,EAAG,KAAK,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,GAAI,GAAG,CAAA;AAAA,EAChE;AACA,EAAA,OAAO,QAAQ,IAAI,CAAA;AACrB;AAGO,SAAS,eAAA,CAAgB,CAAA,EAAS,EAAA,EAAY,EAAA,EAAmB;AACtE,EAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,EAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,EAAE,CAAC,CAAA;AACvC,EAAA,MAAM,OAAO,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,EAAE,CAAC,CAAA;AACvC,EAAA,MAAM,EAAA,GAAA,CAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,IAAA,IAAQ,IAAA;AAC/B,EAAA,MAAM,EAAA,GAAA,CAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,IAAA,IAAQ,IAAA;AAC/B,EAAA,MAAM,QAAgB,EAAC;AACvB,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAA,EAAK;AAC7B,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,IAAA,EAAM,CAAA,EAAA,EAAK;AAC7B,MAAA,MAAM,IAAA,GAAO,UAAA;AAAA,QACX,CAAA,CAAE,OAAO,CAAA,GAAI,EAAA;AAAA,QACb,CAAA,CAAE,OAAO,CAAA,GAAI,EAAA;AAAA,QACb,EAAA;AAAA,QACA;AAAA,OACF;AACA,MAAA,KAAA,CAAM,KAAK,GAAG,SAAA,CAAU,CAAA,EAAG,IAAI,EAAE,KAAK,CAAA;AAAA,IACxC;AAAA,EACF;AACA,EAAA,OAAO,MAAM,KAAK,CAAA;AACpB;AAGO,SAAS,eAAA,CAAgB,KAAA,EAAe,KAAA,GAAQ,CAAA,EAAU;AAC/D,EAAA,IAAI,GAAA,GAAM,KAAA;AACV,EAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAA;AACvC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,MAAM,OAAe,EAAC;AACtB,IAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,MAAA,IAAA,CAAK,IAAA,CAAK,GAAG,aAAA,CAAc,CAAC,CAAC,CAAA;AAAA,IAC/B;AACA,IAAA,GAAA,GAAM,IAAA;AAAA,EACR;AACA,EAAA,OAAO,MAAM,GAAG,CAAA;AAClB;AAEA,SAAS,cAAc,CAAA,EAAiB;AACtC,EAAA,MAAM,IAAA,GAAO,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA;AACtB,EAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,CAAK,SAAS,CAAA,EAAG,OAAO,CAAC,CAAC,CAAA;AACvC,EAAA,MAAM,CAAC,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAC,CAAA,GAAI,IAAA;AACrB,EAAA,IAAI,CAAC,CAAA,IAAK,CAAC,CAAA,IAAK,CAAC,KAAK,CAAC,CAAA,EAAG,OAAO,CAAC,CAAC,CAAA;AACnC,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA;AACpB,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA;AACpB,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA;AACpB,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA;AACpB,EAAA,MAAM,GAAA,GAAM,IAAI,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA,EAAG,GAAA,CAAI,CAAA,EAAG,CAAC,CAAC,CAAA;AACpC,EAAA,OAAO;AAAA,IACL,QAAQ,CAAC,CAAA,EAAG,GAAA,EAAK,GAAA,EAAK,GAAG,CAAC,CAAA;AAAA,IAC1B,QAAQ,CAAC,GAAA,EAAK,CAAA,EAAG,GAAA,EAAK,GAAG,CAAC,CAAA;AAAA,IAC1B,QAAQ,CAAC,GAAA,EAAK,GAAA,EAAK,CAAA,EAAG,GAAG,CAAC,CAAA;AAAA,IAC1B,QAAQ,CAAC,GAAA,EAAK,GAAA,EAAK,GAAA,EAAK,CAAC,CAAC;AAAA,GAC5B;AACF;AAGO,SAAS,mBAAA,CAAoB,KAAA,EAAe,KAAA,GAAQ,CAAA,EAAU;AACnE,EAAA,IAAI,GAAA,GAAM,KAAA;AACV,EAAA,MAAM,IAAI,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAA;AACvC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAA,EAAK;AAC1B,IAAA,MAAM,OAAe,EAAC;AACtB,IAAA,KAAA,MAAW,KAAK,GAAA,EAAK;AACnB,MAAA,IAAA,CAAK,IAAA,CAAK,GAAG,iBAAA,CAAkB,CAAC,CAAC,CAAA;AAAA,IACnC;AACA,IAAA,GAAA,GAAM,IAAA;AAAA,EACR;AACA,EAAA,OAAO,MAAM,GAAG,CAAA;AAClB;AAEA,SAAS,kBAAkB,CAAA,EAAiB;AAC1C,EAAA,MAAM,IAAA,GAAO,CAAA,CAAE,KAAA,CAAM,CAAC,CAAA;AACtB,EAAA,IAAI,CAAC,IAAA,IAAQ,IAAA,CAAK,SAAS,CAAA,EAAG,OAAO,CAAC,CAAC,CAAA;AACvC,EAAA,MAAM,CAAA,GAAI,KAAK,CAAC,CAAA;AAChB,EAAA,MAAM,CAAA,GAAI,KAAK,CAAC,CAAA;AAChB,EAAA,MAAM,CAAA,GAAI,KAAK,CAAC,CAAA;AAChB,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA;AACpB,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA;AACpB,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,CAAA,EAAG,CAAC,CAAA;AACpB,EAAA,OAAO;AAAA,IACL,OAAA,CAAQ,CAAC,CAAA,EAAG,GAAA,EAAK,GAAG,CAAC,CAAA;AAAA,IACrB,OAAA,CAAQ,CAAC,GAAA,EAAK,CAAA,EAAG,GAAG,CAAC,CAAA;AAAA,IACrB,OAAA,CAAQ,CAAC,GAAA,EAAK,GAAA,EAAK,CAAC,CAAC,CAAA;AAAA,IACrB,OAAA,CAAQ,CAAC,GAAA,EAAK,GAAA,EAAK,GAAG,CAAC;AAAA,GACzB;AACF;AAMO,SAAS,aAAA,CACd,CAAA,EACA,OAAA,EACA,KAAA,GAAQ,CAAA,EACD;AACP,EAAA,MAAM,CAAA,GAAI,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,IAAI,CAAA;AAChC,EAAA,MAAM,CAAA,GAAI,OAAO,CAAC,CAAA;AAClB,EAAA,MAAM,EAAA,GAAA,CAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,IAAA,IAAQ,CAAA;AAC/B,EAAA,MAAM,EAAA,GAAA,CAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,IAAA,IAAQ,CAAA;AAC/B,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,KAAA,CAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,IAAA,GAAO,CAAA,CAAE,IAAI,CAAA,GAAI,CAAA;AAC5D,EAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA;AACzB,EAAA,MAAM,EAAA,GAAK,IAAA,CAAK,GAAA,CAAI,KAAK,CAAA;AAEzB,EAAA,MAAM,KAAK,CAAC,EAAA;AACZ,EAAA,MAAM,EAAA,GAAK,EAAA;AACX,EAAA,MAAM,KAAA,GAAgB,CAAC,CAAC,CAAA;AACxB,EAAA,KAAA,IAAS,IAAI,CAAC,IAAA,EAAM,CAAA,IAAK,IAAA,EAAM,KAAK,CAAA,EAAG;AACrC,IAAA,MAAM,CAAA,GAAI,EAAE,CAAA,EAAG,EAAA,GAAK,EAAA,GAAK,CAAA,GAAI,EAAA,GAAK,IAAA,EAAM,CAAA,EAAG,EAAA,GAAK,EAAA,GAAK,CAAA,GAAI,KAAK,IAAA,EAAK;AACnE,IAAA,MAAM,EAAA,GAAK,EAAE,CAAA,EAAG,EAAA,GAAK,EAAA,GAAK,CAAA,GAAI,EAAA,GAAK,IAAA,EAAM,CAAA,EAAG,EAAA,GAAK,EAAA,GAAK,CAAA,GAAI,KAAK,IAAA,EAAK;AACpE,IAAA,MAAM,OAAe,EAAC;AACtB,IAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,MAAA,MAAM,CAAA,GAAI,KAAA,CAAM,KAAA,EAAO,CAAA,EAAG,EAAE,CAAA;AAC5B,MAAA,IAAA,CAAK,IAAA,CAAK,GAAI,CAAA,CAAE,KAAA,CAAM,SAAS,CAAA,CAAE,KAAA,GAAQ,CAAC,KAAK,CAAE,CAAA;AAAA,IACnD;AACA,IAAA,KAAA,CAAM,MAAA,GAAS,CAAA;AACf,IAAA,KAAA,CAAM,IAAA,CAAK,GAAG,IAAI,CAAA;AAAA,EACpB;AACA,EAAA,OAAO,MAAM,KAAK,CAAA;AACpB;AAGO,SAAS,gBAAA,CACd,CAAA,EACA,OAAA,EACA,KAAA,GAAQ,CAAA,EACD;AACP,EAAA,OAAO,aAAA,CAAc,CAAA,EAAG,OAAA,EAAS,KAAK,CAAA;AACxC;AAEA,SAAS,GAAA,CAAI,GAAS,CAAA,EAAe;AACnC,EAAA,OAAO,EAAE,CAAA,EAAA,CAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,CAAA,EAAG,CAAA,EAAA,CAAI,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAA,IAAK,CAAA,EAAE;AAClD;AAEO,IAAM,MAAA,GAAS;AAAA,EACpB,UAAA;AAAA,EACA,SAAA;AAAA,EACA,eAAA;AAAA,EACA,eAAA;AAAA,EACA,mBAAA;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'\nimport { cloneVec2, equalsVec2 } from './vec2.js'\n\n/** Ordered ring of vertices (typically without repeating the closing vertex). */\nexport type Ring = Vec2[]\n\n/**\n * A path: one exterior ring plus optional holes, or an open polyline.\n * `rings[0]` is the exterior (or the open polyline when `closed` is false).\n * Additional rings are holes (only meaningful when `closed` is true).\n */\nexport type Path = {\n  rings: Ring[]\n  closed: boolean\n}\n\nexport function path(rings: Ring[], closed = true): Path {\n  return {\n    rings: rings.map((ring) => ring.map(cloneVec2)),\n    closed,\n  }\n}\n\nexport function polyline(points: Ring): Path {\n  return path([points], false)\n}\n\nexport function polygon(exterior: Ring, holes: Ring[] = []): Path {\n  return path([exterior, ...holes], true)\n}\n\n/** Drop a trailing vertex that duplicates the first (SVG often closes this way). */\nexport function normalizeRing(ring: Ring, eps = 1e-9): Ring {\n  if (ring.length < 2) return ring.map(cloneVec2)\n  const first = ring[0]\n  const last = ring[ring.length - 1]\n  if (first && last && equalsVec2(first, last, eps)) {\n    return ring.slice(0, -1).map(cloneVec2)\n  }\n  return ring.map(cloneVec2)\n}\n\nexport function clonePath(p: Path): Path {\n  return {\n    closed: p.closed,\n    rings: p.rings.map((ring) => ring.map(cloneVec2)),\n  }\n}\n","import type { Path } from './path.js'\nimport { clonePath } from './path.js'\n\n/**\n * Ordered collection of paths. Later entries are “on top” for occlusion-style ops.\n */\nexport type Group = {\n  paths: Path[]\n}\n\nexport function group(paths: Path[] = []): Group {\n  return { paths: paths.map(clonePath) }\n}\n\nexport function groupFromPaths(...paths: Path[]): Group {\n  return group(paths)\n}\n\nexport function cloneGroup(g: Group): Group {\n  return group(g.paths)\n}\n","import {\n  FillRule,\n  areaD,\n  differenceD,\n  intersectD,\n  isPositiveD,\n  pointInPolygonD,\n  PointInPolygonResult,\n  unionD,\n  xorD,\n  type PathD,\n  type PathsD,\n  type PointD,\n} from 'clipper2-ts'\nimport type { Group, Path, Ring, Vec2 } from '../types/index.js'\nimport { group, normalizeRing, path, vec2 } from '../types/index.js'\n\nexport const DEFAULT_FILL_RULE = FillRule.NonZero\n\nexport function ringToPathD(ring: Ring): PathD {\n  const pts: PointD[] = []\n  for (const v of normalizeRing(ring)) {\n    pts.push({ x: v.x, y: v.y, z: 0 })\n  }\n  return pts\n}\n\n/** Closed path → Clipper subject/clip paths (exterior + holes). */\nexport function pathToPathsD(p: Path): PathsD {\n  if (!p.closed || p.rings.length === 0) {\n    throw new Error('Boolean ops require a closed path with at least one ring')\n  }\n  return p.rings.map((ring) => ringToPathD(ring))\n}\n\nexport function pathsDToGroup(paths: PathsD): Group {\n  if (paths.length === 0) return group([])\n\n  const outers: { ring: Ring; holes: Ring[] }[] = []\n  const holes: Ring[] = []\n\n  for (const pd of paths) {\n    const ring = pathDToRing(pd)\n    if (ring.length < 3) continue\n    if (isPositiveD(pd)) {\n      outers.push({ ring, holes: [] })\n    } else {\n      holes.push(ring)\n    }\n  }\n\n  for (const hole of holes) {\n    const sample = hole[0]\n    if (!sample) continue\n    let assigned = false\n    for (const outer of outers) {\n      if (pointInRing(sample, outer.ring)) {\n        outer.holes.push(hole)\n        assigned = true\n        break\n      }\n    }\n    if (!assigned) {\n      // Treat unmatched negative rings as their own outers (orientation flip).\n      outers.push({ ring: [...hole].reverse(), holes: [] })\n    }\n  }\n\n  return group(outers.map((o) => path([o.ring, ...o.holes], true)))\n}\n\nexport function pathDToRing(pd: PathD): Ring {\n  return normalizeRing(pd.map((p) => vec2(p.x, p.y)))\n}\n\nexport function pointInRing(point: Vec2, ring: Ring): boolean {\n  const result = pointInPolygonD(\n    { x: point.x, y: point.y, z: 0 },\n    ringToPathD(ring),\n  )\n  return (\n    result === PointInPolygonResult.IsInside ||\n    result === PointInPolygonResult.IsOn\n  )\n}\n\nexport function clipUnion(a: PathsD, b: PathsD): PathsD {\n  return unionD(a, b, DEFAULT_FILL_RULE)\n}\n\nexport function clipIntersect(a: PathsD, b: PathsD): PathsD {\n  return intersectD(a, b, DEFAULT_FILL_RULE)\n}\n\nexport function clipDifference(a: PathsD, b: PathsD): PathsD {\n  return differenceD(a, b, DEFAULT_FILL_RULE)\n}\n\nexport function clipXor(a: PathsD, b: PathsD): PathsD {\n  return xorD(a, b, DEFAULT_FILL_RULE)\n}\n\nexport function pathsArea(paths: PathsD): number {\n  let sum = 0\n  for (const p of paths) {\n    sum += Math.abs(areaD(p))\n  }\n  return sum\n}\n","import type { Group, Path, Vec2 } from '../types/index.js'\nimport { vec2 } from '../types/index.js'\nimport {\n  pathToPathsD,\n  pathsArea,\n  pointInRing,\n} from '../clipper/convert.js'\n\n/** Signed area of a closed ring (shoelace). */\nexport function ringArea(ring: Vec2[]): number {\n  if (ring.length < 3) return 0\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/** Absolute area of a closed path (exterior minus holes). */\nexport function area(p: Path): number {\n  if (!p.closed || p.rings.length === 0) return 0\n  try {\n    return pathsArea(pathToPathsD(p))\n  } catch {\n    let total = 0\n    for (let i = 0; i < p.rings.length; i++) {\n      const a = Math.abs(ringArea(p.rings[i]!))\n      total += i === 0 ? a : -a\n    }\n    return Math.max(0, total)\n  }\n}\n\nexport function areaGroup(g: Group): number {\n  return g.paths.reduce((sum, p) => sum + area(p), 0)\n}\n\n/** Centroid of a closed exterior ring (ignores holes for Phase 2). */\nexport function centroid(p: Path): Vec2 {\n  const ring = p.rings[0]\n  if (!ring || ring.length === 0) return vec2(0, 0)\n  const a = ringArea(ring)\n  if (Math.abs(a) < 1e-12) {\n    let sx = 0\n    let sy = 0\n    for (const v of ring) {\n      sx += v.x\n      sy += v.y\n    }\n    return vec2(sx / ring.length, sy / ring.length)\n  }\n  let cx = 0\n  let cy = 0\n  for (let i = 0; i < ring.length; i++) {\n    const p0 = ring[i]!\n    const p1 = ring[(i + 1) % ring.length]!\n    const cross = p0.x * p1.y - p1.x * p0.y\n    cx += (p0.x + p1.x) * cross\n    cy += (p0.y + p1.y) * cross\n  }\n  return vec2(cx / (6 * a), cy / (6 * a))\n}\n\nexport function containsPoint(p: Path, point: Vec2): boolean {\n  if (!p.closed || !p.rings[0]) return false\n  if (!pointInRing(point, p.rings[0])) return false\n  for (let i = 1; i < p.rings.length; i++) {\n    const hole = p.rings[i]\n    if (hole && pointInRing(point, hole)) return false\n  }\n  return true\n}\n\nexport function bounds(p: Path): {\n  minX: number\n  minY: number\n  maxX: number\n  maxY: number\n} {\n  let minX = Infinity\n  let minY = Infinity\n  let maxX = -Infinity\n  let maxY = -Infinity\n  for (const ring of p.rings) {\n    for (const v of ring) {\n      minX = Math.min(minX, v.x)\n      minY = Math.min(minY, v.y)\n      maxX = Math.max(maxX, v.x)\n      maxY = Math.max(maxY, v.y)\n    }\n  }\n  if (!Number.isFinite(minX)) {\n    return { minX: 0, minY: 0, maxX: 0, maxY: 0 }\n  }\n  return { minX, minY, maxX, maxY }\n}\n\nexport function width(p: Path): number {\n  const b = bounds(p)\n  return b.maxX - b.minX\n}\n\nexport function height(p: Path): number {\n  const b = bounds(p)\n  return b.maxY - b.minY\n}\n\n/** Rough polygon similarity via absolute area difference relative to max area. */\nexport function areaSimilarity(a: Path, b: Path): number {\n  const aa = area(a)\n  const bb = area(b)\n  const denom = Math.max(aa, bb, 1e-12)\n  return 1 - Math.abs(aa - bb) / denom\n}\n\nexport const predicates = {\n  area,\n  areaGroup,\n  ringArea,\n  centroid,\n  containsPoint,\n  bounds,\n  width,\n  height,\n  areaSimilarity,\n}\n","import type { Path, Vec2 } from '../types/index.js'\nimport { path, polygon, polyline } from '../types/index.js'\n\n/** Regular n-gon approximating a circle. */\nexport function createCircle(\n  cx: number,\n  cy: number,\n  radius: number,\n  segments = 64,\n): Path {\n  return createRegularPolygon(cx, cy, radius, Math.max(3, Math.floor(segments)))\n}\n\nexport function createRect(\n  x: number,\n  y: number,\n  width: number,\n  height: number,\n): Path {\n  return polygon([\n    { x, y },\n    { x: x + width, y },\n    { x: x + width, y: y + height },\n    { x, y: y + height },\n  ])\n}\n\nexport function createRegularPolygon(\n  cx: number,\n  cy: number,\n  radius: number,\n  sides: number,\n  rotation = -Math.PI / 2,\n): Path {\n  const n = Math.max(3, Math.floor(sides))\n  const ring: Vec2[] = []\n  for (let i = 0; i < n; i++) {\n    const t = rotation + (i / n) * Math.PI * 2\n    ring.push({ x: cx + Math.cos(t) * radius, y: cy + Math.sin(t) * radius })\n  }\n  return polygon(ring)\n}\n\n/** Annulus as exterior + hole. */\nexport function createRing(\n  cx: number,\n  cy: number,\n  outerRadius: number,\n  innerRadius: number,\n  segments = 64,\n): Path {\n  const outer = createCircle(cx, cy, outerRadius, segments).rings[0]!\n  const inner = createCircle(cx, cy, Math.min(innerRadius, outerRadius), segments)\n    .rings[0]!\n  // hole winding opposite for Clipper\n  return path([outer, [...inner].reverse()], true)\n}\n\n/** Open circular arc polyline from `startAngle` to `endAngle` (radians). */\nexport function createArc(\n  cx: number,\n  cy: number,\n  radius: number,\n  startAngle: number,\n  endAngle: number,\n  segments = 32,\n): Path {\n  const n = Math.max(2, Math.floor(segments))\n  const pts: Vec2[] = []\n  for (let i = 0; i <= n; i++) {\n    const t = startAngle + ((endAngle - startAngle) * i) / n\n    pts.push({ x: cx + Math.cos(t) * radius, y: cy + Math.sin(t) * radius })\n  }\n  return polyline(pts)\n}\n\n/** Star polygon (outer/inner radius alternating). */\nexport function createStar(\n  cx: number,\n  cy: number,\n  outerRadius: number,\n  innerRadius: number,\n  points = 5,\n  rotation = -Math.PI / 2,\n): Path {\n  const n = Math.max(3, Math.floor(points))\n  const ring: Vec2[] = []\n  for (let i = 0; i < n * 2; i++) {\n    const r = i % 2 === 0 ? outerRadius : innerRadius\n    const t = rotation + (i / (n * 2)) * Math.PI * 2\n    ring.push({ x: cx + Math.cos(t) * r, y: cy + Math.sin(t) * r })\n  }\n  return polygon(ring)\n}\n\n/** Koch snowflake after `iterations` refinement (0 = equilateral triangle). */\nexport function createKochSnowflake(\n  cx: number,\n  cy: number,\n  radius: number,\n  iterations = 3,\n): Path {\n  const tri = createRegularPolygon(cx, cy, radius, 3)\n  let ring = tri.rings[0]!\n  const iters = Math.max(0, Math.min(6, Math.floor(iterations)))\n  for (let i = 0; i < iters; i++) {\n    ring = kochRefine(ring)\n  }\n  return polygon(ring)\n}\n\nfunction kochRefine(ring: Vec2[]): Vec2[] {\n  const out: Vec2[] = []\n  const n = ring.length\n  for (let i = 0; i < n; i++) {\n    const a = ring[i]!\n    const b = ring[(i + 1) % n]!\n    const dx = b.x - a.x\n    const dy = b.y - a.y\n    const p1 = { x: a.x + dx / 3, y: a.y + dy / 3 }\n    const p2 = { x: a.x + (2 * dx) / 3, y: a.y + (2 * dy) / 3 }\n    // outward peak (left of directed edge in Y-down SVG coords = rotate +90 for CCW tri)\n    const px = a.x + dx / 2 - dy * (Math.sqrt(3) / 6)\n    const py = a.y + dy / 2 + dx * (Math.sqrt(3) / 6)\n    out.push(a, p1, { x: px, y: py }, p2)\n  }\n  return out\n}\n\nexport const construction = {\n  createCircle,\n  createRect,\n  createRegularPolygon,\n  createRing,\n  createArc,\n  createStar,\n  createKochSnowflake,\n}\n","import type { Group, Path } from '../types/index.js'\nimport { group, groupFromPaths, path, polygon, vec2 } from '../types/index.js'\nimport {\n  clipDifference,\n  clipIntersect,\n  clipUnion,\n  clipXor,\n  pathToPathsD,\n  pathsDToGroup,\n} from '../clipper/convert.js'\n\nfunction ensureClosed(p: Path): Path {\n  if (!p.closed) {\n    throw new Error('shapeBoolean requires closed paths')\n  }\n  return p\n}\n\n/** Union of two closed paths. */\nexport function union(a: Path, b: Path): Group {\n  const result = clipUnion(pathToPathsD(ensureClosed(a)), pathToPathsD(ensureClosed(b)))\n  return pathsDToGroup(result)\n}\n\n/** Union of many closed paths (folded left-to-right). */\nexport function unionAll(paths: Path[]): Group {\n  if (paths.length === 0) return group([])\n  let acc = pathToPathsD(ensureClosed(paths[0]!))\n  for (let i = 1; i < paths.length; i++) {\n    acc = clipUnion(acc, pathToPathsD(ensureClosed(paths[i]!)))\n  }\n  return pathsDToGroup(acc)\n}\n\n/** Intersection of two closed paths. */\nexport function intersect(a: Path, b: Path): Group {\n  const result = clipIntersect(\n    pathToPathsD(ensureClosed(a)),\n    pathToPathsD(ensureClosed(b)),\n  )\n  return pathsDToGroup(result)\n}\n\n/** Subtract b from a (a \\ b). */\nexport function subtract(a: Path, b: Path): Group {\n  const result = clipDifference(\n    pathToPathsD(ensureClosed(a)),\n    pathToPathsD(ensureClosed(b)),\n  )\n  return pathsDToGroup(result)\n}\n\n/** Subtract many shapes from a base. */\nexport function subtractAll(base: Path, shapes: Path[]): Group {\n  let acc = pathToPathsD(ensureClosed(base))\n  for (const s of shapes) {\n    acc = clipDifference(acc, pathToPathsD(ensureClosed(s)))\n  }\n  return pathsDToGroup(acc)\n}\n\n/** Symmetric difference. */\nexport function symDifference(a: Path, b: Path): Group {\n  const result = clipXor(pathToPathsD(ensureClosed(a)), pathToPathsD(ensureClosed(b)))\n  return pathsDToGroup(result)\n}\n\n/** Complement of shape within axis-aligned rectangle [0,width] x [0,height]. */\nexport function complement(shape: Path, width: number, height: number): Group {\n  const frame = polygon([\n    vec2(0, 0),\n    vec2(width, 0),\n    vec2(width, height),\n    vec2(0, height),\n  ])\n  return subtract(frame, shape)\n}\n\n/**\n * Painter-style occlusion: later paths in the group are on top.\n * Each path has higher paths subtracted from it; returns visible remainders.\n */\nexport function occlusionSubtract(g: Group): Group {\n  const paths = g.paths\n  const visible: Path[] = []\n  for (let i = 0; i < paths.length; i++) {\n    const subject = paths[i]\n    if (!subject) continue\n    const occluders = paths.slice(i + 1)\n    const piece =\n      occluders.length === 0\n        ? groupFromPaths(ensureClosed(subject))\n        : subtractAll(subject, occluders)\n    for (const p of piece.paths) {\n      visible.push(p)\n    }\n  }\n  return group(visible)\n}\n\n/**\n * Regions covered by at least two input shapes.\n * If `merged`, collapse multi-overlaps into disjoint patches via union of pairwise intersects.\n */\nexport function overlapRegions(shapes: Path[], merged: boolean): Group {\n  if (shapes.length < 2) return group([])\n  const pairs: Path[] = []\n  for (let i = 0; i < shapes.length; i++) {\n    for (let j = i + 1; j < shapes.length; j++) {\n      const a = shapes[i]\n      const b = shapes[j]\n      if (!a || !b) continue\n      for (const p of intersect(a, b).paths) {\n        pairs.push(p)\n      }\n    }\n  }\n  if (!merged) return group(pairs)\n  return unionAll(pairs)\n}\n\nexport const shapeBoolean = {\n  union,\n  unionAll,\n  intersect,\n  subtract,\n  subtractAll,\n  symDifference,\n  complement,\n  occlusionSubtract,\n  overlapRegions,\n}\n","import type { Group, Path, Segment, Vec2 } from '../types/index.js'\nimport { path, normalizeRing, polygon, segment, group } from '../types/index.js'\nimport { bounds, containsPoint, centroid } from '../predicates/index.js'\nimport { intersect, unionAll } from '../shapeBoolean/index.js'\n\n/** Exterior ring as its own closed path (holes dropped). */\nexport function extractPerimeter(p: Path): Path {\n  const exterior = p.rings[0]\n  if (!exterior) return path([], true)\n  return polygon(exterior)\n}\n\n/** Alias for extractPerimeter. */\nexport function extractBoundary(p: Path): Path {\n  return extractPerimeter(p)\n}\n\n/** Each hole as a separate closed path. */\nexport function extractHoles(p: Path): Path[] {\n  const holes: Path[] = []\n  for (let i = 1; i < p.rings.length; i++) {\n    const hole = p.rings[i]\n    if (hole && hole.length >= 3) holes.push(polygon(hole))\n  }\n  return holes\n}\n\n/**\n * Insert vertices so no edge exceeds `maxSegLen`.\n * Closed rings treat the wrap-around edge.\n */\nexport function densify(p: Path, maxSegLen: number): Path {\n  if (maxSegLen <= 0) return p\n  return path(\n    p.rings.map((ring) => densifyRing(ring, maxSegLen, p.closed)),\n    p.closed,\n  )\n}\n\nfunction densifyRing(\n  ring: Vec2[],\n  maxSegLen: number,\n  closed: boolean,\n): Vec2[] {\n  if (ring.length < 2) return [...ring]\n  const out: Vec2[] = []\n  const n = ring.length\n  const edges = closed ? n : n - 1\n  for (let i = 0; i < edges; i++) {\n    const a = ring[i]!\n    const b = ring[(i + 1) % n]!\n    out.push(a)\n    const dist = Math.hypot(b.x - a.x, b.y - a.y)\n    const steps = Math.floor(dist / maxSegLen)\n    for (let s = 1; s < steps; s++) {\n      const t = s / steps\n      out.push({\n        x: a.x + (b.x - a.x) * t,\n        y: a.y + (b.y - a.y) * t,\n      })\n    }\n  }\n  if (!closed) out.push(ring[n - 1]!)\n  return closed ? normalizeRing(out) : out\n}\n\n/** Drop holes whose absolute area is below `minArea`. */\nexport function removeSmallHoles(p: Path, minArea: number): Path {\n  if (p.rings.length <= 1) return p\n  const exterior = p.rings[0]!\n  const kept = p.rings.slice(1).filter((hole) => {\n    const a = Math.abs(shoelace(hole))\n    return a >= minArea\n  })\n  return path([exterior, ...kept], p.closed)\n}\n\n/** Seeded uniform random points inside a closed path. */\nexport function generateRandomPoints(\n  p: Path,\n  count: number,\n  seed = 1,\n): Vec2[] {\n  const rng = mulberry32(seed >>> 0)\n  const b = bounds(p)\n  const out: Vec2[] = []\n  let attempts = 0\n  const maxAttempts = Math.max(count * 50, 100)\n  while (out.length < count && attempts < maxAttempts) {\n    attempts++\n    const pt = {\n      x: b.minX + rng() * (b.maxX - b.minX),\n      y: b.minY + rng() * (b.maxY - b.minY),\n    }\n    if (containsPoint(p, pt)) out.push(pt)\n  }\n  return out\n}\n\n/** Axis-aligned grid samples that fall inside the path. */\nexport function generateRandomGridPoints(\n  p: Path,\n  spacing: number,\n): Vec2[] {\n  const step = Math.max(spacing, 1e-9)\n  const b = bounds(p)\n  const out: Vec2[] = []\n  for (let x = b.minX; x <= b.maxX + 1e-12; x += step) {\n    for (let y = b.minY; y <= b.maxY + 1e-12; y += step) {\n      const pt = { x, y }\n      if (containsPoint(p, pt)) out.push(pt)\n    }\n  }\n  return out\n}\n\n/** Evenly spaced samples along the exterior perimeter. */\nexport function pointsOnExterior(p: Path, count: number): Vec2[] {\n  const ring = p.rings[0]\n  if (!ring || ring.length < 2 || count <= 0) return []\n  const lengths = edgeLengths(ring, true)\n  const total = lengths.reduce((s, L) => s + L, 0)\n  if (total < 1e-12) return []\n  const out: Vec2[] = []\n  for (let i = 0; i < count; i++) {\n    const target = (i / count) * total\n    out.push(pointAtArcLength(ring, lengths, target))\n  }\n  return out\n}\n\n/** Exterior edges as segments. */\nexport function segmentsOnExterior(p: Path): Segment[] {\n  const ring = p.rings[0]\n  if (!ring || ring.length < 2) return []\n  const n = ring.length\n  const closed = p.closed\n  const edges = closed ? n : n - 1\n  const out: Segment[] = []\n  for (let i = 0; i < edges; i++) {\n    out.push(segment(ring[i]!, ring[(i + 1) % n]!))\n  }\n  return out\n}\n\n/**\n * Cut `p` with the infinite line through `a`→`b`.\n * Returns pieces on both sides (typically 0–2 paths).\n */\nexport function slice(p: Path, a: Vec2, b: Vec2): Group {\n  const dx = b.x - a.x\n  const dy = b.y - a.y\n  const len = Math.hypot(dx, dy)\n  if (len < 1e-12) return group([p])\n  const nx = -dy / len\n  const ny = dx / len\n  const bb = bounds(p)\n  const span =\n    Math.hypot(bb.maxX - bb.minX, bb.maxY - bb.minY) * 4 + 10\n  const left = halfPlanePoly(a, nx, ny, span)\n  const right = halfPlanePoly(a, -nx, -ny, span)\n  const parts: Path[] = []\n  for (const half of [left, right]) {\n    parts.push(...intersect(p, half).paths)\n  }\n  return group(parts)\n}\n\n/** Split through the centroid with a vertical cut (left/right). */\nexport function centroidSplit(p: Path): Group {\n  const c = centroid(p)\n  const bb = bounds(p)\n  const pad = Math.max(bb.maxY - bb.minY, 1) + 1\n  return slice(p, { x: c.x, y: c.y - pad }, { x: c.x, y: c.y + pad })\n}\n\n/** Union all closed paths in a group (dissolve overlapping contours). */\nexport function dissolve(paths: Path[]): Group {\n  return unionAll(paths)\n}\n\n/** Vertex–edge intersection points between two path boundaries. */\nexport function intersectionPoints(a: Path, b: Path): Vec2[] {\n  const segsA = allSegments(a)\n  const segsB = allSegments(b)\n  const out: Vec2[] = []\n  const seen = new Set<string>()\n  for (const sa of segsA) {\n    for (const sb of segsB) {\n      const hit = segmentIntersection(sa.a, sa.b, sb.a, sb.b)\n      if (!hit) continue\n      const key = `${hit.x.toFixed(9)},${hit.y.toFixed(9)}`\n      if (seen.has(key)) continue\n      seen.add(key)\n      out.push(hit)\n    }\n  }\n  return out\n}\n\nfunction halfPlanePoly(\n  origin: Vec2,\n  nx: number,\n  ny: number,\n  span: number,\n): Path {\n  // Orthonormal tangent\n  const tx = -ny\n  const ty = nx\n  const o = origin\n  return polygon([\n    {\n      x: o.x - tx * span + nx * 1e-9,\n      y: o.y - ty * span + ny * 1e-9,\n    },\n    {\n      x: o.x + tx * span + nx * 1e-9,\n      y: o.y + ty * span + ny * 1e-9,\n    },\n    {\n      x: o.x + tx * span + nx * span,\n      y: o.y + ty * span + ny * span,\n    },\n    {\n      x: o.x - tx * span + nx * span,\n      y: o.y - ty * span + ny * span,\n    },\n  ])\n}\n\nfunction allSegments(p: Path): Segment[] {\n  const out: Segment[] = []\n  for (const ring of p.rings) {\n    const n = ring.length\n    const edges = p.closed ? n : Math.max(0, n - 1)\n    for (let i = 0; i < edges; i++) {\n      out.push(segment(ring[i]!, ring[(i + 1) % n]!))\n    }\n  }\n  return out\n}\n\nfunction segmentIntersection(\n  a: Vec2,\n  b: Vec2,\n  c: Vec2,\n  d: Vec2,\n): Vec2 | null {\n  const rX = b.x - a.x\n  const rY = b.y - a.y\n  const sX = d.x - c.x\n  const sY = d.y - c.y\n  const den = rX * sY - rY * sX\n  if (Math.abs(den) < 1e-14) return null\n  const t = ((c.x - a.x) * sY - (c.y - a.y) * sX) / den\n  const u = ((c.x - a.x) * rY - (c.y - a.y) * rX) / den\n  if (t < -1e-9 || t > 1 + 1e-9 || u < -1e-9 || u > 1 + 1e-9) return null\n  return { x: a.x + t * rX, y: a.y + t * rY }\n}\n\nfunction edgeLengths(ring: Vec2[], closed: boolean): number[] {\n  const n = ring.length\n  const edges = closed ? n : n - 1\n  const lengths: number[] = []\n  for (let i = 0; i < edges; i++) {\n    const a = ring[i]!\n    const b = ring[(i + 1) % n]!\n    lengths.push(Math.hypot(b.x - a.x, b.y - a.y))\n  }\n  return lengths\n}\n\nfunction pointAtArcLength(\n  ring: Vec2[],\n  lengths: number[],\n  target: number,\n): Vec2 {\n  let remain = target\n  const n = ring.length\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\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\nfunction mulberry32(a: number): () => number {\n  return function () {\n    let t = (a += 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\nexport const processing = {\n  extractPerimeter,\n  extractBoundary,\n  extractHoles,\n  densify,\n  removeSmallHoles,\n  generateRandomPoints,\n  generateRandomGridPoints,\n  pointsOnExterior,\n  segmentsOnExterior,\n  slice,\n  centroidSplit,\n  dissolve,\n  intersectionPoints,\n}\n","import type { Group, Path, Vec2 } from '../types/index.js'\nimport { group, polygon } from '../types/index.js'\nimport { bounds } from '../predicates/index.js'\nimport { createRect } from '../construction/index.js'\nimport { intersect } from '../shapeBoolean/index.js'\nimport { slice } from '../processing/index.js'\n\n/** Axis-aligned square cells covering a box. */\nexport function squareGrid(\n  spacing: number,\n  minX: number,\n  minY: number,\n  maxX: number,\n  maxY: number,\n): Group {\n  const s = Math.max(spacing, 1e-9)\n  const paths: Path[] = []\n  for (let x = minX; x < maxX - 1e-12; x += s) {\n    for (let y = minY; y < maxY - 1e-12; y += s) {\n      const w = Math.min(s, maxX - x)\n      const h = Math.min(s, maxY - y)\n      if (w > 1e-12 && h > 1e-12) paths.push(createRect(x, y, w, h))\n    }\n  }\n  return group(paths)\n}\n\n/** Pointy-top hex cells covering a box (flat radii ≈ spacing/2). */\nexport function hexTiling(\n  spacing: number,\n  minX: number,\n  minY: number,\n  maxX: number,\n  maxY: number,\n): Group {\n  const s = Math.max(spacing, 1e-9)\n  const r = s / 2\n  const dx = s * 0.75\n  const dy = s * Math.sqrt(3) * 0.5\n  const paths: Path[] = []\n  let row = 0\n  for (let y = minY + r; y <= maxY + r; y += dy, row++) {\n    const x0 = minX + r + (row % 2 === 0 ? 0 : dx * 0.5)\n    for (let x = x0; x <= maxX + r; x += dx) {\n      paths.push(hexagon(x, y, r))\n    }\n  }\n  return group(paths)\n}\n\nfunction hexagon(cx: number, cy: number, r: number): Path {\n  const ring: Vec2[] = []\n  for (let i = 0; i < 6; i++) {\n    const t = (Math.PI / 180) * (60 * i - 30)\n    ring.push({ x: cx + Math.cos(t) * r, y: cy + Math.sin(t) * r })\n  }\n  return polygon(ring)\n}\n\n/** Split a rectangle into an `nx` × `ny` grid of cells. */\nexport function rectSubdivision(p: Path, nx: number, ny: number): Group {\n  const b = bounds(p)\n  const cols = Math.max(1, Math.floor(nx))\n  const rows = Math.max(1, Math.floor(ny))\n  const dw = (b.maxX - b.minX) / cols\n  const dh = (b.maxY - b.minY) / rows\n  const paths: Path[] = []\n  for (let i = 0; i < cols; i++) {\n    for (let j = 0; j < rows; j++) {\n      const cell = createRect(\n        b.minX + i * dw,\n        b.minY + j * dh,\n        dw,\n        dh,\n      )\n      paths.push(...intersect(p, cell).paths)\n    }\n  }\n  return group(paths)\n}\n\n/** Recursively split each quad face into 4 by edge midpoints (`depth` times). */\nexport function quadSubdivision(faces: Path[], depth = 1): Group {\n  let cur = faces\n  const d = Math.max(0, Math.floor(depth))\n  for (let i = 0; i < d; i++) {\n    const next: Path[] = []\n    for (const f of cur) {\n      next.push(...subdivideQuad(f))\n    }\n    cur = next\n  }\n  return group(cur)\n}\n\nfunction subdivideQuad(p: Path): Path[] {\n  const ring = p.rings[0]\n  if (!ring || ring.length < 4) return [p]\n  const [a, b, c, d] = ring\n  if (!a || !b || !c || !d) return [p]\n  const mab = mid(a, b)\n  const mbc = mid(b, c)\n  const mcd = mid(c, d)\n  const mda = mid(d, a)\n  const cen = mid(mid(a, c), mid(b, d))\n  return [\n    polygon([a, mab, cen, mda]),\n    polygon([mab, b, mbc, cen]),\n    polygon([cen, mbc, c, mcd]),\n    polygon([mda, cen, mcd, d]),\n  ]\n}\n\n/** Split each triangle into 4 by edge midpoints. */\nexport function triangleSubdivision(faces: Path[], depth = 1): Group {\n  let cur = faces\n  const d = Math.max(0, Math.floor(depth))\n  for (let i = 0; i < d; i++) {\n    const next: Path[] = []\n    for (const f of cur) {\n      next.push(...subdivideTriangle(f))\n    }\n    cur = next\n  }\n  return group(cur)\n}\n\nfunction subdivideTriangle(p: Path): Path[] {\n  const ring = p.rings[0]\n  if (!ring || ring.length < 3) return [p]\n  const a = ring[0]!\n  const b = ring[1]!\n  const c = ring[2]!\n  const mab = mid(a, b)\n  const mbc = mid(b, c)\n  const mca = mid(c, a)\n  return [\n    polygon([a, mab, mca]),\n    polygon([mab, b, mbc]),\n    polygon([mca, mbc, c]),\n    polygon([mab, mbc, mca]),\n  ]\n}\n\n/**\n * Slice a path into strips with parallel cuts spaced by `spacing`.\n * Angle in radians (0 = vertical cuts).\n */\nexport function sliceDivision(\n  p: Path,\n  spacing: number,\n  angle = 0,\n): Group {\n  const s = Math.max(spacing, 1e-9)\n  const b = bounds(p)\n  const cx = (b.minX + b.maxX) / 2\n  const cy = (b.minY + b.maxY) / 2\n  const diag = Math.hypot(b.maxX - b.minX, b.maxY - b.minY) + s\n  const ux = Math.cos(angle)\n  const uy = Math.sin(angle)\n  // normal for cut lines\n  const nx = -uy\n  const ny = ux\n  const parts: Path[] = [p]\n  for (let t = -diag; t <= diag; t += s) {\n    const a = { x: cx + nx * t - ux * diag, y: cy + ny * t - uy * diag }\n    const bb = { x: cx + nx * t + ux * diag, y: cy + ny * t + uy * diag }\n    const next: Path[] = []\n    for (const piece of parts) {\n      const g = slice(piece, a, bb)\n      next.push(...(g.paths.length ? g.paths : [piece]))\n    }\n    parts.length = 0\n    parts.push(...next)\n  }\n  return group(parts)\n}\n\n/** Parallel hatch-like strip division (alias of sliceDivision). */\nexport function hatchSubdivision(\n  p: Path,\n  spacing: number,\n  angle = 0,\n): Group {\n  return sliceDivision(p, spacing, angle)\n}\n\nfunction mid(a: Vec2, b: Vec2): Vec2 {\n  return { x: (a.x + b.x) / 2, y: (a.y + b.y) / 2 }\n}\n\nexport const tiling = {\n  squareGrid,\n  hexTiling,\n  rectSubdivision,\n  quadSubdivision,\n  triangleSubdivision,\n  sliceDivision,\n  hatchSubdivision,\n}\n"]}

package/dist/transformation/index.d.ts

@@ -0,0 +1,37 @@
+import { V as Vec2 } from '../vec2-CWyXN1Wj.js';
+import { P as Path } from '../path-0RjhYjJs.js';
+
+declare function translate(p: Path, dx: number, dy: number): Path;
+declare function translateToOrigin(p: Path): Path;
+declare function translateCentroidTo(p: Path, target: Vec2): Path;
+declare function rotate(p: Path, angleRad: number, pivot?: Vec2): Path;
+declare function rotateAroundCenter(p: Path, angleRad: number): Path;
+declare function scale(p: Path, sx: number, sy?: number, pivot?: Vec2): Path;
+declare function originScale(p: Path, s: number): Path;
+declare function flipHorizontal(p: Path, x?: number): Path;
+declare function flipVertical(p: Path, y?: number): Path;
+/** Uniform resize so bounding-box width equals `width`. */
+declare function resizeByWidth(p: Path, width: number): Path;
+/** Uniform resize so bounding-box height equals `height`. */
+declare function resizeByHeight(p: Path, height: number): Path;
+/** Move the AABB min corner to `target`. */
+declare function translateCornerTo(p: Path, target: Vec2): Path;
+/** Shear: x' = x + shx * y, y' = y + shy * x (about origin or pivot). */
+declare function shear(p: Path, shx: number, shy?: number, pivot?: Vec2): Path;
+declare const transformation: {
+    translate: typeof translate;
+    translateToOrigin: typeof translateToOrigin;
+    translateCentroidTo: typeof translateCentroidTo;
+    translateCornerTo: typeof translateCornerTo;
+    rotate: typeof rotate;
+    rotateAroundCenter: typeof rotateAroundCenter;
+    scale: typeof scale;
+    originScale: typeof originScale;
+    flipHorizontal: typeof flipHorizontal;
+    flipVertical: typeof flipVertical;
+    resizeByWidth: typeof resizeByWidth;
+    resizeByHeight: typeof resizeByHeight;
+    shear: typeof shear;
+};
+
+export { flipHorizontal, flipVertical, originScale, resizeByHeight, resizeByWidth, rotate, rotateAroundCenter, scale, shear, transformation, translate, translateCentroidTo, translateCornerTo, translateToOrigin };

package/dist/transformation/index.js

@@ -0,0 +1,184 @@
+// src/types/vec2.ts
+function vec2(x, y) {
+  return { x, y };
+}
+function cloneVec2(v) {
+  return { x: v.x, y: v.y };
+}
+function equalsVec2(a, b, eps = 1e-9) {
+  return Math.abs(a.x - b.x) <= eps && Math.abs(a.y - b.y) <= eps;
+}
+
+// src/types/path.ts
+function path(rings, closed = true) {
+  return {
+    rings: rings.map((ring) => ring.map(cloneVec2)),
+    closed
+  };
+}
+function normalizeRing(ring, eps = 1e-9) {
+  if (ring.length < 2) return ring.map(cloneVec2);
+  const first = ring[0];
+  const last = ring[ring.length - 1];
+  if (first && last && equalsVec2(first, last, eps)) {
+    return ring.slice(0, -1).map(cloneVec2);
+  }
+  return ring.map(cloneVec2);
+}
+function clonePath(p) {
+  return {
+    closed: p.closed,
+    rings: p.rings.map((ring) => ring.map(cloneVec2))
+  };
+}
+
+// src/predicates/index.ts
+function ringArea(ring) {
+  if (ring.length < 3) return 0;
+  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 centroid(p) {
+  const ring = p.rings[0];
+  if (!ring || ring.length === 0) return vec2(0, 0);
+  const a = ringArea(ring);
+  if (Math.abs(a) < 1e-12) {
+    let sx = 0;
+    let sy = 0;
+    for (const v of ring) {
+      sx += v.x;
+      sy += v.y;
+    }
+    return vec2(sx / ring.length, sy / ring.length);
+  }
+  let cx = 0;
+  let cy = 0;
+  for (let i = 0; i < ring.length; i++) {
+    const p0 = ring[i];
+    const p1 = ring[(i + 1) % ring.length];
+    const cross = p0.x * p1.y - p1.x * p0.y;
+    cx += (p0.x + p1.x) * cross;
+    cy += (p0.y + p1.y) * cross;
+  }
+  return vec2(cx / (6 * a), cy / (6 * a));
+}
+function bounds(p) {
+  let minX = Infinity;
+  let minY = Infinity;
+  let maxX = -Infinity;
+  let maxY = -Infinity;
+  for (const ring of p.rings) {
+    for (const v of ring) {
+      minX = Math.min(minX, v.x);
+      minY = Math.min(minY, v.y);
+      maxX = Math.max(maxX, v.x);
+      maxY = Math.max(maxY, v.y);
+    }
+  }
+  if (!Number.isFinite(minX)) {
+    return { minX: 0, minY: 0, maxX: 0, maxY: 0 };
+  }
+  return { minX, minY, maxX, maxY };
+}
+
+// src/transformation/index.ts
+function mapPath(p, fn) {
+  return path(
+    p.rings.map((ring) => normalizeRing(ring.map(fn))),
+    p.closed
+  );
+}
+function translate(p, dx, dy) {
+  return mapPath(p, (v) => ({ x: v.x + dx, y: v.y + dy }));
+}
+function translateToOrigin(p) {
+  const c = centroid(p);
+  return translate(p, -c.x, -c.y);
+}
+function translateCentroidTo(p, target) {
+  const c = centroid(p);
+  return translate(p, target.x - c.x, target.y - c.y);
+}
+function rotate(p, angleRad, pivot) {
+  const o = pivot ?? { x: 0, y: 0 };
+  const cos = Math.cos(angleRad);
+  const sin = Math.sin(angleRad);
+  return mapPath(p, (v) => {
+    const x = v.x - o.x;
+    const y = v.y - o.y;
+    return {
+      x: o.x + x * cos - y * sin,
+      y: o.y + x * sin + y * cos
+    };
+  });
+}
+function rotateAroundCenter(p, angleRad) {
+  return rotate(p, angleRad, centroid(p));
+}
+function scale(p, sx, sy = sx, pivot) {
+  const o = pivot ?? { x: 0, y: 0 };
+  return mapPath(p, (v) => ({
+    x: o.x + (v.x - o.x) * sx,
+    y: o.y + (v.y - o.y) * sy
+  }));
+}
+function originScale(p, s) {
+  return scale(p, s, s, { x: 0, y: 0 });
+}
+function flipHorizontal(p, x = 0) {
+  return mapPath(p, (v) => ({ x: 2 * x - v.x, y: v.y }));
+}
+function flipVertical(p, y = 0) {
+  return mapPath(p, (v) => ({ x: v.x, y: 2 * y - v.y }));
+}
+function resizeByWidth(p, width) {
+  const b = bounds(p);
+  const w = b.maxX - b.minX;
+  if (w < 1e-12) return clonePath(p);
+  return scale(p, width / w, width / w, { x: b.minX, y: b.minY });
+}
+function resizeByHeight(p, height) {
+  const b = bounds(p);
+  const h = b.maxY - b.minY;
+  if (h < 1e-12) return clonePath(p);
+  return scale(p, height / h, height / h, { x: b.minX, y: b.minY });
+}
+function translateCornerTo(p, target) {
+  const b = bounds(p);
+  return translate(p, target.x - b.minX, target.y - b.minY);
+}
+function shear(p, shx, shy = 0, pivot) {
+  const o = pivot ?? { x: 0, y: 0 };
+  return mapPath(p, (v) => {
+    const x = v.x - o.x;
+    const y = v.y - o.y;
+    return {
+      x: o.x + x + shx * y,
+      y: o.y + y + shy * x
+    };
+  });
+}
+var transformation = {
+  translate,
+  translateToOrigin,
+  translateCentroidTo,
+  translateCornerTo,
+  rotate,
+  rotateAroundCenter,
+  scale,
+  originScale,
+  flipHorizontal,
+  flipVertical,
+  resizeByWidth,
+  resizeByHeight,
+  shear
+};
+
+export { flipHorizontal, flipVertical, originScale, resizeByHeight, resizeByWidth, rotate, rotateAroundCenter, scale, shear, transformation, translate, translateCentroidTo, translateCornerTo, translateToOrigin };
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map