pantograph2d 0.3.1 → 0.4.0

package/dist/{exportJSON-26bb92ef.js → Diagram-1c56996e.js}

@@ -1,4 +1,4 @@
-function N(e, t, n, s) {
+function X(e, t, n, s) {
   return e <= s && t >= n;
 }
 class q {
@@ -13,10 +13,10 @@ class q {
   }
   contains(t) {
     const [n, s] = t;
-    return N(this.xMin, this.xMax, n, n) && N(this.yMin, this.yMax, s, s);
+    return X(this.xMin, this.xMax, n, n) && X(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);
+    return X(this.xMin, this.xMax, t.xMin, t.xMax) && X(this.yMin, this.yMax, t.yMin, t.yMax);
   }
   addPoint(t) {
     const [n, s] = t;
@@ -40,7 +40,7 @@ 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) {
+function Q(e, t = 1e-9) {
   return Array.from(
     new Map(
       e.map(([n, s]) => [
@@ -50,53 +50,53 @@ function J(e, t = 1e-9) {
     ).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));
+const qt = Math.PI / 180, I = (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, _ = ([e, t], n) => [e * n, t * n], Y = ([e, t], [n, s] = [0, 0]) => (e - n) ** 2 + (t - s) ** 2, k = (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]) {
+function st([e, t], [n, s]) {
   return e * n + t * s;
 }
-function C([e, t]) {
-  const n = I([e, t]);
+function B([e, t]) {
+  const n = k([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]) {
+function Dt([e, t]) {
   return Math.atan2(t, e);
 }
-function Dt(e) {
-  const t = I(e), n = qt(e);
+function Yt(e) {
+  const t = k(e), n = Dt(e);
   return [t, n];
 }
-function _t(e, t, n = 1e-9) {
+function vt(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) {
+function F(e) {
   return [-e[1], e[0]];
 }
-function Z(e) {
+function tt(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;
+  const [n, s, i, r, a, o, u, l, h] = e, [c, f, m, P, w, M, b, x, E] = t;
   return [
     n * c + s * P + i * b,
     n * f + s * w + i * x,
-    n * m + s * M + i * F,
+    n * m + s * M + i * E,
     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
+    r * m + a * M + o * E,
+    u * c + l * P + h * b,
+    u * f + l * w + h * x,
+    u * m + l * M + h * E
   ];
 };
-class E {
+class C {
   constructor() {
     this._matrix = [1, 0, 0, 0, 1, 0, 0, 0, 1];
   }
@@ -124,65 +124,68 @@ class E {
     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];
+    const [n, s] = t, [i, r, a, o, u, l] = this._matrix;
+    return [i * n + r * s + a, o * n + u * s + l];
   }
   keepsOrientation() {
     const [t, , , , n] = this._matrix;
     return t * n > 0;
   }
 }
-class Q {
+class K {
   translateX(t) {
-    const n = new E().translate(t, 0);
+    const n = new C().translate(t, 0);
     return this.transform(n);
   }
   translateY(t) {
-    const n = new E().translate(0, t);
+    const n = new C().translate(0, t);
     return this.transform(n);
   }
   translate(t, n) {
-    const s = new E().translate(t, n);
+    const s = new C().translate(t, n);
     return this.transform(s);
   }
   translateTo([t, n]) {
-    const s = new E().translate(t, n);
+    const s = new C().translate(t, n);
     return this.transform(s);
   }
   rotate(t, n) {
-    const s = new E().rotate(
-      t * $t,
+    const s = new C().rotate(
+      t * qt,
       n
     );
     return this.transform(s);
   }
   scale(t, n) {
-    const s = new E().scale(t, n);
+    const s = new C().scale(t, n);
     return this.transform(s);
   }
   mirrorCenter(t) {
-    const n = new E().mirrorCenter(t);
+    const n = new C().mirrorCenter(t);
     return this.transform(n);
   }
   mirror(t = "x", n) {
-    const s = new E();
+    const s = new C();
     return t === "x" ? s.mirrorX() : t === "y" ? s.mirrorY() : s.mirrorLine(t, n), this.transform(s);
   }
 }
-class vt extends Q {
+class It extends K {
   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(
+    return `${this.segmentType} ${I(this.firstPoint)} - ${I(
       this.lastPoint
     )}`;
   }
+  get info() {
+    return this.repr;
+  }
   [Symbol.for("nodejs.util.inspect.custom")]() {
     return this.repr;
   }
 }
-class p extends vt {
+class d extends It {
   constructor() {
     super(...arguments), this.segmentType = "LINE", this._V = null, this._boundingBox = null;
   }
@@ -191,10 +194,10 @@ class p extends vt {
     return t >= -n && 1 - t >= -n;
   }
   paramPoint(t) {
-    return A(this.firstPoint, v(this.V, t));
+    return A(this.firstPoint, _(this.V, t));
   }
   get length() {
-    return I(this.firstPoint, this.lastPoint);
+    return k(this.firstPoint, this.lastPoint);
   }
   get squareLength() {
     return Y(this.firstPoint, this.lastPoint);
@@ -203,16 +206,16 @@ class p extends vt {
     return this._V === null && (this._V = y(this.lastPoint, this.firstPoint)), this._V;
   }
   get midPoint() {
-    return A(this.firstPoint, v(this.V, 0.5));
+    return A(this.firstPoint, _(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;
+    return t instanceof d ? 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);
+    return new d(this.firstPoint, this.lastPoint);
   }
   reverse() {
-    return new p(this.lastPoint, this.firstPoint);
+    return new d(this.lastPoint, this.firstPoint);
   }
   get boundingBox() {
     return this._boundingBox === null && (this._boundingBox = new q(
@@ -223,105 +226,105 @@ class p extends vt {
     )), this._boundingBox;
   }
   distanceFrom(t) {
-    const n = y(t, this.firstPoint), s = et(n, this.V) / this.squareLength;
+    const n = y(t, this.firstPoint), s = st(n, this.V) / this.squareLength;
     if (s < 0)
-      return I(t, this.firstPoint);
+      return k(t, this.firstPoint);
     if (s > 1)
-      return I(t, this.lastPoint);
+      return k(t, this.lastPoint);
     const i = this.paramPoint(s);
-    return I(t, i);
+    return k(t, i);
   }
   isOnSegment(t) {
     if (g(t, this.firstPoint, this.precision))
       return !0;
     const n = y(t, this.firstPoint);
-    if (!_t(this.V, n))
+    if (!vt(this.V, n))
       return !1;
-    const s = et(n, this.V) / this.squareLength;
+    const s = st(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);
+    return B(this.V);
   }
   get normalVector() {
-    return k(C(this.V));
+    return F(B(this.V));
   }
   get tangentAtFirstPoint() {
-    return C(this.V);
+    return B(this.V);
   }
   get tangentAtLastPoint() {
-    return C(this.V);
+    return B(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))
+    Array.isArray(t[0]) ? n = t : n = [t], n.forEach((u) => {
+      if (!this.isOnSegment(u))
         throw new Error(
-          `Point ${L(h)} is not on segment ${this.repr}`
+          `Point ${I(u)} is not on segment ${this.repr}`
         );
     });
-    const s = [this.firstPoint, ...n, this.lastPoint], i = J(s), r = this.lastPoint[0] - this.firstPoint[0];
+    const s = [this.firstPoint, ...n, this.lastPoint], i = Q(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]));
+      (u, l) => a * (u[o] - l[o])
+    ), i.flatMap((u, l) => l === i.length - 1 ? [] : new d(u, i[l + 1]));
   }
   transform(t) {
-    return new p(
+    return new d(
       t.transform(this.firstPoint),
       t.transform(this.lastPoint)
     );
   }
 }
-function Yt(e) {
+function Ut(e) {
   return Array.from(Array(e).keys());
 }
-function O(e) {
+function L(e) {
   const t = Math.min(...e.map((n) => n.length));
-  return Yt(t).map((n) => e.map((s) => s[n]));
+  return Ut(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 nt(e, t = 1e-9) {
+  return e < 0 ? e + 2 * Math.PI : e >= 2 * Math.PI ? e % (2 * Math.PI) : e > 2 * Math.PI - t ? 0 : e;
 }
-function gt(e, t, n) {
-  let s = t - e;
-  return n && (s = -s), s < 0 && (s += 2 * Math.PI), s;
+function gt(e, t, n, s = 1e-9) {
+  let i = t - e;
+  return n && (i = -i), i < 0 && (i += 2 * Math.PI), i > 2 * Math.PI - s ? 0 : i;
 }
-const K = (e, t, n) => {
+const Z = (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;
+  const o = y(t.firstPoint, e.firstPoint), u = $(o, t.V) / s, l = $(o, e.V) / s;
   return {
-    intersectionParam1: h,
+    intersectionParam1: u,
     intersectionParam2: l
   };
 };
-function It(e, t, n = !1, s) {
-  const i = K(e, t, s);
+function _t(e, t, n = !1, s) {
+  const i = Z(e, t, s);
   if (i === "parallel") {
     if (!n)
       return null;
     if (e.isSame(t))
       return e;
-    const o = J(
+    const o = Q(
       [
         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]);
+      ].filter((u) => u !== null)
+    ).sort((u, l) => u[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]);
+      return new d(o[0], o[1]);
     throw console.error(o), new Error(
       "Unexpected number of points while intersecting parallel lines"
     );
@@ -331,24 +334,29 @@ function It(e, t, n = !1, s) {
 }
 const j = (e, t) => {
   const n = y(e, t);
-  return Dt(n);
+  return Yt(n);
 };
-class d extends vt {
+class p extends It {
   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)
+      if (Math.abs(this.radius - k(this.lastPoint, this.center)) > this.precision)
         throw new Error(
           "Invalid arc, radius does not match between start and end"
         );
     }
   }
+  get info() {
+    return `ARC(${I(this.firstPoint)}, ${I(
+      this.lastPoint
+    )}, ${I(this.center)}, ${this.clockwise ? "CW" : "CCW"})`;
+  }
   isValidParameter(t) {
     return 1 - t >= -this.precision && t >= -this.precision;
   }
   angleToParam(t) {
-    return gt(this.firstAngle, tt(t), this.clockwise) / this.angularLength;
+    return gt(this.firstAngle, nt(t), this.clockwise) / this.angularLength;
   }
   get angularLength() {
     return this._angularLength || (this._angularLength = gt(
@@ -370,29 +378,29 @@ class d extends vt {
     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}`
+        `Point ${I(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}`
+        `Point ${I(t)} is not on segment ${this.repr}`
       );
     return i;
   }
   get radius() {
-    return this._radius === null && (this._radius = I(this.firstPoint, this.center)), this._radius;
+    return this._radius === null && (this._radius = k(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));
+      this._firstAngle = nt(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));
+      this._lastAngle = nt(Math.atan2(n, t));
     }
     return this._lastAngle;
   }
@@ -406,10 +414,10 @@ class d extends vt {
     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;
+    return !(t instanceof p) || !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(
+    return new p(
       this.firstPoint,
       this.lastPoint,
       this.center,
@@ -417,7 +425,7 @@ class d extends vt {
     );
   }
   reverse() {
-    return new d(
+    return new p(
       this.lastPoint,
       this.firstPoint,
       this.center,
@@ -462,15 +470,15 @@ class d extends vt {
     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));
+    return (this.clockwise ? tt : F)(B(r));
   }
   get tangentAtFirstPoint() {
     const t = R(1, this.firstAngle);
-    return (this.clockwise ? Z : k)(C(t));
+    return (this.clockwise ? tt : F)(B(t));
   }
   get tangentAtLastPoint() {
     const t = R(1, this.lastAngle);
-    return (this.clockwise ? Z : k)(C(t));
+    return (this.clockwise ? tt : F)(B(t));
   }
   splitAt(t) {
     let n;
@@ -478,18 +486,18 @@ class d extends vt {
       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]])
+      L([i, [this.firstPoint, this.lastPoint, ...n]])
     );
-    i.sort((o, h) => o - h);
+    i.sort((o, u) => o - u);
     let a = null;
-    return i.flatMap((o, h) => {
-      if (h === i.length - 1)
+    return i.flatMap((o, u) => {
+      if (u === i.length - 1)
         return [];
-      const l = i[h + 1];
+      const l = i[u + 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),
+      const h = a === null ? o : a, c = new p(
+        r.get(h) || this.paramPoint(h),
         r.get(l) || this.paramPoint(l),
         this.center,
         this.clockwise
@@ -498,7 +506,7 @@ class d extends vt {
     });
   }
   transform(t) {
-    return new d(
+    return new p(
       t.transform(this.firstPoint),
       t.transform(this.lastPoint),
       t.transform(this.center),
@@ -506,31 +514,31 @@ class d extends vt {
     );
   }
 }
-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(
+function pn(e, t, n) {
+  const s = new d(t, e), i = new d(t, n), r = F(s.tangentAtFirstPoint), a = F(i.tangentAtLastPoint), o = Z(
     { 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 = $(
+  const u = $(
     y(e, t),
     y(n, t)
   ) > 0;
-  return new d(
+  return new p(
     e,
     n,
-    A(s.midPoint, v(r, o.intersectionParam1)),
-    h,
+    A(s.midPoint, _(r, o.intersectionParam1)),
+    u,
     { ignoreChecks: !0 }
   );
 }
-function pn(e, t, n) {
-  const s = new p(t, e), i = k(s.tangentAtFirstPoint), r = K(
+function dn(e, t, n) {
+  const s = new d(t, e), i = F(s.tangentAtFirstPoint), r = Z(
     { firstPoint: s.midPoint, V: i, precision: 1e-9 },
     {
       firstPoint: e,
-      V: k(n),
+      V: F(n),
       precision: 1e-9
     }
   );
@@ -538,21 +546,21 @@ function pn(e, t, n) {
     throw new Error("Cannot create an arc from three colinear points");
   const a = A(
     s.midPoint,
-    v(i, r.intersectionParam1)
+    _(i, r.intersectionParam1)
   ), o = $(
     y(a, e),
     y(a, A(e, n))
   ) < 0;
-  return new d(e, t, a, o, {
+  return new p(e, t, a, o, {
     ignoreChecks: !0
   });
 }
-function Ut(e, t) {
-  const n = y(t, e.firstPoint), s = et(n, e.V) / e.squareLength;
+function Nt(e, t) {
+  const n = y(t, e.firstPoint), s = st(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);
+  const s = n || e.precision, i = Nt(e, t.center), r = k(i, t.center);
   if (r > t.radius + s)
     return [];
   if (Math.abs(r - t.radius) < s) {
@@ -561,20 +569,20 @@ function G(e, t, n) {
   }
   const a = [], o = Math.sqrt(
     t.radius * t.radius - r * r
-  ), h = e.tangentAtFirstPoint, l = A(i, v(h, o));
+  ), u = e.tangentAtFirstPoint, l = A(i, _(u, 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 h = A(i, _(u, -o));
+  return e.isOnSegment(h) && t.isOnSegment(h) && a.push(h), a;
 }
 const Xt = (e) => {
   const { firstPoint: t, lastPoint: n, center: s, clockwise: i } = e;
-  return new d(n, t, s, i, {
+  return new p(n, t, s, i, {
     ignoreChecks: !0
   });
-}, Nt = (e, t) => {
+}, Rt = (e, t) => {
   if (e.isSame(t))
     return [e];
-  const n = J(
+  const n = Q(
     [
       t.isOnSegment(e.firstPoint) ? e.firstPoint : null,
       t.isOnSegment(e.lastPoint) ? e.lastPoint : null,
@@ -589,11 +597,11 @@ const Xt = (e) => {
   if (n.length === 1)
     return [];
   if (n.length === 2)
-    return e.isSame(Xt(t)) ? [] : [new d(n[0], n[1], e.center, e.clockwise)];
+    return e.isSame(Xt(t)) ? [] : [new p(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(
+      new p(
         n[0 + s],
         n[1 + s],
         e.center,
@@ -602,21 +610,21 @@ const Xt = (e) => {
     ];
   } 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)
+      new p(n[0], n[1], e.center, e.clockwise),
+      new p(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;
+  const i = s || e.precision, r = k(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;
+    return o > i ? [] : n ? Rt(e, t) : [];
+  const u = B(y(t.center, e.center)), l = r > a - i;
   if (
     // circles are outside each other
     l || // circles are inside each other
@@ -624,21 +632,21 @@ function kt(e, t, n = !1, s) {
   ) {
     const b = l || e.radius > t.radius ? 1 : -1, x = A(
       e.center,
-      v(h, b * e.radius)
+      _(u, 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(
+  const h = e.radius * e.radius / (2 * r) - t.radius * t.radius / (2 * r) + r / 2, c = A(
     e.center,
-    v(h, u)
+    _(u, h)
   ), 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 = [];
+    e.radius * e.radius - h * h
+  ), m = F(u), P = A(c, _(m, f)), w = A(c, _(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(
+  if (e instanceof d && t instanceof d) {
+    const s = _t(
       e,
       t,
       !1,
@@ -646,42 +654,42 @@ function Pn(e, t, 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(e, t, n);
+  if (e instanceof p && t instanceof d)
     return G(t, e, n);
-  if (e instanceof d && t instanceof d)
+  if (e instanceof p && t instanceof p)
     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(
+function W(e, t, n) {
+  if (e instanceof d && t instanceof d) {
+    const s = _t(
       e,
       t,
       !0,
       n
     );
-    return s === null ? { intersections: [], overlaps: [], count: 0 } : s instanceof p ? { intersections: [], overlaps: [s], count: 1 } : { intersections: [s], overlaps: [], count: 1 };
+    return s === null ? { intersections: [], overlaps: [], count: 0 } : s instanceof d ? { 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) {
+  if (e instanceof d && t instanceof p) {
     const s = G(e, t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (e instanceof d && t instanceof p) {
+  if (e instanceof p && t instanceof d) {
     const s = G(t, e, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (e instanceof d && t instanceof d) {
+  if (e instanceof p && t instanceof p) {
     const s = kt(
       e,
       t,
       !0,
       n
     );
-    return s.length ? s[0] instanceof d ? {
+    return s.length ? s[0] instanceof p ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -700,112 +708,22 @@ function Ft(e) {
       t.push([n, s]);
   return t;
 }
-function* st(e) {
+function* it(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 {
+class Et extends K {
   constructor(t, { ignoreChecks: n = !1 } = {}) {
-    super(), this._boundingBox = null, n || Vt(t), this.segments = t;
+    super(), this._boundingBox = null, n || Ct(t), this.segments = t;
   }
   get repr() {
     return this.segments.map((t) => t.repr).join(`
 `) + `
 `;
   }
+  get info() {
+    return this.repr;
+  }
   get firstPoint() {
     return this.segments[0].firstPoint;
   }
@@ -821,10 +739,13 @@ class Ct extends Q {
   intersects(t) {
     return this.boundingBox.overlaps(t.boundingBox) ? this.segments.some(
       (n) => t.segments.some(
-        (s) => at(n, s).count > 0
+        (s) => W(n, s).count > 0
       )
     ) : !1;
   }
+  overlappingSegments(t) {
+    return this.segments.flatMap((n) => t.segments.flatMap((s) => n.boundingBox.overlaps(s.boundingBox) ? W(n, s).overlaps : []));
+  }
   get boundingBox() {
     if (this._boundingBox === null) {
       let t = this.segments[0].boundingBox;
@@ -838,45 +759,47 @@ class Ct extends Q {
     return this.repr;
   }
 }
-function Ht(e, t = "Stroke") {
+function jt(e, t = "Stroke") {
   Ft(e.length).forEach(
     ([n, s]) => {
       if (n === s)
         return;
-      const i = e[n], r = e[s], a = at(i, r);
+      const i = e[n], r = e[s], a = W(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))
+          const o = n - s, u = a.intersections[0];
+          if (o === 1 && g(i.firstPoint, u) || o === -1 && g(i.lastPoint, u) || o === e.length - 1 && g(i.lastPoint, u) && g(r.firstPoint, u) || -o === e.length - 1 && g(i.firstPoint, u) && g(r.lastPoint, u))
             return;
         }
         throw new Error(
-          `${t} segments must not intersect, but segments ${i.repr} and ${r.repr} do`
+          `${t} segments must not intersect, but segments ${i.info} and ${r.info} do at ${JSON.stringify(
+            a.intersections
+          )}`
         );
       }
     }
   );
 }
-function Vt(e, t = "Stroke") {
+function Ct(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(
+  L([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`
+          `${t} segments must be connected, but ${n.info} and ${s.info} are not`
         );
     }
-  ), Ht(e, t);
+  ), jt(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);
+  return !!(e instanceof d && t instanceof d && vt(e.V, t.V) || e instanceof p && t instanceof p && 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);
+function pt(e, t) {
   if (e instanceof d && t instanceof d)
-    return new d(
+    return new d(e.firstPoint, t.lastPoint);
+  if (e instanceof p && t instanceof p)
+    return new p(
       e.firstPoint,
       t.lastPoint,
       e.center,
@@ -884,7 +807,7 @@ function dt(e, t) {
     );
   throw new Error("Not implemented");
 }
-function Bt(e) {
+function Vt(e) {
   let t = !1;
   const n = [];
   for (const s of e.segments) {
@@ -893,7 +816,7 @@ function Bt(e) {
       continue;
     }
     const i = n[n.length - 1];
-    mt(i, s) ? (t = !0, n.pop(), n.push(dt(i, s))) : n.push(s);
+    mt(i, s) ? (t = !0, n.pop(), n.push(pt(i, s))) : n.push(s);
   }
   if (g(e.firstPoint, e.lastPoint) && mt(
     n[0],
@@ -901,20 +824,20 @@ function Bt(e) {
   )) {
     t = !0;
     const s = n.pop();
-    n[0] = dt(s, n[0]);
+    n[0] = pt(s, n[0]);
   }
   return t ? n : null;
 }
-class _ extends Ct {
+class v extends Et {
   constructor() {
     super(...arguments), this.strokeType = "STRAND";
   }
   reverse() {
     const t = this.segments.map((n) => n.reverse());
-    return t.reverse(), new _(t, { ignoreChecks: !0 });
+    return t.reverse(), new v(t, { ignoreChecks: !0 });
   }
   clone() {
-    return new _(
+    return new v(
       this.segments.map((t) => t.clone()),
       { ignoreChecks: !0 }
     );
@@ -922,21 +845,21 @@ class _ extends Ct {
   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]);
+    return new v([...this.segments, ...t.segments]);
   }
   simplify() {
-    const t = Bt(this);
-    return t ? new _(t, { ignoreChecks: !0 }) : this;
+    const t = Vt(this);
+    return t ? new v(t, { ignoreChecks: !0 }) : this;
   }
   transform(t) {
-    return new _(
+    return new v(
       this.segments.map((n) => n.transform(t)),
       { ignoreChecks: !0 }
     );
   }
 }
-const Jt = (e, t) => {
-  const n = K(t, {
+const zt = (e, t) => {
+  const n = Z(t, {
     V: [1, 0],
     firstPoint: e,
     precision: t.precision
@@ -951,7 +874,7 @@ const Jt = (e, t) => {
     return e[1] - r < 0 ? 1 : 0;
   }
   return 1;
-}, Qt = (e, t) => {
+}, Gt = (e, t) => {
   const n = t.precision, s = Math.abs(e[1] - t.center[1]);
   if (s > t.radius + n)
     return 0;
@@ -961,29 +884,29 @@ const Jt = (e, t) => {
   const o = i - r > a;
   if (o && t.center[0] < e[0])
     return 0;
-  const h = Math.sqrt(
+  const u = Math.sqrt(
     t.radius * t.radius - s * s
   );
   let l = 0;
-  const u = (c) => {
+  const h = (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;
+  return h([t.center[0] + u, e[1]]), o && h([t.center[0] - u, e[1]]), l;
 };
-function Kt(e, t) {
-  if (t instanceof p)
-    return Jt(e, t);
+function Wt(e, t) {
   if (t instanceof d)
-    return Qt(e, t);
+    return zt(e, t);
+  if (t instanceof p)
+    return Gt(e, t);
   throw new Error("Not implemented");
 }
-class V extends Ct {
+class O extends Et {
   constructor(t, { ignoreChecks: n = !1 } = {}) {
-    super(t, { ignoreChecks: !0 }), this.strokeType = "LOOP", this._clockwise = null, n || Zt(t);
+    super(t, { ignoreChecks: !0 }), this.strokeType = "LOOP", this._clockwise = null, n || Ht(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 t = this.segments.flatMap((s) => s instanceof d ? [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);
@@ -992,34 +915,81 @@ class V extends Ct {
     return this._clockwise;
   }
   clone() {
-    return new V(
+    return new O(
       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 });
+    return t.reverse(), new O(t, { ignoreChecks: !0 });
   }
   transform(t) {
-    return new V(
+    return new O(
       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;
+    return this.onStroke(t) || !this.boundingBox.contains(t) ? !1 : this.segments.reduce((s, i) => s + Wt(t, i), 0) % 2 === 1;
   }
   simplify() {
-    const t = Bt(this);
-    return t ? new V(t, { ignoreChecks: !0 }) : this;
+    const t = Vt(this);
+    return t ? new O(t, { ignoreChecks: !0 }) : this;
   }
 }
-function Zt(e) {
-  if (Vt(e, "Loop"), !g(e[0].firstPoint, e[e.length - 1].lastPoint))
+function Ht(e) {
+  if (Ct(e, "Loop"), !g(e[0].firstPoint, e[e.length - 1].lastPoint))
     throw new Error("Loop segment must be closed");
 }
-class tn {
+function Bt(e) {
+  if (e instanceof d)
+    return {
+      type: e.segmentType,
+      firstPoint: e.firstPoint,
+      lastPoint: e.lastPoint
+    };
+  if (e instanceof p)
+    return {
+      type: e.segmentType,
+      firstPoint: e.firstPoint,
+      lastPoint: e.lastPoint,
+      center: e.center,
+      clockwise: e.clockwise
+    };
+  throw new Error("Unknown segment type");
+}
+function rt(e) {
+  return {
+    type: "LOOP",
+    segments: e.segments.map(Bt)
+  };
+}
+function Ot(e) {
+  return {
+    type: "FIGURE",
+    contour: rt(e.contour),
+    holes: e.holes.map(rt)
+  };
+}
+function Jt(e) {
+  return {
+    type: "DIAGRAM",
+    figures: e.figures.map(Ot)
+  };
+}
+function dt(e) {
+  if (e instanceof V)
+    return Jt(e);
+  if (e instanceof S)
+    return Ot(e);
+  if (e instanceof O)
+    return rt(e);
+  if (e instanceof p || e instanceof d)
+    return Bt(e);
+  throw new Error("Unknown shape type");
+}
+class Qt {
   constructor() {
     this.ids = [], this.values = [], this.length = 0;
   }
@@ -1046,11 +1016,11 @@ class tn {
       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)
+        let u = this.ids[a], l = this.values[a];
+        const h = this.values[o];
+        if (o < this.length && h < l && (a = o, u = this.ids[o], l = h), l >= s)
           break;
-        this.ids[r] = h, this.values[r] = l, r = a;
+        this.ids[r] = u, this.values[r] = l, r = a;
       }
       this.ids[r] = n, this.values[r] = s;
     }
@@ -1068,7 +1038,7 @@ class tn {
     this.ids.length = this.values.length = this.length;
   }
 }
-const pt = [
+const Pt = [
   Int8Array,
   Uint8Array,
   Uint8ClampedArray,
@@ -1078,7 +1048,7 @@ const pt = [
   Uint32Array,
   Float32Array,
   Float64Array
-], nt = 3;
+], et = 3;
 class ut {
   static from(t) {
     if (!t || t.byteLength === void 0 || t.buffer)
@@ -1086,10 +1056,10 @@ class ut {
     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}.`);
+    if (s >> 4 !== et)
+      throw new Error(`Got v${s >> 4} data when expected v${et}.`);
     const [i] = new Uint16Array(t, 2, 1), [r] = new Uint32Array(t, 4, 1);
-    return new ut(r, i, pt[s & 15], void 0, t);
+    return new ut(r, i, Pt[s & 15], void 0, t);
   }
   constructor(t, n = 16, s = Float64Array, i = ArrayBuffer, r) {
     if (t === void 0)
@@ -1103,10 +1073,10 @@ class ut {
       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)
+    const u = Pt.indexOf(this.ArrayType), l = o * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+    if (u < 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();
+    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, (et << 4) + u]), new Uint16Array(this.data, 2, 1)[0] = n, new Uint32Array(this.data, 4, 1)[0] = t), this._queue = new Qt();
   }
   add(t, n, s, i) {
     const r = this._pos >> 2, a = this._boxes;
@@ -1122,18 +1092,18 @@ class ut {
     }
     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);
+      const u = t[o++], l = t[o++], h = t[o++], c = t[o++], f = Math.floor(r * ((u + h) / 2 - this.minX) / n), m = Math.floor(r * ((l + c) / 2 - this.minY) / s);
+      i[a] = Zt(f, m);
     }
-    it(i, t, this._indices, 0, this.numItems - 1, this.nodeSize);
+    ot(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 u = this._levelBounds[a];
+      for (; o < u; ) {
         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;
+        let h = t[o++], c = t[o++], f = t[o++], m = t[o++];
+        for (let P = 1; P < this.nodeSize && o < u; P++)
+          h = Math.min(h, 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++] = h, t[this._pos++] = c, t[this._pos++] = f, t[this._pos++] = m;
       }
     }
   }
@@ -1141,42 +1111,42 @@ class ut {
     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 = [];
+    const o = [], u = [];
     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])
+      const l = Math.min(a + this.nodeSize * 4, xt(a, this._levelBounds));
+      for (let h = a; h < l; h += 4) {
+        if (s < this._boxes[h] || i < this._boxes[h + 1] || t > this._boxes[h + 2] || n > this._boxes[h + 3])
           continue;
-        const c = this._indices[u >> 2] | 0;
-        a >= this.numItems * 4 ? o.push(c) : (r === void 0 || r(c)) && h.push(c);
+        const c = this._indices[h >> 2] | 0;
+        a >= this.numItems * 4 ? o.push(c) : (r === void 0 || r(c)) && u.push(c);
       }
       a = o.pop();
     }
-    return h;
+    return u;
   }
   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;
+    const o = this._queue, u = [], 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;
+      const h = Math.min(a + this.nodeSize * 4, xt(a, this._levelBounds));
+      for (let c = a; c < h; c += 4) {
+        const f = this._indices[c >> 2] | 0, m = wt(t, this._boxes[c], this._boxes[c + 2]), P = wt(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;
+        if (o.peekValue() > l || (u.push(o.pop() >> 1), u.length === s))
+          return o.clear(), u;
       a = o.pop() >> 1;
     }
-    return o.clear(), h;
+    return o.clear(), u;
   }
 }
-function Pt(e, t, n) {
+function wt(e, t, n) {
   return e < t ? t - e : e <= n ? 0 : e - n;
 }
-function wt(e, t) {
+function xt(e, t) {
   let n = 0, s = t.length - 1;
   for (; n < s; ) {
     const i = n + s >> 1;
@@ -1184,39 +1154,39 @@ function wt(e, t) {
   }
   return t[n];
 }
-function it(e, t, n, s, i, r) {
+function ot(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;
+  let o = s - 1, u = i + 1;
   for (; ; ) {
     do
       o++;
     while (e[o] < a);
     do
-      h--;
-    while (e[h] > a);
-    if (o >= h)
+      u--;
+    while (e[u] > a);
+    if (o >= u)
       break;
-    nn(e, t, n, o, h);
+    Kt(e, t, n, o, u);
   }
-  it(e, t, n, s, h, r), it(e, t, n, h + 1, i, r);
+  ot(e, t, n, s, u, r), ot(e, t, n, u + 1, i, r);
 }
-function nn(e, t, n, s, i) {
+function Kt(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 a = 4 * s, o = 4 * i, u = t[a], l = t[a + 1], h = 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] = u, t[o + 1] = l, t[o + 2] = h, 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 Zt(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, u = i >> 1 ^ s & r >> 1 ^ i, l = n & i >> 1 ^ r >> 1 ^ r;
+  n = a, s = o, i = u, r = l, a = n & n >> 2 ^ s & s >> 2, o = n & s >> 2 ^ s & (n ^ s) >> 2, u ^= n & i >> 2 ^ s & r >> 2, l ^= s & i >> 2 ^ (n ^ s) & r >> 2, n = a, s = o, i = u, r = l, a = n & n >> 4 ^ s & s >> 4, o = n & s >> 4 ^ s & (n ^ s) >> 4, u ^= n & i >> 4 ^ s & r >> 4, l ^= s & i >> 4 ^ (n ^ s) & r >> 4, n = a, s = o, i = u, r = l, u ^= n & i >> 8 ^ s & r >> 8, l ^= s & i >> 8 ^ (n ^ s) & r >> 8, n = u ^ u >> 1, s = l ^ l >> 1;
+  let h = e ^ t, c = s | 65535 ^ (h | n);
+  return h = (h | h << 8) & 16711935, h = (h | h << 4) & 252645135, h = (h | h << 2) & 858993459, h = (h | h << 1) & 1431655765, c = (c | c << 8) & 16711935, c = (c | c << 4) & 252645135, c = (c | c << 2) & 858993459, c = (c | c << 1) & 1431655765, (c << 1 | h) >>> 0;
 }
-function sn(e, t = 1e-7) {
+function Lt(e, t = 1e-7) {
   const n = new ut(e.length);
   e.forEach((r) => {
     const [a, o] = r.firstPoint;
@@ -1227,43 +1197,147 @@ function sn(e, t = 1e-7) {
     if (i.has(a))
       return;
     const o = [r];
-    let h = a;
+    let u = 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(
+      const h = o[o.length - 1].lastPoint, [c, f] = h, 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) => [
+      ), P = (x) => Math.abs((u - x) % e.length), w = m.filter((x) => !i.has(x)).map((x) => [
         e[x],
         x,
         P(x)
-      ]).sort(([, , x], [, , F]) => P(x) - P(F));
+      ]).sort(([, , x], [, , E]) => P(x) - P(E));
       if (w.length === 0) {
         s.push(o);
         break;
       }
       const [M, b] = w[0];
-      o.push(M), i.add(b), h = b;
+      o.push(M), i.add(b), u = b;
     }
   }), s;
 }
-const xt = (e, t) => {
+class S extends K {
+  constructor(t, n = [], { ignoreChecks: s = !1 } = {}) {
+    super(), s || tn(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))
+    );
+  }
+  overlappingStrands(t) {
+    const n = t instanceof S ? t.allLoops : [t], s = this.allLoops.flatMap((i) => n.flatMap((r) => i.overlappingSegments(r)));
+    return Lt(s).map((i) => new v(i));
+  }
+}
+function tn(e, t = []) {
+  if (!e)
+    throw new Error("Figure must have a contour");
+  for (const [n, s] of it([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 it(t))
+    if (n.contains(s.firstPoint))
+      throw console.error(dt(n), dt(s)), new Error("Holes must not be inside other holes");
+}
+const nn = (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;
+}, Tt = (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
+  };
+}), en = (e, t) => e.flatMap(({ loop: n }) => ht(
+  t.filter(
+    ({ loop: s, isIn: i }) => s === n || i.indexOf(n) !== -1
+  )
+)), sn = (e, t) => {
+  const n = t.filter(({ isIn: i }) => i.length <= 1), s = ht(
+    Tt(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 ? en(t, e) : sn(n, e);
+};
+function D(e) {
+  return nn(e).map(Tt).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 rn(e, t) {
+  const n = [];
+  for (const s of e)
+    for (const i of t)
+      n.push([s, i]);
+  return n;
+}
+function* Mt(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 v(r, { ignoreChecks: !0 }), r = []) : i(a) ? (r.length && (yield new v(r, { ignoreChecks: !0 }), r = []), yield new v([a], { ignoreChecks: !0 })) : r.push(a);
+  r.length && (yield new v(r, { ignoreChecks: !0 }));
+}
+const yt = (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) => {
+}, At = (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());
+    const o = e.map((u) => u.reverse());
     if (o.reverse(), i = o.findIndex(s), i === -1)
       throw console.error(
-        o.map((h) => h.repr),
+        o.map((u) => u.repr),
         t.repr
       ), new Error("Failed to rotate to segment start");
     n = o;
@@ -1271,14 +1345,7 @@ const xt = (e, t) => {
   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) {
+function on(e, t, n) {
   return e.filter((s) => {
     const i = t.filter((o) => g(o.firstPoint, s) || g(o.lastPoint, s));
     if (i.length % 2)
@@ -1287,54 +1354,54 @@ function rn(e, t, n) {
     return !(r.every((o) => o) || !r.some((o) => o));
   });
 }
-function on(e, t, n) {
+function an(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(
+      const { intersections: M, overlaps: b } = W(
         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
+      const x = b.flatMap((E) => [
+        E.firstPoint,
+        E.lastPoint
       ]);
       s.push(...x), r[m].push(...x), a[w].push(...x);
     });
-  }), s = J(s, n), !s.length || s.length === 1)
+  }), s = Q(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(
+  let u = L([e.segments, r]).flatMap(o), l = L([t.segments, a]).flatMap(o);
+  if (s = on(
     s,
-    h,
+    u,
     t
   ), !s.length && !i.length)
     return null;
   if (i.length) {
     const f = i[0];
-    h = Mt(
-      h,
+    u = At(
+      u,
       f
-    ), l = Mt(
+    ), l = At(
       l,
       f
     );
   } else {
     const f = s[0];
-    h = xt(h, f), l = xt(l, f);
+    u = yt(u, f), l = yt(l, f);
   }
-  let u = Array.from(
-    yt(
-      h,
+  let h = Array.from(
+    Mt(
+      u,
       s,
       i
     )
   ), c = Array.from(
-    yt(
+    Mt(
       l,
       s,
       i
@@ -1342,29 +1409,29 @@ function on(e, t, n) {
   );
   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]);
+    h[0].lastPoint
+  ) || i.length > 0 && c[0].segmentsCount !== 1) && (c = c.map((f) => f.reverse()).reverse(), g(c[0].lastPoint, h[0].lastPoint) || (h = h.map((f) => f.reverse()).reverse())), L([h, c]).map(([f, m]) => f.segmentsCount === 1 && i.some((P) => f.segments[0].isSame(P)) ? [f, "same"] : [f, m]);
 }
-function At(e) {
+function St(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)
+      I(t.firstPoint),
+      I(t.lastPoint)
     ), new Error("Bug in the intersection algo on non closing strand");
-  return new V(t.segments);
+  return new O(t.segments);
 }
-function an(e, t) {
-  const n = O([
+function un(e, t) {
+  const n = L([
     t.slice(0, -1),
     t.slice(1)
-  ]).map(([i, r]) => At(e.slice(i, r)));
+  ]).map(([i, r]) => St(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;
+  return t[0] !== 0 && (s = s.concat(e.slice(0, t[0]))), n.push(St(s)), n;
 }
 function hn(e) {
   if (!e.length)
@@ -1372,13 +1439,13 @@ function hn(e) {
   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(
+  const s = L([t, n]).flatMap(
     ([i, r], a) => g(i, r) ? [] : a
   );
   try {
-    return an(e, s);
+    return un(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));
+    return Lt(e.flatMap((r) => r.segments)).filter((r) => r.length > 1).filter((r) => g(r[0].firstPoint, r.at(-1).lastPoint)).map((r) => new O(r));
   }
 }
 const bt = (e, t) => {
@@ -1386,45 +1453,45 @@ const bt = (e, t) => {
     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);
+}, ln = (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);
+  const i = an(e, t);
   if (!i) {
-    const h = e.segments[0].midPoint, l = t.contains(h), u = t.segments[0].midPoint, c = e.contains(u);
+    const u = e.segments[0].midPoint, l = t.contains(u), h = t.segments[0].midPoint, c = e.contains(h);
     return {
       identical: !1,
       firstCurveInSecond: l,
       secondCurveInFirst: c
     };
   }
-  if (i.every(([, h]) => h === "same"))
+  if (i.every(([, u]) => u === "same"))
     return { identical: !0 };
   let r = null, a = null;
-  const o = i.flatMap(([h, l]) => {
-    let u = [], c = 0;
+  const o = i.flatMap(([u, l]) => {
+    let h = [], 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));
+      return a === 1 ? (a = 1, u) : a === 2 || a === 0 ? (a = null, []) : a === null ? (r ? r = r.extend(u) : r = u, []) : (console.error("weird situation"), []);
+    const f = u.segments[0].midPoint, m = t.contains(f);
+    (n === "keep" && m || n === "remove" && !m) && (c += 1, h = bt(h, u));
     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];
+      c += 1, c === 2 && h.length ? (h = bt(h, M), r = null) : h = [M];
     }
-    return a === null && c === 1 && r && (u = un(u, r)), c === 1 && (a = c, r = null), u.length ? u : (r = null, []);
+    return a === null && c === 1 && r && (h = ln(h, r)), c === 1 && (a = c, r = null), h.length ? h : (r = null, []);
   });
   return hn(o);
 }
-const ln = (e, t) => {
+const cn = (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) => {
+}, H = (e, t) => {
   const n = lt(e, t, {
     firstInside: "remove",
     secondInside: "keep"
@@ -1437,26 +1504,26 @@ const ln = (e, t) => {
   });
   return Array.isArray(n) ? n : n.identical ? [e] : n.firstCurveInSecond ? [e] : n.secondCurveInFirst ? [t] : [];
 };
-function cn(e) {
+function fn(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;
+      const u = 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))
+      let h = [a], c = !1;
+      if (t.has(l) && (h = t.get(l).current, c = !0), !u.some(
+        (P) => h.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);
+      u.length > 1 || h.length > 1 ? m = U(u, h) : m = $t(u[0], h[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(
+function $t(e, t) {
+  const n = cn(e.contour, t.contour), s = t.holes.flatMap((a) => H(a, e.contour)), i = e.holes.flatMap((a) => H(a, t.contour)), r = rn(e.holes, t.holes).flatMap(
     ([a, o]) => ct(a, o)
   );
   return D([
@@ -1466,11 +1533,11 @@ function Ot(e, t) {
     ...r
   ]);
 }
-function H(e, t) {
+function J(e, t) {
   if (e.isFull && t.isFull)
-    return D(W(e.contour, t.contour));
+    return D(H(e.contour, t.contour));
   if (e.isFull) {
-    const s = W(e.contour, t.contour), i = t.holes.flatMap(
+    const s = H(e.contour, t.contour), i = t.holes.flatMap(
       (r) => ct(r, e.contour)
     );
     return D([...s, ...i]);
@@ -1486,20 +1553,20 @@ function H(e, t) {
       ]);
     } else
       return [e];
-  let n = H(new S(e.contour), t);
+  let n = J(new S(e.contour), t);
   return e.holes.forEach((s) => {
-    n = n.flatMap((i) => H(i, new S(s)));
+    n = n.flatMap((i) => J(i, new S(s)));
   }), n;
 }
-function fn(e, t) {
+function gn(e, t) {
   const n = ct(e.contour, t.contour);
   if (!n.length)
     return [];
   let s = D(n);
-  return s = X(
+  return s = N(
     s,
     e.holes.map((i) => new S(i))
-  ), X(
+  ), N(
     s,
     t.holes.map((i) => new S(i))
   );
@@ -1510,35 +1577,35 @@ function U(e, t) {
   if (!t.length)
     return e;
   if (e.length === 1 && t.length > 1 || t.length === 1 && e.length > 1)
-    return cn([...e, ...t]);
+    return fn([...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]) : [];
+  return e.length === 1 && t.length === 1 ? $t(e[0], t[0]) : [];
 }
-function X(e, t) {
+function N(e, t) {
   if (!e.length)
     return [];
   if (!t.length)
     return e;
   if (e.length === 1 && t.length === 1)
-    return H(e[0], t[0]);
+    return J(e[0], t[0]);
   if (e.length > 1)
-    return e.flatMap((s) => X([s], t));
-  let n = H(e[0], t[0]);
+    return e.flatMap((s) => N([s], t));
+  let n = J(e[0], t[0]);
   return t.slice(1).forEach((s) => {
-    n = X(n, [s]);
+    n = N(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]));
+function at(e, t) {
+  return !e.length || !t.length ? [] : e.length === 1 && t.length === 1 ? gn(e[0], t[0]) : e.length > 1 ? e.flatMap((n) => at([n], t)) : t.flatMap((n) => at(e, [n]));
 }
-class B extends Q {
+class V extends K {
   constructor(t = [], { ignoreChecks: n = !1 } = {}) {
-    super(), this._boundingBox = null, n || gn(t), this.figures = t;
+    super(), this._boundingBox = null, n || mn(t), this.figures = t;
   }
   get isEmpty() {
     return this.figures.length === 0;
@@ -1555,10 +1622,10 @@ class B extends Q {
     return this._boundingBox;
   }
   clone() {
-    return new B(this.figures.map((t) => t.clone()));
+    return new V(this.figures.map((t) => t.clone()));
   }
   transform(t) {
-    return new B(this.figures.map((n) => n.transform(t)));
+    return new V(this.figures.map((n) => n.transform(t)));
   }
   contains(t) {
     return this.figures.some((n) => n.contains(t));
@@ -1568,102 +1635,64 @@ class B extends Q {
       (n) => t.figures.some((s) => n.intersects(s))
     );
   }
+  overlappingStrands(t) {
+    return this.figures.flatMap((n) => t instanceof V ? t.figures.flatMap(
+      (s) => n.overlappingStrands(s)
+    ) : n.overlappingStrands(t));
+  }
   fuse(t) {
-    return new B(U(this.figures, t.figures));
+    return new V(U(this.figures, t.figures));
   }
   cut(t) {
-    return new B(X(this.figures, t.figures));
+    return new V(N(this.figures, t.figures));
   }
   intersect(t) {
-    return new B(rt(this.figures, t.figures));
+    return new V(at(this.figures, t.figures));
   }
 }
-function gn(e) {
-  for (const [t, n] of st(e))
+function mn(e) {
+  for (const [t, n] of it(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,
+  p as A,
+  q as B,
+  Pn as C,
+  V as D,
+  tt as E,
   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
+  pn as G,
+  R as H,
+  qt as I,
+  O as L,
+  v as S,
+  C as T,
+  U as a,
+  G as b,
+  N as c,
+  k as d,
+  y as e,
+  W as f,
+  A as g,
+  _ as h,
+  at as i,
+  kt as j,
+  Dt as k,
+  Z as l,
+  d as m,
+  B as n,
+  g as o,
+  Nt as p,
+  Lt as q,
+  Q as r,
+  Mt as s,
+  Y as t,
+  $ as u,
+  dt as v,
+  K as w,
+  F as x,
+  dn as y,
+  L as z
 };
-//# sourceMappingURL=exportJSON-26bb92ef.js.map
+//# sourceMappingURL=Diagram-1c56996e.js.map