@mlightcad/data-model 1.3.11 → 1.3.13

package/dist/data-model.js

@@ -821,7 +821,7 @@ var Go = { exports: {} };
     function f(z) {
       return z === "debug" && (z = "log"), typeof console === e ? !1 : z === "trace" && s ? x : console[z] !== void 0 ? g(console, z) : console.log !== void 0 ? g(console, "log") : t;
     }
-    function A() {
+    function w() {
       for (var z = this.getLevel(), D = 0; D < o.length; D++) {
         var B = o[D];
         this[B] = D < z ? t : this.methodFactory(B, z, this.name);
@@ -831,7 +831,7 @@ var Go = { exports: {} };
     }
     function b(z) {
       return function() {
-        typeof console !== e && (A.call(this), this[z].apply(this, arguments));
+        typeof console !== e && (w.call(this), this[z].apply(this, arguments));
       };
     }
     function E(z, D, B) {
@@ -900,24 +900,24 @@ var Go = { exports: {} };
       }, B.methodFactory = D || E, B.getLevel = function() {
         return ot ?? vt ?? dt;
       }, B.setLevel = function(bt, Ot) {
-        return ot = qt(bt), Ot !== !1 && ut(ot), A.call(B);
+        return ot = qt(bt), Ot !== !1 && ut(ot), w.call(B);
       }, B.setDefaultLevel = function(bt) {
         vt = qt(bt), st() || B.setLevel(bt, !1);
       }, B.resetLevel = function() {
-        ot = null, Vt(), A.call(B);
+        ot = null, Vt(), w.call(B);
       }, B.enableAll = function(bt) {
         B.setLevel(B.levels.TRACE, bt);
       }, B.disableAll = function(bt) {
         B.setLevel(B.levels.SILENT, bt);
       }, B.rebuild = function() {
-        if (c !== B && (dt = qt(c.getLevel())), A.call(B), c === B)
+        if (c !== B && (dt = qt(c.getLevel())), w.call(B), c === B)
           for (var bt in h)
             h[bt].rebuild();
       }, dt = qt(
         c ? c.getLevel() : "WARN"
       );
       var Wt = st();
-      Wt != null && (ot = qt(Wt)), A.call(B);
+      Wt != null && (ot = qt(Wt)), w.call(B);
     }
     c = new M(), c.getLogger = function(z) {
       if (typeof z != "symbol" && typeof z != "string" || z === "")
@@ -928,9 +928,9 @@ var Go = { exports: {} };
         c.methodFactory
       )), D;
     };
-    var O = typeof window !== e ? window.log : void 0;
+    var L = typeof window !== e ? window.log : void 0;
     return c.noConflict = function() {
-      return typeof window !== e && window.log === c && (window.log = O), c;
+      return typeof window !== e && window.log === c && (window.log = L), c;
     }, c.getLoggers = function() {
       return h;
     }, c.default = c, c;
@@ -1048,9 +1048,9 @@ let eu = class Wo {
     typeof t == "object" ? (o = t, s = e) : (o = {}, o[t] = e), s || (s = {});
     const h = s.unset, c = s.silent, g = [], x = this._changing;
     this._changing = !0, x || (this._previousAttributes = Os(this.attributes), this.changed = {});
-    const f = this.attributes, A = this.changed, b = this._previousAttributes;
+    const f = this.attributes, w = this.changed, b = this._previousAttributes;
     for (const E in o)
-      e = o[E], Is(f[E], e) || g.push(E), Is(b[E], e) ? delete A[E] : A[E] = e, h ? delete f[E] : f[E] = e;
+      e = o[E], Is(f[E], e) || g.push(E), Is(b[E], e) ? delete w[E] : w[E] = e, h ? delete f[E] : f[E] = e;
     if (!c) {
       g.length && (this._pending = s);
       for (let E = 0; E < g.length; E++)
@@ -1728,19 +1728,26 @@ class on {
    * ```
    */
   draw(t, e, s, o = !0, h, c) {
+    var x;
     const g = [];
     if (e != null) {
-      const x = this.createKey(e.name, s);
-      let f;
-      if (this.has(x))
-        f = this.get(x);
+      const f = this.createKey(e.name, s);
+      let w;
+      if (this.has(f))
+        w = this.get(f);
       else {
-        const A = e.newIterator();
-        for (const b of A)
-          b.color.isByBlock && s ? (yo.copy(b.color), b.color.color = s, this.addEntity(b, g, t), b.color.copy(yo)) : this.addEntity(b, g, t);
-        f = t.group(g), f && o && this.set(x, f);
+        const b = (x = t.basePoint) == null ? void 0 : x.clone();
+        t.basePoint = void 0;
+        const E = e.newIterator();
+        let M = !0;
+        for (const L of E)
+          if (L.color.isByBlock && s ? (yo.copy(L.color), L.color.color = s, this.addEntity(L, g, t), L.color.copy(yo)) : this.addEntity(L, g, t), M) {
+            const z = g[0];
+            t.basePoint = z.basePoint, M = !1;
+          }
+        w = t.group(g), w && o && this.set(f, w), t.basePoint = b;
       }
-      return f && h && (f.applyMatrix(h), c && (c.x != 0 || c.y != 0 || c.z != 1) && (h.setFromExtrusionDirection(c), f.applyMatrix(h))), f;
+      return w && h && (w.applyMatrix(h), c && (c.x != 0 || c.y != 0 || c.z != 1) && (h.setFromExtrusionDirection(c), w.applyMatrix(h))), w;
     } else
       return t.group(g);
   }
@@ -1975,8 +1982,8 @@ class Zo {
       data: { total: 0 },
       format() {
         let f = "";
-        return Object.keys(this.data).forEach((A) => {
-          A !== "total" && (f += `- ${A}: ${this.data[A]} ms
+        return Object.keys(this.data).forEach((w) => {
+          w !== "total" && (f += `- ${w}: ${this.data[w]} ms
 `);
         }), f += `- total: ${this.data.total} ms`, f;
       }
@@ -2010,8 +2017,8 @@ class Zo {
           step: 5,
           progress: c,
           task: async (f) => {
-            const A = this.getFonts(f.model);
-            return { model: f.model, data: A };
+            const w = this.getFonts(f.model);
+            return { model: f.model, data: w };
           }
         },
         o
@@ -2230,14 +2237,14 @@ let ca = Symbol();
 function xt(i, t) {
   return (e, s, o) => {
     let h = function(x, f = !1) {
-      return x.reduce((A, b) => {
-        b.pushContext && A.push({});
-        let E = A[A.length - 1];
+      return x.reduce((w, b) => {
+        b.pushContext && w.push({});
+        let E = w[w.length - 1];
         for (let M of typeof b.code == "number" ? [b.code] : b.code) {
-          let O = E[M] ?? (E[M] = []);
-          b.isMultiple && O.length && f && console.warn(`Snippet ${O[O.length - 1].name} for code(${M}) is shadowed by ${b.name}`), O.push(b);
+          let L = E[M] ?? (E[M] = []);
+          b.isMultiple && L.length && f && console.warn(`Snippet ${L[L.length - 1].name} for code(${M}) is shadowed by ${b.name}`), L.push(b);
         }
-        return A;
+        return w;
       }, [{}]);
     }(i, s.debug), c = !1, g = h.length - 1;
     for (; !At(e, 0, "EOF"); ) {
@@ -2246,13 +2253,13 @@ function xt(i, t) {
           var W;
           return ot >= dt && ((W = vt[B]) == null ? void 0 : W.length);
         });
-      }(h, e.code, g), f = x == null ? void 0 : x[e.code], A = f == null ? void 0 : f[f.length - 1];
-      if (!x || !A) {
+      }(h, e.code, g), f = x == null ? void 0 : x[e.code], w = f == null ? void 0 : f[f.length - 1];
+      if (!x || !w) {
         s.rewind();
         break;
       }
-      A.isMultiple || x[e.code].pop();
-      let { name: b, parser: E, isMultiple: M, isReducible: O } = A, z = E == null ? void 0 : E(e, s, o);
+      w.isMultiple || x[e.code].pop();
+      let { name: b, parser: E, isMultiple: M, isReducible: L } = w, z = E == null ? void 0 : E(e, s, o);
       if (z === ca) {
         s.rewind();
         break;
@@ -2268,9 +2275,9 @@ function xt(i, t) {
           }
           return [W, Ii(ot[ot.length - 1])];
         }(o, b);
-        M && !O ? (Object.prototype.hasOwnProperty.call(D, B) || (D[B] = []), D[B].push(z)) : D[B] = z;
+        M && !L ? (Object.prototype.hasOwnProperty.call(D, B) || (D[B] = []), D[B].push(z)) : D[B] = z;
       }
-      A.pushContext && (g -= 1), c = !0, e = s.next();
+      w.pushContext && (g -= 1), c = !0, e = s.next();
     }
     return t && Object.setPrototypeOf(o, t), c;
   };
@@ -3113,25 +3120,25 @@ class Ys {
                 x.topBorderVisibility = !!(h.value ?? !0), h = o.next();
                 break;
               case 301:
-                (function(f, A, b) {
+                (function(f, w, b) {
                   for (; b.code !== 304; ) switch (b.code) {
                     case 301:
                     case 93:
                     case 90:
                     case 94:
-                      b = A.next();
+                      b = w.next();
                       break;
                     case 1:
-                      f.text = b.value, b = A.next();
+                      f.text = b.value, b = w.next();
                       break;
                     case 300:
-                      f.attrText = b.value, b = A.next();
+                      f.attrText = b.value, b = w.next();
                       break;
                     case 302:
-                      f.text = b.value ? b.value : f.text, b = A.next();
+                      f.text = b.value ? b.value : f.text, b = w.next();
                       break;
                     default:
-                      console.log(`Ignore code: ${b.code}, value: ${b.value}`), b = A.next();
+                      console.log(`Ignore code: ${b.code}, value: ${b.value}`), b = w.next();
                   }
                 })(x, o, h), h = o.next();
                 break;
@@ -3745,7 +3752,7 @@ class Xc {
    * @param buffer The ArrayBuffer containing DXF file content.
    */
   getDxfInfoFromBuffer(t) {
-    var f, A, b;
+    var f, w, b;
     const s = new TextDecoder("utf-8");
     let o = 0, h = "", c = null, g = null, x = !1;
     for (; o < t.byteLength; ) {
@@ -3760,7 +3767,7 @@ class Xc {
         else if (B === "ENDSEC" && x)
           return { version: c, encoding: g };
         if (x && B === "$ACADVER") {
-          const dt = (A = z[D + 2]) == null ? void 0 : A.trim();
+          const dt = (w = z[D + 2]) == null ? void 0 : w.trim();
           dt && (c = new Li(dt));
         } else if (x && B === "$DWGCODEPAGE") {
           const dt = (b = z[D + 2]) == null ? void 0 : b.trim();
@@ -4670,8 +4677,8 @@ const zi = class mh {
    * @returns Return this matrix
    */
   set(t, e, s, o, h, c, g, x, f) {
-    const A = this.elements;
-    return A[0] = t, A[1] = o, A[2] = g, A[3] = e, A[4] = h, A[5] = x, A[6] = s, A[7] = c, A[8] = f, this;
+    const w = this.elements;
+    return w[0] = t, w[1] = o, w[2] = g, w[3] = e, w[4] = h, w[5] = x, w[6] = s, w[7] = c, w[8] = f, this;
   }
   /**
    * Reset this matrix to the 3x3 identity matrix:
@@ -4731,8 +4738,8 @@ const zi = class mh {
    * @returns Return this matrix
    */
   multiplyMatrices(t, e) {
-    const s = t.elements, o = e.elements, h = this.elements, c = s[0], g = s[3], x = s[6], f = s[1], A = s[4], b = s[7], E = s[2], M = s[5], O = s[8], z = o[0], D = o[3], B = o[6], dt = o[1], vt = o[4], ot = o[7], W = o[2], ut = o[5], st = o[8];
-    return h[0] = c * z + g * dt + x * W, h[3] = c * D + g * vt + x * ut, h[6] = c * B + g * ot + x * st, h[1] = f * z + A * dt + b * W, h[4] = f * D + A * vt + b * ut, h[7] = f * B + A * ot + b * st, h[2] = E * z + M * dt + O * W, h[5] = E * D + M * vt + O * ut, h[8] = E * B + M * ot + O * st, this;
+    const s = t.elements, o = e.elements, h = this.elements, c = s[0], g = s[3], x = s[6], f = s[1], w = s[4], b = s[7], E = s[2], M = s[5], L = s[8], z = o[0], D = o[3], B = o[6], dt = o[1], vt = o[4], ot = o[7], W = o[2], ut = o[5], st = o[8];
+    return h[0] = c * z + g * dt + x * W, h[3] = c * D + g * vt + x * ut, h[6] = c * B + g * ot + x * st, h[1] = f * z + w * dt + b * W, h[4] = f * D + w * vt + b * ut, h[7] = f * B + w * ot + b * st, h[2] = E * z + M * dt + L * W, h[5] = E * D + M * vt + L * ut, h[8] = E * B + M * ot + L * st, this;
   }
   /**
    * Multiply every component of the matrix by the scalar value s.
@@ -4748,8 +4755,8 @@ const zi = class mh {
    * @returns Return the determinant of this matrix
    */
   determinant() {
-    const t = this.elements, e = t[0], s = t[1], o = t[2], h = t[3], c = t[4], g = t[5], x = t[6], f = t[7], A = t[8];
-    return e * c * A - e * g * f - s * h * A + s * g * x + o * h * f - o * c * x;
+    const t = this.elements, e = t[0], s = t[1], o = t[2], h = t[3], c = t[4], g = t[5], x = t[6], f = t[7], w = t[8];
+    return e * c * w - e * g * f - s * h * w + s * g * x + o * h * f - o * c * x;
   }
   /**
    * Invert this matrix, using the analytic method. You can not invert with a determinant of zero.
@@ -4757,10 +4764,10 @@ const zi = class mh {
    * @returns Return this matrix
    */
   invert() {
-    const t = this.elements, e = t[0], s = t[1], o = t[2], h = t[3], c = t[4], g = t[5], x = t[6], f = t[7], A = t[8], b = A * c - g * f, E = g * x - A * h, M = f * h - c * x, O = e * b + s * E + o * M;
-    if (O === 0) return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0);
-    const z = 1 / O;
-    return t[0] = b * z, t[1] = (o * f - A * s) * z, t[2] = (g * s - o * c) * z, t[3] = E * z, t[4] = (A * e - o * x) * z, t[5] = (o * h - g * e) * z, t[6] = M * z, t[7] = (s * x - f * e) * z, t[8] = (c * e - s * h) * z, this;
+    const t = this.elements, e = t[0], s = t[1], o = t[2], h = t[3], c = t[4], g = t[5], x = t[6], f = t[7], w = t[8], b = w * c - g * f, E = g * x - w * h, M = f * h - c * x, L = e * b + s * E + o * M;
+    if (L === 0) return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0);
+    const z = 1 / L;
+    return t[0] = b * z, t[1] = (o * f - w * s) * z, t[2] = (g * s - o * c) * z, t[3] = E * z, t[4] = (w * e - o * x) * z, t[5] = (o * h - g * e) * z, t[6] = M * z, t[7] = (s * x - f * e) * z, t[8] = (c * e - s * h) * z, this;
   }
   /**
    * Transpose this matrix in place.
@@ -4993,9 +5000,9 @@ function _h(i, t, e = !1) {
   let h = !1;
   const c = t.length;
   for (let g = 0, x = c - 1; g < c; x = g++) {
-    const f = t[g].x, A = t[g].y, b = t[x].x, E = t[x].y;
-    let M = A > o != E > o;
-    e && (M = A >= o != E >= o), M && s < (b - f) * (o - A) / (E - A) + f && (h = !h);
+    const f = t[g].x, w = t[g].y, b = t[x].x, E = t[x].y;
+    let M = w > o != E > o;
+    e && (M = w >= o != E >= o), M && s < (b - f) * (o - w) / (E - w) + f && (h = !h);
   }
   return h;
 }
@@ -5030,7 +5037,7 @@ function _d(i, t) {
   const e = t.length - 1, s = i, o = [0];
   let h = 0;
   for (let g = 1; g <= e; g++) {
-    const x = t[g][0] - t[g - 1][0], f = t[g][1] - t[g - 1][1], A = t[g][2] - t[g - 1][2], b = Math.sqrt(x * x + f * f + A * A);
+    const x = t[g][0] - t[g - 1][0], f = t[g][1] - t[g - 1][1], w = t[g][2] - t[g - 1][2], b = Math.sqrt(x * x + f * f + w * w);
     h += b, o.push(h);
   }
   const c = [];
@@ -5048,7 +5055,7 @@ function vd(i, t) {
   const e = t.length - 1, s = i, o = [0];
   let h = 0;
   for (let g = 1; g <= e; g++) {
-    const x = t[g][0] - t[g - 1][0], f = t[g][1] - t[g - 1][1], A = t[g][2] - t[g - 1][2], b = Math.sqrt(x * x + f * f + A * A), E = Math.sqrt(b);
+    const x = t[g][0] - t[g - 1][0], f = t[g][1] - t[g - 1][1], w = t[g][2] - t[g - 1][2], b = Math.sqrt(x * x + f * f + w * w), E = Math.sqrt(b);
     h += E, o.push(h);
   }
   const c = [];
@@ -5077,7 +5084,7 @@ function Ks(i, t, e, s, o) {
   const g = [0, 0, 0];
   let x = 0;
   for (let f = 0; f <= h; f++) {
-    const A = Ri(f, c, i, e), b = o[f] * A;
+    const w = Ri(f, c, i, e), b = o[f] * w;
     g[0] += s[f][0] * b, g[1] += s[f][1] * b, g[2] += s[f][2] * b, x += b;
   }
   if (x < 1e-10) {
@@ -5093,7 +5100,7 @@ function yd(i, t, e, s) {
   const o = i, h = t[o], c = t[t.length - o - 1];
   let g = 0;
   const x = 1e3, f = (c - h) / x;
-  let A = Ks(
+  let w = Ks(
     h,
     i,
     t,
@@ -5101,8 +5108,8 @@ function yd(i, t, e, s) {
     s
   );
   for (let z = 1; z <= x; z++) {
-    const D = h + z * f, B = Ks(D, i, t, e, s), dt = B[0] - A[0], vt = B[1] - A[1], ot = B[2] - A[2];
-    g += Math.sqrt(dt * dt + vt * vt + ot * ot), A = B;
+    const D = h + z * f, B = Ks(D, i, t, e, s), dt = B[0] - w[0], vt = B[1] - w[1], ot = B[2] - w[2];
+    g += Math.sqrt(dt * dt + vt * vt + ot * ot), w = B;
   }
   const b = Ks(
     c,
@@ -5110,8 +5117,8 @@ function yd(i, t, e, s) {
     t,
     e,
     s
-  ), E = b[0] - A[0], M = b[1] - A[1], O = b[2] - A[2];
-  return g += Math.sqrt(E * E + M * M + O * O), g;
+  ), E = b[0] - w[0], M = b[1] - w[1], L = b[2] - w[2];
+  return g += Math.sqrt(E * E + M * M + L * L), g;
 }
 function I0(i) {
   return i.map((t) => [...t]);
@@ -5138,30 +5145,30 @@ class un {
    * @param t Input normalized interpolation factor (between 0 and 1).
    */
   static slerpFlat(t, e, s, o, h, c, g) {
-    let x = s[o + 0], f = s[o + 1], A = s[o + 2], b = s[o + 3];
-    const E = h[c + 0], M = h[c + 1], O = h[c + 2], z = h[c + 3];
+    let x = s[o + 0], f = s[o + 1], w = s[o + 2], b = s[o + 3];
+    const E = h[c + 0], M = h[c + 1], L = h[c + 2], z = h[c + 3];
     if (g === 0) {
-      t[e + 0] = x, t[e + 1] = f, t[e + 2] = A, t[e + 3] = b;
+      t[e + 0] = x, t[e + 1] = f, t[e + 2] = w, t[e + 3] = b;
       return;
     }
     if (g === 1) {
-      t[e + 0] = E, t[e + 1] = M, t[e + 2] = O, t[e + 3] = z;
+      t[e + 0] = E, t[e + 1] = M, t[e + 2] = L, t[e + 3] = z;
       return;
     }
-    if (b !== z || x !== E || f !== M || A !== O) {
+    if (b !== z || x !== E || f !== M || w !== L) {
       let D = 1 - g;
-      const B = x * E + f * M + A * O + b * z, dt = B >= 0 ? 1 : -1, vt = 1 - B * B;
+      const B = x * E + f * M + w * L + b * z, dt = B >= 0 ? 1 : -1, vt = 1 - B * B;
       if (vt > Number.EPSILON) {
         const W = Math.sqrt(vt), ut = Math.atan2(W, B * dt);
         D = Math.sin(D * ut) / W, g = Math.sin(g * ut) / W;
       }
       const ot = g * dt;
-      if (x = x * D + E * ot, f = f * D + M * ot, A = A * D + O * ot, b = b * D + z * ot, D === 1 - g) {
-        const W = 1 / Math.sqrt(x * x + f * f + A * A + b * b);
-        x *= W, f *= W, A *= W, b *= W;
+      if (x = x * D + E * ot, f = f * D + M * ot, w = w * D + L * ot, b = b * D + z * ot, D === 1 - g) {
+        const W = 1 / Math.sqrt(x * x + f * f + w * w + b * b);
+        x *= W, f *= W, w *= W, b *= W;
       }
     }
-    t[e] = x, t[e + 1] = f, t[e + 2] = A, t[e + 3] = b;
+    t[e] = x, t[e + 1] = f, t[e + 2] = w, t[e + 3] = b;
   }
   /**
    * This multiplication implementation assumes the quaternion data are managed in flat arrays.
@@ -5174,8 +5181,8 @@ class un {
    * @returns Return an array
    */
   static multiplyQuaternionsFlat(t, e, s, o, h, c) {
-    const g = s[o], x = s[o + 1], f = s[o + 2], A = s[o + 3], b = h[c], E = h[c + 1], M = h[c + 2], O = h[c + 3];
-    return t[e] = g * O + A * b + x * M - f * E, t[e + 1] = x * O + A * E + f * b - g * M, t[e + 2] = f * O + A * M + g * E - x * b, t[e + 3] = A * O - g * b - x * E - f * M, t;
+    const g = s[o], x = s[o + 1], f = s[o + 2], w = s[o + 3], b = h[c], E = h[c + 1], M = h[c + 2], L = h[c + 3];
+    return t[e] = g * L + w * b + x * M - f * E, t[e + 1] = x * L + w * E + f * b - g * M, t[e + 2] = f * L + w * M + g * E - x * b, t[e + 3] = w * L - g * b - x * E - f * M, t;
   }
   /**
    * X cooridinate
@@ -5246,25 +5253,25 @@ class un {
    * @returns Return this quaternion
    */
   setFromEuler(t, e = !0) {
-    const s = t.x, o = t.y, h = t.z, c = t.order, g = Math.cos, x = Math.sin, f = g(s / 2), A = g(o / 2), b = g(h / 2), E = x(s / 2), M = x(o / 2), O = x(h / 2);
+    const s = t.x, o = t.y, h = t.z, c = t.order, g = Math.cos, x = Math.sin, f = g(s / 2), w = g(o / 2), b = g(h / 2), E = x(s / 2), M = x(o / 2), L = x(h / 2);
     switch (c) {
       case "XYZ":
-        this._x = E * A * b + f * M * O, this._y = f * M * b - E * A * O, this._z = f * A * O + E * M * b, this._w = f * A * b - E * M * O;
+        this._x = E * w * b + f * M * L, this._y = f * M * b - E * w * L, this._z = f * w * L + E * M * b, this._w = f * w * b - E * M * L;
         break;
       case "YXZ":
-        this._x = E * A * b + f * M * O, this._y = f * M * b - E * A * O, this._z = f * A * O - E * M * b, this._w = f * A * b + E * M * O;
+        this._x = E * w * b + f * M * L, this._y = f * M * b - E * w * L, this._z = f * w * L - E * M * b, this._w = f * w * b + E * M * L;
         break;
       case "ZXY":
-        this._x = E * A * b - f * M * O, this._y = f * M * b + E * A * O, this._z = f * A * O + E * M * b, this._w = f * A * b - E * M * O;
+        this._x = E * w * b - f * M * L, this._y = f * M * b + E * w * L, this._z = f * w * L + E * M * b, this._w = f * w * b - E * M * L;
         break;
       case "ZYX":
-        this._x = E * A * b - f * M * O, this._y = f * M * b + E * A * O, this._z = f * A * O - E * M * b, this._w = f * A * b + E * M * O;
+        this._x = E * w * b - f * M * L, this._y = f * M * b + E * w * L, this._z = f * w * L - E * M * b, this._w = f * w * b + E * M * L;
         break;
       case "YZX":
-        this._x = E * A * b + f * M * O, this._y = f * M * b + E * A * O, this._z = f * A * O - E * M * b, this._w = f * A * b - E * M * O;
+        this._x = E * w * b + f * M * L, this._y = f * M * b + E * w * L, this._z = f * w * L - E * M * b, this._w = f * w * b - E * M * L;
         break;
       case "XZY":
-        this._x = E * A * b - f * M * O, this._y = f * M * b - E * A * O, this._z = f * A * O + E * M * b, this._w = f * A * b + E * M * O;
+        this._x = E * w * b - f * M * L, this._y = f * M * b - E * w * L, this._z = f * w * L + E * M * b, this._w = f * w * b + E * M * L;
         break;
       default:
         console.warn(
@@ -5290,19 +5297,19 @@ class un {
    * @returns Return this quaternion
    */
   setFromRotationMatrix(t) {
-    const e = t.elements, s = e[0], o = e[4], h = e[8], c = e[1], g = e[5], x = e[9], f = e[2], A = e[6], b = e[10], E = s + g + b;
+    const e = t.elements, s = e[0], o = e[4], h = e[8], c = e[1], g = e[5], x = e[9], f = e[2], w = e[6], b = e[10], E = s + g + b;
     if (E > 0) {
       const M = 0.5 / Math.sqrt(E + 1);
-      this._w = 0.25 / M, this._x = (A - x) * M, this._y = (h - f) * M, this._z = (c - o) * M;
+      this._w = 0.25 / M, this._x = (w - x) * M, this._y = (h - f) * M, this._z = (c - o) * M;
     } else if (s > g && s > b) {
       const M = 2 * Math.sqrt(1 + s - g - b);
-      this._w = (A - x) / M, this._x = 0.25 * M, this._y = (o + c) / M, this._z = (h + f) / M;
+      this._w = (w - x) / M, this._x = 0.25 * M, this._y = (o + c) / M, this._z = (h + f) / M;
     } else if (g > b) {
       const M = 2 * Math.sqrt(1 + g - s - b);
-      this._w = (h - f) / M, this._x = (o + c) / M, this._y = 0.25 * M, this._z = (x + A) / M;
+      this._w = (h - f) / M, this._x = (o + c) / M, this._y = 0.25 * M, this._z = (x + w) / M;
     } else {
       const M = 2 * Math.sqrt(1 + b - s - g);
-      this._w = (c - o) / M, this._x = (h + f) / M, this._y = (x + A) / M, this._z = 0.25 * M;
+      this._w = (c - o) / M, this._x = (h + f) / M, this._y = (x + w) / M, this._z = 0.25 * M;
     }
     return this._onChangeCallback(), this;
   }
@@ -5419,8 +5426,8 @@ class un {
    * @returns Return this quaternion
    */
   multiplyQuaternions(t, e) {
-    const s = t._x, o = t._y, h = t._z, c = t._w, g = e._x, x = e._y, f = e._z, A = e._w;
-    return this._x = s * A + c * g + o * f - h * x, this._y = o * A + c * x + h * g - s * f, this._z = h * A + c * f + s * x - o * g, this._w = c * A - s * g - o * x - h * f, this._onChangeCallback(), this;
+    const s = t._x, o = t._y, h = t._z, c = t._w, g = e._x, x = e._y, f = e._z, w = e._w;
+    return this._x = s * w + c * g + o * f - h * x, this._y = o * w + c * x + h * g - s * f, this._z = h * w + c * f + s * x - o * g, this._w = c * w - s * g - o * x - h * f, this._onChangeCallback(), this;
   }
   /**
    * Handles the spherical linear interpolation between quaternions. t represents the amount of rotation
@@ -5441,7 +5448,7 @@ class un {
       const M = 1 - e;
       return this._w = M * c + e * this._w, this._x = M * s + e * this._x, this._y = M * o + e * this._y, this._z = M * h + e * this._z, this.normalize(), this;
     }
-    const f = Math.sqrt(x), A = Math.atan2(f, g), b = Math.sin((1 - e) * A) / f, E = Math.sin(e * A) / f;
+    const f = Math.sqrt(x), w = Math.atan2(f, g), b = Math.sin((1 - e) * w) / f, E = Math.sin(e * w) / f;
     return this._w = c * b + this._w * E, this._x = s * b + this._x * E, this._y = o * b + this._y * E, this._z = h * b + this._z * E, this._onChangeCallback(), this;
   }
   /**
@@ -5767,8 +5774,8 @@ const Ve = class vh {
    * @returns Return this vector
    */
   applyQuaternion(t) {
-    const e = this.x, s = this.y, o = this.z, h = t.x, c = t.y, g = t.z, x = t.w, f = 2 * (c * o - g * s), A = 2 * (g * e - h * o), b = 2 * (h * s - c * e);
-    return this.x = e + x * f + c * b - g * A, this.y = s + x * A + g * f - h * b, this.z = o + x * b + h * A - c * f, this;
+    const e = this.x, s = this.y, o = this.z, h = t.x, c = t.y, g = t.z, x = t.w, f = 2 * (c * o - g * s), w = 2 * (g * e - h * o), b = 2 * (h * s - c * e);
+    return this.x = e + x * f + c * b - g * w, this.y = s + x * w + g * f - h * b, this.z = o + x * b + h * w - c * f, this;
   }
   /**
    * Transforms the direction of this vector by a matrix (the upper left 3 x 3 subset of a m) and
@@ -6173,8 +6180,8 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
    * @param n43 Input element in the forth row and the third column
    * @param n44 Input element in the forth row and the forth column
    */
-  constructor(t, e, s, o, h, c, g, x, f, A, b, E, M, O, z, D) {
-    this.elements = [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1], t != null && e != null && s != null && o != null && h != null && c != null && g != null && x != null && f != null && A != null && b != null && E != null && M != null && O != null && z != null && D != null && this.set(
+  constructor(t, e, s, o, h, c, g, x, f, w, b, E, M, L, z, D) {
+    this.elements = [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1], t != null && e != null && s != null && o != null && h != null && c != null && g != null && x != null && f != null && w != null && b != null && E != null && M != null && L != null && z != null && D != null && this.set(
       t,
       e,
       s,
@@ -6184,11 +6191,11 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
       g,
       x,
       f,
-      A,
+      w,
       b,
       E,
       M,
-      O,
+      L,
       z,
       D
     );
@@ -6214,9 +6221,9 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
    * @param n44 Input element in the forth row and the forth column
    * @returns Return this matrix
    */
-  set(t, e, s, o, h, c, g, x, f, A, b, E, M, O, z, D) {
+  set(t, e, s, o, h, c, g, x, f, w, b, E, M, L, z, D) {
     const B = this.elements;
-    return B[0] = t, B[4] = e, B[8] = s, B[12] = o, B[1] = h, B[5] = c, B[9] = g, B[13] = x, B[2] = f, B[6] = A, B[10] = b, B[14] = E, B[3] = M, B[7] = O, B[11] = z, B[15] = D, this;
+    return B[0] = t, B[4] = e, B[8] = s, B[12] = o, B[1] = h, B[5] = c, B[9] = g, B[13] = x, B[2] = f, B[6] = w, B[10] = b, B[14] = E, B[3] = M, B[7] = L, B[11] = z, B[15] = D, this;
   }
   /**
    * Reset this matrix to the identity matrix.
@@ -6500,8 +6507,8 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
    * @returns Return this matrix
    */
   multiplyMatrices(t, e) {
-    const s = t.elements, o = e.elements, h = this.elements, c = s[0], g = s[4], x = s[8], f = s[12], A = s[1], b = s[5], E = s[9], M = s[13], O = s[2], z = s[6], D = s[10], B = s[14], dt = s[3], vt = s[7], ot = s[11], W = s[15], ut = o[0], st = o[4], Vt = o[8], qt = o[12], Wt = o[1], bt = o[5], Ot = o[9], de = o[13], me = o[2], Me = o[6], Jt = o[10], ie = o[14], Q = o[3], Mt = o[7], ae = o[11], hr = o[15];
-    return h[0] = c * ut + g * Wt + x * me + f * Q, h[4] = c * st + g * bt + x * Me + f * Mt, h[8] = c * Vt + g * Ot + x * Jt + f * ae, h[12] = c * qt + g * de + x * ie + f * hr, h[1] = A * ut + b * Wt + E * me + M * Q, h[5] = A * st + b * bt + E * Me + M * Mt, h[9] = A * Vt + b * Ot + E * Jt + M * ae, h[13] = A * qt + b * de + E * ie + M * hr, h[2] = O * ut + z * Wt + D * me + B * Q, h[6] = O * st + z * bt + D * Me + B * Mt, h[10] = O * Vt + z * Ot + D * Jt + B * ae, h[14] = O * qt + z * de + D * ie + B * hr, h[3] = dt * ut + vt * Wt + ot * me + W * Q, h[7] = dt * st + vt * bt + ot * Me + W * Mt, h[11] = dt * Vt + vt * Ot + ot * Jt + W * ae, h[15] = dt * qt + vt * de + ot * ie + W * hr, this;
+    const s = t.elements, o = e.elements, h = this.elements, c = s[0], g = s[4], x = s[8], f = s[12], w = s[1], b = s[5], E = s[9], M = s[13], L = s[2], z = s[6], D = s[10], B = s[14], dt = s[3], vt = s[7], ot = s[11], W = s[15], ut = o[0], st = o[4], Vt = o[8], qt = o[12], Wt = o[1], bt = o[5], Ot = o[9], de = o[13], me = o[2], Me = o[6], Jt = o[10], ie = o[14], Q = o[3], Mt = o[7], ae = o[11], hr = o[15];
+    return h[0] = c * ut + g * Wt + x * me + f * Q, h[4] = c * st + g * bt + x * Me + f * Mt, h[8] = c * Vt + g * Ot + x * Jt + f * ae, h[12] = c * qt + g * de + x * ie + f * hr, h[1] = w * ut + b * Wt + E * me + M * Q, h[5] = w * st + b * bt + E * Me + M * Mt, h[9] = w * Vt + b * Ot + E * Jt + M * ae, h[13] = w * qt + b * de + E * ie + M * hr, h[2] = L * ut + z * Wt + D * me + B * Q, h[6] = L * st + z * bt + D * Me + B * Mt, h[10] = L * Vt + z * Ot + D * Jt + B * ae, h[14] = L * qt + z * de + D * ie + B * hr, h[3] = dt * ut + vt * Wt + ot * me + W * Q, h[7] = dt * st + vt * bt + ot * Me + W * Mt, h[11] = dt * Vt + vt * Ot + ot * Jt + W * ae, h[15] = dt * qt + vt * de + ot * ie + W * hr, this;
   }
   /**
    * Multiply every component of the matrix by a scalar value s.
@@ -6517,8 +6524,8 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
    * @returns Return the determinant of this matrix.
    */
   determinant() {
-    const t = this.elements, e = t[0], s = t[4], o = t[8], h = t[12], c = t[1], g = t[5], x = t[9], f = t[13], A = t[2], b = t[6], E = t[10], M = t[14], O = t[3], z = t[7], D = t[11], B = t[15];
-    return O * (+h * x * b - o * f * b - h * g * E + s * f * E + o * g * M - s * x * M) + z * (+e * x * M - e * f * E + h * c * E - o * c * M + o * f * A - h * x * A) + D * (+e * f * b - e * g * M - h * c * b + s * c * M + h * g * A - s * f * A) + B * (-o * g * A - e * x * b + e * g * E + o * c * b - s * c * E + s * x * A);
+    const t = this.elements, e = t[0], s = t[4], o = t[8], h = t[12], c = t[1], g = t[5], x = t[9], f = t[13], w = t[2], b = t[6], E = t[10], M = t[14], L = t[3], z = t[7], D = t[11], B = t[15];
+    return L * (+h * x * b - o * f * b - h * g * E + s * f * E + o * g * M - s * x * M) + z * (+e * x * M - e * f * E + h * c * E - o * c * M + o * f * w - h * x * w) + D * (+e * f * b - e * g * M - h * c * b + s * c * M + h * g * w - s * f * w) + B * (-o * g * w - e * x * b + e * g * E + o * c * b - s * c * E + s * x * w);
   }
   /**
    * Transposes this matrix.
@@ -6546,11 +6553,11 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
    * @returns Return this matrix
    */
   invert() {
-    const t = this.elements, e = t[0], s = t[1], o = t[2], h = t[3], c = t[4], g = t[5], x = t[6], f = t[7], A = t[8], b = t[9], E = t[10], M = t[11], O = t[12], z = t[13], D = t[14], B = t[15], dt = b * D * f - z * E * f + z * x * M - g * D * M - b * x * B + g * E * B, vt = O * E * f - A * D * f - O * x * M + c * D * M + A * x * B - c * E * B, ot = A * z * f - O * b * f + O * g * M - c * z * M - A * g * B + c * b * B, W = O * b * x - A * z * x - O * g * E + c * z * E + A * g * D - c * b * D, ut = e * dt + s * vt + o * ot + h * W;
+    const t = this.elements, e = t[0], s = t[1], o = t[2], h = t[3], c = t[4], g = t[5], x = t[6], f = t[7], w = t[8], b = t[9], E = t[10], M = t[11], L = t[12], z = t[13], D = t[14], B = t[15], dt = b * D * f - z * E * f + z * x * M - g * D * M - b * x * B + g * E * B, vt = L * E * f - w * D * f - L * x * M + c * D * M + w * x * B - c * E * B, ot = w * z * f - L * b * f + L * g * M - c * z * M - w * g * B + c * b * B, W = L * b * x - w * z * x - L * g * E + c * z * E + w * g * D - c * b * D, ut = e * dt + s * vt + o * ot + h * W;
     if (ut === 0)
       return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
     const st = 1 / ut;
-    return t[0] = dt * st, t[1] = (z * E * h - b * D * h - z * o * M + s * D * M + b * o * B - s * E * B) * st, t[2] = (g * D * h - z * x * h + z * o * f - s * D * f - g * o * B + s * x * B) * st, t[3] = (b * x * h - g * E * h - b * o * f + s * E * f + g * o * M - s * x * M) * st, t[4] = vt * st, t[5] = (A * D * h - O * E * h + O * o * M - e * D * M - A * o * B + e * E * B) * st, t[6] = (O * x * h - c * D * h - O * o * f + e * D * f + c * o * B - e * x * B) * st, t[7] = (c * E * h - A * x * h + A * o * f - e * E * f - c * o * M + e * x * M) * st, t[8] = ot * st, t[9] = (O * b * h - A * z * h - O * s * M + e * z * M + A * s * B - e * b * B) * st, t[10] = (c * z * h - O * g * h + O * s * f - e * z * f - c * s * B + e * g * B) * st, t[11] = (A * g * h - c * b * h - A * s * f + e * b * f + c * s * M - e * g * M) * st, t[12] = W * st, t[13] = (A * z * o - O * b * o + O * s * E - e * z * E - A * s * D + e * b * D) * st, t[14] = (O * g * o - c * z * o - O * s * x + e * z * x + c * s * D - e * g * D) * st, t[15] = (c * b * o - A * g * o + A * s * x - e * b * x - c * s * E + e * g * E) * st, this;
+    return t[0] = dt * st, t[1] = (z * E * h - b * D * h - z * o * M + s * D * M + b * o * B - s * E * B) * st, t[2] = (g * D * h - z * x * h + z * o * f - s * D * f - g * o * B + s * x * B) * st, t[3] = (b * x * h - g * E * h - b * o * f + s * E * f + g * o * M - s * x * M) * st, t[4] = vt * st, t[5] = (w * D * h - L * E * h + L * o * M - e * D * M - w * o * B + e * E * B) * st, t[6] = (L * x * h - c * D * h - L * o * f + e * D * f + c * o * B - e * x * B) * st, t[7] = (c * E * h - w * x * h + w * o * f - e * E * f - c * o * M + e * x * M) * st, t[8] = ot * st, t[9] = (L * b * h - w * z * h - L * s * M + e * z * M + w * s * B - e * b * B) * st, t[10] = (c * z * h - L * g * h + L * s * f - e * z * f - c * s * B + e * g * B) * st, t[11] = (w * g * h - c * b * h - w * s * f + e * b * f + c * s * M - e * g * M) * st, t[12] = W * st, t[13] = (w * z * o - L * b * o + L * s * E - e * z * E - w * s * D + e * b * D) * st, t[14] = (L * g * o - c * z * o - L * s * x + e * z * x + c * s * D - e * g * D) * st, t[15] = (c * b * o - w * g * o + w * s * x - e * b * x - c * s * E + e * g * E) * st, this;
   }
   /**
    * Multiply the columns of this matrix by vector v.
@@ -6613,18 +6620,18 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
    * @returns Return this matrix
    */
   makeRotationAxis(t, e) {
-    const s = Math.cos(e), o = Math.sin(e), h = 1 - s, c = t.x, g = t.y, x = t.z, f = h * c, A = h * g;
+    const s = Math.cos(e), o = Math.sin(e), h = 1 - s, c = t.x, g = t.y, x = t.z, f = h * c, w = h * g;
     return this.set(
       f * c + s,
       f * g - o * x,
       f * x + o * g,
       0,
       f * g + o * x,
-      A * g + s,
-      A * x - o * c,
+      w * g + s,
+      w * x - o * c,
       0,
       f * x - o * g,
-      A * x + o * c,
+      w * x + o * c,
       h * x * x + s,
       0,
       0,
@@ -6664,8 +6671,8 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
    * @returns Return this matrix
    */
   compose(t, e, s) {
-    const o = this.elements, h = e.x, c = e.y, g = e.z, x = e.w, f = h + h, A = c + c, b = g + g, E = h * f, M = h * A, O = h * b, z = c * A, D = c * b, B = g * b, dt = x * f, vt = x * A, ot = x * b, W = s.x, ut = s.y, st = s.z;
-    return o[0] = (1 - (z + B)) * W, o[1] = (M + ot) * W, o[2] = (O - vt) * W, o[3] = 0, o[4] = (M - ot) * ut, o[5] = (1 - (E + B)) * ut, o[6] = (D + dt) * ut, o[7] = 0, o[8] = (O + vt) * st, o[9] = (D - dt) * st, o[10] = (1 - (E + z)) * st, o[11] = 0, o[12] = t.x, o[13] = t.y, o[14] = t.z, o[15] = 1, this;
+    const o = this.elements, h = e.x, c = e.y, g = e.z, x = e.w, f = h + h, w = c + c, b = g + g, E = h * f, M = h * w, L = h * b, z = c * w, D = c * b, B = g * b, dt = x * f, vt = x * w, ot = x * b, W = s.x, ut = s.y, st = s.z;
+    return o[0] = (1 - (z + B)) * W, o[1] = (M + ot) * W, o[2] = (L - vt) * W, o[3] = 0, o[4] = (M - ot) * ut, o[5] = (1 - (E + B)) * ut, o[6] = (D + dt) * ut, o[7] = 0, o[8] = (L + vt) * st, o[9] = (D - dt) * st, o[10] = (1 - (E + z)) * st, o[11] = 0, o[12] = t.x, o[13] = t.y, o[14] = t.z, o[15] = 1, this;
   }
   /**
    * Decompose this matrix into its position, quaternion and scale components.
@@ -6683,8 +6690,8 @@ const Ei = /* @__PURE__ */ new Z(), Eo = /* @__PURE__ */ new un(), Fi = class yh
     let h = Tn.set(o[0], o[1], o[2]).length();
     const c = Tn.set(o[4], o[5], o[6]).length(), g = Tn.set(o[8], o[9], o[10]).length();
     this.determinant() < 0 && (h = -h), t.x = o[12], t.y = o[13], t.z = o[14], nr.copy(this);
-    const x = 1 / h, f = 1 / c, A = 1 / g;
-    return nr.elements[0] *= x, nr.elements[1] *= x, nr.elements[2] *= x, nr.elements[4] *= f, nr.elements[5] *= f, nr.elements[6] *= f, nr.elements[8] *= A, nr.elements[9] *= A, nr.elements[10] *= A, e.setFromRotationMatrix(nr), s.x = h, s.y = c, s.z = g, this;
+    const x = 1 / h, f = 1 / c, w = 1 / g;
+    return nr.elements[0] *= x, nr.elements[1] *= x, nr.elements[2] *= x, nr.elements[4] *= f, nr.elements[5] *= f, nr.elements[6] *= f, nr.elements[8] *= w, nr.elements[9] *= w, nr.elements[10] *= w, e.setFromRotationMatrix(nr), s.x = h, s.y = c, s.z = g, this;
   }
   // makePerspective(
   //   left,
@@ -7586,13 +7593,13 @@ const To = /* @__PURE__ */ new cn(), No = /* @__PURE__ */ new un(), xh = class B
    * @returns Return this euler
    */
   setFromRotationMatrix(t, e = this._order, s = !0) {
-    const o = t.elements, h = o[0], c = o[4], g = o[8], x = o[1], f = o[5], A = o[9], b = o[2], E = o[6], M = o[10];
+    const o = t.elements, h = o[0], c = o[4], g = o[8], x = o[1], f = o[5], w = o[9], b = o[2], E = o[6], M = o[10];
     switch (e) {
       case "XYZ":
-        this._y = Math.asin(Vr(g, -1, 1)), Math.abs(g) < 0.9999999 ? (this._x = Math.atan2(-A, M), this._z = Math.atan2(-c, h)) : (this._x = Math.atan2(E, f), this._z = 0);
+        this._y = Math.asin(Vr(g, -1, 1)), Math.abs(g) < 0.9999999 ? (this._x = Math.atan2(-w, M), this._z = Math.atan2(-c, h)) : (this._x = Math.atan2(E, f), this._z = 0);
         break;
       case "YXZ":
-        this._x = Math.asin(-Vr(A, -1, 1)), Math.abs(A) < 0.9999999 ? (this._y = Math.atan2(g, M), this._z = Math.atan2(x, f)) : (this._y = Math.atan2(-b, h), this._z = 0);
+        this._x = Math.asin(-Vr(w, -1, 1)), Math.abs(w) < 0.9999999 ? (this._y = Math.atan2(g, M), this._z = Math.atan2(x, f)) : (this._y = Math.atan2(-b, h), this._z = 0);
         break;
       case "ZXY":
         this._x = Math.asin(Vr(E, -1, 1)), Math.abs(E) < 0.9999999 ? (this._y = Math.atan2(-b, M), this._z = Math.atan2(-c, f)) : (this._y = 0, this._z = Math.atan2(x, h));
@@ -7601,10 +7608,10 @@ const To = /* @__PURE__ */ new cn(), No = /* @__PURE__ */ new un(), xh = class B
         this._y = Math.asin(-Vr(b, -1, 1)), Math.abs(b) < 0.9999999 ? (this._x = Math.atan2(E, M), this._z = Math.atan2(x, h)) : (this._x = 0, this._z = Math.atan2(-c, f));
         break;
       case "YZX":
-        this._z = Math.asin(Vr(x, -1, 1)), Math.abs(x) < 0.9999999 ? (this._x = Math.atan2(-A, f), this._y = Math.atan2(-b, h)) : (this._x = 0, this._y = Math.atan2(g, M));
+        this._z = Math.asin(Vr(x, -1, 1)), Math.abs(x) < 0.9999999 ? (this._x = Math.atan2(-w, f), this._y = Math.atan2(-b, h)) : (this._x = 0, this._y = Math.atan2(g, M));
         break;
       case "XZY":
-        this._z = Math.asin(-Vr(c, -1, 1)), Math.abs(c) < 0.9999999 ? (this._x = Math.atan2(E, f), this._y = Math.atan2(g, h)) : (this._x = Math.atan2(-A, M), this._y = 0);
+        this._z = Math.asin(-Vr(c, -1, 1)), Math.abs(c) < 0.9999999 ? (this._x = Math.atan2(E, f), this._y = Math.atan2(g, h)) : (this._x = Math.atan2(-w, M), this._y = 0);
         break;
       default:
         console.warn(
@@ -7780,13 +7787,13 @@ class fa extends wh {
       });
     const g = { index: -1, children: [] };
     for (let x = 0; x < c; x++) {
-      const f = o[x], A = e[f], b = s[f];
+      const f = o[x], w = e[f], b = s[f];
       let E = x + 1;
       for (; E < c; E++) {
-        const M = o[E], O = e[M];
+        const M = o[E], L = e[M];
         if (s[M].containsBox(b) && gd.isPointInPolygon(
-          A[kt.randInt(0, A.length - 1)],
-          O
+          w[kt.randInt(0, w.length - 1)],
+          L
         )) {
           (t = h.get(M)) == null || t.children.push(h.get(f));
           break;
@@ -7933,7 +7940,7 @@ class Ms extends wh {
       }
     if (o = x, s[o] === c)
       return o / (h - 1);
-    const A = s[o], b = s[o + 1] - A, E = (c - A) / b;
+    const w = s[o], b = s[o + 1] - w, E = (c - w) / b;
     return (o + E) / (h - 1);
   }
   /**
@@ -7991,10 +7998,10 @@ class Ps extends Ms {
     const o = (st, Vt) => ({
       x: (st.x + Vt.x) / 2,
       y: (st.y + Vt.y) / 2
-    }), h = (st, Vt) => (Vt.y - st.y) / (Vt.x - st.x), c = (st) => -1 / st, g = o(t, e), x = o(e, s), f = h(t, e), A = h(e, s), b = c(f), E = c(A), M = (st, Vt, qt, Wt) => {
+    }), h = (st, Vt) => (Vt.y - st.y) / (Vt.x - st.x), c = (st) => -1 / st, g = o(t, e), x = o(e, s), f = h(t, e), w = h(e, s), b = c(f), E = c(w), M = (st, Vt, qt, Wt) => {
       const bt = (Wt - Vt) / (st - qt), Ot = st * bt + Vt;
       return { x: bt, y: Ot };
-    }, O = g.y - b * g.x, z = x.y - E * x.x, D = M(b, O, E, z), B = Math.sqrt(
+    }, L = g.y - b * g.x, z = x.y - E * x.x, D = M(b, L, E, z), B = Math.sqrt(
       Math.pow(t.x - D.x, 2) + Math.pow(t.y - D.y, 2)
     ), dt = (st, Vt) => Math.atan2(st.y - Vt.y, st.x - Vt.x), vt = dt(t, D), ot = dt(e, D), W = dt(s, D), ut = W > vt && W < ot || vt > W && vt < ot || ot > W && ot < vt;
     this.center = D, this.radius = B, this._clockwise = !ut, this._startAngle = vt, this._endAngle = W;
@@ -8013,20 +8020,20 @@ class Ps extends Ms {
   createByStartEndPointsAndBulge(t, e, s) {
     let o, h, c;
     s < 0 ? (o = Math.atan(-s) * 4, h = new Zt(t), c = new Zt(e)) : (o = Math.atan(s) * 4, h = new Zt(e), c = new Zt(t));
-    const g = new Zt().subVectors(c, h), x = g.length(), f = new Zt().addVectors(h, g.multiplyScalar(0.5)), A = Math.abs(x / 2 / Math.tan(o / 2)), b = g.normalize();
+    const g = new Zt().subVectors(c, h), x = g.length(), f = new Zt().addVectors(h, g.multiplyScalar(0.5)), w = Math.abs(x / 2 / Math.tan(o / 2)), b = g.normalize();
     let E;
     if (o < Math.PI) {
       const M = new Zt(
         b.x * Math.cos(Math.PI / 2) - b.y * Math.sin(Math.PI / 2),
         b.y * Math.cos(Math.PI / 2) + b.x * Math.sin(Math.PI / 2)
       );
-      E = f.add(M.multiplyScalar(-A));
+      E = f.add(M.multiplyScalar(-w));
     } else {
       const M = new Zt(
         b.x * Math.cos(Math.PI / 2) - b.y * Math.sin(Math.PI / 2),
         b.y * Math.cos(Math.PI / 2) + b.x * Math.sin(Math.PI / 2)
       );
-      E = f.add(M.multiplyScalar(A));
+      E = f.add(M.multiplyScalar(w));
     }
     s < 0 ? (this._startAngle = Math.atan2(h.y - E.y, h.x - E.x), this._endAngle = Math.atan2(c.y - E.y, c.x - E.x)) : (this._startAngle = Math.atan2(c.y - E.y, c.x - E.x), this._endAngle = Math.atan2(h.y - E.y, h.x - E.x)), this._clockwise = s < 0, this.center = E, this.radius = c.sub(E).length();
   }
@@ -8446,8 +8453,8 @@ class Ln extends Ts {
     const o = new Z().addVectors(t, e).multiplyScalar(0.5), h = new Z().addVectors(t, s).multiplyScalar(0.5), c = new Z().subVectors(e, t), g = new Z().subVectors(s, t), x = new Z().crossVectors(c, g).normalize();
     if (x.lengthSq() === 0)
       return console.error("Points are collinear and cannot form a valid arc."), null;
-    const f = new Z().crossVectors(c, x).normalize(), A = new Z().crossVectors(g, x).normalize(), b = f.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), E = A.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), M = new dn(o, o.clone().add(b)), O = new dn(h, h.clone().add(E)), z = new Z();
-    return M.closestPointToPoint(O.startPoint, !0, z) ? z : (console.error("Cannot find a valid center for the arc."), null);
+    const f = new Z().crossVectors(c, x).normalize(), w = new Z().crossVectors(g, x).normalize(), b = f.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), E = w.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), M = new dn(o, o.clone().add(b)), L = new dn(h, h.clone().add(E)), z = new Z();
+    return M.closestPointToPoint(L.startPoint, !0, z) ? z : (console.error("Cannot find a valid center for the arc."), null);
   }
   /**
    * Create arc by three points
@@ -8803,8 +8810,8 @@ class _a extends Ms {
     const h = this.startAngle + t * s;
     let c = this.center.x + this.majorAxisRadius * Math.cos(h), g = this.center.y + this.minorAxisRadius * Math.sin(h);
     if (this.rotation !== 0) {
-      const x = Math.cos(this.rotation), f = Math.sin(this.rotation), A = c - this.center.x, b = g - this.center.y;
-      c = A * x - b * f + this.center.x, g = A * f + b * x + this.center.y;
+      const x = Math.cos(this.rotation), f = Math.sin(this.rotation), w = c - this.center.x, b = g - this.center.y;
+      c = w * x - b * f + this.center.x, g = w * f + b * x + this.center.y;
     }
     return new Nt(c, g);
   }
@@ -8972,8 +8979,8 @@ class va extends Ts {
     const t = 1e3, e = this.deltaAngle / t;
     let s = 0, o = this.getPointAtAngle(this.startAngle);
     for (let h = 1; h <= t; h++) {
-      const c = this.startAngle + h * e, g = this.getPointAtAngle(c), x = g.x - o.x, f = g.y - o.y, A = g.z - o.z;
-      s += Math.sqrt(x * x + f * f + A * A), o = g;
+      const c = this.startAngle + h * e, g = this.getPointAtAngle(c), x = g.x - o.x, f = g.y - o.y, w = g.z - o.z;
+      s += Math.sqrt(x * x + f * f + w * w), o = g;
     }
     return s;
   }
@@ -9207,8 +9214,8 @@ class Rn extends Ms {
         if (o < s - 1 ? c = this._vertices[o + 1] : o == s - 1 && this.closed && (c = this._vertices[0]), c) {
           const g = new Ps(h, c, h.bulge).getPoints(t), x = g.length;
           for (let f = 0; f < x; ++f) {
-            const A = g[f];
-            e.push(new Nt(A.x, A.y));
+            const w = g[f];
+            e.push(new Nt(w.x, w.y));
           }
         }
       } else
@@ -9393,10 +9400,10 @@ var Ah = { exports: {} };
       var c = s;
       if (h()) {
         var g = function(x, f) {
-          var A = s;
+          var w = s;
           return x.split(".").forEach(function(b) {
-            A && (A = A[b]);
-          }), A ? A[f] : null;
+            w && (w = w[b]);
+          }), w ? w[f] : null;
         };
         onmessage = function(x) {
           if (!(!x.data.className || !x.data.methodName)) {
@@ -9408,7 +9415,7 @@ var Ah = { exports: {} };
         };
       }
     }
-    return function(x, f, A) {
+    return function(x, f, w) {
       f.geom = f.geom || {}, f.exe = f.exe || {}, f.eval = f.eval || {}, f.core = f.core || {}, f.promhx = f.promhx || {};
       var b = {}, E = function() {
         return Mt.__string_rec(this, "");
@@ -9421,9 +9428,9 @@ var Ah = { exports: {} };
         for (var u in n) l[u] = n[u];
         return n.toString !== Object.prototype.toString && (l.toString = n.toString), l;
       }
-      var O = function() {
+      var L = function() {
       };
-      b.HxOverrides = O, O.__name__ = ["HxOverrides"], O.strDate = function(r) {
+      b.HxOverrides = L, L.__name__ = ["HxOverrides"], L.strDate = function(r) {
         var n = r.length;
         switch (n) {
           case 8:
@@ -9438,13 +9445,13 @@ var Ah = { exports: {} };
           default:
             throw new Q("Invalid date format : " + r);
         }
-      }, O.cca = function(r, n) {
+      }, L.cca = function(r, n) {
         var a = r.charCodeAt(n);
         if (a == a)
           return a;
-      }, O.substr = function(r, n, a) {
+      }, L.substr = function(r, n, a) {
         return n != null && n != 0 && a != null && a < 0 ? "" : (a == null && (a = r.length), n < 0 ? (n = r.length + n, n < 0 && (n = 0)) : a < 0 && (a = r.length + a - n), r.substr(n, a));
-      }, O.iter = function(r) {
+      }, L.iter = function(r) {
         return {
           cur: 0,
           arr: r,
@@ -9668,7 +9675,7 @@ var Ah = { exports: {} };
                     break;
                   case D:
                     this.buf.b += "l";
-                    for (var w = r, I = w.h, S = null; I != null; ) {
+                    for (var A = r, I = A.h, S = null; I != null; ) {
                       var P;
                       S = I[0], I = I[1], P = S, this.serialize(P);
                     }
@@ -9680,8 +9687,8 @@ var Ah = { exports: {} };
                     break;
                   case me:
                     this.buf.b += "b";
-                    for (var T = r, L = T.keys(); L.hasNext(); ) {
-                      var C = L.next();
+                    for (var T = r, O = T.keys(); O.hasNext(); ) {
+                      var C = O.next();
                       this.serializeString(C), this.serialize(hi[C] != null ? T.getReserved(C) : T.h[C]);
                     }
                     this.buf.b += "h";
@@ -9801,7 +9808,7 @@ var Ah = { exports: {} };
             if (n >= 43 && n < 58 || n == 101 || n == 69) this.pos++;
             else break;
           }
-          return dt.parseFloat(O.substr(this.buf, r, this.pos - r));
+          return dt.parseFloat(L.substr(this.buf, r, this.pos - r));
         },
         unserializeObject: function(r) {
           for (; ; ) {
@@ -9839,7 +9846,7 @@ var Ah = { exports: {} };
             case 121:
               var n = this.readDigits();
               if (this.get(this.pos++) != 58 || this.length - this.pos < n) throw new Q("Invalid string length");
-              var a = O.substr(this.buf, this.pos, n);
+              var a = L.substr(this.buf, this.pos, n);
               return this.pos += n, a = decodeURIComponent(a.split("+").join(" ")), this.scache.push(a), a;
             case 107:
               return NaN;
@@ -9877,8 +9884,8 @@ var Ah = { exports: {} };
             case 120:
               throw new Q(this.unserialize());
             case 99:
-              var w = this.unserialize(), I = this.resolver.resolveClass(w);
-              if (I == null) throw new Q("Class not found " + w);
+              var A = this.unserialize(), I = this.resolver.resolveClass(A);
+              if (I == null) throw new Q("Class not found " + A);
               var S = ut.createEmptyInstance(I);
               return this.cache.push(S), this.unserializeObject(S), S;
             case 119:
@@ -9887,11 +9894,11 @@ var Ah = { exports: {} };
               var T = this.unserializeEnum(k, this.unserialize());
               return this.cache.push(T), T;
             case 106:
-              var L = this.unserialize(), C = this.resolver.resolveEnum(L);
-              if (C == null) throw new Q("Enum not found " + L);
+              var O = this.unserialize(), C = this.resolver.resolveEnum(O);
+              if (C == null) throw new Q("Enum not found " + O);
               this.pos++;
               var F = this.readDigits(), R = ut.getEnumConstructs(C)[F];
-              if (R == null) throw new Q("Unknown enum index " + L + "@" + F);
+              if (R == null) throw new Q("Unknown enum index " + O + "@" + F);
               var U = this.unserializeEnum(C, R);
               return this.cache.push(U), U;
             case 108:
@@ -9924,8 +9931,8 @@ var Ah = { exports: {} };
             case 118:
               var it;
               if (this.buf.charCodeAt(this.pos) >= 48 && this.buf.charCodeAt(this.pos) <= 57 && this.buf.charCodeAt(this.pos + 1) >= 48 && this.buf.charCodeAt(this.pos + 1) <= 57 && this.buf.charCodeAt(this.pos + 2) >= 48 && this.buf.charCodeAt(this.pos + 2) <= 57 && this.buf.charCodeAt(this.pos + 3) >= 48 && this.buf.charCodeAt(this.pos + 3) <= 57 && this.buf.charCodeAt(this.pos + 4) == 45) {
-                var ht = O.substr(this.buf, this.pos, 19);
-                it = O.strDate(ht), this.pos += 19;
+                var ht = L.substr(this.buf, this.pos, 19);
+                it = L.strDate(ht), this.pos += 19;
               } else {
                 var at = this.readFloat(), ct = /* @__PURE__ */ new Date();
                 ct.setTime(at), it = ct;
@@ -9939,10 +9946,10 @@ var Ah = { exports: {} };
               var gt = this.pos, It = nt & 3, jt;
               jt = (nt >> 2) * 3 + (It >= 2 ? It - 1 : 0);
               for (var Xt = gt + (nt - It), Dt = Me.alloc(jt), Kt = 0; gt < Xt; ) {
-                var Ae = X[ot.fastCodeAt(mt, gt++)], We = X[ot.fastCodeAt(mt, gt++)];
-                Dt.set(Kt++, Ae << 2 | We >> 4);
+                var Ae = X[ot.fastCodeAt(mt, gt++)], He = X[ot.fastCodeAt(mt, gt++)];
+                Dt.set(Kt++, Ae << 2 | He >> 4);
                 var _e = X[ot.fastCodeAt(mt, gt++)];
-                Dt.set(Kt++, We << 4 | _e >> 2);
+                Dt.set(Kt++, He << 4 | _e >> 2);
                 var ge = X[ot.fastCodeAt(mt, gt++)];
                 Dt.set(Kt++, _e << 6 | ge);
               }
@@ -9987,7 +9994,7 @@ var Ah = { exports: {} };
           var r = [];
           for (var n in this.h)
             this.h.hasOwnProperty(n) && r.push(n | 0);
-          return O.iter(r);
+          return L.iter(r);
         },
         __class__: bt
       };
@@ -10003,7 +10010,7 @@ var Ah = { exports: {} };
           var r = [];
           for (var n in this.h.__keys__)
             this.h.hasOwnProperty(n) && r.push(this.h.__keys__[n]);
-          return O.iter(r);
+          return L.iter(r);
         },
         __class__: Ot
       };
@@ -10030,7 +10037,7 @@ var Ah = { exports: {} };
         },
         keys: function() {
           var r = this.arrayKeys();
-          return O.iter(r);
+          return L.iter(r);
         },
         arrayKeys: function() {
           var r = [];
@@ -10125,8 +10132,8 @@ var Ah = { exports: {} };
               }
               var _ = r.length, v = "[";
               n += "	";
-              for (var w = 0; w < _; ) {
-                var I = w++;
+              for (var A = 0; A < _; ) {
+                var I = A++;
                 v += (I > 0 ? "," : "") + Mt.__string_rec(r[I], n);
               }
               return v += "]", v;
@@ -10144,9 +10151,9 @@ var Ah = { exports: {} };
             var k = null, T = `{
 `;
             n += "	";
-            var L = r.hasOwnProperty != null;
+            var O = r.hasOwnProperty != null;
             for (var k in r)
-              L && !r.hasOwnProperty(k) || k == "prototype" || k == "__class__" || k == "__super__" || k == "__interfaces__" || k == "__properties__" || (T.length != 2 && (T += `, 
+              O && !r.hasOwnProperty(k) || k == "prototype" || k == "__class__" || k == "__super__" || k == "__interfaces__" || k == "__properties__" || (T.length != 2 && (T += `, 
 `), T += n + k + " : " + Mt.__string_rec(r[k], n));
             return n = n.substring(1), T += `
 ` + n + "}", T;
@@ -10197,7 +10204,7 @@ var Ah = { exports: {} };
       }, Mt.__isNativeObj = function(r) {
         return Mt.__nativeClassName(r) != null;
       }, Mt.__resolveNativeClass = function(r) {
-        return A[r];
+        return w[r];
       };
       var ae = function(r) {
         if (r instanceof Array && r.__enum__ == null)
@@ -10313,7 +10320,7 @@ var Ah = { exports: {} };
         } else if (r instanceof Array && r.__enum__ == null) {
           var _ = r;
           if (_.length + n > a.byteLength) throw new Q("set() outside of range");
-          for (var v = 0, w = _.length; v < w; ) {
+          for (var v = 0, A = _.length; v < A; ) {
             var I = v++;
             a[I + n] = _[I];
           }
@@ -10343,11 +10350,11 @@ var Ah = { exports: {} };
       }, Et.linkAll = function(r, n) {
         for (var a = function(d, p, _) {
           if (d.length == 0 || Et.allFulfilled(d)) {
-            for (var v, w = [], I = Ke(r)(); I.hasNext(); ) {
+            for (var v, A = [], I = Ke(r)(); I.hasNext(); ) {
               var S = I.next();
-              w.push(S == p ? _ : S._val);
+              A.push(S == p ? _ : S._val);
             }
-            v = w, n.handleResolve(v);
+            v = A, n.handleResolve(v);
           }
         }, l = Ke(r)(); l.hasNext(); ) {
           var u = l.next();
@@ -10359,8 +10366,8 @@ var Ah = { exports: {} };
               };
             }(a, function(d) {
               for (var p, _ = [], v = Ke(r)(); v.hasNext(); ) {
-                var w = v.next();
-                w != u && _.push(w);
+                var A = v.next();
+                A != u && _.push(A);
               }
               return p = _, p;
             }(), u)
@@ -10368,8 +10375,8 @@ var Ah = { exports: {} };
         }
         Et.allFulfilled(r) && n.handleResolve(function(d) {
           for (var p, _ = [], v = Ke(r)(); v.hasNext(); ) {
-            var w = v.next();
-            _.push(w._val);
+            var A = v.next();
+            _.push(A._val);
           }
           return p = _, p;
         }());
@@ -10460,8 +10467,8 @@ var Ah = { exports: {} };
               }
             else if (n._update.length > 0)
               for (var _ = 0, v = n._update; _ < v.length; ) {
-                var w = v[_];
-                ++_, w.async.handleError(l);
+                var A = v[_];
+                ++_, A.async.handleError(l);
               }
             else throw new Q(l);
             n._errorPending = !1;
@@ -10825,8 +10832,8 @@ var Ah = { exports: {} };
         u == null && (u = -1);
         var d;
         u < -0.5 ? d = rt.TOLERANCE : d = u;
-        var p = Math.min(r, n) - d, _ = Math.max(r, n) + d, v = Math.min(a, l) - d, w = Math.max(a, l) + d;
-        return p >= v && p <= w || _ >= v && _ <= w || v >= p && v <= _ || w >= p && w <= _;
+        var p = Math.min(r, n) - d, _ = Math.max(r, n) + d, v = Math.min(a, l) - d, A = Math.max(a, l) + d;
+        return p >= v && p <= A || _ >= v && _ <= A || v >= p && v <= _ || A >= p && A <= _;
       }, Te.prototype = {
         fromPoint: function(r) {
           return new Te([r]);
@@ -10875,7 +10882,7 @@ var Ah = { exports: {} };
           if (!this.initialized) return null;
           var a = this.min, l = this.max, u = r.min, d = r.max;
           if (!this.intersects(r, n)) return null;
-          for (var p = [], _ = [], v = 0, w = this.dim; v < w; ) {
+          for (var p = [], _ = [], v = 0, A = this.dim; v < A; ) {
             var I = v++;
             p.push(Math.min(l[I], d[I])), _.push(Math.max(a[I], u[I]));
           }
@@ -10993,13 +11000,13 @@ var Ah = { exports: {} };
       b["verb.core.CurveTriPoint"] = vn, vn.__name__ = ["verb", "core", "CurveTriPoint"], vn.prototype = {
         __class__: vn
       };
-      var Ge = function(r, n, a, l, u) {
+      var je = function(r, n, a, l, u) {
         u == null && (u = !1), l == null && (l = -1), this.uv = a, this.point = r, this.normal = n, this.id = l, this.degen = u;
       };
-      b["verb.core.SurfacePoint"] = Ge, Ge.__name__ = ["verb", "core", "SurfacePoint"], Ge.fromUv = function(r, n) {
-        return new Ge(null, null, [r, n]);
-      }, Ge.prototype = {
-        __class__: Ge
+      b["verb.core.SurfacePoint"] = je, je.__name__ = ["verb", "core", "SurfacePoint"], je.fromUv = function(r, n) {
+        return new je(null, null, [r, n]);
+      }, je.prototype = {
+        __class__: je
       };
       var Cs = f.core.CurvePoint = function(r, n) {
         this.u = r, this.pt = n;
@@ -11023,16 +11030,16 @@ var Ah = { exports: {} };
             return -S.item1;
           }), d, p = null;
           p = function(S) {
-            for (var P, k = S.dimension, T = l.distanceFunction(r, S.kdPoint.point), L, C = [], F = 0, R = l.dim; F < R; )
+            for (var P, k = S.dimension, T = l.distanceFunction(r, S.kdPoint.point), O, C = [], F = 0, R = l.dim; F < R; )
               F++, C.push(0);
-            L = C;
+            O = C;
             for (var U, V, q = function(K, tt) {
               u.push(new ee(K, tt)), u.size() > n && u.pop();
             }, J = 0, H = l.dim; J < H; ) {
               var G = J++;
-              G == S.dimension ? L[G] = r[G] : L[G] = S.kdPoint.point[G];
+              G == S.dimension ? O[G] = r[G] : O[G] = S.kdPoint.point[G];
             }
-            if (U = l.distanceFunction(L, S.kdPoint.point), S.right == null && S.left == null) {
+            if (U = l.distanceFunction(O, S.kdPoint.point), S.right == null && S.left == null) {
               (u.size() < n || T < u.peek().item1) && q(S, T);
               return;
             }
@@ -11041,8 +11048,8 @@ var Ah = { exports: {} };
           for (var _ = 0; _ < n; )
             _++, u.push(new ee(null, a));
           d(this.root);
-          for (var v = [], w = 0; w < n; ) {
-            var I = w++;
+          for (var v = [], A = 0; A < n; ) {
+            var I = A++;
             u.content[I].item0 != null && v.push(new ee(u.content[I].item0.kdPoint, u.content[I].item1));
           }
           return v;
@@ -11093,7 +11100,7 @@ var Ah = { exports: {} };
               _ = this.scoreFunction(v), _ < l && (p = d);
             }
             if (u < n) {
-              var w = this.content[u], I = this.scoreFunction(w);
+              var A = this.content[u], I = this.scoreFunction(A);
               I < (p == -1 ? l : _) && (p = u);
             }
             if (p != -1)
@@ -11233,12 +11240,12 @@ var Ah = { exports: {} };
         }
         return a;
       }, Lt.mult = function(r, n) {
-        var a, l, u, d, p, _, v, w;
+        var a, l, u, d, p, _, v, A;
         a = r.length, l = n.length, u = n[0].length, d = [];
         for (var I = a - 1, S = 0, P = 0; I >= 0; ) {
           for (p = [], _ = r[I], P = u - 1; P >= 0; ) {
             for (v = _[l - 1] * n[l - 1][P], S = l - 2; S >= 1; )
-              w = S - 1, v += _[S] * n[S][P] + _[w] * n[w][P], S -= 2;
+              A = S - 1, v += _[S] * n[S][P] + _[A] * n[A][P], S -= 2;
             S == 0 && (v += _[0] * n[0][P]), p[P] = v, P--;
           }
           d[I] = p, I--;
@@ -11279,7 +11286,7 @@ var Ah = { exports: {} };
         for (var n = [], a = 0, l = r[0].length; a < l; ) {
           var u = a++;
           n.push(function(d) {
-            for (var p, _ = [], v = 0, w = r.length; v < w; ) {
+            for (var p, _ = [], v = 0, A = r.length; v < A; ) {
               var I = v++;
               _.push(r[I][u]);
             }
@@ -11290,36 +11297,36 @@ var Ah = { exports: {} };
       }, Lt.solve = function(r, n) {
         return Lt.LUsolve(Lt.LU(r), n);
       }, Lt.LUsolve = function(r, n) {
-        var a, l, u = r.LU, d = u.length, p = n.slice(), _ = r.P, v, w, I;
+        var a, l, u = r.LU, d = u.length, p = n.slice(), _ = r.P, v, A, I;
         for (a = d - 1; a != -1; )
           p[a] = n[a], --a;
         for (a = 0; a < d; ) {
-          for (v = _[a], _[a] != a && (I = p[a], p[a] = p[v], p[v] = I), w = u[a], l = 0; l < a; )
-            p[a] -= p[l] * w[l], ++l;
+          for (v = _[a], _[a] != a && (I = p[a], p[a] = p[v], p[v] = I), A = u[a], l = 0; l < a; )
+            p[a] -= p[l] * A[l], ++l;
           ++a;
         }
         for (a = d - 1; a >= 0; ) {
-          for (w = u[a], l = a + 1; l < d; )
-            p[a] -= p[l] * w[l], ++l;
-          p[a] /= w[a], --a;
+          for (A = u[a], l = a + 1; l < d; )
+            p[a] -= p[l] * A[l], ++l;
+          p[a] /= A[a], --a;
         }
         return p;
       }, Lt.LU = function(r) {
-        for (var n, a, l, u, d, p, _, v, w, I = [], S = 0, P = r.length; S < P; ) {
+        for (var n, a, l, u, d, p, _, v, A, I = [], S = 0, P = r.length; S < P; ) {
           var k = S++;
           I.push(r[k].slice());
         }
         r = I;
-        var T = r.length, L = T - 1, C = [];
+        var T = r.length, O = T - 1, C = [];
         for (l = 0; l < T; ) {
-          for (_ = l, p = r[l], w = Math.abs(p[l]), a = l + 1; a < T; )
-            u = Math.abs(r[a][l]), w < u && (w = u, _ = a), ++a;
+          for (_ = l, p = r[l], A = Math.abs(p[l]), a = l + 1; a < T; )
+            u = Math.abs(r[a][l]), A < u && (A = u, _ = a), ++a;
           for (C[l] = _, _ != l && (r[l] = r[_], r[_] = p, p = r[l]), d = p[l], n = l + 1; n < T; )
             r[n][l] /= d, ++n;
           for (n = l + 1; n < T; ) {
-            for (v = r[n], a = l + 1; a < L; )
+            for (v = r[n], a = l + 1; a < O; )
               v[a] -= v[l] * p[a], ++a, v[a] -= v[l] * p[a], ++a;
-            a == L && (v[a] -= v[l] * p[a]), ++n;
+            a == O && (v[a] -= v[l] * p[a]), ++n;
           }
           ++l;
         }
@@ -11350,11 +11357,11 @@ var Ah = { exports: {} };
           u.push(new ee(_, p));
         }
         u.sort(function(P, k) {
-          var T = P.item0, L = k.item0;
-          return T == L ? 0 : T > L ? 1 : -1;
+          var T = P.item0, O = k.item0;
+          return T == O ? 0 : T > O ? 1 : -1;
         });
-        for (var v = [], w = 0, I = u.length; w < I; ) {
-          var S = w++;
+        for (var v = [], A = 0, I = u.length; A < I; ) {
+          var S = A++;
           v.push(u[S].item1);
         }
         return v;
@@ -11376,8 +11383,8 @@ var Ah = { exports: {} };
         }
         return a;
       }, re.triangleUVFromPoint = function(r, n, a) {
-        var l = r.faces[n], u = r.points[l[0]], d = r.points[l[1]], p = r.points[l[2]], _ = r.uvs[l[0]], v = r.uvs[l[1]], w = r.uvs[l[2]], I = m.sub(u, a), S = m.sub(d, a), P = m.sub(p, a), k = m.norm(m.cross(m.sub(u, d), m.sub(u, p))), T = m.norm(m.cross(S, P)) / k, L = m.norm(m.cross(P, I)) / k, C = m.norm(m.cross(I, S)) / k;
-        return m.add(m.mul(T, _), m.add(m.mul(L, v), m.mul(C, w)));
+        var l = r.faces[n], u = r.points[l[0]], d = r.points[l[1]], p = r.points[l[2]], _ = r.uvs[l[0]], v = r.uvs[l[1]], A = r.uvs[l[2]], I = m.sub(u, a), S = m.sub(d, a), P = m.sub(p, a), k = m.norm(m.cross(m.sub(u, d), m.sub(u, p))), T = m.norm(m.cross(S, P)) / k, O = m.norm(m.cross(P, I)) / k, C = m.norm(m.cross(I, S)) / k;
+        return m.add(m.mul(T, _), m.add(m.mul(O, v), m.mul(C, A)));
       };
       var Cr = function(r, n) {
         if (this._empty = !1, this._face = -1, n == null) {
@@ -11424,22 +11431,22 @@ var Ah = { exports: {} };
         var d = n.length, p = r(n), _ = p, v;
         if (isNaN(p)) throw new Q("uncmin: f(x0) is a NaN!");
         a = Math.max(a, rt.EPSILON);
-        var w, I, S, P = Lt.identity(d), k = 0, T = [], L, C, F, R, U, V, q = "";
+        var A, I, S, P = Lt.identity(d), k = 0, T = [], O, C, F, R, U, V, q = "";
         for (I = l(n); k < u; ) {
           if (!m.all(m.finite(I))) {
             q = "Gradient has Infinity or NaN";
             break;
           }
-          if (w = m.neg(Lt.dot(P, I)), !m.all(m.finite(w))) {
+          if (A = m.neg(Lt.dot(P, I)), !m.all(m.finite(A))) {
             q = "Search direction has Infinity or NaN";
             break;
           }
-          if (V = m.norm(w), V < a) {
+          if (V = m.norm(A), V < a) {
             q = "Newton step smaller than tol";
             break;
           }
-          for (U = 1, v = m.dot(I, w), L = n; k < u && !(U * V < a); ) {
-            if (T = m.mul(U, w), L = m.add(n, T), _ = r(L), _ - p >= 0.1 * U * v || isNaN(_)) {
+          for (U = 1, v = m.dot(I, A), O = n; k < u && !(U * V < a); ) {
+            if (T = m.mul(U, A), O = m.add(n, T), _ = r(O), _ - p >= 0.1 * U * v || isNaN(_)) {
               U *= 0.5, ++k;
               continue;
             }
@@ -11453,20 +11460,20 @@ var Ah = { exports: {} };
             q = "maxit reached during line search";
             break;
           }
-          S = l(L), C = m.sub(S, I), R = m.dot(C, T), F = Lt.dot(P, C), P = Lt.sub(Lt.add(P, Lt.mul((R + m.dot(C, F)) / (R * R), Xe.tensor(T, T))), Lt.div(Lt.add(Xe.tensor(F, T), Xe.tensor(T, F)), R)), n = L, p = _, I = S, ++k;
+          S = l(O), C = m.sub(S, I), R = m.dot(C, T), F = Lt.dot(P, C), P = Lt.sub(Lt.add(P, Lt.mul((R + m.dot(C, F)) / (R * R), Xe.tensor(T, T))), Lt.div(Lt.add(Xe.tensor(F, T), Xe.tensor(T, F)), R)), n = O, p = _, I = S, ++k;
         }
         return new Kn(n, p, I, P, k, q);
       }, Xe.numericalGradient = function(r, n) {
         var a = n.length, l = r(n);
         if (l == NaN) throw new Q("gradient: f(x) is a NaN!");
-        for (var u = n.slice(0), d, p, _ = [], v, w = 1e-3, I, S, P, k = 0, T, L, C, F = 0; F < a; )
+        for (var u = n.slice(0), d, p, _ = [], v, A = 1e-3, I, S, P, k = 0, T, O, C, F = 0; F < a; )
           for (var R = F++, U = Math.max(1e-6 * l, 1e-8); ; ) {
             if (++k, k > 20) throw new Q("Numerical gradient fails");
             if (u[R] = n[R] + U, d = r(u), u[R] = n[R] - U, p = r(u), u[R] = n[R], isNaN(d) || isNaN(p)) {
               U /= 16;
               continue;
             }
-            if (_[R] = (d - p) / (2 * U), I = n[R] - U, S = n[R], P = n[R] + U, T = (d - l) / U, L = (l - p) / U, C = m.max([Math.abs(_[R]), Math.abs(l), Math.abs(d), Math.abs(p), Math.abs(I), Math.abs(S), Math.abs(P), 1e-8]), v = Math.min(m.max([Math.abs(T - _[R]), Math.abs(L - _[R]), Math.abs(T - L)]) / C, U / C), v > w) U /= 16;
+            if (_[R] = (d - p) / (2 * U), I = n[R] - U, S = n[R], P = n[R] + U, T = (d - l) / U, O = (l - p) / U, C = m.max([Math.abs(_[R]), Math.abs(l), Math.abs(d), Math.abs(p), Math.abs(I), Math.abs(S), Math.abs(P), 1e-8]), v = Math.min(m.max([Math.abs(T - _[R]), Math.abs(O - _[R]), Math.abs(T - O)]) / C, U / C), v > A) U /= 16;
             else break;
           }
         return _;
@@ -11517,7 +11524,7 @@ var Ah = { exports: {} };
       }, Ne.segmentClosestPoint = function(r, n, a, l, u) {
         var d = m.sub(a, n), p = m.norm(d);
         if (p < rt.EPSILON) return { u: l, pt: n };
-        var _ = n, v = m.mul(1 / p, d), w = m.sub(r, _), I = m.dot(w, v);
+        var _ = n, v = m.mul(1 / p, d), A = m.sub(r, _), I = m.dot(A, v);
         return I < 0 ? { u: l, pt: n } : I > p ? { u, pt: a } : { u: l + (u - l) * I / p, pt: m.add(_, m.mul(I, v)) };
       };
       var m = f.core.Vec = function() {
@@ -11525,10 +11532,10 @@ var Ah = { exports: {} };
       b["verb.core.Vec"] = m, m.__name__ = ["verb", "core", "Vec"], m.angleBetween = function(r, n) {
         return Math.acos(m.dot(r, n) / (m.norm(r) * m.norm(n)));
       }, m.positiveAngleBetween = function(r, n, a) {
-        var l = m.cross(r, n), u = m.norm(r), d = m.norm(n), p = u * d, _ = m.dot(r, n), v = m.norm(l) / p, w = _ / p, I = Math.atan2(v, w), S = m.dot(a, l);
+        var l = m.cross(r, n), u = m.norm(r), d = m.norm(n), p = u * d, _ = m.dot(r, n), v = m.norm(l) / p, A = _ / p, I = Math.atan2(v, A), S = m.dot(a, l);
         return Math.abs(S) < rt.EPSILON || S > 0 ? I : -I;
       }, m.signedAngleBetween = function(r, n, a) {
-        var l = m.cross(r, n), u = m.norm(r), d = m.norm(n), p = u * d, _ = m.dot(r, n), v = m.norm(l) / p, w = _ / p, I = Math.atan2(v, w), S = m.dot(a, l);
+        var l = m.cross(r, n), u = m.norm(r), d = m.norm(n), p = u * d, _ = m.dot(r, n), v = m.norm(l) / p, A = _ / p, I = Math.atan2(v, A), S = m.dot(a, l);
         return S > 0 ? I : 2 * Math.PI - I;
       }, m.angleBetweenNormalized2d = function(r, n) {
         var a = r[0] * n[1] - r[1] * n[0];
@@ -11735,21 +11742,21 @@ var Ah = { exports: {} };
         var a = yt.rationalSurfaceClosestParam(r, n);
         return N.rationalSurfacePoint(r, a[0], a[1]);
       }, yt.rationalSurfaceClosestParam = function(r, n) {
-        for (var a = 5, l = 0, u, d = 1e-4, p = 5e-4, _, v = r.knotsU[0], w = $.last(r.knotsU), I = r.knotsV[0], S = $.last(r.knotsV), P = yt.isRationalSurfaceClosed(r), k = yt.isRationalSurfaceClosed(r, !1), T, L = zt.rationalSurfaceAdaptive(r, new Lr()), C = 1 / 0, F = 0, R = L.points.length; F < R; ) {
-          var U = F++, V = L.points[U], q = m.normSquared(m.sub(n, V));
-          q < C && (C = q, T = L.uvs[U]);
+        for (var a = 5, l = 0, u, d = 1e-4, p = 5e-4, _, v = r.knotsU[0], A = $.last(r.knotsU), I = r.knotsV[0], S = $.last(r.knotsV), P = yt.isRationalSurfaceClosed(r), k = yt.isRationalSurfaceClosed(r, !1), T, O = zt.rationalSurfaceAdaptive(r, new Lr()), C = 1 / 0, F = 0, R = O.points.length; F < R; ) {
+          var U = F++, V = O.points[U], q = m.normSquared(m.sub(n, V));
+          q < C && (C = q, T = O.uvs[U]);
         }
         for (var J = function(jt) {
           return N.rationalSurfaceDerivatives(r, jt[0], jt[1], 2);
         }, H = function(jt, Xt, Dt) {
-          var Kt = Xt[1][0], Ae = Xt[0][1], We = Xt[2][0], _e = Xt[0][2], ge = Xt[1][1], Se = Xt[1][1], Le = m.dot(Kt, Dt), $e = m.dot(Ae, Dt), lr = [-Le, -$e], Ze = m.dot(Kt, Kt) + m.dot(We, Dt), Qe = m.dot(Kt, Ae) + m.dot(ge, Dt), Je = m.dot(Kt, Ae) + m.dot(Se, Dt), dr = m.dot(Ae, Ae) + m.dot(_e, Dt), Pn = [[Ze, Qe], [Je, dr]], qr = Lt.solve(Pn, lr);
+          var Kt = Xt[1][0], Ae = Xt[0][1], He = Xt[2][0], _e = Xt[0][2], ge = Xt[1][1], Se = Xt[1][1], Le = m.dot(Kt, Dt), $e = m.dot(Ae, Dt), lr = [-Le, -$e], Ze = m.dot(Kt, Kt) + m.dot(He, Dt), Qe = m.dot(Kt, Ae) + m.dot(ge, Dt), Je = m.dot(Kt, Ae) + m.dot(Se, Dt), dr = m.dot(Ae, Ae) + m.dot(_e, Dt), Pn = [[Ze, Qe], [Je, dr]], qr = Lt.solve(Pn, lr);
           return m.add(qr, jt);
         }; l < a; ) {
           u = J(T), _ = m.sub(u[0][0], n);
           var G = m.norm(_), K = m.dot(u[1][0], _), tt = m.norm(u[1][0]) * G, et = m.dot(u[0][1], _), it = m.norm(u[0][1]) * G, ht = K / tt, at = et / it, ct = G < d, nt = ht < p, mt = at < p;
           if (ct && nt && mt) return T;
           var X = H(T, u, _);
-          X[0] < v ? P ? X = [w - (X[0] - v), X[1]] : X = [v + rt.EPSILON, X[1]] : X[0] > w && (P ? X = [v + (X[0] - w), X[1]] : X = [w - rt.EPSILON, X[1]]), X[1] < I ? k ? X = [X[0], S - (X[1] - I)] : X = [X[0], I + rt.EPSILON] : X[1] > S && (k ? X = [X[0], I + (X[0] - S)] : X = [X[0], S - rt.EPSILON]);
+          X[0] < v ? P ? X = [A - (X[0] - v), X[1]] : X = [v + rt.EPSILON, X[1]] : X[0] > A && (P ? X = [v + (X[0] - A), X[1]] : X = [A - rt.EPSILON, X[1]]), X[1] < I ? k ? X = [X[0], S - (X[1] - I)] : X = [X[0], I + rt.EPSILON] : X[1] > S && (k ? X = [X[0], I + (X[0] - S)] : X = [X[0], S - rt.EPSILON]);
           var gt = m.norm(m.mul(X[0] - T[0], u[1][0])), It = m.norm(m.mul(X[1] - T[1], u[0][1]));
           if (gt + It < d) return T;
           T = X, l++;
@@ -11759,15 +11766,15 @@ var Ah = { exports: {} };
         return N.rationalCurvePoint(r, yt.rationalCurveClosestParam(r, n));
       }, yt.rationalCurveClosestParam = function(r, n) {
         for (var a = 1 / 0, l = 0, u = zt.rationalCurveRegularSample(r, r.controlPoints.length * r.degree, !0), d = 0, p = u.length - 1; d < p; ) {
-          var _ = d++, v = u[_][0], w = u[_ + 1][0], I = u[_].slice(1), S = u[_ + 1].slice(1), P = Ne.segmentClosestPoint(n, I, S, v, w), k = m.norm(m.sub(n, P.pt));
+          var _ = d++, v = u[_][0], A = u[_ + 1][0], I = u[_].slice(1), S = u[_ + 1].slice(1), P = Ne.segmentClosestPoint(n, I, S, v, A), k = m.norm(m.sub(n, P.pt));
           k < a && (a = k, l = P.u);
         }
-        for (var T = 5, L = 0, C, F = 1e-4, R = 5e-4, U, V = r.knots[0], q = $.last(r.knots), J = m.normSquared(m.sub(r.controlPoints[0], $.last(r.controlPoints))) < rt.EPSILON, H = l, G = function(X) {
+        for (var T = 5, O = 0, C, F = 1e-4, R = 5e-4, U, V = r.knots[0], q = $.last(r.knots), J = m.normSquared(m.sub(r.controlPoints[0], $.last(r.controlPoints))) < rt.EPSILON, H = l, G = function(X) {
           return N.rationalCurveDerivatives(r, X, 2);
         }, K = function(X, gt, It) {
           var jt = m.dot(gt[1], It), Xt = m.dot(gt[2], It), Dt = m.dot(gt[1], gt[1]), Kt = Xt + Dt;
           return X - jt / Kt;
-        }; L < T; ) {
+        }; O < T; ) {
           C = G(H), U = m.sub(C[0], n);
           var tt = m.norm(U), et = m.dot(C[1], U), it = m.norm(C[1]) * tt, ht = et / it, at = tt < F, ct = Math.abs(ht) < R;
           if (at && ct) return H;
@@ -11775,7 +11782,7 @@ var Ah = { exports: {} };
           nt < V ? J ? nt = q - (nt - V) : nt = V : nt > q && (J ? nt = V + (nt - q) : nt = q);
           var mt = m.norm(m.mul(nt - H, C[1]));
           if (mt < F) return H;
-          H = nt, L++;
+          H = nt, O++;
         }
         return H;
       }, yt.rationalCurveParamAtArcLength = function(r, n, a, l, u) {
@@ -11794,9 +11801,9 @@ var Ah = { exports: {} };
         if (n < 0) return r.knots[0];
         var u;
         if (l != null ? u = l : u = yt.rationalBezierCurveArcLength(r), n > u) return $.last(r.knots);
-        var d = r.knots[0], p = 0, _ = $.last(r.knots), v = u, w = 0, I = 0, S;
+        var d = r.knots[0], p = 0, _ = $.last(r.knots), v = u, A = 0, I = 0, S;
         for (a != null ? S = a : S = rt.TOLERANCE * 2; v - p > S; )
-          w = (d + _) / 2, I = yt.rationalBezierCurveArcLength(r, w), I > n ? (_ = w, v = I) : (d = w, p = I);
+          A = (d + _) / 2, I = yt.rationalBezierCurveArcLength(r, A), I > n ? (_ = A, v = I) : (d = A, p = I);
         return (d + _) / 2;
       }, yt.rationalCurveArcLength = function(r, n, a) {
         a == null && (a = 16), n == null ? n = $.last(r.knots) : n = n;
@@ -11809,8 +11816,8 @@ var Ah = { exports: {} };
         a == null && (a = 16);
         var l;
         n == null ? l = $.last(r.knots) : l = n;
-        for (var u = (l - r.knots[0]) / 2, d = 0, p = r.degree + a, _, v, w = 0; w < p; ) {
-          var I = w++;
+        for (var u = (l - r.knots[0]) / 2, d = 0, p = r.degree + a, _, v, A = 0; A < p; ) {
+          var I = A++;
           _ = u * yt.Tvalues[p][I] + u + r.knots[0], v = N.rationalCurveDerivatives(r, _, 1), d += yt.Cvalues[p][I] * m.norm(v[1]);
         }
         return u * d;
@@ -11824,9 +11831,9 @@ var Ah = { exports: {} };
         },
         __class__: wn
       };
-      var je = f.eval.Check = function() {
+      var We = f.eval.Check = function() {
       };
-      b["verb.eval.Check"] = je, je.__name__ = ["verb", "eval", "Check"], je.isValidKnotVector = function(r, n) {
+      b["verb.eval.Check"] = We, We.__name__ = ["verb", "eval", "Check"], We.isValidKnotVector = function(r, n) {
         if (r.length == 0 || r.length < (n + 1) * 2) return !1;
         for (var a = $.first(r), l = 0, u = n + 1; l < u; ) {
           var d = l++;
@@ -11837,23 +11844,23 @@ var Ah = { exports: {} };
           var v = p++;
           if (Math.abs(r[v] - a) > rt.EPSILON) return !1;
         }
-        return je.isNonDecreasing(r);
-      }, je.isNonDecreasing = function(r) {
+        return We.isNonDecreasing(r);
+      }, We.isNonDecreasing = function(r) {
         for (var n = $.first(r), a = 0, l = r.length; a < l; ) {
           var u = a++;
           if (r[u] < n - rt.EPSILON) return !1;
           n = r[u];
         }
         return !0;
-      }, je.isValidNurbsCurveData = function(r) {
+      }, We.isValidNurbsCurveData = function(r) {
         if (r.controlPoints == null) throw new Q("Control points array cannot be null!");
         if (r.degree == null) throw new Q("Degree cannot be null!");
         if (r.degree < 1) throw new Q("Degree must be greater than 1!");
         if (r.knots == null) throw new Q("Knots cannot be null!");
         if (r.knots.length != r.controlPoints.length + r.degree + 1) throw new Q("controlPoints.length + degree + 1 must equal knots.length!");
-        if (!je.isValidKnotVector(r.knots, r.degree)) throw new Q("Invalid knot vector format!  Should begin with degree + 1 repeats and end with degree + 1 repeats!");
+        if (!We.isValidKnotVector(r.knots, r.degree)) throw new Q("Invalid knot vector format!  Should begin with degree + 1 repeats and end with degree + 1 repeats!");
         return r;
-      }, je.isValidNurbsSurfaceData = function(r) {
+      }, We.isValidNurbsSurfaceData = function(r) {
         if (r.controlPoints == null) throw new Q("Control points array cannot be null!");
         if (r.degreeU == null) throw new Q("DegreeU cannot be null!");
         if (r.degreeV == null) throw new Q("DegreeV cannot be null!");
@@ -11863,7 +11870,7 @@ var Ah = { exports: {} };
         if (r.knotsV == null) throw new Q("KnotsV cannot be null!");
         if (r.knotsU.length != r.controlPoints.length + r.degreeU + 1) throw new Q("controlPointsU.length + degreeU + 1 must equal knotsU.length!");
         if (r.knotsV.length != r.controlPoints[0].length + r.degreeV + 1) throw new Q("controlPointsV.length + degreeV + 1 must equal knotsV.length!");
-        if (!je.isValidKnotVector(r.knotsU, r.degreeU) || !je.isValidKnotVector(r.knotsV, r.degreeV)) throw new Q("Invalid knot vector format!  Should begin with degree + 1 repeats and end with degree + 1 repeats!");
+        if (!We.isValidKnotVector(r.knotsU, r.degreeU) || !We.isValidKnotVector(r.knotsV, r.degreeV)) throw new Q("Invalid knot vector format!  Should begin with degree + 1 repeats and end with degree + 1 repeats!");
         return r;
       };
       var oe = f.eval.Divide = function() {
@@ -11872,12 +11879,12 @@ var Ah = { exports: {} };
         a == null && (a = !1);
         var l, u, d;
         a ? (d = r.controlPoints, l = r.knotsV, u = r.degreeV) : (d = Lt.transpose(r.controlPoints), l = r.knotsU, u = r.degreeU);
-        for (var p, _ = [], v = 0, w = u + 1; v < w; )
+        for (var p, _ = [], v = 0, A = u + 1; v < A; )
           v++, _.push(n);
         p = _;
         for (var I = [], S = [], P = N.knotSpan(u, n, l), k = null, T = 0; T < d.length; ) {
-          var L = d[T];
-          ++T, k = ft.curveKnotRefine(new Gt(u, l, L), p), I.push(k.controlPoints.slice(0, P + 1)), S.push(k.controlPoints.slice(P + 1));
+          var O = d[T];
+          ++T, k = ft.curveKnotRefine(new Gt(u, l, O), p), I.push(k.controlPoints.slice(0, P + 1)), S.push(k.controlPoints.slice(P + 1));
         }
         var C = k.knots.slice(0, P + u + 2), F = k.knots.slice(P + 1);
         return a ? [new te(r.degreeU, u, r.knotsU.slice(), C, I), new te(r.degreeU, u, r.knotsU.slice(), F, S)] : (I = Lt.transpose(I), S = Lt.transpose(S), [new te(u, r.degreeV, C, r.knotsV.slice(), I), new te(u, r.degreeV, F, r.knotsV.slice(), S)]);
@@ -11887,7 +11894,7 @@ var Ah = { exports: {} };
         for (var l = r.knots, u, d = [], p = 0, _ = a + 1; p < _; )
           p++, d.push(n);
         u = d;
-        var v = ft.curveKnotRefine(r, u), w = N.knotSpan(a, n, l), I = v.knots.slice(0, w + a + 2), S = v.knots.slice(w + 1), P = v.controlPoints.slice(0, w + 1), k = v.controlPoints.slice(w + 1);
+        var v = ft.curveKnotRefine(r, u), A = N.knotSpan(a, n, l), I = v.knots.slice(0, A + a + 2), S = v.knots.slice(A + 1), P = v.controlPoints.slice(0, A + 1), k = v.controlPoints.slice(A + 1);
         return [new Gt(a, I, P), new Gt(a, S, k)];
       }, oe.rationalCurveByEqualArcLength = function(r, n) {
         var a = yt.rationalCurveArcLength(r), l = a / n;
@@ -11897,8 +11904,8 @@ var Ah = { exports: {} };
           return yt.rationalBezierCurveArcLength(P);
         }), u = m.sum(l), d = [new An(r.knots[0], 0)];
         if (n > u) return d;
-        for (var p = n, _ = 0, v = p, w = 0, I = 0, S; _ < a.length; ) {
-          for (w += l[_]; v < w + rt.EPSILON; )
+        for (var p = n, _ = 0, v = p, A = 0, I = 0, S; _ < a.length; ) {
+          for (A += l[_]; v < A + rt.EPSILON; )
             S = yt.rationalBezierCurveParamAtArcLength(a[_], v - I, rt.TOLERANCE, l[_]), d.push(new An(S, v)), v += p;
           I += l[_], _++;
         }
@@ -11920,24 +11927,24 @@ var Ah = { exports: {} };
         return m.cross(l[1][0], l[0][1]);
       }, N.rationalSurfaceDerivatives = function(r, n, a, l) {
         l == null && (l = 1);
-        for (var u = N.surfaceDerivatives(r, n, a, l), d = N.rational2d(u), p = N.weight2d(u), _ = [], v = d[0][0].length, w = 0, I = l + 1; w < I; ) {
-          var S = w++;
+        for (var u = N.surfaceDerivatives(r, n, a, l), d = N.rational2d(u), p = N.weight2d(u), _ = [], v = d[0][0].length, A = 0, I = l + 1; A < I; ) {
+          var S = A++;
           _.push([]);
           for (var P = 0, k = l - S + 1; P < k; ) {
-            for (var T = P++, L = d[S][T], C = 1, F = T + 1; C < F; ) {
+            for (var T = P++, O = d[S][T], C = 1, F = T + 1; C < F; ) {
               var R = C++;
-              m.subMulMutate(L, Ft.get(T, R) * p[0][R], _[S][T - R]);
+              m.subMulMutate(O, Ft.get(T, R) * p[0][R], _[S][T - R]);
             }
             for (var U = 1, V = S + 1; U < V; ) {
               var q = U++;
-              m.subMulMutate(L, Ft.get(S, q) * p[q][0], _[S - q][T]);
+              m.subMulMutate(O, Ft.get(S, q) * p[q][0], _[S - q][T]);
               for (var J = m.zeros1d(v), H = 1, G = T + 1; H < G; ) {
                 var K = H++;
                 m.addMulMutate(J, Ft.get(T, K) * p[q][K], _[S - q][T - K]);
               }
-              m.subMulMutate(L, Ft.get(S, q), J);
+              m.subMulMutate(O, Ft.get(S, q), J);
             }
-            m.mulMutate(1 / p[0][0], L), _[S].push(L);
+            m.mulMutate(1 / p[0][0], O), _[S].push(O);
           }
         }
         return _;
@@ -11946,9 +11953,9 @@ var Ah = { exports: {} };
       }, N.rationalCurveDerivatives = function(r, n, a) {
         a == null && (a = 1);
         for (var l = N.curveDerivatives(r, n, a), u = N.rational1d(l), d = N.weight1d(l), p = [], _ = 0, v = a + 1; _ < v; ) {
-          for (var w = _++, I = u[w], S = 1, P = w + 1; S < P; ) {
+          for (var A = _++, I = u[A], S = 1, P = A + 1; S < P; ) {
             var k = S++;
-            m.subMulMutate(I, Ft.get(w, k) * d[k], p[w - k]);
+            m.subMulMutate(I, Ft.get(A, k) * d[k], p[A - k]);
           }
           m.mulMutate(1 / d[0], I), p.push(I);
         }
@@ -11959,19 +11966,19 @@ var Ah = { exports: {} };
         var u = r.knotsU.length - r.degreeU - 2, d = r.knotsV.length - r.degreeV - 2;
         return N.surfaceDerivativesGivenNM(u, d, r, n, a, l);
       }, N.surfaceDerivativesGivenNM = function(r, n, a, l, u, d) {
-        var p = a.degreeU, _ = a.degreeV, v = a.controlPoints, w = a.knotsU, I = a.knotsV;
-        if (!N.areValidRelations(p, v.length, w.length) || !N.areValidRelations(_, v[0].length, I.length)) throw new Q("Invalid relations between control points, knot vector, and n");
+        var p = a.degreeU, _ = a.degreeV, v = a.controlPoints, A = a.knotsU, I = a.knotsV;
+        if (!N.areValidRelations(p, v.length, A.length) || !N.areValidRelations(_, v[0].length, I.length)) throw new Q("Invalid relations between control points, knot vector, and n");
         var S = v[0][0].length, P;
         d < p ? P = d : P = p;
         var k;
         d < _ ? k = d : k = _;
-        for (var T = m.zeros3d(d + 1, d + 1, S), L = N.knotSpanGivenN(r, p, l, w), C = N.knotSpanGivenN(n, _, u, I), F = N.derivativeBasisFunctionsGivenNI(L, l, p, r, w), R = N.derivativeBasisFunctionsGivenNI(C, u, _, n, I), U = m.zeros2d(_ + 1, S), V = 0, q = 0, J = P + 1; q < J; ) {
+        for (var T = m.zeros3d(d + 1, d + 1, S), O = N.knotSpanGivenN(r, p, l, A), C = N.knotSpanGivenN(n, _, u, I), F = N.derivativeBasisFunctionsGivenNI(O, l, p, r, A), R = N.derivativeBasisFunctionsGivenNI(C, u, _, n, I), U = m.zeros2d(_ + 1, S), V = 0, q = 0, J = P + 1; q < J; ) {
           for (var H = q++, G = 0, K = _ + 1; G < K; ) {
             var tt = G++;
             U[tt] = m.zeros1d(S);
             for (var et = 0, it = p + 1; et < it; ) {
               var ht = et++;
-              m.addMulMutate(U[tt], F[H][ht], v[L - p + ht][C - _ + tt]);
+              m.addMulMutate(U[tt], F[H][ht], v[O - p + ht][C - _ + tt]);
             }
           }
           var at = d - H;
@@ -11990,36 +11997,36 @@ var Ah = { exports: {} };
         var l = r.knotsU.length - r.degreeU - 2, u = r.knotsV.length - r.degreeV - 2;
         return N.surfacePointGivenNM(l, u, r, n, a);
       }, N.surfacePointGivenNM = function(r, n, a, l, u) {
-        var d = a.degreeU, p = a.degreeV, _ = a.controlPoints, v = a.knotsU, w = a.knotsV;
-        if (!N.areValidRelations(d, _.length, v.length) || !N.areValidRelations(p, _[0].length, w.length)) throw new Q("Invalid relations between control points, knot vector, and n");
-        for (var I = _[0][0].length, S = N.knotSpanGivenN(r, d, l, v), P = N.knotSpanGivenN(n, p, u, w), k = N.basisFunctionsGivenKnotSpanIndex(S, l, d, v), T = N.basisFunctionsGivenKnotSpanIndex(P, u, p, w), L = S - d, C = P, F = m.zeros1d(I), R = m.zeros1d(I), U = 0, V = p + 1; U < V; ) {
+        var d = a.degreeU, p = a.degreeV, _ = a.controlPoints, v = a.knotsU, A = a.knotsV;
+        if (!N.areValidRelations(d, _.length, v.length) || !N.areValidRelations(p, _[0].length, A.length)) throw new Q("Invalid relations between control points, knot vector, and n");
+        for (var I = _[0][0].length, S = N.knotSpanGivenN(r, d, l, v), P = N.knotSpanGivenN(n, p, u, A), k = N.basisFunctionsGivenKnotSpanIndex(S, l, d, v), T = N.basisFunctionsGivenKnotSpanIndex(P, u, p, A), O = S - d, C = P, F = m.zeros1d(I), R = m.zeros1d(I), U = 0, V = p + 1; U < V; ) {
           var q = U++;
           R = m.zeros1d(I), C = P - p + q;
           for (var J = 0, H = d + 1; J < H; ) {
             var G = J++;
-            m.addMulMutate(R, k[G], _[L + G][C]);
+            m.addMulMutate(R, k[G], _[O + G][C]);
           }
           m.addMulMutate(F, T[q], R);
         }
         return F;
       }, N.curveRegularSamplePoints = function(r, n) {
-        for (var a = N.curveDerivatives(r, r.knots[0], r.degree), l = 1 / n, u = l * l, d = a[0], p = m.mul(l, a[1]), _ = m.mul(u * 0.5, a[2]), v = m.mul(u * l * 0.5, a[3]), w = m.add(_, _), I = m.add(v, v), S = m.mul(0.3333333333333333, v), P = [], k = 0, T = n + 1; k < T; )
-          k++, P.push(N.dehomogenize(d)), m.addAllMutate([d, p, _, S]), m.addAllMutate([p, w, v]), m.addAllMutate([w, I]), m.addAllMutate([_, v]);
+        for (var a = N.curveDerivatives(r, r.knots[0], r.degree), l = 1 / n, u = l * l, d = a[0], p = m.mul(l, a[1]), _ = m.mul(u * 0.5, a[2]), v = m.mul(u * l * 0.5, a[3]), A = m.add(_, _), I = m.add(v, v), S = m.mul(0.3333333333333333, v), P = [], k = 0, T = n + 1; k < T; )
+          k++, P.push(N.dehomogenize(d)), m.addAllMutate([d, p, _, S]), m.addAllMutate([p, A, v]), m.addAllMutate([A, I]), m.addAllMutate([_, v]);
         return P;
       }, N.curveRegularSamplePoints2 = function(r, n) {
-        for (var a = N.curveDerivatives(r, r.knots[0], r.degree), l = 1 / n, u = l * l, d = a[0], p = m.mul(l, a[1]), _ = m.mul(u * 0.5, a[2]), v = m.mul(u * l * 0.5, a[3]), w = m.add(_, _), I = m.add(v, v), S = m.mul(0.3333333333333333, v), P = [], k = 0, T = n + 1; k < T; )
-          k++, P.push(N.dehomogenize(d)), m.addAllMutate([d, p, _, S]), m.addAllMutate([p, w, v]), m.addAllMutate([w, I]), m.addAllMutate([_, v]);
+        for (var a = N.curveDerivatives(r, r.knots[0], r.degree), l = 1 / n, u = l * l, d = a[0], p = m.mul(l, a[1]), _ = m.mul(u * 0.5, a[2]), v = m.mul(u * l * 0.5, a[3]), A = m.add(_, _), I = m.add(v, v), S = m.mul(0.3333333333333333, v), P = [], k = 0, T = n + 1; k < T; )
+          k++, P.push(N.dehomogenize(d)), m.addAllMutate([d, p, _, S]), m.addAllMutate([p, A, v]), m.addAllMutate([A, I]), m.addAllMutate([_, v]);
         return P;
       }, N.rationalSurfaceRegularSampleDerivatives = function(r, n, a, l) {
-        for (var u = N.surfaceRegularSampleDerivatives(r, n, a, l), d = [], p = n + 1, _ = a + 1, v = l + 1, w = 0; w < p; ) {
-          var I = w++, S = [];
+        for (var u = N.surfaceRegularSampleDerivatives(r, n, a, l), d = [], p = n + 1, _ = a + 1, v = l + 1, A = 0; A < p; ) {
+          var I = A++, S = [];
           d.push(S);
           for (var P = 0; P < _; ) {
-            for (var k = P++, T = u[I][k], L = N.rational2d(T), C = N.weight2d(T), F = [], R = L[0][0].length, U = 0; U < v; ) {
+            for (var k = P++, T = u[I][k], O = N.rational2d(T), C = N.weight2d(T), F = [], R = O[0][0].length, U = 0; U < v; ) {
               var V = U++;
               F.push([]);
               for (var q = 0, J = v - V; q < J; ) {
-                for (var H = q++, G = L[V][H], K = 1, tt = H + 1; K < tt; ) {
+                for (var H = q++, G = O[V][H], K = 1, tt = H + 1; K < tt; ) {
                   var et = K++;
                   m.subMulMutate(G, Ft.get(H, et) * C[0][et], F[V][H - et]);
                 }
@@ -12040,14 +12047,14 @@ var Ah = { exports: {} };
         }
         return d;
       }, N.surfaceRegularSampleDerivatives = function(r, n, a, l) {
-        var u = r.degreeU, d = r.degreeV, p = r.controlPoints, _ = r.knotsU, v = r.knotsV, w = p[0][0].length;
+        var u = r.degreeU, d = r.degreeV, p = r.controlPoints, _ = r.knotsU, v = r.knotsV, A = p[0][0].length;
         ($.last(_) - _[0]) / n, ($.last(v) - v[0]) / a;
-        for (var I = N.regularlySpacedDerivativeBasisFunctions(u, _, n), S = I.item0, P = I.item1, k = N.regularlySpacedDerivativeBasisFunctions(d, v, a), T = k.item0, L = k.item1, C = [], F = n + 1, R = a + 1, U = 0; U < F; ) {
+        for (var I = N.regularlySpacedDerivativeBasisFunctions(u, _, n), S = I.item0, P = I.item1, k = N.regularlySpacedDerivativeBasisFunctions(d, v, a), T = k.item0, O = k.item1, C = [], F = n + 1, R = a + 1, U = 0; U < F; ) {
           var V = U++, q = [];
           C.push(q);
           for (var J = 0; J < R; ) {
             var H = J++;
-            q.push(N.surfaceDerivativesGivenBasesKnotSpans(u, d, p, S[V], T[H], P[V], L[H], w, l));
+            q.push(N.surfaceDerivativesGivenBasesKnotSpans(u, d, p, S[V], T[H], P[V], O[H], A, l));
           }
         }
         return C;
@@ -12056,47 +12063,47 @@ var Ah = { exports: {} };
       }, N.surfaceRegularSamplePoints = function(r, n, a) {
         var l = r.degreeU, u = r.degreeV, d = r.controlPoints, p = r.knotsU, _ = r.knotsV, v = d[0][0].length;
         ($.last(p) - p[0]) / n, ($.last(_) - _[0]) / a;
-        for (var w = N.regularlySpacedBasisFunctions(l, p, n), I = w.item0, S = w.item1, P = N.regularlySpacedBasisFunctions(u, _, a), k = P.item0, T = P.item1, L = [], C = n + 1, F = a + 1, R = 0; R < C; ) {
+        for (var A = N.regularlySpacedBasisFunctions(l, p, n), I = A.item0, S = A.item1, P = N.regularlySpacedBasisFunctions(u, _, a), k = P.item0, T = P.item1, O = [], C = n + 1, F = a + 1, R = 0; R < C; ) {
           var U = R++, V = [];
-          L.push(V);
+          O.push(V);
           for (var q = 0; q < F; ) {
             var J = q++;
             V.push(N.surfacePointGivenBasesKnotSpans(l, u, d, I[U], k[J], S[U], T[J], v));
           }
         }
-        return L;
+        return O;
       }, N.regularlySpacedBasisFunctions = function(r, n, a) {
-        for (var l = n.length - r - 2, u = ($.last(n) - n[0]) / a, d = [], p = [], _ = n[0], v = N.knotSpanGivenN(l, r, _, n), w = a + 1, I = 0; I < w; ) {
+        for (var l = n.length - r - 2, u = ($.last(n) - n[0]) / a, d = [], p = [], _ = n[0], v = N.knotSpanGivenN(l, r, _, n), A = a + 1, I = 0; I < A; ) {
           for (I++; _ >= n[v + 1]; ) v++;
           p.push(v), d.push(N.basisFunctionsGivenKnotSpanIndex(v, _, r, n)), _ += u;
         }
         return new ee(p, d);
       }, N.regularlySpacedDerivativeBasisFunctions = function(r, n, a) {
-        for (var l = n.length - r - 2, u = ($.last(n) - n[0]) / a, d = [], p = [], _ = n[0], v = N.knotSpanGivenN(l, r, _, n), w = a + 1, I = 0; I < w; ) {
+        for (var l = n.length - r - 2, u = ($.last(n) - n[0]) / a, d = [], p = [], _ = n[0], v = N.knotSpanGivenN(l, r, _, n), A = a + 1, I = 0; I < A; ) {
           for (I++; _ >= n[v + 1]; ) v++;
           p.push(v), d.push(N.derivativeBasisFunctionsGivenNI(v, _, r, l, n)), _ += u;
         }
         return new ee(p, d);
       }, N.surfacePointGivenBasesKnotSpans = function(r, n, a, l, u, d, p, _) {
-        for (var v = m.zeros1d(_), w, I = l - r, S = u - n, P = 0, k = n + 1; P < k; ) {
+        for (var v = m.zeros1d(_), A, I = l - r, S = u - n, P = 0, k = n + 1; P < k; ) {
           var T = P++;
-          w = m.zeros1d(_);
-          for (var L = 0, C = r + 1; L < C; ) {
-            var F = L++;
-            m.addMulMutate(w, d[F], a[I + F][S]);
+          A = m.zeros1d(_);
+          for (var O = 0, C = r + 1; O < C; ) {
+            var F = O++;
+            m.addMulMutate(A, d[F], a[I + F][S]);
           }
-          S++, m.addMulMutate(v, p[T], w);
+          S++, m.addMulMutate(v, p[T], A);
         }
         return v;
       }, N.surfaceDerivativesGivenBasesKnotSpans = function(r, n, a, l, u, d, p, _, v) {
-        var w = a[0][0].length, I;
+        var A = a[0][0].length, I;
         v < r ? I = v : I = r;
         var S;
         v < n ? S = v : S = n;
-        for (var P = m.zeros3d(I + 1, S + 1, w), k = m.zeros2d(n + 1, w), T = 0, L = 0, C = I + 1; L < C; ) {
-          for (var F = L++, R = 0, U = n + 1; R < U; ) {
+        for (var P = m.zeros3d(I + 1, S + 1, A), k = m.zeros2d(n + 1, A), T = 0, O = 0, C = I + 1; O < C; ) {
+          for (var F = O++, R = 0, U = n + 1; R < U; ) {
             var V = R++;
-            k[V] = m.zeros1d(w);
+            k[V] = m.zeros1d(A);
             for (var q = 0, J = r + 1; q < J; ) {
               var H = q++;
               m.addMulMutate(k[V], d[F][H], a[l - r + H][u - n + V]);
@@ -12106,7 +12113,7 @@ var Ah = { exports: {} };
           G < S ? T = G : T = S;
           for (var K = 0, tt = T + 1; K < tt; ) {
             var et = K++;
-            P[F][et] = m.zeros1d(w);
+            P[F][et] = m.zeros1d(A);
             for (var it = 0, ht = n + 1; it < ht; ) {
               var at = it++;
               m.addMulMutate(P[F][et], p[et][at], k[at]);
@@ -12122,12 +12129,12 @@ var Ah = { exports: {} };
         if (!N.areValidRelations(u, d.length, p.length)) throw new Q("Invalid relations between control points, knot vector, and n");
         var _ = d[0].length, v;
         l < u ? v = l : v = u;
-        for (var w = m.zeros2d(l + 1, _), I = N.knotSpanGivenN(r, u, a, p), S = N.derivativeBasisFunctionsGivenNI(I, a, u, v, p), P = 0, k = v + 1; P < k; )
-          for (var T = P++, L = 0, C = u + 1; L < C; ) {
-            var F = L++;
-            m.addMulMutate(w[T], S[T][F], d[I - u + F]);
+        for (var A = m.zeros2d(l + 1, _), I = N.knotSpanGivenN(r, u, a, p), S = N.derivativeBasisFunctionsGivenNI(I, a, u, v, p), P = 0, k = v + 1; P < k; )
+          for (var T = P++, O = 0, C = u + 1; O < C; ) {
+            var F = O++;
+            m.addMulMutate(A[T], S[T][F], d[I - u + F]);
           }
-        return w;
+        return A;
       }, N.curvePoint = function(r, n) {
         var a = r.knots.length - r.degree - 2;
         return N.curvePointGivenN(a, r, n);
@@ -12137,8 +12144,8 @@ var Ah = { exports: {} };
         var l = n.degree, u = n.controlPoints, d = n.knots;
         if (!N.areValidRelations(l, u.length, d.length))
           throw new Q("Invalid relations between control points, knot Array, and n");
-        for (var p = N.knotSpanGivenN(r, l, a, d), _ = N.basisFunctionsGivenKnotSpanIndex(p, a, l, d), v = m.zeros1d(u[0].length), w = 0, I = l + 1; w < I; ) {
-          var S = w++;
+        for (var p = N.knotSpanGivenN(r, l, a, d), _ = N.basisFunctionsGivenKnotSpanIndex(p, a, l, d), v = m.zeros1d(u[0].length), A = 0, I = l + 1; A < I; ) {
+          var S = A++;
           m.addMulMutate(v, _[S], u[p - l + S]);
         }
         return v;
@@ -12147,13 +12154,13 @@ var Ah = { exports: {} };
         return N.volumePointGivenNML(r, u, d, p, n, a, l);
       }, N.volumePointGivenNML = function(r, n, a, l, u, d, p) {
         if (!N.areValidRelations(r.degreeU, r.controlPoints.length, r.knotsU.length) || !N.areValidRelations(r.degreeV, r.controlPoints[0].length, r.knotsV.length) || !N.areValidRelations(r.degreeW, r.controlPoints[0][0].length, r.knotsW.length)) throw new Q("Invalid relations between control points and knot vector");
-        for (var _ = r.controlPoints, v = r.degreeU, w = r.degreeV, I = r.degreeW, S = r.knotsU, P = r.knotsV, k = r.knotsW, T = _[0][0][0].length, L = N.knotSpanGivenN(n, v, u, S), C = N.knotSpanGivenN(a, w, d, P), F = N.knotSpanGivenN(l, I, p, k), R = N.basisFunctionsGivenKnotSpanIndex(L, u, v, S), U = N.basisFunctionsGivenKnotSpanIndex(C, d, w, P), V = N.basisFunctionsGivenKnotSpanIndex(F, p, I, k), q = L - v, J = m.zeros1d(T), H = m.zeros1d(T), G = m.zeros1d(T), K = 0, tt = I + 1; K < tt; ) {
+        for (var _ = r.controlPoints, v = r.degreeU, A = r.degreeV, I = r.degreeW, S = r.knotsU, P = r.knotsV, k = r.knotsW, T = _[0][0][0].length, O = N.knotSpanGivenN(n, v, u, S), C = N.knotSpanGivenN(a, A, d, P), F = N.knotSpanGivenN(l, I, p, k), R = N.basisFunctionsGivenKnotSpanIndex(O, u, v, S), U = N.basisFunctionsGivenKnotSpanIndex(C, d, A, P), V = N.basisFunctionsGivenKnotSpanIndex(F, p, I, k), q = O - v, J = m.zeros1d(T), H = m.zeros1d(T), G = m.zeros1d(T), K = 0, tt = I + 1; K < tt; ) {
           var et = K++;
           G = m.zeros1d(T);
-          for (var it = F - I + et, ht = 0, at = w + 1; ht < at; ) {
+          for (var it = F - I + et, ht = 0, at = A + 1; ht < at; ) {
             var ct = ht++;
             H = m.zeros1d(T);
-            for (var nt = C - w + ct, mt = 0, X = v + 1; mt < X; ) {
+            for (var nt = C - A + ct, mt = 0, X = v + 1; mt < X; ) {
               var gt = mt++;
               m.addMulMutate(H, R[gt], _[q + gt][nt][it]);
             }
@@ -12166,20 +12173,20 @@ var Ah = { exports: {} };
         var l = N.knotSpan(n, r, a), u = a.length - 1, d = u - n - 1;
         return N.derivativeBasisFunctionsGivenNI(l, r, n, d, a);
       }, N.derivativeBasisFunctionsGivenNI = function(r, n, a, l, u) {
-        var d = m.zeros2d(a + 1, a + 1), p = m.zeros1d(a + 1), _ = m.zeros1d(a + 1), v = 0, w = 0;
+        var d = m.zeros2d(a + 1, a + 1), p = m.zeros1d(a + 1), _ = m.zeros1d(a + 1), v = 0, A = 0;
         d[0][0] = 1;
         for (var I = 1, S = a + 1; I < S; ) {
           var P = I++;
           p[P] = n - u[r + 1 - P], _[P] = u[r + P] - n, v = 0;
           for (var k = 0; k < P; ) {
             var T = k++;
-            d[P][T] = _[T + 1] + p[P - T], w = d[T][P - 1] / d[P][T], d[T][P] = v + _[T + 1] * w, v = p[P - T] * w;
+            d[P][T] = _[T + 1] + p[P - T], A = d[T][P - 1] / d[P][T], d[T][P] = v + _[T + 1] * A, v = p[P - T] * A;
           }
           d[P][P] = v;
         }
-        for (var L = m.zeros2d(l + 1, a + 1), C = m.zeros2d(2, a + 1), F = 0, R = 1, U = 0, V = 0, q = 0, J = 0, H = 0, G = 0, K = a + 1; G < K; ) {
+        for (var O = m.zeros2d(l + 1, a + 1), C = m.zeros2d(2, a + 1), F = 0, R = 1, U = 0, V = 0, q = 0, J = 0, H = 0, G = 0, K = a + 1; G < K; ) {
           var tt = G++;
-          L[0][tt] = d[tt][a];
+          O[0][tt] = d[tt][a];
         }
         for (var et = 0, it = a + 1; et < it; ) {
           var ht = et++;
@@ -12191,27 +12198,27 @@ var Ah = { exports: {} };
               var gt = mt++;
               C[R][gt] = (C[F][gt] - C[F][gt - 1]) / d[q + 1][V + gt], U += C[R][gt] * d[V + gt][q];
             }
-            ht <= q && (C[R][nt] = -C[F][nt - 1] / d[q + 1][ht], U += C[R][nt] * d[ht][q]), L[nt][ht] = U;
+            ht <= q && (C[R][nt] = -C[F][nt - 1] / d[q + 1][ht], U += C[R][nt] * d[ht][q]), O[nt][ht] = U;
             var It = F;
             F = R, R = It;
           }
         }
         for (var jt = a, Xt = 1, Dt = l + 1; Xt < Dt; ) {
-          for (var Kt = Xt++, Ae = 0, We = a + 1; Ae < We; ) {
+          for (var Kt = Xt++, Ae = 0, He = a + 1; Ae < He; ) {
             var _e = Ae++;
-            L[Kt][_e] *= jt;
+            O[Kt][_e] *= jt;
           }
           jt *= a - Kt;
         }
-        return L;
+        return O;
       }, N.basisFunctions = function(r, n, a) {
         var l = N.knotSpan(n, r, a);
         return N.basisFunctionsGivenKnotSpanIndex(l, r, n, a);
       }, N.basisFunctionsGivenKnotSpanIndex = function(r, n, a, l) {
         var u = m.zeros1d(a + 1), d = m.zeros1d(a + 1), p = m.zeros1d(a + 1), _ = 0, v = 0;
         u[0] = 1;
-        for (var w = 1, I = a + 1; w < I; ) {
-          var S = w++;
+        for (var A = 1, I = a + 1; A < I; ) {
+          var S = A++;
           d[S] = n - l[r + 1 - S], p[S] = l[r + S] - n, _ = 0;
           for (var P = 0; P < S; ) {
             var k = P++;
@@ -12256,8 +12263,8 @@ var Ah = { exports: {} };
         var a = r.length, l = r[0].length, u = [], d = 0, p = [], _;
         n != null ? _ = n : _ = m.rep(r.length, 1);
         for (var v = 0; v < a; ) {
-          var w = v++, I = [];
-          p = r[w], d = _[w];
+          var A = v++, I = [];
+          p = r[A], d = _[A];
           for (var S = 0; S < l; ) {
             var P = S++;
             I.push(p[P] * d);
@@ -12293,12 +12300,12 @@ var Ah = { exports: {} };
           }), 3);
         });
       }, lt.surfacesAtPointWithEstimate = function(r, n, a, l, u) {
-        var d, p, _, v, w, I, S, P, k, T, L, C, F, R = 5, U = 0;
+        var d, p, _, v, A, I, S, P, k, T, O, C, F, R = 5, U = 0;
         do {
-          if (d = N.rationalSurfaceDerivatives(r, a[0], a[1], 1), p = d[0][0], v = d[1][0], w = d[0][1], _ = m.normalized(m.cross(v, w)), I = m.dot(_, p), S = N.rationalSurfaceDerivatives(n, l[0], l[1], 1), P = S[0][0], T = S[1][0], L = S[0][1], k = m.normalized(m.cross(T, L)), C = m.dot(k, P), F = m.distSquared(p, P), F < u * u) break;
+          if (d = N.rationalSurfaceDerivatives(r, a[0], a[1], 1), p = d[0][0], v = d[1][0], A = d[0][1], _ = m.normalized(m.cross(v, A)), I = m.dot(_, p), S = N.rationalSurfaceDerivatives(n, l[0], l[1], 1), P = S[0][0], T = S[1][0], O = S[0][1], k = m.normalized(m.cross(T, O)), C = m.dot(k, P), F = m.distSquared(p, P), F < u * u) break;
           var V = m.normalized(m.cross(_, k)), q = m.dot(V, p), J = lt.threePlanes(_, I, k, C, V, q);
           if (J == null) throw new Q("panic!");
-          var H = m.sub(J, p), G = m.sub(J, P), K = m.cross(v, _), tt = m.cross(w, _), et = m.cross(T, k), it = m.cross(L, k), ht = m.dot(tt, H) / m.dot(tt, v), at = m.dot(K, H) / m.dot(K, w), ct = m.dot(it, G) / m.dot(it, T), nt = m.dot(et, G) / m.dot(et, L);
+          var H = m.sub(J, p), G = m.sub(J, P), K = m.cross(v, _), tt = m.cross(A, _), et = m.cross(T, k), it = m.cross(O, k), ht = m.dot(tt, H) / m.dot(tt, v), at = m.dot(K, H) / m.dot(K, A), ct = m.dot(it, G) / m.dot(it, T), nt = m.dot(et, G) / m.dot(et, O);
           a = m.add([ht, at], a), l = m.add([ct, nt], l), U++;
         } while (U < R);
         return new Wn(a, l, p, F);
@@ -12311,15 +12318,15 @@ var Ah = { exports: {} };
         }).filter(function(p) {
           return m.distSquared(p.min.point, p.max.point) > rt.EPSILON;
         }), function(p, _) {
-          var v = m.sub(p.min.uv0, _.min.uv0), w = m.dot(v, v), I = m.sub(p.max.uv0, _.max.uv0), S = m.dot(I, I), P = m.sub(p.min.uv0, _.max.uv0), k = m.dot(P, P), T = m.sub(p.max.uv0, _.min.uv0), L = m.dot(T, T);
-          return w < rt.EPSILON && S < rt.EPSILON || k < rt.EPSILON && L < rt.EPSILON;
+          var v = m.sub(p.min.uv0, _.min.uv0), A = m.dot(v, v), I = m.sub(p.max.uv0, _.max.uv0), S = m.dot(I, I), P = m.sub(p.min.uv0, _.max.uv0), k = m.dot(P, P), T = m.sub(p.max.uv0, _.min.uv0), O = m.dot(T, T);
+          return A < rt.EPSILON && S < rt.EPSILON || k < rt.EPSILON && O < rt.EPSILON;
         });
         return lt.makeMeshIntersectionPolylines(d);
       }, lt.meshSlices = function(r, n, a, l) {
-        for (var u = new Cr(r), d = u.boundingBox(), p = d.min[0], _ = d.min[1], v = d.max[0], w = d.max[1], I = m.span(n, a, l), S = [], P = 0; P < I.length; ) {
+        for (var u = new Cr(r), d = u.boundingBox(), p = d.min[0], _ = d.min[1], v = d.max[0], A = d.max[1], I = m.span(n, a, l), S = [], P = 0; P < I.length; ) {
           var k = I[P];
           ++P;
-          var T = [[p, _, k], [v, _, k], [v, w, k], [p, w, k]], L = [[0, 0], [1, 0], [1, 1], [0, 1]], C = [[0, 1, 2], [0, 2, 3]], F = new qe(C, T, null, L);
+          var T = [[p, _, k], [v, _, k], [v, A, k], [p, A, k]], O = [[0, 0], [1, 0], [1, 1], [0, 1]], C = [[0, 1, 2], [0, 2, 3]], F = new qe(C, T, null, O);
           S.push(lt.meshes(r, F, u));
         }
         return S;
@@ -12336,8 +12343,8 @@ var Ah = { exports: {} };
         for (var _ = 0; _ < u.length; ) {
           var v = u[_];
           if (++_, v.adj == null) {
-            var w = lt.lookupAdjacentSegment(v, l, r.length);
-            w != null && w.adj == null && (v.adj = w, w.adj = v);
+            var A = lt.lookupAdjacentSegment(v, l, r.length);
+            A != null && A.adj == null && (v.adj = A, A.adj = v);
           }
         }
         var I = u.filter(function(R) {
@@ -12347,9 +12354,9 @@ var Ah = { exports: {} };
         for (var S = [], P = 0, k = !1; I.length != 0; ) {
           var T = I.pop();
           if (!T.visited) {
-            for (var L = [], C = T; C != null && !(C.visited || (C.visited = !0, C.opp.visited = !0, L.push(C), P += 2, C = C.opp.adj, C == T)); )
+            for (var O = [], C = T; C != null && !(C.visited || (C.visited = !0, C.opp.visited = !0, O.push(C), P += 2, C = C.opp.adj, C == T)); )
               ;
-            L.length > 0 && (L.push(L[L.length - 1].opp), S.push(L));
+            O.length > 0 && (O.push(O[O.length - 1].opp), S.push(O));
           }
           if (I.length == 0 && u.length > 0 && (k || P < u.length)) {
             k = !0;
@@ -12375,7 +12382,7 @@ var Ah = { exports: {} };
         a == null && (a = 1e-3), l != null ? l = l : l = new ir(r), u != null ? u = u : u = new Nr(n);
         var d = lt.boundingBoxTrees(l, u, a);
         return $.unique(d.map(function(p) {
-          var _ = p.item0, v = p.item1, w = $.first(_.knots), I = $.last(_.knots), S = (w + I) / 2, P = $.first(v.knotsU), k = $.last(v.knotsU), T = $.first(v.knotsV), L = $.last(v.knotsV), C = [(P + k) / 2, (T + L) / 2];
+          var _ = p.item0, v = p.item1, A = $.first(_.knots), I = $.last(_.knots), S = (A + I) / 2, P = $.first(v.knotsU), k = $.last(v.knotsU), T = $.first(v.knotsV), O = $.last(v.knotsV), C = [(P + k) / 2, (T + O) / 2];
           return lt.curveAndSurfaceWithEstimate(_, v, [S].concat(C), a);
         }).filter(function(p) {
           return m.distSquared(p.curvePoint, p.surfacePoint) < a * a;
@@ -12385,10 +12392,10 @@ var Ah = { exports: {} };
       }, lt.curveAndSurfaceWithEstimate = function(r, n, a, l) {
         l == null && (l = 1e-3);
         var u = function(v) {
-          var w = N.rationalCurvePoint(r, v[0]), I = N.rationalSurfacePoint(n, v[1], v[2]), S = m.sub(w, I);
+          var A = N.rationalCurvePoint(r, v[0]), I = N.rationalSurfacePoint(n, v[1], v[2]), S = m.sub(A, I);
           return m.dot(S, S);
         }, d = function(v) {
-          var w = N.rationalCurveDerivatives(r, v[0], 1), I = N.rationalSurfaceDerivatives(n, v[1], v[2], 1), S = m.sub(I[0][0], w[0]), P = m.mul(-1, w[1]), k = I[1][0], T = I[0][1];
+          var A = N.rationalCurveDerivatives(r, v[0], 1), I = N.rationalSurfaceDerivatives(n, v[1], v[2], 1), S = m.sub(I[0][0], A[0]), P = m.mul(-1, A[1]), k = I[1][0], T = I[0][1];
           return [2 * m.dot(P, S), 2 * m.dot(k, S), 2 * m.dot(T, S)];
         }, p = Xe.uncmin(u, a, l * l, d), _ = p.solution;
         return new Gn(_[0], [_[1], _[2]], N.rationalCurvePoint(r, _[0]), N.rationalSurfacePoint(n, _[1], _[2]));
@@ -12396,9 +12403,9 @@ var Ah = { exports: {} };
         for (var l = lt.boundingBoxTrees(new or(r), new ar(n), a), u = [], d = 0; d < l.length; ) {
           var p = l[d];
           ++d;
-          var _ = p.item0, v = p.item1, w = lt.segmentWithTriangle(r.points[_], r.points[_ + 1], n.points, n.faces[v]);
-          if (w != null) {
-            var I = w.point, S = m.lerp(w.p, [r.params[_]], [r.params[_ + 1]])[0], P = re.triangleUVFromPoint(n, v, I);
+          var _ = p.item0, v = p.item1, A = lt.segmentWithTriangle(r.points[_], r.points[_ + 1], n.points, n.faces[v]);
+          if (A != null) {
+            var I = A.point, S = m.lerp(A.p, [r.params[_]], [r.params[_ + 1]])[0], P = re.triangleUVFromPoint(n, v, I);
             u.push(new jn(I, S, P, _, v));
           }
         }
@@ -12410,15 +12417,15 @@ var Ah = { exports: {} };
         for (var d = []; l.length > 0; ) {
           var p = l.pop(), _ = u.pop();
           if (!(p.empty() || _.empty()) && p.boundingBox().intersects(_.boundingBox(), a)) {
-            var v = p.indivisible(a), w = _.indivisible(a);
-            if (v && w) {
+            var v = p.indivisible(a), A = _.indivisible(a);
+            if (v && A) {
               d.push(new ee(p.yield(), _.yield()));
               continue;
-            } else if (v && !w) {
+            } else if (v && !A) {
               var I = _.split();
               l.push(p), u.push(I.item1), l.push(p), u.push(I.item0);
               continue;
-            } else if (!v && w) {
+            } else if (!v && A) {
               var S = p.split();
               l.push(S.item1), u.push(_), l.push(S.item0), u.push(_);
               continue;
@@ -12439,15 +12446,15 @@ var Ah = { exports: {} };
         });
       }, lt.curvesWithEstimate = function(r, n, a, l, u) {
         var d = function(P) {
-          var k = N.rationalCurvePoint(r, P[0]), T = N.rationalCurvePoint(n, P[1]), L = m.sub(k, T);
-          return m.dot(L, L);
+          var k = N.rationalCurvePoint(r, P[0]), T = N.rationalCurvePoint(n, P[1]), O = m.sub(k, T);
+          return m.dot(O, O);
         }, p = function(P) {
-          var k = N.rationalCurveDerivatives(r, P[0], 1), T = N.rationalCurveDerivatives(n, P[1], 1), L = m.sub(k[0], T[0]), C = k[1], F = m.mul(-1, T[1]);
-          return [2 * m.dot(C, L), 2 * m.dot(F, L)];
-        }, _ = Xe.uncmin(d, [a, l], u * u, p), v = _.solution[0], w = _.solution[1], I = N.rationalCurvePoint(r, v), S = N.rationalCurvePoint(n, w);
-        return new Hr(I, S, v, w);
+          var k = N.rationalCurveDerivatives(r, P[0], 1), T = N.rationalCurveDerivatives(n, P[1], 1), O = m.sub(k[0], T[0]), C = k[1], F = m.mul(-1, T[1]);
+          return [2 * m.dot(C, O), 2 * m.dot(F, O)];
+        }, _ = Xe.uncmin(d, [a, l], u * u, p), v = _.solution[0], A = _.solution[1], I = N.rationalCurvePoint(r, v), S = N.rationalCurvePoint(n, A);
+        return new Hr(I, S, v, A);
       }, lt.triangles = function(r, n, a, l) {
-        var u = r.faces[n], d = a.faces[l], p = re.getTriangleNorm(r.points, u), _ = re.getTriangleNorm(a.points, d), v = r.points[u[0]], w = a.points[d[0]], I = lt.planes(v, p, w, _);
+        var u = r.faces[n], d = a.faces[l], p = re.getTriangleNorm(r.points, u), _ = re.getTriangleNorm(a.points, d), v = r.points[u[0]], A = a.points[d[0]], I = lt.planes(v, p, A, _);
         if (I == null) return null;
         var S = lt.clipRayInCoplanarTriangle(I, r, n);
         if (S == null) return null;
@@ -12456,11 +12463,11 @@ var Ah = { exports: {} };
         var k = lt.mergeTriangleClipIntervals(S, P, r, n, a, l);
         return k == null ? null : new we(new Tr(k.min.uv0, k.min.uv1, k.min.point, n, l), new Tr(k.max.uv0, k.max.uv1, k.max.point, n, l));
       }, lt.clipRayInCoplanarTriangle = function(r, n, a) {
-        for (var l = n.faces[a], u = [n.points[l[0]], n.points[l[1]], n.points[l[2]]], d = [n.uvs[l[0]], n.uvs[l[1]], n.uvs[l[2]]], p = [m.sub(d[1], d[0]), m.sub(d[2], d[1]), m.sub(d[0], d[2])], _ = [m.sub(u[1], u[0]), m.sub(u[2], u[1]), m.sub(u[0], u[2])], v = _.map(m.normalized), w = _.map(m.norm), I = null, S = null, P = 0; P < 3; ) {
-          var k = P++, T = u[k], L = v[k], C = lt.rays(T, L, r.origin, r.dir);
+        for (var l = n.faces[a], u = [n.points[l[0]], n.points[l[1]], n.points[l[2]]], d = [n.uvs[l[0]], n.uvs[l[1]], n.uvs[l[2]]], p = [m.sub(d[1], d[0]), m.sub(d[2], d[1]), m.sub(d[0], d[2])], _ = [m.sub(u[1], u[0]), m.sub(u[2], u[1]), m.sub(u[0], u[2])], v = _.map(m.normalized), A = _.map(m.norm), I = null, S = null, P = 0; P < 3; ) {
+          var k = P++, T = u[k], O = v[k], C = lt.rays(T, O, r.origin, r.dir);
           if (C != null) {
             var F = C.u0, R = C.u1;
-            F < -rt.EPSILON || F > w[k] + rt.EPSILON || ((I == null || R < I.u) && (I = new vn(R, m.onRay(r.origin, r.dir, R), m.onRay(d[k], p[k], F / w[k]))), (S == null || R > S.u) && (S = new vn(R, m.onRay(r.origin, r.dir, R), m.onRay(d[k], p[k], F / w[k]))));
+            F < -rt.EPSILON || F > A[k] + rt.EPSILON || ((I == null || R < I.u) && (I = new vn(R, m.onRay(r.origin, r.dir, R), m.onRay(d[k], p[k], F / A[k]))), (S == null || R > S.u) && (S = new vn(R, m.onRay(r.origin, r.dir, R), m.onRay(d[k], p[k], F / A[k]))));
           }
         }
         return S == null || I == null ? null : new we(I, S);
@@ -12477,44 +12484,44 @@ var Ah = { exports: {} };
         if (m.dot(u, u) < rt.EPSILON) return null;
         var d = 0, p = Math.abs(u[0]), _ = Math.abs(u[1]), v = Math.abs(u[2]);
         _ > p && (d = 1, p = _), v > p && (d = 2, p = v);
-        var w, I, S, P;
-        d == 0 ? (w = n[1], I = n[2], S = l[1], P = l[2]) : d == 1 ? (w = n[0], I = n[2], S = l[0], P = l[2]) : (w = n[0], I = n[1], S = l[0], P = l[1]);
-        var k = -m.dot(r, n), T = -m.dot(a, l), L = w * P - I * S, C = (I * T - k * P) / L, F = (k * S - w * T) / L, R;
+        var A, I, S, P;
+        d == 0 ? (A = n[1], I = n[2], S = l[1], P = l[2]) : d == 1 ? (A = n[0], I = n[2], S = l[0], P = l[2]) : (A = n[0], I = n[1], S = l[0], P = l[1]);
+        var k = -m.dot(r, n), T = -m.dot(a, l), O = A * P - I * S, C = (I * T - k * P) / O, F = (k * S - A * T) / O, R;
         return d == 0 ? R = [0, C, F] : d == 1 ? R = [C, 0, F] : R = [C, F, 0], new _n(R, m.normalized(u));
       }, lt.threePlanes = function(r, n, a, l, u, d) {
         var p = m.cross(a, u), _ = m.dot(r, p);
         if (Math.abs(_) < rt.EPSILON) return null;
-        var v = m.sub(m.mul(d, a), m.mul(l, u)), w = m.add(m.mul(n, p), m.cross(r, v));
-        return m.mul(1 / _, w);
+        var v = m.sub(m.mul(d, a), m.mul(l, u)), A = m.add(m.mul(n, p), m.cross(r, v));
+        return m.mul(1 / _, A);
       }, lt.polylines = function(r, n, a) {
         for (var l = lt.boundingBoxTrees(new or(r), new or(n), a), u = [], d = 0; d < l.length; ) {
           var p = l[d];
           ++d;
-          var _ = p.item0, v = p.item1, w = lt.segments(r.points[_], r.points[_ + 1], n.points[v], n.points[v + 1], a);
-          w != null && (w.u0 = m.lerp(w.u0, [r.params[_]], [r.params[_ + 1]])[0], w.u1 = m.lerp(w.u1, [n.params[v]], [n.params[v + 1]])[0], u.push(w));
+          var _ = p.item0, v = p.item1, A = lt.segments(r.points[_], r.points[_ + 1], n.points[v], n.points[v + 1], a);
+          A != null && (A.u0 = m.lerp(A.u0, [r.params[_]], [r.params[_ + 1]])[0], A.u1 = m.lerp(A.u1, [n.params[v]], [n.params[v + 1]])[0], u.push(A));
         }
         return u;
       }, lt.segments = function(r, n, a, l, u) {
-        var d = m.sub(n, r), p = Math.sqrt(m.dot(d, d)), _ = m.mul(1 / p, d), v = m.sub(l, a), w = Math.sqrt(m.dot(v, v)), I = m.mul(1 / w, v), S = lt.rays(r, _, a, I);
+        var d = m.sub(n, r), p = Math.sqrt(m.dot(d, d)), _ = m.mul(1 / p, d), v = m.sub(l, a), A = Math.sqrt(m.dot(v, v)), I = m.mul(1 / A, v), S = lt.rays(r, _, a, I);
         if (S != null) {
-          var P = Math.min(Math.max(0, S.u0 / p), 1), k = Math.min(Math.max(0, S.u1 / w), 1), T = m.onRay(r, d, P), L = m.onRay(a, v, k), C = m.distSquared(T, L);
-          if (C < u * u) return new Hr(T, L, P, k);
+          var P = Math.min(Math.max(0, S.u0 / p), 1), k = Math.min(Math.max(0, S.u1 / A), 1), T = m.onRay(r, d, P), O = m.onRay(a, v, k), C = m.distSquared(T, O);
+          if (C < u * u) return new Hr(T, O, P, k);
         }
         return null;
       }, lt.rays = function(r, n, a, l) {
-        var u = m.dot(n, l), d = m.dot(n, a), p = m.dot(n, r), _ = m.dot(l, a), v = m.dot(l, r), w = m.dot(n, n), I = m.dot(l, l), S = w * I - u * u;
+        var u = m.dot(n, l), d = m.dot(n, a), p = m.dot(n, r), _ = m.dot(l, a), v = m.dot(l, r), A = m.dot(n, n), I = m.dot(l, l), S = A * I - u * u;
         if (Math.abs(S) < rt.EPSILON) return null;
-        var P = u * (d - p) - w * (_ - v), k = P / S, T = (d - p + k * u) / w, L = m.onRay(r, n, T), C = m.onRay(a, l, k);
-        return new Hr(L, C, T, k);
+        var P = u * (d - p) - A * (_ - v), k = P / S, T = (d - p + k * u) / A, O = m.onRay(r, n, T), C = m.onRay(a, l, k);
+        return new Hr(O, C, T, k);
       }, lt.segmentWithTriangle = function(r, n, a, l) {
-        var u = a[l[0]], d = a[l[1]], p = a[l[2]], _ = m.sub(d, u), v = m.sub(p, u), w = m.cross(_, v), I = m.sub(n, r), S = m.sub(r, u), P = -m.dot(w, S), k = m.dot(w, I);
+        var u = a[l[0]], d = a[l[1]], p = a[l[2]], _ = m.sub(d, u), v = m.sub(p, u), A = m.cross(_, v), I = m.sub(n, r), S = m.sub(r, u), P = -m.dot(A, S), k = m.dot(A, I);
         if (Math.abs(k) < rt.EPSILON) return null;
         var T = P / k;
         if (T < 0 || T > 1) return null;
-        var L = m.add(r, m.mul(T, I)), C = m.dot(_, v), F = m.dot(_, _), R = m.dot(v, v), U = m.sub(L, u), V = m.dot(U, _), q = m.dot(U, v), J = C * C - F * R;
+        var O = m.add(r, m.mul(T, I)), C = m.dot(_, v), F = m.dot(_, _), R = m.dot(v, v), U = m.sub(O, u), V = m.dot(U, _), q = m.dot(U, v), J = C * C - F * R;
         if (Math.abs(J) < rt.EPSILON) return null;
         var H = (C * q - R * V) / J, G = (C * V - F * q) / J;
-        return H > 1 + rt.EPSILON || G > 1 + rt.EPSILON || G < -rt.EPSILON || H < -rt.EPSILON || H + G > 1 + rt.EPSILON ? null : new Hn(L, H, G, T);
+        return H > 1 + rt.EPSILON || G > 1 + rt.EPSILON || G < -rt.EPSILON || H < -rt.EPSILON || H + G > 1 + rt.EPSILON ? null : new Hn(O, H, G, T);
       }, lt.segmentAndPlane = function(r, n, a, l) {
         var u = m.dot(l, m.sub(n, r));
         if (Math.abs(u) < rt.EPSILON) return null;
@@ -12525,7 +12532,7 @@ var Ah = { exports: {} };
       };
       b["verb.eval.Make"] = pt, pt.__name__ = ["verb", "eval", "Make"], pt.rationalTranslationalSurface = function(r, n) {
         for (var a = N.rationalCurvePoint(n, $.first(n.knots)), l = $.first(n.knots), u = $.last(n.knots), d = 2 * n.controlPoints.length, p = (u - l) / (d - 1), _ = [], v = 0; v < d; ) {
-          var w = v++, I = m.sub(N.rationalCurvePoint(n, l + w * p), a), S = ft.rationalCurveTransform(r, [[1, 0, 0, I[0]], [0, 1, 0, I[1]], [0, 0, 1, I[2]], [0, 0, 0, 1]]);
+          var A = v++, I = m.sub(N.rationalCurvePoint(n, l + A * p), a), S = ft.rationalCurveTransform(r, [[1, 0, 0, I[0]], [0, 1, 0, I[1]], [0, 0, 1, I[2]], [0, 0, 0, 1]]);
           _.push(S);
         }
         return pt.loftedSurface(_);
@@ -12539,9 +12546,9 @@ var Ah = { exports: {} };
         var u;
         a ? u = r.degreeV : u = r.degreeU;
         for (var d = yt.knotMultiplicities(l), p = -1, _ = 0, v = d.length; _ < v; ) {
-          var w = _++;
-          if (Math.abs(n - d[w].knot) < rt.EPSILON) {
-            p = w;
+          var A = _++;
+          if (Math.abs(n - d[A].knot) < rt.EPSILON) {
+            p = A;
             break;
           }
         }
@@ -12551,22 +12558,22 @@ var Ah = { exports: {} };
         I > 0 ? S = ft.surfaceKnotRefine(r, m.rep(I, n), a) : S = r;
         var P = N.knotSpan(u, n, l);
         return Math.abs(n - $.first(l)) < rt.EPSILON ? P = 0 : Math.abs(n - $.last(l)) < rt.EPSILON && (P = (a ? S.controlPoints[0].length : S.controlPoints.length) - 1), a ? new Gt(S.degreeU, S.knotsU, function(k) {
-          for (var T, L = [], C = 0, F = S.controlPoints; C < F.length; ) {
+          for (var T, O = [], C = 0, F = S.controlPoints; C < F.length; ) {
             var R = F[C];
-            ++C, L.push(R[P]);
+            ++C, O.push(R[P]);
           }
-          return T = L, T;
+          return T = O, T;
         }()) : new Gt(S.degreeV, S.knotsV, S.controlPoints[P]);
       }, pt.loftedSurface = function(r, n) {
         r = ft.unifyCurveKnotVectors(r);
         var a = r[0].degree;
         n == null && (n = 3), n > r.length - 1 && (n = r.length - 1);
         for (var l = r[0].knots, u = [], d = [], p = 0, _ = r[0].controlPoints.length; p < _; ) {
-          var v = [p++], w = r.map(/* @__PURE__ */ function(S) {
+          var v = [p++], A = r.map(/* @__PURE__ */ function(S) {
             return function(P) {
               return P.controlPoints[S[0]];
             };
-          }(v)), I = pt.rationalInterpCurve(w, n, !0);
+          }(v)), I = pt.rationalInterpCurve(A, n, !0);
           d.push(I.controlPoints), u = I.knots;
         }
         return new te(a, n, l, u, d);
@@ -12583,8 +12590,8 @@ var Ah = { exports: {} };
       }, pt.fourPointSurface = function(r, n, a, l, u) {
         u == null && (u = 3);
         for (var d = u, p = [], _ = 0, v = u + 1; _ < v; ) {
-          for (var w = _++, I = [], S = 0, P = u + 1; S < P; ) {
-            var k = S++, T = 1 - w / d, L = m.lerp(T, r, n), C = m.lerp(T, l, a), F = m.lerp(1 - k / d, L, C);
+          for (var A = _++, I = [], S = 0, P = u + 1; S < P; ) {
+            var k = S++, T = 1 - A / d, O = m.lerp(T, r, n), C = m.lerp(T, l, a), F = m.lerp(1 - k / d, O, C);
             F.push(1), I.push(F);
           }
           p.push(I);
@@ -12596,15 +12603,15 @@ var Ah = { exports: {} };
         n = m.normalized(n), a = m.normalized(a), u < l && (u = 2 * Math.PI + l);
         var _ = u - l, v = 0;
         _ <= Math.PI / 2 ? v = 1 : _ <= Math.PI ? v = 2 : _ <= 3 * Math.PI / 2 ? v = 3 : v = 4;
-        var w = _ / v, I = Math.cos(w / 2), S = m.add(r, m.add(m.mul(d * Math.cos(l), n), m.mul(p * Math.sin(l), a))), P = m.sub(m.mul(Math.cos(l), a), m.mul(Math.sin(l), n)), k = [], T = m.zeros1d(2 * v + 3), L = 0, C = l, F = m.zeros1d(v * 2);
+        var A = _ / v, I = Math.cos(A / 2), S = m.add(r, m.add(m.mul(d * Math.cos(l), n), m.mul(p * Math.sin(l), a))), P = m.sub(m.mul(Math.cos(l), a), m.mul(Math.sin(l), n)), k = [], T = m.zeros1d(2 * v + 3), O = 0, C = l, F = m.zeros1d(v * 2);
         k[0] = S, F[0] = 1;
         for (var R = 1, U = v + 1; R < U; ) {
           var V = R++;
-          C += w;
+          C += A;
           var q = m.add(r, m.add(m.mul(d * Math.cos(C), n), m.mul(p * Math.sin(C), a)));
-          F[L + 2] = 1, k[L + 2] = q;
+          F[O + 2] = 1, k[O + 2] = q;
           var J = m.sub(m.mul(Math.cos(C), a), m.mul(Math.sin(C), n)), H = lt.rays(S, m.mul(1 / m.norm(P), P), q, m.mul(1 / m.norm(J), J)), G = m.add(S, m.mul(H.u0, P));
-          F[L + 1] = I, k[L + 1] = G, L += 2, V < v && (S = q, P = J);
+          F[O + 1] = I, k[O + 1] = G, O += 2, V < v && (S = q, P = J);
         }
         for (var K = 2 * v + 1, tt = 0; tt < 3; ) {
           var et = tt++;
@@ -12630,12 +12637,12 @@ var Ah = { exports: {} };
           a += m.dist(r[d], r[d + 1]), n.push(a);
         }
         n.push(a), n = m.mul(1 / a, n);
-        for (var p, _ = [], v = 0, w = r.length; v < w; )
+        for (var p, _ = [], v = 0, A = r.length; v < A; )
           v++, _.push(1);
         return p = _, new Gt(1, n, N.homogenize1d(r.slice(0), p));
       }, pt.extrudedSurface = function(r, n, a) {
-        for (var l = [[], [], []], u = [[], [], []], d = N.dehomogenize1d(a.controlPoints), p = N.weight1d(a.controlPoints), _ = m.mul(n, r), v = m.mul(0.5 * n, r), w = 0, I = d.length; w < I; ) {
-          var S = w++;
+        for (var l = [[], [], []], u = [[], [], []], d = N.dehomogenize1d(a.controlPoints), p = N.weight1d(a.controlPoints), _ = m.mul(n, r), v = m.mul(0.5 * n, r), A = 0, I = d.length; A < I; ) {
+          var S = A++;
           l[2][S] = d[S], l[1][S] = m.add(v, d[S]), l[0][S] = m.add(_, d[S]), u[0][S] = p[S], u[1][S] = p[S], u[2][S] = p[S];
         }
         return new te(2, a.degree, [0, 0, 0, 1, 1, 1], a.knots, N.homogenize2d(l, u));
@@ -12645,13 +12652,13 @@ var Ah = { exports: {} };
       }, pt.revolvedSurface = function(r, n, a, l) {
         var u = N.dehomogenize1d(r.controlPoints), d = N.weight1d(r.controlPoints), p, _;
         l <= Math.PI / 2 ? (p = 1, _ = m.zeros1d(6 + 2 * (p - 1))) : l <= Math.PI ? (p = 2, _ = m.zeros1d(6 + 2 * (p - 1)), _[3] = _[4] = 0.5) : l <= 3 * Math.PI / 2 ? (p = 3, _ = m.zeros1d(6 + 2 * (p - 1)), _[3] = _[4] = 0.3333333333333333, _[5] = _[6] = 0.6666666666666666) : (p = 4, _ = m.zeros1d(6 + 2 * (p - 1)), _[3] = _[4] = 0.25, _[5] = _[6] = 0.5, _[7] = _[8] = 0.75);
-        for (var v = l / p, w = 3 + 2 * (p - 1), I = 0; I < 3; ) {
+        for (var v = l / p, A = 3 + 2 * (p - 1), I = 0; I < 3; ) {
           var S = I++;
-          _[S] = 0, _[w + S] = 1;
+          _[S] = 0, _[A + S] = 1;
         }
-        for (var P = Math.cos(v / 2), k = 0, T = m.zeros1d(p + 1), L = m.zeros1d(p + 1), C = m.zeros3d(2 * p + 1, u.length, 3), F = m.zeros2d(2 * p + 1, u.length), R = 1, U = p + 1; R < U; ) {
+        for (var P = Math.cos(v / 2), k = 0, T = m.zeros1d(p + 1), O = m.zeros1d(p + 1), C = m.zeros3d(2 * p + 1, u.length, 3), F = m.zeros2d(2 * p + 1, u.length), R = 1, U = p + 1; R < U; ) {
           var V = R++;
-          k += v, L[V] = Math.cos(k), T[V] = Math.sin(k);
+          k += v, O[V] = Math.cos(k), T[V] = Math.sin(k);
         }
         for (var q = 0, J = u.length; q < J; ) {
           var H = q++, G = Ne.rayClosestPoint(u[H], n, a), K = m.sub(u[H], G), tt = m.norm(K), et = m.cross(a, K);
@@ -12660,8 +12667,8 @@ var Ah = { exports: {} };
           F[0][H] = d[H];
           for (var ht = et, at = 0, ct = 1, nt = p + 1; ct < nt; ) {
             var mt = ct++, X;
-            tt == 0 ? X = G : X = m.add(G, m.add(m.mul(tt * L[mt], K), m.mul(tt * T[mt], et))), C[at + 2][H] = X, F[at + 2][H] = d[H];
-            var gt = m.sub(m.mul(L[mt], et), m.mul(T[mt], K));
+            tt == 0 ? X = G : X = m.add(G, m.add(m.mul(tt * O[mt], K), m.mul(tt * T[mt], et))), C[at + 2][H] = X, F[at + 2][H] = d[H];
+            var gt = m.sub(m.mul(O[mt], et), m.mul(T[mt], K));
             if (tt == 0) C[at + 1][H] = G;
             else {
               var It = lt.rays(it, m.mul(1 / m.norm(ht), ht), X, m.mul(1 / m.norm(gt), gt)), jt = m.add(it, m.mul(It.u0, ht));
@@ -12675,19 +12682,19 @@ var Ah = { exports: {} };
         var u = pt.arc(r, m.mul(-1, n), a, l, 0, Math.PI);
         return pt.revolvedSurface(u, r, n, 2 * Math.PI);
       }, pt.conicalSurface = function(r, n, a, l, u) {
-        var d = 2 * Math.PI, p = 1, _ = [m.add(a, m.mul(l, r)), m.add(a, m.mul(u, n))], v = [0, 0, 1, 1], w = [1, 1], I = new Gt(p, v, N.homogenize1d(_, w));
+        var d = 2 * Math.PI, p = 1, _ = [m.add(a, m.mul(l, r)), m.add(a, m.mul(u, n))], v = [0, 0, 1, 1], A = [1, 1], I = new Gt(p, v, N.homogenize1d(_, A));
         return pt.revolvedSurface(I, a, r, d);
       }, pt.rationalInterpCurve = function(r, n, a, l, u) {
         if (a == null && (a = !1), n == null && (n = 3), r.length < n + 1) throw new Q("You need to supply at least degree + 1 points! You only supplied " + r.length + " points.");
         for (var d = [0], p = 1, _ = r.length; p < _; ) {
-          var v = p++, w = m.norm(m.sub(r[v], r[v - 1])), I = d[d.length - 1];
-          d.push(I + w);
+          var v = p++, A = m.norm(m.sub(r[v], r[v - 1])), I = d[d.length - 1];
+          d.push(I + A);
         }
         for (var S = d[d.length - 1], P = 0, k = d.length; P < k; ) {
           var T = P++;
           d[T] = d[T] / S;
         }
-        var L = m.rep(n + 1, 0), C = l != null && u != null, F;
+        var O = m.rep(n + 1, 0), C = l != null && u != null, F;
         C ? F = 0 : F = 1;
         var R;
         C ? R = d.length - n + 1 : R = d.length - n;
@@ -12696,9 +12703,9 @@ var Ah = { exports: {} };
             var H = J++;
             q += d[V + H];
           }
-          L.push(1 / n * q);
+          O.push(1 / n * q);
         }
-        var G = L.concat(m.rep(n + 1, 1)), K = [], tt;
+        var G = O.concat(m.rep(n + 1, 1)), K = [], tt;
         C ? tt = r.length + 1 : tt = r.length - 1;
         var et;
         C ? et = r.length - (n - 1) : et = r.length - (n + 1);
@@ -12712,8 +12719,8 @@ var Ah = { exports: {} };
           var gt = K[0].length - 2, It = [-1, 1].concat(m.zeros1d(gt)), jt = m.zeros1d(gt).concat([-1, 1]);
           $.spliceAndInsert(K, 1, 0, It), $.spliceAndInsert(K, K.length - 1, 0, jt);
         }
-        for (var Xt = r[0].length, Dt = [], Kt = (1 - G[G.length - n - 2]) / n, Ae = G[n + 1] / n, We = 0; We < Xt; ) {
-          var _e = [We++], ge;
+        for (var Xt = r[0].length, Dt = [], Kt = (1 - G[G.length - n - 2]) / n, Ae = G[n + 1] / n, He = 0; He < Xt; ) {
+          var _e = [He++], ge;
           if (!C) ge = r.map(/* @__PURE__ */ function(Je) {
             return function(dr) {
               return dr[Je[0]];
@@ -12770,8 +12777,8 @@ var Ah = { exports: {} };
           ++_, p.push(new we($.first(v.knots), $.last(v.knots)));
         }
         d = p;
-        for (var w = 0, I = r.length; w < I; ) {
-          var S = w++, P = [d[S].min];
+        for (var A = 0, I = r.length; A < I; ) {
+          var S = A++, P = [d[S].min];
           r[S].knots = r[S].knots.map(/* @__PURE__ */ function(G) {
             return function(K) {
               return K - G[0];
@@ -12782,8 +12789,8 @@ var Ah = { exports: {} };
           return G.max - G.min;
         }), T = z.fold(k, function(G, K) {
           return Math.max(G, K);
-        }, 0), L = 0, C = r.length; L < C; ) {
-          var F = L++, R = [T / k[F]];
+        }, 0), O = 0, C = r.length; O < C; ) {
+          var F = O++, R = [T / k[F]];
           r[F].knots = r[F].knots.map(/* @__PURE__ */ function(G) {
             return function(K) {
               return K * G[0];
@@ -12803,7 +12810,7 @@ var Ah = { exports: {} };
         return r > n ? r : n;
       }, ft.curveElevateDegree = function(r, n) {
         if (n <= r.degree) return r;
-        var a = r.knots.length - r.degree - 2, l = r.degree, u = r.knots, d = r.controlPoints, p = n - r.degree, _ = r.controlPoints[0].length, v = m.zeros2d(l + p + 1, l + 1), w = [], I = [], S = [], P = a + l + 1, k = n, T = Math.floor(k / 2), L = [], C = [];
+        var a = r.knots.length - r.degree - 2, l = r.degree, u = r.knots, d = r.controlPoints, p = n - r.degree, _ = r.controlPoints[0].length, v = m.zeros2d(l + p + 1, l + 1), A = [], I = [], S = [], P = a + l + 1, k = n, T = Math.floor(k / 2), O = [], C = [];
         v[0][0] = 1, v[k][l] = 1;
         for (var F = 1, R = T + 1; F < R; )
           for (var U = F++, V = 1 / Ft.get(k, U), q = ft.imin(l, U), J = ft.imax(0, U - p), H = q + 1; J < H; ) {
@@ -12816,14 +12823,14 @@ var Ah = { exports: {} };
             v[tt][at] = v[k - tt][l - at];
           }
         var ct = k + 1, nt = -1, mt = l, X = l + 1, gt = 1, It = u[0];
-        L[0] = d[0];
+        O[0] = d[0];
         for (var jt = 0, Xt = k + 1; jt < Xt; ) {
           var Dt = jt++;
           C[Dt] = It;
         }
         for (var Kt = 0, Ae = l + 1; Kt < Ae; ) {
-          var We = Kt++;
-          w[We] = d[We];
+          var He = Kt++;
+          A[He] = d[He];
         }
         for (; X < P; ) {
           for (var _e = X; X < P && u[X] == u[X + 1]; ) X = X + 1;
@@ -12837,8 +12844,8 @@ var Ah = { exports: {} };
               Qe[Je - ge - 1] = Ze / (u[mt + Je] - It), Je--;
             for (var dr = 1, Pn = nt + 1; dr < Pn; ) {
               for (var qr = dr++, zh = nt - qr, ci = ge + qr, Xr = l; Xr >= ci; )
-                w[Xr] = m.add(m.mul(Qe[Xr - ci], w[Xr]), m.mul(1 - Qe[Xr - ci], w[Xr - 1])), Xr--;
-              S[zh] = w[l];
+                A[Xr] = m.add(m.mul(Qe[Xr - ci], A[Xr]), m.mul(1 - Qe[Xr - ci], A[Xr - 1])), Xr--;
+              S[zh] = A[l];
             }
           }
           for (var ao = $e, Rh = k + 1; ao < Rh; ) {
@@ -12846,7 +12853,7 @@ var Ah = { exports: {} };
             I[En] = m.zeros1d(_);
             for (var Fh = ft.imin(l, En), oo = ft.imax(0, En - p), Bh = Fh + 1; oo < Bh; ) {
               var lo = oo++;
-              I[En] = m.add(I[En], m.mul(v[En][lo], w[lo]));
+              I[En] = m.add(I[En], m.mul(v[En][lo], A[lo]));
             }
           }
           if (Le > 1)
@@ -12854,7 +12861,7 @@ var Ah = { exports: {} };
               for (var pi = uo++, mr = di, Kr = mi, Br = Kr - ct + 1; Kr - mr > pi; ) {
                 if (mr < gt) {
                   var Uh = (Se - C[mr]) / (It - C[mr]);
-                  L[mr] = m.lerp(Uh, L[mr], L[mr - 1]);
+                  O[mr] = m.lerp(Uh, O[mr], O[mr - 1]);
                 }
                 if (Kr >= $e) {
                   if (Kr - pi <= ct - k + Le) {
@@ -12871,16 +12878,16 @@ var Ah = { exports: {} };
               co++, C[ct] = It, ct = ct + 1;
           for (var mo = $e, jh = lr + 1; mo < jh; ) {
             var Wh = mo++;
-            L[gt] = I[Wh], gt = gt + 1;
+            O[gt] = I[Wh], gt = gt + 1;
           }
           if (X < P) {
             for (var po = 0; po < nt; ) {
               var go = po++;
-              w[go] = S[go];
+              A[go] = S[go];
             }
             for (var fo = nt, Hh = l + 1; fo < Hh; ) {
               var _o = fo++;
-              w[_o] = d[X - l + _o];
+              A[_o] = d[X - l + _o];
             }
             mt = X, X = X + 1, It = Se;
           } else
@@ -12889,12 +12896,12 @@ var Ah = { exports: {} };
               C[ct + qh] = Se;
             }
         }
-        return new Gt(n, C, L);
+        return new Gt(n, C, O);
       }, ft.rationalSurfaceTransform = function(r, n) {
         for (var a = N.dehomogenize2d(r.controlPoints), l = 0, u = a.length; l < u; )
           for (var d = l++, p = 0, _ = a[d].length; p < _; ) {
-            var v = p++, w = a[d][v];
-            w.push(1), a[d][v] = Lt.dot(n, w).slice(0, w.length - 1);
+            var v = p++, A = a[d][v];
+            A.push(1), a[d][v] = Lt.dot(n, A).slice(0, A.length - 1);
           }
         return new te(r.degreeU, r.degreeV, r.knotsU.slice(), r.knotsV.slice(), N.homogenize2d(a, N.weight2d(r.controlPoints)));
       }, ft.rationalCurveTransform = function(r, n) {
@@ -12907,8 +12914,8 @@ var Ah = { exports: {} };
         var l = [], u, d, p;
         a ? (p = r.controlPoints, u = r.knotsV, d = r.degreeV) : (p = Lt.transpose(r.controlPoints), u = r.knotsU, d = r.degreeU);
         for (var _ = null, v = 0; v < p.length; ) {
-          var w = p[v];
-          ++v, _ = ft.curveKnotRefine(new Gt(d, u, w), n), l.push(_.controlPoints);
+          var A = p[v];
+          ++v, _ = ft.curveKnotRefine(new Gt(d, u, A), n), l.push(_.controlPoints);
         }
         var I = _.knots;
         return a ? new te(r.degreeU, r.degreeV, r.knotsU.slice(), I, l) : (l = Lt.transpose(l), new te(r.degreeU, r.degreeV, I, r.knotsV.slice(), l));
@@ -12916,8 +12923,8 @@ var Ah = { exports: {} };
         for (var n = r.degree, a = r.controlPoints, l = r.knots, u = yt.knotMultiplicities(l), d = n + 1, p = 0; p < u.length; ) {
           var _ = u[p];
           if (++p, _.mult < d) {
-            var v = m.rep(d - _.mult, _.knot), w = ft.curveKnotRefine(new Gt(n, l, a), v);
-            l = w.knots, a = w.controlPoints;
+            var v = m.rep(d - _.mult, _.knot), A = ft.curveKnotRefine(new Gt(n, l, a), v);
+            l = A.knots, a = A.controlPoints;
           }
         }
         l.length / d - 1;
@@ -12928,23 +12935,23 @@ var Ah = { exports: {} };
         return S;
       }, ft.curveKnotRefine = function(r, n) {
         if (n.length == 0) return pt.clonedCurve(r);
-        for (var a = r.degree, l = r.controlPoints, u = r.knots, d = l.length - 1, p = d + a + 1, _ = n.length - 1, v = N.knotSpan(a, n[0], u), w = N.knotSpan(a, n[_], u), I = [], S = [], P = 0, k = v - a + 1; P < k; ) {
+        for (var a = r.degree, l = r.controlPoints, u = r.knots, d = l.length - 1, p = d + a + 1, _ = n.length - 1, v = N.knotSpan(a, n[0], u), A = N.knotSpan(a, n[_], u), I = [], S = [], P = 0, k = v - a + 1; P < k; ) {
           var T = P++;
           I[T] = l[T];
         }
-        for (var L = w - 1, C = d + 1; L < C; ) {
-          var F = L++;
+        for (var O = A - 1, C = d + 1; O < C; ) {
+          var F = O++;
           I[F + _ + 1] = l[F];
         }
         for (var R = 0, U = v + 1; R < U; ) {
           var V = R++;
           S[V] = u[V];
         }
-        for (var q = w + a, J = p + 1; q < J; ) {
+        for (var q = A + a, J = p + 1; q < J; ) {
           var H = q++;
           S[H + _ + 1] = u[H];
         }
-        for (var G = w + a - 1, K = w + a + _, tt = _; tt >= 0; ) {
+        for (var G = A + a - 1, K = A + a + _, tt = _; tt >= 0; ) {
           for (; n[tt] <= u[G] && G > v; )
             I[K - a - 1] = l[G - a - 1], S[K] = u[G], K = K - 1, G = G - 1;
           I[K - a - 1] = I[K - a];
@@ -12956,12 +12963,12 @@ var Ah = { exports: {} };
         }
         return new Gt(a, S, I);
       }, ft.curveKnotInsert = function(r, n, a) {
-        for (var l = r.degree, u = r.controlPoints, d = r.knots, p = 0, _ = u.length, v = N.knotSpan(l, n, d), w = [], I = [], S = [], P = 1, k = v + 1; P < k; ) {
+        for (var l = r.degree, u = r.controlPoints, d = r.knots, p = 0, _ = u.length, v = N.knotSpan(l, n, d), A = [], I = [], S = [], P = 1, k = v + 1; P < k; ) {
           var T = P++;
           I[T] = d[T];
         }
-        for (var L = 1, C = a + 1; L < C; ) {
-          var F = L++;
+        for (var O = 1, C = a + 1; O < C; ) {
+          var F = O++;
           I[v + F] = n;
         }
         for (var R = v + 1, U = d.length; R < U; ) {
@@ -12978,20 +12985,20 @@ var Ah = { exports: {} };
         }
         for (var tt = 0, et = l - p + 1; tt < et; ) {
           var it = tt++;
-          w[it] = u[v - l + it];
+          A[it] = u[v - l + it];
         }
         for (var ht = 0, at = 0, ct = 1, nt = a + 1; ct < nt; ) {
           var mt = ct++;
           ht = v - l + mt;
           for (var X = 0, gt = l - mt - p + 1; X < gt; ) {
             var It = X++;
-            at = (n - d[ht + It]) / (d[It + v + 1] - d[ht + It]), w[It] = m.add(m.mul(at, w[It + 1]), m.mul(1 - at, w[It]));
+            at = (n - d[ht + It]) / (d[It + v + 1] - d[ht + It]), A[It] = m.add(m.mul(at, A[It + 1]), m.mul(1 - at, A[It]));
           }
-          S[ht] = w[0], S[v + a - mt - p] = w[l - mt - p];
+          S[ht] = A[0], S[v + a - mt - p] = A[l - mt - p];
         }
         for (var jt = ht + 1, Xt = v - p; jt < Xt; ) {
           var Dt = jt++;
-          S[Dt] = w[Dt - ht];
+          S[Dt] = A[Dt - ht];
         }
         return new Gt(l, I, S);
       };
@@ -13002,8 +13009,8 @@ var Ah = { exports: {} };
       }, zt.rationalCurveRegularSampleRange = function(r, n, a, l, u) {
         l < 1 && (l = 2);
         for (var d = [], p = (a - n) / (l - 1), _ = 0, v = 0; v < l; ) {
-          var w = v++;
-          _ = n + p * w, u ? d.push([_].concat(N.rationalCurvePoint(r, _))) : d.push(N.rationalCurvePoint(r, _));
+          var A = v++;
+          _ = n + p * A, u ? d.push([_].concat(N.rationalCurvePoint(r, _))) : d.push(N.rationalCurvePoint(r, _));
         }
         return d;
       }, zt.rationalCurveAdaptiveSample = function(r, n, a) {
@@ -13018,19 +13025,19 @@ var Ah = { exports: {} };
             return r.controlPoints.map(N.dehomogenize);
         return zt.rationalCurveAdaptiveSampleRange(r, r.knots[0], $.last(r.knots), n, a);
       }, zt.rationalCurveAdaptiveSampleRange = function(r, n, a, l, u) {
-        var d = N.rationalCurvePoint(r, n), p = N.rationalCurvePoint(r, a), _ = 0.5 + 0.2 * Math.random(), v = n + (a - n) * _, w = N.rationalCurvePoint(r, v), I = m.sub(d, p), S = m.sub(d, w);
-        if (m.dot(I, I) < l && m.dot(S, S) > l || !Ne.threePointsAreFlat(d, w, p, l)) {
+        var d = N.rationalCurvePoint(r, n), p = N.rationalCurvePoint(r, a), _ = 0.5 + 0.2 * Math.random(), v = n + (a - n) * _, A = N.rationalCurvePoint(r, v), I = m.sub(d, p), S = m.sub(d, A);
+        if (m.dot(I, I) < l && m.dot(S, S) > l || !Ne.threePointsAreFlat(d, A, p, l)) {
           var P = n + (a - n) * 0.5, k = zt.rationalCurveAdaptiveSampleRange(r, n, P, l, u), T = zt.rationalCurveAdaptiveSampleRange(r, P, a, l, u);
           return k.slice(0, -1).concat(T);
         } else return u ? [[n].concat(d), [a].concat(p)] : [d, p];
       }, zt.rationalSurfaceNaive = function(r, n, a) {
         n < 1 && (n = 1), a < 1 && (a = 1), r.degreeU, r.degreeV, r.controlPoints;
-        for (var l = r.knotsU, u = r.knotsV, d = $.last(l) - l[0], p = $.last(u) - u[0], _ = d / n, v = p / a, w = [], I = [], S = [], P = 0, k = n + 1; P < k; )
-          for (var T = P++, L = 0, C = a + 1; L < C; ) {
-            var F = L++, R = T * _, U = F * v;
+        for (var l = r.knotsU, u = r.knotsV, d = $.last(l) - l[0], p = $.last(u) - u[0], _ = d / n, v = p / a, A = [], I = [], S = [], P = 0, k = n + 1; P < k; )
+          for (var T = P++, O = 0, C = a + 1; O < C; ) {
+            var F = O++, R = T * _, U = F * v;
             I.push([R, U]);
             var V = N.rationalSurfaceDerivatives(r, R, U, 1), q = V[0][0];
-            w.push(q);
+            A.push(q);
             var J = m.normalized(m.cross(V[1][0], V[0][1]));
             S.push(J);
           }
@@ -13039,17 +13046,17 @@ var Ah = { exports: {} };
             var et = tt++, it = K * (a + 1) + et, ht = (K + 1) * (a + 1) + et, at = ht + 1, ct = it + 1, nt = [it, ht, at], mt = [it, at, ct];
             H.push(nt), H.push(mt);
           }
-        return new qe(H, w, S, I);
+        return new qe(H, A, S, I);
       }, zt.divideRationalSurfaceAdaptive = function(r, n) {
         n == null && (n = new Lr()), n.minDivsU != null ? n.minDivsU = n.minDivsU : n.minDivsU = 1, n.minDivsV != null ? n.minDivsU = n.minDivsV : n.minDivsU = 1, n.refine != null ? n.refine = n.refine : n.refine = !0;
         var a = (r.controlPoints.length - 1) * 2, l = (r.controlPoints[0].length - 1) * 2, u;
         n.minDivsU > a ? u = n.minDivsU = n.minDivsU : u = n.minDivsU = a;
         var d;
         n.minDivsV > l ? d = n.minDivsV = n.minDivsV : d = n.minDivsV = l;
-        for (var p = $.last(r.knotsU), _ = r.knotsU[0], v = $.last(r.knotsV), w = r.knotsV[0], I = (p - _) / u, S = (v - w) / d, P = [], k = [], T = 0, L = d + 1; T < L; ) {
+        for (var p = $.last(r.knotsU), _ = r.knotsU[0], v = $.last(r.knotsV), A = r.knotsV[0], I = (p - _) / u, S = (v - A) / d, P = [], k = [], T = 0, O = d + 1; T < O; ) {
           for (var C = T++, F = [], R = 0, U = u + 1; R < U; ) {
-            var V = R++, q = _ + I * V, J = w + S * C, H = N.rationalSurfaceDerivatives(r, q, J, 1), G = m.normalized(m.cross(H[0][1], H[1][0]));
-            F.push(new Ge(H[0][0], G, [q, J], -1, m.isZero(G)));
+            var V = R++, q = _ + I * V, J = A + S * C, H = N.rationalSurfaceDerivatives(r, q, J, 1), G = m.normalized(m.cross(H[0][1], H[1][0]));
+            F.push(new je(H[0][0], G, [q, J], -1, m.isZero(G)));
           }
           k.push(F);
         }
@@ -13093,7 +13100,7 @@ var Ah = { exports: {} };
       var cr = f.core.AdaptiveRefinementNode = function(r, n, a) {
         if (this.srf = r, a == null ? this.neighbors = [null, null, null, null] : this.neighbors = a, this.corners = n, this.corners == null) {
           var l = r.knotsU[0], u = $.last(r.knotsU), d = r.knotsV[0], p = $.last(r.knotsV);
-          this.corners = [Ge.fromUv(l, d), Ge.fromUv(u, d), Ge.fromUv(u, p), Ge.fromUv(l, p)];
+          this.corners = [je.fromUv(l, d), je.fromUv(u, d), je.fromUv(u, p), je.fromUv(l, p)];
         }
       };
       b["verb.eval.AdaptiveRefinementNode"] = cr, cr.__name__ = ["verb", "eval", "AdaptiveRefinementNode"], cr.prototype = {
@@ -13115,7 +13122,7 @@ var Ah = { exports: {} };
         },
         evalSrf: function(r, n, a) {
           var l = N.rationalSurfaceDerivatives(this.srf, r, n, 1), u = l[0][0], d = m.cross(l[0][1], l[1][0]), p = m.isZero(d);
-          return p || (d = m.normalized(d)), a != null ? (a.degen = p, a.point = u, a.normal = d, a) : new Ge(u, d, [r, n], -1, p);
+          return p || (d = m.normalized(d)), a != null ? (a.degen = p, a.point = u, a.normal = d, a) : new je(u, d, [r, n], -1, p);
         },
         getEdgeCorners: function(r) {
           if (this.isLeaf()) return [this.corners[r]];
@@ -13203,8 +13210,8 @@ var Ah = { exports: {} };
               this.children = [new cr(this.srf, d), new cr(this.srf, p)], this.children[0].neighbors = [this.neighbors[0], this.children[1], this.neighbors[2], this.neighbors[3]], this.children[1].neighbors = [this.neighbors[0], this.neighbors[1], this.neighbors[2], this.children[0]];
             }
             for (var _ = 0, v = this.children; _ < v.length; ) {
-              var w = v[_];
-              ++_, w._divide(r, n, !a);
+              var A = v[_];
+              ++_, A._divide(r, n, !a);
             }
           }
         },
@@ -13221,7 +13228,7 @@ var Ah = { exports: {} };
           for (var n = r.points.length, a = [], l = [], u = 0, d = 0; d < 4; ) {
             var p = d++, _ = this.getAllCorners(p);
             _.length == 2 && (u = p + 1);
-            for (var v = 0, w = _.length; v < w; ) {
+            for (var v = 0, A = _.length; v < A; ) {
               var I = v++;
               a.push(_[I]);
             }
@@ -13242,8 +13249,8 @@ var Ah = { exports: {} };
           }
           var T = this.center();
           r.uvs.push(T.uv), r.points.push(T.point), r.normals.push(T.normal);
-          for (var L = r.points.length - 1, C = 0, F = a.length - 1; C < a.length; )
-            r.faces.push([L, l[C], l[F]]), F = C++;
+          for (var O = r.points.length - 1, C = 0, F = a.length - 1; C < a.length; )
+            r.faces.push([O, l[C], l[F]]), F = C++;
           return r;
         },
         __class__: cr
@@ -13307,7 +13314,7 @@ var Ah = { exports: {} };
         __class__: Sn
       };
       var Tt = f.geom.NurbsCurve = function(r) {
-        this._data = je.isValidNurbsCurveData(r);
+        this._data = We.isValidNurbsCurveData(r);
       };
       b["verb.geom.NurbsCurve"] = Tt, Tt.__name__ = ["verb", "geom", "NurbsCurve"], Tt.__interfaces__ = [Sn], Tt.byKnotsControlPointsWeights = function(r, n, a, l) {
         return new Tt(new Gt(r, n.slice(), N.homogenize1d(a, l)));
@@ -13473,7 +13480,7 @@ var Ah = { exports: {} };
         __class__: In
       };
       var Pt = f.geom.NurbsSurface = function(r) {
-        this._data = je.isValidNurbsSurfaceData(r);
+        this._data = We.isValidNurbsSurfaceData(r);
       };
       b["verb.geom.NurbsSurface"] = Pt, Pt.__name__ = ["verb", "geom", "NurbsSurface"], Pt.__interfaces__ = [In], Pt.byKnotsControlPointsWeights = function(r, n, a, l, u, d) {
         return new Pt(new te(r, n, a, l, N.homogenize2d(u, d)));
@@ -13762,7 +13769,7 @@ var Ah = { exports: {} };
       });
       function Ke(r) {
         return r instanceof Array ? function() {
-          return O.iter(r);
+          return L.iter(r);
         } : typeof r.iterator == "function" ? Ce(r, r.iterator) : r.iterator;
       }
       var li, Ch = 0;
@@ -13793,9 +13800,9 @@ var Ah = { exports: {} };
         }
         return n;
       });
-      var hi = {}, Ls = A.ArrayBuffer || ae;
-      Ls.prototype.slice == null && (Ls.prototype.slice = ae.sliceImpl), A.DataView;
-      var ui = A.Uint8Array || sr._new;
+      var hi = {}, Ls = w.ArrayBuffer || ae;
+      Ls.prototype.slice == null && (Ls.prototype.slice = ae.sliceImpl), w.DataView;
+      var ui = w.Uint8Array || sr._new;
       (function(r, n) {
         if (r.setImmediate)
           return;
@@ -13809,9 +13816,9 @@ var Ah = { exports: {} };
             typeof R == "function" ? R.apply(n, U) : new Function("" + R)();
           };
         }
-        function w(R) {
+        function A(R) {
           if (u)
-            setTimeout(v(w, R), 0);
+            setTimeout(v(A, R), 0);
           else {
             var U = l[R];
             if (U) {
@@ -13830,7 +13837,7 @@ var Ah = { exports: {} };
         function S() {
           p = function() {
             var R = _(arguments);
-            return process.nextTick(v(w, R)), R;
+            return process.nextTick(v(A, R)), R;
           };
         }
         function P() {
@@ -13843,7 +13850,7 @@ var Ah = { exports: {} };
         }
         function k() {
           var R = "setImmediate$" + Math.random() + "$", U = function(V) {
-            V.source === r && typeof V.data == "string" && V.data.indexOf(R) === 0 && w(+V.data.slice(R.length));
+            V.source === r && typeof V.data == "string" && V.data.indexOf(R) === 0 && A(+V.data.slice(R.length));
           };
           r.addEventListener ? r.addEventListener("message", U, !1) : r.attachEvent("onmessage", U), p = function() {
             var V = _(arguments);
@@ -13854,29 +13861,29 @@ var Ah = { exports: {} };
           var R = new MessageChannel();
           R.port1.onmessage = function(U) {
             var V = U.data;
-            w(V);
+            A(V);
           }, p = function() {
             var U = _(arguments);
             return R.port2.postMessage(U), U;
           };
         }
-        function L() {
+        function O() {
           var R = d.documentElement;
           p = function() {
             var U = _(arguments), V = d.createElement("script");
             return V.onreadystatechange = function() {
-              w(U), V.onreadystatechange = null, R.removeChild(V), V = null;
+              A(U), V.onreadystatechange = null, R.removeChild(V), V = null;
             }, R.appendChild(V), U;
           };
         }
         function C() {
           p = function() {
             var R = _(arguments);
-            return setTimeout(v(w, R), 0), R;
+            return setTimeout(v(A, R), 0), R;
           };
         }
         var F = Object.getPrototypeOf && Object.getPrototypeOf(r);
-        F = F && F.setTimeout ? F : r, {}.toString.call(r.process) === "[object process]" ? S() : P() ? k() : r.MessageChannel ? T() : d && "onreadystatechange" in d.createElement("script") ? L() : C(), F.setImmediate = p, F.clearImmediate = I;
+        F = F && F.setTimeout ? F : r, {}.toString.call(r.process) === "[object process]" ? S() : P() ? k() : r.MessageChannel ? T() : d && "onreadystatechange" in d.createElement("script") ? O() : C(), F.setImmediate = p, F.clearImmediate = I;
       })(new Function("return this")()), qt.USE_CACHE = !1, qt.USE_ENUM_INDEX = !1, qt.BASE64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789%:", Wt.DEFAULT_RESOLVER = ut, Wt.BASE64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789%:", Ot.count = 0, ie.i64tmp = function(r) {
         var n, a = new Vt(0, 0);
         return n = a, n;
@@ -13999,14 +14006,14 @@ class Md extends Ts {
     const c = (h - (this._closed ? 0 : 1)) * t;
     let g = Math.floor(c), x = c - g;
     this._closed ? g += g > 0 ? 0 : (Math.floor(Math.abs(g) / h) + 1) * h : x === 0 && g === h - 1 && (g = h - 2, x = 1);
-    let f, A;
+    let f, w;
     this._closed || g > 0 ? f = o[(g - 1) % h] : (this._tmp.subVectors(o[0], o[1]).add(o[0]), f = new Y(this._tmp.x, this._tmp.y, this._tmp.z));
     const b = o[g % h], E = o[(g + 1) % h];
-    if (this._closed || g + 2 < h ? A = o[(g + 2) % h] : (this._tmp.subVectors(o[h - 1], o[h - 2]).add(o[h - 1]), A = new Y(this._tmp.x, this._tmp.y, this._tmp.z)), this._curveType === "centripetal" || this._curveType === "chordal") {
+    if (this._closed || g + 2 < h ? w = o[(g + 2) % h] : (this._tmp.subVectors(o[h - 1], o[h - 2]).add(o[h - 1]), w = new Y(this._tmp.x, this._tmp.y, this._tmp.z)), this._curveType === "centripetal" || this._curveType === "chordal") {
       const M = this._curveType === "chordal" ? 0.5 : 0.25;
-      let O = Math.pow(f.distanceToSquared(b), M), z = Math.pow(b.distanceToSquared(E), M), D = Math.pow(E.distanceToSquared(A), M);
-      z < 1e-4 && (z = 1), O < 1e-4 && (O = z), D < 1e-4 && (D = z), this._px.initNonuniformCatmullRom(f.x, b.x, E.x, A.x, O, z, D), this._py.initNonuniformCatmullRom(f.y, b.y, E.y, A.y, O, z, D), this._pz.initNonuniformCatmullRom(f.z, b.z, E.z, A.z, O, z, D);
-    } else this._curveType === "catmullrom" && (this._px.initCatmullRom(f.x, b.x, E.x, A.x, this._tension), this._py.initCatmullRom(f.y, b.y, E.y, A.y, this._tension), this._pz.initCatmullRom(f.z, b.z, E.z, A.z, this._tension));
+      let L = Math.pow(f.distanceToSquared(b), M), z = Math.pow(b.distanceToSquared(E), M), D = Math.pow(E.distanceToSquared(w), M);
+      z < 1e-4 && (z = 1), L < 1e-4 && (L = z), D < 1e-4 && (D = z), this._px.initNonuniformCatmullRom(f.x, b.x, E.x, w.x, L, z, D), this._py.initNonuniformCatmullRom(f.y, b.y, E.y, w.y, L, z, D), this._pz.initNonuniformCatmullRom(f.z, b.z, E.z, w.z, L, z, D);
+    } else this._curveType === "catmullrom" && (this._px.initCatmullRom(f.x, b.x, E.x, w.x, this._tension), this._py.initCatmullRom(f.y, b.y, E.y, w.y, this._tension), this._pz.initCatmullRom(f.z, b.z, E.z, w.z, this._tension));
     return s.set(
       this._px.calc(x),
       this._py.calc(x),
@@ -14214,11 +14221,11 @@ class mn extends Ts {
       let g, x = 3, f = !1;
       if (c >= 3 && (Array.isArray(s) ? (g = s, c >= 4 && (x = o || 3), c >= 5 && (f = h)) : s !== void 0 && (x = s || 3, c >= 4 && (f = o))), s === void 0 && c >= 4 && (x = o || 3, c >= 5 && (f = h)), this._degree = x, this._closed = f, this._controlPoints.length < this._degree + 1)
         throw Ye.ILLEGAL_PARAMETERS;
-      const A = this.toVerbPoints(this._controlPoints);
+      const w = this.toVerbPoints(this._controlPoints);
       this._nurbsCurve = Nn.geom.NurbsCurve.byKnotsControlPointsWeights(
         this._degree,
         e,
-        A,
+        w,
         g
       );
     } else {
@@ -14327,7 +14334,7 @@ class mn extends Ts {
   getPoints(t = 100) {
     const e = this._nurbsCurve, s = [], o = e.knots(), h = this._nurbsCurve.degree(), c = o[h], g = o[o.length - h - 1], x = (g - c) / (t - 1);
     for (let f = 0; f < t; f++) {
-      const A = f === t - 1 ? g : c + f * x, b = e.point(A);
+      const w = f === t - 1 ? g : c + f * x, b = e.point(w);
       s.push(new Y(b[0], b[1], b[2]));
     }
     return s;
@@ -15071,9 +15078,9 @@ const Ia = class Ia extends ke {
    */
   constructor(t, e, s = 0, o = !1, h = 0, c = 0, g = null) {
     super(), this._polyType = t, this._elevation = s;
-    const x = g && (g == null ? void 0 : g.length) === e.length, f = e.map((A, b) => ({
-      x: A.x,
-      y: A.y,
+    const x = g && (g == null ? void 0 : g.length) === e.length, f = e.map((w, b) => ({
+      x: w.x,
+      y: w.y,
       bulge: x ? g[b] : void 0
     }));
     this._geo = new Rn(f, o);
@@ -18123,12 +18130,12 @@ const Fa = class Fa extends Ee {
     return new Ct();
   }
   /**
-   * Returns the full property definition for this ray entity, including
+   * Returns the full property definition for this mtext entity, including
    * general group and geometry group.
    *
    * The geometry group exposes editable start/end coordinates via
    * {@link AcDbPropertyAccessor} so the property palette can update
-   * the ray in real-time.
+   * the mtext in real-time.
    *
    * Each property is an {@link AcDbEntityRuntimeProperty}.
    */
@@ -18652,9 +18659,9 @@ const Rd = /* @__PURE__ */ new Z(), Da = class Da extends ti {
       s += E > 0 ? this.columnWidth(E - 1) : 0, e = 0;
       for (let M = 0; M < this.numRows; M++) {
         e += M > 0 ? this.rowHeight(M - 1) : 0;
-        const O = this.cell(M * this.numColumns + E);
-        if (f = M * this.numColumns + E, O && !x[f]) {
-          const z = O.borderWidth ?? 1, D = O.borderHeight ?? 1;
+        const L = this.cell(M * this.numColumns + E);
+        if (f = M * this.numColumns + E, L && !x[f]) {
+          const z = L.borderWidth ?? 1, D = L.borderHeight ?? 1;
           this.fillVisited(
             x,
             f,
@@ -18665,20 +18672,20 @@ const Rd = /* @__PURE__ */ new Z(), Da = class Da extends ti {
           const B = h[o[c - 1] * 3] - s, dt = E + (M + D) * (this.numColumns + 1) + z;
           E + z == this.numColumns && (o[c++] = E + M * (this.numColumns + 1) + z, o[c++] = dt);
           const vt = -h[dt * 3 + 1] - e;
-          if (M + D == this.numRows && (o[c++] = E + (M + D) * (this.numColumns + 1) + D, o[c++] = E + (M + D) * (this.numColumns + 1)), o[c++] = E + (M + D) * (this.numColumns + 1), o[c++] = E + M * (this.numColumns + 1), O.text) {
-            const ot = O.attachmentPoint || this.attachmentPoint || Pe.MiddleCenter, W = this.getTableTextOffset(
+          if (M + D == this.numRows && (o[c++] = E + (M + D) * (this.numColumns + 1) + D, o[c++] = E + (M + D) * (this.numColumns + 1)), o[c++] = E + (M + D) * (this.numColumns + 1), o[c++] = E + M * (this.numColumns + 1), L.text) {
+            const ot = L.attachmentPoint || this.attachmentPoint || Pe.MiddleCenter, W = this.getTableTextOffset(
               ot,
               B,
               vt
             ), ut = {
-              text: O.text,
-              height: O.textHeight,
+              text: L.text,
+              height: L.textHeight,
               width: B,
               position: Rd.set(s, -e, 0).clone().add(W),
               rotation: this.rotation,
               attachmentPoint: ot
             }, st = {
-              ...this.getTextStyle(O),
+              ...this.getTextStyle(L),
               color: this.color.color
             };
             g.push(t.mtext(ut, st));
@@ -18687,8 +18694,8 @@ const Rd = /* @__PURE__ */ new Z(), Da = class Da extends ti {
       }
     }
     g.push(t.lineSegments(h, 3, o, this.lineStyle));
-    const A = t.group(g), b = new un();
-    return b.setFromAxisAngle(Z.Z_AXIS, this.rotation), Ro.compose(this.position, b, this.scaleFactors), A.applyMatrix(Ro), this.attachEntityInfo(A), A;
+    const w = t.group(g), b = new un();
+    return b.setFromAxisAngle(Z.Z_AXIS, this.rotation), Ro.compose(this.position, b, this.scaleFactors), w.applyMatrix(Ro), this.attachEntityInfo(w), w;
   }
   /**
    * Marks cells as visited to handle merged cell rendering.
@@ -19095,6 +19102,133 @@ const Ua = class Ua extends Ee {
   get geometricExtents() {
     return new Ct();
   }
+  /**
+   * Returns the full property definition for this text entity, including
+   * general group and geometry group.
+   *
+   * The geometry group exposes editable start/end coordinates via
+   * {@link AcDbPropertyAccessor} so the property palette can update
+   * the text in real-time.
+   *
+   * Each property is an {@link AcDbEntityRuntimeProperty}.
+   */
+  get properties() {
+    return {
+      type: this.type,
+      groups: [
+        this.getGeneralProperties(),
+        {
+          groupName: "text",
+          properties: [
+            {
+              name: "contents",
+              type: "string",
+              editable: !0,
+              accessor: {
+                get: () => this.textString,
+                set: (t) => {
+                  this.textString = t;
+                }
+              }
+            },
+            {
+              name: "styleName",
+              type: "string",
+              editable: !0,
+              accessor: {
+                get: () => this.styleName,
+                set: (t) => {
+                  this.styleName = t;
+                }
+              }
+            },
+            {
+              name: "textHeight",
+              type: "float",
+              editable: !0,
+              accessor: {
+                get: () => this.height,
+                set: (t) => {
+                  this.height = t;
+                }
+              }
+            },
+            {
+              name: "rotation",
+              type: "float",
+              editable: !0,
+              accessor: {
+                get: () => this.rotation,
+                set: (t) => {
+                  this.rotation = t;
+                }
+              }
+            },
+            {
+              name: "widthFactor",
+              type: "float",
+              editable: !0,
+              accessor: {
+                get: () => this.widthFactor,
+                set: (t) => {
+                  this.widthFactor = t;
+                }
+              }
+            },
+            {
+              name: "oblique",
+              type: "float",
+              editable: !0,
+              accessor: {
+                get: () => this.oblique,
+                set: (t) => {
+                  this.oblique = t;
+                }
+              }
+            }
+          ]
+        },
+        {
+          groupName: "geometry",
+          properties: [
+            {
+              name: "positionX",
+              type: "float",
+              editable: !0,
+              accessor: {
+                get: () => this.position.x,
+                set: (t) => {
+                  this.position.x = t;
+                }
+              }
+            },
+            {
+              name: "positionY",
+              type: "float",
+              editable: !0,
+              accessor: {
+                get: () => this.position.y,
+                set: (t) => {
+                  this.position.y = t;
+                }
+              }
+            },
+            {
+              name: "positionZ",
+              type: "float",
+              editable: !0,
+              accessor: {
+                get: () => this.position.z,
+                set: (t) => {
+                  this.position.z = t;
+                }
+              }
+            }
+          ]
+        }
+      ]
+    };
+  }
   /**
    * Gets the text style for this text entity.
    *
@@ -22190,8 +22324,8 @@ class Do {
     }), e.hatchStyle = t.hatchStyle, e.patternName = t.patternName, e.patternType = t.patternType, e.patternAngle = t.patternAngle == null ? 0 : t.patternAngle, e.patternScale = t.patternScale == null ? 0 : t.patternScale, t.boundaryPaths.forEach((h) => {
       if (h.boundaryPathTypeFlag & 2) {
         const g = h, x = new Rn();
-        x.closed = g.isClosed, g.vertices.forEach((f, A) => {
-          x.addVertexAt(A, {
+        x.closed = g.isClosed, g.vertices.forEach((f, w) => {
+          x.addVertexAt(w, {
             x: f.x,
             y: f.y,
             bulge: f.bulge
@@ -22201,59 +22335,59 @@ class Do {
         const g = h, x = new Pd();
         g.edges.forEach((f) => {
           if (f.type == 1) {
-            const A = f;
-            x.add(new ya(A.start, A.end));
+            const w = f;
+            x.add(new ya(w.start, w.end));
           } else if (f.type == 2) {
-            const A = f;
+            const w = f;
             x.add(
               new Ps(
-                A.center,
-                A.radius,
-                kt.degToRad(A.startAngle || 0),
-                kt.degToRad(A.endAngle || 0),
-                !A.isCCW
+                w.center,
+                w.radius,
+                kt.degToRad(w.startAngle || 0),
+                kt.degToRad(w.endAngle || 0),
+                !w.isCCW
               )
             );
           } else if (f.type == 3) {
-            const A = f;
-            new Zt().subVectors(A.end, A.center);
+            const w = f;
+            new Zt().subVectors(w.end, w.center);
             const E = Math.sqrt(
-              Math.pow(A.end.x, 2) + Math.pow(A.end.y, 2)
-            ), M = E * A.lengthOfMinorAxis;
-            let O = kt.degToRad(A.startAngle || 0), z = kt.degToRad(A.endAngle || 0);
-            const D = Math.atan2(A.end.y, A.end.x);
-            A.isCCW || (O = Math.PI * 2 - O, z = Math.PI * 2 - z), x.add(
+              Math.pow(w.end.x, 2) + Math.pow(w.end.y, 2)
+            ), M = E * w.lengthOfMinorAxis;
+            let L = kt.degToRad(w.startAngle || 0), z = kt.degToRad(w.endAngle || 0);
+            const D = Math.atan2(w.end.y, w.end.x);
+            w.isCCW || (L = Math.PI * 2 - L, z = Math.PI * 2 - z), x.add(
               new _a(
-                { ...A.center, z: 0 },
+                { ...w.center, z: 0 },
                 E,
                 M,
-                O,
+                L,
                 z,
-                !A.isCCW,
+                !w.isCCW,
                 D
               )
             );
           } else if (f.type == 4) {
-            const A = f;
-            if (A.numberOfControlPoints > 0 && A.numberOfKnots > 0) {
-              const b = A.controlPoints.map(
-                (O) => ({
-                  x: O.x,
-                  y: O.y,
+            const w = f;
+            if (w.numberOfControlPoints > 0 && w.numberOfKnots > 0) {
+              const b = w.controlPoints.map(
+                (L) => ({
+                  x: L.x,
+                  y: L.y,
                   z: 0
                 })
               );
               let E = !0;
-              const M = A.controlPoints.map((O) => (O.weight == null && (E = !1), O.weight || 1));
+              const M = w.controlPoints.map((L) => (L.weight == null && (E = !1), L.weight || 1));
               x.add(
                 new mn(
                   b,
-                  A.knots,
+                  w.knots,
                   E ? M : void 0
                 )
               );
-            } else if (A.numberOfFitData > 0) {
-              const b = A.fitDatum.map((E) => ({
+            } else if (w.numberOfFitData > 0) {
+              const b = w.fitDatum.map((E) => ({
                 x: E.x,
                 y: E.y,
                 z: 0
@@ -22430,128 +22564,351 @@ class Do {
     return h;
   }
 }
-class ba extends pn {
+class Fn extends pn {
   /**
-   * Creates a new AcDbLayout instance.
+   * Creates a new AcDbSymbolTableRecord instance.
+   *
+   * @param attrs - Input attribute values for this symbol table record
+   * @param defaultAttrs - Default values for attributes of this symbol table record
    *
    * @example
    * ```typescript
-   * const layout = new AcDbLayout();
+   * const record = new AcDbSymbolTableRecord({ name: 'MyRecord' });
    * ```
    */
-  constructor() {
-    super(), this._tabOrder = -1, this._tabSelected = !1, this._blockTableRecordId = "", this._layoutName = "", this._limits = new be(), this._extents = new Ct();
+  constructor(t, e) {
+    t = t || {}, ks(t, { name: "" }), super(t, e);
   }
   /**
-   * Gets the user-friendly layout name that is displayed in the tab control.
+   * Gets or sets the name of the symbol table record.
    *
-   * Currently there is no restriction on the name except that the length
-   * is limited to 256 characters.
+   * This property corresponds to DXF group code 2 and is used for
+   * identifying and referencing the symbol table record.
    *
-   * @returns The layout name
+   * @returns The name of the symbol table record
    *
    * @example
    * ```typescript
-   * const name = layout.layoutName;
-   * console.log('Layout name:', name);
+   * const recordName = record.name;
+   * record.name = 'NewRecordName';
    * ```
    */
-  get layoutName() {
-    return this._layoutName;
+  get name() {
+    return this.getAttr("name");
+  }
+  set name(t) {
+    this.setAttr("name", t);
   }
+}
+const jr = class jr extends Fn {
   /**
-   * Sets the user-friendly layout name that is displayed in the tab control.
+   * Returns true if the specified name is the name of the model space block table record.
    *
-   * @param value - The new layout name (limited to 256 characters)
+   * Model space is the primary drawing area where most entities are created.
+   *
+   * @param name - The name of one block table record.
+   * @returns True if the specified name is the name of the model space block table record.
    *
    * @example
    * ```typescript
-   * layout.layoutName = 'A4 Landscape';
+   * if (AcDbBlockTableRecord.isModelSapceName('*Model_Space')) {
+   *   console.log('This is the name of the model space block table record.');
+   * }
    * ```
    */
-  set layoutName(t) {
-    this._layoutName = t.length > 256 ? t.slice(0, 256) : t;
+  static isModelSapceName(t) {
+    return t.toLowerCase() == jr.MODEL_SPACE_NAME.toLowerCase();
   }
   /**
-   * Gets the tab order field, which controls the order in which layouts are displayed.
+   * Returns true if the specified name is the name of a paper space block table record.
    *
-   * The tab order should be unique and sequential for each layout in the database.
+   * Paper space is used for creating layouts for printing and plotting.
    *
-   * @returns The tab order value
+   * @param name - The name of one block table record.
+   * @returns True if the specified name is the name of a paper space block table record.
    *
    * @example
    * ```typescript
-   * const order = layout.tabOrder;
+   * if (AcDbBlockTableRecord.isPaperSapceName('*Paper_Space1')) {
+   *   console.log('This is the name of the paper space block table record.');
+   * }
    * ```
    */
-  get tabOrder() {
-    return this._tabOrder;
+  static isPaperSapceName(t) {
+    return t.toLowerCase().startsWith(jr.PAPER_SPACE_NAME_PREFIX.toLowerCase());
   }
   /**
-   * Sets the tab order field, which controls the order in which layouts are displayed.
-   *
-   * @param value - The new tab order value
+   * Creates a new AcDbBlockTableRecord instance.
    *
    * @example
    * ```typescript
-   * layout.tabOrder = 1;
+   * const blockRecord = new AcDbBlockTableRecord();
    * ```
    */
-  set tabOrder(t) {
-    this._tabOrder = t;
+  constructor() {
+    super(), this._origin = new Y(), this._layoutId = "", this._entities = /* @__PURE__ */ new Map();
   }
   /**
-   * Gets whether the layout tab is included in the selection set for operations.
+   * Returns true if this is a model space block table record.
    *
-   * This flag indicates whether the layout tab is included in the selection set
-   * for operations that affect multiple tabs. The user can perform multiple
-   * selection via the user interface using shift-click.
+   * Model space is the primary drawing area where most entities are created.
    *
-   * @returns True if the tab is selected, false otherwise
+   * @returns True if this is a model space block table record
    *
    * @example
    * ```typescript
-   * const isSelected = layout.tabSelected;
+   * if (blockRecord.isModelSapce) {
+   *   console.log('This is model space');
+   * }
    * ```
    */
-  get tabSelected() {
-    return this._tabSelected;
+  get isModelSapce() {
+    return jr.isModelSapceName(this.name);
   }
   /**
-   * Sets whether the layout tab is included in the selection set for operations.
+   * Returns true if this is a paper space block table record.
    *
-   * @param value - True to select the tab, false to deselect it
+   * Paper space is used for creating layouts for printing and plotting.
+   *
+   * @returns True if this is a paper space block table record
    *
    * @example
    * ```typescript
-   * layout.tabSelected = true;
+   * if (blockRecord.isPaperSapce) {
+   *   console.log('This is paper space');
+   * }
    * ```
    */
-  set tabSelected(t) {
-    this._tabSelected = t;
+  get isPaperSapce() {
+    return jr.isPaperSapceName(this.name);
   }
   /**
-   * Gets the associated block table record ID of this layout.
+   * Gets or sets the base point of the block in WCS coordinates.
    *
-   * @returns The block table record ID
+   * This point is the origin of the MCS (Model Coordinate System), which is the
+   * local WCS for the entities within the block table record.
+   *
+   * @returns The origin point of the block
    *
    * @example
    * ```typescript
-   * const blockId = layout.blockTableRecordId;
+   * const origin = blockRecord.origin;
+   * blockRecord.origin = new AcGePoint3d(10, 20, 0);
    * ```
    */
-  get blockTableRecordId() {
-    return this._blockTableRecordId;
+  get origin() {
+    return this._origin;
+  }
+  set origin(t) {
+    this._origin.copy(t);
   }
   /**
-   * Sets the associated block table record ID of this layout.
+   * Gets or sets the object ID of the associated AcDbLayout object in the Layouts dictionary.
    *
-   * @param value - The new block table record ID
+   * This property links the block table record to its corresponding layout object,
+   * which defines the viewport configuration and display settings for the block.
+   * For model space blocks, this is typically empty, while paper space blocks
+   * have a corresponding layout ID.
+   *
+   * @returns The object ID of the associated layout
    *
    * @example
    * ```typescript
-   * layout.blockTableRecordId = 'some-block-id';
-   * ```
+   * const layoutId = blockRecord.layoutId;
+   * blockRecord.layoutId = 'some-layout-object-id';
+   * ```
+   */
+  get layoutId() {
+    return this._layoutId;
+  }
+  set layoutId(t) {
+    this._layoutId = t;
+  }
+  /**
+   * Appends the specified entity or entities to this block table record.
+   *
+   * This method adds an entity to the block and sets up the necessary
+   * relationships between the entity and the block table record.
+   *
+   * @param entity - The entity or entities to append to this block table record
+   *
+   * @example
+   * ```typescript
+   * const line = new AcDbLine();
+   * blockRecord.appendEntity(line);
+   * ```
+   */
+  appendEntity(t) {
+    if (Array.isArray(t))
+      for (let e = 0; e < t.length; ++e) {
+        const s = t[e];
+        s.database = this.database, s.ownerId = this.objectId, this._entities.set(s.objectId, s);
+      }
+    else
+      t.database = this.database, t.ownerId = this.objectId, this._entities.set(t.objectId, t);
+    (this.isModelSapce || this.isPaperSapce) && this.database.events.entityAppended.dispatch({
+      database: this.database,
+      entity: t
+    });
+  }
+  /**
+   * Creates an iterator object that can be used to iterate over the entities in the block table record.
+   *
+   * @returns An iterator object that can be used to iterate over the entities
+   *
+   * @example
+   * ```typescript
+   * const iterator = blockRecord.newIterator();
+   * for (const entity of iterator) {
+   *   console.log('Entity:', entity.type);
+   * }
+   * ```
+   */
+  newIterator() {
+    return new ua(this._entities);
+  }
+  /**
+   * Searches for an entity in this block table record with the specified ID.
+   *
+   * @param id - The entity ID to search for
+   * @returns The entity with the specified ID, or undefined if not found
+   *
+   * @example
+   * ```typescript
+   * const entity = blockRecord.getIdAt('some-entity-id');
+   * if (entity) {
+   *   console.log('Found entity:', entity.type);
+   * }
+   * ```
+   */
+  getIdAt(t) {
+    return this._entities.get(t);
+  }
+};
+jr.MODEL_SPACE_NAME = "*MODEL_SPACE", jr.PAPER_SPACE_NAME_PREFIX = "*PAPER_SPACE";
+let Ge = jr;
+class ba extends pn {
+  /**
+   * Creates a new AcDbLayout instance.
+   *
+   * @example
+   * ```typescript
+   * const layout = new AcDbLayout();
+   * ```
+   */
+  constructor() {
+    super(), this._tabOrder = -1, this._tabSelected = !1, this._blockTableRecordId = "", this._layoutName = "", this._limits = new be(), this._extents = new Ct();
+  }
+  /**
+   * Gets the user-friendly layout name that is displayed in the tab control.
+   *
+   * Currently there is no restriction on the name except that the length
+   * is limited to 256 characters.
+   *
+   * @returns The layout name
+   *
+   * @example
+   * ```typescript
+   * const name = layout.layoutName;
+   * console.log('Layout name:', name);
+   * ```
+   */
+  get layoutName() {
+    return this._layoutName;
+  }
+  /**
+   * Sets the user-friendly layout name that is displayed in the tab control.
+   *
+   * @param value - The new layout name (limited to 256 characters)
+   *
+   * @example
+   * ```typescript
+   * layout.layoutName = 'A4 Landscape';
+   * ```
+   */
+  set layoutName(t) {
+    this._layoutName = t.length > 256 ? t.slice(0, 256) : t;
+  }
+  /**
+   * Gets the tab order field, which controls the order in which layouts are displayed.
+   *
+   * The tab order should be unique and sequential for each layout in the database.
+   *
+   * @returns The tab order value
+   *
+   * @example
+   * ```typescript
+   * const order = layout.tabOrder;
+   * ```
+   */
+  get tabOrder() {
+    return this._tabOrder;
+  }
+  /**
+   * Sets the tab order field, which controls the order in which layouts are displayed.
+   *
+   * @param value - The new tab order value
+   *
+   * @example
+   * ```typescript
+   * layout.tabOrder = 1;
+   * ```
+   */
+  set tabOrder(t) {
+    this._tabOrder = t;
+  }
+  /**
+   * Gets whether the layout tab is included in the selection set for operations.
+   *
+   * This flag indicates whether the layout tab is included in the selection set
+   * for operations that affect multiple tabs. The user can perform multiple
+   * selection via the user interface using shift-click.
+   *
+   * @returns True if the tab is selected, false otherwise
+   *
+   * @example
+   * ```typescript
+   * const isSelected = layout.tabSelected;
+   * ```
+   */
+  get tabSelected() {
+    return this._tabSelected;
+  }
+  /**
+   * Sets whether the layout tab is included in the selection set for operations.
+   *
+   * @param value - True to select the tab, false to deselect it
+   *
+   * @example
+   * ```typescript
+   * layout.tabSelected = true;
+   * ```
+   */
+  set tabSelected(t) {
+    this._tabSelected = t;
+  }
+  /**
+   * Gets the associated block table record ID of this layout.
+   *
+   * @returns The block table record ID
+   *
+   * @example
+   * ```typescript
+   * const blockId = layout.blockTableRecordId;
+   * ```
+   */
+  get blockTableRecordId() {
+    return this._blockTableRecordId;
+  }
+  /**
+   * Sets the associated block table record ID of this layout.
+   *
+   * @param value - The new block table record ID
+   *
+   * @example
+   * ```typescript
+   * layout.blockTableRecordId = 'some-block-id';
+   * ```
    */
   set blockTableRecordId(t) {
     this._blockTableRecordId = t;
@@ -22898,9 +23255,13 @@ class Wd {
    * ```
    */
   convertLayout(t, e) {
-    var o;
+    var o, h;
     const s = new ba();
-    return s.layoutName = t.layoutName, s.tabOrder = t.tabOrder, (o = e.tables.BLOCK_RECORD) == null || o.entries.some((h) => h.layoutObjects === t.handle ? (s.blockTableRecordId = h.handle, !0) : !1), s.limits.min.copy(t.minLimit), s.limits.max.copy(t.maxLimit), s.extents.min.copy(t.minExtent), s.extents.max.copy(t.maxExtent), this.processCommonAttrs(t, s), s;
+    if (s.layoutName = t.layoutName, s.tabOrder = t.tabOrder, t.ownerObjectId ? s.blockTableRecordId = t.ownerObjectId : (o = e.tables.BLOCK_RECORD) == null || o.entries.some((c) => c.layoutObjects === t.handle ? (s.blockTableRecordId = c.handle, !0) : !1), !s.blockTableRecordId && t.layoutName === "Model") {
+      const c = Ge.MODEL_SPACE_NAME;
+      (h = e.tables.BLOCK_RECORD) == null || h.entries.some((g) => g.name.toUpperCase() === c ? (s.blockTableRecordId = g.handle, !0) : !1);
+    }
+    return s.limits.min.copy(t.minLimit), s.limits.max.copy(t.maxLimit), s.extents.min.copy(t.minExtent), s.extents.max.copy(t.maxExtent), this.processCommonAttrs(t, s), s;
   }
   /**
    * Converts a DXF image definition object to an AcDbRasterImageDef.
@@ -22985,23 +23346,23 @@ class Hd {
         timeout: x
       });
       const f = (b) => {
-        const { id: E, success: M, data: O, error: z } = b.data;
+        const { id: E, success: M, data: L, error: z } = b.data;
         if (E !== t) return;
         this.cleanupTask(t);
         const D = Date.now() - o;
         h(M ? {
           success: !0,
-          data: O,
+          data: L,
           duration: D
         } : {
           success: !1,
           error: z,
           duration: D
         });
-      }, A = (b) => {
+      }, w = (b) => {
         this.cleanupTask(t), c(new Error(`Worker error: ${b.message}`));
       };
-      g.addEventListener("message", f), g.addEventListener("error", A), g.postMessage({
+      g.addEventListener("message", f), g.addEventListener("error", w), g.postMessage({
         id: t,
         input: e
       });
@@ -23248,11 +23609,11 @@ class Xd extends Zo {
     t.forEach((c) => {
       if (c.type == "MTEXT") {
         const g = c;
-        [...g.text.matchAll(h)].forEach((A) => {
-          o.add(A[1].toLowerCase());
+        [...g.text.matchAll(h)].forEach((w) => {
+          o.add(w[1].toLowerCase());
         });
         const f = s.get(g.styleName);
-        f == null || f.forEach((A) => o.add(A));
+        f == null || f.forEach((w) => o.add(w));
       } else if (c.type == "TEXT") {
         const g = c, x = s.get(g.styleName);
         x == null || x.forEach((f) => o.add(f));
@@ -23290,14 +23651,14 @@ class Xd extends Zo {
       s
     );
     this.config.convertByEntityType && (g = this.groupAndFlattenByType(g));
-    const A = e.tables.blockTable.modelSpace;
+    const w = e.tables.blockTable.modelSpace;
     await f.processChunk(async (b, E) => {
-      let M = [], O = b < E ? g[b].type : "";
+      let M = [], L = b < E ? g[b].type : "";
       for (let z = b; z < E; z++) {
         const D = g[z], B = c.convert(D);
-        B && (this.config.convertByEntityType && D.type !== O && (A.appendEntity(M), M = [], O = D.type), M.push(B));
+        B && (this.config.convertByEntityType && D.type !== L && (w.appendEntity(M), M = [], L = D.type), M.push(B));
       }
-      if (A.appendEntity(M), h) {
+      if (w.appendEntity(M), h) {
         let z = o.value + E / x * (100 - o.value);
         z > 100 && (z = 100), await h(z, "ENTITY", "IN-PROGRESS");
       }
@@ -23343,7 +23704,7 @@ class Xd extends Zo {
     const s = t.blocks;
     for (const [o, h] of Object.entries(s)) {
       let c = e.tables.blockTable.getAt(h.name);
-      c || (c = new He(), c.objectId = h.handle, c.name = o, c.origin.copy(h.position), e.tables.blockTable.add(c)), h.entities && this.processEntitiesInBlock(h.entities, c);
+      c || (c = new Ge(), c.objectId = h.handle, c.name = o, c.origin.copy(h.position), e.tables.blockTable.add(c)), h.entities && this.processEntitiesInBlock(h.entities, c);
     }
   }
   /**
@@ -23382,7 +23743,7 @@ class Xd extends Zo {
     var o;
     const s = (o = t.tables.BLOCK_RECORD) == null ? void 0 : o.entries;
     s && s.length > 0 && (e.tables.blockTable.removeAll(), s.forEach((h) => {
-      const c = new He();
+      const c = new Ge();
       c.objectId = h.handle, c.name = h.name, c.layoutId = h.layoutObjects, e.tables.blockTable.add(c);
     }));
   }
@@ -23699,15 +24060,15 @@ class Kd extends Zo {
     );
     this.config.convertByEntityType && (c = this.groupAndFlattenByType(c));
     const f = e.tables.blockTable.modelSpace;
-    await x.processChunk(async (A, b) => {
-      let E = [], M = A < b ? c[A].type : "";
-      for (let O = A; O < b; O++) {
-        const z = c[O];
+    await x.processChunk(async (w, b) => {
+      let E = [], M = w < b ? c[w].type : "";
+      for (let L = w; L < b; L++) {
+        const z = c[L];
         this.config.convertByEntityType && z.type !== M && (this.triggerEvents(f, E), E = [], M = z.type), E.push(z);
       }
       if (this.triggerEvents(f, E), h) {
-        let O = o.value + b / g * (100 - o.value);
-        O > 100 && (O = 100), await h(O, "ENTITY", "IN-PROGRESS");
+        let L = o.value + b / g * (100 - o.value);
+        L > 100 && (L = 100), await h(L, "ENTITY", "IN-PROGRESS");
       }
     });
   }
@@ -23918,229 +24279,6 @@ class kr {
     }));
   }
 }
-class Fn extends pn {
-  /**
-   * Creates a new AcDbSymbolTableRecord instance.
-   *
-   * @param attrs - Input attribute values for this symbol table record
-   * @param defaultAttrs - Default values for attributes of this symbol table record
-   *
-   * @example
-   * ```typescript
-   * const record = new AcDbSymbolTableRecord({ name: 'MyRecord' });
-   * ```
-   */
-  constructor(t, e) {
-    t = t || {}, ks(t, { name: "" }), super(t, e);
-  }
-  /**
-   * Gets or sets the name of the symbol table record.
-   *
-   * This property corresponds to DXF group code 2 and is used for
-   * identifying and referencing the symbol table record.
-   *
-   * @returns The name of the symbol table record
-   *
-   * @example
-   * ```typescript
-   * const recordName = record.name;
-   * record.name = 'NewRecordName';
-   * ```
-   */
-  get name() {
-    return this.getAttr("name");
-  }
-  set name(t) {
-    this.setAttr("name", t);
-  }
-}
-const jr = class jr extends Fn {
-  /**
-   * Returns true if the specified name is the name of the model space block table record.
-   *
-   * Model space is the primary drawing area where most entities are created.
-   *
-   * @param name - The name of one block table record.
-   * @returns True if the specified name is the name of the model space block table record.
-   *
-   * @example
-   * ```typescript
-   * if (AcDbBlockTableRecord.isModelSapceName('*Model_Space')) {
-   *   console.log('This is the name of the model space block table record.');
-   * }
-   * ```
-   */
-  static isModelSapceName(t) {
-    return t.toLowerCase() == jr.MODEL_SPACE_NAME.toLowerCase();
-  }
-  /**
-   * Returns true if the specified name is the name of a paper space block table record.
-   *
-   * Paper space is used for creating layouts for printing and plotting.
-   *
-   * @param name - The name of one block table record.
-   * @returns True if the specified name is the name of a paper space block table record.
-   *
-   * @example
-   * ```typescript
-   * if (AcDbBlockTableRecord.isPaperSapceName('*Paper_Space1')) {
-   *   console.log('This is the name of the paper space block table record.');
-   * }
-   * ```
-   */
-  static isPaperSapceName(t) {
-    return t.toLowerCase().startsWith(jr.PAPER_SPACE_NAME_PREFIX.toLowerCase());
-  }
-  /**
-   * Creates a new AcDbBlockTableRecord instance.
-   *
-   * @example
-   * ```typescript
-   * const blockRecord = new AcDbBlockTableRecord();
-   * ```
-   */
-  constructor() {
-    super(), this._origin = new Y(), this._layoutId = "", this._entities = /* @__PURE__ */ new Map();
-  }
-  /**
-   * Returns true if this is a model space block table record.
-   *
-   * Model space is the primary drawing area where most entities are created.
-   *
-   * @returns True if this is a model space block table record
-   *
-   * @example
-   * ```typescript
-   * if (blockRecord.isModelSapce) {
-   *   console.log('This is model space');
-   * }
-   * ```
-   */
-  get isModelSapce() {
-    return jr.isModelSapceName(this.name);
-  }
-  /**
-   * Returns true if this is a paper space block table record.
-   *
-   * Paper space is used for creating layouts for printing and plotting.
-   *
-   * @returns True if this is a paper space block table record
-   *
-   * @example
-   * ```typescript
-   * if (blockRecord.isPaperSapce) {
-   *   console.log('This is paper space');
-   * }
-   * ```
-   */
-  get isPaperSapce() {
-    return jr.isPaperSapceName(this.name);
-  }
-  /**
-   * Gets or sets the base point of the block in WCS coordinates.
-   *
-   * This point is the origin of the MCS (Model Coordinate System), which is the
-   * local WCS for the entities within the block table record.
-   *
-   * @returns The origin point of the block
-   *
-   * @example
-   * ```typescript
-   * const origin = blockRecord.origin;
-   * blockRecord.origin = new AcGePoint3d(10, 20, 0);
-   * ```
-   */
-  get origin() {
-    return this._origin;
-  }
-  set origin(t) {
-    this._origin.copy(t);
-  }
-  /**
-   * Gets or sets the object ID of the associated AcDbLayout object in the Layouts dictionary.
-   *
-   * This property links the block table record to its corresponding layout object,
-   * which defines the viewport configuration and display settings for the block.
-   * For model space blocks, this is typically empty, while paper space blocks
-   * have a corresponding layout ID.
-   *
-   * @returns The object ID of the associated layout
-   *
-   * @example
-   * ```typescript
-   * const layoutId = blockRecord.layoutId;
-   * blockRecord.layoutId = 'some-layout-object-id';
-   * ```
-   */
-  get layoutId() {
-    return this._layoutId;
-  }
-  set layoutId(t) {
-    this._layoutId = t;
-  }
-  /**
-   * Appends the specified entity or entities to this block table record.
-   *
-   * This method adds an entity to the block and sets up the necessary
-   * relationships between the entity and the block table record.
-   *
-   * @param entity - The entity or entities to append to this block table record
-   *
-   * @example
-   * ```typescript
-   * const line = new AcDbLine();
-   * blockRecord.appendEntity(line);
-   * ```
-   */
-  appendEntity(t) {
-    if (Array.isArray(t))
-      for (let e = 0; e < t.length; ++e) {
-        const s = t[e];
-        s.database = this.database, s.ownerId = this.objectId, this._entities.set(s.objectId, s);
-      }
-    else
-      t.database = this.database, t.ownerId = this.objectId, this._entities.set(t.objectId, t);
-    (this.isModelSapce || this.isPaperSapce) && this.database.events.entityAppended.dispatch({
-      database: this.database,
-      entity: t
-    });
-  }
-  /**
-   * Creates an iterator object that can be used to iterate over the entities in the block table record.
-   *
-   * @returns An iterator object that can be used to iterate over the entities
-   *
-   * @example
-   * ```typescript
-   * const iterator = blockRecord.newIterator();
-   * for (const entity of iterator) {
-   *   console.log('Entity:', entity.type);
-   * }
-   * ```
-   */
-  newIterator() {
-    return new ua(this._entities);
-  }
-  /**
-   * Searches for an entity in this block table record with the specified ID.
-   *
-   * @param id - The entity ID to search for
-   * @returns The entity with the specified ID, or undefined if not found
-   *
-   * @example
-   * ```typescript
-   * const entity = blockRecord.getIdAt('some-entity-id');
-   * if (entity) {
-   *   console.log('Found entity:', entity.type);
-   * }
-   * ```
-   */
-  getIdAt(t) {
-    return this._entities.get(t);
-  }
-};
-jr.MODEL_SPACE_NAME = "*MODEL_SPACE", jr.PAPER_SPACE_NAME_PREFIX = "*PAPER_SPACE";
-let He = jr;
 class Bn extends pn {
   /**
    * Creates a new AcDbSymbolTable instance.
@@ -24375,8 +24513,8 @@ class $d extends Bn {
    * ```
    */
   get modelSpace() {
-    let t = this.getAt(He.MODEL_SPACE_NAME);
-    return t || (t = new He(), t.name = He.MODEL_SPACE_NAME, this.add(t)), t;
+    let t = this.getAt(Ge.MODEL_SPACE_NAME);
+    return t || (t = new Ge(), t.name = Ge.MODEL_SPACE_NAME, this.add(t)), t;
   }
   /**
    * Normalizes the specified block table record name if it is one paper spacce or model space
@@ -24388,10 +24526,10 @@ class $d extends Bn {
    */
   normalizeName(t) {
     let e = t;
-    if (He.isModelSapceName(t))
-      e = He.MODEL_SPACE_NAME;
-    else if (He.isPaperSapceName(t)) {
-      const s = He.PAPER_SPACE_NAME_PREFIX, o = t.substring(s.length);
+    if (Ge.isModelSapceName(t))
+      e = Ge.MODEL_SPACE_NAME;
+    else if (Ge.isPaperSapceName(t)) {
+      const s = Ge.PAPER_SPACE_NAME_PREFIX, o = t.substring(s.length);
       e = s + o;
     }
     return e;
@@ -26417,8 +26555,8 @@ class E0 extends pn {
       throw new Error("Failed to get response reader");
     const x = [];
     for (; ; ) {
-      const { done: O, value: z } = await g.read();
-      if (O)
+      const { done: L, value: z } = await g.read();
+      if (L)
         break;
       if (x.push(z), c += z.length, h !== null) {
         const D = Math.round(c / h * 100);
@@ -26431,9 +26569,9 @@ class E0 extends pn {
       }
     }
     const f = new Uint8Array(c);
-    let A = 0;
-    for (const O of x)
-      f.set(O, A), A += O.length;
+    let w = 0;
+    for (const L of x)
+      f.set(L, w), w += L.length;
     this.getFileNameFromUri(t).toLowerCase().split(".").pop() === "dwg" ? await this.read(f.buffer, e, Zs.DWG) : await this.read(f.buffer, e, Zs.DXF), this.events.openProgress.dispatch({
       database: this,
       percentage: 100,
@@ -26959,7 +27097,7 @@ class h0 {
   createLayout(t, e) {
     const s = this.getWorkingDatabase(e), o = new ba();
     o.layoutName = t, o.tabOrder = s.dictionaries.layouts.maxTabOrder;
-    const h = new He();
+    const h = new Ge();
     return h.name = `*Paper_Space${o.tabOrder}`, s.tables.blockTable.add(h), s.dictionaries.layouts.setAt(t, o), this.events.layoutCreated.dispatch({
       layout: o
     }), { layout: o, btr: h };
@@ -27083,7 +27221,7 @@ export {
   Yo as AcDbBatchProcessing,
   ti as AcDbBlockReference,
   $d as AcDbBlockTable,
-  He as AcDbBlockTableRecord,
+  Ge as AcDbBlockTableRecord,
   Gi as AcDbCircle,
   Xo as AcDbCodePage,
   ke as AcDbCurve,