pantograph2d 0.3.0 → 0.3.1

package/dist/exportJSON-26bb92ef.js

@@ -0,0 +1,1669 @@
+function N(e, t, n, s) {
+  return e <= s && t >= n;
+}
+class q {
+  constructor(t = 1 / 0, n = 1 / 0, s = -1 / 0, i = -1 / 0) {
+    this.xMin = t, this.yMin = n, this.xMax = s, this.yMax = i;
+  }
+  get width() {
+    return this.xMax - this.xMin;
+  }
+  get height() {
+    return this.yMax - this.yMin;
+  }
+  contains(t) {
+    const [n, s] = t;
+    return N(this.xMin, this.xMax, n, n) && N(this.yMin, this.yMax, s, s);
+  }
+  overlaps(t) {
+    return N(this.xMin, this.xMax, t.xMin, t.xMax) && N(this.yMin, this.yMax, t.yMin, t.yMax);
+  }
+  addPoint(t) {
+    const [n, s] = t;
+    return new q(
+      Math.min(this.xMin, n),
+      Math.min(this.yMin, s),
+      Math.max(this.xMax, n),
+      Math.max(this.yMax, s)
+    );
+  }
+  merge(t) {
+    return new q(
+      Math.min(this.xMin, t.xMin),
+      Math.min(this.yMin, t.yMin),
+      Math.max(this.xMax, t.xMax),
+      Math.max(this.yMax, t.yMax)
+    );
+  }
+}
+const ft = (e, t = 1e-9) => {
+  let n = e;
+  return Math.abs(e) < t && (n = 0), n.toFixed(-Math.log10(t));
+};
+function J(e, t = 1e-9) {
+  return Array.from(
+    new Map(
+      e.map(([n, s]) => [
+        `[${ft(n, t)},${ft(s, t)}]`,
+        [n, s]
+      ])
+    ).values()
+  );
+}
+const $t = Math.PI / 180, L = (e) => `[${e[0]}, ${e[1]}]`, g = ([e, t], [n, s], i = 1e-9) => Math.abs(e - n) <= i && Math.abs(t - s) <= i, A = ([e, t], [n, s]) => [e + n, t + s], y = ([e, t], [n, s]) => [e - n, t - s], z = ([e, t]) => e * e + t * t, v = ([e, t], n) => [e * n, t * n], Y = ([e, t], [n, s] = [0, 0]) => (e - n) ** 2 + (t - s) ** 2, I = (e, t = [0, 0]) => Math.sqrt(Y(e, t));
+function $([e, t], [n, s]) {
+  return e * s - t * n;
+}
+function et([e, t], [n, s]) {
+  return e * n + t * s;
+}
+function C([e, t]) {
+  const n = I([e, t]);
+  return [e / n, t / n];
+}
+function R(e, t) {
+  const n = Math.cos(t) * e, s = Math.sin(t) * e;
+  return [n, s];
+}
+function qt([e, t]) {
+  return Math.atan2(t, e);
+}
+function Dt(e) {
+  const t = I(e), n = qt(e);
+  return [t, n];
+}
+function _t(e, t, n = 1e-9) {
+  const s = $(e, t), i = z(e), r = z(t);
+  return s * s < i * r * n * n;
+}
+function k(e) {
+  return [-e[1], e[0]];
+}
+function Z(e) {
+  return [e[1], -e[0]];
+}
+const T = (e, t) => {
+  const [n, s, i, r, a, o, h, l, u] = e, [c, f, m, P, w, M, b, x, F] = t;
+  return [
+    n * c + s * P + i * b,
+    n * f + s * w + i * x,
+    n * m + s * M + i * F,
+    r * c + a * P + o * b,
+    r * f + a * w + o * x,
+    r * m + a * M + o * F,
+    h * c + l * P + u * b,
+    h * f + l * w + u * x,
+    h * m + l * M + u * F
+  ];
+};
+class E {
+  constructor() {
+    this._matrix = [1, 0, 0, 0, 1, 0, 0, 0, 1];
+  }
+  translate(t, n) {
+    return this._matrix = T(this._matrix, [1, 0, t, 0, 1, n, 0, 0, 1]), this;
+  }
+  rotate(t, n) {
+    const s = Math.cos(t), i = Math.sin(t), r = [s, -i, 0, i, s, 0, 0, 0, 1];
+    return n && this.translate(n[0], n[1]), this._matrix = T(this._matrix, r), n && this.translate(-n[0], -n[1]), this;
+  }
+  mirrorX() {
+    return this._matrix = T(this._matrix, [1, 0, 0, 0, -1, 0, 0, 0, 1]), this;
+  }
+  mirrorY() {
+    return this._matrix = T(this._matrix, [-1, 0, 0, 0, 1, 0, 0, 0, 1]), this;
+  }
+  mirrorLine(t, n) {
+    const [s, i] = t, r = Math.atan2(i, s);
+    return n && this.translate(n[0], n[1]), this.rotate(r), this.mirrorX(), this.rotate(-r), n && this.translate(-n[0], -n[1]), this;
+  }
+  mirrorCenter(t) {
+    return t && this.translate(t[0], t[1]), this._matrix = T(this._matrix, [-1, 0, 0, 0, -1, 0, 0, 0, 1]), t && this.translate(-t[0], -t[1]), this;
+  }
+  scale(t, n) {
+    return n && this.translate(n[0], n[1]), this._matrix = T(this._matrix, [t, 0, 0, 0, t, 0, 0, 0, 1]), n && this.translate(-n[0], -n[1]), this;
+  }
+  transform(t) {
+    const [n, s] = t, [i, r, a, o, h, l] = this._matrix;
+    return [i * n + r * s + a, o * n + h * s + l];
+  }
+  keepsOrientation() {
+    const [t, , , , n] = this._matrix;
+    return t * n > 0;
+  }
+}
+class Q {
+  translateX(t) {
+    const n = new E().translate(t, 0);
+    return this.transform(n);
+  }
+  translateY(t) {
+    const n = new E().translate(0, t);
+    return this.transform(n);
+  }
+  translate(t, n) {
+    const s = new E().translate(t, n);
+    return this.transform(s);
+  }
+  translateTo([t, n]) {
+    const s = new E().translate(t, n);
+    return this.transform(s);
+  }
+  rotate(t, n) {
+    const s = new E().rotate(
+      t * $t,
+      n
+    );
+    return this.transform(s);
+  }
+  scale(t, n) {
+    const s = new E().scale(t, n);
+    return this.transform(s);
+  }
+  mirrorCenter(t) {
+    const n = new E().mirrorCenter(t);
+    return this.transform(n);
+  }
+  mirror(t = "x", n) {
+    const s = new E();
+    return t === "x" ? s.mirrorX() : t === "y" ? s.mirrorY() : s.mirrorLine(t, n), this.transform(s);
+  }
+}
+class vt extends Q {
+  constructor(t, n) {
+    super(), this.firstPoint = t, this.lastPoint = n, this.precision = 1e-9, this.firstPoint = t, this.lastPoint = n;
+  }
+  get repr() {
+    return `${this.segmentType} ${L(this.firstPoint)} - ${L(
+      this.lastPoint
+    )}`;
+  }
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    return this.repr;
+  }
+}
+class p extends vt {
+  constructor() {
+    super(...arguments), this.segmentType = "LINE", this._V = null, this._boundingBox = null;
+  }
+  isValidParameter(t) {
+    const n = this.length * this.precision;
+    return t >= -n && 1 - t >= -n;
+  }
+  paramPoint(t) {
+    return A(this.firstPoint, v(this.V, t));
+  }
+  get length() {
+    return I(this.firstPoint, this.lastPoint);
+  }
+  get squareLength() {
+    return Y(this.firstPoint, this.lastPoint);
+  }
+  get V() {
+    return this._V === null && (this._V = y(this.lastPoint, this.firstPoint)), this._V;
+  }
+  get midPoint() {
+    return A(this.firstPoint, v(this.V, 0.5));
+  }
+  isSame(t) {
+    return t instanceof p ? g(this.firstPoint, t.firstPoint) && g(this.lastPoint, t.lastPoint) || g(this.lastPoint, t.firstPoint) && g(this.firstPoint, t.lastPoint) : !1;
+  }
+  clone() {
+    return new p(this.firstPoint, this.lastPoint);
+  }
+  reverse() {
+    return new p(this.lastPoint, this.firstPoint);
+  }
+  get boundingBox() {
+    return this._boundingBox === null && (this._boundingBox = new q(
+      Math.min(this.firstPoint[0], this.lastPoint[0]) - this.precision,
+      Math.min(this.firstPoint[1], this.lastPoint[1]) - this.precision,
+      Math.max(this.firstPoint[0], this.lastPoint[0]) + this.precision,
+      Math.max(this.firstPoint[1], this.lastPoint[1]) + this.precision
+    )), this._boundingBox;
+  }
+  distanceFrom(t) {
+    const n = y(t, this.firstPoint), s = et(n, this.V) / this.squareLength;
+    if (s < 0)
+      return I(t, this.firstPoint);
+    if (s > 1)
+      return I(t, this.lastPoint);
+    const i = this.paramPoint(s);
+    return I(t, i);
+  }
+  isOnSegment(t) {
+    if (g(t, this.firstPoint, this.precision))
+      return !0;
+    const n = y(t, this.firstPoint);
+    if (!_t(this.V, n))
+      return !1;
+    const s = et(n, this.V) / this.squareLength;
+    return this.isValidParameter(s);
+  }
+  tangentAt(t) {
+    if (!this.isOnSegment(t))
+      throw new Error("Point is not on segment");
+    return C(this.V);
+  }
+  get normalVector() {
+    return k(C(this.V));
+  }
+  get tangentAtFirstPoint() {
+    return C(this.V);
+  }
+  get tangentAtLastPoint() {
+    return C(this.V);
+  }
+  splitAt(t) {
+    let n;
+    if (Array.isArray(t) && t.length === 0)
+      return [this];
+    Array.isArray(t[0]) ? n = t : n = [t], n.forEach((h) => {
+      if (!this.isOnSegment(h))
+        throw new Error(
+          `Point ${L(h)} is not on segment ${this.repr}`
+        );
+    });
+    const s = [this.firstPoint, ...n, this.lastPoint], i = J(s), r = this.lastPoint[0] - this.firstPoint[0];
+    let a = Math.sign(r), o = 0;
+    return Math.abs(r) < this.precision && (a = Math.sign(this.lastPoint[1] - this.firstPoint[1]), o = 1), i.sort(
+      (h, l) => a * (h[o] - l[o])
+    ), i.flatMap((h, l) => l === i.length - 1 ? [] : new p(h, i[l + 1]));
+  }
+  transform(t) {
+    return new p(
+      t.transform(this.firstPoint),
+      t.transform(this.lastPoint)
+    );
+  }
+}
+function Yt(e) {
+  return Array.from(Array(e).keys());
+}
+function O(e) {
+  const t = Math.min(...e.map((n) => n.length));
+  return Yt(t).map((n) => e.map((s) => s[n]));
+}
+function tt(e) {
+  return e < 0 ? e + 2 * Math.PI : e >= 2 * Math.PI ? e % (2 * Math.PI) : e;
+}
+function gt(e, t, n) {
+  let s = t - e;
+  return n && (s = -s), s < 0 && (s += 2 * Math.PI), s;
+}
+const K = (e, t, n) => {
+  const s = $(e.V, t.V), i = z(e.V), r = z(t.V), a = n ? n * n : e.precision * t.precision;
+  if (s * s < i * r * a)
+    return "parallel";
+  const o = y(t.firstPoint, e.firstPoint), h = $(o, t.V) / s, l = $(o, e.V) / s;
+  return {
+    intersectionParam1: h,
+    intersectionParam2: l
+  };
+};
+function It(e, t, n = !1, s) {
+  const i = K(e, t, s);
+  if (i === "parallel") {
+    if (!n)
+      return null;
+    if (e.isSame(t))
+      return e;
+    const o = J(
+      [
+        t.isOnSegment(e.firstPoint) ? e.firstPoint : null,
+        t.isOnSegment(e.lastPoint) ? e.lastPoint : null,
+        e.isOnSegment(t.firstPoint) ? t.firstPoint : null,
+        e.isOnSegment(t.lastPoint) ? t.lastPoint : null
+      ].filter((h) => h !== null)
+    ).sort((h, l) => h[0] - l[0]);
+    if (o.length === 0)
+      return null;
+    if (o.length === 1)
+      return null;
+    if (o.length === 2)
+      return new p(o[0], o[1]);
+    throw console.error(o), new Error(
+      "Unexpected number of points while intersecting parallel lines"
+    );
+  }
+  const { intersectionParam1: r, intersectionParam2: a } = i;
+  return !e.isValidParameter(r) || !t.isValidParameter(a) ? null : e.paramPoint(r);
+}
+const j = (e, t) => {
+  const n = y(e, t);
+  return Dt(n);
+};
+class d extends vt {
+  constructor(t, n, s, i = !1, { ignoreChecks: r = !1 } = {}) {
+    if (super(t, n), this.segmentType = "ARC", this._angularLength = null, this._radius = null, this._firstAngle = null, this._lastAngle = null, this._boundingBox = null, this.center = s, this.clockwise = i, !r) {
+      if (g(t, n))
+        throw new Error("Invalid arc, cannot be a full circle");
+      if (Math.abs(this.radius - I(this.lastPoint, this.center)) > this.precision)
+        throw new Error(
+          "Invalid arc, radius does not match between start and end"
+        );
+    }
+  }
+  isValidParameter(t) {
+    return 1 - t >= -this.precision && t >= -this.precision;
+  }
+  angleToParam(t) {
+    return gt(this.firstAngle, tt(t), this.clockwise) / this.angularLength;
+  }
+  get angularLength() {
+    return this._angularLength || (this._angularLength = gt(
+      this.firstAngle,
+      this.lastAngle,
+      this.clockwise
+    )), this._angularLength;
+  }
+  paramPoint(t) {
+    return A(
+      this.center,
+      R(
+        this.radius,
+        this.firstAngle + t * this.angularLength * (this.clockwise ? -1 : 1)
+      )
+    );
+  }
+  pointToParam(t) {
+    const [n, s] = j(t, this.center);
+    if (Math.abs(n - this.radius) > this.precision)
+      throw new Error(
+        `Point ${L(t)} is not on segment ${this.repr}`
+      );
+    const i = this.angleToParam(s);
+    if (!this.isValidParameter(i))
+      throw new Error(
+        `Point ${L(t)} is not on segment ${this.repr}`
+      );
+    return i;
+  }
+  get radius() {
+    return this._radius === null && (this._radius = I(this.firstPoint, this.center)), this._radius;
+  }
+  get firstAngle() {
+    if (this._firstAngle === null) {
+      const [t, n] = y(this.firstPoint, this.center);
+      this._firstAngle = tt(Math.atan2(n, t));
+    }
+    return this._firstAngle;
+  }
+  get lastAngle() {
+    if (this._lastAngle === null) {
+      const [t, n] = y(this.lastPoint, this.center);
+      this._lastAngle = tt(Math.atan2(n, t));
+    }
+    return this._lastAngle;
+  }
+  get length() {
+    return this.radius * this.angularLength;
+  }
+  get squareLength() {
+    return this.length * this.length;
+  }
+  get midPoint() {
+    return this.paramPoint(0.5);
+  }
+  isSame(t) {
+    return !(t instanceof d) || !g(this.center, t.center) ? !1 : g(this.firstPoint, t.firstPoint) && g(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || g(this.lastPoint, t.firstPoint) && g(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
+  }
+  clone() {
+    return new d(
+      this.firstPoint,
+      this.lastPoint,
+      this.center,
+      this.clockwise
+    );
+  }
+  reverse() {
+    return new d(
+      this.lastPoint,
+      this.firstPoint,
+      this.center,
+      !this.clockwise
+    );
+  }
+  get boundingBox() {
+    if (this._boundingBox === null) {
+      const t = this.radius + this.precision, n = (s) => this.isValidParameter(this.angleToParam(s));
+      this._boundingBox = new q(
+        n(Math.PI) ? this.center[0] - t : Math.min(this.firstPoint[0], this.lastPoint[0]) - this.precision,
+        n(Math.PI * 1.5) ? this.center[1] - t : Math.min(this.firstPoint[1], this.lastPoint[1]) - this.precision,
+        n(0) ? this.center[0] + t : Math.max(this.firstPoint[0], this.lastPoint[0]) + this.precision,
+        n(Math.PI / 2) ? this.center[1] + t : Math.max(this.firstPoint[1], this.lastPoint[1]) + this.precision
+      );
+    }
+    return this._boundingBox;
+  }
+  distanceFrom(t) {
+    const [n, s] = j(t, this.center);
+    return this.isValidParameter(this.angleToParam(s)) ? Math.abs(n - this.radius) : Math.sqrt(
+      Math.min(
+        Y(t, this.firstPoint),
+        Y(t, this.lastPoint)
+      )
+    );
+  }
+  isOnSegment(t) {
+    if (g(t, this.firstPoint) || g(t, this.lastPoint))
+      return !0;
+    const [n, s] = j(t, this.center);
+    if (Math.abs(n - this.radius) > this.precision)
+      return !1;
+    const i = this.angleToParam(s);
+    return this.isValidParameter(i);
+  }
+  tangentAt(t) {
+    const [n, s] = j(t, this.center);
+    if (Math.abs(n - this.radius) > this.precision)
+      throw new Error("Point is not on the arc");
+    const i = this.angleToParam(s);
+    if (!this.isValidParameter(i))
+      throw new Error("Point is not on the arc");
+    const r = R(1, s);
+    return (this.clockwise ? Z : k)(C(r));
+  }
+  get tangentAtFirstPoint() {
+    const t = R(1, this.firstAngle);
+    return (this.clockwise ? Z : k)(C(t));
+  }
+  get tangentAtLastPoint() {
+    const t = R(1, this.lastAngle);
+    return (this.clockwise ? Z : k)(C(t));
+  }
+  splitAt(t) {
+    let n;
+    if (Array.isArray(t) && t.length === 0)
+      return [this];
+    Array.isArray(t[0]) ? n = t : n = [t];
+    const i = [0, 1, ...n.map((o) => this.pointToParam(o))], r = new Map(
+      O([i, [this.firstPoint, this.lastPoint, ...n]])
+    );
+    i.sort((o, h) => o - h);
+    let a = null;
+    return i.flatMap((o, h) => {
+      if (h === i.length - 1)
+        return [];
+      const l = i[h + 1];
+      if (l - o < this.precision)
+        return a === null && (a = o), [];
+      const u = a === null ? o : a, c = new d(
+        r.get(u) || this.paramPoint(u),
+        r.get(l) || this.paramPoint(l),
+        this.center,
+        this.clockwise
+      );
+      return a = null, c;
+    });
+  }
+  transform(t) {
+    return new d(
+      t.transform(this.firstPoint),
+      t.transform(this.lastPoint),
+      t.transform(this.center),
+      t.keepsOrientation() ? this.clockwise : !this.clockwise
+    );
+  }
+}
+function dn(e, t, n) {
+  const s = new p(t, e), i = new p(t, n), r = k(s.tangentAtFirstPoint), a = k(i.tangentAtLastPoint), o = K(
+    { firstPoint: s.midPoint, V: r, precision: 1e-9 },
+    { firstPoint: i.midPoint, V: a, precision: 1e-9 }
+  );
+  if (o === "parallel")
+    throw new Error("Cannot create an arc from three colinear points");
+  const h = $(
+    y(e, t),
+    y(n, t)
+  ) > 0;
+  return new d(
+    e,
+    n,
+    A(s.midPoint, v(r, o.intersectionParam1)),
+    h,
+    { ignoreChecks: !0 }
+  );
+}
+function pn(e, t, n) {
+  const s = new p(t, e), i = k(s.tangentAtFirstPoint), r = K(
+    { firstPoint: s.midPoint, V: i, precision: 1e-9 },
+    {
+      firstPoint: e,
+      V: k(n),
+      precision: 1e-9
+    }
+  );
+  if (r === "parallel")
+    throw new Error("Cannot create an arc from three colinear points");
+  const a = A(
+    s.midPoint,
+    v(i, r.intersectionParam1)
+  ), o = $(
+    y(a, e),
+    y(a, A(e, n))
+  ) < 0;
+  return new d(e, t, a, o, {
+    ignoreChecks: !0
+  });
+}
+function Ut(e, t) {
+  const n = y(t, e.firstPoint), s = et(n, e.V) / e.squareLength;
+  return e.paramPoint(s);
+}
+function G(e, t, n) {
+  const s = n || e.precision, i = Ut(e, t.center), r = I(i, t.center);
+  if (r > t.radius + s)
+    return [];
+  if (Math.abs(r - t.radius) < s) {
+    const c = i;
+    return e.isOnSegment(c) && t.isOnSegment(c) ? [c] : [];
+  }
+  const a = [], o = Math.sqrt(
+    t.radius * t.radius - r * r
+  ), h = e.tangentAtFirstPoint, l = A(i, v(h, o));
+  e.isOnSegment(l) && t.isOnSegment(l) && a.push(l);
+  const u = A(i, v(h, -o));
+  return e.isOnSegment(u) && t.isOnSegment(u) && a.push(u), a;
+}
+const Xt = (e) => {
+  const { firstPoint: t, lastPoint: n, center: s, clockwise: i } = e;
+  return new d(n, t, s, i, {
+    ignoreChecks: !0
+  });
+}, Nt = (e, t) => {
+  if (e.isSame(t))
+    return [e];
+  const n = J(
+    [
+      t.isOnSegment(e.firstPoint) ? e.firstPoint : null,
+      t.isOnSegment(e.lastPoint) ? e.lastPoint : null,
+      e.isOnSegment(t.firstPoint) ? t.firstPoint : null,
+      e.isOnSegment(t.lastPoint) ? t.lastPoint : null
+    ].filter((s) => s !== null)
+    // We sort by the param value of the first arc. This means that the points
+    // will be sorted with the same orientation than arc1
+  ).sort((s, i) => e.pointToParam(s) - e.pointToParam(i));
+  if (n.length === 0)
+    return [];
+  if (n.length === 1)
+    return [];
+  if (n.length === 2)
+    return e.isSame(Xt(t)) ? [] : [new d(n[0], n[1], e.center, e.clockwise)];
+  if (n.length === 3) {
+    const s = g(n[0], t.lastPoint) || g(n[0], t.firstPoint) ? 1 : 0;
+    return [
+      new d(
+        n[0 + s],
+        n[1 + s],
+        e.center,
+        e.clockwise
+      )
+    ];
+  } else if (n.length === 4)
+    return [
+      new d(n[0], n[1], e.center, e.clockwise),
+      new d(n[2], n[3], e.center, e.clockwise)
+    ];
+  throw new Error("Bug in the arc arc overlap algorithm");
+};
+function kt(e, t, n = !1, s) {
+  const i = s || e.precision, r = I(e.center, t.center), a = e.radius + t.radius;
+  if (r > a + i)
+    return [];
+  const o = Math.abs(e.radius - t.radius);
+  if (r < o - i)
+    return [];
+  if (r < i)
+    return o > i ? [] : n ? Nt(e, t) : [];
+  const h = C(y(t.center, e.center)), l = r > a - i;
+  if (
+    // circles are outside each other
+    l || // circles are inside each other
+    Math.abs(r - o) < i
+  ) {
+    const b = l || e.radius > t.radius ? 1 : -1, x = A(
+      e.center,
+      v(h, b * e.radius)
+    );
+    return e.isOnSegment(x) && t.isOnSegment(x) ? [x] : [];
+  }
+  const u = e.radius * e.radius / (2 * r) - t.radius * t.radius / (2 * r) + r / 2, c = A(
+    e.center,
+    v(h, u)
+  ), f = Math.sqrt(
+    e.radius * e.radius - u * u
+  ), m = k(h), P = A(c, v(m, f)), w = A(c, v(m, -f)), M = [];
+  return e.isOnSegment(P) && t.isOnSegment(P) && M.push(P), e.isOnSegment(w) && t.isOnSegment(w) && M.push(w), M;
+}
+function Pn(e, t, n) {
+  if (e instanceof p && t instanceof p) {
+    const s = It(
+      e,
+      t,
+      !1,
+      n
+    );
+    return s === null ? [] : [s];
+  }
+  if (e instanceof p && t instanceof d)
+    return G(e, t, n);
+  if (e instanceof d && t instanceof p)
+    return G(t, e, n);
+  if (e instanceof d && t instanceof d)
+    return kt(e, t, !1, n);
+  throw new Error("Not implemented");
+}
+function at(e, t, n) {
+  if (e instanceof p && t instanceof p) {
+    const s = It(
+      e,
+      t,
+      !0,
+      n
+    );
+    return s === null ? { intersections: [], overlaps: [], count: 0 } : s instanceof p ? { intersections: [], overlaps: [s], count: 1 } : { intersections: [s], overlaps: [], count: 1 };
+  }
+  if (!e.boundingBox.overlaps(t.boundingBox))
+    return { intersections: [], overlaps: [], count: 0 };
+  if (e instanceof p && t instanceof d) {
+    const s = G(e, t, n);
+    return { intersections: s, overlaps: [], count: s.length };
+  }
+  if (e instanceof d && t instanceof p) {
+    const s = G(t, e, n);
+    return { intersections: s, overlaps: [], count: s.length };
+  }
+  if (e instanceof d && t instanceof d) {
+    const s = kt(
+      e,
+      t,
+      !0,
+      n
+    );
+    return s.length ? s[0] instanceof d ? {
+      intersections: [],
+      overlaps: s,
+      count: s.length
+    } : {
+      intersections: s,
+      overlaps: [],
+      count: s.length
+    } : { intersections: [], overlaps: [], count: 0 };
+  }
+  throw new Error("Not implemented");
+}
+function Ft(e) {
+  const t = [];
+  for (let n = 0; n < e; n++)
+    for (let s = 0; s <= n; s++)
+      t.push([n, s]);
+  return t;
+}
+function* st(e) {
+  for (const [t, n] of Ft(e.length))
+    t !== n && (yield [e[t], e[n]]);
+}
+class S extends Q {
+  constructor(t, n = [], { ignoreChecks: s = !1 } = {}) {
+    super(), s || Rt(t, n), this.contour = t, this.holes = n;
+  }
+  get boundingBox() {
+    return this.contour.boundingBox;
+  }
+  get isFull() {
+    return this.holes.length === 0;
+  }
+  get allLoops() {
+    return [this.contour, ...this.holes];
+  }
+  clone() {
+    return new S(
+      this.contour.clone(),
+      this.holes.map((t) => t.clone())
+    );
+  }
+  transform(t) {
+    return new S(
+      this.contour.transform(t),
+      this.holes.map((n) => n.transform(t))
+    );
+  }
+  contains(t) {
+    return this.contour.contains(t) && !this.holes.some((n) => n.contains(t));
+  }
+  intersects(t) {
+    return this.allLoops.some(
+      (n) => t.allLoops.some((s) => n.intersects(s))
+    );
+  }
+}
+function Rt(e, t = []) {
+  if (!e)
+    throw new Error("Figure must have a contour");
+  for (const [n, s] of st([e, ...t]))
+    if (n.intersects(s))
+      throw new Error("Loops in a figure must not intersect");
+  if (t.some(
+    (n) => !e.contains(n.firstPoint) && !e.onStroke(n.firstPoint)
+  ))
+    throw new Error("Holes must be inside the contour");
+  for (const [n, s] of st(t))
+    if (n.contains(s.firstPoint))
+      throw console.error(St(n), St(s)), new Error("Holes must not be inside other holes");
+}
+const jt = (e) => {
+  const t = e.map((i, r) => e.slice(r + 1).map((a, o) => [o + r + 1, a]).filter(([, a]) => i.boundingBox.overlaps(a.boundingBox)).map(([a]) => a)), n = [], s = Array(t.length);
+  return t.forEach((i, r) => {
+    let a = s[r];
+    a || (a = [], n.push(a)), a.push(e[r]), i.length && i.forEach((o) => {
+      s[o] = a;
+    });
+  }), n;
+}, Et = (e) => e.map((t, n) => {
+  const i = t.segments[0].midPoint, r = e.filter((a, o) => n === o ? !1 : a.contains(i));
+  return {
+    loop: t,
+    isIn: r
+  };
+}), zt = (e, t) => e.flatMap(({ loop: n }) => ht(
+  t.filter(
+    ({ loop: s, isIn: i }) => s === n || i.indexOf(n) !== -1
+  )
+)), Gt = (e, t) => {
+  const n = t.filter(({ isIn: i }) => i.length <= 1), s = ht(
+    Et(e.map(({ loop: i }) => i))
+  );
+  return [n, ...s];
+}, ht = (e) => {
+  if (!e.length)
+    return [];
+  const t = e.filter(({ isIn: s }) => !s.length), n = e.filter(({ isIn: s }) => s.length > 1);
+  return t.length === 1 && n.length === 0 ? [e] : t.length > 1 ? zt(t, e) : Gt(n, e);
+};
+function D(e) {
+  return jt(e).map(Et).flatMap(ht).map((n) => {
+    if (n.length === 1)
+      return new S(n[0].loop);
+    n.sort((r, a) => r.isIn.length - a.isIn.length);
+    const [s, ...i] = n.map(({ loop: r }) => r);
+    return new S(s, i);
+  });
+}
+function Wt(e, t) {
+  const n = [];
+  for (const s of e)
+    for (const i of t)
+      n.push([s, i]);
+  return n;
+}
+class Ct extends Q {
+  constructor(t, { ignoreChecks: n = !1 } = {}) {
+    super(), this._boundingBox = null, n || Vt(t), this.segments = t;
+  }
+  get repr() {
+    return this.segments.map((t) => t.repr).join(`
+`) + `
+`;
+  }
+  get firstPoint() {
+    return this.segments[0].firstPoint;
+  }
+  get lastPoint() {
+    return this.segments[this.segments.length - 1].lastPoint;
+  }
+  get segmentsCount() {
+    return this.segments.length;
+  }
+  onStroke(t) {
+    return this.segments.some((n) => n.isOnSegment(t));
+  }
+  intersects(t) {
+    return this.boundingBox.overlaps(t.boundingBox) ? this.segments.some(
+      (n) => t.segments.some(
+        (s) => at(n, s).count > 0
+      )
+    ) : !1;
+  }
+  get boundingBox() {
+    if (this._boundingBox === null) {
+      let t = this.segments[0].boundingBox;
+      this.segments.slice(1).forEach((n) => {
+        t = t.merge(n.boundingBox);
+      }), this._boundingBox = t;
+    }
+    return this._boundingBox;
+  }
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    return this.repr;
+  }
+}
+function Ht(e, t = "Stroke") {
+  Ft(e.length).forEach(
+    ([n, s]) => {
+      if (n === s)
+        return;
+      const i = e[n], r = e[s], a = at(i, r);
+      if (a.count !== 0) {
+        if (a.count === 1 && !a.overlaps.length) {
+          const o = n - s, h = a.intersections[0];
+          if (o === 1 && g(i.firstPoint, h) || o === -1 && g(i.lastPoint, h) || o === e.length - 1 && g(i.lastPoint, h) && g(r.firstPoint, h) || -o === e.length - 1 && g(i.firstPoint, h) && g(r.lastPoint, h))
+            return;
+        }
+        throw new Error(
+          `${t} segments must not intersect, but segments ${i.repr} and ${r.repr} do`
+        );
+      }
+    }
+  );
+}
+function Vt(e, t = "Stroke") {
+  if (e.length === 0)
+    throw new Error(`${t} must have at least one segment`);
+  O([e.slice(0, -1), e.slice(1)]).forEach(
+    ([n, s]) => {
+      if (!g(n.lastPoint, s.firstPoint))
+        throw new Error(
+          `${t} segments must be connected, but ${n.repr} and ${s.repr} are not`
+        );
+    }
+  ), Ht(e, t);
+}
+function mt(e, t) {
+  return !!(e instanceof p && t instanceof p && _t(e.V, t.V) || e instanceof d && t instanceof d && g(e.center, t.center) && e.radius - t.radius < e.precision);
+}
+function dt(e, t) {
+  if (e instanceof p && t instanceof p)
+    return new p(e.firstPoint, t.lastPoint);
+  if (e instanceof d && t instanceof d)
+    return new d(
+      e.firstPoint,
+      t.lastPoint,
+      e.center,
+      e.clockwise
+    );
+  throw new Error("Not implemented");
+}
+function Bt(e) {
+  let t = !1;
+  const n = [];
+  for (const s of e.segments) {
+    if (n.length === 0) {
+      n.push(s);
+      continue;
+    }
+    const i = n[n.length - 1];
+    mt(i, s) ? (t = !0, n.pop(), n.push(dt(i, s))) : n.push(s);
+  }
+  if (g(e.firstPoint, e.lastPoint) && mt(
+    n[0],
+    n[n.length - 1]
+  )) {
+    t = !0;
+    const s = n.pop();
+    n[0] = dt(s, n[0]);
+  }
+  return t ? n : null;
+}
+class _ extends Ct {
+  constructor() {
+    super(...arguments), this.strokeType = "STRAND";
+  }
+  reverse() {
+    const t = this.segments.map((n) => n.reverse());
+    return t.reverse(), new _(t, { ignoreChecks: !0 });
+  }
+  clone() {
+    return new _(
+      this.segments.map((t) => t.clone()),
+      { ignoreChecks: !0 }
+    );
+  }
+  extend(t) {
+    if (!g(this.lastPoint, t.firstPoint))
+      throw console.error(this.repr, t.repr), new Error("Cannot extend strand: connection point is not the same");
+    return new _([...this.segments, ...t.segments]);
+  }
+  simplify() {
+    const t = Bt(this);
+    return t ? new _(t, { ignoreChecks: !0 }) : this;
+  }
+  transform(t) {
+    return new _(
+      this.segments.map((n) => n.transform(t)),
+      { ignoreChecks: !0 }
+    );
+  }
+}
+const Jt = (e, t) => {
+  const n = K(t, {
+    V: [1, 0],
+    firstPoint: e,
+    precision: t.precision
+  });
+  if (n === "parallel")
+    return 0;
+  const { intersectionParam1: s, intersectionParam2: i } = n;
+  if (!t.isValidParameter(s) || i <= -t.precision)
+    return 0;
+  if (Math.abs(s) < t.precision || Math.abs(s - 1) < t.precision) {
+    const [, r] = t.midPoint;
+    return e[1] - r < 0 ? 1 : 0;
+  }
+  return 1;
+}, Qt = (e, t) => {
+  const n = t.precision, s = Math.abs(e[1] - t.center[1]);
+  if (s > t.radius + n)
+    return 0;
+  const i = Y(e, t.center), r = t.radius * t.radius, a = n * n;
+  if (Math.abs(i - r) < a && t.isOnSegment(e))
+    return 0;
+  const o = i - r > a;
+  if (o && t.center[0] < e[0])
+    return 0;
+  const h = Math.sqrt(
+    t.radius * t.radius - s * s
+  );
+  let l = 0;
+  const u = (c) => {
+    t.isOnSegment(c) && (g(c, t.firstPoint) ? l += t.tangentAtFirstPoint[1] > 0 ? 1 : 0 : g(c, t.lastPoint) ? l += t.tangentAtLastPoint[1] > 0 ? 0 : 1 : l += 1);
+  };
+  return u([t.center[0] + h, e[1]]), o && u([t.center[0] - h, e[1]]), l;
+};
+function Kt(e, t) {
+  if (t instanceof p)
+    return Jt(e, t);
+  if (t instanceof d)
+    return Qt(e, t);
+  throw new Error("Not implemented");
+}
+class V extends Ct {
+  constructor(t, { ignoreChecks: n = !1 } = {}) {
+    super(t, { ignoreChecks: !0 }), this.strokeType = "LOOP", this._clockwise = null, n || Zt(t);
+  }
+  get clockwise() {
+    if (this._clockwise === null) {
+      const t = this.segments.flatMap((s) => s instanceof p ? [s.firstPoint] : [s.firstPoint, s.paramPoint(0.5)]), n = t.map((s, i) => {
+        const r = t[(i + 1) % t.length];
+        return (r[0] - s[0]) * (r[1] + s[1]);
+      }).reduce((s, i) => s + i, 0);
+      this._clockwise = n > 0;
+    }
+    return this._clockwise;
+  }
+  clone() {
+    return new V(
+      this.segments.map((t) => t.clone()),
+      { ignoreChecks: !0 }
+    );
+  }
+  reverse() {
+    const t = this.segments.map((n) => n.reverse());
+    return t.reverse(), new V(t, { ignoreChecks: !0 });
+  }
+  transform(t) {
+    return new V(
+      this.segments.map((n) => n.transform(t)),
+      { ignoreChecks: !0 }
+    );
+  }
+  contains(t) {
+    return this.onStroke(t) || !this.boundingBox.contains(t) ? !1 : this.segments.reduce((s, i) => s + Kt(t, i), 0) % 2 === 1;
+  }
+  simplify() {
+    const t = Bt(this);
+    return t ? new V(t, { ignoreChecks: !0 }) : this;
+  }
+}
+function Zt(e) {
+  if (Vt(e, "Loop"), !g(e[0].firstPoint, e[e.length - 1].lastPoint))
+    throw new Error("Loop segment must be closed");
+}
+class tn {
+  constructor() {
+    this.ids = [], this.values = [], this.length = 0;
+  }
+  clear() {
+    this.length = 0;
+  }
+  push(t, n) {
+    let s = this.length++;
+    for (; s > 0; ) {
+      const i = s - 1 >> 1, r = this.values[i];
+      if (n >= r)
+        break;
+      this.ids[s] = this.ids[i], this.values[s] = r, s = i;
+    }
+    this.ids[s] = t, this.values[s] = n;
+  }
+  pop() {
+    if (this.length === 0)
+      return;
+    const t = this.ids[0];
+    if (this.length--, this.length > 0) {
+      const n = this.ids[0] = this.ids[this.length], s = this.values[0] = this.values[this.length], i = this.length >> 1;
+      let r = 0;
+      for (; r < i; ) {
+        let a = (r << 1) + 1;
+        const o = a + 1;
+        let h = this.ids[a], l = this.values[a];
+        const u = this.values[o];
+        if (o < this.length && u < l && (a = o, h = this.ids[o], l = u), l >= s)
+          break;
+        this.ids[r] = h, this.values[r] = l, r = a;
+      }
+      this.ids[r] = n, this.values[r] = s;
+    }
+    return t;
+  }
+  peek() {
+    if (this.length !== 0)
+      return this.ids[0];
+  }
+  peekValue() {
+    if (this.length !== 0)
+      return this.values[0];
+  }
+  shrink() {
+    this.ids.length = this.values.length = this.length;
+  }
+}
+const pt = [
+  Int8Array,
+  Uint8Array,
+  Uint8ClampedArray,
+  Int16Array,
+  Uint16Array,
+  Int32Array,
+  Uint32Array,
+  Float32Array,
+  Float64Array
+], nt = 3;
+class ut {
+  static from(t) {
+    if (!t || t.byteLength === void 0 || t.buffer)
+      throw new Error("Data must be an instance of ArrayBuffer or SharedArrayBuffer.");
+    const [n, s] = new Uint8Array(t, 0, 2);
+    if (n !== 251)
+      throw new Error("Data does not appear to be in a Flatbush format.");
+    if (s >> 4 !== nt)
+      throw new Error(`Got v${s >> 4} data when expected v${nt}.`);
+    const [i] = new Uint16Array(t, 2, 1), [r] = new Uint32Array(t, 4, 1);
+    return new ut(r, i, pt[s & 15], void 0, t);
+  }
+  constructor(t, n = 16, s = Float64Array, i = ArrayBuffer, r) {
+    if (t === void 0)
+      throw new Error("Missing required argument: numItems.");
+    if (isNaN(t) || t <= 0)
+      throw new Error(`Unexpected numItems value: ${t}.`);
+    this.numItems = +t, this.nodeSize = Math.min(Math.max(+n, 2), 65535);
+    let a = t, o = a;
+    this._levelBounds = [a * 4];
+    do
+      a = Math.ceil(a / this.nodeSize), o += a, this._levelBounds.push(o * 4);
+    while (a !== 1);
+    this.ArrayType = s || Float64Array, this.IndexArrayType = o < 16384 ? Uint16Array : Uint32Array;
+    const h = pt.indexOf(this.ArrayType), l = o * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+    if (h < 0)
+      throw new Error(`Unexpected typed array class: ${s}.`);
+    r && r.byteLength !== void 0 && !r.buffer ? (this.data = r, this._boxes = new this.ArrayType(this.data, 8, o * 4), this._indices = new this.IndexArrayType(this.data, 8 + l, o), this._pos = o * 4, this.minX = this._boxes[this._pos - 4], this.minY = this._boxes[this._pos - 3], this.maxX = this._boxes[this._pos - 2], this.maxY = this._boxes[this._pos - 1]) : (this.data = new i(8 + l + o * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, o * 4), this._indices = new this.IndexArrayType(this.data, 8 + l, o), this._pos = 0, this.minX = 1 / 0, this.minY = 1 / 0, this.maxX = -1 / 0, this.maxY = -1 / 0, new Uint8Array(this.data, 0, 2).set([251, (nt << 4) + h]), new Uint16Array(this.data, 2, 1)[0] = n, new Uint32Array(this.data, 4, 1)[0] = t), this._queue = new tn();
+  }
+  add(t, n, s, i) {
+    const r = this._pos >> 2, a = this._boxes;
+    return this._indices[r] = r, a[this._pos++] = t, a[this._pos++] = n, a[this._pos++] = s, a[this._pos++] = i, t < this.minX && (this.minX = t), n < this.minY && (this.minY = n), s > this.maxX && (this.maxX = s), i > this.maxY && (this.maxY = i), r;
+  }
+  finish() {
+    if (this._pos >> 2 !== this.numItems)
+      throw new Error(`Added ${this._pos >> 2} items when expected ${this.numItems}.`);
+    const t = this._boxes;
+    if (this.numItems <= this.nodeSize) {
+      t[this._pos++] = this.minX, t[this._pos++] = this.minY, t[this._pos++] = this.maxX, t[this._pos++] = this.maxY;
+      return;
+    }
+    const n = this.maxX - this.minX || 1, s = this.maxY - this.minY || 1, i = new Uint32Array(this.numItems), r = (1 << 16) - 1;
+    for (let a = 0, o = 0; a < this.numItems; a++) {
+      const h = t[o++], l = t[o++], u = t[o++], c = t[o++], f = Math.floor(r * ((h + u) / 2 - this.minX) / n), m = Math.floor(r * ((l + c) / 2 - this.minY) / s);
+      i[a] = en(f, m);
+    }
+    it(i, t, this._indices, 0, this.numItems - 1, this.nodeSize);
+    for (let a = 0, o = 0; a < this._levelBounds.length - 1; a++) {
+      const h = this._levelBounds[a];
+      for (; o < h; ) {
+        const l = o;
+        let u = t[o++], c = t[o++], f = t[o++], m = t[o++];
+        for (let P = 1; P < this.nodeSize && o < h; P++)
+          u = Math.min(u, t[o++]), c = Math.min(c, t[o++]), f = Math.max(f, t[o++]), m = Math.max(m, t[o++]);
+        this._indices[this._pos >> 2] = l, t[this._pos++] = u, t[this._pos++] = c, t[this._pos++] = f, t[this._pos++] = m;
+      }
+    }
+  }
+  search(t, n, s, i, r) {
+    if (this._pos !== this._boxes.length)
+      throw new Error("Data not yet indexed - call index.finish().");
+    let a = this._boxes.length - 4;
+    const o = [], h = [];
+    for (; a !== void 0; ) {
+      const l = Math.min(a + this.nodeSize * 4, wt(a, this._levelBounds));
+      for (let u = a; u < l; u += 4) {
+        if (s < this._boxes[u] || i < this._boxes[u + 1] || t > this._boxes[u + 2] || n > this._boxes[u + 3])
+          continue;
+        const c = this._indices[u >> 2] | 0;
+        a >= this.numItems * 4 ? o.push(c) : (r === void 0 || r(c)) && h.push(c);
+      }
+      a = o.pop();
+    }
+    return h;
+  }
+  neighbors(t, n, s = 1 / 0, i = 1 / 0, r) {
+    if (this._pos !== this._boxes.length)
+      throw new Error("Data not yet indexed - call index.finish().");
+    let a = this._boxes.length - 4;
+    const o = this._queue, h = [], l = i * i;
+    for (; a !== void 0; ) {
+      const u = Math.min(a + this.nodeSize * 4, wt(a, this._levelBounds));
+      for (let c = a; c < u; c += 4) {
+        const f = this._indices[c >> 2] | 0, m = Pt(t, this._boxes[c], this._boxes[c + 2]), P = Pt(n, this._boxes[c + 1], this._boxes[c + 3]), w = m * m + P * P;
+        a >= this.numItems * 4 ? o.push(f << 1, w) : (r === void 0 || r(f)) && o.push((f << 1) + 1, w);
+      }
+      for (; o.length && o.peek() & 1; )
+        if (o.peekValue() > l || (h.push(o.pop() >> 1), h.length === s))
+          return o.clear(), h;
+      a = o.pop() >> 1;
+    }
+    return o.clear(), h;
+  }
+}
+function Pt(e, t, n) {
+  return e < t ? t - e : e <= n ? 0 : e - n;
+}
+function wt(e, t) {
+  let n = 0, s = t.length - 1;
+  for (; n < s; ) {
+    const i = n + s >> 1;
+    t[i] > e ? s = i : n = i + 1;
+  }
+  return t[n];
+}
+function it(e, t, n, s, i, r) {
+  if (Math.floor(s / r) >= Math.floor(i / r))
+    return;
+  const a = e[s + i >> 1];
+  let o = s - 1, h = i + 1;
+  for (; ; ) {
+    do
+      o++;
+    while (e[o] < a);
+    do
+      h--;
+    while (e[h] > a);
+    if (o >= h)
+      break;
+    nn(e, t, n, o, h);
+  }
+  it(e, t, n, s, h, r), it(e, t, n, h + 1, i, r);
+}
+function nn(e, t, n, s, i) {
+  const r = e[s];
+  e[s] = e[i], e[i] = r;
+  const a = 4 * s, o = 4 * i, h = t[a], l = t[a + 1], u = t[a + 2], c = t[a + 3];
+  t[a] = t[o], t[a + 1] = t[o + 1], t[a + 2] = t[o + 2], t[a + 3] = t[o + 3], t[o] = h, t[o + 1] = l, t[o + 2] = u, t[o + 3] = c;
+  const f = n[s];
+  n[s] = n[i], n[i] = f;
+}
+function en(e, t) {
+  let n = e ^ t, s = 65535 ^ n, i = 65535 ^ (e | t), r = e & (t ^ 65535), a = n | s >> 1, o = n >> 1 ^ n, h = i >> 1 ^ s & r >> 1 ^ i, l = n & i >> 1 ^ r >> 1 ^ r;
+  n = a, s = o, i = h, r = l, a = n & n >> 2 ^ s & s >> 2, o = n & s >> 2 ^ s & (n ^ s) >> 2, h ^= n & i >> 2 ^ s & r >> 2, l ^= s & i >> 2 ^ (n ^ s) & r >> 2, n = a, s = o, i = h, r = l, a = n & n >> 4 ^ s & s >> 4, o = n & s >> 4 ^ s & (n ^ s) >> 4, h ^= n & i >> 4 ^ s & r >> 4, l ^= s & i >> 4 ^ (n ^ s) & r >> 4, n = a, s = o, i = h, r = l, h ^= n & i >> 8 ^ s & r >> 8, l ^= s & i >> 8 ^ (n ^ s) & r >> 8, n = h ^ h >> 1, s = l ^ l >> 1;
+  let u = e ^ t, c = s | 65535 ^ (u | n);
+  return u = (u | u << 8) & 16711935, u = (u | u << 4) & 252645135, u = (u | u << 2) & 858993459, u = (u | u << 1) & 1431655765, c = (c | c << 8) & 16711935, c = (c | c << 4) & 252645135, c = (c | c << 2) & 858993459, c = (c | c << 1) & 1431655765, (c << 1 | u) >>> 0;
+}
+function sn(e, t = 1e-7) {
+  const n = new ut(e.length);
+  e.forEach((r) => {
+    const [a, o] = r.firstPoint;
+    n.add(a - t, o - t, a + t, o + t);
+  }), n.finish();
+  const s = [], i = /* @__PURE__ */ new Set();
+  return e.forEach((r, a) => {
+    if (i.has(a))
+      return;
+    const o = [r];
+    let h = a;
+    i.add(a);
+    let l = e.length;
+    for (; ; ) {
+      if (l-- < 0)
+        throw new Error("Infinite loop detected");
+      const u = o[o.length - 1].lastPoint, [c, f] = u, m = n.search(
+        c - t,
+        f - t,
+        c + t,
+        f + t
+      ), P = (x) => Math.abs((h - x) % e.length), w = m.filter((x) => !i.has(x)).map((x) => [
+        e[x],
+        x,
+        P(x)
+      ]).sort(([, , x], [, , F]) => P(x) - P(F));
+      if (w.length === 0) {
+        s.push(o);
+        break;
+      }
+      const [M, b] = w[0];
+      o.push(M), i.add(b), h = b;
+    }
+  }), s;
+}
+const xt = (e, t) => {
+  const n = e.findIndex((r) => g(t, r.firstPoint)), s = e.slice(0, n);
+  return e.slice(n).concat(s);
+}, Mt = (e, t) => {
+  let n = e;
+  const s = (o) => g(o.firstPoint, t.firstPoint) && g(o.lastPoint, t.lastPoint);
+  let i = e.findIndex(s);
+  if (i === -1) {
+    const o = e.map((h) => h.reverse());
+    if (o.reverse(), i = o.findIndex(s), i === -1)
+      throw console.error(
+        o.map((h) => h.repr),
+        t.repr
+      ), new Error("Failed to rotate to segment start");
+    n = o;
+  }
+  const r = n.slice(0, i);
+  return n.slice(i).concat(r);
+};
+function* yt(e, t, n) {
+  const s = (a) => t.some((o) => g(o, a.lastPoint)), i = (a) => n.some((o) => a.isSame(o));
+  let r = [];
+  for (const a of e)
+    s(a) ? (r.push(a), yield new _(r, { ignoreChecks: !0 }), r = []) : i(a) ? (r.length && (yield new _(r, { ignoreChecks: !0 }), r = []), yield new _([a], { ignoreChecks: !0 })) : r.push(a);
+  r.length && (yield new _(r, { ignoreChecks: !0 }));
+}
+function rn(e, t, n) {
+  return e.filter((s) => {
+    const i = t.filter((o) => g(o.firstPoint, s) || g(o.lastPoint, s));
+    if (i.length % 2)
+      throw new Error("Bug in the intersection algo on non crossing point");
+    const r = i.map((o) => n.contains(o.midPoint));
+    return !(r.every((o) => o) || !r.some((o) => o));
+  });
+}
+function on(e, t, n) {
+  let s = [];
+  const i = [], r = new Array(e.segments.length).fill(0).map(() => []), a = new Array(t.segments.length).fill(0).map(() => []);
+  if (e.segments.forEach((f, m) => {
+    t.segments.forEach((P, w) => {
+      const { intersections: M, overlaps: b } = at(
+        f,
+        P,
+        n
+      );
+      s.push(...M), r[m].push(...M), a[w].push(...M), i.push(...b);
+      const x = b.flatMap((F) => [
+        F.firstPoint,
+        F.lastPoint
+      ]);
+      s.push(...x), r[m].push(...x), a[w].push(...x);
+    });
+  }), s = J(s, n), !s.length || s.length === 1)
+    return null;
+  const o = ([f, m]) => m.length ? f.splitAt(m) : [f];
+  let h = O([e.segments, r]).flatMap(o), l = O([t.segments, a]).flatMap(o);
+  if (s = rn(
+    s,
+    h,
+    t
+  ), !s.length && !i.length)
+    return null;
+  if (i.length) {
+    const f = i[0];
+    h = Mt(
+      h,
+      f
+    ), l = Mt(
+      l,
+      f
+    );
+  } else {
+    const f = s[0];
+    h = xt(h, f), l = xt(l, f);
+  }
+  let u = Array.from(
+    yt(
+      h,
+      s,
+      i
+    )
+  ), c = Array.from(
+    yt(
+      l,
+      s,
+      i
+    )
+  );
+  return (!g(
+    c[0].lastPoint,
+    u[0].lastPoint
+  ) || i.length > 0 && c[0].segmentsCount !== 1) && (c = c.map((f) => f.reverse()).reverse(), g(c[0].lastPoint, u[0].lastPoint) || (u = u.map((f) => f.reverse()).reverse())), O([u, c]).map(([f, m]) => f.segmentsCount === 1 && i.some((P) => f.segments[0].isSame(P)) ? [f, "same"] : [f, m]);
+}
+function At(e) {
+  let t = e[0];
+  for (const n of e.slice(1))
+    t = t.extend(n);
+  if (!g(t.firstPoint, t.lastPoint))
+    throw console.error(
+      L(t.firstPoint),
+      L(t.lastPoint)
+    ), new Error("Bug in the intersection algo on non closing strand");
+  return new V(t.segments);
+}
+function an(e, t) {
+  const n = O([
+    t.slice(0, -1),
+    t.slice(1)
+  ]).map(([i, r]) => At(e.slice(i, r)));
+  let s = e.slice(
+    t[t.length - 1]
+  );
+  return t[0] !== 0 && (s = s.concat(e.slice(0, t[0]))), n.push(At(s)), n;
+}
+function hn(e) {
+  if (!e.length)
+    return [];
+  const t = e.map((i) => i.firstPoint);
+  let n = e.map((i) => i.lastPoint);
+  n = n.slice(-1).concat(n.slice(0, -1));
+  const s = O([t, n]).flatMap(
+    ([i, r], a) => g(i, r) ? [] : a
+  );
+  try {
+    return an(e, s);
+  } catch {
+    return sn(e.flatMap((r) => r.segments)).filter((r) => r.length > 1).filter((r) => g(r[0].firstPoint, r.at(-1).lastPoint)).map((r) => new V(r));
+  }
+}
+const bt = (e, t) => {
+  if (e.length === 0)
+    return [t];
+  const n = e.at(-1);
+  return g(n.lastPoint, t.firstPoint) ? e.slice(0, -1).concat([n.extend(t)]) : g(n.lastPoint, t.lastPoint) ? e.slice(0, -1).concat([n.extend(t.reverse())]) : e.concat([t]);
+}, un = (e, t) => e.length === 0 ? [t] : g(e[0].firstPoint, t.lastPoint) ? [t.extend(e[0])].concat(e.slice(1)) : [t].concat(e);
+function lt(e, t, {
+  firstInside: n,
+  secondInside: s
+}) {
+  const i = on(e, t);
+  if (!i) {
+    const h = e.segments[0].midPoint, l = t.contains(h), u = t.segments[0].midPoint, c = e.contains(u);
+    return {
+      identical: !1,
+      firstCurveInSecond: l,
+      secondCurveInFirst: c
+    };
+  }
+  if (i.every(([, h]) => h === "same"))
+    return { identical: !0 };
+  let r = null, a = null;
+  const o = i.flatMap(([h, l]) => {
+    let u = [], c = 0;
+    if (l === "same")
+      return a === 1 ? (a = 1, h) : a === 2 || a === 0 ? (a = null, []) : a === null ? (r ? r = r.extend(h) : r = h, []) : (console.error("weird situation"), []);
+    const f = h.segments[0].midPoint, m = t.contains(f);
+    (n === "keep" && m || n === "remove" && !m) && (c += 1, u = bt(u, h));
+    const P = l.segments[0].midPoint, w = e.contains(P);
+    if (s === "keep" && w || s === "remove" && !w) {
+      const M = l;
+      c += 1, c === 2 && u.length ? (u = bt(u, M), r = null) : u = [M];
+    }
+    return a === null && c === 1 && r && (u = un(u, r)), c === 1 && (a = c, r = null), u.length ? u : (r = null, []);
+  });
+  return hn(o);
+}
+const ln = (e, t) => {
+  const n = lt(e, t, {
+    firstInside: "remove",
+    secondInside: "remove"
+  });
+  return Array.isArray(n) ? n : n.identical ? [e] : n.firstCurveInSecond ? [t] : n.secondCurveInFirst ? [e] : [e, t];
+}, W = (e, t) => {
+  const n = lt(e, t, {
+    firstInside: "remove",
+    secondInside: "keep"
+  });
+  return Array.isArray(n) ? n : n.identical ? [] : n.firstCurveInSecond ? [] : n.secondCurveInFirst ? [e, t] : [e];
+}, ct = (e, t) => {
+  const n = lt(e, t, {
+    firstInside: "keep",
+    secondInside: "keep"
+  });
+  return Array.isArray(n) ? n : n.identical ? [e] : n.firstCurveInSecond ? [e] : n.secondCurveInFirst ? [t] : [];
+};
+function cn(e) {
+  const t = /* @__PURE__ */ new Map(), n = [];
+  return e.forEach((s, i) => {
+    let r;
+    t.has(i) ? r = t.get(i) : (r = { current: [s], fusedWith: /* @__PURE__ */ new Set([i]) }, n.push(r)), e.slice(i + 1).forEach((a, o) => {
+      const h = r.current, l = i + o + 1;
+      if (r.fusedWith.has(l))
+        return;
+      let u = [a], c = !1;
+      if (t.has(l) && (u = t.get(l).current, c = !0), !h.some(
+        (P) => u.some((w) => P.intersects(w))
+      ))
+        return;
+      let m;
+      h.length > 1 || u.length > 1 ? m = U(h, u) : m = Ot(h[0], u[0]), r.fusedWith.add(l), r.current = m, c || t.set(l, r);
+    });
+  }), n.flatMap(({ current: s }) => s);
+}
+function Ot(e, t) {
+  const n = ln(e.contour, t.contour), s = t.holes.flatMap((a) => W(a, e.contour)), i = e.holes.flatMap((a) => W(a, t.contour)), r = Wt(e.holes, t.holes).flatMap(
+    ([a, o]) => ct(a, o)
+  );
+  return D([
+    ...n,
+    ...s,
+    ...i,
+    ...r
+  ]);
+}
+function H(e, t) {
+  if (e.isFull && t.isFull)
+    return D(W(e.contour, t.contour));
+  if (e.isFull) {
+    const s = W(e.contour, t.contour), i = t.holes.flatMap(
+      (r) => ct(r, e.contour)
+    );
+    return D([...s, ...i]);
+  } else if (t.isFull && !e.contour.intersects(t.contour))
+    if (e.contour.contains(t.contour.firstPoint)) {
+      const s = U(
+        e.holes.map((i) => new S(i)),
+        [t]
+      );
+      return D([
+        e.contour,
+        ...s.flatMap((i) => i.allLoops)
+      ]);
+    } else
+      return [e];
+  let n = H(new S(e.contour), t);
+  return e.holes.forEach((s) => {
+    n = n.flatMap((i) => H(i, new S(s)));
+  }), n;
+}
+function fn(e, t) {
+  const n = ct(e.contour, t.contour);
+  if (!n.length)
+    return [];
+  let s = D(n);
+  return s = X(
+    s,
+    e.holes.map((i) => new S(i))
+  ), X(
+    s,
+    t.holes.map((i) => new S(i))
+  );
+}
+function U(e, t) {
+  if (!e.length)
+    return t;
+  if (!t.length)
+    return e;
+  if (e.length === 1 && t.length > 1 || t.length === 1 && e.length > 1)
+    return cn([...e, ...t]);
+  if (e.length > 1 && t.length > 1) {
+    let n = U([e[0]], t);
+    return e.slice(1).forEach((s) => {
+      n = U([s], n);
+    }), n;
+  }
+  return e.length === 1 && t.length === 1 ? Ot(e[0], t[0]) : [];
+}
+function X(e, t) {
+  if (!e.length)
+    return [];
+  if (!t.length)
+    return e;
+  if (e.length === 1 && t.length === 1)
+    return H(e[0], t[0]);
+  if (e.length > 1)
+    return e.flatMap((s) => X([s], t));
+  let n = H(e[0], t[0]);
+  return t.slice(1).forEach((s) => {
+    n = X(n, [s]);
+  }), n;
+}
+function rt(e, t) {
+  return !e.length || !t.length ? [] : e.length === 1 && t.length === 1 ? fn(e[0], t[0]) : e.length > 1 ? e.flatMap((n) => rt([n], t)) : t.flatMap((n) => rt(e, [n]));
+}
+class B extends Q {
+  constructor(t = [], { ignoreChecks: n = !1 } = {}) {
+    super(), this._boundingBox = null, n || gn(t), this.figures = t;
+  }
+  get isEmpty() {
+    return this.figures.length === 0;
+  }
+  get boundingBox() {
+    if (this.isEmpty)
+      return new q();
+    if (this._boundingBox === null) {
+      let t = this.figures[0].boundingBox;
+      for (const n of this.figures.slice(1))
+        t = t.merge(n.boundingBox);
+      this._boundingBox = t;
+    }
+    return this._boundingBox;
+  }
+  clone() {
+    return new B(this.figures.map((t) => t.clone()));
+  }
+  transform(t) {
+    return new B(this.figures.map((n) => n.transform(t)));
+  }
+  contains(t) {
+    return this.figures.some((n) => n.contains(t));
+  }
+  intersects(t) {
+    return this.figures.some(
+      (n) => t.figures.some((s) => n.intersects(s))
+    );
+  }
+  fuse(t) {
+    return new B(U(this.figures, t.figures));
+  }
+  cut(t) {
+    return new B(X(this.figures, t.figures));
+  }
+  intersect(t) {
+    return new B(rt(this.figures, t.figures));
+  }
+}
+function gn(e) {
+  for (const [t, n] of st(e))
+    if (t.intersects(n))
+      throw new Error("Diagram figures must not intersect");
+}
+function Lt(e) {
+  if (e instanceof p)
+    return {
+      type: e.segmentType,
+      firstPoint: e.firstPoint,
+      lastPoint: e.lastPoint
+    };
+  if (e instanceof d)
+    return {
+      type: e.segmentType,
+      firstPoint: e.firstPoint,
+      lastPoint: e.lastPoint,
+      center: e.center,
+      clockwise: e.clockwise
+    };
+  throw new Error("Unknown segment type");
+}
+function ot(e) {
+  return {
+    type: "LOOP",
+    segments: e.segments.map(Lt)
+  };
+}
+function Tt(e) {
+  return {
+    type: "FIGURE",
+    contour: ot(e.contour),
+    holes: e.holes.map(ot)
+  };
+}
+function mn(e) {
+  return {
+    type: "DIAGRAM",
+    figures: e.figures.map(Tt)
+  };
+}
+function St(e) {
+  if (e instanceof B)
+    return mn(e);
+  if (e instanceof S)
+    return Tt(e);
+  if (e instanceof V)
+    return ot(e);
+  if (e instanceof d || e instanceof p)
+    return Lt(e);
+  throw new Error("Unknown shape type");
+}
+export {
+  d as A,
+  St as B,
+  q as C,
+  B as D,
+  S as F,
+  p as L,
+  _ as S,
+  E as T,
+  A as a,
+  Z as b,
+  $ as c,
+  g as d,
+  dn as e,
+  Pn as f,
+  I as g,
+  y as h,
+  V as i,
+  R as j,
+  $t as k,
+  U as l,
+  X as m,
+  rt as n,
+  K as o,
+  k as p,
+  G as q,
+  Ut as r,
+  v as s,
+  pn as t,
+  C as u,
+  kt as v,
+  qt as w,
+  at as x,
+  sn as y,
+  Y as z
+};
+//# sourceMappingURL=exportJSON-26bb92ef.js.map