@mlightcad/geometry-engine 1.0.5 → 1.0.7

package/dist/geometry-engine.js

@@ -336,7 +336,7 @@ 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: Qt,
@@ -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, r = this.y - t.y;
-    return this.x = i * e - r * n + t.x, this.y = i * n + r * e + t.y, this;
+    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;
   }
   /**
    * Set each component of this vector to a pseudo-random value between 0 and 1, excluding 1.
@@ -851,8 +851,8 @@ 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]() {
@@ -875,8 +875,8 @@ const H = class H {
    * @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, 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);
+  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);
   }
   /**
    * Set the 3x3 matrix values to the given row-major sequence of values.
@@ -892,9 +892,9 @@ const H = class H {
    * @param n33 Input element in the third row and the third column
    * @returns Return this matrix
    */
-  set(t, s, e, n, i, r, h, a, o) {
+  set(t, s, e, n, i, h, r, a, o) {
     const c = this.elements;
-    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;
+    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;
   }
   /**
    * Reset this matrix to the 3x3 identity matrix:
@@ -954,8 +954,8 @@ const H = class H {
    * @returns Return this matrix
    */
   multiplyMatrices(t, s) {
-    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], f = n[1], w = n[4], A = n[7], M = n[2], C = n[5], z = n[8];
-    return i[0] = r * g + h * f + a * M, i[3] = r * p + h * w + a * C, i[6] = r * _ + h * A + a * z, i[1] = o * g + c * f + l * M, i[4] = o * p + c * w + l * C, i[7] = o * _ + c * A + l * z, i[2] = m * g + d * f + x * M, i[5] = m * p + d * w + x * C, i[8] = m * _ + d * A + x * z, this;
+    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], p = n[3], _ = n[6], f = n[1], w = n[4], A = n[7], M = n[2], B = n[5], z = n[8];
+    return i[0] = h * g + r * f + a * M, i[3] = h * p + r * w + a * B, i[6] = h * _ + r * A + a * z, i[1] = o * g + c * f + l * M, i[4] = o * p + c * w + l * B, i[7] = o * _ + c * A + l * z, i[2] = d * g + m * f + x * M, i[5] = d * p + m * w + x * B, i[8] = d * _ + m * A + x * z, this;
   }
   /**
    * Multiply every component of the matrix by the scalar value s.
@@ -971,8 +971,8 @@ const H = class H {
    * @returns Return the determinant of this matrix
    */
   determinant() {
-    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;
+    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;
   }
   /**
    * Invert this matrix, using the analytic method. You can not invert with a determinant of zero.
@@ -980,10 +980,10 @@ const H = class H {
    * @returns Return this matrix
    */
   invert() {
-    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;
+    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;
     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] = (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;
+    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;
   }
   /**
    * Transpose this matrix in place.
@@ -1024,15 +1024,15 @@ const H = class H {
    * @param cy Input center y of rotation
    * @returns Return this matrix
    */
-  setUvTransform(t, s, e, n, i, r, h) {
+  setUvTransform(t, s, e, n, i, h, r) {
     const a = Math.cos(i), o = Math.sin(i);
     return this.set(
       e * a,
       e * o,
-      -e * (a * r + o * h) + r + t,
+      -e * (a * h + o * r) + h + t,
       -n * o,
       n * a,
-      -n * (-o * r + a * h) + h + s,
+      -n * (-o * h + a * r) + r + s,
       0,
       0,
       1
@@ -1214,11 +1214,11 @@ const Ft = new ds();
 function Xt(u, t, s = !1) {
   const e = u.x, n = u.y;
   let i = !1;
-  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);
+  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);
   }
   return i;
 }
@@ -1252,70 +1252,70 @@ function ys(u, t) {
 function gs(u, t) {
   const s = t.length - 1, e = u, n = [0];
   let i = 0;
-  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);
+  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);
     i += l, 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));
+  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 h = 0; h <= e; h++)
-    r.push(s - e + 1);
-  return r;
+  for (let r = 0; r <= e; r++)
+    h.push(s - e + 1);
+  return h;
 }
 function _s(u, t) {
   const s = t.length - 1, e = u, n = [0];
   let i = 0;
-  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;
+  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;
 }
 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], 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);
+  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 * bt(u, t - 1, s, e) + r * bt(u + 1, t - 1, s, e);
 }
 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)
+  const i = e.length - 1, h = t;
+  if (u = Math.max(s[h], 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)
+  if (Math.abs(u - s[h]) < 1e-8)
     return [...e[0]];
-  const h = [0, 0, 0];
+  const r = [0, 0, 0];
   let a = 0;
   for (let o = 0; o <= i; o++) {
-    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;
+    const c = bt(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;
   }
   if (a < 1e-10) {
-    const o = s[s.length - r - 1];
+    const o = s[s.length - h - 1];
     if (Math.abs(u - o) < 1e-8)
       return [...e[i]];
-    if (Math.abs(u - s[r]) < 1e-8)
+    if (Math.abs(u - s[h]) < 1e-8)
       return [...e[0]];
   }
-  return a > 1e-10 && (h[0] /= a, h[1] /= a, h[2] /= a), h;
+  return a > 1e-10 && (r[0] /= a, r[1] /= a, r[2] /= a), r;
 }
 function ps(u, t, s, e) {
-  const n = u, i = t[n], r = t[t.length - n - 1];
-  let h = 0;
-  const a = 1e3, o = (r - i) / a;
+  const n = u, i = t[n], h = t[t.length - n - 1];
+  let r = 0;
+  const a = 1e3, o = (h - i) / a;
   let c = xt(
     i,
     u,
@@ -1325,16 +1325,16 @@ function ps(u, t, s, e) {
   );
   for (let g = 1; g <= a; g++) {
     const p = i + g * o, _ = xt(p, u, t, s, e), f = _[0] - c[0], w = _[1] - c[1], A = _[2] - c[2];
-    h += Math.sqrt(f * f + w * w + A * A), c = _;
+    r += Math.sqrt(f * f + w * w + A * A), c = _;
   }
   const l = xt(
-    r,
+    h,
     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;
+  ), d = l[0] - c[0], m = l[1] - c[1], x = l[2] - c[2];
+  return r += Math.sqrt(d * d + m * m + x * x), r;
 }
 function zs(u) {
   return u.map((t) => [...t]);
@@ -1360,26 +1360,26 @@ class pt {
    * @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, r, h) {
+  static slerpFlat(t, s, e, n, i, h, r) {
     let a = e[n + 0], o = e[n + 1], c = e[n + 2], l = e[n + 3];
-    const m = i[r + 0], d = i[r + 1], x = i[r + 2], g = i[r + 3];
-    if (h === 0) {
+    const d = i[h + 0], m = i[h + 1], x = i[h + 2], g = i[h + 3];
+    if (r === 0) {
       t[s + 0] = a, t[s + 1] = o, t[s + 2] = c, t[s + 3] = l;
       return;
     }
-    if (h === 1) {
-      t[s + 0] = m, t[s + 1] = d, t[s + 2] = x, t[s + 3] = g;
+    if (r === 1) {
+      t[s + 0] = d, t[s + 1] = m, t[s + 2] = x, t[s + 3] = g;
       return;
     }
-    if (l !== g || a !== m || o !== d || c !== x) {
-      let p = 1 - h;
-      const _ = a * m + o * d + c * x + l * g, f = _ >= 0 ? 1 : -1, w = 1 - _ * _;
+    if (l !== g || a !== d || o !== m || c !== x) {
+      let p = 1 - r;
+      const _ = a * d + o * m + c * x + l * g, f = _ >= 0 ? 1 : -1, w = 1 - _ * _;
       if (w > Number.EPSILON) {
-        const M = Math.sqrt(w), C = Math.atan2(M, _ * f);
-        p = Math.sin(p * C) / M, h = Math.sin(h * C) / M;
+        const M = Math.sqrt(w), B = Math.atan2(M, _ * f);
+        p = Math.sin(p * B) / M, r = Math.sin(r * B) / M;
       }
-      const A = h * f;
-      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 A = r * f;
+      if (a = a * p + d * A, o = o * p + m * A, c = c * p + x * A, l = l * p + g * A, p === 1 - r) {
         const M = 1 / Math.sqrt(a * a + o * o + c * c + l * l);
         a *= M, o *= M, c *= M, l *= M;
       }
@@ -1396,9 +1396,9 @@ class pt {
    * @param srcOffset1 Input an offset into the array src1.
    * @returns Return an array
    */
-  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;
+  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;
   }
   /**
    * X cooridinate
@@ -1469,29 +1469,29 @@ class pt {
    * @returns Return this quaternion
    */
   setFromEuler(t, s = !0) {
-    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) {
+    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) {
       case "XYZ":
-        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;
+        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;
         break;
       case "YXZ":
-        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;
+        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;
         break;
       case "ZXY":
-        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;
+        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;
         break;
       case "ZYX":
-        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;
+        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;
         break;
       case "YZX":
-        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;
+        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;
         break;
       case "XZY":
-        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;
+        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;
         break;
       default:
         console.warn(
-          "THREE.Quaternion: .setFromEuler() encountered an unknown order: " + r
+          "THREE.Quaternion: .setFromEuler() encountered an unknown order: " + h
         );
     }
     return s === !0 && this._onChangeCallback(), this;
@@ -1513,19 +1513,19 @@ class pt {
    * @returns Return this quaternion
    */
   setFromRotationMatrix(t) {
-    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;
+    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;
     } else {
-      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;
+      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;
     }
     return this._onChangeCallback(), this;
   }
@@ -1642,8 +1642,8 @@ class pt {
    * @returns Return this quaternion
    */
   multiplyQuaternions(t, s) {
-    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;
+    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;
   }
   /**
    * Handles the spherical linear interpolation between quaternions. t represents the amount of rotation
@@ -1655,17 +1655,17 @@ class pt {
   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, 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;
+    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;
     if (a <= Number.EPSILON) {
-      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 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 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;
+    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;
   }
   /**
    * Perform a spherical linear interpolation between the given quaternions and stores the result in
@@ -1744,8 +1744,8 @@ const N = class N {
         return;
       }
       if (n === 1) {
-        const { x: i, y: r, z: h } = t;
-        this.x = i, this.y = r, this.z = h || 0;
+        const { x: i, y: h, z: r } = t;
+        this.x = i, this.y = h, this.z = r || 0;
         return;
       }
       if (n === 3) {
@@ -1981,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, 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;
+    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;
   }
   /**
    * Apply a quaternion transform to this vector.
@@ -1990,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, 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;
+    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;
   }
   /**
    * Transforms the direction of this vector by a matrix (the upper left 3 x 3 subset of a m) and
@@ -2202,8 +2202,8 @@ const N = class N {
    * @returns Return this vector
    */
   crossVectors(t, s) {
-    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;
+    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;
   }
   /**
    * Project this vector onto v.
@@ -2396,21 +2396,21 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = 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, 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(
+  constructor(t, s, e, n, i, h, r, a, o, c, l, d, m, 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 && h != null && r != null && a != null && o != null && c != null && l != null && d != null && m != null && x != null && g != null && p != null && this.set(
       t,
       s,
       e,
       n,
       i,
-      r,
       h,
+      r,
       a,
       o,
       c,
       l,
-      m,
       d,
+      m,
       x,
       g,
       p
@@ -2437,9 +2437,9 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @param n44 Input element in the forth row and the forth column
    * @returns Return this matrix
    */
-  set(t, s, e, n, i, r, h, a, o, c, l, m, d, x, g, p) {
+  set(t, s, e, n, i, h, r, a, o, c, l, d, m, 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;
+    return _[0] = t, _[4] = s, _[8] = e, _[12] = n, _[1] = i, _[5] = h, _[9] = r, _[13] = a, _[2] = o, _[6] = c, _[10] = l, _[14] = d, _[3] = m, _[7] = x, _[11] = g, _[15] = p, this;
   }
   /**
    * Reset this matrix to the identity matrix.
@@ -2571,8 +2571,8 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = 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(), 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;
+    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;
   }
   // makeRotationFromEuler(euler) {
   //   const te = this.elements
@@ -2723,8 +2723,8 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @returns Return this matrix
    */
   multiplyMatrices(t, s) {
-    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], f = e[3], w = e[7], A = e[11], M = e[15], C = 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 * C + 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 * C + 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 * C + 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] = f * C + w * G + A * nt + M * ot, i[7] = f * z + w * F + A * it + M * at, i[11] = f * E + w * K + A * rt + M * ct, i[15] = f * Z + w * et + A * ht + M * lt, this;
+    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], p = e[10], _ = e[14], f = e[3], w = 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] = h * B + r * G + a * nt + o * ot, i[4] = h * z + r * F + a * it + o * at, i[8] = h * E + r * K + a * rt + o * ct, i[12] = h * Z + r * et + a * ht + o * lt, i[1] = c * B + l * G + d * nt + m * ot, i[5] = c * z + l * F + d * it + m * at, i[9] = c * E + l * K + d * rt + m * ct, i[13] = c * Z + l * et + d * ht + m * 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] = f * B + w * G + A * nt + M * ot, i[7] = f * z + w * F + A * it + M * at, i[11] = f * E + w * K + A * rt + M * ct, i[15] = f * Z + w * et + A * ht + M * lt, this;
   }
   /**
    * Multiply every component of the matrix by a scalar value s.
@@ -2740,8 +2740,8 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = 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], 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);
+    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], p = t[11], _ = 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) + p * (+s * o * l - s * r * m - i * h * l + e * h * m + i * r * c - e * o * c) + _ * (-n * r * c - s * a * l + s * r * d + n * h * l - e * h * d + e * a * c);
   }
   /**
    * Transposes this matrix.
@@ -2769,11 +2769,11 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @returns Return this matrix
    */
   invert() {
-    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], f = l * p * o - g * m * o + g * a * d - h * p * d - l * a * _ + h * m * _, w = 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, C = s * f + e * w + n * A + i * M;
-    if (C === 0)
+    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], p = t[14], _ = t[15], f = l * p * o - g * d * o + g * a * m - r * p * m - l * a * _ + r * d * _, w = x * d * o - c * p * o - x * a * m + h * p * m + c * a * _ - h * d * _, A = c * g * o - x * l * o + x * r * m - h * g * m - c * r * _ + h * l * _, M = x * l * a - c * g * a - x * r * d + h * g * d + c * r * p - h * l * p, B = s * f + e * w + 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 / C;
-    return t[0] = f * 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] = w * 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;
+    const z = 1 / B;
+    return t[0] = f * z, t[1] = (g * d * i - l * p * i - g * n * m + e * p * m + l * n * _ - e * d * _) * z, t[2] = (r * p * i - g * a * i + g * n * o - e * p * o - r * n * _ + e * a * _) * 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 * p * i - x * d * i + x * n * m - s * p * m - c * n * _ + s * d * _) * z, t[6] = (x * a * i - h * p * i - x * n * o + s * p * o + h * n * _ - s * a * _) * z, t[7] = (h * d * i - c * a * i + c * n * o - s * d * o - h * n * m + s * a * m) * z, t[8] = A * z, t[9] = (x * l * i - c * g * i - x * e * m + s * g * m + c * e * _ - s * l * _) * z, t[10] = (h * g * i - x * r * i + x * e * o - s * g * o - h * e * _ + s * r * _) * z, t[11] = (c * r * i - h * l * i - c * e * o + s * l * o + h * e * m - s * r * m) * z, t[12] = M * z, t[13] = (c * g * n - x * l * n + x * e * d - s * g * d - c * e * p + s * l * p) * z, t[14] = (x * r * n - h * g * n - x * e * a + s * g * a + h * e * p - s * r * p) * z, t[15] = (h * l * n - c * r * n + c * e * a - s * l * a - h * e * d + s * r * d) * z, this;
   }
   /**
    * Multiply the columns of this matrix by vector v.
@@ -2836,18 +2836,18 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @returns Return this matrix
    */
   makeRotationAxis(t, s) {
-    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;
+    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;
     return this.set(
-      o * r + e,
-      o * h - n * a,
-      o * a + n * h,
+      o * h + e,
+      o * r - n * a,
+      o * a + n * r,
       0,
-      o * h + n * a,
-      c * h + e,
-      c * a - n * r,
+      o * r + n * a,
+      c * r + e,
+      c * a - n * h,
       0,
-      o * a - n * h,
-      c * a + n * r,
+      o * a - n * r,
+      c * a + n * h,
       i * a * a + e,
       0,
       0,
@@ -2876,8 +2876,8 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @param zy Input the amount to shear Z by Y.
    * @returns Return this matrix
    */
-  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;
+  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;
   }
   /**
    * Set this matrix to the transformation composed of position, quaternion and scale.
@@ -2887,8 +2887,8 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @returns Return this matrix
    */
   compose(t, s, e) {
-    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, f = a * o, w = a * c, A = a * l, M = e.x, C = e.y, z = e.z;
-    return n[0] = (1 - (g + _)) * M, n[1] = (d + A) * M, n[2] = (x - w) * M, n[3] = 0, n[4] = (d - A) * C, n[5] = (1 - (m + _)) * C, n[6] = (p + f) * C, n[7] = 0, n[8] = (x + w) * z, n[9] = (p - f) * 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;
+    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, p = h * l, _ = r * l, f = a * o, w = a * c, A = a * l, M = e.x, B = e.y, z = e.z;
+    return n[0] = (1 - (g + _)) * M, n[1] = (m + A) * M, n[2] = (x - w) * M, n[3] = 0, n[4] = (m - A) * B, n[5] = (1 - (d + _)) * B, n[6] = (p + f) * B, n[7] = 0, n[8] = (x + w) * z, n[9] = (p - f) * 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;
   }
   /**
    * Decompose this matrix into its position, quaternion and scale components.
@@ -2904,10 +2904,10 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
   decompose(t, s, e) {
     const n = this.elements;
     let i = O.set(n[0], n[1], n[2]).length();
-    const r = O.set(n[4], n[5], n[6]).length(), h = O.set(n[8], n[9], n[10]).length();
+    const h = O.set(n[4], n[5], n[6]).length(), r = 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 / 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;
+    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;
   }
   // makePerspective(
   //   left,
@@ -3703,7 +3703,7 @@ class b extends P {
     }), s;
   }
 }
-class B extends y {
+class S extends y {
   /**
    * Convert one point array to one number array
    * @param array Input one point array
@@ -3712,8 +3712,8 @@ class B extends y {
    */
   static pointArrayToNumberArray(t, s = !0) {
     const e = s ? 3 : 2, n = new Array(t.length * e);
-    return t.forEach((i, r) => {
-      i.toArray(n, r * e);
+    return t.forEach((i, h) => {
+      i.toArray(n, h * e);
     }), n;
   }
 }
@@ -3809,25 +3809,25 @@ const Et = /* @__PURE__ */ new tt(), kt = /* @__PURE__ */ new pt(), J = class J
    * @returns Return this euler
    */
   setFromRotationMatrix(t, s = this._order, e = !0) {
-    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];
+    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];
     switch (s) {
       case "XYZ":
-        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);
+        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);
         break;
       case "YXZ":
-        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);
+        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);
         break;
       case "ZXY":
-        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));
+        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));
         break;
       case "ZYX":
-        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));
+        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));
         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(h, d));
+        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));
         break;
       case "XZY":
-        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);
+        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);
         break;
       default:
         console.warn(
@@ -3994,30 +3994,30 @@ class Cs extends Yt {
     return s;
   }
   buildHierarchy() {
-    var h;
+    var r;
     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 r = { index: -1, children: [] };
+    const h = { index: -1, children: [] };
     for (let a = 0; a < i; a++) {
       const o = e[a], c = t[o], l = s[o];
-      let m = a + 1;
-      for (; m < i; m++) {
-        const d = e[m], x = t[d];
-        if (s[d].containsBox(l) && xs.isPointInPolygon(
-          c[S.randInt(0, c.length - 1)],
+      let d = a + 1;
+      for (; d < i; d++) {
+        const m = e[d], x = t[m];
+        if (s[m].containsBox(l) && xs.isPointInPolygon(
+          c[C.randInt(0, c.length - 1)],
           x
         )) {
-          (h = n.get(d)) == null || h.children.push(n.get(o));
+          (r = n.get(m)) == null || r.children.push(n.get(o));
           break;
         }
       }
-      m === i && r.children.push(n.get(o));
+      d === i && h.children.push(n.get(o));
     }
-    return r;
+    return h;
   }
   /**
    * Calcuate bounding box of each loop in this area and return an array of their bounding box
@@ -4038,9 +4038,9 @@ class Cs extends Yt {
   sortBoundaryBoxesByAreas(t) {
     const s = [];
     t.forEach((n, i) => {
-      const r = n.size, h = r.width * r.height;
+      const h = n.size, r = h.width * h.height;
       s.push({
-        area: h,
+        area: r,
         index: i
       });
     }), s.sort((n, i) => n.area - i.area);
@@ -4130,8 +4130,8 @@ class st extends Yt {
     const s = [];
     let e, n = this.getPoint(0), i = 0;
     s.push(0);
-    for (let r = 1; r <= t; r++)
-      e = this.getPoint(r / t), i += e.distanceTo(n), s.push(i), n = e;
+    for (let h = 1; h <= t; h++)
+      e = this.getPoint(h / t), i += e.distanceTo(n), s.push(i), n = e;
     return s;
   }
   /**
@@ -4142,22 +4142,22 @@ class st extends Yt {
     const e = this.getLengths();
     let n = 0;
     const i = e.length;
-    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;
+    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;
       else if (o > 0)
         a = n - 1;
       else {
         a = n;
         break;
       }
-    if (n = a, e[n] === r)
+    if (n = a, e[n] === h)
       return n / (i - 1);
-    const c = e[n], m = e[n + 1] - c, d = (r - c) / m;
-    return (n + d) / (i - 1);
+    const c = e[n], d = e[n + 1] - c, m = (h - c) / d;
+    return (n + m) / (i - 1);
   }
   /**
    * Return a unit vector tangent at `t`. If the derived curve does not implement its tangent derivation,
@@ -4169,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), r = this.getPoint(n), h = new b();
-    return h.copy(r).sub(i).normalize(), h;
+    const i = this.getPoint(e), h = this.getPoint(n), r = new b();
+    return r.copy(h).sub(i).normalize(), r;
   }
   /**
    * Return tangent at a point which is equidistant to the ends of the curve from the point given in
@@ -4187,8 +4187,8 @@ class st extends Yt {
 class gt extends st {
   constructor(t, s, e, n, i) {
     super();
-    const r = +(t !== void 0) + +(s !== void 0) + +(e !== void 0) + +(n !== void 0) + +(i !== void 0);
-    if (r == 3)
+    const h = +(t !== void 0) + +(s !== void 0) + +(e !== void 0) + +(n !== void 0) + +(i !== void 0);
+    if (h == 3)
       typeof t == "object" && typeof s == "object" && typeof e == "object" ? this.createByThreePoints(
         t,
         s,
@@ -4198,9 +4198,9 @@ class gt extends st {
         s,
         e
       );
-    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 if (h == 5) {
+      const r = t;
+      this.center = new b(r.x, r.y), this.radius = s, this.startAngle = e, this.endAngle = n, this.clockwise = i;
     } else
       throw T.ILLEGAL_PARAMETERS;
   }
@@ -4214,13 +4214,13 @@ class gt extends st {
     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) => {
+    }), i = (z, E) => (E.y - z.y) / (E.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, 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(
+    }, x = r.y - l * r.x, g = a.y - d * a.x, p = m(l, x, d, g), _ = Math.sqrt(
       Math.pow(t.x - p.x, 2) + Math.pow(t.y - p.y, 2)
-    ), f = (z, E) => Math.atan2(z.y - E.y, z.x - E.x), w = f(t, p), A = f(s, p), M = f(e, p), C = M > w && M < A || w > M && w < A || A > M && A < w;
-    this.center = p, this.radius = _, this.startAngle = w, this.endAngle = M, this.clockwise = !C;
+    ), f = (z, E) => Math.atan2(z.y - E.y, z.x - E.x), w = f(t, p), A = f(s, p), M = f(e, p), B = M > w && M < A || w > M && w < A || A > M && A < w;
+    this.center = p, this.radius = _, this.startAngle = w, this.endAngle = M, this.clockwise = !B;
   }
   /**
    * Create circular arc by two points and one bugle factor
@@ -4234,24 +4234,24 @@ class gt extends st {
    * - https://www.afralisp.net/archive/lisp/Bulges1.htm
    */
   createByStartEndPointsAndBulge(t, s, e) {
-    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;
+    let n, i, h;
+    e < 0 ? (n = Math.atan(-e) * 4, i = new P(t), h = new P(s)) : (n = Math.atan(e) * 4, i = new P(s), h = new P(t));
+    const r = new P().subVectors(h, i), a = r.length(), o = new P().addVectors(i, r.multiplyScalar(0.5)), c = Math.abs(a / 2 / Math.tan(n / 2)), l = r.normalize();
+    let d;
     if (n < Math.PI) {
-      const d = new P(
+      const m = 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)
       );
-      m = o.add(d.multiplyScalar(-c));
+      d = o.add(m.multiplyScalar(-c));
     } else {
-      const d = new P(
+      const m = 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)
       );
-      m = o.add(d.multiplyScalar(c));
+      d = o.add(m.multiplyScalar(c));
     }
-    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();
+    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();
   }
   /**
    * Center of circular arc
@@ -4278,7 +4278,7 @@ class gt 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.
@@ -4287,13 +4287,13 @@ class gt extends st {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == I ? 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.
@@ -4320,7 +4320,7 @@ class gt 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);
@@ -4337,7 +4337,7 @@ class gt 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,
@@ -4392,13 +4392,13 @@ class gt extends st {
     let e = this.deltaAngle, n = this.startAngle;
     if (this.closed && (e = I, n = 0), this.clockwise)
       for (let i = 0; i <= t; i++) {
-        const r = n - e * (i / t), h = this.getPointAtAngle(r);
-        s.push(new b(h.x, h.y));
+        const h = n - e * (i / t), r = this.getPointAtAngle(h);
+        s.push(new b(r.x, r.y));
       }
     else
       for (let i = 0; i <= t; i++) {
-        const r = n + e * (i / t), h = this.getPointAtAngle(r);
-        s.push(new b(h.x, h.y));
+        const h = n + e * (i / t), r = this.getPointAtAngle(h);
+        s.push(new b(r.x, r.y));
       }
     return s;
   }
@@ -4428,7 +4428,7 @@ class _t extends Mt {
    * as the endpoint. Both points must be in WCS coordinates.
    */
   constructor(t, s) {
-    super(), this._start = new B(t), this._end = new B(s);
+    super(), this._start = new S(t), this._end = new S(s);
   }
   /**
    * The line's startpoint in WCS coordinates
@@ -4458,7 +4458,7 @@ class _t extends Mt {
    * The middle point of this line.
    */
   get midPoint() {
-    return new B(
+    return new S(
       (this._start.x + this._end.x) / 2,
       (this._start.y + this._end.y) / 2,
       (this._start.z + this._end.z) / 2
@@ -4498,10 +4498,10 @@ class _t extends Mt {
   atLength(t, s = !1) {
     if (s) {
       const e = this.delta(X).normalize();
-      return new B(this._start).addScaledVector(e, t);
+      return new S(this._start).addScaledVector(e, t);
     } else {
       const e = this.delta(X).normalize();
-      return new B(this._end).addScaledVector(e, t);
+      return new S(this._end).addScaledVector(e, t);
     }
   }
   /**
@@ -4514,13 +4514,13 @@ class _t extends Mt {
   extend(t, s = !1) {
     if (s) {
       const e = X.subVectors(this._start, this._end).normalize();
-      this._start = new B(this._start).addScaledVector(
+      this._start = new S(this._start).addScaledVector(
         e,
         t
       );
     } else {
       const e = this.delta(X).normalize();
-      this._end = new B(this._end).addScaledVector(e, t);
+      this._end = new S(this._end).addScaledVector(e, t);
     }
     return this._boundingBoxNeedsUpdate = !0, this;
   }
@@ -4535,7 +4535,7 @@ class _t extends Mt {
     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 = S.clamp(i, 0, 1)), i;
+    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
@@ -4578,7 +4578,7 @@ class _t extends Mt {
    */
   project(t) {
     const s = this.direction, n = X.subVectors(t, this.startPoint).dot(s);
-    return new B().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
@@ -4588,18 +4588,18 @@ class _t extends Mt {
    * @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), r = X.copy(s).multiplyScalar(i);
-    return new B().addVectors(e, r);
+    const s = this.direction, e = this.startPoint, i = X.subVectors(t, e).dot(s), h = X.copy(s).multiplyScalar(i);
+    return new S().addVectors(e, h);
   }
   /**
    * @inheritdoc
    */
   calculateBoundingBox() {
-    const t = new B(
+    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 B(
+    ), 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)
@@ -4641,11 +4641,11 @@ class yt extends Mt {
    * @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), r = new y().subVectors(s, t), h = new y().subVectors(e, t), a = new y().crossVectors(r, h).normalize();
+    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();
     if (a.lengthSq() === 0)
       return console.error("Points are collinear and cannot form a valid 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);
+    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 _t(n, n.clone().add(l)), x = new _t(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);
   }
   /**
    * Create arc by three points
@@ -4660,7 +4660,7 @@ class yt extends Mt {
       e
     );
     if (n) {
-      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);
+      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 yt(
         n,
         i,
@@ -4679,8 +4679,8 @@ class yt extends Mt {
    * @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, 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);
+  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) % I == 0 ? (this.startAngle = 0, this.endAngle = I) : (this.startAngle = e, this.endAngle = n);
   }
   /**
    * Center of circular arc
@@ -4689,7 +4689,7 @@ class yt extends Mt {
     return this._center;
   }
   set center(t) {
-    this._center = new B(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
@@ -4708,7 +4708,7 @@ class yt extends Mt {
     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.
@@ -4717,13 +4717,13 @@ class yt extends Mt {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == I ? 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.
@@ -4779,15 +4779,15 @@ class yt extends Mt {
   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, r = -1 / 0, h = -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, h = -1 / 0, r = -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 > r && (r = o.y), o.z > h && (h = 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 > h && (h = o.y), o.z > r && (r = o.z);
     }
     return new Y(
       { x: s, y: e, z: n },
-      { x: i, y: r, z: h }
+      { x: i, y: h, z: r }
     );
   }
   /**
@@ -4807,8 +4807,8 @@ class yt extends Mt {
     let e = this.deltaAngle, n = this.startAngle;
     this.closed && (e = I, n = 0);
     for (let i = 0; i <= t; i++) {
-      const r = n + e * (i / t), h = this.getPointAtAngle(r);
-      s.push(h);
+      const h = n + e * (i / t), r = this.getPointAtAngle(h);
+      s.push(r);
     }
     return s;
   }
@@ -4858,11 +4858,11 @@ class yt extends Mt {
       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, r = this.radius;
-    return new B(
-      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))
+    }, i = this.center, h = this.radius;
+    return new S(
+      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))
     );
   }
   /**
@@ -4886,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 = 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;
+  constructor(t, s, e, n = 0, i = I, h = !1, r = 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 = h, this.rotation = r;
   }
   /**
    * Center of the ellipse in 3d space
@@ -4896,7 +4896,7 @@ class Zt extends st {
     return this._center;
   }
   set center(t) {
-    this._center = new B(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
@@ -4925,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.
@@ -4934,7 +4934,7 @@ class Zt extends st {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == I ? 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.
@@ -4959,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.
@@ -4974,9 +4974,9 @@ class Zt extends st {
    */
   calculateBoundingBox() {
     let s = 1 / 0, e = 1 / 0, n = -1 / 0, i = -1 / 0;
-    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);
+    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);
     }
     return new V({ x: s, y: e }, { x: n, y: i });
   }
@@ -4999,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 r = this.center.x + this.majorAxisRadius * Math.cos(i), h = this.center.y + this.minorAxisRadius * Math.sin(i);
+    let h = this.center.x + this.majorAxisRadius * Math.cos(i), r = this.center.y + this.minorAxisRadius * Math.sin(i);
     if (this.rotation !== 0) {
-      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;
+      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;
     }
-    return new b(r, h);
+    return new b(h, r);
   }
   /**
    * @inheritdoc
@@ -5044,10 +5044,10 @@ class Gt extends Mt {
    * @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, r = 0, h = I) {
+  constructor(t, s, e, n, i, h = 0, r = I) {
     super(), this.center = t, this.normal = s, this.majorAxis = e, this.majorAxisRadius = n, this.minorAxisRadius = i;
-    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);
+    const a = Math.abs(r - h);
+    Math.abs(a - I) < 1e-10 || Math.abs(a - 2 * I) < 1e-10 ? (this.startAngle = 0, this.endAngle = I) : (this.startAngle = h, this.endAngle = r);
   }
   /**
    * Center of the ellipse in 3d space
@@ -5056,7 +5056,7 @@ class Gt extends Mt {
     return this._center;
   }
   set center(t) {
-    this._center = new B(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
@@ -5085,7 +5085,7 @@ class Gt extends Mt {
     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.
@@ -5094,14 +5094,14 @@ class Gt extends Mt {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == I ? 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 - I) < 1e-10 ? I : 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.
@@ -5161,8 +5161,8 @@ class Gt extends Mt {
     const s = this.deltaAngle / 1e3;
     let e = 0, n = this.getPointAtAngle(this.startAngle);
     for (let i = 1; i <= 1e3; i++) {
-      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;
+      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;
     }
     return e;
   }
@@ -5175,25 +5175,25 @@ class Gt extends Mt {
     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, r = -1 / 0, h = -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, h = -1 / 0, r = -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 > r && (r = o.y), o.z > h && (h = 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 > h && (h = o.y), o.z > r && (r = o.z);
       }
       return new Y(
         { x: s, y: e, z: n },
-        { x: i, y: r, z: h }
+        { x: i, y: h, z: r }
       );
     } else {
-      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, h = -1 / 0;
+      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, h = -1 / 0, r = -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), r = Math.max(r, c.y), h = Math.max(h, 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), h = Math.max(h, c.y), r = Math.max(r, c.z);
       }
       return new Y(
         { x: s, y: e, z: n },
-        { x: i, y: r, z: h }
+        { x: i, y: h, z: r }
       );
     }
   }
@@ -5208,8 +5208,8 @@ class Gt extends Mt {
     let e = this.deltaAngle, n = this.startAngle;
     this.closed && (e = I, n = 0);
     for (let i = 0; i <= t; i++) {
-      const r = n + e * (i / t), h = this.getPointAtAngle(r);
-      s.push(h);
+      const h = n + e * (i / t), r = this.getPointAtAngle(h);
+      s.push(r);
     }
     return s;
   }
@@ -5220,7 +5220,7 @@ class Gt extends Mt {
    */
   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 B(
+    return new S(
       this.center.x + i.x,
       this.center.y + i.y,
       this.center.z + i.z
@@ -5232,8 +5232,8 @@ class Gt extends Mt {
    * @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, r = n / this.minorAxisRadius;
-    return i * i + r * r <= 1;
+    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;
   }
   /**
    * @inheritdoc
@@ -5321,8 +5321,8 @@ class Bs 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 r = new gt(n, i, n.bulge);
-          t += r.length;
+          const h = new gt(n, i, n.bulge);
+          t += h.length;
         } else
           t += new b(n.x, n.y).distanceTo(i);
     }
@@ -5379,7 +5379,7 @@ class Bs extends st {
   getPoints3d(t, s) {
     const e = [];
     return this.getPoints(t).forEach(
-      (i) => e.push(new B().set(i.x, i.y, s))
+      (i) => e.push(new S().set(i.x, i.y, s))
     ), e;
   }
   /**
@@ -5392,9 +5392,9 @@ class Bs extends st {
     for (let n = 0; n < e; ++n) {
       const i = this._vertices[n];
       if (i.bulge) {
-        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;
+        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 gt(i, h, i.bulge).getPoints(t), o = a.length;
           for (let c = 0; c < o; ++c) {
             const l = a[c];
             s.push(new b(l.x, l.y));
@@ -5629,8 +5629,8 @@ class D {
         n = ys(s, t.length);
         break;
     }
-    const i = zs(t), r = new Array(i.length).fill(1);
-    return new D(s, n, i, r);
+    const i = zs(t), h = new Array(i.length).fill(1);
+    return new D(s, n, i, h);
   }
 }
 class Es extends Mt {
@@ -5643,20 +5643,20 @@ class Es extends Mt {
     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 r = this.toNurbsPoints(this._fitPoints);
+      const h = this.toNurbsPoints(this._fitPoints);
       this._nurbsCurve = D.byPoints(
-        r,
+        h,
         i,
         this._knotParameterization
       ), 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 r = this.toNurbsPoints(this._controlPoints);
+      const h = this.toNurbsPoints(this._controlPoints);
       this._nurbsCurve = D.byKnotsControlPointsWeights(
         i,
         s,
-        r,
+        h,
         e
       ), this._originalControlPoints = [...this._controlPoints], this._originalKnots = [...this._nurbsCurve.knots()], this._originalWeights = e ? [...e] : new Array(this._controlPoints.length).fill(1);
     }
@@ -5671,15 +5671,18 @@ class Es extends Mt {
    * 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[0]]), r.push(n[0]);
-    const h = this.createClosedKnotVector(e, t);
+    const t = this._nurbsCurve.degree(), s = this._nurbsCurve.controlPoints(), e = this._nurbsCurve.weights(), n = s.length, i = [
+      ...s,
+      ...s.slice(0, t)
+    ], h = [
+      ...e,
+      ...e.slice(0, t)
+    ], r = this.createClosedKnotVector(n, t);
     this._nurbsCurve = D.byKnotsControlPointsWeights(
       t,
-      h,
+      r,
       i,
-      r
+      h
     ), this._controlPoints = this.toGePoints(i);
   }
   /**
@@ -5697,13 +5700,13 @@ class Es extends Mt {
     ), this._controlPoints = [...this._originalControlPoints];
   }
   /**
-   * Create knot vector for closed curve
+   * Create periodic knot vector for closed curve
    */
   createClosedKnotVector(t, s) {
-    const e = [...t], n = t[t.length - 1], i = s;
-    for (let r = 1; r <= i; r++)
-      e.push(n + r);
-    return e;
+    const e = t + 2 * s + 1, n = [];
+    for (let i = 0; i < e; i++)
+      n.push(i);
+    return n;
   }
   /**
    * Degree of the spline to be created.
@@ -5719,14 +5722,16 @@ class Es extends Mt {
    */
   get startPoint() {
     const t = this._nurbsCurve.knots(), s = this._nurbsCurve.degree(), e = t[s], n = this._nurbsCurve.point(e);
-    return new B(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 B(n[0], n[1], n[2]);
+    return new S(n[0], n[1], n[2]);
   }
   /**
    * @inheritdoc
@@ -5759,23 +5764,33 @@ class Es extends Mt {
     return this._controlPoints[e];
   }
   /**
-   * Divide this spline into the specified nubmer of points
+   * Divide this spline into the specified number of points
    * those points as an array of points.
-   * @param numPoints Input the nubmer of points returned
+   * @param numPoints Input the number of points returned
    * @returns Return an array of point
    */
   getPoints(t = 100) {
-    const s = this._nurbsCurve, e = [], n = s.knots(), i = this._nurbsCurve.degree(), r = n[i], h = n[n.length - i - 1], 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 B(l[0], l[1], l[2]));
+    const s = this._nurbsCurve, e = [], n = s.knots(), i = s.degree(), h = n[i], r = n[n.length - i - 1];
+    if (this._closed) {
+      const o = (r - h) / (t - 1);
+      for (let c = 0; c < t - 1; c++) {
+        const l = h + c * o, d = s.point(l);
+        e.push(new S(d[0], d[1], d[2]));
+      }
+      e.push(e[0]);
+    } else {
+      const a = (r - h) / (t - 1);
+      for (let o = 0; o < t; o++) {
+        const c = o === t - 1 ? r : h + 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], h = (n[n.length - 4] - i) / (s - 1);
+    const e = [], n = t.knots(), i = n[3], r = (n[n.length - 4] - i) / (s - 1);
     for (let a = 0; a < s; a++) {
-      const o = i + a * h;
+      const o = i + a * r;
       e.push(t.point(o));
     }
     return e;
@@ -5836,12 +5851,12 @@ export {
   Kt as AcGeLine2d,
   _t as AcGeLine3d,
   Is as AcGeLoop2d,
-  S as AcGeMathUtil,
+  C as AcGeMathUtil,
   v as AcGeMatrix2d,
   tt as AcGeMatrix3d,
   zt as AcGePlane,
   b as AcGePoint2d,
-  B as AcGePoint3d,
+  S as AcGePoint3d,
   Bs as AcGePolyline2d,
   pt as AcGeQuaternion,
   Yt as AcGeShape2d,