@mlightcad/geometry-engine 3.2.6 → 3.2.8

package/dist/geometry-engine.js

@@ -1,4 +1,4 @@
-import { AcCmErrors as Me } from "@mlightcad/common";
+import { AcCmErrors as Pe } from "@mlightcad/common";
 const $t = [
   "00",
   "01",
@@ -269,10 +269,10 @@ function Ze(E, e, i) {
 function Xr(E, e) {
   return (E % e + e) % e;
 }
-function Mi(E, e, i, a, l) {
+function Pi(E, e, i, a, l) {
   return a + (E - e) * (l - a) / (i - e);
 }
-function Pi(E, e, i) {
+function Mi(E, e, i) {
   return E !== e ? (i - E) / (e - E) : 0;
 }
 function Wr(E, e, i) {
@@ -342,8 +342,8 @@ const Ct = {
   generateUUID: xi,
   clamp: Ze,
   euclideanModulo: Xr,
-  mapLinear: Mi,
-  inverseLerp: Pi,
+  mapLinear: Pi,
+  inverseLerp: Mi,
   lerp: Wr,
   damp: Ai,
   pingpong: zi,
@@ -384,7 +384,7 @@ const Ct = {
         this.x = e, this.y = i;
         return;
       }
-      throw Me.ILLEGAL_PARAMETERS;
+      throw Pe.ILLEGAL_PARAMETERS;
     }
   }
   /**
@@ -954,8 +954,8 @@ const On = class On {
    * @returns Return this matrix
    */
   multiplyMatrices(e, i) {
-    const a = e.elements, l = i.elements, _ = this.elements, g = a[0], p = a[3], x = a[6], f = a[1], A = a[4], y = a[7], I = a[2], C = a[5], U = a[8], q = l[0], Z = l[3], j = l[6], yt = l[1], Mt = l[4], ft = l[7], Y = l[2], ut = l[5], ht = l[8];
-    return _[0] = g * q + p * yt + x * Y, _[3] = g * Z + p * Mt + x * ut, _[6] = g * j + p * ft + x * ht, _[1] = f * q + A * yt + y * Y, _[4] = f * Z + A * Mt + y * ut, _[7] = f * j + A * ft + y * ht, _[2] = I * q + C * yt + U * Y, _[5] = I * Z + C * Mt + U * ut, _[8] = I * j + C * ft + U * ht, this;
+    const a = e.elements, l = i.elements, _ = this.elements, g = a[0], p = a[3], x = a[6], f = a[1], A = a[4], y = a[7], I = a[2], C = a[5], U = a[8], q = l[0], Z = l[3], j = l[6], yt = l[1], Pt = l[4], ft = l[7], Y = l[2], ut = l[5], ht = l[8];
+    return _[0] = g * q + p * yt + x * Y, _[3] = g * Z + p * Pt + x * ut, _[6] = g * j + p * ft + x * ht, _[1] = f * q + A * yt + y * Y, _[4] = f * Z + A * Pt + y * ut, _[7] = f * j + A * ft + y * ht, _[2] = I * q + C * yt + U * Y, _[5] = I * Z + C * Pt + U * ut, _[8] = I * j + C * ft + U * ht, this;
   }
   /**
    * Multiply every component of the matrix by the scalar value s.
@@ -1225,7 +1225,7 @@ function Jr(E, e, i = !1) {
 function Oi(E, e) {
   if (E.length === 0 || e.length === 0)
     return !1;
-  const i = new Pe().setFromPoints(E), a = new Pe().setFromPoints(e);
+  const i = new Me().setFromPoints(E), a = new Me().setFromPoints(e);
   if (!i.intersectsBox(a))
     return !1;
   for (let l = 0; l < E.length; ) {
@@ -1324,8 +1324,8 @@ function Xi(E, e, i, a) {
     a
   );
   for (let q = 1; q <= x; q++) {
-    const Z = _ + q * f, j = tr(Z, E, e, i, a), yt = j[0] - A[0], Mt = j[1] - A[1], ft = j[2] - A[2];
-    p += Math.sqrt(yt * yt + Mt * Mt + ft * ft), A = j;
+    const Z = _ + q * f, j = tr(Z, E, e, i, a), yt = j[0] - A[0], Pt = j[1] - A[1], ft = j[2] - A[2];
+    p += Math.sqrt(yt * yt + Pt * Pt + ft * ft), A = j;
   }
   const y = tr(
     g,
@@ -1373,9 +1373,9 @@ class ir {
     }
     if (y !== q || x !== I || f !== C || A !== U) {
       let Z = 1 - p;
-      const j = x * I + f * C + A * U + y * q, yt = j >= 0 ? 1 : -1, Mt = 1 - j * j;
-      if (Mt > Number.EPSILON) {
-        const Y = Math.sqrt(Mt), ut = Math.atan2(Y, j * yt);
+      const j = x * I + f * C + A * U + y * q, yt = j >= 0 ? 1 : -1, Pt = 1 - j * j;
+      if (Pt > Number.EPSILON) {
+        const Y = Math.sqrt(Pt), ut = Math.atan2(Y, j * yt);
         Z = Math.sin(Z * ut) / Y, p = Math.sin(p * ut) / Y;
       }
       const ft = p * yt;
@@ -1752,7 +1752,7 @@ const Yt = class Yt {
         this.x = e, this.y = i, this.z = a;
         return;
       }
-      throw Me.ILLEGAL_PARAMETERS;
+      throw Pe.ILLEGAL_PARAMETERS;
     }
   }
   /**
@@ -2723,8 +2723,8 @@ const fr = /* @__PURE__ */ new H(), Rr = /* @__PURE__ */ new ir(), qn = class qn
    * @returns Return this matrix
    */
   multiplyMatrices(e, i) {
-    const a = e.elements, l = i.elements, _ = this.elements, g = a[0], p = a[4], x = a[8], f = a[12], A = a[1], y = a[5], I = a[9], C = a[13], U = a[2], q = a[6], Z = a[10], j = a[14], yt = a[3], Mt = a[7], ft = a[11], Y = a[15], ut = l[0], ht = l[4], Lt = l[8], jt = l[12], Tt = l[1], Kt = l[5], Ht = l[9], ie = l[13], se = l[2], ae = l[6], Ft = l[10], Xt = l[14], X = l[3], wt = l[7], Wt = l[11], Ae = l[15];
-    return _[0] = g * ut + p * Tt + x * se + f * X, _[4] = g * ht + p * Kt + x * ae + f * wt, _[8] = g * Lt + p * Ht + x * Ft + f * Wt, _[12] = g * jt + p * ie + x * Xt + f * Ae, _[1] = A * ut + y * Tt + I * se + C * X, _[5] = A * ht + y * Kt + I * ae + C * wt, _[9] = A * Lt + y * Ht + I * Ft + C * Wt, _[13] = A * jt + y * ie + I * Xt + C * Ae, _[2] = U * ut + q * Tt + Z * se + j * X, _[6] = U * ht + q * Kt + Z * ae + j * wt, _[10] = U * Lt + q * Ht + Z * Ft + j * Wt, _[14] = U * jt + q * ie + Z * Xt + j * Ae, _[3] = yt * ut + Mt * Tt + ft * se + Y * X, _[7] = yt * ht + Mt * Kt + ft * ae + Y * wt, _[11] = yt * Lt + Mt * Ht + ft * Ft + Y * Wt, _[15] = yt * jt + Mt * ie + ft * Xt + Y * Ae, this;
+    const a = e.elements, l = i.elements, _ = this.elements, g = a[0], p = a[4], x = a[8], f = a[12], A = a[1], y = a[5], I = a[9], C = a[13], U = a[2], q = a[6], Z = a[10], j = a[14], yt = a[3], Pt = a[7], ft = a[11], Y = a[15], ut = l[0], ht = l[4], Lt = l[8], jt = l[12], Tt = l[1], Kt = l[5], Ht = l[9], ie = l[13], se = l[2], ae = l[6], Ft = l[10], Xt = l[14], X = l[3], wt = l[7], Wt = l[11], Ae = l[15];
+    return _[0] = g * ut + p * Tt + x * se + f * X, _[4] = g * ht + p * Kt + x * ae + f * wt, _[8] = g * Lt + p * Ht + x * Ft + f * Wt, _[12] = g * jt + p * ie + x * Xt + f * Ae, _[1] = A * ut + y * Tt + I * se + C * X, _[5] = A * ht + y * Kt + I * ae + C * wt, _[9] = A * Lt + y * Ht + I * Ft + C * Wt, _[13] = A * jt + y * ie + I * Xt + C * Ae, _[2] = U * ut + q * Tt + Z * se + j * X, _[6] = U * ht + q * Kt + Z * ae + j * wt, _[10] = U * Lt + q * Ht + Z * Ft + j * Wt, _[14] = U * jt + q * ie + Z * Xt + j * Ae, _[3] = yt * ut + Pt * Tt + ft * se + Y * X, _[7] = yt * ht + Pt * Kt + ft * ae + Y * wt, _[11] = yt * Lt + Pt * Ht + ft * Ft + Y * Wt, _[15] = yt * jt + Pt * ie + ft * Xt + Y * Ae, this;
   }
   /**
    * Multiply every component of the matrix by a scalar value s.
@@ -2769,11 +2769,11 @@ const fr = /* @__PURE__ */ new H(), Rr = /* @__PURE__ */ new ir(), qn = class qn
    * @returns Return this matrix
    */
   invert() {
-    const e = this.elements, i = e[0], a = e[1], l = e[2], _ = e[3], g = e[4], p = e[5], x = e[6], f = e[7], A = e[8], y = e[9], I = e[10], C = e[11], U = e[12], q = e[13], Z = e[14], j = e[15], yt = y * Z * f - q * I * f + q * x * C - p * Z * C - y * x * j + p * I * j, Mt = U * I * f - A * Z * f - U * x * C + g * Z * C + A * x * j - g * I * j, ft = A * q * f - U * y * f + U * p * C - g * q * C - A * p * j + g * y * j, Y = U * y * x - A * q * x - U * p * I + g * q * I + A * p * Z - g * y * Z, ut = i * yt + a * Mt + l * ft + _ * Y;
+    const e = this.elements, i = e[0], a = e[1], l = e[2], _ = e[3], g = e[4], p = e[5], x = e[6], f = e[7], A = e[8], y = e[9], I = e[10], C = e[11], U = e[12], q = e[13], Z = e[14], j = e[15], yt = y * Z * f - q * I * f + q * x * C - p * Z * C - y * x * j + p * I * j, Pt = U * I * f - A * Z * f - U * x * C + g * Z * C + A * x * j - g * I * j, ft = A * q * f - U * y * f + U * p * C - g * q * C - A * p * j + g * y * j, Y = U * y * x - A * q * x - U * p * I + g * q * I + A * p * Z - g * y * Z, ut = i * yt + a * Pt + l * ft + _ * Y;
     if (ut === 0)
       return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
     const ht = 1 / ut;
-    return e[0] = yt * ht, e[1] = (q * I * _ - y * Z * _ - q * l * C + a * Z * C + y * l * j - a * I * j) * ht, e[2] = (p * Z * _ - q * x * _ + q * l * f - a * Z * f - p * l * j + a * x * j) * ht, e[3] = (y * x * _ - p * I * _ - y * l * f + a * I * f + p * l * C - a * x * C) * ht, e[4] = Mt * ht, e[5] = (A * Z * _ - U * I * _ + U * l * C - i * Z * C - A * l * j + i * I * j) * ht, e[6] = (U * x * _ - g * Z * _ - U * l * f + i * Z * f + g * l * j - i * x * j) * ht, e[7] = (g * I * _ - A * x * _ + A * l * f - i * I * f - g * l * C + i * x * C) * ht, e[8] = ft * ht, e[9] = (U * y * _ - A * q * _ - U * a * C + i * q * C + A * a * j - i * y * j) * ht, e[10] = (g * q * _ - U * p * _ + U * a * f - i * q * f - g * a * j + i * p * j) * ht, e[11] = (A * p * _ - g * y * _ - A * a * f + i * y * f + g * a * C - i * p * C) * ht, e[12] = Y * ht, e[13] = (A * q * l - U * y * l + U * a * I - i * q * I - A * a * Z + i * y * Z) * ht, e[14] = (U * p * l - g * q * l - U * a * x + i * q * x + g * a * Z - i * p * Z) * ht, e[15] = (g * y * l - A * p * l + A * a * x - i * y * x - g * a * I + i * p * I) * ht, this;
+    return e[0] = yt * ht, e[1] = (q * I * _ - y * Z * _ - q * l * C + a * Z * C + y * l * j - a * I * j) * ht, e[2] = (p * Z * _ - q * x * _ + q * l * f - a * Z * f - p * l * j + a * x * j) * ht, e[3] = (y * x * _ - p * I * _ - y * l * f + a * I * f + p * l * C - a * x * C) * ht, e[4] = Pt * ht, e[5] = (A * Z * _ - U * I * _ + U * l * C - i * Z * C - A * l * j + i * I * j) * ht, e[6] = (U * x * _ - g * Z * _ - U * l * f + i * Z * f + g * l * j - i * x * j) * ht, e[7] = (g * I * _ - A * x * _ + A * l * f - i * I * f - g * l * C + i * x * C) * ht, e[8] = ft * ht, e[9] = (U * y * _ - A * q * _ - U * a * C + i * q * C + A * a * j - i * y * j) * ht, e[10] = (g * q * _ - U * p * _ + U * a * f - i * q * f - g * a * j + i * p * j) * ht, e[11] = (A * p * _ - g * y * _ - A * a * f + i * y * f + g * a * C - i * p * C) * ht, e[12] = Y * ht, e[13] = (A * q * l - U * y * l + U * a * I - i * q * I - A * a * Z + i * y * Z) * ht, e[14] = (U * p * l - g * q * l - U * a * x + i * q * x + g * a * Z - i * p * Z) * ht, e[15] = (g * y * l - A * p * l + A * a * x - i * y * x - g * a * I + i * p * I) * ht, this;
   }
   /**
    * Multiply the columns of this matrix by vector v.
@@ -2887,8 +2887,8 @@ const fr = /* @__PURE__ */ new H(), Rr = /* @__PURE__ */ new ir(), qn = class qn
    * @returns Return this matrix
    */
   compose(e, i, a) {
-    const l = this.elements, _ = i.x, g = i.y, p = i.z, x = i.w, f = _ + _, A = g + g, y = p + p, I = _ * f, C = _ * A, U = _ * y, q = g * A, Z = g * y, j = p * y, yt = x * f, Mt = x * A, ft = x * y, Y = a.x, ut = a.y, ht = a.z;
-    return l[0] = (1 - (q + j)) * Y, l[1] = (C + ft) * Y, l[2] = (U - Mt) * Y, l[3] = 0, l[4] = (C - ft) * ut, l[5] = (1 - (I + j)) * ut, l[6] = (Z + yt) * ut, l[7] = 0, l[8] = (U + Mt) * ht, l[9] = (Z - yt) * ht, l[10] = (1 - (I + q)) * ht, l[11] = 0, l[12] = e.x, l[13] = e.y, l[14] = e.z, l[15] = 1, this;
+    const l = this.elements, _ = i.x, g = i.y, p = i.z, x = i.w, f = _ + _, A = g + g, y = p + p, I = _ * f, C = _ * A, U = _ * y, q = g * A, Z = g * y, j = p * y, yt = x * f, Pt = x * A, ft = x * y, Y = a.x, ut = a.y, ht = a.z;
+    return l[0] = (1 - (q + j)) * Y, l[1] = (C + ft) * Y, l[2] = (U - Pt) * Y, l[3] = 0, l[4] = (C - ft) * ut, l[5] = (1 - (I + j)) * ut, l[6] = (Z + yt) * ut, l[7] = 0, l[8] = (U + Pt) * ht, l[9] = (Z - yt) * ht, l[10] = (1 - (I + q)) * ht, l[11] = 0, l[12] = e.x, l[13] = e.y, l[14] = e.z, l[15] = 1, this;
   }
   /**
    * Decompose this matrix into its position, quaternion and scale components.
@@ -3294,7 +3294,7 @@ const Te = [
   /* @__PURE__ */ new H(),
   /* @__PURE__ */ new H()
 ], mr = /* @__PURE__ */ new H(), Vr = /* @__PURE__ */ new Vt();
-class Pe {
+class Me {
   /**
    * Create a 2d box bounded by min and max.
    * @param min (optional) Input 2d vector representing the lower (x, y) boundary of the box.
@@ -3341,7 +3341,7 @@ class Pe {
    * @returns Return a new 2d box with the same min and max as this one.
    */
   clone() {
-    return new Pe().copy(this);
+    return new Me().copy(this);
   }
   /**
    * Copy the min and max from box to this box.
@@ -3972,7 +3972,7 @@ class is extends ti {
    */
   calculateBoundingBox() {
     const e = this.outter;
-    return e ? e.box : new Pe();
+    return e ? e.box : new Me();
   }
   /**
    * @inheritdoc
@@ -4053,7 +4053,7 @@ class is extends ti {
   calculateBoundaryBoxes(e) {
     const i = [];
     return e.forEach((a) => {
-      i.push(new Pe().setFromPoints(a));
+      i.push(new Me().setFromPoints(a));
     }), i;
   }
   /**
@@ -4228,7 +4228,7 @@ class nr extends Xn {
       const p = e;
       this.center = new Dt(p.x, p.y), this.radius = i, this._clockwise = _, this._startAngle = this._clockwise ? this._mirrorAngle(Ct.normalizeAngle(a)) : Ct.normalizeAngle(a), this._endAngle = this._clockwise ? this._mirrorAngle(Ct.normalizeAngle(l)) : Ct.normalizeAngle(l);
     } else
-      throw Me.ILLEGAL_PARAMETERS;
+      throw Pe.ILLEGAL_PARAMETERS;
   }
   /**
    * Create arc by three points
@@ -4245,8 +4245,8 @@ class nr extends Xn {
       return { x: Kt, y: Ht };
     }, U = p.y - y * p.x, q = x.y - I * x.x, Z = C(y, U, I, q), j = Math.sqrt(
       Math.pow(e.x - Z.x, 2) + Math.pow(e.y - Z.y, 2)
-    ), yt = (ht, Lt) => Math.atan2(ht.y - Lt.y, ht.x - Lt.x), Mt = yt(e, Z), ft = yt(i, Z), Y = yt(a, Z), ut = Y > Mt && Y < ft || Mt > Y && Mt < ft || ft > Y && ft < Mt;
-    this.center = Z, this.radius = j, this._clockwise = !ut, this._startAngle = Mt, this._endAngle = Y;
+    ), yt = (ht, Lt) => Math.atan2(ht.y - Lt.y, ht.x - Lt.x), Pt = yt(e, Z), ft = yt(i, Z), Y = yt(a, Z), ut = Y > Pt && Y < ft || Pt > Y && Pt < ft || ft > Y && ft < Pt;
+    this.center = Z, this.radius = j, this._clockwise = !ut, this._startAngle = Pt, this._endAngle = Y;
   }
   /**
    * Create circular arc by two points and one bugle factor
@@ -4395,7 +4395,7 @@ class nr extends Xn {
       ) && e.push(this.getPointAtAngle(_));
     }
     const a = e.map((_) => _.x), l = e.map((_) => _.y);
-    return new Pe(
+    return new Me(
       new Dt(Math.min(...a), Math.min(...l)),
       new Dt(Math.max(...a), Math.max(...l))
     );
@@ -4756,7 +4756,7 @@ class er extends Wn {
     return this._radius;
   }
   set radius(e) {
-    if (e < 0) throw Me.ILLEGAL_PARAMETERS;
+    if (e < 0) throw Pe.ILLEGAL_PARAMETERS;
     this._radius = e, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -5017,7 +5017,7 @@ class ei extends Xn {
     return this._majorAxisRadius;
   }
   set majorAxisRadius(e) {
-    if (e < 0) throw Me.ILLEGAL_PARAMETERS;
+    if (e < 0) throw Pe.ILLEGAL_PARAMETERS;
     this._majorAxisRadius = e, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -5027,7 +5027,7 @@ class ei extends Xn {
     return this._minorAxisRadius;
   }
   set minorAxisRadius(e) {
-    if (e < 0) throw Me.ILLEGAL_PARAMETERS;
+    if (e < 0) throw Pe.ILLEGAL_PARAMETERS;
     this._minorAxisRadius = e, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -5090,7 +5090,7 @@ class ei extends Xn {
       const p = this.getPoint(g / 100);
       i = Math.min(i, p.x), a = Math.min(a, p.y), l = Math.max(l, p.x), _ = Math.max(_, p.y);
     }
-    return new Pe({ x: i, y: a }, { x: l, y: _ });
+    return new Me({ x: i, y: a }, { x: l, y: _ });
   }
   /**
    * Return true if its start point is identical to its end point. Otherwise, return false.
@@ -5177,7 +5177,7 @@ class ni extends Wn {
     return this._majorAxisRadius;
   }
   set majorAxisRadius(e) {
-    if (e < 0) throw Me.ILLEGAL_PARAMETERS;
+    if (e < 0) throw Pe.ILLEGAL_PARAMETERS;
     this._majorAxisRadius = e, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -5187,7 +5187,7 @@ class ni extends Wn {
     return this._minorAxisRadius;
   }
   set minorAxisRadius(e) {
-    if (e < 0) throw Me.ILLEGAL_PARAMETERS;
+    if (e < 0) throw Pe.ILLEGAL_PARAMETERS;
     this._minorAxisRadius = e, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -5541,7 +5541,7 @@ class ss extends Xn {
    */
   calculateBoundingBox() {
     const e = this.getPoints(100);
-    return new Pe().setFromPoints(e);
+    return new Me().setFromPoints(e);
   }
   /**
    * @inheritdoc
@@ -5637,7 +5637,7 @@ class ri extends Xn {
       Math.max(this._start.x, this._end.x),
       Math.max(this._start.y, this._end.y)
     );
-    return new Pe(e, i);
+    return new Me(e, i);
   }
   /**
    * @inheritdoc
@@ -5717,7 +5717,7 @@ class as extends Xn {
    * @inheritdoc
    */
   calculateBoundingBox() {
-    const e = this.getPoints(100), i = new Pe();
+    const e = this.getPoints(100), i = new Me();
     return i.setFromPoints(e), i;
   }
   /**
@@ -5881,14 +5881,14 @@ var ii = { exports: {} };
       }, yt.parseFloat = function(t) {
         return parseFloat(t);
       };
-      var Mt = function() {
+      var Pt = function() {
         this.b = "";
       };
-      y.StringBuf = Mt, Mt.__name__ = ["StringBuf"], Mt.prototype = {
+      y.StringBuf = Pt, Pt.__name__ = ["StringBuf"], Pt.prototype = {
         add: function(t) {
           this.b += yt.string(t);
         },
-        __class__: Mt
+        __class__: Pt
       };
       var ft = function() {
       };
@@ -5966,7 +5966,7 @@ var ii = { exports: {} };
         __class__: Lt
       };
       var jt = function() {
-        this.buf = new Mt(), this.cache = [], this.useCache = jt.USE_CACHE, this.useEnumIndex = jt.USE_ENUM_INDEX, this.shash = new se(), this.scount = 0;
+        this.buf = new Pt(), this.cache = [], this.useCache = jt.USE_CACHE, this.useEnumIndex = jt.USE_ENUM_INDEX, this.shash = new se(), this.scount = 0;
       };
       y["haxe.Serializer"] = jt, jt.__name__ = ["haxe", "Serializer"], jt.prototype = {
         toString: function() {
@@ -6037,14 +6037,14 @@ var ii = { exports: {} };
                   case Z:
                     this.buf.b += "l";
                     for (var m = t, b = m.h, w = null; b != null; ) {
-                      var M;
-                      w = b[0], b = b[1], M = w, this.serialize(M);
+                      var P;
+                      w = b[0], b = b[1], P = w, this.serialize(P);
                     }
                     this.buf.b += "h";
                     break;
                   case Date:
-                    var P = t;
-                    this.buf.b += "v", this.buf.add(P.getTime());
+                    var M = t;
+                    this.buf.b += "v", this.buf.add(M.getTime());
                     break;
                   case se:
                     this.buf.b += "b";
@@ -6071,7 +6071,7 @@ var ii = { exports: {} };
                     this.buf.b += "h";
                     break;
                   case ae:
-                    for (var V = t, G = 0, Q = V.length - 2, J = new Mt(), et = jt.BASE64; G < Q; ) {
+                    for (var V = t, G = 0, Q = V.length - 2, J = new Pt(), et = jt.BASE64; G < Q; ) {
                       var it = V.get(G++), nt = V.get(G++), st = V.get(G++);
                       J.add(et.charAt(it >> 2)), J.add(et.charAt((it << 4 | nt >> 4) & 63)), J.add(et.charAt((nt << 2 | st >> 6) & 63)), J.add(et.charAt(st & 63));
                     }
@@ -6093,7 +6093,7 @@ var ii = { exports: {} };
                 if (wt.__instanceof(t, xr)) {
                   var mt = ut.getClassName(t);
                   this.buf.b += "A", this.serializeString(mt);
-                } else if (wt.__instanceof(t, Mr))
+                } else if (wt.__instanceof(t, Pr))
                   this.buf.b += "B", this.serializeString(ut.getEnumName(t));
                 else {
                   if (this.useCache && this.serializeRef(t)) return;
@@ -6250,9 +6250,9 @@ var ii = { exports: {} };
               var w = ut.createEmptyInstance(b);
               return this.cache.push(w), this.unserializeObject(w), w;
             case 119:
-              var M = this.unserialize(), P = this.resolver.resolveEnum(M);
-              if (P == null) throw new X("Enum not found " + M);
-              var z = this.unserializeEnum(P, this.unserialize());
+              var P = this.unserialize(), M = this.resolver.resolveEnum(P);
+              if (M == null) throw new X("Enum not found " + P);
+              var z = this.unserializeEnum(M, this.unserialize());
               return this.cache.push(z), z;
             case 106:
               var N = this.unserialize(), k = this.resolver.resolveEnum(N);
@@ -6506,16 +6506,16 @@ var ii = { exports: {} };
               return k instanceof X && (k = k.val), "???";
             }
             if (w != null && w != Object.toString && typeof w == "function") {
-              var M = t.toString();
-              if (M != "[object Object]") return M;
+              var P = t.toString();
+              if (P != "[object Object]") return P;
             }
-            var P = null, z = `{
+            var M = null, z = `{
 `;
             n += "	";
             var N = t.hasOwnProperty != null;
-            for (var P in t)
-              N && !t.hasOwnProperty(P) || P == "prototype" || P == "__class__" || P == "__super__" || P == "__interfaces__" || P == "__properties__" || (z.length != 2 && (z += `, 
-`), z += n + P + " : " + wt.__string_rec(t[P], n));
+            for (var M in t)
+              N && !t.hasOwnProperty(M) || M == "prototype" || M == "__class__" || M == "__super__" || M == "__interfaces__" || M == "__properties__" || (z.length != 2 && (z += `, 
+`), z += n + M + " : " + wt.__string_rec(t[M], n));
             return n = n.substring(1), z += `
 ` + n + "}", z;
           case "function":
@@ -6557,7 +6557,7 @@ var ii = { exports: {} };
               } else if (typeof n == "object" && wt.__isNativeObj(n) && t instanceof n)
                 return !0;
             } else return !1;
-            return n == xr && t.__name__ != null || n == Mr && t.__ename__ != null ? !0 : t.__enum__ == n;
+            return n == xr && t.__name__ != null || n == Pr && t.__ename__ != null ? !0 : t.__enum__ == n;
         }
       }, wt.__nativeClassName = function(t) {
         var n = wt.__toStr.call(t).slice(8, -1);
@@ -7337,17 +7337,17 @@ var ii = { exports: {} };
       y["verb.core.MeshIntersectionPoint"] = Ve, Ve.__name__ = ["verb", "core", "MeshIntersectionPoint"], Ve.prototype = {
         __class__: Ve
       };
-      var Mn = f.core.PolylineMeshIntersection = function(t, n, r, s, o) {
+      var Pn = f.core.PolylineMeshIntersection = function(t, n, r, s, o) {
         this.point = t, this.u = n, this.uv = r, this.polylineIndex = s, this.faceIndex = o;
       };
-      y["verb.core.PolylineMeshIntersection"] = Mn, Mn.__name__ = ["verb", "core", "PolylineMeshIntersection"], Mn.prototype = {
-        __class__: Mn
+      y["verb.core.PolylineMeshIntersection"] = Pn, Pn.__name__ = ["verb", "core", "PolylineMeshIntersection"], Pn.prototype = {
+        __class__: Pn
       };
-      var Pn = f.core.SurfaceSurfaceIntersectionPoint = function(t, n, r, s) {
+      var Mn = f.core.SurfaceSurfaceIntersectionPoint = function(t, n, r, s) {
         this.uv0 = t, this.uv1 = n, this.point = r, this.dist = s;
       };
-      y["verb.core.SurfaceSurfaceIntersectionPoint"] = Pn, Pn.__name__ = ["verb", "core", "SurfaceSurfaceIntersectionPoint"], Pn.prototype = {
-        __class__: Pn
+      y["verb.core.SurfaceSurfaceIntersectionPoint"] = Mn, Mn.__name__ = ["verb", "core", "SurfaceSurfaceIntersectionPoint"], Mn.prototype = {
+        __class__: Mn
       };
       var An = f.core.TriSegmentIntersection = function(t, n, r, s) {
         this.point = t, this.s = n, this.t = r, this.p = s;
@@ -7391,7 +7391,7 @@ var ii = { exports: {} };
             return -w.item1;
           }), h, c = null;
           c = function(w) {
-            for (var M, P = w.dimension, z = s.distanceFunction(t, w.kdPoint.point), N, k = [], L = 0, B = s.dim; L < B; )
+            for (var P, M = w.dimension, z = s.distanceFunction(t, w.kdPoint.point), N, k = [], L = 0, B = s.dim; L < B; )
               L++, k.push(0);
             N = k;
             for (var T, R, F = function(G, Q) {
@@ -7404,7 +7404,7 @@ var ii = { exports: {} };
               (o.size() < n || z < o.peek().item1) && F(w, z);
               return;
             }
-            w.right == null ? M = w.left : w.left == null ? M = w.right : t[P] < w.kdPoint.point[P] ? M = w.left : M = w.right, c(M), (o.size() < n || z < o.peek().item1) && F(w, z), (o.size() < n || Math.abs(T) < o.peek().item1) && (M == w.left ? R = w.right : R = w.left, R != null && c(R));
+            w.right == null ? P = w.left : w.left == null ? P = w.right : t[M] < w.kdPoint.point[M] ? P = w.left : P = w.right, c(P), (o.size() < n || z < o.peek().item1) && F(w, z), (o.size() < n || Math.abs(T) < o.peek().item1) && (P == w.left ? R = w.right : R = w.left, R != null && c(R));
           }, h = c;
           for (var v = 0; v < n; )
             v++, o.push(new qt(null, r));
@@ -7603,11 +7603,11 @@ var ii = { exports: {} };
       }, xt.mult = function(t, n) {
         var r, s, o, h, c, v, d, m;
         r = t.length, s = n.length, o = n[0].length, h = [];
-        for (var b = r - 1, w = 0, M = 0; b >= 0; ) {
-          for (c = [], v = t[b], M = o - 1; M >= 0; ) {
-            for (d = v[s - 1] * n[s - 1][M], w = s - 2; w >= 1; )
-              m = w - 1, d += v[w] * n[w][M] + v[m] * n[m][M], w -= 2;
-            w == 0 && (d += v[0] * n[0][M]), c[M] = d, M--;
+        for (var b = r - 1, w = 0, P = 0; b >= 0; ) {
+          for (c = [], v = t[b], P = o - 1; P >= 0; ) {
+            for (d = v[s - 1] * n[s - 1][P], w = s - 2; w >= 1; )
+              m = w - 1, d += v[w] * n[w][P] + v[m] * n[m][P], w -= 2;
+            w == 0 && (d += v[0] * n[0][P]), c[P] = d, P--;
           }
           h[b] = c, b--;
         }
@@ -7673,9 +7673,9 @@ var ii = { exports: {} };
         }
         return c;
       }, xt.LU = function(t) {
-        for (var n, r, s, o, h, c, v, d, m, b = [], w = 0, M = t.length; w < M; ) {
-          var P = w++;
-          b.push(t[P].slice());
+        for (var n, r, s, o, h, c, v, d, m, b = [], w = 0, P = t.length; w < P; ) {
+          var M = w++;
+          b.push(t[M].slice());
         }
         t = b;
         var z = t.length, N = z - 1, k = [];
@@ -7717,8 +7717,8 @@ var ii = { exports: {} };
           var v = Gt.getMinCoordOnAxis(n.points, n.faces[c], s);
           o.push(new qt(v, c));
         }
-        o.sort(function(M, P) {
-          var z = M.item0, N = P.item0;
+        o.sort(function(P, M) {
+          var z = P.item0, N = M.item0;
           return z == N ? 0 : z > N ? 1 : -1;
         });
         for (var d = [], m = 0, b = o.length; m < b; ) {
@@ -7744,7 +7744,7 @@ var ii = { exports: {} };
         }
         return r;
       }, Gt.triangleUVFromPoint = function(t, n, r) {
-        var s = t.faces[n], o = t.points[s[0]], h = t.points[s[1]], c = t.points[s[2]], v = t.uvs[s[0]], d = t.uvs[s[1]], m = t.uvs[s[2]], b = u.sub(o, r), w = u.sub(h, r), M = u.sub(c, r), P = u.norm(u.cross(u.sub(o, h), u.sub(o, c))), z = u.norm(u.cross(w, M)) / P, N = u.norm(u.cross(M, b)) / P, k = u.norm(u.cross(b, w)) / P;
+        var s = t.faces[n], o = t.points[s[0]], h = t.points[s[1]], c = t.points[s[2]], v = t.uvs[s[0]], d = t.uvs[s[1]], m = t.uvs[s[2]], b = u.sub(o, r), w = u.sub(h, r), P = u.sub(c, r), M = u.norm(u.cross(u.sub(o, h), u.sub(o, c))), z = u.norm(u.cross(w, P)) / M, N = u.norm(u.cross(P, b)) / M, k = u.norm(u.cross(b, w)) / M;
         return u.add(u.mul(z, v), u.add(u.mul(N, d), u.mul(k, m)));
       };
       var Fe = function(t, n) {
@@ -7792,13 +7792,13 @@ var ii = { exports: {} };
         var h = n.length, c = t(n), v = c, d;
         if (isNaN(c)) throw new X("uncmin: f(x0) is a NaN!");
         r = Math.max(r, $.EPSILON);
-        var m, b, w, M = xt.identity(h), P = 0, z = [], N, k, L, B, T, R, F = "";
-        for (b = s(n); P < o; ) {
+        var m, b, w, P = xt.identity(h), M = 0, z = [], N, k, L, B, T, R, F = "";
+        for (b = s(n); M < o; ) {
           if (!u.all(u.finite(b))) {
             F = "Gradient has Infinity or NaN";
             break;
           }
-          if (m = u.neg(xt.dot(M, b)), !u.all(u.finite(m))) {
+          if (m = u.neg(xt.dot(P, b)), !u.all(u.finite(m))) {
             F = "Search direction has Infinity or NaN";
             break;
           }
@@ -7806,9 +7806,9 @@ var ii = { exports: {} };
             F = "Newton step smaller than tol";
             break;
           }
-          for (T = 1, d = u.dot(b, m), N = n; P < o && !(T * R < r); ) {
+          for (T = 1, d = u.dot(b, m), N = n; M < o && !(T * R < r); ) {
             if (z = u.mul(T, m), N = u.add(n, z), v = t(N), v - c >= 0.1 * T * d || isNaN(v)) {
-              T *= 0.5, ++P;
+              T *= 0.5, ++M;
               continue;
             }
             break;
@@ -7817,24 +7817,24 @@ var ii = { exports: {} };
             F = "Line search step size smaller than tol";
             break;
           }
-          if (P == o) {
+          if (M == o) {
             F = "maxit reached during line search";
             break;
           }
-          w = s(N), k = u.sub(w, b), B = u.dot(k, z), L = xt.dot(M, k), M = xt.sub(xt.add(M, xt.mul((B + u.dot(k, L)) / (B * B), me.tensor(z, z))), xt.div(xt.add(me.tensor(L, z), me.tensor(z, L)), B)), n = N, c = v, b = w, ++P;
+          w = s(N), k = u.sub(w, b), B = u.dot(k, z), L = xt.dot(P, k), P = xt.sub(xt.add(P, xt.mul((B + u.dot(k, L)) / (B * B), me.tensor(z, z))), xt.div(xt.add(me.tensor(L, z), me.tensor(z, L)), B)), n = N, c = v, b = w, ++M;
         }
-        return new kn(n, c, b, M, P, F);
+        return new kn(n, c, b, P, M, F);
       }, me.numericalGradient = function(t, n) {
         var r = n.length, s = t(n);
         if (s == NaN) throw new X("gradient: f(x) is a NaN!");
-        for (var o = n.slice(0), h, c, v = [], d, m = 1e-3, b, w, M, P = 0, z, N, k, L = 0; L < r; )
+        for (var o = n.slice(0), h, c, v = [], d, m = 1e-3, b, w, P, M = 0, z, N, k, L = 0; L < r; )
           for (var B = L++, T = Math.max(1e-6 * s, 1e-8); ; ) {
-            if (++P, P > 20) throw new X("Numerical gradient fails");
+            if (++M, M > 20) throw new X("Numerical gradient fails");
             if (o[B] = n[B] + T, h = t(o), o[B] = n[B] - T, c = t(o), o[B] = n[B], isNaN(h) || isNaN(c)) {
               T /= 16;
               continue;
             }
-            if (v[B] = (h - c) / (2 * T), b = n[B] - T, w = n[B], M = n[B] + T, z = (h - s) / T, N = (s - c) / T, k = u.max([Math.abs(v[B]), Math.abs(s), Math.abs(h), Math.abs(c), Math.abs(b), Math.abs(w), Math.abs(M), 1e-8]), d = Math.min(u.max([Math.abs(z - v[B]), Math.abs(N - v[B]), Math.abs(z - N)]) / k, T / k), d > m) T /= 16;
+            if (v[B] = (h - c) / (2 * T), b = n[B] - T, w = n[B], P = n[B] + T, z = (h - s) / T, N = (s - c) / T, k = u.max([Math.abs(v[B]), Math.abs(s), Math.abs(h), Math.abs(c), Math.abs(b), Math.abs(w), Math.abs(P), 1e-8]), d = Math.min(u.max([Math.abs(z - v[B]), Math.abs(N - v[B]), Math.abs(z - N)]) / k, T / k), d > m) T /= 16;
             else break;
           }
         return v;
@@ -8103,7 +8103,7 @@ var ii = { exports: {} };
         var r = vt.rationalSurfaceClosestParam(t, n);
         return S.rationalSurfacePoint(t, r[0], r[1]);
       }, vt.rationalSurfaceClosestParam = function(t, n) {
-        for (var r = 5, s = 0, o, h = 1e-4, c = 5e-4, v, d = t.knotsU[0], m = K.last(t.knotsU), b = t.knotsV[0], w = K.last(t.knotsV), M = vt.isRationalSurfaceClosed(t), P = vt.isRationalSurfaceClosed(t, !1), z, N = Pt.rationalSurfaceAdaptive(t, new Oe()), k = 1 / 0, L = 0, B = N.points.length; L < B; ) {
+        for (var r = 5, s = 0, o, h = 1e-4, c = 5e-4, v, d = t.knotsU[0], m = K.last(t.knotsU), b = t.knotsV[0], w = K.last(t.knotsV), P = vt.isRationalSurfaceClosed(t), M = vt.isRationalSurfaceClosed(t, !1), z, N = Mt.rationalSurfaceAdaptive(t, new Oe()), k = 1 / 0, L = 0, B = N.points.length; L < B; ) {
           var T = L++, R = N.points[T], F = u.normSquared(u.sub(n, R));
           F < k && (k = F, z = N.uvs[T]);
         }
@@ -8117,7 +8117,7 @@ var ii = { exports: {} };
           var V = u.norm(v), G = u.dot(o[1][0], v), Q = u.norm(o[1][0]) * V, J = u.dot(o[0][1], v), et = u.norm(o[0][1]) * V, it = G / Q, nt = J / et, st = V < h, tt = it < c, at = nt < c;
           if (st && tt && at) return z;
           var O = D(z, o, v);
-          O[0] < d ? M ? O = [m - (O[0] - d), O[1]] : O = [d + $.EPSILON, O[1]] : O[0] > m && (M ? O = [d + (O[0] - m), O[1]] : O = [m - $.EPSILON, O[1]]), O[1] < b ? P ? O = [O[0], w - (O[1] - b)] : O = [O[0], b + $.EPSILON] : O[1] > w && (P ? O = [O[0], b + (O[0] - w)] : O = [O[0], w - $.EPSILON]);
+          O[0] < d ? P ? O = [m - (O[0] - d), O[1]] : O = [d + $.EPSILON, O[1]] : O[0] > m && (P ? O = [d + (O[0] - m), O[1]] : O = [m - $.EPSILON, O[1]]), O[1] < b ? M ? O = [O[0], w - (O[1] - b)] : O = [O[0], b + $.EPSILON] : O[1] > w && (M ? O = [O[0], b + (O[0] - w)] : O = [O[0], w - $.EPSILON]);
           var lt = u.norm(u.mul(O[0] - z[0], o[1][0])), mt = u.norm(u.mul(O[1] - z[1], o[0][1]));
           if (lt + mt < h) return z;
           z = O, s++;
@@ -8126,9 +8126,9 @@ var ii = { exports: {} };
       }, vt.rationalCurveClosestPoint = function(t, n) {
         return S.rationalCurvePoint(t, vt.rationalCurveClosestParam(t, n));
       }, vt.rationalCurveClosestParam = function(t, n) {
-        for (var r = 1 / 0, s = 0, o = Pt.rationalCurveRegularSample(t, t.controlPoints.length * t.degree, !0), h = 0, c = o.length - 1; h < c; ) {
-          var v = h++, d = o[v][0], m = o[v + 1][0], b = o[v].slice(1), w = o[v + 1].slice(1), M = he.segmentClosestPoint(n, b, w, d, m), P = u.norm(u.sub(n, M.pt));
-          P < r && (r = P, s = M.u);
+        for (var r = 1 / 0, s = 0, o = Mt.rationalCurveRegularSample(t, t.controlPoints.length * t.degree, !0), h = 0, c = o.length - 1; h < c; ) {
+          var v = h++, d = o[v][0], m = o[v + 1][0], b = o[v].slice(1), w = o[v + 1].slice(1), P = he.segmentClosestPoint(n, b, w, d, m), M = u.norm(u.sub(n, P.pt));
+          M < r && (r = M, s = P.u);
         }
         for (var z = 5, N = 0, k, L = 1e-4, B = 5e-4, T, R = t.knots[0], F = K.last(t.knots), W = u.normSquared(u.sub(t.controlPoints[0], K.last(t.controlPoints))) < $.EPSILON, D = s, V = function(O) {
           return S.rationalCurveDerivatives(t, O, 2);
@@ -8243,11 +8243,11 @@ var ii = { exports: {} };
         for (var c, v = [], d = 0, m = o + 1; d < m; )
           d++, v.push(n);
         c = v;
-        for (var b = [], w = [], M = S.knotSpan(o, n, s), P = null, z = 0; z < h.length; ) {
+        for (var b = [], w = [], P = S.knotSpan(o, n, s), M = null, z = 0; z < h.length; ) {
           var N = h[z];
-          ++z, P = ct.curveKnotRefine(new kt(o, s, N), c), b.push(P.controlPoints.slice(0, M + 1)), w.push(P.controlPoints.slice(M + 1));
+          ++z, M = ct.curveKnotRefine(new kt(o, s, N), c), b.push(M.controlPoints.slice(0, P + 1)), w.push(M.controlPoints.slice(P + 1));
         }
-        var k = P.knots.slice(0, M + o + 2), L = P.knots.slice(M + 1);
+        var k = M.knots.slice(0, P + o + 2), L = M.knots.slice(P + 1);
         return r ? [new Ot(t.degreeU, o, t.knotsU.slice(), k, b), new Ot(t.degreeU, o, t.knotsU.slice(), L, w)] : (b = xt.transpose(b), w = xt.transpose(w), [new Ot(o, t.degreeV, k, t.knotsV.slice(), b), new Ot(o, t.degreeV, L, t.knotsV.slice(), w)]);
       }, Zt.curveSplit = function(t, n) {
         var r = t.degree;
@@ -8255,14 +8255,14 @@ var ii = { exports: {} };
         for (var s = t.knots, o, h = [], c = 0, v = r + 1; c < v; )
           c++, h.push(n);
         o = h;
-        var d = ct.curveKnotRefine(t, o), m = S.knotSpan(r, n, s), b = d.knots.slice(0, m + r + 2), w = d.knots.slice(m + 1), M = d.controlPoints.slice(0, m + 1), P = d.controlPoints.slice(m + 1);
-        return [new kt(r, b, M), new kt(r, w, P)];
+        var d = ct.curveKnotRefine(t, o), m = S.knotSpan(r, n, s), b = d.knots.slice(0, m + r + 2), w = d.knots.slice(m + 1), P = d.controlPoints.slice(0, m + 1), M = d.controlPoints.slice(m + 1);
+        return [new kt(r, b, P), new kt(r, w, M)];
       }, Zt.rationalCurveByEqualArcLength = function(t, n) {
         var r = vt.rationalCurveArcLength(t), s = r / n;
         return Zt.rationalCurveByArcLength(t, s);
       }, Zt.rationalCurveByArcLength = function(t, n) {
-        var r = ct.decomposeCurveIntoBeziers(t), s = r.map(function(M) {
-          return vt.rationalBezierCurveArcLength(M);
+        var r = ct.decomposeCurveIntoBeziers(t), s = r.map(function(P) {
+          return vt.rationalBezierCurveArcLength(P);
         }), o = u.sum(s), h = [new un(t.knots[0], 0)];
         if (n > o) return h;
         for (var c = n, v = 0, d = c, m = 0, b = 0, w; v < r.length; ) {
@@ -8291,8 +8291,8 @@ var ii = { exports: {} };
         for (var o = S.surfaceDerivatives(t, n, r, s), h = S.rational2d(o), c = S.weight2d(o), v = [], d = h[0][0].length, m = 0, b = s + 1; m < b; ) {
           var w = m++;
           v.push([]);
-          for (var M = 0, P = s - w + 1; M < P; ) {
-            for (var z = M++, N = h[w][z], k = 1, L = z + 1; k < L; ) {
+          for (var P = 0, M = s - w + 1; P < M; ) {
+            for (var z = P++, N = h[w][z], k = 1, L = z + 1; k < L; ) {
               var B = k++;
               u.subMulMutate(N, At.get(z, B) * c[0][B], v[w][z - B]);
             }
@@ -8314,9 +8314,9 @@ var ii = { exports: {} };
       }, S.rationalCurveDerivatives = function(t, n, r) {
         r == null && (r = 1);
         for (var s = S.curveDerivatives(t, n, r), o = S.rational1d(s), h = S.weight1d(s), c = [], v = 0, d = r + 1; v < d; ) {
-          for (var m = v++, b = o[m], w = 1, M = m + 1; w < M; ) {
-            var P = w++;
-            u.subMulMutate(b, At.get(m, P) * h[P], c[m - P]);
+          for (var m = v++, b = o[m], w = 1, P = m + 1; w < P; ) {
+            var M = w++;
+            u.subMulMutate(b, At.get(m, M) * h[M], c[m - M]);
           }
           u.mulMutate(1 / h[0], b), c.push(b);
         }
@@ -8329,11 +8329,11 @@ var ii = { exports: {} };
       }, S.surfaceDerivativesGivenNM = function(t, n, r, s, o, h) {
         var c = r.degreeU, v = r.degreeV, d = r.controlPoints, m = r.knotsU, b = r.knotsV;
         if (!S.areValidRelations(c, d.length, m.length) || !S.areValidRelations(v, d[0].length, b.length)) throw new X("Invalid relations between control points, knot vector, and n");
-        var w = d[0][0].length, M;
-        h < c ? M = h : M = c;
-        var P;
-        h < v ? P = h : P = v;
-        for (var z = u.zeros3d(h + 1, h + 1, w), N = S.knotSpanGivenN(t, c, s, m), k = S.knotSpanGivenN(n, v, o, b), L = S.derivativeBasisFunctionsGivenNI(N, s, c, t, m), B = S.derivativeBasisFunctionsGivenNI(k, o, v, n, b), T = u.zeros2d(v + 1, w), R = 0, F = 0, W = M + 1; F < W; ) {
+        var w = d[0][0].length, P;
+        h < c ? P = h : P = c;
+        var M;
+        h < v ? M = h : M = v;
+        for (var z = u.zeros3d(h + 1, h + 1, w), N = S.knotSpanGivenN(t, c, s, m), k = S.knotSpanGivenN(n, v, o, b), L = S.derivativeBasisFunctionsGivenNI(N, s, c, t, m), B = S.derivativeBasisFunctionsGivenNI(k, o, v, n, b), T = u.zeros2d(v + 1, w), R = 0, F = 0, W = P + 1; F < W; ) {
           for (var D = F++, V = 0, G = v + 1; V < G; ) {
             var Q = V++;
             T[Q] = u.zeros1d(w);
@@ -8343,7 +8343,7 @@ var ii = { exports: {} };
             }
           }
           var nt = h - D;
-          nt < P ? R = nt : R = P;
+          nt < M ? R = nt : R = M;
           for (var st = 0, tt = R + 1; st < tt; ) {
             var at = st++;
             z[D][at] = u.zeros1d(w);
@@ -8360,30 +8360,30 @@ var ii = { exports: {} };
       }, S.surfacePointGivenNM = function(t, n, r, s, o) {
         var h = r.degreeU, c = r.degreeV, v = r.controlPoints, d = r.knotsU, m = r.knotsV;
         if (!S.areValidRelations(h, v.length, d.length) || !S.areValidRelations(c, v[0].length, m.length)) throw new X("Invalid relations between control points, knot vector, and n");
-        for (var b = v[0][0].length, w = S.knotSpanGivenN(t, h, s, d), M = S.knotSpanGivenN(n, c, o, m), P = S.basisFunctionsGivenKnotSpanIndex(w, s, h, d), z = S.basisFunctionsGivenKnotSpanIndex(M, o, c, m), N = w - h, k = M, L = u.zeros1d(b), B = u.zeros1d(b), T = 0, R = c + 1; T < R; ) {
+        for (var b = v[0][0].length, w = S.knotSpanGivenN(t, h, s, d), P = S.knotSpanGivenN(n, c, o, m), M = S.basisFunctionsGivenKnotSpanIndex(w, s, h, d), z = S.basisFunctionsGivenKnotSpanIndex(P, o, c, m), N = w - h, k = P, L = u.zeros1d(b), B = u.zeros1d(b), T = 0, R = c + 1; T < R; ) {
           var F = T++;
-          B = u.zeros1d(b), k = M - c + F;
+          B = u.zeros1d(b), k = P - c + F;
           for (var W = 0, D = h + 1; W < D; ) {
             var V = W++;
-            u.addMulMutate(B, P[V], v[N + V][k]);
+            u.addMulMutate(B, M[V], v[N + V][k]);
           }
           u.addMulMutate(L, z[F], B);
         }
         return L;
       }, S.curveRegularSamplePoints = function(t, n) {
-        for (var r = S.curveDerivatives(t, t.knots[0], t.degree), s = 1 / n, o = s * s, h = r[0], c = u.mul(s, r[1]), v = u.mul(o * 0.5, r[2]), d = u.mul(o * s * 0.5, r[3]), m = u.add(v, v), b = u.add(d, d), w = u.mul(0.3333333333333333, d), M = [], P = 0, z = n + 1; P < z; )
-          P++, M.push(S.dehomogenize(h)), u.addAllMutate([h, c, v, w]), u.addAllMutate([c, m, d]), u.addAllMutate([m, b]), u.addAllMutate([v, d]);
-        return M;
+        for (var r = S.curveDerivatives(t, t.knots[0], t.degree), s = 1 / n, o = s * s, h = r[0], c = u.mul(s, r[1]), v = u.mul(o * 0.5, r[2]), d = u.mul(o * s * 0.5, r[3]), m = u.add(v, v), b = u.add(d, d), w = u.mul(0.3333333333333333, d), P = [], M = 0, z = n + 1; M < z; )
+          M++, P.push(S.dehomogenize(h)), u.addAllMutate([h, c, v, w]), u.addAllMutate([c, m, d]), u.addAllMutate([m, b]), u.addAllMutate([v, d]);
+        return P;
       }, S.curveRegularSamplePoints2 = function(t, n) {
-        for (var r = S.curveDerivatives(t, t.knots[0], t.degree), s = 1 / n, o = s * s, h = r[0], c = u.mul(s, r[1]), v = u.mul(o * 0.5, r[2]), d = u.mul(o * s * 0.5, r[3]), m = u.add(v, v), b = u.add(d, d), w = u.mul(0.3333333333333333, d), M = [], P = 0, z = n + 1; P < z; )
-          P++, M.push(S.dehomogenize(h)), u.addAllMutate([h, c, v, w]), u.addAllMutate([c, m, d]), u.addAllMutate([m, b]), u.addAllMutate([v, d]);
-        return M;
+        for (var r = S.curveDerivatives(t, t.knots[0], t.degree), s = 1 / n, o = s * s, h = r[0], c = u.mul(s, r[1]), v = u.mul(o * 0.5, r[2]), d = u.mul(o * s * 0.5, r[3]), m = u.add(v, v), b = u.add(d, d), w = u.mul(0.3333333333333333, d), P = [], M = 0, z = n + 1; M < z; )
+          M++, P.push(S.dehomogenize(h)), u.addAllMutate([h, c, v, w]), u.addAllMutate([c, m, d]), u.addAllMutate([m, b]), u.addAllMutate([v, d]);
+        return P;
       }, S.rationalSurfaceRegularSampleDerivatives = function(t, n, r, s) {
         for (var o = S.surfaceRegularSampleDerivatives(t, n, r, s), h = [], c = n + 1, v = r + 1, d = s + 1, m = 0; m < c; ) {
           var b = m++, w = [];
           h.push(w);
-          for (var M = 0; M < v; ) {
-            for (var P = M++, z = o[b][P], N = S.rational2d(z), k = S.weight2d(z), L = [], B = N[0][0].length, T = 0; T < d; ) {
+          for (var P = 0; P < v; ) {
+            for (var M = P++, z = o[b][M], N = S.rational2d(z), k = S.weight2d(z), L = [], B = N[0][0].length, T = 0; T < d; ) {
               var R = T++;
               L.push([]);
               for (var F = 0, W = d - R; F < W; ) {
@@ -8410,12 +8410,12 @@ var ii = { exports: {} };
       }, S.surfaceRegularSampleDerivatives = function(t, n, r, s) {
         var o = t.degreeU, h = t.degreeV, c = t.controlPoints, v = t.knotsU, d = t.knotsV, m = c[0][0].length;
         (K.last(v) - v[0]) / n, (K.last(d) - d[0]) / r;
-        for (var b = S.regularlySpacedDerivativeBasisFunctions(o, v, n), w = b.item0, M = b.item1, P = S.regularlySpacedDerivativeBasisFunctions(h, d, r), z = P.item0, N = P.item1, k = [], L = n + 1, B = r + 1, T = 0; T < L; ) {
+        for (var b = S.regularlySpacedDerivativeBasisFunctions(o, v, n), w = b.item0, P = b.item1, M = S.regularlySpacedDerivativeBasisFunctions(h, d, r), z = M.item0, N = M.item1, k = [], L = n + 1, B = r + 1, T = 0; T < L; ) {
           var R = T++, F = [];
           k.push(F);
           for (var W = 0; W < B; ) {
             var D = W++;
-            F.push(S.surfaceDerivativesGivenBasesKnotSpans(o, h, c, w[R], z[D], M[R], N[D], m, s));
+            F.push(S.surfaceDerivativesGivenBasesKnotSpans(o, h, c, w[R], z[D], P[R], N[D], m, s));
           }
         }
         return k;
@@ -8424,12 +8424,12 @@ var ii = { exports: {} };
       }, S.surfaceRegularSamplePoints = function(t, n, r) {
         var s = t.degreeU, o = t.degreeV, h = t.controlPoints, c = t.knotsU, v = t.knotsV, d = h[0][0].length;
         (K.last(c) - c[0]) / n, (K.last(v) - v[0]) / r;
-        for (var m = S.regularlySpacedBasisFunctions(s, c, n), b = m.item0, w = m.item1, M = S.regularlySpacedBasisFunctions(o, v, r), P = M.item0, z = M.item1, N = [], k = n + 1, L = r + 1, B = 0; B < k; ) {
+        for (var m = S.regularlySpacedBasisFunctions(s, c, n), b = m.item0, w = m.item1, P = S.regularlySpacedBasisFunctions(o, v, r), M = P.item0, z = P.item1, N = [], k = n + 1, L = r + 1, B = 0; B < k; ) {
           var T = B++, R = [];
           N.push(R);
           for (var F = 0; F < L; ) {
             var W = F++;
-            R.push(S.surfacePointGivenBasesKnotSpans(s, o, h, b[T], P[W], w[T], z[W], d));
+            R.push(S.surfacePointGivenBasesKnotSpans(s, o, h, b[T], M[W], w[T], z[W], d));
           }
         }
         return N;
@@ -8446,8 +8446,8 @@ var ii = { exports: {} };
         }
         return new qt(c, h);
       }, S.surfacePointGivenBasesKnotSpans = function(t, n, r, s, o, h, c, v) {
-        for (var d = u.zeros1d(v), m, b = s - t, w = o - n, M = 0, P = n + 1; M < P; ) {
-          var z = M++;
+        for (var d = u.zeros1d(v), m, b = s - t, w = o - n, P = 0, M = n + 1; P < M; ) {
+          var z = P++;
           m = u.zeros1d(v);
           for (var N = 0, k = t + 1; N < k; ) {
             var L = N++;
@@ -8461,27 +8461,27 @@ var ii = { exports: {} };
         d < t ? b = d : b = t;
         var w;
         d < n ? w = d : w = n;
-        for (var M = u.zeros3d(b + 1, w + 1, m), P = u.zeros2d(n + 1, m), z = 0, N = 0, k = b + 1; N < k; ) {
+        for (var P = u.zeros3d(b + 1, w + 1, m), M = u.zeros2d(n + 1, m), z = 0, N = 0, k = b + 1; N < k; ) {
           for (var L = N++, B = 0, T = n + 1; B < T; ) {
             var R = B++;
-            P[R] = u.zeros1d(m);
+            M[R] = u.zeros1d(m);
             for (var F = 0, W = t + 1; F < W; ) {
               var D = F++;
-              u.addMulMutate(P[R], h[L][D], r[s - t + D][o - n + R]);
+              u.addMulMutate(M[R], h[L][D], r[s - t + D][o - n + R]);
             }
           }
           var V = d - L;
           V < w ? z = V : z = w;
           for (var G = 0, Q = z + 1; G < Q; ) {
             var J = G++;
-            M[L][J] = u.zeros1d(m);
+            P[L][J] = u.zeros1d(m);
             for (var et = 0, it = n + 1; et < it; ) {
               var nt = et++;
-              u.addMulMutate(M[L][J], c[J][nt], P[nt]);
+              u.addMulMutate(P[L][J], c[J][nt], M[nt]);
             }
           }
         }
-        return M;
+        return P;
       }, S.curveDerivatives = function(t, n, r) {
         var s = t.knots.length - t.degree - 2;
         return S.curveDerivativesGivenN(s, t, n, r);
@@ -8490,8 +8490,8 @@ var ii = { exports: {} };
         if (!S.areValidRelations(o, h.length, c.length)) throw new X("Invalid relations between control points, knot vector, and n");
         var v = h[0].length, d;
         s < o ? d = s : d = o;
-        for (var m = u.zeros2d(s + 1, v), b = S.knotSpanGivenN(t, o, r, c), w = S.derivativeBasisFunctionsGivenNI(b, r, o, d, c), M = 0, P = d + 1; M < P; )
-          for (var z = M++, N = 0, k = o + 1; N < k; ) {
+        for (var m = u.zeros2d(s + 1, v), b = S.knotSpanGivenN(t, o, r, c), w = S.derivativeBasisFunctionsGivenNI(b, r, o, d, c), P = 0, M = d + 1; P < M; )
+          for (var z = P++, N = 0, k = o + 1; N < k; ) {
             var L = N++;
             u.addMulMutate(m[z], w[z][L], h[b - o + L]);
           }
@@ -8515,7 +8515,7 @@ var ii = { exports: {} };
         return S.volumePointGivenNML(t, o, h, c, n, r, s);
       }, S.volumePointGivenNML = function(t, n, r, s, o, h, c) {
         if (!S.areValidRelations(t.degreeU, t.controlPoints.length, t.knotsU.length) || !S.areValidRelations(t.degreeV, t.controlPoints[0].length, t.knotsV.length) || !S.areValidRelations(t.degreeW, t.controlPoints[0][0].length, t.knotsW.length)) throw new X("Invalid relations between control points and knot vector");
-        for (var v = t.controlPoints, d = t.degreeU, m = t.degreeV, b = t.degreeW, w = t.knotsU, M = t.knotsV, P = t.knotsW, z = v[0][0][0].length, N = S.knotSpanGivenN(n, d, o, w), k = S.knotSpanGivenN(r, m, h, M), L = S.knotSpanGivenN(s, b, c, P), B = S.basisFunctionsGivenKnotSpanIndex(N, o, d, w), T = S.basisFunctionsGivenKnotSpanIndex(k, h, m, M), R = S.basisFunctionsGivenKnotSpanIndex(L, c, b, P), F = N - d, W = u.zeros1d(z), D = u.zeros1d(z), V = u.zeros1d(z), G = 0, Q = b + 1; G < Q; ) {
+        for (var v = t.controlPoints, d = t.degreeU, m = t.degreeV, b = t.degreeW, w = t.knotsU, P = t.knotsV, M = t.knotsW, z = v[0][0][0].length, N = S.knotSpanGivenN(n, d, o, w), k = S.knotSpanGivenN(r, m, h, P), L = S.knotSpanGivenN(s, b, c, M), B = S.basisFunctionsGivenKnotSpanIndex(N, o, d, w), T = S.basisFunctionsGivenKnotSpanIndex(k, h, m, P), R = S.basisFunctionsGivenKnotSpanIndex(L, c, b, M), F = N - d, W = u.zeros1d(z), D = u.zeros1d(z), V = u.zeros1d(z), G = 0, Q = b + 1; G < Q; ) {
           var J = G++;
           V = u.zeros1d(z);
           for (var et = L - b + J, it = 0, nt = m + 1; it < nt; ) {
@@ -8537,13 +8537,13 @@ var ii = { exports: {} };
         var h = u.zeros2d(r + 1, r + 1), c = u.zeros1d(r + 1), v = u.zeros1d(r + 1), d = 0, m = 0;
         h[0][0] = 1;
         for (var b = 1, w = r + 1; b < w; ) {
-          var M = b++;
-          c[M] = n - o[t + 1 - M], v[M] = o[t + M] - n, d = 0;
-          for (var P = 0; P < M; ) {
-            var z = P++;
-            h[M][z] = v[z + 1] + c[M - z], m = h[z][M - 1] / h[M][z], h[z][M] = d + v[z + 1] * m, d = c[M - z] * m;
+          var P = b++;
+          c[P] = n - o[t + 1 - P], v[P] = o[t + P] - n, d = 0;
+          for (var M = 0; M < P; ) {
+            var z = M++;
+            h[P][z] = v[z + 1] + c[P - z], m = h[z][P - 1] / h[P][z], h[z][P] = d + v[z + 1] * m, d = c[P - z] * m;
           }
-          h[M][M] = d;
+          h[P][P] = d;
         }
         for (var N = u.zeros2d(s + 1, r + 1), k = u.zeros2d(2, r + 1), L = 0, B = 1, T = 0, R = 0, F = 0, W = 0, D = 0, V = 0, G = r + 1; V < G; ) {
           var Q = V++;
@@ -8581,9 +8581,9 @@ var ii = { exports: {} };
         for (var m = 1, b = r + 1; m < b; ) {
           var w = m++;
           h[w] = n - s[t + 1 - w], c[w] = s[t + w] - n, v = 0;
-          for (var M = 0; M < w; ) {
-            var P = M++;
-            d = o[P] / (c[P + 1] + h[w - P]), o[P] = v + c[P + 1] * d, v = h[w - P] * d;
+          for (var P = 0; P < w; ) {
+            var M = P++;
+            d = o[M] / (c[M + 1] + h[w - M]), o[M] = v + c[M + 1] * d, v = h[w - M] * d;
           }
           o[w] = v;
         }
@@ -8627,8 +8627,8 @@ var ii = { exports: {} };
           var m = d++, b = [];
           c = t[m], h = v[m];
           for (var w = 0; w < s; ) {
-            var M = w++;
-            b.push(c[M] * h);
+            var P = w++;
+            b.push(c[P] * h);
           }
           b.push(h), o.push(b);
         }
@@ -8650,7 +8650,7 @@ var ii = { exports: {} };
       var rt = f.eval.Intersect = function() {
       };
       y["verb.eval.Intersect"] = rt, rt.__name__ = ["verb", "eval", "Intersect"], rt.surfaces = function(t, n, r) {
-        var s = Pt.rationalSurfaceAdaptive(t), o = Pt.rationalSurfaceAdaptive(n), h = rt.meshes(s, o), c = h.map(function(v) {
+        var s = Mt.rationalSurfaceAdaptive(t), o = Mt.rationalSurfaceAdaptive(n), h = rt.meshes(s, o), c = h.map(function(v) {
           return v.map(function(d) {
             return rt.surfacesAtPointWithEstimate(t, n, d.uv0, d.uv1, r);
           });
@@ -8661,15 +8661,15 @@ var ii = { exports: {} };
           }), 3);
         });
       }, rt.surfacesAtPointWithEstimate = function(t, n, r, s, o) {
-        var h, c, v, d, m, b, w, M, P, z, N, k, L, B = 5, T = 0;
+        var h, c, v, d, m, b, w, P, M, z, N, k, L, B = 5, T = 0;
         do {
-          if (h = S.rationalSurfaceDerivatives(t, r[0], r[1], 1), c = h[0][0], d = h[1][0], m = h[0][1], v = u.normalized(u.cross(d, m)), b = u.dot(v, c), w = S.rationalSurfaceDerivatives(n, s[0], s[1], 1), M = w[0][0], z = w[1][0], N = w[0][1], P = u.normalized(u.cross(z, N)), k = u.dot(P, M), L = u.distSquared(c, M), L < o * o) break;
-          var R = u.normalized(u.cross(v, P)), F = u.dot(R, c), W = rt.threePlanes(v, b, P, k, R, F);
+          if (h = S.rationalSurfaceDerivatives(t, r[0], r[1], 1), c = h[0][0], d = h[1][0], m = h[0][1], v = u.normalized(u.cross(d, m)), b = u.dot(v, c), w = S.rationalSurfaceDerivatives(n, s[0], s[1], 1), P = w[0][0], z = w[1][0], N = w[0][1], M = u.normalized(u.cross(z, N)), k = u.dot(M, P), L = u.distSquared(c, P), L < o * o) break;
+          var R = u.normalized(u.cross(v, M)), F = u.dot(R, c), W = rt.threePlanes(v, b, M, k, R, F);
           if (W == null) throw new X("panic!");
-          var D = u.sub(W, c), V = u.sub(W, M), G = u.cross(d, v), Q = u.cross(m, v), J = u.cross(z, P), et = u.cross(N, P), it = u.dot(Q, D) / u.dot(Q, d), nt = u.dot(G, D) / u.dot(G, m), st = u.dot(et, V) / u.dot(et, z), tt = u.dot(J, V) / u.dot(J, N);
+          var D = u.sub(W, c), V = u.sub(W, P), G = u.cross(d, v), Q = u.cross(m, v), J = u.cross(z, M), et = u.cross(N, M), it = u.dot(Q, D) / u.dot(Q, d), nt = u.dot(G, D) / u.dot(G, m), st = u.dot(et, V) / u.dot(et, z), tt = u.dot(J, V) / u.dot(J, N);
           r = u.add([it, nt], r), s = u.add([st, tt], s), T++;
         } while (T < B);
-        return new Pn(r, s, c, L);
+        return new Mn(r, s, c, L);
       }, rt.meshes = function(t, n, r, s) {
         r == null && (r = new Ce(t)), s == null && (s = new Ce(n));
         var o = rt.boundingBoxTrees(r, s, 0), h = K.unique(o.map(function(c) {
@@ -8679,15 +8679,15 @@ var ii = { exports: {} };
         }).filter(function(c) {
           return u.distSquared(c.min.point, c.max.point) > $.EPSILON;
         }), function(c, v) {
-          var d = u.sub(c.min.uv0, v.min.uv0), m = u.dot(d, d), b = u.sub(c.max.uv0, v.max.uv0), w = u.dot(b, b), M = u.sub(c.min.uv0, v.max.uv0), P = u.dot(M, M), z = u.sub(c.max.uv0, v.min.uv0), N = u.dot(z, z);
-          return m < $.EPSILON && w < $.EPSILON || P < $.EPSILON && N < $.EPSILON;
+          var d = u.sub(c.min.uv0, v.min.uv0), m = u.dot(d, d), b = u.sub(c.max.uv0, v.max.uv0), w = u.dot(b, b), P = u.sub(c.min.uv0, v.max.uv0), M = u.dot(P, P), z = u.sub(c.max.uv0, v.min.uv0), N = u.dot(z, z);
+          return m < $.EPSILON && w < $.EPSILON || M < $.EPSILON && N < $.EPSILON;
         });
         return rt.makeMeshIntersectionPolylines(h);
       }, rt.meshSlices = function(t, n, r, s) {
-        for (var o = new Fe(t), h = o.boundingBox(), c = h.min[0], v = h.min[1], d = h.max[0], m = h.max[1], b = u.span(n, r, s), w = [], M = 0; M < b.length; ) {
-          var P = b[M];
-          ++M;
-          var z = [[c, v, P], [d, v, P], [d, m, P], [c, m, P]], N = [[0, 0], [1, 0], [1, 1], [0, 1]], k = [[0, 1, 2], [0, 2, 3]], L = new fe(k, z, null, N);
+        for (var o = new Fe(t), h = o.boundingBox(), c = h.min[0], v = h.min[1], d = h.max[0], m = h.max[1], b = u.span(n, r, s), w = [], P = 0; P < b.length; ) {
+          var M = b[P];
+          ++P;
+          var z = [[c, v, M], [d, v, M], [d, m, M], [c, m, M]], N = [[0, 0], [1, 0], [1, 1], [0, 1]], k = [[0, 1, 2], [0, 2, 3]], L = new fe(k, z, null, N);
           w.push(rt.meshes(t, L, o));
         }
         return w;
@@ -8712,15 +8712,15 @@ var ii = { exports: {} };
           return B.adj == null;
         });
         b.length == 0 && (b = o);
-        for (var w = [], M = 0, P = !1; b.length != 0; ) {
+        for (var w = [], P = 0, M = !1; b.length != 0; ) {
           var z = b.pop();
           if (!z.visited) {
-            for (var N = [], k = z; k != null && !(k.visited || (k.visited = !0, k.opp.visited = !0, N.push(k), M += 2, k = k.opp.adj, k == z)); )
+            for (var N = [], k = z; k != null && !(k.visited || (k.visited = !0, k.opp.visited = !0, N.push(k), P += 2, k = k.opp.adj, k == z)); )
               ;
             N.length > 0 && (N.push(N[N.length - 1].opp), w.push(N));
           }
-          if (b.length == 0 && o.length > 0 && (P || M < o.length)) {
-            P = !0;
+          if (b.length == 0 && o.length > 0 && (M || P < o.length)) {
+            M = !0;
             var L = o.pop();
             b.push(L);
           }
@@ -8743,7 +8743,7 @@ var ii = { exports: {} };
         r == null && (r = 1e-3), s != null ? s = s : s = new Se(t), o != null ? o = o : o = new De(n);
         var h = rt.boundingBoxTrees(s, o, r);
         return K.unique(h.map(function(c) {
-          var v = c.item0, d = c.item1, m = K.first(v.knots), b = K.last(v.knots), w = (m + b) / 2, M = K.first(d.knotsU), P = K.last(d.knotsU), z = K.first(d.knotsV), N = K.last(d.knotsV), k = [(M + P) / 2, (z + N) / 2];
+          var v = c.item0, d = c.item1, m = K.first(v.knots), b = K.last(v.knots), w = (m + b) / 2, P = K.first(d.knotsU), M = K.last(d.knotsU), z = K.first(d.knotsV), N = K.last(d.knotsV), k = [(P + M) / 2, (z + N) / 2];
           return rt.curveAndSurfaceWithEstimate(v, d, [w].concat(k), r);
         }).filter(function(c) {
           return u.distSquared(c.curvePoint, c.surfacePoint) < r * r;
@@ -8756,8 +8756,8 @@ var ii = { exports: {} };
           var m = S.rationalCurvePoint(t, d[0]), b = S.rationalSurfacePoint(n, d[1], d[2]), w = u.sub(m, b);
           return u.dot(w, w);
         }, h = function(d) {
-          var m = S.rationalCurveDerivatives(t, d[0], 1), b = S.rationalSurfaceDerivatives(n, d[1], d[2], 1), w = u.sub(b[0][0], m[0]), M = u.mul(-1, m[1]), P = b[1][0], z = b[0][1];
-          return [2 * u.dot(M, w), 2 * u.dot(P, w), 2 * u.dot(z, w)];
+          var m = S.rationalCurveDerivatives(t, d[0], 1), b = S.rationalSurfaceDerivatives(n, d[1], d[2], 1), w = u.sub(b[0][0], m[0]), P = u.mul(-1, m[1]), M = b[1][0], z = b[0][1];
+          return [2 * u.dot(P, w), 2 * u.dot(M, w), 2 * u.dot(z, w)];
         }, c = me.uncmin(o, r, s * s, h), v = c.solution;
         return new xn(v[0], [v[1], v[2]], S.rationalCurvePoint(t, v[0]), S.rationalSurfacePoint(n, v[1], v[2]));
       }, rt.polylineAndMesh = function(t, n, r) {
@@ -8766,8 +8766,8 @@ var ii = { exports: {} };
           ++h;
           var v = c.item0, d = c.item1, m = rt.segmentWithTriangle(t.points[v], t.points[v + 1], n.points, n.faces[d]);
           if (m != null) {
-            var b = m.point, w = u.lerp(m.p, [t.params[v]], [t.params[v + 1]])[0], M = Gt.triangleUVFromPoint(n, d, b);
-            o.push(new Mn(b, w, M, v, d));
+            var b = m.point, w = u.lerp(m.p, [t.params[v]], [t.params[v + 1]])[0], P = Gt.triangleUVFromPoint(n, d, b);
+            o.push(new Pn(b, w, P, v, d));
           }
         }
         return o;
@@ -8791,8 +8791,8 @@ var ii = { exports: {} };
               s.push(w.item1), o.push(v), s.push(w.item0), o.push(v);
               continue;
             }
-            var M = c.split(), P = v.split();
-            s.push(M.item1), o.push(P.item1), s.push(M.item1), o.push(P.item0), s.push(M.item0), o.push(P.item1), s.push(M.item0), o.push(P.item0);
+            var P = c.split(), M = v.split();
+            s.push(P.item1), o.push(M.item1), s.push(P.item1), o.push(M.item0), s.push(P.item0), o.push(M.item1), s.push(P.item0), o.push(M.item0);
           }
         }
         return h;
@@ -8806,11 +8806,11 @@ var ii = { exports: {} };
           return Math.abs(o.u0 - h.u0) < r * 5;
         });
       }, rt.curvesWithEstimate = function(t, n, r, s, o) {
-        var h = function(M) {
-          var P = S.rationalCurvePoint(t, M[0]), z = S.rationalCurvePoint(n, M[1]), N = u.sub(P, z);
+        var h = function(P) {
+          var M = S.rationalCurvePoint(t, P[0]), z = S.rationalCurvePoint(n, P[1]), N = u.sub(M, z);
           return u.dot(N, N);
-        }, c = function(M) {
-          var P = S.rationalCurveDerivatives(t, M[0], 1), z = S.rationalCurveDerivatives(n, M[1], 1), N = u.sub(P[0], z[0]), k = P[1], L = u.mul(-1, z[1]);
+        }, c = function(P) {
+          var M = S.rationalCurveDerivatives(t, P[0], 1), z = S.rationalCurveDerivatives(n, P[1], 1), N = u.sub(M[0], z[0]), k = M[1], L = u.mul(-1, z[1]);
           return [2 * u.dot(k, N), 2 * u.dot(L, N)];
         }, v = me.uncmin(h, [r, s], o * o, c), d = v.solution[0], m = v.solution[1], b = S.rationalCurvePoint(t, d), w = S.rationalCurvePoint(n, m);
         return new Ye(b, w, d, m);
@@ -8819,16 +8819,16 @@ var ii = { exports: {} };
         if (b == null) return null;
         var w = rt.clipRayInCoplanarTriangle(b, t, n);
         if (w == null) return null;
-        var M = rt.clipRayInCoplanarTriangle(b, r, s);
-        if (M == null) return null;
-        var P = rt.mergeTriangleClipIntervals(w, M, t, n, r, s);
-        return P == null ? null : new ee(new Ve(P.min.uv0, P.min.uv1, P.min.point, n, s), new Ve(P.max.uv0, P.max.uv1, P.max.point, n, s));
+        var P = rt.clipRayInCoplanarTriangle(b, r, s);
+        if (P == null) return null;
+        var M = rt.mergeTriangleClipIntervals(w, P, t, n, r, s);
+        return M == null ? null : new ee(new Ve(M.min.uv0, M.min.uv1, M.min.point, n, s), new Ve(M.max.uv0, M.max.uv1, M.max.point, n, s));
       }, rt.clipRayInCoplanarTriangle = function(t, n, r) {
-        for (var s = n.faces[r], o = [n.points[s[0]], n.points[s[1]], n.points[s[2]]], h = [n.uvs[s[0]], n.uvs[s[1]], n.uvs[s[2]]], c = [u.sub(h[1], h[0]), u.sub(h[2], h[1]), u.sub(h[0], h[2])], v = [u.sub(o[1], o[0]), u.sub(o[2], o[1]), u.sub(o[0], o[2])], d = v.map(u.normalized), m = v.map(u.norm), b = null, w = null, M = 0; M < 3; ) {
-          var P = M++, z = o[P], N = d[P], k = rt.rays(z, N, t.origin, t.dir);
+        for (var s = n.faces[r], o = [n.points[s[0]], n.points[s[1]], n.points[s[2]]], h = [n.uvs[s[0]], n.uvs[s[1]], n.uvs[s[2]]], c = [u.sub(h[1], h[0]), u.sub(h[2], h[1]), u.sub(h[0], h[2])], v = [u.sub(o[1], o[0]), u.sub(o[2], o[1]), u.sub(o[0], o[2])], d = v.map(u.normalized), m = v.map(u.norm), b = null, w = null, P = 0; P < 3; ) {
+          var M = P++, z = o[M], N = d[M], k = rt.rays(z, N, t.origin, t.dir);
           if (k != null) {
             var L = k.u0, B = k.u1;
-            L < -$.EPSILON || L > m[P] + $.EPSILON || ((b == null || B < b.u) && (b = new sn(B, u.onRay(t.origin, t.dir, B), u.onRay(h[P], c[P], L / m[P]))), (w == null || B > w.u) && (w = new sn(B, u.onRay(t.origin, t.dir, B), u.onRay(h[P], c[P], L / m[P]))));
+            L < -$.EPSILON || L > m[M] + $.EPSILON || ((b == null || B < b.u) && (b = new sn(B, u.onRay(t.origin, t.dir, B), u.onRay(h[M], c[M], L / m[M]))), (w == null || B > w.u) && (w = new sn(B, u.onRay(t.origin, t.dir, B), u.onRay(h[M], c[M], L / m[M]))));
           }
         }
         return w == null || b == null ? null : new ee(b, w);
@@ -8845,9 +8845,9 @@ var ii = { exports: {} };
         if (u.dot(o, o) < $.EPSILON) return null;
         var h = 0, c = Math.abs(o[0]), v = Math.abs(o[1]), d = Math.abs(o[2]);
         v > c && (h = 1, c = v), d > c && (h = 2, c = d);
-        var m, b, w, M;
-        h == 0 ? (m = n[1], b = n[2], w = s[1], M = s[2]) : h == 1 ? (m = n[0], b = n[2], w = s[0], M = s[2]) : (m = n[0], b = n[1], w = s[0], M = s[1]);
-        var P = -u.dot(t, n), z = -u.dot(r, s), N = m * M - b * w, k = (b * z - P * M) / N, L = (P * w - m * z) / N, B;
+        var m, b, w, P;
+        h == 0 ? (m = n[1], b = n[2], w = s[1], P = s[2]) : h == 1 ? (m = n[0], b = n[2], w = s[0], P = s[2]) : (m = n[0], b = n[1], w = s[0], P = s[1]);
+        var M = -u.dot(t, n), z = -u.dot(r, s), N = m * P - b * w, k = (b * z - M * P) / N, L = (M * w - m * z) / N, B;
         return h == 0 ? B = [0, k, L] : h == 1 ? B = [k, 0, L] : B = [k, L, 0], new rn(B, u.normalized(o));
       }, rt.threePlanes = function(t, n, r, s, o, h) {
         var c = u.cross(r, o), v = u.dot(t, c);
@@ -8865,19 +8865,19 @@ var ii = { exports: {} };
       }, rt.segments = function(t, n, r, s, o) {
         var h = u.sub(n, t), c = Math.sqrt(u.dot(h, h)), v = u.mul(1 / c, h), d = u.sub(s, r), m = Math.sqrt(u.dot(d, d)), b = u.mul(1 / m, d), w = rt.rays(t, v, r, b);
         if (w != null) {
-          var M = Math.min(Math.max(0, w.u0 / c), 1), P = Math.min(Math.max(0, w.u1 / m), 1), z = u.onRay(t, h, M), N = u.onRay(r, d, P), k = u.distSquared(z, N);
-          if (k < o * o) return new Ye(z, N, M, P);
+          var P = Math.min(Math.max(0, w.u0 / c), 1), M = Math.min(Math.max(0, w.u1 / m), 1), z = u.onRay(t, h, P), N = u.onRay(r, d, M), k = u.distSquared(z, N);
+          if (k < o * o) return new Ye(z, N, P, M);
         }
         return null;
       }, rt.rays = function(t, n, r, s) {
         var o = u.dot(n, s), h = u.dot(n, r), c = u.dot(n, t), v = u.dot(s, r), d = u.dot(s, t), m = u.dot(n, n), b = u.dot(s, s), w = m * b - o * o;
         if (Math.abs(w) < $.EPSILON) return null;
-        var M = o * (h - c) - m * (v - d), P = M / w, z = (h - c + P * o) / m, N = u.onRay(t, n, z), k = u.onRay(r, s, P);
-        return new Ye(N, k, z, P);
+        var P = o * (h - c) - m * (v - d), M = P / w, z = (h - c + M * o) / m, N = u.onRay(t, n, z), k = u.onRay(r, s, M);
+        return new Ye(N, k, z, M);
       }, rt.segmentWithTriangle = function(t, n, r, s) {
-        var o = r[s[0]], h = r[s[1]], c = r[s[2]], v = u.sub(h, o), d = u.sub(c, o), m = u.cross(v, d), b = u.sub(n, t), w = u.sub(t, o), M = -u.dot(m, w), P = u.dot(m, b);
-        if (Math.abs(P) < $.EPSILON) return null;
-        var z = M / P;
+        var o = r[s[0]], h = r[s[1]], c = r[s[2]], v = u.sub(h, o), d = u.sub(c, o), m = u.cross(v, d), b = u.sub(n, t), w = u.sub(t, o), P = -u.dot(m, w), M = u.dot(m, b);
+        if (Math.abs(M) < $.EPSILON) return null;
+        var z = P / M;
         if (z < 0 || z > 1) return null;
         var N = u.add(t, u.mul(z, b)), k = u.dot(v, d), L = u.dot(v, v), B = u.dot(d, d), T = u.sub(N, o), R = u.dot(T, v), F = u.dot(T, d), W = k * k - L * B;
         if (Math.abs(W) < $.EPSILON) return null;
@@ -8917,22 +8917,22 @@ var ii = { exports: {} };
         c >= 0 && (b = b - h[c].mult);
         var w;
         b > 0 ? w = ct.surfaceKnotRefine(t, u.rep(b, n), r) : w = t;
-        var M = S.knotSpan(o, n, s);
-        return Math.abs(n - K.first(s)) < $.EPSILON ? M = 0 : Math.abs(n - K.last(s)) < $.EPSILON && (M = (r ? w.controlPoints[0].length : w.controlPoints.length) - 1), r ? new kt(w.degreeU, w.knotsU, function(P) {
+        var P = S.knotSpan(o, n, s);
+        return Math.abs(n - K.first(s)) < $.EPSILON ? P = 0 : Math.abs(n - K.last(s)) < $.EPSILON && (P = (r ? w.controlPoints[0].length : w.controlPoints.length) - 1), r ? new kt(w.degreeU, w.knotsU, function(M) {
           for (var z, N = [], k = 0, L = w.controlPoints; k < L.length; ) {
             var B = L[k];
-            ++k, N.push(B[M]);
+            ++k, N.push(B[P]);
           }
           return z = N, z;
-        }()) : new kt(w.degreeV, w.knotsV, w.controlPoints[M]);
+        }()) : new kt(w.degreeV, w.knotsV, w.controlPoints[P]);
       }, ot.loftedSurface = function(t, n) {
         t = ct.unifyCurveKnotVectors(t);
         var r = t[0].degree;
         n == null && (n = 3), n > t.length - 1 && (n = t.length - 1);
         for (var s = t[0].knots, o = [], h = [], c = 0, v = t[0].controlPoints.length; c < v; ) {
           var d = [c++], m = t.map(/* @__PURE__ */ function(w) {
-            return function(M) {
-              return M.controlPoints[w[0]];
+            return function(P) {
+              return P.controlPoints[w[0]];
             };
           }(d)), b = ot.rationalInterpCurve(m, n, !0);
           h.push(b.controlPoints), o = b.knots;
@@ -8951,8 +8951,8 @@ var ii = { exports: {} };
       }, ot.fourPointSurface = function(t, n, r, s, o) {
         o == null && (o = 3);
         for (var h = o, c = [], v = 0, d = o + 1; v < d; ) {
-          for (var m = v++, b = [], w = 0, M = o + 1; w < M; ) {
-            var P = w++, z = 1 - m / h, N = u.lerp(z, t, n), k = u.lerp(z, s, r), L = u.lerp(1 - P / h, N, k);
+          for (var m = v++, b = [], w = 0, P = o + 1; w < P; ) {
+            var M = w++, z = 1 - m / h, N = u.lerp(z, t, n), k = u.lerp(z, s, r), L = u.lerp(1 - M / h, N, k);
             L.push(1), b.push(L);
           }
           c.push(b);
@@ -8964,15 +8964,15 @@ var ii = { exports: {} };
         n = u.normalized(n), r = u.normalized(r), o < s && (o = 2 * Math.PI + s);
         var v = o - s, d = 0;
         v <= Math.PI / 2 ? d = 1 : v <= Math.PI ? d = 2 : v <= 3 * Math.PI / 2 ? d = 3 : d = 4;
-        var m = v / d, b = Math.cos(m / 2), w = u.add(t, u.add(u.mul(h * Math.cos(s), n), u.mul(c * Math.sin(s), r))), M = u.sub(u.mul(Math.cos(s), r), u.mul(Math.sin(s), n)), P = [], z = u.zeros1d(2 * d + 3), N = 0, k = s, L = u.zeros1d(d * 2);
-        P[0] = w, L[0] = 1;
+        var m = v / d, b = Math.cos(m / 2), w = u.add(t, u.add(u.mul(h * Math.cos(s), n), u.mul(c * Math.sin(s), r))), P = u.sub(u.mul(Math.cos(s), r), u.mul(Math.sin(s), n)), M = [], z = u.zeros1d(2 * d + 3), N = 0, k = s, L = u.zeros1d(d * 2);
+        M[0] = w, L[0] = 1;
         for (var B = 1, T = d + 1; B < T; ) {
           var R = B++;
           k += m;
           var F = u.add(t, u.add(u.mul(h * Math.cos(k), n), u.mul(c * Math.sin(k), r)));
-          L[N + 2] = 1, P[N + 2] = F;
-          var W = u.sub(u.mul(Math.cos(k), r), u.mul(Math.sin(k), n)), D = rt.rays(w, u.mul(1 / u.norm(M), M), F, u.mul(1 / u.norm(W), W)), V = u.add(w, u.mul(D.u0, M));
-          L[N + 1] = b, P[N + 1] = V, N += 2, R < d && (w = F, M = W);
+          L[N + 2] = 1, M[N + 2] = F;
+          var W = u.sub(u.mul(Math.cos(k), r), u.mul(Math.sin(k), n)), D = rt.rays(w, u.mul(1 / u.norm(P), P), F, u.mul(1 / u.norm(W), W)), V = u.add(w, u.mul(D.u0, P));
+          L[N + 1] = b, M[N + 1] = V, N += 2, R < d && (w = F, P = W);
         }
         for (var G = 2 * d + 1, Q = 0; Q < 3; ) {
           var J = Q++;
@@ -8989,7 +8989,7 @@ var ii = { exports: {} };
             z[3] = z[4] = 0.25, z[5] = z[6] = 0.5, z[7] = z[8] = 0.75;
             break;
         }
-        return new kt(2, z, S.homogenize1d(P, L));
+        return new kt(2, z, S.homogenize1d(M, L));
       }, ot.arc = function(t, n, r, s, o, h) {
         return ot.ellipseArc(t, u.mul(s, u.normalized(n)), u.mul(s, u.normalized(r)), o, h);
       }, ot.polyline = function(t) {
@@ -9017,9 +9017,9 @@ var ii = { exports: {} };
           var w = b++;
           v[w] = 0, v[m + w] = 1;
         }
-        for (var M = Math.cos(d / 2), P = 0, z = u.zeros1d(c + 1), N = u.zeros1d(c + 1), k = u.zeros3d(2 * c + 1, o.length, 3), L = u.zeros2d(2 * c + 1, o.length), B = 1, T = c + 1; B < T; ) {
+        for (var P = Math.cos(d / 2), M = 0, z = u.zeros1d(c + 1), N = u.zeros1d(c + 1), k = u.zeros3d(2 * c + 1, o.length, 3), L = u.zeros2d(2 * c + 1, o.length), B = 1, T = c + 1; B < T; ) {
           var R = B++;
-          P += d, N[R] = Math.cos(P), z[R] = Math.sin(P);
+          M += d, N[R] = Math.cos(M), z[R] = Math.sin(M);
         }
         for (var F = 0, W = o.length; F < W; ) {
           var D = F++, V = he.rayClosestPoint(o[D], n, r), G = u.sub(o[D], V), Q = u.norm(G), J = u.cross(r, G);
@@ -9035,7 +9035,7 @@ var ii = { exports: {} };
               var mt = rt.rays(et, u.mul(1 / u.norm(it), it), O, u.mul(1 / u.norm(lt), lt)), It = u.add(et, u.mul(mt.u0, it));
               k[nt + 1][D] = It;
             }
-            L[nt + 1][D] = M * h[D], nt += 2, at < c && (et = O, it = lt);
+            L[nt + 1][D] = P * h[D], nt += 2, at < c && (et = O, it = lt);
           }
         }
         return new Ot(2, t.degree, v, t.knots, S.homogenize2d(k, L));
@@ -9051,8 +9051,8 @@ var ii = { exports: {} };
           var d = c++, m = u.norm(u.sub(t[d], t[d - 1])), b = h[h.length - 1];
           h.push(b + m);
         }
-        for (var w = h[h.length - 1], M = 0, P = h.length; M < P; ) {
-          var z = M++;
+        for (var w = h[h.length - 1], P = 0, M = h.length; P < M; ) {
+          var z = P++;
           h[z] = h[z] / w;
         }
         var N = u.rep(n + 1, 0), k = s != null && o != null, L;
@@ -9139,19 +9139,19 @@ var ii = { exports: {} };
         }
         h = c;
         for (var m = 0, b = t.length; m < b; ) {
-          var w = m++, M = [h[w].min];
+          var w = m++, P = [h[w].min];
           t[w].knots = t[w].knots.map(/* @__PURE__ */ function(V) {
             return function(G) {
               return G - V[0];
             };
-          }(M));
+          }(P));
         }
-        for (var P = h.map(function(V) {
+        for (var M = h.map(function(V) {
           return V.max - V.min;
-        }), z = q.fold(P, function(V, G) {
+        }), z = q.fold(M, function(V, G) {
           return Math.max(V, G);
         }, 0), N = 0, k = t.length; N < k; ) {
-          var L = N++, B = [z / P[L]];
+          var L = N++, B = [z / M[L]];
           t[L].knots = t[L].knots.map(/* @__PURE__ */ function(V) {
             return function(G) {
               return G * V[0];
@@ -9171,21 +9171,21 @@ var ii = { exports: {} };
         return t > n ? t : n;
       }, ct.curveElevateDegree = function(t, n) {
         if (n <= t.degree) return t;
-        var r = t.knots.length - t.degree - 2, s = t.degree, o = t.knots, h = t.controlPoints, c = n - t.degree, v = t.controlPoints[0].length, d = u.zeros2d(s + c + 1, s + 1), m = [], b = [], w = [], M = r + s + 1, P = n, z = Math.floor(P / 2), N = [], k = [];
-        d[0][0] = 1, d[P][s] = 1;
+        var r = t.knots.length - t.degree - 2, s = t.degree, o = t.knots, h = t.controlPoints, c = n - t.degree, v = t.controlPoints[0].length, d = u.zeros2d(s + c + 1, s + 1), m = [], b = [], w = [], P = r + s + 1, M = n, z = Math.floor(M / 2), N = [], k = [];
+        d[0][0] = 1, d[M][s] = 1;
         for (var L = 1, B = z + 1; L < B; )
-          for (var T = L++, R = 1 / At.get(P, T), F = ct.imin(s, T), W = ct.imax(0, T - c), D = F + 1; W < D; ) {
+          for (var T = L++, R = 1 / At.get(M, T), F = ct.imin(s, T), W = ct.imax(0, T - c), D = F + 1; W < D; ) {
             var V = W++;
             d[T][V] = R * At.get(s, V) * At.get(c, T - V);
           }
-        for (var G = z + 1; G < P; )
+        for (var G = z + 1; G < M; )
           for (var Q = G++, J = ct.imin(s, Q), et = ct.imax(0, Q - c), it = J + 1; et < it; ) {
             var nt = et++;
-            d[Q][nt] = d[P - Q][s - nt];
+            d[Q][nt] = d[M - Q][s - nt];
           }
-        var st = P + 1, tt = -1, at = s, O = s + 1, lt = 1, mt = o[0];
+        var st = M + 1, tt = -1, at = s, O = s + 1, lt = 1, mt = o[0];
         N[0] = h[0];
-        for (var It = 0, Et = P + 1; It < Et; ) {
+        for (var It = 0, Et = M + 1; It < Et; ) {
           var zt = It++;
           k[zt] = mt;
         }
@@ -9193,14 +9193,14 @@ var ii = { exports: {} };
           var de = Bt++;
           m[de] = h[de];
         }
-        for (; O < M; ) {
-          for (var te = O; O < M && o[O] == o[O + 1]; ) O = O + 1;
+        for (; O < P; ) {
+          for (var te = O; O < P && o[O] == o[O + 1]; ) O = O + 1;
           var Jt = O - te + 1, re = o[O], ue = tt;
           tt = s - Jt;
           var pe;
           ue > 0 ? pe = Math.floor((ue + 2) / 2) : pe = 1;
           var Ie;
-          if (tt > 0 ? Ie = Math.floor(P - (tt + 1) / 2) : Ie = P, tt > 0) {
+          if (tt > 0 ? Ie = Math.floor(M - (tt + 1) / 2) : Ie = M, tt > 0) {
             for (var ye = re - mt, we = [], be = s; be > Jt; )
               we[be - Jt - 1] = ye / (o[at + be] - mt), be--;
             for (var Be = 1, _n = tt + 1; Be < _n; ) {
@@ -9209,8 +9209,8 @@ var ii = { exports: {} };
               w[li] = m[s];
             }
           }
-          for (var Pr = pe, ui = P + 1; Pr < ui; ) {
-            var dn = Pr++;
+          for (var Mr = pe, ui = M + 1; Mr < ui; ) {
+            var dn = Mr++;
             b[dn] = u.zeros1d(v);
             for (var ci = ct.imin(s, dn), Ar = ct.imax(0, dn - c), vi = ci + 1; Ar < vi; ) {
               var zr = Ar++;
@@ -9225,7 +9225,7 @@ var ii = { exports: {} };
                   N[Le] = u.lerp(di, N[Le], N[Le - 1]);
                 }
                 if ($e >= pe) {
-                  if ($e - _r <= st - P + ue) {
+                  if ($e - _r <= st - M + ue) {
                     var fi = (re - k[$e - _r]) / Sr;
                     b[Xe] = u.lerp(fi, b[Xe], b[Xe + 1]);
                   }
@@ -9235,13 +9235,13 @@ var ii = { exports: {} };
               cr = cr - 1, vr = vr + 1;
             }
           if (at != s)
-            for (var kr = 0, mi = P - ue; kr < mi; )
+            for (var kr = 0, mi = M - ue; kr < mi; )
               kr++, k[st] = mt, st = st + 1;
           for (var Ir = pe, gi = Ie + 1; Ir < gi; ) {
             var pi = Ir++;
             N[lt] = b[pi], lt = lt + 1;
           }
-          if (O < M) {
+          if (O < P) {
             for (var Nr = 0; Nr < tt; ) {
               var Er = Nr++;
               m[Er] = w[Er];
@@ -9252,7 +9252,7 @@ var ii = { exports: {} };
             }
             at = O, O = O + 1, mt = re;
           } else
-            for (var Tr = 0, wi = P + 1; Tr < wi; ) {
+            for (var Tr = 0, wi = M + 1; Tr < wi; ) {
               var bi = Tr++;
               k[st + bi] = re;
             }
@@ -9289,15 +9289,15 @@ var ii = { exports: {} };
           }
         }
         s.length / h - 1;
-        for (var b = h * 2, w = [], M = 0; M < r.length; ) {
-          var P = s.slice(M, M + b), z = r.slice(M, M + h);
-          w.push(new kt(n, P, z)), M += h;
+        for (var b = h * 2, w = [], P = 0; P < r.length; ) {
+          var M = s.slice(P, P + b), z = r.slice(P, P + h);
+          w.push(new kt(n, M, z)), P += h;
         }
         return w;
       }, ct.curveKnotRefine = function(t, n) {
         if (n.length == 0) return ot.clonedCurve(t);
-        for (var r = t.degree, s = t.controlPoints, o = t.knots, h = s.length - 1, c = h + r + 1, v = n.length - 1, d = S.knotSpan(r, n[0], o), m = S.knotSpan(r, n[v], o), b = [], w = [], M = 0, P = d - r + 1; M < P; ) {
-          var z = M++;
+        for (var r = t.degree, s = t.controlPoints, o = t.knots, h = s.length - 1, c = h + r + 1, v = n.length - 1, d = S.knotSpan(r, n[0], o), m = S.knotSpan(r, n[v], o), b = [], w = [], P = 0, M = d - r + 1; P < M; ) {
+          var z = P++;
           b[z] = s[z];
         }
         for (var N = m - 1, k = h + 1; N < k; ) {
@@ -9324,8 +9324,8 @@ var ii = { exports: {} };
         }
         return new kt(r, w, b);
       }, ct.curveKnotInsert = function(t, n, r) {
-        for (var s = t.degree, o = t.controlPoints, h = t.knots, c = 0, v = o.length, d = S.knotSpan(s, n, h), m = [], b = [], w = [], M = 1, P = d + 1; M < P; ) {
-          var z = M++;
+        for (var s = t.degree, o = t.controlPoints, h = t.knots, c = 0, v = o.length, d = S.knotSpan(s, n, h), m = [], b = [], w = [], P = 1, M = d + 1; P < M; ) {
+          var z = P++;
           b[z] = h[z];
         }
         for (var N = 1, k = r + 1; N < k; ) {
@@ -9363,18 +9363,18 @@ var ii = { exports: {} };
         }
         return new kt(s, b, w);
       };
-      var Pt = f.eval.Tess = function() {
+      var Mt = f.eval.Tess = function() {
       };
-      y["verb.eval.Tess"] = Pt, Pt.__name__ = ["verb", "eval", "Tess"], Pt.rationalCurveRegularSample = function(t, n, r) {
-        return Pt.rationalCurveRegularSampleRange(t, t.knots[0], K.last(t.knots), n, r);
-      }, Pt.rationalCurveRegularSampleRange = function(t, n, r, s, o) {
+      y["verb.eval.Tess"] = Mt, Mt.__name__ = ["verb", "eval", "Tess"], Mt.rationalCurveRegularSample = function(t, n, r) {
+        return Mt.rationalCurveRegularSampleRange(t, t.knots[0], K.last(t.knots), n, r);
+      }, Mt.rationalCurveRegularSampleRange = function(t, n, r, s, o) {
         s < 1 && (s = 2);
         for (var h = [], c = (r - n) / (s - 1), v = 0, d = 0; d < s; ) {
           var m = d++;
           v = n + c * m, o ? h.push([v].concat(S.rationalCurvePoint(t, v))) : h.push(S.rationalCurvePoint(t, v));
         }
         return h;
-      }, Pt.rationalCurveAdaptiveSample = function(t, n, r) {
+      }, Mt.rationalCurveAdaptiveSample = function(t, n, r) {
         if (r == null && (r = !1), n == null && (n = 1e-6), t.degree == 1)
           if (r) {
             for (var s = [], o = 0, h = t.controlPoints.length; o < h; ) {
@@ -9384,17 +9384,17 @@ var ii = { exports: {} };
             return s;
           } else
             return t.controlPoints.map(S.dehomogenize);
-        return Pt.rationalCurveAdaptiveSampleRange(t, t.knots[0], K.last(t.knots), n, r);
-      }, Pt.rationalCurveAdaptiveSampleRange = function(t, n, r, s, o) {
+        return Mt.rationalCurveAdaptiveSampleRange(t, t.knots[0], K.last(t.knots), n, r);
+      }, Mt.rationalCurveAdaptiveSampleRange = function(t, n, r, s, o) {
         var h = S.rationalCurvePoint(t, n), c = S.rationalCurvePoint(t, r), v = 0.5 + 0.2 * Math.random(), d = n + (r - n) * v, m = S.rationalCurvePoint(t, d), b = u.sub(h, c), w = u.sub(h, m);
         if (u.dot(b, b) < s && u.dot(w, w) > s || !he.threePointsAreFlat(h, m, c, s)) {
-          var M = n + (r - n) * 0.5, P = Pt.rationalCurveAdaptiveSampleRange(t, n, M, s, o), z = Pt.rationalCurveAdaptiveSampleRange(t, M, r, s, o);
-          return P.slice(0, -1).concat(z);
+          var P = n + (r - n) * 0.5, M = Mt.rationalCurveAdaptiveSampleRange(t, n, P, s, o), z = Mt.rationalCurveAdaptiveSampleRange(t, P, r, s, o);
+          return M.slice(0, -1).concat(z);
         } else return o ? [[n].concat(h), [r].concat(c)] : [h, c];
-      }, Pt.rationalSurfaceNaive = function(t, n, r) {
+      }, Mt.rationalSurfaceNaive = function(t, n, r) {
         n < 1 && (n = 1), r < 1 && (r = 1), t.degreeU, t.degreeV, t.controlPoints;
-        for (var s = t.knotsU, o = t.knotsV, h = K.last(s) - s[0], c = K.last(o) - o[0], v = h / n, d = c / r, m = [], b = [], w = [], M = 0, P = n + 1; M < P; )
-          for (var z = M++, N = 0, k = r + 1; N < k; ) {
+        for (var s = t.knotsU, o = t.knotsV, h = K.last(s) - s[0], c = K.last(o) - o[0], v = h / n, d = c / r, m = [], b = [], w = [], P = 0, M = n + 1; P < M; )
+          for (var z = P++, N = 0, k = r + 1; N < k; ) {
             var L = N++, B = z * v, T = L * d;
             b.push([B, T]);
             var R = S.rationalSurfaceDerivatives(t, B, T, 1), F = R[0][0];
@@ -9408,49 +9408,49 @@ var ii = { exports: {} };
             D.push(tt), D.push(at);
           }
         return new fe(D, m, w, b);
-      }, Pt.divideRationalSurfaceAdaptive = function(t, n) {
+      }, Mt.divideRationalSurfaceAdaptive = function(t, n) {
         n == null && (n = new Oe()), 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 r = (t.controlPoints.length - 1) * 2, s = (t.controlPoints[0].length - 1) * 2, o;
         n.minDivsU > r ? o = n.minDivsU = n.minDivsU : o = n.minDivsU = r;
         var h;
         n.minDivsV > s ? h = n.minDivsV = n.minDivsV : h = n.minDivsV = s;
-        for (var c = K.last(t.knotsU), v = t.knotsU[0], d = K.last(t.knotsV), m = t.knotsV[0], b = (c - v) / o, w = (d - m) / h, M = [], P = [], z = 0, N = h + 1; z < N; ) {
+        for (var c = K.last(t.knotsU), v = t.knotsU[0], d = K.last(t.knotsV), m = t.knotsV[0], b = (c - v) / o, w = (d - m) / h, P = [], M = [], z = 0, N = h + 1; z < N; ) {
           for (var k = z++, L = [], B = 0, T = o + 1; B < T; ) {
             var R = B++, F = v + b * R, W = m + w * k, D = S.rationalSurfaceDerivatives(t, F, W, 1), V = u.normalized(u.cross(D[0][1], D[1][0]));
             L.push(new ve(D[0][0], V, [F, W], -1, u.isZero(V)));
           }
-          P.push(L);
+          M.push(L);
         }
         for (var G = 0; G < h; )
           for (var Q = G++, J = 0; J < o; ) {
-            var et = J++, it = [P[h - Q - 1][et], P[h - Q - 1][et + 1], P[h - Q][et + 1], P[h - Q][et]];
-            M.push(new Ee(t, it));
+            var et = J++, it = [M[h - Q - 1][et], M[h - Q - 1][et + 1], M[h - Q][et + 1], M[h - Q][et]];
+            P.push(new Ee(t, it));
           }
-        if (!n.refine) return M;
+        if (!n.refine) return P;
         for (var nt = 0; nt < h; )
           for (var st = nt++, tt = 0; tt < o; ) {
-            var at = tt++, O = st * o + at, lt = Pt.north(O, st, at, o, h, M), mt = Pt.east(O, st, at, o, h, M), It = Pt.south(O, st, at, o, h, M), Et = Pt.west(O, st, at, o, h, M);
-            M[O].neighbors = [It, mt, lt, Et], M[O].divide(n);
+            var at = tt++, O = st * o + at, lt = Mt.north(O, st, at, o, h, P), mt = Mt.east(O, st, at, o, h, P), It = Mt.south(O, st, at, o, h, P), Et = Mt.west(O, st, at, o, h, P);
+            P[O].neighbors = [It, mt, lt, Et], P[O].divide(n);
           }
-        return M;
-      }, Pt.north = function(t, n, r, s, o, h) {
+        return P;
+      }, Mt.north = function(t, n, r, s, o, h) {
         return n == 0 ? null : h[t - s];
-      }, Pt.south = function(t, n, r, s, o, h) {
+      }, Mt.south = function(t, n, r, s, o, h) {
         return n == o - 1 ? null : h[t + s];
-      }, Pt.east = function(t, n, r, s, o, h) {
+      }, Mt.east = function(t, n, r, s, o, h) {
         return r == s - 1 ? null : h[t + 1];
-      }, Pt.west = function(t, n, r, s, o, h) {
+      }, Mt.west = function(t, n, r, s, o, h) {
         return r == 0 ? null : h[t - 1];
-      }, Pt.triangulateAdaptiveRefinementNodeTree = function(t) {
+      }, Mt.triangulateAdaptiveRefinementNodeTree = function(t) {
         for (var n = fe.empty(), r = 0; r < t.length; ) {
           var s = t[r];
           ++r, s.triangulate(n);
         }
         return n;
-      }, Pt.rationalSurfaceAdaptive = function(t, n) {
+      }, Mt.rationalSurfaceAdaptive = function(t, n) {
         n != null ? n = n : n = new Oe();
-        var r = Pt.divideRationalSurfaceAdaptive(t, n);
-        return Pt.triangulateAdaptiveRefinementNodeTree(r);
+        var r = Mt.divideRationalSurfaceAdaptive(t, n);
+        return Mt.triangulateAdaptiveRefinementNodeTree(r);
       };
       var Oe = f.core.AdaptiveRefinementOptions = function() {
         this.minDivsV = 1, this.minDivsU = 1, this.refine = !0, this.maxDepth = 10, this.minDepth = 0, this.normTol = 0.025;
@@ -9595,18 +9595,18 @@ var ii = { exports: {} };
             }
           }
           for (var w = 0; w < r.length; ) {
-            var M = r[w];
-            if (++w, M.id != -1) {
-              s.push(M.id);
+            var P = r[w];
+            if (++w, P.id != -1) {
+              s.push(P.id);
               continue;
             }
-            t.uvs.push(M.uv), t.points.push(M.point), t.normals.push(M.normal), M.id = n, s.push(n), n++;
+            t.uvs.push(P.uv), t.points.push(P.point), t.normals.push(P.normal), P.id = n, s.push(n), n++;
           }
           if (r.length == 4)
             return t.faces.push([s[0], s[3], s[1]]), t.faces.push([s[3], s[2], s[1]]), t;
           if (r.length == 5) {
-            var P = s.length;
-            return t.faces.push([s[o], s[(o + 2) % P], s[(o + 1) % P]]), t.faces.push([s[(o + 4) % P], s[(o + 3) % P], s[o]]), t.faces.push([s[o], s[(o + 3) % P], s[(o + 2) % P]]), t;
+            var M = s.length;
+            return t.faces.push([s[o], s[(o + 2) % M], s[(o + 1) % M]]), t.faces.push([s[(o + 4) % M], s[(o + 3) % M], s[o]]), t.faces.push([s[o], s[(o + 3) % M], s[(o + 2) % M]]), t;
           }
           var z = this.center();
           t.uvs.push(z.uv), t.points.push(z.point), t.normals.push(z.normal);
@@ -9792,10 +9792,10 @@ var ii = { exports: {} };
           });
         },
         tessellate: function(t) {
-          return Pt.rationalCurveAdaptiveSample(this._data, t, !1);
+          return Mt.rationalCurveAdaptiveSample(this._data, t, !1);
         },
         tessellateAsync: function(t) {
-          return _t.dispatchMethod(Pt, "rationalCurveAdaptiveSample", [this._data, t, !1]);
+          return _t.dispatchMethod(Mt, "rationalCurveAdaptiveSample", [this._data, t, !1]);
         },
         __class__: bt
       });
@@ -9957,10 +9957,10 @@ var ii = { exports: {} };
           });
         },
         tessellate: function(t) {
-          return Pt.rationalSurfaceAdaptive(this._data, t);
+          return Mt.rationalSurfaceAdaptive(this._data, t);
         },
         tessellateAsync: function(t) {
-          return _t.dispatchMethod(Pt, "rationalSurfaceAdaptive", [this._data, t]);
+          return _t.dispatchMethod(Mt, "rationalSurfaceAdaptive", [this._data, t]);
         },
         transform: function(t) {
           return new gt(ct.rationalSurfaceTransform(this._data, t));
@@ -10147,7 +10147,7 @@ var ii = { exports: {} };
       wr.__name__ = ["Float"];
       var br = y.Bool = Boolean;
       br.__ename__ = ["Bool"];
-      var xr = y.Class = { __name__: ["Class"] }, Mr = {};
+      var xr = y.Class = { __name__: ["Class"] }, Pr = {};
       Array.prototype.map == null && (Array.prototype.map = function(t) {
         for (var n = [], r = 0, s = this.length; r < s; ) {
           var o = r++;
@@ -10201,7 +10201,7 @@ var ii = { exports: {} };
             return process.nextTick(d(m, B)), B;
           };
         }
-        function M() {
+        function P() {
           if (t.postMessage && !t.importScripts) {
             var B = !0, T = t.onmessage;
             return t.onmessage = function() {
@@ -10209,7 +10209,7 @@ var ii = { exports: {} };
             }, t.postMessage("", "*"), t.onmessage = T, B;
           }
         }
-        function P() {
+        function M() {
           var B = "setImmediate$" + Math.random() + "$", T = function(R) {
             R.source === t && typeof R.data == "string" && R.data.indexOf(B) === 0 && m(+R.data.slice(B.length));
           };
@@ -10244,7 +10244,7 @@ var ii = { exports: {} };
           };
         }
         var L = Object.getPrototypeOf && Object.getPrototypeOf(t);
-        L = L && L.setTimeout ? L : t, {}.toString.call(t.process) === "[object process]" ? w() : M() ? P() : t.MessageChannel ? z() : h && "onreadystatechange" in h.createElement("script") ? N() : k(), L.setImmediate = c, L.clearImmediate = b;
+        L = L && L.setTimeout ? L : t, {}.toString.call(t.process) === "[object process]" ? w() : P() ? M() : t.MessageChannel ? z() : h && "onreadystatechange" in h.createElement("script") ? N() : k(), L.setImmediate = c, L.clearImmediate = b;
       })(new Function("return this")()), jt.USE_CACHE = !1, jt.USE_ENUM_INDEX = !1, jt.BASE64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789%:", Tt.DEFAULT_RESOLVER = ut, Tt.BASE64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789%:", Ht.count = 0, Xt.i64tmp = function(t) {
         var n, r = new Lt(0, 0);
         return n = r, n;
@@ -10576,12 +10576,12 @@ class si extends Wn {
     super();
     const g = arguments.length;
     if (g < 2 || g > 5)
-      throw Me.ILLEGAL_PARAMETERS;
+      throw Pe.ILLEGAL_PARAMETERS;
     if (this._degree = 3, this._closed = !1, Array.isArray(i)) {
       this._controlPoints = e;
       let p, x = 3, f = !1;
       if (g >= 3 && (Array.isArray(a) ? (p = a, g >= 4 && (x = l || 3), g >= 5 && (f = _)) : a !== void 0 && (x = a || 3, g >= 4 && (f = l))), a === void 0 && g >= 4 && (x = l || 3, g >= 5 && (f = _)), this._degree = x, this._closed = f, this._controlPoints.length < this._degree + 1)
-        throw Me.ILLEGAL_PARAMETERS;
+        throw Pe.ILLEGAL_PARAMETERS;
       const A = this.toVerbPoints(this._controlPoints);
       this._nurbsCurve = gn.geom.NurbsCurve.byKnotsControlPointsWeights(
         this._degree,
@@ -10591,7 +10591,7 @@ class si extends Wn {
       );
     } else {
       if (this._fitPoints = e, this._knotParameterization = i, g >= 3 && (this._degree = a || 3), g >= 4 && (this._closed = l), this._fitPoints.length < this._degree + 1)
-        throw Me.ILLEGAL_PARAMETERS;
+        throw Pe.ILLEGAL_PARAMETERS;
       const p = this.toNurbsPoints(this._fitPoints);
       this._nurbsCurve = gn.geom.NurbsCurve.byPoints(p, this._degree), this._controlPoints = this.toGePoints(this._nurbsCurve.controlPoints());
     }
@@ -10642,6 +10642,27 @@ class si extends Wn {
   get knotParameterization() {
     return this._knotParameterization;
   }
+  get controlPoints() {
+    return this._controlPoints.map((e) => ({
+      x: e.x,
+      y: e.y,
+      z: e.z || 0
+    }));
+  }
+  get fitPoints() {
+    var e;
+    return (e = this._fitPoints) == null ? void 0 : e.map((i) => ({
+      x: i.x,
+      y: i.y,
+      z: i.z || 0
+    }));
+  }
+  get knots() {
+    return [...this._nurbsCurve.knots()];
+  }
+  get weights() {
+    return [...this._nurbsCurve.weights()];
+  }
   /**
    * The start point of this spline
    */
@@ -10777,7 +10798,7 @@ class si extends Wn {
 }
 export {
   is as AcGeArea2d,
-  Pe as AcGeBox2d,
+  Me as AcGeBox2d,
   Ue as AcGeBox3d,
   ts as AcGeCatmullRomCurve3d,
   nr as AcGeCircArc2d,
@@ -10826,14 +10847,14 @@ export {
   Gi as generateUniformKnots,
   Zr as intPartLength,
   rs as interpolateControlPoints,
-  Pi as inverseLerp,
+  Mi as inverseLerp,
   Vi as isBetween,
   Di as isBetweenAngle,
   Jr as isPointInPolygon,
   Oi as isPolygonIntersect,
   Ti as isPowerOfTwo,
   Wr as lerp,
-  Mi as mapLinear,
+  Pi as mapLinear,
   $n as normalizeAngle,
   zi as pingpong,
   Li as radToDeg,