@mlightcad/geometry-engine 1.0.4 → 1.0.6

package/dist/geometry-engine.js

@@ -259,7 +259,7 @@ const k = [
 ];
 let St = 1234567;
 const Rt = Math.PI / 180, Tt = 180 / Math.PI;
-function Ot() {
+function Qt() {
   const u = Math.random() * 4294967295 | 0, t = Math.random() * 4294967295 | 0, s = Math.random() * 4294967295 | 0, e = Math.random() * 4294967295 | 0;
   return (k[u & 255] + k[u >> 8 & 255] + k[u >> 16 & 255] + k[u >> 24 & 255] + "-" + k[t & 255] + k[t >> 8 & 255] + "-" + k[t >> 16 & 15 | 64] + k[t >> 24 & 255] + "-" + k[s & 63 | 128] + k[s >> 8 & 255] + "-" + k[s >> 16 & 255] + k[s >> 24 & 255] + k[e & 255] + k[e >> 8 & 255] + k[e >> 16 & 255] + k[e >> 24 & 255]).toLowerCase();
 }
@@ -269,19 +269,19 @@ function j(u, t, s) {
 function Vt(u, t) {
   return (u % t + t) % t;
 }
-function Ht(u, t, s, e, n) {
+function Ot(u, t, s, e, n) {
   return e + (u - t) * (n - e) / (s - t);
 }
-function Kt(u, t, s) {
+function Wt(u, t, s) {
   return u !== t ? (s - u) / (t - u) : 0;
 }
 function Ut(u, t, s) {
   return (1 - s) * u + s * t;
 }
-function $t(u, t, s, e) {
+function Ht(u, t, s, e) {
   return Ut(u, t, 1 - Math.exp(-s * e));
 }
-function Wt(u, t = 1) {
+function $t(u, t = 1) {
   return t - Math.abs(Vt(u, t * 2) - t);
 }
 function Jt(u, t, s) {
@@ -319,7 +319,7 @@ function os(u) {
 function as(u) {
   return Math.pow(2, Math.floor(Math.log(u) / Math.LN2));
 }
-function dt(u) {
+function mt(u) {
   const t = Math.PI * 2;
   return (u % t + t) % t;
 }
@@ -327,7 +327,7 @@ function cs(u, t, s) {
   return u > t && u < s || u > s && u < t;
 }
 function ls(u, t, s, e = !1) {
-  return u = dt(u), t = dt(t), s = dt(s), e ? t > s ? u <= t && u >= s : u <= t || u >= s : t < s ? u >= t && u <= s : u >= t || u <= s;
+  return u = mt(u), t = mt(t), s = mt(s), e ? t > s ? u <= t && u >= s : u <= t || u >= s : t < s ? u >= t && u <= s : u >= t || u <= s;
 }
 function qt(u) {
   return u = Math.abs(u), u < 1 ? 0 : Math.ceil(Math.log10(Math.abs(u) + 1));
@@ -336,17 +336,17 @@ function us(u, t = 1e-7) {
   const s = qt(u);
   return Math.max(Math.pow(10, s) * t, t);
 }
-const S = {
+const C = {
   DEG2RAD: Rt,
   RAD2DEG: Tt,
-  generateUUID: Ot,
+  generateUUID: Qt,
   clamp: j,
   euclideanModulo: Vt,
-  mapLinear: Ht,
-  inverseLerp: Kt,
+  mapLinear: Ot,
+  inverseLerp: Wt,
   lerp: Ut,
-  damp: $t,
-  pingpong: Wt,
+  damp: Ht,
+  pingpong: $t,
   smoothstep: Jt,
   smootherstep: vt,
   randInt: ts,
@@ -358,12 +358,12 @@ const S = {
   isPowerOfTwo: hs,
   ceilPowerOfTwo: os,
   floorPowerOfTwo: as,
-  normalizeAngle: dt,
+  normalizeAngle: mt,
   isBetween: cs,
   isBetweenAngle: ls,
   intPartLength: qt,
   relativeEps: us
-}, H = class H {
+}, W = class W {
   /**
    * Construct one vector by two numbers
    */
@@ -479,7 +479,7 @@ const S = {
    * @returns Return the cloned vector
    */
   clone() {
-    return new H(this.x, this.y);
+    return new W(this.x, this.y);
   }
   /**
    * Copy the values of the passed vector's x and y properties to this vector.
@@ -839,8 +839,8 @@ const S = {
    * @returns Return this vector
    */
   rotateAround(t, s) {
-    const e = Math.cos(s), n = Math.sin(s), i = this.x - t.x, h = this.y - t.y;
-    return this.x = i * e - h * n + t.x, this.y = i * n + h * e + t.y, this;
+    const e = Math.cos(s), n = Math.sin(s), i = this.x - t.x, r = this.y - t.y;
+    return this.x = i * e - r * n + t.x, this.y = i * n + r * e + t.y, this;
   }
   /**
    * Set each component of this vector to a pseudo-random value between 0 and 1, excluding 1.
@@ -851,17 +851,17 @@ const S = {
   }
   relativeEps(t = 1e-7) {
     return Math.min(
-      S.relativeEps(this.x, t),
-      S.relativeEps(this.y, t)
+      C.relativeEps(this.x, t),
+      C.relativeEps(this.y, t)
     );
   }
   *[Symbol.iterator]() {
     yield this.x, yield this.y;
   }
 };
-H.EMPTY = Object.freeze(new H(0, 0));
-let f = H;
-const K = class K {
+W.EMPTY = Object.freeze(new W(0, 0));
+let P = W;
+const H = class H {
   /**
    * Create a 3x3 matrix with the given arguments in row-major order. If no arguments are provided,
    * the constructor initializes the Matrix3 to the 3x3 identity matrix.
@@ -875,8 +875,8 @@ const K = class K {
    * @param n32 Input element in the third row and the second column
    * @param n33 Input element in the third row and the third column
    */
-  constructor(t, s, e, n, i, h, r, a, o) {
-    this.elements = [1, 0, 0, 0, 1, 0, 0, 0, 1], t != null && s != null && e != null && n != null && i != null && h != null && r != null && a != null && o != null && this.set(t, s, e, n, i, h, r, a, o);
+  constructor(t, s, e, n, i, r, h, a, o) {
+    this.elements = [1, 0, 0, 0, 1, 0, 0, 0, 1], t != null && s != null && e != null && n != null && i != null && r != null && h != null && a != null && o != null && this.set(t, s, e, n, i, r, h, a, o);
   }
   /**
    * Set the 3x3 matrix values to the given row-major sequence of values.
@@ -892,9 +892,9 @@ const K = class K {
    * @param n33 Input element in the third row and the third column
    * @returns Return this matrix
    */
-  set(t, s, e, n, i, h, r, a, o) {
+  set(t, s, e, n, i, r, h, a, o) {
     const c = this.elements;
-    return c[0] = t, c[1] = n, c[2] = r, c[3] = s, c[4] = i, c[5] = a, c[6] = e, c[7] = h, c[8] = o, this;
+    return c[0] = t, c[1] = n, c[2] = h, c[3] = s, c[4] = i, c[5] = a, c[6] = e, c[7] = r, c[8] = o, this;
   }
   /**
    * Reset this matrix to the 3x3 identity matrix:
@@ -954,8 +954,8 @@ const K = class K {
    * @returns Return this matrix
    */
   multiplyMatrices(t, s) {
-    const e = t.elements, n = s.elements, i = this.elements, h = e[0], r = e[3], a = e[6], o = e[1], c = e[4], l = e[7], d = e[2], m = e[5], x = e[8], g = n[0], _ = n[3], p = n[6], b = n[1], w = n[4], M = n[7], A = n[2], B = n[5], z = n[8];
-    return i[0] = h * g + r * b + a * A, i[3] = h * _ + r * w + a * B, i[6] = h * p + r * M + a * z, i[1] = o * g + c * b + l * A, i[4] = o * _ + c * w + l * B, i[7] = o * p + c * M + l * z, i[2] = d * g + m * b + x * A, i[5] = d * _ + m * w + x * B, i[8] = d * p + m * M + x * z, this;
+    const e = t.elements, n = s.elements, i = this.elements, r = e[0], h = e[3], a = e[6], o = e[1], c = e[4], l = e[7], m = e[2], d = e[5], x = e[8], g = n[0], p = n[3], _ = n[6], w = n[1], f = n[4], A = n[7], M = n[2], B = n[5], z = n[8];
+    return i[0] = r * g + h * w + a * M, i[3] = r * p + h * f + a * B, i[6] = r * _ + h * A + a * z, i[1] = o * g + c * w + l * M, i[4] = o * p + c * f + l * B, i[7] = o * _ + c * A + l * z, i[2] = m * g + d * w + x * M, i[5] = m * p + d * f + x * B, i[8] = m * _ + d * A + x * z, this;
   }
   /**
    * Multiply every component of the matrix by the scalar value s.
@@ -971,8 +971,8 @@ const K = class K {
    * @returns Return the determinant of this matrix
    */
   determinant() {
-    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], h = t[4], r = t[5], a = t[6], o = t[7], c = t[8];
-    return s * h * c - s * r * o - e * i * c + e * r * a + n * i * o - n * h * a;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], h = t[5], a = t[6], o = t[7], c = t[8];
+    return s * r * c - s * h * o - e * i * c + e * h * a + n * i * o - n * r * a;
   }
   /**
    * Invert this matrix, using the analytic method. You can not invert with a determinant of zero.
@@ -980,10 +980,10 @@ const K = class K {
    * @returns Return this matrix
    */
   invert() {
-    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], h = t[4], r = t[5], a = t[6], o = t[7], c = t[8], l = c * h - r * o, d = r * a - c * i, m = o * i - h * a, x = s * l + e * d + n * m;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], h = t[5], a = t[6], o = t[7], c = t[8], l = c * r - h * o, m = h * a - c * i, d = o * i - r * a, x = s * l + e * m + n * d;
     if (x === 0) return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0);
     const g = 1 / x;
-    return t[0] = l * g, t[1] = (n * o - c * e) * g, t[2] = (r * e - n * h) * g, t[3] = d * g, t[4] = (c * s - n * a) * g, t[5] = (n * i - r * s) * g, t[6] = m * g, t[7] = (e * a - o * s) * g, t[8] = (h * s - e * i) * g, this;
+    return t[0] = l * g, t[1] = (n * o - c * e) * g, t[2] = (h * e - n * r) * g, t[3] = m * g, t[4] = (c * s - n * a) * g, t[5] = (n * i - h * s) * g, t[6] = d * g, t[7] = (e * a - o * s) * g, t[8] = (r * s - e * i) * g, this;
   }
   /**
    * Transpose this matrix in place.
@@ -1024,15 +1024,15 @@ const K = class K {
    * @param cy Input center y of rotation
    * @returns Return this matrix
    */
-  setUvTransform(t, s, e, n, i, h, r) {
+  setUvTransform(t, s, e, n, i, r, h) {
     const a = Math.cos(i), o = Math.sin(i);
     return this.set(
       e * a,
       e * o,
-      -e * (a * h + o * r) + h + t,
+      -e * (a * r + o * h) + r + t,
       -n * o,
       n * a,
-      -n * (-o * h + a * r) + r + s,
+      -n * (-o * r + a * h) + h + s,
       0,
       0,
       1
@@ -1071,7 +1071,7 @@ const K = class K {
    * @returns Return this matrix
    */
   makeTranslation(t, s) {
-    return t instanceof f ? this.set(1, 0, t.x, 0, 1, t.y, 0, 0, 1) : this.set(1, 0, t, 0, 1, s, 0, 0, 1), this;
+    return t instanceof P ? this.set(1, 0, t.x, 0, 1, t.y, 0, 0, 1) : this.set(1, 0, t, 0, 1, s, 0, 0, 1), this;
   }
   /**
    * Set this matrix as a 2D rotational transformation by theta radians
@@ -1128,12 +1128,12 @@ const K = class K {
    * @returns Return the cloned matrix
    */
   clone() {
-    return new K().fromArray(this.elements);
+    return new H().fromArray(this.elements);
   }
 };
-K.IDENTITY = Object.freeze(new K());
-let J = K;
-const At = /* @__PURE__ */ new J(), Q = 1e-6, E = 2 * Math.PI, Ss = {
+H.IDENTITY = Object.freeze(new H());
+let v = H;
+const At = /* @__PURE__ */ new v(), Q = 1e-6, I = 2 * Math.PI, Ss = {
   x: 0,
   y: 0
 }, jt = {
@@ -1141,7 +1141,7 @@ const At = /* @__PURE__ */ new J(), Q = 1e-6, E = 2 * Math.PI, Ss = {
   y: 0,
   z: 0
 };
-class ms {
+class ds {
   /**
    * Create tolerance class with default tolerance values
    */
@@ -1155,7 +1155,7 @@ class ms {
    * @returns Return true if two poitns are equal with the specified tolerance.
    */
   equalPoint2d(t, s) {
-    return new f(t).sub(s).length() < this.equalPointTol;
+    return new P(t).sub(s).length() < this.equalPointTol;
   }
   /**
    * Return true if two points are equal with the specified tolerance.
@@ -1210,19 +1210,19 @@ class ms {
     return t - s < e;
   }
 }
-const Ft = new ms();
+const Ft = new ds();
 function Xt(u, t, s = !1) {
   const e = u.x, n = u.y;
   let i = !1;
-  const h = t.length;
-  for (let r = 0, a = h - 1; r < h; a = r++) {
-    const o = t[r].x, c = t[r].y, l = t[a].x, d = t[a].y;
-    let m = c > n != d > n;
-    s && (m = c >= n != d >= n), m && e < (l - o) * (n - c) / (d - c) + o && (i = !i);
+  const r = t.length;
+  for (let h = 0, a = r - 1; h < r; a = h++) {
+    const o = t[h].x, c = t[h].y, l = t[a].x, m = t[a].y;
+    let d = c > n != m > n;
+    s && (d = c >= n != m >= n), d && e < (l - o) * (n - c) / (m - c) + o && (i = !i);
   }
   return i;
 }
-function ds(u, t) {
+function ms(u, t) {
   if (u.length === 0 || t.length === 0)
     return !1;
   const s = new V().setFromPoints(u), e = new V().setFromPoints(t);
@@ -1237,7 +1237,7 @@ function ds(u, t) {
 }
 const xs = {
   isPointInPolygon: Xt,
-  isPolygonIntersect: ds
+  isPolygonIntersect: ms
 };
 function ys(u, t) {
   const s = [], e = t - 1, n = u;
@@ -1252,77 +1252,94 @@ function ys(u, t) {
 function gs(u, t) {
   const s = t.length - 1, e = u, n = [0];
   let i = 0;
-  for (let r = 1; r <= s; r++) {
-    const a = t[r][0] - t[r - 1][0], o = t[r][1] - t[r - 1][1], c = t[r][2] - t[r - 1][2], l = Math.sqrt(a * a + o * o + c * c);
+  for (let h = 1; h <= s; h++) {
+    const a = t[h][0] - t[h - 1][0], o = t[h][1] - t[h - 1][1], c = t[h][2] - t[h - 1][2], l = Math.sqrt(a * a + o * o + c * c);
     i += l, n.push(i);
   }
-  const h = [];
-  for (let r = 0; r <= e; r++)
-    h.push(0);
-  for (let r = 1; r <= s - e; r++) {
-    const a = n[r] / i;
-    h.push(a * (s - e + 1));
+  const r = [];
+  for (let h = 0; h <= e; h++)
+    r.push(0);
+  for (let h = 1; h <= s - e; h++) {
+    const a = n[h] / i;
+    r.push(a * (s - e + 1));
   }
-  for (let r = 0; r <= e; r++)
-    h.push(s - e + 1);
-  return h;
+  for (let h = 0; h <= e; h++)
+    r.push(s - e + 1);
+  return r;
 }
 function _s(u, t) {
   const s = t.length - 1, e = u, n = [0];
   let i = 0;
-  for (let r = 1; r <= s; r++) {
-    const a = t[r][0] - t[r - 1][0], o = t[r][1] - t[r - 1][1], c = t[r][2] - t[r - 1][2], l = Math.sqrt(a * a + o * o + c * c), d = Math.sqrt(l);
-    i += d, n.push(i);
-  }
-  const h = [];
-  for (let r = 0; r <= e; r++)
-    h.push(0);
-  for (let r = 1; r <= s - e; r++) {
-    const a = n[r] / i;
-    h.push(a * (s - e + 1));
-  }
-  for (let r = 0; r <= e; r++)
-    h.push(s - e + 1);
-  return h;
+  for (let h = 1; h <= s; h++) {
+    const a = t[h][0] - t[h - 1][0], o = t[h][1] - t[h - 1][1], c = t[h][2] - t[h - 1][2], l = Math.sqrt(a * a + o * o + c * c), m = Math.sqrt(l);
+    i += m, n.push(i);
+  }
+  const r = [];
+  for (let h = 0; h <= e; h++)
+    r.push(0);
+  for (let h = 1; h <= s - e; h++) {
+    const a = n[h] / i;
+    r.push(a * (s - e + 1));
+  }
+  for (let h = 0; h <= e; h++)
+    r.push(s - e + 1);
+  return r;
 }
-function Pt(u, t, s, e) {
+function bt(u, t, s, e) {
   if (t === 0)
     return s >= e[u] && s < e[u + 1] ? 1 : 0;
-  const n = e[u + t] - e[u], i = e[u + t + 1] - e[u + 1], h = n > 1e-10 ? (s - e[u]) / n : 0, r = i > 1e-10 ? (e[u + t + 1] - s) / i : 0;
-  return h * Pt(u, t - 1, s, e) + r * Pt(u + 1, t - 1, s, e);
+  const n = e[u + t] - e[u], i = e[u + t + 1] - e[u + 1], r = n > 1e-10 ? (s - e[u]) / n : 0, h = i > 1e-10 ? (e[u + t + 1] - s) / i : 0;
+  return r * bt(u, t - 1, s, e) + h * bt(u + 1, t - 1, s, e);
 }
-function bt(u, t, s, e, n) {
-  const i = e.length - 1, h = t;
-  u = Math.max(s[h], Math.min(s[i + 1], u));
-  const r = [0, 0, 0];
+function xt(u, t, s, e, n) {
+  const i = e.length - 1, r = t;
+  if (u = Math.max(s[r], Math.min(s[i + 1], u)), Math.abs(u - s[i + 1]) < 1e-8)
+    return [...e[i]];
+  if (Math.abs(u - s[r]) < 1e-8)
+    return [...e[0]];
+  const h = [0, 0, 0];
   let a = 0;
   for (let o = 0; o <= i; o++) {
-    const c = Pt(o, h, u, s), l = n[o] * c;
-    r[0] += e[o][0] * l, r[1] += e[o][1] * l, r[2] += e[o][2] * l, a += l;
+    const c = bt(o, r, u, s), l = n[o] * c;
+    h[0] += e[o][0] * l, h[1] += e[o][1] * l, h[2] += e[o][2] * l, a += l;
+  }
+  if (a < 1e-10) {
+    const o = s[s.length - r - 1];
+    if (Math.abs(u - o) < 1e-8)
+      return [...e[i]];
+    if (Math.abs(u - s[r]) < 1e-8)
+      return [...e[0]];
   }
-  return a > 1e-10 && (r[0] /= a, r[1] /= a, r[2] /= a), r;
+  return a > 1e-10 && (h[0] /= a, h[1] /= a, h[2] /= a), h;
 }
 function ps(u, t, s, e) {
-  const n = u, i = t[n], h = t[t.length - n - 1];
-  let r = 0;
-  const a = 1e3, o = (h - i) / a;
-  let c = bt(
+  const n = u, i = t[n], r = t[t.length - n - 1];
+  let h = 0;
+  const a = 1e3, o = (r - i) / a;
+  let c = xt(
     i,
     u,
     t,
     s,
     e
   );
-  for (let l = 1; l <= a; l++) {
-    const d = i + l * o, m = bt(d, u, t, s, e), x = m[0] - c[0], g = m[1] - c[1], _ = m[2] - c[2];
-    r += Math.sqrt(x * x + g * g + _ * _), c = m;
+  for (let g = 1; g <= a; g++) {
+    const p = i + g * o, _ = xt(p, u, t, s, e), w = _[0] - c[0], f = _[1] - c[1], A = _[2] - c[2];
+    h += Math.sqrt(w * w + f * f + A * A), c = _;
   }
-  return r;
+  const l = xt(
+    r,
+    u,
+    t,
+    s,
+    e
+  ), m = l[0] - c[0], d = l[1] - c[1], x = l[2] - c[2];
+  return h += Math.sqrt(m * m + d * d + x * x), h;
 }
 function zs(u) {
   return u.map((t) => [...t]);
 }
-class _t {
+class pt {
   /**
    * Create one instance of this class
    * @param x Input x coordinate
@@ -1343,28 +1360,28 @@ class _t {
    * @param srcOffset1 Input an offset into the array src1.
    * @param t Input normalized interpolation factor (between 0 and 1).
    */
-  static slerpFlat(t, s, e, n, i, h, r) {
+  static slerpFlat(t, s, e, n, i, r, h) {
     let a = e[n + 0], o = e[n + 1], c = e[n + 2], l = e[n + 3];
-    const d = i[h + 0], m = i[h + 1], x = i[h + 2], g = i[h + 3];
-    if (r === 0) {
+    const m = i[r + 0], d = i[r + 1], x = i[r + 2], g = i[r + 3];
+    if (h === 0) {
       t[s + 0] = a, t[s + 1] = o, t[s + 2] = c, t[s + 3] = l;
       return;
     }
-    if (r === 1) {
-      t[s + 0] = d, t[s + 1] = m, t[s + 2] = x, t[s + 3] = g;
+    if (h === 1) {
+      t[s + 0] = m, t[s + 1] = d, t[s + 2] = x, t[s + 3] = g;
       return;
     }
-    if (l !== g || a !== d || o !== m || c !== x) {
-      let _ = 1 - r;
-      const p = a * d + o * m + c * x + l * g, b = p >= 0 ? 1 : -1, w = 1 - p * p;
-      if (w > Number.EPSILON) {
-        const A = Math.sqrt(w), B = Math.atan2(A, p * b);
-        _ = Math.sin(_ * B) / A, r = Math.sin(r * B) / A;
+    if (l !== g || a !== m || o !== d || c !== x) {
+      let p = 1 - h;
+      const _ = a * m + o * d + c * x + l * g, w = _ >= 0 ? 1 : -1, f = 1 - _ * _;
+      if (f > Number.EPSILON) {
+        const M = Math.sqrt(f), B = Math.atan2(M, _ * w);
+        p = Math.sin(p * B) / M, h = Math.sin(h * B) / M;
       }
-      const M = r * b;
-      if (a = a * _ + d * M, o = o * _ + m * M, c = c * _ + x * M, l = l * _ + g * M, _ === 1 - r) {
-        const A = 1 / Math.sqrt(a * a + o * o + c * c + l * l);
-        a *= A, o *= A, c *= A, l *= A;
+      const A = h * w;
+      if (a = a * p + m * A, o = o * p + d * A, c = c * p + x * A, l = l * p + g * A, p === 1 - h) {
+        const M = 1 / Math.sqrt(a * a + o * o + c * c + l * l);
+        a *= M, o *= M, c *= M, l *= M;
       }
     }
     t[s] = a, t[s + 1] = o, t[s + 2] = c, t[s + 3] = l;
@@ -1379,9 +1396,9 @@ class _t {
    * @param srcOffset1 Input an offset into the array src1.
    * @returns Return an array
    */
-  static multiplyQuaternionsFlat(t, s, e, n, i, h) {
-    const r = e[n], a = e[n + 1], o = e[n + 2], c = e[n + 3], l = i[h], d = i[h + 1], m = i[h + 2], x = i[h + 3];
-    return t[s] = r * x + c * l + a * m - o * d, t[s + 1] = a * x + c * d + o * l - r * m, t[s + 2] = o * x + c * m + r * d - a * l, t[s + 3] = c * x - r * l - a * d - o * m, t;
+  static multiplyQuaternionsFlat(t, s, e, n, i, r) {
+    const h = e[n], a = e[n + 1], o = e[n + 2], c = e[n + 3], l = i[r], m = i[r + 1], d = i[r + 2], x = i[r + 3];
+    return t[s] = h * x + c * l + a * d - o * m, t[s + 1] = a * x + c * m + o * l - h * d, t[s + 2] = o * x + c * d + h * m - a * l, t[s + 3] = c * x - h * l - a * m - o * d, t;
   }
   /**
    * X cooridinate
@@ -1435,7 +1452,7 @@ class _t {
    * @returns Return cloned instance
    */
   clone() {
-    return new _t(this._x, this._y, this._z, this._w);
+    return new pt(this._x, this._y, this._z, this._w);
   }
   /**
    * Copy the x, y, z and w properties of q into this quaternion.
@@ -1452,29 +1469,29 @@ class _t {
    * @returns Return this quaternion
    */
   setFromEuler(t, s = !0) {
-    const e = t.x, n = t.y, i = t.z, h = t.order, r = Math.cos, a = Math.sin, o = r(e / 2), c = r(n / 2), l = r(i / 2), d = a(e / 2), m = a(n / 2), x = a(i / 2);
-    switch (h) {
+    const e = t.x, n = t.y, i = t.z, r = t.order, h = Math.cos, a = Math.sin, o = h(e / 2), c = h(n / 2), l = h(i / 2), m = a(e / 2), d = a(n / 2), x = a(i / 2);
+    switch (r) {
       case "XYZ":
-        this._x = d * c * l + o * m * x, this._y = o * m * l - d * c * x, this._z = o * c * x + d * m * l, this._w = o * c * l - d * m * x;
+        this._x = m * c * l + o * d * x, this._y = o * d * l - m * c * x, this._z = o * c * x + m * d * l, this._w = o * c * l - m * d * x;
         break;
       case "YXZ":
-        this._x = d * c * l + o * m * x, this._y = o * m * l - d * c * x, this._z = o * c * x - d * m * l, this._w = o * c * l + d * m * x;
+        this._x = m * c * l + o * d * x, this._y = o * d * l - m * c * x, this._z = o * c * x - m * d * l, this._w = o * c * l + m * d * x;
         break;
       case "ZXY":
-        this._x = d * c * l - o * m * x, this._y = o * m * l + d * c * x, this._z = o * c * x + d * m * l, this._w = o * c * l - d * m * x;
+        this._x = m * c * l - o * d * x, this._y = o * d * l + m * c * x, this._z = o * c * x + m * d * l, this._w = o * c * l - m * d * x;
         break;
       case "ZYX":
-        this._x = d * c * l - o * m * x, this._y = o * m * l + d * c * x, this._z = o * c * x - d * m * l, this._w = o * c * l + d * m * x;
+        this._x = m * c * l - o * d * x, this._y = o * d * l + m * c * x, this._z = o * c * x - m * d * l, this._w = o * c * l + m * d * x;
         break;
       case "YZX":
-        this._x = d * c * l + o * m * x, this._y = o * m * l + d * c * x, this._z = o * c * x - d * m * l, this._w = o * c * l - d * m * x;
+        this._x = m * c * l + o * d * x, this._y = o * d * l + m * c * x, this._z = o * c * x - m * d * l, this._w = o * c * l - m * d * x;
         break;
       case "XZY":
-        this._x = d * c * l - o * m * x, this._y = o * m * l - d * c * x, this._z = o * c * x + d * m * l, this._w = o * c * l + d * m * x;
+        this._x = m * c * l - o * d * x, this._y = o * d * l - m * c * x, this._z = o * c * x + m * d * l, this._w = o * c * l + m * d * x;
         break;
       default:
         console.warn(
-          "THREE.Quaternion: .setFromEuler() encountered an unknown order: " + h
+          "THREE.Quaternion: .setFromEuler() encountered an unknown order: " + r
         );
     }
     return s === !0 && this._onChangeCallback(), this;
@@ -1496,19 +1513,19 @@ class _t {
    * @returns Return this quaternion
    */
   setFromRotationMatrix(t) {
-    const s = t.elements, e = s[0], n = s[4], i = s[8], h = s[1], r = s[5], a = s[9], o = s[2], c = s[6], l = s[10], d = e + r + l;
-    if (d > 0) {
-      const m = 0.5 / Math.sqrt(d + 1);
-      this._w = 0.25 / m, this._x = (c - a) * m, this._y = (i - o) * m, this._z = (h - n) * m;
-    } else if (e > r && e > l) {
-      const m = 2 * Math.sqrt(1 + e - r - l);
-      this._w = (c - a) / m, this._x = 0.25 * m, this._y = (n + h) / m, this._z = (i + o) / m;
-    } else if (r > l) {
-      const m = 2 * Math.sqrt(1 + r - e - l);
-      this._w = (i - o) / m, this._x = (n + h) / m, this._y = 0.25 * m, this._z = (a + c) / m;
+    const s = t.elements, e = s[0], n = s[4], i = s[8], r = s[1], h = s[5], a = s[9], o = s[2], c = s[6], l = s[10], m = e + h + l;
+    if (m > 0) {
+      const d = 0.5 / Math.sqrt(m + 1);
+      this._w = 0.25 / d, this._x = (c - a) * d, this._y = (i - o) * d, this._z = (r - n) * d;
+    } else if (e > h && e > l) {
+      const d = 2 * Math.sqrt(1 + e - h - l);
+      this._w = (c - a) / d, this._x = 0.25 * d, this._y = (n + r) / d, this._z = (i + o) / d;
+    } else if (h > l) {
+      const d = 2 * Math.sqrt(1 + h - e - l);
+      this._w = (i - o) / d, this._x = (n + r) / d, this._y = 0.25 * d, this._z = (a + c) / d;
     } else {
-      const m = 2 * Math.sqrt(1 + l - e - r);
-      this._w = (h - n) / m, this._x = (i + o) / m, this._y = (a + c) / m, this._z = 0.25 * m;
+      const d = 2 * Math.sqrt(1 + l - e - h);
+      this._w = (r - n) / d, this._x = (i + o) / d, this._y = (a + c) / d, this._z = 0.25 * d;
     }
     return this._onChangeCallback(), this;
   }
@@ -1625,8 +1642,8 @@ class _t {
    * @returns Return this quaternion
    */
   multiplyQuaternions(t, s) {
-    const e = t._x, n = t._y, i = t._z, h = t._w, r = s._x, a = s._y, o = s._z, c = s._w;
-    return this._x = e * c + h * r + n * o - i * a, this._y = n * c + h * a + i * r - e * o, this._z = i * c + h * o + e * a - n * r, this._w = h * c - e * r - n * a - i * o, this._onChangeCallback(), this;
+    const e = t._x, n = t._y, i = t._z, r = t._w, h = s._x, a = s._y, o = s._z, c = s._w;
+    return this._x = e * c + r * h + n * o - i * a, this._y = n * c + r * a + i * h - e * o, this._z = i * c + r * o + e * a - n * h, this._w = r * c - e * h - n * a - i * o, this._onChangeCallback(), this;
   }
   /**
    * Handles the spherical linear interpolation between quaternions. t represents the amount of rotation
@@ -1638,17 +1655,17 @@ class _t {
   slerp(t, s) {
     if (s === 0) return this;
     if (s === 1) return this.copy(t);
-    const e = this._x, n = this._y, i = this._z, h = this._w;
-    let r = h * t._w + e * t._x + n * t._y + i * t._z;
-    if (r < 0 ? (this._w = -t._w, this._x = -t._x, this._y = -t._y, this._z = -t._z, r = -r) : this.copy(t), r >= 1)
-      return this._w = h, this._x = e, this._y = n, this._z = i, this;
-    const a = 1 - r * r;
+    const e = this._x, n = this._y, i = this._z, r = this._w;
+    let h = r * t._w + e * t._x + n * t._y + i * t._z;
+    if (h < 0 ? (this._w = -t._w, this._x = -t._x, this._y = -t._y, this._z = -t._z, h = -h) : this.copy(t), h >= 1)
+      return this._w = r, this._x = e, this._y = n, this._z = i, this;
+    const a = 1 - h * h;
     if (a <= Number.EPSILON) {
-      const m = 1 - s;
-      return this._w = m * h + s * this._w, this._x = m * e + s * this._x, this._y = m * n + s * this._y, this._z = m * i + s * this._z, this.normalize(), this;
+      const d = 1 - s;
+      return this._w = d * r + s * this._w, this._x = d * e + s * this._x, this._y = d * n + s * this._y, this._z = d * i + s * this._z, this.normalize(), this;
     }
-    const o = Math.sqrt(a), c = Math.atan2(o, r), l = Math.sin((1 - s) * c) / o, d = Math.sin(s * c) / o;
-    return this._w = h * l + this._w * d, this._x = e * l + this._x * d, this._y = n * l + this._y * d, this._z = i * l + this._z * d, this._onChangeCallback(), this;
+    const o = Math.sqrt(a), c = Math.atan2(o, h), l = Math.sin((1 - s) * c) / o, m = Math.sin(s * c) / o;
+    return this._w = r * l + this._w * m, this._x = e * l + this._x * m, this._y = n * l + this._y * m, this._z = i * l + this._z * m, this._onChangeCallback(), this;
   }
   /**
    * Perform a spherical linear interpolation between the given quaternions and stores the result in
@@ -1727,8 +1744,8 @@ const N = class N {
         return;
       }
       if (n === 1) {
-        const { x: i, y: h, z: r } = t;
-        this.x = i, this.y = h, this.z = r || 0;
+        const { x: i, y: r, z: h } = t;
+        this.x = i, this.y = r, this.z = h || 0;
         return;
       }
       if (n === 3) {
@@ -1930,7 +1947,7 @@ const N = class N {
    * @returns Return this vector
    */
   applyEuler(t) {
-    return this.applyQuaternion(Bt.setFromEuler(t));
+    return this.applyQuaternion(Ct.setFromEuler(t));
   }
   /**
    * Apply a rotation specified by an axis and an angle to this vector.
@@ -1939,7 +1956,7 @@ const N = class N {
    * @returns Return this vector
    */
   applyAxisAngle(t, s) {
-    return this.applyQuaternion(Bt.setFromAxisAngle(t, s));
+    return this.applyQuaternion(Ct.setFromAxisAngle(t, s));
   }
   /**
    * Multipliy this vector by m
@@ -1964,8 +1981,8 @@ const N = class N {
    * @returns Return this vector
    */
   applyMatrix3d(t) {
-    const s = this.x, e = this.y, n = this.z, i = t.elements, h = 1 / (i[3] * s + i[7] * e + i[11] * n + i[15]);
-    return this.x = (i[0] * s + i[4] * e + i[8] * n + i[12]) * h, this.y = (i[1] * s + i[5] * e + i[9] * n + i[13]) * h, this.z = (i[2] * s + i[6] * e + i[10] * n + i[14]) * h, this;
+    const s = this.x, e = this.y, n = this.z, i = t.elements, r = 1 / (i[3] * s + i[7] * e + i[11] * n + i[15]);
+    return this.x = (i[0] * s + i[4] * e + i[8] * n + i[12]) * r, this.y = (i[1] * s + i[5] * e + i[9] * n + i[13]) * r, this.z = (i[2] * s + i[6] * e + i[10] * n + i[14]) * r, this;
   }
   /**
    * Apply a quaternion transform to this vector.
@@ -1973,8 +1990,8 @@ const N = class N {
    * @returns Return this vector
    */
   applyQuaternion(t) {
-    const s = this.x, e = this.y, n = this.z, i = t.x, h = t.y, r = t.z, a = t.w, o = 2 * (h * n - r * e), c = 2 * (r * s - i * n), l = 2 * (i * e - h * s);
-    return this.x = s + a * o + h * l - r * c, this.y = e + a * c + r * o - i * l, this.z = n + a * l + i * c - h * o, this;
+    const s = this.x, e = this.y, n = this.z, i = t.x, r = t.y, h = t.z, a = t.w, o = 2 * (r * n - h * e), c = 2 * (h * s - i * n), l = 2 * (i * e - r * s);
+    return this.x = s + a * o + r * l - h * c, this.y = e + a * c + h * o - i * l, this.z = n + a * l + i * c - r * o, this;
   }
   /**
    * Transforms the direction of this vector by a matrix (the upper left 3 x 3 subset of a m) and
@@ -2185,8 +2202,8 @@ const N = class N {
    * @returns Return this vector
    */
   crossVectors(t, s) {
-    const e = t.x, n = t.y, i = t.z, h = s.x, r = s.y, a = s.z;
-    return this.x = n * a - i * r, this.y = i * h - e * a, this.z = e * r - n * h, this;
+    const e = t.x, n = t.y, i = t.z, r = s.x, h = s.y, a = s.z;
+    return this.x = n * a - i * h, this.y = i * r - e * a, this.z = e * h - n * r, this;
   }
   /**
    * Project this vector onto v.
@@ -2206,7 +2223,7 @@ const N = class N {
    * @returns Return this vector
    */
   projectOnPlane(t) {
-    return Mt.copy(this).projectOnVector(t), this.sub(Mt);
+    return ft.copy(this).projectOnVector(t), this.sub(ft);
   }
   /**
    * Reflect this vector off of plane orthogonal to normal. Normal is assumed to have unit length.
@@ -2214,7 +2231,7 @@ const N = class N {
    * @returns Return this vector
    */
   reflect(t) {
-    return this.sub(Mt.copy(t).multiplyScalar(2 * this.dot(t)));
+    return this.sub(ft.copy(t).multiplyScalar(2 * this.dot(t)));
   }
   /**
    * Return the angle between this vector and vector v in radians.
@@ -2357,7 +2374,7 @@ const N = class N {
 };
 N.X_AXIS = Object.freeze(new N(1, 0, 0)), N.NEGATIVE_X_AXIS = Object.freeze(new N(-1, 0, 0)), N.Y_AXIS = Object.freeze(new N(0, 1, 0)), N.NEGATIVE_Y_AXIS = Object.freeze(new N(0, -1, 0)), N.Z_AXIS = Object.freeze(new N(0, 0, 1)), N.NEGATIVE_Z_AXIS = Object.freeze(new N(0, 0, -1));
 let y = N;
-const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
+const ft = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
   /**
    * Create a 4x4 matrix with the given arguments in row-major order. If no arguments are provided,
    * the constructor initializes the Matrix4 to the 4x4 identity matrix.
@@ -2379,24 +2396,24 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @param n43 Input element in the forth row and the third column
    * @param n44 Input element in the forth row and the forth column
    */
-  constructor(t, s, e, n, i, h, r, a, o, c, l, d, m, x, g, _) {
-    this.elements = [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1], t != null && s != null && e != null && n != null && i != null && h != null && r != null && a != null && o != null && c != null && l != null && d != null && m != null && x != null && g != null && _ != null && this.set(
+  constructor(t, s, e, n, i, r, h, a, o, c, l, m, d, x, g, p) {
+    this.elements = [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1], t != null && s != null && e != null && n != null && i != null && r != null && h != null && a != null && o != null && c != null && l != null && m != null && d != null && x != null && g != null && p != null && this.set(
       t,
       s,
       e,
       n,
       i,
-      h,
       r,
+      h,
       a,
       o,
       c,
       l,
-      d,
       m,
+      d,
       x,
       g,
-      _
+      p
     );
   }
   /**
@@ -2420,9 +2437,9 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @param n44 Input element in the forth row and the forth column
    * @returns Return this matrix
    */
-  set(t, s, e, n, i, h, r, a, o, c, l, d, m, x, g, _) {
-    const p = this.elements;
-    return p[0] = t, p[4] = s, p[8] = e, p[12] = n, p[1] = i, p[5] = h, p[9] = r, p[13] = a, p[2] = o, p[6] = c, p[10] = l, p[14] = d, p[3] = m, p[7] = x, p[11] = g, p[15] = _, this;
+  set(t, s, e, n, i, r, h, a, o, c, l, m, d, x, g, p) {
+    const _ = this.elements;
+    return _[0] = t, _[4] = s, _[8] = e, _[12] = n, _[1] = i, _[5] = r, _[9] = h, _[13] = a, _[2] = o, _[6] = c, _[10] = l, _[14] = m, _[3] = d, _[7] = x, _[11] = g, _[15] = p, this;
   }
   /**
    * Reset this matrix to the identity matrix.
@@ -2554,8 +2571,8 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @returns Return this matrix
    */
   extractRotation(t) {
-    const s = this.elements, e = t.elements, n = 1 / O.setFromMatrixColumn(t, 0).length(), i = 1 / O.setFromMatrixColumn(t, 1).length(), h = 1 / O.setFromMatrixColumn(t, 2).length();
-    return s[0] = e[0] * n, s[1] = e[1] * n, s[2] = e[2] * n, s[3] = 0, s[4] = e[4] * i, s[5] = e[5] * i, s[6] = e[6] * i, s[7] = 0, s[8] = e[8] * h, s[9] = e[9] * h, s[10] = e[10] * h, s[11] = 0, s[12] = 0, s[13] = 0, s[14] = 0, s[15] = 1, this;
+    const s = this.elements, e = t.elements, n = 1 / O.setFromMatrixColumn(t, 0).length(), i = 1 / O.setFromMatrixColumn(t, 1).length(), r = 1 / O.setFromMatrixColumn(t, 2).length();
+    return s[0] = e[0] * n, s[1] = e[1] * n, s[2] = e[2] * n, s[3] = 0, s[4] = e[4] * i, s[5] = e[5] * i, s[6] = e[6] * i, s[7] = 0, s[8] = e[8] * r, s[9] = e[9] * r, s[10] = e[10] * r, s[11] = 0, s[12] = 0, s[13] = 0, s[14] = 0, s[15] = 1, this;
   }
   // makeRotationFromEuler(euler) {
   //   const te = this.elements
@@ -2670,7 +2687,7 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @returns Return this matrix
    */
   makeRotationFromQuaternion(t) {
-    return this.compose(As, t, Ms);
+    return this.compose(Ms, t, As);
   }
   /**
    * Construct a rotation matrix, looking from eye towards target oriented by the up vector.
@@ -2706,8 +2723,8 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @returns Return this matrix
    */
   multiplyMatrices(t, s) {
-    const e = t.elements, n = s.elements, i = this.elements, h = e[0], r = e[4], a = e[8], o = e[12], c = e[1], l = e[5], d = e[9], m = e[13], x = e[2], g = e[6], _ = e[10], p = e[14], b = e[3], w = e[7], M = e[11], A = e[15], B = n[0], z = n[4], C = n[8], Y = n[12], Z = n[1], F = n[5], G = n[9], et = n[13], nt = n[2], it = n[6], rt = n[10], ht = n[14], ot = n[3], at = n[7], ct = n[11], lt = n[15];
-    return i[0] = h * B + r * Z + a * nt + o * ot, i[4] = h * z + r * F + a * it + o * at, i[8] = h * C + r * G + a * rt + o * ct, i[12] = h * Y + r * et + a * ht + o * lt, i[1] = c * B + l * Z + d * nt + m * ot, i[5] = c * z + l * F + d * it + m * at, i[9] = c * C + l * G + d * rt + m * ct, i[13] = c * Y + l * et + d * ht + m * lt, i[2] = x * B + g * Z + _ * nt + p * ot, i[6] = x * z + g * F + _ * it + p * at, i[10] = x * C + g * G + _ * rt + p * ct, i[14] = x * Y + g * et + _ * ht + p * lt, i[3] = b * B + w * Z + M * nt + A * ot, i[7] = b * z + w * F + M * it + A * at, i[11] = b * C + w * G + M * rt + A * ct, i[15] = b * Y + w * et + M * ht + A * lt, this;
+    const e = t.elements, n = s.elements, i = this.elements, r = e[0], h = e[4], a = e[8], o = e[12], c = e[1], l = e[5], m = e[9], d = e[13], x = e[2], g = e[6], p = e[10], _ = e[14], w = e[3], f = e[7], A = e[11], M = e[15], B = n[0], z = n[4], E = n[8], Z = n[12], G = n[1], F = n[5], K = n[9], et = n[13], nt = n[2], it = n[6], rt = n[10], ht = n[14], ot = n[3], at = n[7], ct = n[11], lt = n[15];
+    return i[0] = r * B + h * G + a * nt + o * ot, i[4] = r * z + h * F + a * it + o * at, i[8] = r * E + h * K + a * rt + o * ct, i[12] = r * Z + h * et + a * ht + o * lt, i[1] = c * B + l * G + m * nt + d * ot, i[5] = c * z + l * F + m * it + d * at, i[9] = c * E + l * K + m * rt + d * ct, i[13] = c * Z + l * et + m * ht + d * lt, i[2] = x * B + g * G + p * nt + _ * ot, i[6] = x * z + g * F + p * it + _ * at, i[10] = x * E + g * K + p * rt + _ * ct, i[14] = x * Z + g * et + p * ht + _ * lt, i[3] = w * B + f * G + A * nt + M * ot, i[7] = w * z + f * F + A * it + M * at, i[11] = w * E + f * K + A * rt + M * ct, i[15] = w * Z + f * et + A * ht + M * lt, this;
   }
   /**
    * Multiply every component of the matrix by a scalar value s.
@@ -2723,8 +2740,8 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @returns Return the determinant of this matrix.
    */
   determinant() {
-    const t = this.elements, s = t[0], e = t[4], n = t[8], i = t[12], h = t[1], r = t[5], a = t[9], o = t[13], c = t[2], l = t[6], d = t[10], m = t[14], x = t[3], g = t[7], _ = t[11], p = t[15];
-    return x * (+i * a * l - n * o * l - i * r * d + e * o * d + n * r * m - e * a * m) + g * (+s * a * m - s * o * d + i * h * d - n * h * m + n * o * c - i * a * c) + _ * (+s * o * l - s * r * m - i * h * l + e * h * m + i * r * c - e * o * c) + p * (-n * r * c - s * a * l + s * r * d + n * h * l - e * h * d + e * a * c);
+    const t = this.elements, s = t[0], e = t[4], n = t[8], i = t[12], r = t[1], h = t[5], a = t[9], o = t[13], c = t[2], l = t[6], m = t[10], d = t[14], x = t[3], g = t[7], p = t[11], _ = t[15];
+    return x * (+i * a * l - n * o * l - i * h * m + e * o * m + n * h * d - e * a * d) + g * (+s * a * d - s * o * m + i * r * m - n * r * d + n * o * c - i * a * c) + p * (+s * o * l - s * h * d - i * r * l + e * r * d + i * h * c - e * o * c) + _ * (-n * h * c - s * a * l + s * h * m + n * r * l - e * r * m + e * a * c);
   }
   /**
    * Transposes this matrix.
@@ -2752,11 +2769,11 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @returns Return this matrix
    */
   invert() {
-    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], h = t[4], r = t[5], a = t[6], o = t[7], c = t[8], l = t[9], d = t[10], m = t[11], x = t[12], g = t[13], _ = t[14], p = t[15], b = l * _ * o - g * d * o + g * a * m - r * _ * m - l * a * p + r * d * p, w = x * d * o - c * _ * o - x * a * m + h * _ * m + c * a * p - h * d * p, M = c * g * o - x * l * o + x * r * m - h * g * m - c * r * p + h * l * p, A = x * l * a - c * g * a - x * r * d + h * g * d + c * r * _ - h * l * _, B = s * b + e * w + n * M + i * A;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], h = t[5], a = t[6], o = t[7], c = t[8], l = t[9], m = t[10], d = t[11], x = t[12], g = t[13], p = t[14], _ = t[15], w = l * p * o - g * m * o + g * a * d - h * p * d - l * a * _ + h * m * _, f = x * m * o - c * p * o - x * a * d + r * p * d + c * a * _ - r * m * _, A = c * g * o - x * l * o + x * h * d - r * g * d - c * h * _ + r * l * _, M = x * l * a - c * g * a - x * h * m + r * g * m + c * h * p - r * l * p, B = s * w + e * f + n * A + i * M;
     if (B === 0)
       return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
     const z = 1 / B;
-    return t[0] = b * z, t[1] = (g * d * i - l * _ * i - g * n * m + e * _ * m + l * n * p - e * d * p) * z, t[2] = (r * _ * i - g * a * i + g * n * o - e * _ * o - r * n * p + e * a * p) * z, t[3] = (l * a * i - r * d * i - l * n * o + e * d * o + r * n * m - e * a * m) * z, t[4] = w * z, t[5] = (c * _ * i - x * d * i + x * n * m - s * _ * m - c * n * p + s * d * p) * z, t[6] = (x * a * i - h * _ * i - x * n * o + s * _ * o + h * n * p - s * a * p) * z, t[7] = (h * d * i - c * a * i + c * n * o - s * d * o - h * n * m + s * a * m) * z, t[8] = M * z, t[9] = (x * l * i - c * g * i - x * e * m + s * g * m + c * e * p - s * l * p) * z, t[10] = (h * g * i - x * r * i + x * e * o - s * g * o - h * e * p + s * r * p) * z, t[11] = (c * r * i - h * l * i - c * e * o + s * l * o + h * e * m - s * r * m) * z, t[12] = A * z, t[13] = (c * g * n - x * l * n + x * e * d - s * g * d - c * e * _ + s * l * _) * z, t[14] = (x * r * n - h * g * n - x * e * a + s * g * a + h * e * _ - s * r * _) * z, t[15] = (h * l * n - c * r * n + c * e * a - s * l * a - h * e * d + s * r * d) * z, this;
+    return t[0] = w * z, t[1] = (g * m * i - l * p * i - g * n * d + e * p * d + l * n * _ - e * m * _) * z, t[2] = (h * p * i - g * a * i + g * n * o - e * p * o - h * n * _ + e * a * _) * z, t[3] = (l * a * i - h * m * i - l * n * o + e * m * o + h * n * d - e * a * d) * z, t[4] = f * z, t[5] = (c * p * i - x * m * i + x * n * d - s * p * d - c * n * _ + s * m * _) * z, t[6] = (x * a * i - r * p * i - x * n * o + s * p * o + r * n * _ - s * a * _) * z, t[7] = (r * m * i - c * a * i + c * n * o - s * m * o - r * n * d + s * a * d) * z, t[8] = A * z, t[9] = (x * l * i - c * g * i - x * e * d + s * g * d + c * e * _ - s * l * _) * z, t[10] = (r * g * i - x * h * i + x * e * o - s * g * o - r * e * _ + s * h * _) * z, t[11] = (c * h * i - r * l * i - c * e * o + s * l * o + r * e * d - s * h * d) * z, t[12] = M * z, t[13] = (c * g * n - x * l * n + x * e * m - s * g * m - c * e * p + s * l * p) * z, t[14] = (x * h * n - r * g * n - x * e * a + s * g * a + r * e * p - s * h * p) * z, t[15] = (r * l * n - c * h * n + c * e * a - s * l * a - r * e * m + s * h * m) * z, this;
   }
   /**
    * Multiply the columns of this matrix by vector v.
@@ -2819,18 +2836,18 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @returns Return this matrix
    */
   makeRotationAxis(t, s) {
-    const e = Math.cos(s), n = Math.sin(s), i = 1 - e, h = t.x, r = t.y, a = t.z, o = i * h, c = i * r;
+    const e = Math.cos(s), n = Math.sin(s), i = 1 - e, r = t.x, h = t.y, a = t.z, o = i * r, c = i * h;
     return this.set(
-      o * h + e,
-      o * r - n * a,
-      o * a + n * r,
+      o * r + e,
+      o * h - n * a,
+      o * a + n * h,
       0,
-      o * r + n * a,
-      c * r + e,
-      c * a - n * h,
+      o * h + n * a,
+      c * h + e,
+      c * a - n * r,
       0,
-      o * a - n * r,
-      c * a + n * h,
+      o * a - n * h,
+      c * a + n * r,
       i * a * a + e,
       0,
       0,
@@ -2859,8 +2876,8 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @param zy Input the amount to shear Z by Y.
    * @returns Return this matrix
    */
-  makeShear(t, s, e, n, i, h) {
-    return this.set(1, e, i, 0, t, 1, h, 0, s, n, 1, 0, 0, 0, 0, 1), this;
+  makeShear(t, s, e, n, i, r) {
+    return this.set(1, e, i, 0, t, 1, r, 0, s, n, 1, 0, 0, 0, 0, 1), this;
   }
   /**
    * Set this matrix to the transformation composed of position, quaternion and scale.
@@ -2870,8 +2887,8 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
    * @returns Return this matrix
    */
   compose(t, s, e) {
-    const n = this.elements, i = s.x, h = s.y, r = s.z, a = s.w, o = i + i, c = h + h, l = r + r, d = i * o, m = i * c, x = i * l, g = h * c, _ = h * l, p = r * l, b = a * o, w = a * c, M = a * l, A = e.x, B = e.y, z = e.z;
-    return n[0] = (1 - (g + p)) * A, n[1] = (m + M) * A, n[2] = (x - w) * A, n[3] = 0, n[4] = (m - M) * B, n[5] = (1 - (d + p)) * B, n[6] = (_ + b) * B, n[7] = 0, n[8] = (x + w) * z, n[9] = (_ - b) * z, n[10] = (1 - (d + g)) * z, n[11] = 0, n[12] = t.x, n[13] = t.y, n[14] = t.z, n[15] = 1, this;
+    const n = this.elements, i = s.x, r = s.y, h = s.z, a = s.w, o = i + i, c = r + r, l = h + h, m = i * o, d = i * c, x = i * l, g = r * c, p = r * l, _ = h * l, w = a * o, f = a * c, A = a * l, M = e.x, B = e.y, z = e.z;
+    return n[0] = (1 - (g + _)) * M, n[1] = (d + A) * M, n[2] = (x - f) * M, n[3] = 0, n[4] = (d - A) * B, n[5] = (1 - (m + _)) * B, n[6] = (p + w) * B, n[7] = 0, n[8] = (x + f) * z, n[9] = (p - w) * z, n[10] = (1 - (m + g)) * z, n[11] = 0, n[12] = t.x, n[13] = t.y, n[14] = t.z, n[15] = 1, this;
   }
   /**
    * Decompose this matrix into its position, quaternion and scale components.
@@ -2887,10 +2904,10 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
   decompose(t, s, e) {
     const n = this.elements;
     let i = O.set(n[0], n[1], n[2]).length();
-    const h = O.set(n[4], n[5], n[6]).length(), r = O.set(n[8], n[9], n[10]).length();
+    const r = O.set(n[4], n[5], n[6]).length(), h = O.set(n[8], n[9], n[10]).length();
     this.determinant() < 0 && (i = -i), t.x = n[12], t.y = n[13], t.z = n[14], R.copy(this);
-    const o = 1 / i, c = 1 / h, l = 1 / r;
-    return R.elements[0] *= o, R.elements[1] *= o, R.elements[2] *= o, R.elements[4] *= c, R.elements[5] *= c, R.elements[6] *= c, R.elements[8] *= l, R.elements[9] *= l, R.elements[10] *= l, s.setFromRotationMatrix(R), e.x = i, e.y = h, e.z = r, this;
+    const o = 1 / i, c = 1 / r, l = 1 / h;
+    return R.elements[0] *= o, R.elements[1] *= o, R.elements[2] *= o, R.elements[4] *= c, R.elements[5] *= c, R.elements[6] *= c, R.elements[8] *= l, R.elements[9] *= l, R.elements[10] *= l, s.setFromRotationMatrix(R), e.x = i, e.y = r, e.z = h, this;
   }
   // makePerspective(
   //   left,
@@ -3017,9 +3034,9 @@ const Mt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new _t(), $ = class $ {
   }
 };
 $.IDENTITY = Object.freeze(new $());
-let v = $;
-const O = /* @__PURE__ */ new y(), R = /* @__PURE__ */ new v(), As = /* @__PURE__ */ new y(0, 0, 0), Ms = /* @__PURE__ */ new y(1, 1, 1), q = /* @__PURE__ */ new y(), ut = /* @__PURE__ */ new y(), L = /* @__PURE__ */ new y();
-class D {
+let tt = $;
+const O = /* @__PURE__ */ new y(), R = /* @__PURE__ */ new tt(), Ms = /* @__PURE__ */ new y(0, 0, 0), As = /* @__PURE__ */ new y(1, 1, 1), q = /* @__PURE__ */ new y(), ut = /* @__PURE__ */ new y(), L = /* @__PURE__ */ new y();
+class Y {
   /**
    * Create a 3d box bounded by min and max.
    * @param min (optional) Input the lower (x, y, z) boundary of the box.
@@ -3077,7 +3094,7 @@ class D {
    * @returns Return a new box with the same min and max as this one.
    */
   clone() {
-    return new D().copy(this);
+    return new Y().copy(this);
   }
   /**
    * Copy the min and max from box to this box.
@@ -3276,7 +3293,7 @@ const U = [
   /* @__PURE__ */ new y(),
   /* @__PURE__ */ new y(),
   /* @__PURE__ */ new y()
-], wt = /* @__PURE__ */ new y(), It = /* @__PURE__ */ new f();
+], wt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new P();
 class V {
   /**
    * Create a 2d box bounded by min and max.
@@ -3286,7 +3303,7 @@ class V {
    * Set it to ( - Infinity, - Infinity ) if undefined or null provided.
    */
   constructor(t = void 0, s = void 0) {
-    this.min = t == null ? new f(1 / 0, 1 / 0) : new f(t.x, t.y), this.max = s == null ? new f(-1 / 0, -1 / 0) : new f(s.x, s.y);
+    this.min = t == null ? new P(1 / 0, 1 / 0) : new P(t.x, t.y), this.max = s == null ? new P(-1 / 0, -1 / 0) : new P(s.x, s.y);
   }
   /**
    * Set the lower and upper (x, y) boundaries of this box.
@@ -3316,7 +3333,7 @@ class V {
    * @returns Return this box
    */
   setFromCenterAndSize(t, s) {
-    const e = It.copy(s).multiplyScalar(0.5);
+    const e = Bt.copy(s).multiplyScalar(0.5);
     return this.min.copy(t).sub(e), this.max.copy(t).add(e), this;
   }
   /**
@@ -3369,13 +3386,13 @@ class V {
    * Center point of this box
    */
   get center() {
-    return this.isEmpty() ? new f(0, 0) : new f(0, 0).addVectors(this.min, this.max).multiplyScalar(0.5);
+    return this.isEmpty() ? new P(0, 0) : new P(0, 0).addVectors(this.min, this.max).multiplyScalar(0.5);
   }
   /**
    * Return the width, height and depth of this box.
    */
   get size() {
-    return this.isEmpty() ? new f(0, 0) : new f(0, 0).subVectors(this.max, this.min);
+    return this.isEmpty() ? new P(0, 0) : new P(0, 0).subVectors(this.max, this.min);
   }
   /**
    * Expand the boundaries of this box to include point.
@@ -3456,7 +3473,7 @@ class V {
    * @returns Return the distance from any edge of this box to the specified point.
    */
   distanceToPoint(t) {
-    return this.clampPoint(t, It).distanceTo(t);
+    return this.clampPoint(t, Bt).distanceTo(t);
   }
   /**
    * Return the intersection of this and box, setting the upper bound of this box to the lesser of the
@@ -3494,8 +3511,8 @@ class V {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const Et = /* @__PURE__ */ new y(), ws = /* @__PURE__ */ new y(), fs = /* @__PURE__ */ new J();
-class pt {
+const It = /* @__PURE__ */ new y(), fs = /* @__PURE__ */ new y(), ws = /* @__PURE__ */ new v();
+class zt {
   /**
    * Create one plane
    * @param normal (optional) Input a unit length Vector3 defining the normal of the plane.
@@ -3543,7 +3560,7 @@ class pt {
    * @returns Return this plane
    */
   setFromCoplanarPoints(t, s, e) {
-    const n = Et.subVectors(e, s).cross(ws.subVectors(t, s)).normalize();
+    const n = It.subVectors(e, s).cross(fs.subVectors(t, s)).normalize();
     return this.setFromNormalAndCoplanarPoint(n, t), this;
   }
   /**
@@ -3645,7 +3662,7 @@ class pt {
    * @returns Return this plane
    */
   applyMatrix4(t, s) {
-    const e = s || fs.getNormalMatrix(t), n = this.coplanarPoint(Et).applyMatrix3d(t), i = this.normal.applyMatrix3(e).normalize();
+    const e = s || ws.getNormalMatrix(t), n = this.coplanarPoint(It).applyMatrix3d(t), i = this.normal.applyMatrix3(e).normalize();
     return this.constant = -n.dot(i), this;
   }
   /**
@@ -3670,10 +3687,10 @@ class pt {
    * @returns Return the cloned plane
    */
   clone() {
-    return new pt().copy(this);
+    return new zt().copy(this);
   }
 }
-class P extends f {
+class b extends P {
   /**
    * Convert one point array to one number array
    * @param array Input one point array
@@ -3686,7 +3703,7 @@ class P extends f {
     }), s;
   }
 }
-class I extends y {
+class S extends y {
   /**
    * Convert one point array to one number array
    * @param array Input one point array
@@ -3695,12 +3712,12 @@ class I extends y {
    */
   static pointArrayToNumberArray(t, s = !0) {
     const e = s ? 3 : 2, n = new Array(t.length * e);
-    return t.forEach((i, h) => {
-      i.toArray(n, h * e);
+    return t.forEach((i, r) => {
+      i.toArray(n, r * e);
     }), n;
   }
 }
-const Ct = /* @__PURE__ */ new v(), kt = /* @__PURE__ */ new _t(), W = class W {
+const Et = /* @__PURE__ */ new tt(), kt = /* @__PURE__ */ new pt(), J = class J {
   /**
    * Create one instance of this class
    * @param x (optional) the angle of the x axis in radians. Default is 0.
@@ -3709,7 +3726,7 @@ const Ct = /* @__PURE__ */ new v(), kt = /* @__PURE__ */ new _t(), W = class W {
    * @param order (optional) a string representing the order that the rotations are applied,
    * defaults to 'XYZ' (must be upper case).
    */
-  constructor(t = 0, s = 0, e = 0, n = W.DEFAULT_ORDER) {
+  constructor(t = 0, s = 0, e = 0, n = J.DEFAULT_ORDER) {
     this._x = t, this._y = s, this._z = e, this._order = n;
   }
   /**
@@ -3772,7 +3789,7 @@ const Ct = /* @__PURE__ */ new v(), kt = /* @__PURE__ */ new _t(), W = class W {
    * @returns Return a new Euler with the same parameters as this one.
    */
   clone() {
-    return new W(this._x, this._y, this._z, this._order);
+    return new J(this._x, this._y, this._z, this._order);
   }
   /**
    * Copy value of euler to this euler.
@@ -3792,25 +3809,25 @@ const Ct = /* @__PURE__ */ new v(), kt = /* @__PURE__ */ new _t(), W = class W {
    * @returns Return this euler
    */
   setFromRotationMatrix(t, s = this._order, e = !0) {
-    const n = t.elements, i = n[0], h = n[4], r = n[8], a = n[1], o = n[5], c = n[9], l = n[2], d = n[6], m = n[10];
+    const n = t.elements, i = n[0], r = n[4], h = n[8], a = n[1], o = n[5], c = n[9], l = n[2], m = n[6], d = n[10];
     switch (s) {
       case "XYZ":
-        this._y = Math.asin(j(r, -1, 1)), Math.abs(r) < 0.9999999 ? (this._x = Math.atan2(-c, m), this._z = Math.atan2(-h, i)) : (this._x = Math.atan2(d, o), this._z = 0);
+        this._y = Math.asin(j(h, -1, 1)), Math.abs(h) < 0.9999999 ? (this._x = Math.atan2(-c, d), this._z = Math.atan2(-r, i)) : (this._x = Math.atan2(m, o), this._z = 0);
         break;
       case "YXZ":
-        this._x = Math.asin(-j(c, -1, 1)), Math.abs(c) < 0.9999999 ? (this._y = Math.atan2(r, m), this._z = Math.atan2(a, o)) : (this._y = Math.atan2(-l, i), this._z = 0);
+        this._x = Math.asin(-j(c, -1, 1)), Math.abs(c) < 0.9999999 ? (this._y = Math.atan2(h, d), this._z = Math.atan2(a, o)) : (this._y = Math.atan2(-l, i), this._z = 0);
         break;
       case "ZXY":
-        this._x = Math.asin(j(d, -1, 1)), Math.abs(d) < 0.9999999 ? (this._y = Math.atan2(-l, m), this._z = Math.atan2(-h, o)) : (this._y = 0, this._z = Math.atan2(a, i));
+        this._x = Math.asin(j(m, -1, 1)), Math.abs(m) < 0.9999999 ? (this._y = Math.atan2(-l, d), this._z = Math.atan2(-r, o)) : (this._y = 0, this._z = Math.atan2(a, i));
         break;
       case "ZYX":
-        this._y = Math.asin(-j(l, -1, 1)), Math.abs(l) < 0.9999999 ? (this._x = Math.atan2(d, m), this._z = Math.atan2(a, i)) : (this._x = 0, this._z = Math.atan2(-h, o));
+        this._y = Math.asin(-j(l, -1, 1)), Math.abs(l) < 0.9999999 ? (this._x = Math.atan2(m, d), this._z = Math.atan2(a, i)) : (this._x = 0, this._z = Math.atan2(-r, o));
         break;
       case "YZX":
-        this._z = Math.asin(j(a, -1, 1)), Math.abs(a) < 0.9999999 ? (this._x = Math.atan2(-c, o), this._y = Math.atan2(-l, i)) : (this._x = 0, this._y = Math.atan2(r, m));
+        this._z = Math.asin(j(a, -1, 1)), Math.abs(a) < 0.9999999 ? (this._x = Math.atan2(-c, o), this._y = Math.atan2(-l, i)) : (this._x = 0, this._y = Math.atan2(h, d));
         break;
       case "XZY":
-        this._z = Math.asin(-j(h, -1, 1)), Math.abs(h) < 0.9999999 ? (this._x = Math.atan2(d, o), this._y = Math.atan2(r, i)) : (this._x = Math.atan2(-c, m), this._y = 0);
+        this._z = Math.asin(-j(r, -1, 1)), Math.abs(r) < 0.9999999 ? (this._x = Math.atan2(m, o), this._y = Math.atan2(h, i)) : (this._x = Math.atan2(-c, d), this._y = 0);
         break;
       default:
         console.warn(
@@ -3829,7 +3846,7 @@ const Ct = /* @__PURE__ */ new v(), kt = /* @__PURE__ */ new _t(), W = class W {
    * @returns Return this euler
    */
   setFromQuaternion(t, s, e = !0) {
-    return Ct.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Ct, s, e);
+    return Et.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Et, s, e);
   }
   /**
    * Set the x, y and z, and optionally update the order.
@@ -3892,8 +3909,8 @@ const Ct = /* @__PURE__ */ new v(), kt = /* @__PURE__ */ new _t(), W = class W {
     yield this._x, yield this._y, yield this._z, yield this._order;
   }
 };
-W.DEFAULT_ORDER = "XYZ";
-let Nt = W;
+J.DEFAULT_ORDER = "XYZ";
+let Nt = J;
 class Dt {
   constructor() {
     this._boundingBoxNeedsUpdate = !1;
@@ -3911,7 +3928,7 @@ class Yt extends Dt {
    * Return new shape translated by given vector.
    */
   translate(t) {
-    return this.transform(new J().makeTranslation(t.x, t.y));
+    return this.transform(new v().makeTranslation(t.x, t.y));
   }
   /**
    * The bounding box of this shape. Because it is a time-consuming operation to calculate the bounding
@@ -3922,7 +3939,7 @@ class Yt extends Dt {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class Bs extends Yt {
+class Cs extends Yt {
   /**
    * Create one 2d area defined by one outter loop and multiple inner loops
    */
@@ -3977,30 +3994,30 @@ class Bs extends Yt {
     return s;
   }
   buildHierarchy() {
-    var r;
+    var h;
     const t = this.getPoints(100), s = this.calculateBoundaryBoxes(t), e = this.sortBoundaryBoxesByAreas(s), n = /* @__PURE__ */ new Map(), i = e.length;
     for (let a = 0; a < i; a++)
       n.set(e[a], {
         index: e[a],
         children: []
       });
-    const h = { index: -1, children: [] };
+    const r = { index: -1, children: [] };
     for (let a = 0; a < i; a++) {
       const o = e[a], c = t[o], l = s[o];
-      let d = a + 1;
-      for (; d < i; d++) {
-        const m = e[d], x = t[m];
-        if (s[m].containsBox(l) && xs.isPointInPolygon(
-          c[S.randInt(0, c.length - 1)],
+      let m = a + 1;
+      for (; m < i; m++) {
+        const d = e[m], x = t[d];
+        if (s[d].containsBox(l) && xs.isPointInPolygon(
+          c[C.randInt(0, c.length - 1)],
           x
         )) {
-          (r = n.get(m)) == null || r.children.push(n.get(o));
+          (h = n.get(d)) == null || h.children.push(n.get(o));
           break;
         }
       }
-      d === i && h.children.push(n.get(o));
+      m === i && r.children.push(n.get(o));
     }
-    return h;
+    return r;
   }
   /**
    * Calcuate bounding box of each loop in this area and return an array of their bounding box
@@ -4021,9 +4038,9 @@ class Bs extends Yt {
   sortBoundaryBoxesByAreas(t) {
     const s = [];
     t.forEach((n, i) => {
-      const h = n.size, r = h.width * h.height;
+      const r = n.size, h = r.width * r.height;
       s.push({
-        area: r,
+        area: h,
         index: i
       });
     }), s.sort((n, i) => n.area - i.area);
@@ -4113,8 +4130,8 @@ class st extends Yt {
     const s = [];
     let e, n = this.getPoint(0), i = 0;
     s.push(0);
-    for (let h = 1; h <= t; h++)
-      e = this.getPoint(h / t), i += e.distanceTo(n), s.push(i), n = e;
+    for (let r = 1; r <= t; r++)
+      e = this.getPoint(r / t), i += e.distanceTo(n), s.push(i), n = e;
     return s;
   }
   /**
@@ -4125,22 +4142,22 @@ class st extends Yt {
     const e = this.getLengths();
     let n = 0;
     const i = e.length;
-    let h;
-    s ? h = s : h = t * e[i - 1];
-    let r = 0, a = i - 1, o;
-    for (; r <= a; )
-      if (n = Math.floor(r + (a - r) / 2), o = e[n] - h, o < 0)
-        r = n + 1;
+    let r;
+    s ? r = s : r = t * e[i - 1];
+    let h = 0, a = i - 1, o;
+    for (; h <= a; )
+      if (n = Math.floor(h + (a - h) / 2), o = e[n] - r, o < 0)
+        h = n + 1;
       else if (o > 0)
         a = n - 1;
       else {
         a = n;
         break;
       }
-    if (n = a, e[n] === h)
+    if (n = a, e[n] === r)
       return n / (i - 1);
-    const c = e[n], d = e[n + 1] - c, m = (h - c) / d;
-    return (n + m) / (i - 1);
+    const c = e[n], m = e[n + 1] - c, d = (r - c) / m;
+    return (n + d) / (i - 1);
   }
   /**
    * Return a unit vector tangent at `t`. If the derived curve does not implement its tangent derivation,
@@ -4152,8 +4169,8 @@ class st extends Yt {
   getTangent(t) {
     let e = t - 1e-4, n = t + 1e-4;
     e < 0 && (e = 0), n > 1 && (n = 1);
-    const i = this.getPoint(e), h = this.getPoint(n), r = new P();
-    return r.copy(h).sub(i).normalize(), r;
+    const i = this.getPoint(e), r = this.getPoint(n), h = new b();
+    return h.copy(r).sub(i).normalize(), h;
   }
   /**
    * Return tangent at a point which is equidistant to the ends of the curve from the point given in
@@ -4167,11 +4184,11 @@ class st extends Yt {
     return this.getTangent(s);
   }
 }
-class yt extends st {
+class gt extends st {
   constructor(t, s, e, n, i) {
     super();
-    const h = +(t !== void 0) + +(s !== void 0) + +(e !== void 0) + +(n !== void 0) + +(i !== void 0);
-    if (h == 3)
+    const r = +(t !== void 0) + +(s !== void 0) + +(e !== void 0) + +(n !== void 0) + +(i !== void 0);
+    if (r == 3)
       typeof t == "object" && typeof s == "object" && typeof e == "object" ? this.createByThreePoints(
         t,
         s,
@@ -4181,9 +4198,9 @@ class yt extends st {
         s,
         e
       );
-    else if (h == 5) {
-      const r = t;
-      this.center = new P(r.x, r.y), this.radius = s, this.startAngle = e, this.endAngle = n, this.clockwise = i;
+    else if (r == 5) {
+      const h = t;
+      this.center = new b(h.x, h.y), this.radius = s, this.startAngle = e, this.endAngle = n, this.clockwise = i;
     } else
       throw T.ILLEGAL_PARAMETERS;
   }
@@ -4194,16 +4211,16 @@ class yt extends st {
    * @param p3 Input the end point
    */
   createByThreePoints(t, s, e) {
-    const n = (z, C) => ({
-      x: (z.x + C.x) / 2,
-      y: (z.y + C.y) / 2
-    }), i = (z, C) => (C.y - z.y) / (C.x - z.x), h = (z) => -1 / z, r = n(t, s), a = n(s, e), o = i(t, s), c = i(s, e), l = h(o), d = h(c), m = (z, C, Y, Z) => {
-      const F = (Z - C) / (z - Y), G = z * F + C;
-      return { x: F, y: G };
-    }, x = r.y - l * r.x, g = a.y - d * a.x, _ = m(l, x, d, g), p = Math.sqrt(
-      Math.pow(t.x - _.x, 2) + Math.pow(t.y - _.y, 2)
-    ), b = (z, C) => Math.atan2(z.y - C.y, z.x - C.x), w = b(t, _), M = b(s, _), A = b(e, _), B = A > w && A < M || w > A && w < M || M > A && M < w;
-    this.center = _, this.radius = p, this.startAngle = w, this.endAngle = A, this.clockwise = !B;
+    const n = (z, E) => ({
+      x: (z.x + E.x) / 2,
+      y: (z.y + E.y) / 2
+    }), i = (z, E) => (E.y - z.y) / (E.x - z.x), r = (z) => -1 / z, h = n(t, s), a = n(s, e), o = i(t, s), c = i(s, e), l = r(o), m = r(c), d = (z, E, Z, G) => {
+      const F = (G - E) / (z - Z), K = z * F + E;
+      return { x: F, y: K };
+    }, x = h.y - l * h.x, g = a.y - m * a.x, p = d(l, x, m, g), _ = Math.sqrt(
+      Math.pow(t.x - p.x, 2) + Math.pow(t.y - p.y, 2)
+    ), w = (z, E) => Math.atan2(z.y - E.y, z.x - E.x), f = w(t, p), A = w(s, p), M = w(e, p), B = M > f && M < A || f > M && f < A || A > M && A < f;
+    this.center = p, this.radius = _, this.startAngle = f, this.endAngle = M, this.clockwise = !B;
   }
   /**
    * Create circular arc by two points and one bugle factor
@@ -4217,24 +4234,24 @@ class yt extends st {
    * - https://www.afralisp.net/archive/lisp/Bulges1.htm
    */
   createByStartEndPointsAndBulge(t, s, e) {
-    let n, i, h;
-    e < 0 ? (n = Math.atan(-e) * 4, i = new f(t), h = new f(s)) : (n = Math.atan(e) * 4, i = new f(s), h = new f(t));
-    const r = new f().subVectors(h, i), a = r.length(), o = new f().addVectors(i, r.multiplyScalar(0.5)), c = Math.abs(a / 2 / Math.tan(n / 2)), l = r.normalize();
-    let d;
+    let n, i, r;
+    e < 0 ? (n = Math.atan(-e) * 4, i = new P(t), r = new P(s)) : (n = Math.atan(e) * 4, i = new P(s), r = new P(t));
+    const h = new P().subVectors(r, i), a = h.length(), o = new P().addVectors(i, h.multiplyScalar(0.5)), c = Math.abs(a / 2 / Math.tan(n / 2)), l = h.normalize();
+    let m;
     if (n < Math.PI) {
-      const m = new f(
+      const d = new P(
         l.x * Math.cos(Math.PI / 2) - l.y * Math.sin(Math.PI / 2),
         l.y * Math.cos(Math.PI / 2) + l.x * Math.sin(Math.PI / 2)
       );
-      d = o.add(m.multiplyScalar(-c));
+      m = o.add(d.multiplyScalar(-c));
     } else {
-      const m = new f(
+      const d = new P(
         l.x * Math.cos(Math.PI / 2) - l.y * Math.sin(Math.PI / 2),
         l.y * Math.cos(Math.PI / 2) + l.x * Math.sin(Math.PI / 2)
       );
-      d = o.add(m.multiplyScalar(c));
+      m = o.add(d.multiplyScalar(c));
     }
-    e < 0 ? (this.startAngle = Math.atan2(i.y - d.y, i.x - d.x), this.endAngle = Math.atan2(h.y - d.y, h.x - d.x)) : (this.startAngle = Math.atan2(h.y - d.y, h.x - d.x), this.endAngle = Math.atan2(i.y - d.y, i.x - d.x)), this.clockwise = e < 0, this.center = d, this.radius = h.sub(d).length();
+    e < 0 ? (this.startAngle = Math.atan2(i.y - m.y, i.x - m.x), this.endAngle = Math.atan2(r.y - m.y, r.x - m.x)) : (this.startAngle = Math.atan2(r.y - m.y, r.x - m.x), this.endAngle = Math.atan2(i.y - m.y, i.x - m.x)), this.clockwise = e < 0, this.center = m, this.radius = r.sub(m).length();
   }
   /**
    * Center of circular arc
@@ -4243,7 +4260,7 @@ class yt extends st {
     return this._center;
   }
   set center(t) {
-    this._center = new P(t.x, t.y), this._boundingBoxNeedsUpdate = !0;
+    this._center = new b(t.x, t.y), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Radius of circular arc
@@ -4261,7 +4278,7 @@ class yt extends st {
     return this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * End angle in radians of circular arc in the range 0 to 2 * PI.
@@ -4270,13 +4287,13 @@ class yt extends st {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == E ? t : S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == I ? t : C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Angle between endAngle and startAngle in range 0 to 2*PI
    */
   get deltaAngle() {
-    return this.clockwise ? S.normalizeAngle(this.startAngle - this.endAngle) : S.normalizeAngle(this.endAngle - this.startAngle);
+    return this.clockwise ? C.normalizeAngle(this.startAngle - this.endAngle) : C.normalizeAngle(this.endAngle - this.startAngle);
   }
   /**
    * Rotation direction of the arc.
@@ -4303,7 +4320,7 @@ class yt extends st {
    * Middle point of circular arc
    */
   get midPoint() {
-    const t = S.normalizeAngle(
+    const t = C.normalizeAngle(
       (this.startAngle + this.endAngle) / 2
     );
     return this.getPointAtAngle(t);
@@ -4320,7 +4337,7 @@ class yt extends st {
   calculateBoundingBox() {
     const t = [this.startPoint, this.endPoint], s = [0, Math.PI / 2, Math.PI, 3 * Math.PI / 2];
     for (const i of s)
-      S.isBetweenAngle(
+      C.isBetweenAngle(
         i,
         this.startAngle,
         this.endAngle,
@@ -4328,8 +4345,8 @@ class yt extends st {
       ) && t.push(this.getPointAtAngle(i));
     const e = t.map((i) => i.x), n = t.map((i) => i.y);
     return new V(
-      new P(Math.min(...e), Math.min(...n)),
-      new P(Math.max(...e), Math.max(...n))
+      new b(Math.min(...e), Math.min(...n)),
+      new b(Math.max(...e), Math.max(...n))
     );
   }
   /**
@@ -4348,7 +4365,7 @@ class yt extends st {
    * @inheritdoc
    */
   clone() {
-    return new yt(
+    return new gt(
       this.center.clone(),
       this.radius,
       this.startAngle,
@@ -4363,7 +4380,7 @@ class yt extends st {
    */
   getPointAtAngle(t) {
     const s = this.center.x + this.radius * Math.cos(t), e = this.center.y + this.radius * Math.sin(t);
-    return new P(s, e);
+    return new b(s, e);
   }
   /**
    * Divide this arc into the specified nubmer of points and return those points as an array of points.
@@ -4373,15 +4390,15 @@ class yt extends st {
   getPoints(t = 100) {
     const s = [];
     let e = this.deltaAngle, n = this.startAngle;
-    if (this.closed && (e = E, n = 0), this.clockwise)
+    if (this.closed && (e = I, n = 0), this.clockwise)
       for (let i = 0; i <= t; i++) {
-        const h = n - e * (i / t), r = this.getPointAtAngle(h);
-        s.push(new P(r.x, r.y));
+        const r = n - e * (i / t), h = this.getPointAtAngle(r);
+        s.push(new b(h.x, h.y));
       }
     else
       for (let i = 0; i <= t; i++) {
-        const h = n + e * (i / t), r = this.getPointAtAngle(h);
-        s.push(new P(r.x, r.y));
+        const r = n + e * (i / t), h = this.getPointAtAngle(r);
+        s.push(new b(h.x, h.y));
       }
     return s;
   }
@@ -4392,7 +4409,7 @@ class Ps extends Dt {
    * Translation vector may be also defined by a pair of numbers.
    */
   translate(t) {
-    return this.transform(new v().makeTranslation(t.x, t.y, t.z));
+    return this.transform(new tt().makeTranslation(t.x, t.y, t.z));
   }
   /**
    * The bounding box of this shape. Because it is a time-consuming operation to calculate the bounding
@@ -4403,15 +4420,15 @@ class Ps extends Dt {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class zt extends Ps {
+class Mt extends Ps {
 }
-class gt extends zt {
+class _t extends Mt {
   /**
    * This constructor initializes the line object to use start as the start point, and end
    * as the endpoint. Both points must be in WCS coordinates.
    */
   constructor(t, s) {
-    super(), this._start = new I(t), this._end = new I(s);
+    super(), this._start = new S(t), this._end = new S(s);
   }
   /**
    * The line's startpoint in WCS coordinates
@@ -4441,7 +4458,7 @@ class gt extends zt {
    * The middle point of this line.
    */
   get midPoint() {
-    return new I(
+    return new S(
       (this._start.x + this._end.x) / 2,
       (this._start.y + this._end.y) / 2,
       (this._start.z + this._end.z) / 2
@@ -4481,10 +4498,10 @@ class gt extends zt {
   atLength(t, s = !1) {
     if (s) {
       const e = this.delta(X).normalize();
-      return new I(this._start).addScaledVector(e, t);
+      return new S(this._start).addScaledVector(e, t);
     } else {
       const e = this.delta(X).normalize();
-      return new I(this._end).addScaledVector(e, t);
+      return new S(this._end).addScaledVector(e, t);
     }
   }
   /**
@@ -4497,13 +4514,13 @@ class gt extends zt {
   extend(t, s = !1) {
     if (s) {
       const e = X.subVectors(this._start, this._end).normalize();
-      this._start = new I(this._start).addScaledVector(
+      this._start = new S(this._start).addScaledVector(
         e,
         t
       );
     } else {
       const e = this.delta(X).normalize();
-      this._end = new I(this._end).addScaledVector(e, t);
+      this._end = new S(this._end).addScaledVector(e, t);
     }
     return this._boundingBoxNeedsUpdate = !0, this;
   }
@@ -4515,10 +4532,10 @@ class gt extends zt {
    * @returns Return a point parameter based on the closest point as projected on the line segment.
    */
   closestPointToPointParameter(t, s) {
-    Lt.subVectors(t, this._start), mt.subVectors(this.endPoint, this.startPoint);
-    const e = mt.dot(mt);
-    let i = mt.dot(Lt) / e;
-    return s && (i = S.clamp(i, 0, 1)), i;
+    Lt.subVectors(t, this._start), dt.subVectors(this.endPoint, this.startPoint);
+    const e = dt.dot(dt);
+    let i = dt.dot(Lt) / e;
+    return s && (i = C.clamp(i, 0, 1)), i;
   }
   /**
    * Return the closets point on the line. If clampToLine is true, then the returned value will be
@@ -4561,7 +4578,7 @@ class gt extends zt {
    */
   project(t) {
     const s = this.direction, n = X.subVectors(t, this.startPoint).dot(s);
-    return new I().copy(s).multiplyScalar(n).add(this.startPoint);
+    return new S().copy(s).multiplyScalar(n).add(this.startPoint);
   }
   /**
    * Finds the point on the line that is perpendicular to the given point. When you need the shortest distance
@@ -4571,23 +4588,23 @@ class gt extends zt {
    * @returns Return the point on the line that is the closest to the given point.
    */
   perpPoint(t) {
-    const s = this.direction, e = this.startPoint, i = X.subVectors(t, e).dot(s), h = X.copy(s).multiplyScalar(i);
-    return new I().addVectors(e, h);
+    const s = this.direction, e = this.startPoint, i = X.subVectors(t, e).dot(s), r = X.copy(s).multiplyScalar(i);
+    return new S().addVectors(e, r);
   }
   /**
    * @inheritdoc
    */
   calculateBoundingBox() {
-    const t = new I(
+    const t = new S(
       Math.min(this._start.x, this._end.x),
       Math.min(this._start.y, this._end.y),
       Math.min(this._start.z, this._end.z)
-    ), s = new I(
+    ), s = new S(
       Math.max(this._start.x, this._end.x),
       Math.max(this._start.y, this._end.y),
       Math.max(this._start.z, this._end.z)
     );
-    return new D(t, s);
+    return new Y(t, s);
   }
   /**
    * @inheritdoc
@@ -4611,11 +4628,11 @@ class gt extends zt {
    * @inheritdoc
    */
   clone() {
-    return new gt(this._start.clone(), this._end.clone());
+    return new _t(this._start.clone(), this._end.clone());
   }
 }
-const X = /* @__PURE__ */ new y(), Lt = /* @__PURE__ */ new y(), mt = /* @__PURE__ */ new y();
-class xt extends zt {
+const X = /* @__PURE__ */ new y(), Lt = /* @__PURE__ */ new y(), dt = /* @__PURE__ */ new y();
+class yt extends Mt {
   /**
    * Compute center point of the arc given three points
    * @param startPoint Input start point of the arc
@@ -4624,11 +4641,11 @@ class xt extends zt {
    * @returns Return center point of the arc
    */
   static computeCenterPoint(t, s, e) {
-    const n = new y().addVectors(t, s).multiplyScalar(0.5), i = new y().addVectors(t, e).multiplyScalar(0.5), h = new y().subVectors(s, t), r = new y().subVectors(e, t), a = new y().crossVectors(h, r).normalize();
+    const n = new y().addVectors(t, s).multiplyScalar(0.5), i = new y().addVectors(t, e).multiplyScalar(0.5), r = new y().subVectors(s, t), h = new y().subVectors(e, t), a = new y().crossVectors(r, h).normalize();
     if (a.lengthSq() === 0)
       return console.error("Points are collinear and cannot form a valid arc."), null;
-    const o = new y().crossVectors(h, a).normalize(), c = new y().crossVectors(r, a).normalize(), l = o.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), d = c.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), m = new gt(n, n.clone().add(l)), x = new gt(i, i.clone().add(d)), g = new y();
-    return m.closestPointToPoint(x.startPoint, !0, g) ? g : (console.error("Cannot find a valid center for the arc."), null);
+    const o = new y().crossVectors(r, a).normalize(), c = new y().crossVectors(h, a).normalize(), l = o.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), m = c.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), d = new _t(n, n.clone().add(l)), x = new _t(i, i.clone().add(m)), g = new y();
+    return d.closestPointToPoint(x.startPoint, !0, g) ? g : (console.error("Cannot find a valid center for the arc."), null);
   }
   /**
    * Create arc by three points
@@ -4637,14 +4654,14 @@ class xt extends zt {
    * @param pointOnArc Input one point between the start point and the end point
    */
   static createByThreePoints(t, s, e) {
-    const n = xt.computeCenterPoint(
+    const n = yt.computeCenterPoint(
       t,
       s,
       e
     );
     if (n) {
-      const i = n.distanceTo(t), h = new y().subVectors(t, n), r = new y().subVectors(s, n), a = Math.atan2(h.y, h.x), o = Math.atan2(r.y, r.x);
-      return new xt(
+      const i = n.distanceTo(t), r = new y().subVectors(t, n), h = new y().subVectors(s, n), a = Math.atan2(r.y, r.x), o = Math.atan2(h.y, h.x);
+      return new yt(
         n,
         i,
         a,
@@ -4662,8 +4679,8 @@ class xt extends zt {
    * @param normal The normal vector of the plane in which the arc lies.
    * @param refVec The reference vector from which angles are measured. Default value is x axis.
    */
-  constructor(t, s, e, n, i, h = y.X_AXIS) {
-    super(), this.center = t, this.radius = s, this.startAngle = e, this.endAngle = n, this.normal = i, this.refVec = h, (n - e) % E == 0 ? (this.startAngle = 0, this.endAngle = E) : (this.startAngle = e, this.endAngle = n);
+  constructor(t, s, e, n, i, r = y.X_AXIS) {
+    super(), this.center = t, this.radius = s, this.startAngle = e, this.endAngle = n, this.normal = i, this.refVec = r, (n - e) % I == 0 ? (this.startAngle = 0, this.endAngle = I) : (this.startAngle = e, this.endAngle = n);
   }
   /**
    * Center of circular arc
@@ -4672,7 +4689,7 @@ class xt extends zt {
     return this._center;
   }
   set center(t) {
-    this._center = new I(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Radius of circular arc
@@ -4691,7 +4708,7 @@ class xt extends zt {
     return this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * End angle in radians of circular arc in the range 0 to 2 * PI.
@@ -4700,13 +4717,13 @@ class xt extends zt {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == E ? t : S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == I ? t : C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Return angle between endAngle and startAngle in range 0 to 2*PI
    */
   get deltaAngle() {
-    return S.normalizeAngle(this.endAngle - this.startAngle);
+    return C.normalizeAngle(this.endAngle - this.startAngle);
   }
   /**
    * Return true if the arc is a large arc whose delta angle value is greater than PI.
@@ -4762,15 +4779,15 @@ class xt extends zt {
   calculateBoundingBox() {
     const t = [this.startAngle, this.endAngle];
     for (let a = 0; a < 2 * Math.PI; a += Math.PI / 2)
-      S.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
-    let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, h = -1 / 0, r = -1 / 0;
+      C.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
+    let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, h = -1 / 0;
     for (const a of t) {
       const o = this.getPointAtAngle(a);
-      o.x < s && (s = o.x), o.y < e && (e = o.y), o.z < n && (n = o.z), o.x > i && (i = o.x), o.y > h && (h = o.y), o.z > r && (r = o.z);
+      o.x < s && (s = o.x), o.y < e && (e = o.y), o.z < n && (n = o.z), o.x > i && (i = o.x), o.y > r && (r = o.y), o.z > h && (h = o.z);
     }
-    return new D(
+    return new Y(
       { x: s, y: e, z: n },
-      { x: i, y: h, z: r }
+      { x: i, y: r, z: h }
     );
   }
   /**
@@ -4788,10 +4805,10 @@ class xt extends zt {
   getPoints(t) {
     const s = [];
     let e = this.deltaAngle, n = this.startAngle;
-    this.closed && (e = E, n = 0);
+    this.closed && (e = I, n = 0);
     for (let i = 0; i <= t; i++) {
-      const h = n + e * (i / t), r = this.getPointAtAngle(h);
-      s.push(r);
+      const r = n + e * (i / t), h = this.getPointAtAngle(r);
+      s.push(h);
     }
     return s;
   }
@@ -4799,7 +4816,7 @@ class xt extends zt {
    * @inheritdoc
    */
   transform(t) {
-    const s = ft.copy(this.refVec).applyAxisAngle(this.normal, this.startAngle).multiplyScalar(this.radius), e = ft.copy(this.refVec).applyAxisAngle(this.normal, this.endAngle).multiplyScalar(this.radius);
+    const s = Pt.copy(this.refVec).applyAxisAngle(this.normal, this.startAngle).multiplyScalar(this.radius), e = Pt.copy(this.refVec).applyAxisAngle(this.normal, this.endAngle).multiplyScalar(this.radius);
     return this.center.applyMatrix3d(t), s.applyMatrix3d(t), e.applyMatrix3d(t), this.normal.applyMatrix3d(t).normalize(), this.refVec.applyMatrix3d(t).normalize(), this.startAngle = this.getAngle(s), this.endAngle = this.getAngle(e), this._boundingBoxNeedsUpdate = !0, this;
   }
   /**
@@ -4812,7 +4829,7 @@ class xt extends zt {
    * @inheritdoc
    */
   clone() {
-    return new xt(
+    return new yt(
       this.center.clone(),
       this.radius,
       this.startAngle,
@@ -4828,7 +4845,7 @@ class xt extends zt {
    */
   getAngle(t) {
     return t.sub(this.center), Math.atan2(
-      t.dot(ft.crossVectors(this.refVec, this.normal)),
+      t.dot(Pt.crossVectors(this.refVec, this.normal)),
       t.dot(this.refVec)
     );
   }
@@ -4841,11 +4858,11 @@ class xt extends zt {
       x: s.y * e.z - s.z * e.y,
       y: s.z * e.x - s.x * e.z,
       z: s.x * e.y - s.y * e.x
-    }, i = this.center, h = this.radius;
-    return new I(
-      i.x + h * (e.x * Math.cos(t) + n.x * Math.sin(t)),
-      i.y + h * (e.y * Math.cos(t) + n.y * Math.sin(t)),
-      i.z + h * (e.z * Math.cos(t) + n.z * Math.sin(t))
+    }, i = this.center, r = this.radius;
+    return new S(
+      i.x + r * (e.x * Math.cos(t) + n.x * Math.sin(t)),
+      i.y + r * (e.y * Math.cos(t) + n.y * Math.sin(t)),
+      i.z + r * (e.z * Math.cos(t) + n.z * Math.sin(t))
     );
   }
   /**
@@ -4853,10 +4870,10 @@ class xt extends zt {
    */
   get plane() {
     const t = new y(this.center).distanceTo(jt);
-    return new pt(this.normal, t);
+    return new zt(this.normal, t);
   }
 }
-const ft = /* @__PURE__ */ new y();
+const Pt = /* @__PURE__ */ new y();
 class Zt extends st {
   /**
    * Construct an instance of the ellipse arc.
@@ -4869,8 +4886,8 @@ class Zt extends st {
    * @param rotation The rotation angle of the ellipse in radians, counterclockwise from the positive X
    * axis (optional). Default is 0.
    */
-  constructor(t, s, e, n = 0, i = E, h = !1, r = 0) {
-    super(), this.center = t, this.majorAxisRadius = s, this.minorAxisRadius = e, (i - n) % E == 0 ? (this.startAngle = 0, this.endAngle = E) : (this.startAngle = n, this.endAngle = i), this.clockwise = h, this.rotation = r;
+  constructor(t, s, e, n = 0, i = I, r = !1, h = 0) {
+    super(), this.center = t, this.majorAxisRadius = s, this.minorAxisRadius = e, (i - n) % I == 0 ? (this.startAngle = 0, this.endAngle = I) : (this.startAngle = n, this.endAngle = i), this.clockwise = r, this.rotation = h;
   }
   /**
    * Center of the ellipse in 3d space
@@ -4879,7 +4896,7 @@ class Zt extends st {
     return this._center;
   }
   set center(t) {
-    this._center = new I(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Major axis radius of the ellipse
@@ -4908,7 +4925,7 @@ class Zt extends st {
     return this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * End angle of the ellipse arc in radians in the range -pi to pi.
@@ -4917,7 +4934,7 @@ class Zt extends st {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == E ? t : S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == I ? t : C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * The flag Whether the ellipse arc is drawn clockwise. Default is false.
@@ -4942,7 +4959,7 @@ class Zt extends st {
    * Return angle between endAngle and startAngle in range 0 to 2*PI
    */
   get deltaAngle() {
-    return S.normalizeAngle(this.endAngle - this.startAngle);
+    return C.normalizeAngle(this.endAngle - this.startAngle);
   }
   /**
    * Return true if the arc is a large arc whose delta angle value is greater than PI.
@@ -4957,9 +4974,9 @@ class Zt extends st {
    */
   calculateBoundingBox() {
     let s = 1 / 0, e = 1 / 0, n = -1 / 0, i = -1 / 0;
-    for (let h = 0; h <= 100; h++) {
-      const r = this.getPoint(h / 100);
-      s = Math.min(s, r.x), e = Math.min(e, r.y), n = Math.max(n, r.x), i = Math.max(i, r.y);
+    for (let r = 0; r <= 100; r++) {
+      const h = this.getPoint(r / 100);
+      s = Math.min(s, h.x), e = Math.min(e, h.y), n = Math.max(n, h.x), i = Math.max(i, h.y);
     }
     return new V({ x: s, y: e }, { x: n, y: i });
   }
@@ -4982,12 +4999,12 @@ class Zt extends st {
     for (; e > s; ) e -= s;
     e < Number.EPSILON && (n ? e = 0 : e = s), this.clockwise === !0 && !n && (e === s ? e = -s : e = e - s);
     const i = this.startAngle + t * e;
-    let h = this.center.x + this.majorAxisRadius * Math.cos(i), r = this.center.y + this.minorAxisRadius * Math.sin(i);
+    let r = this.center.x + this.majorAxisRadius * Math.cos(i), h = this.center.y + this.minorAxisRadius * Math.sin(i);
     if (this.rotation !== 0) {
-      const a = Math.cos(this.rotation), o = Math.sin(this.rotation), c = h - this.center.x, l = r - this.center.y;
-      h = c * a - l * o + this.center.x, r = c * o + l * a + this.center.y;
+      const a = Math.cos(this.rotation), o = Math.sin(this.rotation), c = r - this.center.x, l = h - this.center.y;
+      r = c * a - l * o + this.center.x, h = c * o + l * a + this.center.y;
     }
-    return new P(h, r);
+    return new b(r, h);
   }
   /**
    * @inheritdoc
@@ -5016,7 +5033,7 @@ class Zt extends st {
     );
   }
 }
-class Gt extends zt {
+class Gt extends Mt {
   /**
    * Construct an instance of the ellipse arc.
    * @param center Center point of the ellipse.
@@ -5027,10 +5044,10 @@ class Gt extends zt {
    * @param startAngle Start angle of the ellipse arc in radians.
    * @param endAngle End angle of the ellipse arc in radians.
    */
-  constructor(t, s, e, n, i, h = 0, r = E) {
+  constructor(t, s, e, n, i, r = 0, h = I) {
     super(), this.center = t, this.normal = s, this.majorAxis = e, this.majorAxisRadius = n, this.minorAxisRadius = i;
-    const a = Math.abs(r - h);
-    Math.abs(a - E) < 1e-10 || Math.abs(a - 2 * E) < 1e-10 ? (this.startAngle = 0, this.endAngle = E) : (this.startAngle = h, this.endAngle = r);
+    const a = Math.abs(h - r);
+    Math.abs(a - I) < 1e-10 || Math.abs(a - 2 * I) < 1e-10 ? (this.startAngle = 0, this.endAngle = I) : (this.startAngle = r, this.endAngle = h);
   }
   /**
    * Center of the ellipse in 3d space
@@ -5039,7 +5056,7 @@ class Gt extends zt {
     return this._center;
   }
   set center(t) {
-    this._center = new I(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Major axis radius of the ellipse
@@ -5068,7 +5085,7 @@ class Gt extends zt {
     return this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * End angle of the ellipse arc in radians in the range -pi to pi.
@@ -5077,14 +5094,14 @@ class Gt extends zt {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == E ? t : S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == I ? t : C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Return angle between endAngle and startAngle in range 0 to 2*PI
    */
   get deltaAngle() {
     const t = this.endAngle - this.startAngle;
-    return Math.abs(t - E) < 1e-10 ? E : S.normalizeAngle(t);
+    return Math.abs(t - I) < 1e-10 ? I : C.normalizeAngle(t);
   }
   /**
    * Return true if the arc is a large arc whose delta angle value is greater than PI.
@@ -5144,8 +5161,8 @@ class Gt extends zt {
     const s = this.deltaAngle / 1e3;
     let e = 0, n = this.getPointAtAngle(this.startAngle);
     for (let i = 1; i <= 1e3; i++) {
-      const h = this.startAngle + i * s, r = this.getPointAtAngle(h), a = r.x - n.x, o = r.y - n.y, c = r.z - n.z;
-      e += Math.sqrt(a * a + o * o + c * c), n = r;
+      const r = this.startAngle + i * s, h = this.getPointAtAngle(r), a = h.x - n.x, o = h.y - n.y, c = h.z - n.z;
+      e += Math.sqrt(a * a + o * o + c * c), n = h;
     }
     return e;
   }
@@ -5158,25 +5175,25 @@ class Gt extends zt {
     if (this.majorAxis.equals(y.X_AXIS) || this.majorAxis.equals(y.Y_AXIS) || this.majorAxis.isParallelTo(y.X_AXIS) || this.majorAxis.isParallelTo(y.Y_AXIS)) {
       const t = [this.startAngle, this.endAngle];
       for (let a = 0; a < 2 * Math.PI; a += Math.PI / 2)
-        S.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
-      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, h = -1 / 0, r = -1 / 0;
+        C.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
+      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, h = -1 / 0;
       for (const a of t) {
         const o = this.getPointAtAngle(a);
-        o.x < s && (s = o.x), o.y < e && (e = o.y), o.z < n && (n = o.z), o.x > i && (i = o.x), o.y > h && (h = o.y), o.z > r && (r = o.z);
+        o.x < s && (s = o.x), o.y < e && (e = o.y), o.z < n && (n = o.z), o.x > i && (i = o.x), o.y > r && (r = o.y), o.z > h && (h = o.z);
       }
-      return new D(
+      return new Y(
         { x: s, y: e, z: n },
-        { x: i, y: h, z: r }
+        { x: i, y: r, z: h }
       );
     } else {
-      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, h = -1 / 0, r = -1 / 0;
+      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, h = -1 / 0;
       for (let a = 0; a <= 100; a++) {
         const o = this.startAngle + this.deltaAngle * (a / 100), c = this.getPointAtAngle(o);
-        s = Math.min(s, c.x), e = Math.min(e, c.y), n = Math.min(n, c.z), i = Math.max(i, c.x), h = Math.max(h, c.y), r = Math.max(r, c.z);
+        s = Math.min(s, c.x), e = Math.min(e, c.y), n = Math.min(n, c.z), i = Math.max(i, c.x), r = Math.max(r, c.y), h = Math.max(h, c.z);
       }
-      return new D(
+      return new Y(
         { x: s, y: e, z: n },
-        { x: i, y: h, z: r }
+        { x: i, y: r, z: h }
       );
     }
   }
@@ -5189,10 +5206,10 @@ class Gt extends zt {
   getPoints(t = 100) {
     const s = [];
     let e = this.deltaAngle, n = this.startAngle;
-    this.closed && (e = E, n = 0);
+    this.closed && (e = I, n = 0);
     for (let i = 0; i <= t; i++) {
-      const h = n + e * (i / t), r = this.getPointAtAngle(h);
-      s.push(r);
+      const r = n + e * (i / t), h = this.getPointAtAngle(r);
+      s.push(h);
     }
     return s;
   }
@@ -5203,7 +5220,7 @@ class Gt extends zt {
    */
   getPointAtAngle(t) {
     const s = Math.cos(t), e = Math.sin(t), n = this.minorAxis.clone().multiplyScalar(this.minorAxisRadius).multiplyScalar(e), i = this.majorAxis.clone().multiplyScalar(s * this.majorAxisRadius).add(n);
-    return new I(
+    return new S(
       this.center.x + i.x,
       this.center.y + i.y,
       this.center.z + i.z
@@ -5215,8 +5232,8 @@ class Gt extends zt {
    * @returns - True if the point is inside the ellipse, false otherwise.
    */
   contains(t) {
-    const s = new y(t).sub(this.center), e = s.dot(this.majorAxis), n = s.dot(this.minorAxis), i = e / this.majorAxisRadius, h = n / this.minorAxisRadius;
-    return i * i + h * h <= 1;
+    const s = new y(t).sub(this.center), e = s.dot(this.majorAxis), n = s.dot(this.minorAxis), i = e / this.majorAxisRadius, r = n / this.minorAxisRadius;
+    return i * i + r * r <= 1;
   }
   /**
    * @inheritdoc
@@ -5249,10 +5266,10 @@ class Gt extends zt {
    */
   get plane() {
     const t = new y(this.center).distanceTo(jt);
-    return new pt(this.normal, t);
+    return new zt(this.normal, t);
   }
 }
-class Is extends st {
+class Bs extends st {
   constructor(t = null, s = !1) {
     super(), this._vertices = t || new Array(), this._closed = s;
   }
@@ -5274,7 +5291,7 @@ class Is extends st {
   get startPoint() {
     if (this.numberOfVertices > 0) {
       const t = this._vertices[0];
-      return new P(t.x, t.y);
+      return new b(t.x, t.y);
     }
     throw new Error("Start point does not exist in an empty polyline.");
   }
@@ -5286,10 +5303,10 @@ class Is extends st {
     if (t > 0)
       if (this.closed) {
         const s = this._vertices[0];
-        return new P(s.x, s.y);
+        return new b(s.x, s.y);
       } else {
         const s = this._vertices[t - 1];
-        return new P(s.x, s.y);
+        return new b(s.x, s.y);
       }
     throw new Error("End point does not exist in an empty polyline.");
   }
@@ -5304,10 +5321,10 @@ class Is extends st {
       let i = null;
       if (e < s - 1 ? i = this._vertices[e + 1] : e == s - 1 && this.closed && (i = this._vertices[0]), i)
         if (n.bulge) {
-          const h = new yt(n, i, n.bulge);
-          t += h.length;
+          const r = new gt(n, i, n.bulge);
+          t += r.length;
         } else
-          t += new P(n.x, n.y).distanceTo(i);
+          t += new b(n.x, n.y).distanceTo(i);
     }
     return t;
   }
@@ -5338,7 +5355,7 @@ class Is extends st {
    */
   getPointAt(t) {
     const s = this._vertices[t];
-    return new P(s.x, s.y);
+    return new b(s.x, s.y);
   }
   /**
    * @inheritdoc
@@ -5362,7 +5379,7 @@ class Is extends st {
   getPoints3d(t, s) {
     const e = [];
     return this.getPoints(t).forEach(
-      (i) => e.push(new I().set(i.x, i.y, s))
+      (i) => e.push(new S().set(i.x, i.y, s))
     ), e;
   }
   /**
@@ -5375,27 +5392,27 @@ class Is extends st {
     for (let n = 0; n < e; ++n) {
       const i = this._vertices[n];
       if (i.bulge) {
-        let h = null;
-        if (n < e - 1 ? h = this._vertices[n + 1] : n == e - 1 && this.closed && (h = this._vertices[0]), h) {
-          const a = new yt(i, h, i.bulge).getPoints(t), o = a.length;
+        let r = null;
+        if (n < e - 1 ? r = this._vertices[n + 1] : n == e - 1 && this.closed && (r = this._vertices[0]), r) {
+          const a = new gt(i, r, i.bulge).getPoints(t), o = a.length;
           for (let c = 0; c < o; ++c) {
             const l = a[c];
-            s.push(new P(l.x, l.y));
+            s.push(new b(l.x, l.y));
           }
         }
       } else
-        s.push(new P(i.x, i.y)), n == e - 1 && this.closed && s.push(s[0]);
+        s.push(new b(i.x, i.y)), n == e - 1 && this.closed && s.push(s[0]);
     }
     return s;
   }
 }
-class Qt extends st {
+class Kt extends st {
   /**
    * This constructor initializes the line object to use start as the start point, and end
    * as the endpoint. Both points must be in WCS coordinates.
    */
   constructor(t, s) {
-    super(), this._start = new P(t), this._end = new P(s);
+    super(), this._start = new b(t), this._end = new b(s);
   }
   /**
    * The line's startpoint in WCS coordinates
@@ -5434,10 +5451,10 @@ class Qt extends st {
    * @inheritdoc
    */
   calculateBoundingBox() {
-    const t = new P(
+    const t = new b(
       Math.min(this._start.x, this._end.x),
       Math.min(this._start.y, this._end.y)
-    ), s = new P(
+    ), s = new b(
       Math.max(this._start.x, this._end.x),
       Math.max(this._start.y, this._end.y)
     );
@@ -5465,10 +5482,10 @@ class Qt extends st {
    * @inheritdoc
    */
   clone() {
-    return new Qt(this._start.clone(), this._end.clone());
+    return new Kt(this._start.clone(), this._end.clone());
   }
 }
-class Es extends st {
+class Is extends st {
   /**
    * Create one loop by connected curves
    * @param curves Input one array of connected curves
@@ -5498,7 +5515,7 @@ class Es extends st {
   get startPoint() {
     if (this._curves.length > 0) {
       const t = this._curves[0].startPoint;
-      return new P(t.x, t.y);
+      return new b(t.x, t.y);
     }
     throw new Error("Start point does not exist in an empty loop.");
   }
@@ -5545,12 +5562,12 @@ class Es extends st {
     const s = [];
     return this.curves.forEach((e) => {
       e.getPoints(t).forEach((n) => {
-        s.push(new P(n.x, n.y));
+        s.push(new b(n.x, n.y));
       });
     }), s;
   }
 }
-class tt {
+class D {
   constructor(t, s, e, n) {
     this._degree = t, this._knots = [...s], this._controlPoints = e.map((i) => [...i]), this._weights = n ? [...n] : new Array(e.length).fill(1);
   }
@@ -5570,7 +5587,7 @@ class tt {
    * Calculate a point on the curve at parameter u
    */
   point(t) {
-    return bt(
+    return xt(
       t,
       this._degree,
       this._knots,
@@ -5593,7 +5610,7 @@ class tt {
    * Create a NURBS curve from control points and knots
    */
   static byKnotsControlPointsWeights(t, s, e, n) {
-    return new tt(t, s, e, n);
+    return new D(t, s, e, n);
   }
   /**
    * Create a NURBS curve from fit points using interpolation
@@ -5612,11 +5629,11 @@ class tt {
         n = ys(s, t.length);
         break;
     }
-    const i = zs(t), h = new Array(i.length).fill(1);
-    return new tt(s, n, i, h);
+    const i = zs(t), r = new Array(i.length).fill(1);
+    return new D(s, n, i, r);
   }
 }
-class Cs extends zt {
+class Es extends Mt {
   constructor(t, s, e) {
     super();
     const n = +(t !== void 0) + +(s !== void 0) + +(e !== void 0);
@@ -5626,24 +5643,68 @@ class Cs extends zt {
     if (this._closed = !1, n == 2 && !Array.isArray(s)) {
       if (this._fitPoints = t, this._knotParameterization = s, this._fitPoints.length < 4)
         throw T.ILLEGAL_PARAMETERS;
-      const h = this.toNurbsPoints(this._fitPoints);
-      this._nurbsCurve = tt.byPoints(
-        h,
+      const r = this.toNurbsPoints(this._fitPoints);
+      this._nurbsCurve = D.byPoints(
+        r,
         i,
         this._knotParameterization
-      ), this._controlPoints = this.toGePoints(this._nurbsCurve.controlPoints());
+      ), this._controlPoints = this.toGePoints(this._nurbsCurve.controlPoints()), this._originalControlPoints = [...this._controlPoints], this._originalKnots = [...this._nurbsCurve.knots()], this._originalWeights = [...this._nurbsCurve.weights()];
     } else {
       if (this._controlPoints = t, this._controlPoints.length < 4)
         throw T.ILLEGAL_PARAMETERS;
-      const h = this.toNurbsPoints(this._controlPoints);
-      this._nurbsCurve = tt.byKnotsControlPointsWeights(
+      const r = this.toNurbsPoints(this._controlPoints);
+      this._nurbsCurve = D.byKnotsControlPointsWeights(
         i,
         s,
-        h,
+        r,
         e
-      );
+      ), this._originalControlPoints = [...this._controlPoints], this._originalKnots = [...this._nurbsCurve.knots()], this._originalWeights = e ? [...e] : new Array(this._controlPoints.length).fill(1);
     }
   }
+  /**
+   * Set the closed property and rebuild the curve if necessary
+   */
+  setClosed(t) {
+    this._closed !== t && (this._closed = t, this._boundingBoxNeedsUpdate = !0, t ? this.makeClosed() : this.makeOpen());
+  }
+  /**
+   * Make the spline closed by adding control points and adjusting knots
+   */
+  makeClosed() {
+    const t = this._nurbsCurve.degree(), s = this._nurbsCurve.controlPoints(), e = this._nurbsCurve.knots(), n = this._nurbsCurve.weights(), i = [...s], r = [...n];
+    for (let a = 0; a < t; a++)
+      i.push([...s[a]]), r.push(n[a]);
+    const h = this.createClosedKnotVector(e, t);
+    this._nurbsCurve = D.byKnotsControlPointsWeights(
+      t,
+      h,
+      i,
+      r
+    ), this._controlPoints = this.toGePoints(i);
+  }
+  /**
+   * Make the spline open by restoring the original curve
+   */
+  makeOpen() {
+    if (!this._originalControlPoints || !this._originalKnots || !this._originalWeights)
+      throw new Error("Original curve data not available");
+    const t = this._nurbsCurve.degree(), s = this.toNurbsPoints(this._originalControlPoints);
+    this._nurbsCurve = D.byKnotsControlPointsWeights(
+      t,
+      this._originalKnots,
+      s,
+      this._originalWeights
+    ), this._controlPoints = [...this._originalControlPoints];
+  }
+  /**
+   * Create knot vector for closed curve
+   */
+  createClosedKnotVector(t, s) {
+    const e = [...t], n = t[t.length - 1], i = t[0], r = (n - i) / (t.length - 1), h = s;
+    for (let a = 1; a <= h; a++)
+      e.push(n + a * r);
+    return e;
+  }
   /**
    * Degree of the spline to be created.
    */
@@ -5658,14 +5719,16 @@ class Cs extends zt {
    */
   get startPoint() {
     const t = this._nurbsCurve.knots(), s = this._nurbsCurve.degree(), e = t[s], n = this._nurbsCurve.point(e);
-    return new I(n[0], n[1], n[2]);
+    return new S(n[0], n[1], n[2]);
   }
   /**
    * The end point of this spline
    */
   get endPoint() {
+    if (this._closed)
+      return this.startPoint;
     const t = this._nurbsCurve.knots(), s = this._nurbsCurve.degree(), e = t[t.length - s - 1], n = this._nurbsCurve.point(e);
-    return new I(n[0], n[1], n[2]);
+    return new S(n[0], n[1], n[2]);
   }
   /**
    * @inheritdoc
@@ -5704,19 +5767,28 @@ class Cs extends zt {
    * @returns Return an array of point
    */
   getPoints(t = 100) {
-    const s = this._nurbsCurve, e = [], n = s.knots(), i = this._nurbsCurve.degree(), h = n[i], r = n[n.length - i - 1], a = (r - h) / (t - 1);
-    for (let o = 0; o < t; o++) {
-      let c;
-      o === t - 1 ? c = r : c = h + o * a;
-      const l = s.point(c);
-      e.push(new I(l[0], l[1], l[2]));
+    const s = this._nurbsCurve, e = [], n = s.knots(), i = this._nurbsCurve.degree(), r = n[i], h = n[n.length - i - 1];
+    if (this._closed) {
+      const a = (h - r) / (t - 1);
+      for (let o = 0; o < t; o++) {
+        let c;
+        o === t - 1 ? c = r : c = r + o * a;
+        const l = s.point(c);
+        e.push(new S(l[0], l[1], l[2]));
+      }
+    } else {
+      const a = (h - r) / (t - 1);
+      for (let o = 0; o < t; o++) {
+        const c = o === t - 1 ? h : r + o * a, l = s.point(c);
+        e.push(new S(l[0], l[1], l[2]));
+      }
     }
     return e;
   }
   getCurvePoints(t, s) {
-    const e = [], n = t.knots(), i = n[3], r = (n[n.length - 4] - i) / (s - 1);
+    const e = [], n = t.knots(), i = n[3], h = (n[n.length - 4] - i) / (s - 1);
     for (let a = 0; a < s; a++) {
-      const o = i + a * r;
+      const o = i + a * h;
       e.push(t.point(o));
     }
     return e;
@@ -5726,13 +5798,13 @@ class Cs extends zt {
    */
   calculateBoundingBox() {
     const t = this.getPoints(100);
-    return new D().setFromPoints(t);
+    return new Y().setFromPoints(t);
   }
   get closed() {
     return this._closed;
   }
   set closed(t) {
-    this._boundingBoxNeedsUpdate = !0, this._closed = t;
+    this.setClosed(t);
   }
   /**
    * @inheritdoc
@@ -5764,31 +5836,31 @@ class Cs extends zt {
   }
 }
 export {
-  Bs as AcGeArea2d,
+  Cs as AcGeArea2d,
   V as AcGeBox2d,
-  D as AcGeBox3d,
-  yt as AcGeCircArc2d,
-  xt as AcGeCircArc3d,
+  Y as AcGeBox3d,
+  gt as AcGeCircArc2d,
+  yt as AcGeCircArc3d,
   st as AcGeCurve2d,
   Zt as AcGeEllipseArc2d,
   Gt as AcGeEllipseArc3d,
   Nt as AcGeEuler,
   xs as AcGeGeometryUtil,
-  Qt as AcGeLine2d,
-  gt as AcGeLine3d,
-  Es as AcGeLoop2d,
-  S as AcGeMathUtil,
-  J as AcGeMatrix2d,
-  v as AcGeMatrix3d,
-  pt as AcGePlane,
-  P as AcGePoint2d,
-  I as AcGePoint3d,
-  Is as AcGePolyline2d,
-  _t as AcGeQuaternion,
+  Kt as AcGeLine2d,
+  _t as AcGeLine3d,
+  Is as AcGeLoop2d,
+  C as AcGeMathUtil,
+  v as AcGeMatrix2d,
+  tt as AcGeMatrix3d,
+  zt as AcGePlane,
+  b as AcGePoint2d,
+  S as AcGePoint3d,
+  Bs as AcGePolyline2d,
+  pt as AcGeQuaternion,
   Yt as AcGeShape2d,
-  Cs as AcGeSpline3d,
-  ms as AcGeTol,
-  f as AcGeVector2d,
+  Es as AcGeSpline3d,
+  ds as AcGeTol,
+  P as AcGeVector2d,
   y as AcGeVector3d,
   Ft as DEFAULT_TOL,
   Rt as DEG2RAD,
@@ -5796,32 +5868,32 @@ export {
   Ss as ORIGIN_POINT_2D,
   jt as ORIGIN_POINT_3D,
   Tt as RAD2DEG,
-  E as TAU,
-  Pt as basisFunction,
+  I as TAU,
+  bt as basisFunction,
   ps as calculateCurveLength,
   os as ceilPowerOfTwo,
   j as clamp,
-  $t as damp,
+  Ht as damp,
   is as degToRad,
   Vt as euclideanModulo,
-  bt as evaluateNurbsPoint,
+  xt as evaluateNurbsPoint,
   as as floorPowerOfTwo,
   gs as generateChordKnots,
   _s as generateSqrtChordKnots,
-  Ot as generateUUID,
+  Qt as generateUUID,
   ys as generateUniformKnots,
   qt as intPartLength,
   zs as interpolateControlPoints,
-  Kt as inverseLerp,
+  Wt as inverseLerp,
   cs as isBetween,
   ls as isBetweenAngle,
   Xt as isPointInPolygon,
-  ds as isPolygonIntersect,
+  ms as isPolygonIntersect,
   hs as isPowerOfTwo,
   Ut as lerp,
-  Ht as mapLinear,
-  dt as normalizeAngle,
-  Wt as pingpong,
+  Ot as mapLinear,
+  mt as normalizeAngle,
+  $t as pingpong,
   rs as radToDeg,
   ss as randFloat,
   es as randFloatSpread,