@mlightcad/geometry-engine 1.0.7 → 2.0.0

package/dist/geometry-engine.js

@@ -258,8 +258,8 @@ const k = [
   "ff"
 ];
 let St = 1234567;
-const Rt = Math.PI / 180, Tt = 180 / Math.PI;
-function Qt() {
+const Lt = Math.PI / 180, Tt = 180 / Math.PI;
+function Ot() {
   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,100 +269,100 @@ function j(u, t, s) {
 function Vt(u, t) {
   return (u % t + t) % t;
 }
-function Ot(u, t, s, e, n) {
+function Wt(u, t, s, e, n) {
   return e + (u - t) * (n - e) / (s - t);
 }
-function Wt(u, t, s) {
+function Ht(u, t, s) {
   return u !== t ? (s - u) / (t - u) : 0;
 }
 function Ut(u, t, s) {
   return (1 - s) * u + s * t;
 }
-function Ht(u, t, s, e) {
+function $t(u, t, s, e) {
   return Ut(u, t, 1 - Math.exp(-s * e));
 }
-function $t(u, t = 1) {
+function Jt(u, t = 1) {
   return t - Math.abs(Vt(u, t * 2) - t);
 }
-function Jt(u, t, s) {
+function vt(u, t, s) {
   return u <= t ? 0 : u >= s ? 1 : (u = (u - t) / (s - t), u * u * (3 - 2 * u));
 }
-function vt(u, t, s) {
+function ts(u, t, s) {
   return u <= t ? 0 : u >= s ? 1 : (u = (u - t) / (s - t), u * u * u * (u * (u * 6 - 15) + 10));
 }
-function ts(u, t) {
+function ss(u, t) {
   return u + Math.floor(Math.random() * (t - u + 1));
 }
-function ss(u, t) {
+function es(u, t) {
   return u + Math.random() * (t - u);
 }
-function es(u) {
+function ns(u) {
   return u * (0.5 - Math.random());
 }
-function ns(u) {
+function is(u) {
   u !== void 0 && (St = u);
   let t = St += 1831565813;
   return t = Math.imul(t ^ t >>> 15, t | 1), t ^= t + Math.imul(t ^ t >>> 7, t | 61), ((t ^ t >>> 14) >>> 0) / 4294967296;
 }
-function is(u) {
-  return u * Rt;
-}
 function rs(u) {
-  return u * Tt;
+  return u * Lt;
 }
 function hs(u) {
-  return (u & u - 1) === 0 && u !== 0;
+  return u * Tt;
 }
 function os(u) {
-  return Math.pow(2, Math.ceil(Math.log(u) / Math.LN2));
+  return (u & u - 1) === 0 && u !== 0;
 }
 function as(u) {
+  return Math.pow(2, Math.ceil(Math.log(u) / Math.LN2));
+}
+function cs(u) {
   return Math.pow(2, Math.floor(Math.log(u) / Math.LN2));
 }
 function mt(u) {
   const t = Math.PI * 2;
   return (u % t + t) % t;
 }
-function cs(u, t, s) {
+function ls(u, t, s) {
   return u > t && u < s || u > s && u < t;
 }
-function ls(u, t, s, e = !1) {
+function us(u, t, s, e = !1) {
   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));
 }
-function us(u, t = 1e-7) {
+function ds(u, t = 1e-7) {
   const s = qt(u);
   return Math.max(Math.pow(10, s) * t, t);
 }
-const C = {
-  DEG2RAD: Rt,
+const S = {
+  DEG2RAD: Lt,
   RAD2DEG: Tt,
-  generateUUID: Qt,
+  generateUUID: Ot,
   clamp: j,
   euclideanModulo: Vt,
-  mapLinear: Ot,
-  inverseLerp: Wt,
+  mapLinear: Wt,
+  inverseLerp: Ht,
   lerp: Ut,
-  damp: Ht,
-  pingpong: $t,
-  smoothstep: Jt,
-  smootherstep: vt,
-  randInt: ts,
-  randFloat: ss,
-  randFloatSpread: es,
-  seededRandom: ns,
-  degToRad: is,
-  radToDeg: rs,
-  isPowerOfTwo: hs,
-  ceilPowerOfTwo: os,
-  floorPowerOfTwo: as,
+  damp: $t,
+  pingpong: Jt,
+  smoothstep: vt,
+  smootherstep: ts,
+  randInt: ss,
+  randFloat: es,
+  randFloatSpread: ns,
+  seededRandom: is,
+  degToRad: rs,
+  radToDeg: hs,
+  isPowerOfTwo: os,
+  ceilPowerOfTwo: as,
+  floorPowerOfTwo: cs,
   normalizeAngle: mt,
-  isBetween: cs,
-  isBetweenAngle: ls,
+  isBetween: ls,
+  isBetweenAngle: us,
   intPartLength: qt,
-  relativeEps: us
+  relativeEps: ds
 }, W = class W {
   /**
    * Construct one vector by two numbers
@@ -851,8 +851,8 @@ const C = {
   }
   relativeEps(t = 1e-7) {
     return Math.min(
-      C.relativeEps(this.x, t),
-      C.relativeEps(this.y, t)
+      S.relativeEps(this.x, t),
+      S.relativeEps(this.y, t)
     );
   }
   *[Symbol.iterator]() {
@@ -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, 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;
+    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], 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], z = n[2], C = n[5], M = n[8];
+    return i[0] = h * g + r * w + a * z, i[3] = h * p + r * f + a * C, i[6] = h * _ + r * A + a * M, i[1] = o * g + c * w + l * z, i[4] = o * p + c * f + l * C, i[7] = o * _ + c * A + l * M, i[2] = m * g + d * w + x * z, i[5] = m * p + d * f + x * C, i[8] = m * _ + d * A + x * M, this;
   }
   /**
    * Multiply every component of the matrix by the scalar value s.
@@ -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], 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], h = t[4], r = t[5], a = t[6], o = t[7], c = t[8], l = c * h - r * o, m = r * a - c * i, d = o * i - h * 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] = (r * e - n * h) * g, t[3] = m * g, t[4] = (c * s - n * a) * g, t[5] = (n * i - r * s) * g, t[6] = d * g, t[7] = (e * a - o * s) * g, t[8] = (h * s - e * i) * g, this;
   }
   /**
    * Transpose this matrix in place.
@@ -1141,7 +1141,7 @@ const At = /* @__PURE__ */ new v(), Q = 1e-6, I = 2 * Math.PI, Ss = {
   y: 0,
   z: 0
 };
-class ds {
+class Ft {
   /**
    * Create tolerance class with default tolerance values
    */
@@ -1210,15 +1210,15 @@ class ds {
     return t - s < e;
   }
 }
-const Ft = new ds();
-function Xt(u, t, s = !1) {
+const Xt = new Ft();
+function Dt(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 o = t[r].x, c = t[r].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;
 }
@@ -1229,14 +1229,14 @@ function ms(u, t) {
   if (!s.intersectsBox(e))
     return !1;
   for (let n = 0; n < u.length; ) {
-    if (Xt(u[n], t, !0))
+    if (Dt(u[n], t, !0))
       return !0;
-    n < u.length - 1 && Ft.equalPoint2d(u[n + 1], u[n]) && ++n, ++n;
+    n < u.length - 1 && Xt.equalPoint2d(u[n + 1], u[n]) && ++n, ++n;
   }
   return !1;
 }
 const xs = {
-  isPointInPolygon: Xt,
+  isPointInPolygon: Dt,
   isPolygonIntersect: ms
 };
 function ys(u, t) {
@@ -1271,8 +1271,8 @@ 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 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), m = Math.sqrt(l);
+    i += m, n.push(i);
   }
   const h = [];
   for (let r = 0; r <= e; r++)
@@ -1324,8 +1324,8 @@ function ps(u, t, s, e) {
     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];
-    r += Math.sqrt(f * f + w * w + A * A), c = _;
+    const p = i + g * o, _ = xt(p, u, t, s, e), w = _[0] - c[0], f = _[1] - c[1], A = _[2] - c[2];
+    r += Math.sqrt(w * w + f * f + A * A), c = _;
   }
   const l = xt(
     h,
@@ -1333,10 +1333,10 @@ function ps(u, t, s, e) {
     t,
     s,
     e
-  ), 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;
+  ), m = l[0] - c[0], d = l[1] - c[1], x = l[2] - c[2];
+  return r += Math.sqrt(m * m + d * d + x * x), r;
 }
-function zs(u) {
+function Ms(u) {
   return u.map((t) => [...t]);
 }
 class pt {
@@ -1362,26 +1362,26 @@ class pt {
    */
   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 d = i[h + 0], m = i[h + 1], x = i[h + 2], g = i[h + 3];
+    const m = i[h + 0], d = 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 (r === 1) {
-      t[s + 0] = d, t[s + 1] = m, t[s + 2] = x, t[s + 3] = g;
+      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) {
+    if (l !== g || a !== m || o !== d || 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), B = Math.atan2(M, _ * f);
-        p = Math.sin(p * B) / M, r = Math.sin(r * B) / M;
+      const _ = a * m + o * d + c * x + l * g, w = _ >= 0 ? 1 : -1, f = 1 - _ * _;
+      if (f > Number.EPSILON) {
+        const z = Math.sqrt(f), C = Math.atan2(z, _ * w);
+        p = Math.sin(p * C) / z, r = Math.sin(r * C) / z;
       }
-      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;
+      const A = r * w;
+      if (a = a * p + m * A, o = o * p + d * A, c = c * p + x * A, l = l * p + g * A, p === 1 - r) {
+        const z = 1 / Math.sqrt(a * a + o * o + c * c + l * l);
+        a *= z, o *= z, c *= z, l *= z;
       }
     }
     t[s] = a, t[s + 1] = o, t[s + 2] = c, t[s + 3] = l;
@@ -1397,8 +1397,8 @@ class pt {
    * @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;
+    const r = e[n], a = e[n + 1], o = e[n + 2], c = e[n + 3], l = i[h], m = i[h + 1], d = i[h + 2], x = i[h + 3];
+    return t[s] = r * x + c * l + a * d - o * m, t[s + 1] = a * x + c * m + o * l - r * d, t[s + 2] = o * x + c * d + r * m - a * l, t[s + 3] = c * x - r * l - a * m - o * d, t;
   }
   /**
    * X cooridinate
@@ -1469,25 +1469,25 @@ class pt {
    * @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);
+    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), m = a(e / 2), d = a(n / 2), x = a(i / 2);
     switch (h) {
       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(
@@ -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], 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;
+    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], m = e + r + 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 = (h - n) * d;
     } 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;
+      const d = 2 * Math.sqrt(1 + e - r - l);
+      this._w = (c - a) / d, this._x = 0.25 * d, this._y = (n + h) / d, this._z = (i + o) / d;
     } 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 d = 2 * Math.sqrt(1 + r - e - l);
+      this._w = (i - o) / d, this._x = (n + h) / 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 - r);
+      this._w = (h - n) / d, this._x = (i + o) / d, this._y = (a + c) / d, this._z = 0.25 * d;
     }
     return this._onChangeCallback(), this;
   }
@@ -1661,11 +1661,11 @@ class pt {
       return this._w = h, this._x = e, this._y = n, this._z = i, this;
     const a = 1 - r * r;
     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 * h + 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, r), l = Math.sin((1 - s) * c) / o, m = Math.sin(s * c) / o;
+    return this._w = h * 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
@@ -2223,7 +2223,7 @@ const N = class N {
    * @returns Return this vector
    */
   projectOnPlane(t) {
-    return wt.copy(this).projectOnVector(t), this.sub(wt);
+    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.
@@ -2231,7 +2231,7 @@ const N = class N {
    * @returns Return this vector
    */
   reflect(t) {
-    return this.sub(wt.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.
@@ -2374,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 wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = 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.
@@ -2396,8 +2396,8 @@ 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, 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(
+  constructor(t, s, e, n, i, h, r, 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 && h != null && r != null && a != null && o != null && c != null && l != null && m != null && d != null && x != null && g != null && p != null && this.set(
       t,
       s,
       e,
@@ -2409,8 +2409,8 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
       o,
       c,
       l,
-      d,
       m,
+      d,
       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, h, r, a, o, c, l, d, m, x, g, p) {
+  set(t, s, e, n, i, h, r, a, o, c, l, m, d, x, g, p) {
     const _ = this.elements;
-    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;
+    return _[0] = t, _[4] = s, _[8] = e, _[12] = n, _[1] = i, _[5] = h, _[9] = r, _[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.
@@ -2501,7 +2501,7 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @returns Return this matrix
    */
   setFromExtrusionDirection(t) {
-    if (Ft.equalPoint3d(t, y.Z_AXIS))
+    if (Xt.equalPoint3d(t, y.Z_AXIS))
       this.identity();
     else {
       const s = new y(1, 0, 0);
@@ -2687,7 +2687,7 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @returns Return this matrix
    */
   makeRotationFromQuaternion(t) {
-    return this.compose(Ms, t, As);
+    return this.compose(zs, t, As);
   }
   /**
    * Construct a rotation matrix, looking from eye towards target oriented by the up vector.
@@ -2698,7 +2698,7 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    */
   lookAt(t, s, e) {
     const n = this.elements;
-    return L.subVectors(t, s), L.lengthSq() === 0 && (L.z = 1), L.normalize(), q.crossVectors(e, L), q.lengthSq() === 0 && (Math.abs(e.z) === 1 ? L.x += 1e-4 : L.z += 1e-4, L.normalize(), q.crossVectors(e, L)), q.normalize(), ut.crossVectors(L, q), n[0] = q.x, n[4] = ut.x, n[8] = L.x, n[1] = q.y, n[5] = ut.y, n[9] = L.y, n[2] = q.z, n[6] = ut.z, n[10] = L.z, this;
+    return R.subVectors(t, s), R.lengthSq() === 0 && (R.z = 1), R.normalize(), q.crossVectors(e, R), q.lengthSq() === 0 && (Math.abs(e.z) === 1 ? R.x += 1e-4 : R.z += 1e-4, R.normalize(), q.crossVectors(e, R)), q.normalize(), ut.crossVectors(R, q), n[0] = q.x, n[4] = ut.x, n[8] = R.x, n[1] = q.y, n[5] = ut.y, n[9] = R.y, n[2] = q.z, n[6] = ut.z, n[10] = R.z, this;
   }
   /**
    * Post-multiply this matrix by m.
@@ -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, 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;
+    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], 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], z = e[15], C = n[0], M = 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 * C + r * G + a * nt + o * ot, i[4] = h * M + 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 * C + l * G + m * nt + d * ot, i[5] = c * M + 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 * M + 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 * C + f * G + A * nt + z * ot, i[7] = w * M + f * F + A * it + z * at, i[11] = w * E + f * K + A * rt + z * ct, i[15] = w * Z + f * et + A * ht + z * 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], 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);
+    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], 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 * r * m + e * o * m + n * r * d - e * a * d) + g * (+s * a * d - s * o * m + i * h * m - n * h * d + n * o * c - i * a * c) + p * (+s * o * l - s * r * d - i * h * l + e * h * d + i * r * c - e * o * c) + _ * (-n * r * c - s * a * l + s * r * m + n * h * l - e * h * m + 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], 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)
+    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], 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 - r * p * d - l * a * _ + r * m * _, f = x * m * o - c * p * o - x * a * d + h * p * d + c * a * _ - h * m * _, A = c * g * o - x * l * o + x * r * d - h * g * d - c * r * _ + h * l * _, z = x * l * a - c * g * a - x * r * m + h * g * m + c * r * p - h * l * p, C = s * w + e * f + n * A + i * z;
+    if (C === 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] = 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;
+    const M = 1 / C;
+    return t[0] = w * M, t[1] = (g * m * i - l * p * i - g * n * d + e * p * d + l * n * _ - e * m * _) * M, t[2] = (r * p * i - g * a * i + g * n * o - e * p * o - r * n * _ + e * a * _) * M, t[3] = (l * a * i - r * m * i - l * n * o + e * m * o + r * n * d - e * a * d) * M, t[4] = f * M, t[5] = (c * p * i - x * m * i + x * n * d - s * p * d - c * n * _ + s * m * _) * M, t[6] = (x * a * i - h * p * i - x * n * o + s * p * o + h * n * _ - s * a * _) * M, t[7] = (h * m * i - c * a * i + c * n * o - s * m * o - h * n * d + s * a * d) * M, t[8] = A * M, t[9] = (x * l * i - c * g * i - x * e * d + s * g * d + c * e * _ - s * l * _) * M, t[10] = (h * g * i - x * r * i + x * e * o - s * g * o - h * e * _ + s * r * _) * M, t[11] = (c * r * i - h * l * i - c * e * o + s * l * o + h * e * d - s * r * d) * M, t[12] = z * M, t[13] = (c * g * n - x * l * n + x * e * m - s * g * m - c * e * p + s * l * p) * M, t[14] = (x * r * n - h * g * n - x * e * a + s * g * a + h * e * p - s * r * p) * M, t[15] = (h * l * n - c * r * n + c * e * a - s * l * a - h * e * m + s * r * m) * M, this;
   }
   /**
    * Multiply the columns of this matrix by vector v.
@@ -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, 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;
+    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, m = i * o, d = i * c, x = i * l, g = h * c, p = h * l, _ = r * l, w = a * o, f = a * c, A = a * l, z = e.x, C = e.y, M = e.z;
+    return n[0] = (1 - (g + _)) * z, n[1] = (d + A) * z, n[2] = (x - f) * z, n[3] = 0, n[4] = (d - A) * C, n[5] = (1 - (m + _)) * C, n[6] = (p + w) * C, n[7] = 0, n[8] = (x + f) * M, n[9] = (p - w) * M, n[10] = (1 - (m + g)) * M, 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.
@@ -2905,9 +2905,9 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
     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();
-    this.determinant() < 0 && (i = -i), t.x = n[12], t.y = n[13], t.z = n[14], R.copy(this);
+    this.determinant() < 0 && (i = -i), t.x = n[12], t.y = n[13], t.z = n[14], L.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;
+    return L.elements[0] *= o, L.elements[1] *= o, L.elements[2] *= o, L.elements[4] *= c, L.elements[5] *= c, L.elements[6] *= c, L.elements[8] *= l, L.elements[9] *= l, L.elements[10] *= l, s.setFromRotationMatrix(L), e.x = i, e.y = h, e.z = r, this;
   }
   // makePerspective(
   //   left,
@@ -3035,7 +3035,7 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
 };
 $.IDENTITY = Object.freeze(new $());
 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();
+const O = /* @__PURE__ */ new y(), L = /* @__PURE__ */ new tt(), zs = /* @__PURE__ */ new y(0, 0, 0), As = /* @__PURE__ */ new y(1, 1, 1), q = /* @__PURE__ */ new y(), ut = /* @__PURE__ */ new y(), R = /* @__PURE__ */ new y();
 class Y {
   /**
    * Create a 3d box bounded by min and max.
@@ -3065,7 +3065,7 @@ class Y {
   setFromArray(t) {
     this.makeEmpty();
     for (let s = 0, e = t.length; s < e; s += 3)
-      this.expandByPoint(ft.fromArray(t, s));
+      this.expandByPoint(wt.fromArray(t, s));
     return this;
   }
   /**
@@ -3086,7 +3086,7 @@ class Y {
    * @returns Return this box
    */
   setFromCenterAndSize(t, s) {
-    const e = ft.copy(s).multiplyScalar(0.5);
+    const e = wt.copy(s).multiplyScalar(0.5);
     return this.min.copy(t).sub(e), this.max.copy(t).add(e), this;
   }
   /**
@@ -3237,7 +3237,7 @@ class Y {
    * @returns Return the distance from any edge of this box to the specified point.
    */
   distanceToPoint(t) {
-    return this.clampPoint(t, ft).distanceTo(t);
+    return this.clampPoint(t, wt).distanceTo(t);
   }
   /**
    * Compute the intersection of this and box, setting the upper bound of this box to the lesser of the
@@ -3293,7 +3293,7 @@ const U = [
   /* @__PURE__ */ new y(),
   /* @__PURE__ */ new y(),
   /* @__PURE__ */ new y()
-], ft = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new P();
+], wt = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new P();
 class V {
   /**
    * Create a 2d box bounded by min and max.
@@ -3511,8 +3511,8 @@ class V {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const It = /* @__PURE__ */ new y(), ws = /* @__PURE__ */ new y(), fs = /* @__PURE__ */ new v();
-class zt {
+const It = /* @__PURE__ */ new y(), fs = /* @__PURE__ */ new y(), ws = /* @__PURE__ */ new v();
+class Mt {
   /**
    * Create one plane
    * @param normal (optional) Input a unit length Vector3 defining the normal of the plane.
@@ -3560,7 +3560,7 @@ class zt {
    * @returns Return this plane
    */
   setFromCoplanarPoints(t, s, e) {
-    const n = It.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;
   }
   /**
@@ -3662,7 +3662,7 @@ class zt {
    * @returns Return this plane
    */
   applyMatrix4(t, s) {
-    const e = s || fs.getNormalMatrix(t), n = this.coplanarPoint(It).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;
   }
   /**
@@ -3687,7 +3687,7 @@ class zt {
    * @returns Return the cloned plane
    */
   clone() {
-    return new zt().copy(this);
+    return new Mt().copy(this);
   }
 }
 class b extends P {
@@ -3703,7 +3703,7 @@ class b extends P {
     }), s;
   }
 }
-class S extends y {
+class B extends y {
   /**
    * Convert one point array to one number array
    * @param array Input one point array
@@ -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], 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], h = n[4], r = 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(r, -1, 1)), Math.abs(r) < 0.9999999 ? (this._x = Math.atan2(-c, d), this._z = Math.atan2(-h, 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(r, 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(-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(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(-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(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(r, 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(h, -1, 1)), Math.abs(h) < 0.9999999 ? (this._x = Math.atan2(m, o), this._y = Math.atan2(r, i)) : (this._x = Math.atan2(-c, d), this._y = 0);
         break;
       default:
         console.warn(
@@ -3911,7 +3911,7 @@ const Et = /* @__PURE__ */ new tt(), kt = /* @__PURE__ */ new pt(), J = class J
 };
 J.DEFAULT_ORDER = "XYZ";
 let Nt = J;
-class Dt {
+class Yt {
   constructor() {
     this._boundingBoxNeedsUpdate = !1;
   }
@@ -3923,7 +3923,7 @@ class Dt {
     return this._boundingBoxNeedsUpdate;
   }
 }
-class Yt extends Dt {
+class Zt extends Yt {
   /**
    * Return new shape translated by given vector.
    */
@@ -3939,7 +3939,7 @@ class Yt extends Dt {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class Cs extends Yt {
+class Cs extends Zt {
   /**
    * Create one 2d area defined by one outter loop and multiple inner loops
    */
@@ -4004,18 +4004,18 @@ class Cs extends Yt {
     const h = { 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[C.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[S.randInt(0, c.length - 1)],
           x
         )) {
-          (r = n.get(m)) == null || r.children.push(n.get(o));
+          (r = n.get(d)) == null || r.children.push(n.get(o));
           break;
         }
       }
-      d === i && h.children.push(n.get(o));
+      m === i && h.children.push(n.get(o));
     }
     return h;
   }
@@ -4050,7 +4050,7 @@ class Cs extends Yt {
     }), e;
   }
 }
-class st extends Yt {
+class st extends Zt {
   constructor() {
     super(), this.arcLengthDivisions = 100;
   }
@@ -4156,8 +4156,8 @@ class st extends Yt {
       }
     if (n = a, e[n] === h)
       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 = (h - c) / m;
+    return (n + d) / (i - 1);
   }
   /**
    * Return a unit vector tangent at `t`. If the derived curve does not implement its tangent derivation,
@@ -4211,16 +4211,16 @@ class gt extends st {
    * @param p3 Input the end point
    */
   createByThreePoints(t, s, e) {
-    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), 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;
+    const n = (M, E) => ({
+      x: (M.x + E.x) / 2,
+      y: (M.y + E.y) / 2
+    }), i = (M, E) => (E.y - M.y) / (E.x - M.x), h = (M) => -1 / M, r = n(t, s), a = n(s, e), o = i(t, s), c = i(s, e), l = h(o), m = h(c), d = (M, E, Z, G) => {
+      const F = (G - E) / (M - Z), K = M * F + E;
       return { x: F, y: K };
-    }, x = r.y - l * r.x, g = a.y - d * a.x, p = m(l, x, d, g), _ = Math.sqrt(
+    }, x = r.y - l * r.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)
-    ), 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;
+    ), w = (M, E) => Math.atan2(M.y - E.y, M.x - E.x), f = w(t, p), A = w(s, p), z = w(e, p), C = z > f && z < A || f > z && f < A || A > z && A < f;
+    this.center = p, this.radius = _, this.startAngle = f, this.endAngle = z, this.clockwise = !C;
   }
   /**
    * Create circular arc by two points and one bugle factor
@@ -4237,21 +4237,21 @@ class gt extends st {
     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;
+    let m;
     if (n < Math.PI) {
-      const m = new P(
+      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 P(
+      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(h.y - m.y, h.x - m.x)) : (this.startAngle = Math.atan2(h.y - m.y, h.x - m.x), this.endAngle = Math.atan2(i.y - m.y, i.x - m.x)), this.clockwise = e < 0, this.center = m, this.radius = h.sub(m).length();
   }
   /**
    * Center of circular arc
@@ -4278,7 +4278,7 @@ class gt extends st {
     return this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = S.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 : C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == I ? t : S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Angle between endAngle and startAngle in range 0 to 2*PI
    */
   get deltaAngle() {
-    return this.clockwise ? C.normalizeAngle(this.startAngle - this.endAngle) : C.normalizeAngle(this.endAngle - this.startAngle);
+    return this.clockwise ? S.normalizeAngle(this.startAngle - this.endAngle) : S.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 = C.normalizeAngle(
+    const t = S.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)
-      C.isBetweenAngle(
+      S.isBetweenAngle(
         i,
         this.startAngle,
         this.endAngle,
@@ -4403,7 +4403,7 @@ class gt extends st {
     return s;
   }
 }
-class Ps extends Dt {
+class Ps extends Yt {
   /**
    * Return new shape translated by given vector.
    * Translation vector may be also defined by a pair of numbers.
@@ -4420,15 +4420,15 @@ class Ps extends Dt {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class Mt extends Ps {
+class zt extends Ps {
 }
-class _t extends Mt {
+class _t extends zt {
   /**
    * 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 S(t), this._end = new S(s);
+    super(), this._start = new B(t), this._end = new B(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 S(
+    return new B(
       (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 S(this._start).addScaledVector(e, t);
+      return new B(this._start).addScaledVector(e, t);
     } else {
       const e = this.delta(X).normalize();
-      return new S(this._end).addScaledVector(e, t);
+      return new B(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 S(this._start).addScaledVector(
+      this._start = new B(this._start).addScaledVector(
         e,
         t
       );
     } else {
       const e = this.delta(X).normalize();
-      this._end = new S(this._end).addScaledVector(e, t);
+      this._end = new B(this._end).addScaledVector(e, t);
     }
     return this._boundingBoxNeedsUpdate = !0, this;
   }
@@ -4532,10 +4532,10 @@ class _t extends Mt {
    * @returns Return a point parameter based on the closest point as projected on the line segment.
    */
   closestPointToPointParameter(t, s) {
-    Lt.subVectors(t, this._start), dt.subVectors(this.endPoint, this.startPoint);
+    Rt.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;
+    let i = dt.dot(Rt) / e;
+    return s && (i = S.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 S().copy(s).multiplyScalar(n).add(this.startPoint);
+    return new B().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
@@ -4589,17 +4589,17 @@ class _t extends Mt {
    */
   perpPoint(t) {
     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);
+    return new B().addVectors(e, h);
   }
   /**
    * @inheritdoc
    */
   calculateBoundingBox() {
-    const t = new S(
+    const t = new B(
       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 S(
+    ), s = new B(
       Math.max(this._start.x, this._end.x),
       Math.max(this._start.y, this._end.y),
       Math.max(this._start.z, this._end.z)
@@ -4631,8 +4631,8 @@ class _t extends Mt {
     return new _t(this._start.clone(), this._end.clone());
   }
 }
-const X = /* @__PURE__ */ new y(), Lt = /* @__PURE__ */ new y(), dt = /* @__PURE__ */ new y();
-class yt extends Mt {
+const X = /* @__PURE__ */ new y(), Rt = /* @__PURE__ */ new y(), dt = /* @__PURE__ */ new y();
+class yt extends zt {
   /**
    * Compute center point of the arc given three points
    * @param startPoint Input start point of the arc
@@ -4644,8 +4644,8 @@ class yt extends Mt {
     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(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);
+    const o = new y().crossVectors(h, a).normalize(), c = new y().crossVectors(r, 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
@@ -4689,7 +4689,7 @@ class yt extends Mt {
     return this._center;
   }
   set center(t) {
-    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new B(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 = C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = S.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 : C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == I ? t : S.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Return angle between endAngle and startAngle in range 0 to 2*PI
    */
   get deltaAngle() {
-    return C.normalizeAngle(this.endAngle - this.startAngle);
+    return S.normalizeAngle(this.endAngle - this.startAngle);
   }
   /**
    * Return true if the arc is a large arc whose delta angle value is greater than PI.
@@ -4779,7 +4779,7 @@ class yt extends Mt {
   calculateBoundingBox() {
     const t = [this.startAngle, this.endAngle];
     for (let a = 0; a < 2 * Math.PI; a += Math.PI / 2)
-      C.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
+      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;
     for (const a of t) {
       const o = this.getPointAtAngle(a);
@@ -4859,7 +4859,7 @@ class yt extends Mt {
       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 S(
+    return new B(
       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))
@@ -4870,11 +4870,11 @@ class yt extends Mt {
    */
   get plane() {
     const t = new y(this.center).distanceTo(jt);
-    return new zt(this.normal, t);
+    return new Mt(this.normal, t);
   }
 }
 const Pt = /* @__PURE__ */ new y();
-class Zt extends st {
+class Gt extends st {
   /**
    * Construct an instance of the ellipse arc.
    * @param center Center point of the ellipse.
@@ -4896,7 +4896,7 @@ class Zt extends st {
     return this._center;
   }
   set center(t) {
-    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new B(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 = C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = S.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 : C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == I ? t : S.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 C.normalizeAngle(this.endAngle - this.startAngle);
+    return S.normalizeAngle(this.endAngle - this.startAngle);
   }
   /**
    * Return true if the arc is a large arc whose delta angle value is greater than PI.
@@ -5022,7 +5022,7 @@ class Zt extends st {
    * @inheritdoc
    */
   clone() {
-    return new Zt(
+    return new Gt(
       this.center,
       this.majorAxisRadius,
       this.minorAxisRadius,
@@ -5033,7 +5033,7 @@ class Zt extends st {
     );
   }
 }
-class Gt extends Mt {
+class Kt extends zt {
   /**
    * Construct an instance of the ellipse arc.
    * @param center Center point of the ellipse.
@@ -5056,7 +5056,7 @@ class Gt extends Mt {
     return this._center;
   }
   set center(t) {
-    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new B(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 = C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = S.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 : C.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == I ? t : S.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 : C.normalizeAngle(t);
+    return Math.abs(t - I) < 1e-10 ? I : S.normalizeAngle(t);
   }
   /**
    * Return true if the arc is a large arc whose delta angle value is greater than PI.
@@ -5157,10 +5157,19 @@ class Gt extends Mt {
   /**
    * @inheritdoc
    */
+  /**
+   * Check if this ellipse arc is actually a circular arc (major and minor radii are equal)
+   * @returns True if the ellipse arc is circular
+   */
+  get isCircular() {
+    return Ft.equal(this.majorAxisRadius, this.minorAxisRadius);
+  }
   get length() {
-    const s = this.deltaAngle / 1e3;
+    if (this.isCircular)
+      return this.majorAxisRadius * Math.abs(this.deltaAngle);
+    const t = 1e3, s = this.deltaAngle / t;
     let e = 0, n = this.getPointAtAngle(this.startAngle);
-    for (let i = 1; i <= 1e3; i++) {
+    for (let i = 1; i <= t; 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;
     }
@@ -5175,7 +5184,7 @@ 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)
-        C.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
+        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;
       for (const a of t) {
         const o = this.getPointAtAngle(a);
@@ -5220,7 +5229,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 S(
+    return new B(
       this.center.x + i.x,
       this.center.y + i.y,
       this.center.z + i.z
@@ -5251,7 +5260,7 @@ class Gt extends Mt {
    * @inheritdoc
    */
   clone() {
-    return new Gt(
+    return new Kt(
       this.center,
       this.normal,
       this.majorAxis,
@@ -5266,7 +5275,7 @@ class Gt extends Mt {
    */
   get plane() {
     const t = new y(this.center).distanceTo(jt);
-    return new zt(this.normal, t);
+    return new Mt(this.normal, t);
   }
 }
 class Bs extends st {
@@ -5379,7 +5388,7 @@ class Bs extends st {
   getPoints3d(t, s) {
     const e = [];
     return this.getPoints(t).forEach(
-      (i) => e.push(new S().set(i.x, i.y, s))
+      (i) => e.push(new B().set(i.x, i.y, s))
     ), e;
   }
   /**
@@ -5406,7 +5415,7 @@ class Bs extends st {
     return s;
   }
 }
-class Kt extends st {
+class Qt 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.
@@ -5482,7 +5491,7 @@ class Kt extends st {
    * @inheritdoc
    */
   clone() {
-    return new Kt(this._start.clone(), this._end.clone());
+    return new Qt(this._start.clone(), this._end.clone());
   }
 }
 class Is extends st {
@@ -5629,37 +5638,38 @@ class D {
         n = ys(s, t.length);
         break;
     }
-    const i = zs(t), h = new Array(i.length).fill(1);
+    const i = Ms(t), h = new Array(i.length).fill(1);
     return new D(s, n, i, h);
   }
 }
-class Es extends Mt {
-  constructor(t, s, e) {
+class Es extends zt {
+  constructor(t, s, e, n) {
     super();
-    const n = +(t !== void 0) + +(s !== void 0) + +(e !== void 0);
-    if (n != 2 && n != 3)
+    const i = +(t !== void 0) + +(s !== void 0) + +(e !== void 0) + +(n !== void 0);
+    if (i < 2 || i > 4)
       throw T.ILLEGAL_PARAMETERS;
-    const i = 3;
-    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 = D.byPoints(
-        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)
+    const h = 3;
+    if (this._closed = n || !1, Array.isArray(s)) {
+      if (this._controlPoints = t, i >= 4 && (this._closed = n), this._controlPoints.length < 4)
         throw T.ILLEGAL_PARAMETERS;
-      const h = this.toNurbsPoints(this._controlPoints);
+      const r = this.toNurbsPoints(this._controlPoints);
       this._nurbsCurve = D.byKnotsControlPointsWeights(
-        i,
-        s,
         h,
+        s,
+        r,
         e
       ), this._originalControlPoints = [...this._controlPoints], this._originalKnots = [...this._nurbsCurve.knots()], this._originalWeights = e ? [...e] : new Array(this._controlPoints.length).fill(1);
+    } else {
+      if (this._fitPoints = t, this._knotParameterization = s, i >= 3 && (this._closed = e), this._fitPoints.length < 4)
+        throw T.ILLEGAL_PARAMETERS;
+      const r = this.toNurbsPoints(this._fitPoints);
+      this._nurbsCurve = D.byPoints(
+        r,
+        h,
+        this._knotParameterization
+      ), this._controlPoints = this.toGePoints(this._nurbsCurve.controlPoints()), this._originalControlPoints = [...this._controlPoints], this._originalKnots = [...this._nurbsCurve.knots()], this._originalWeights = [...this._nurbsCurve.weights()];
     }
+    this._closed && this.makeClosed();
   }
   /**
    * Set the closed property and rebuild the curve if necessary
@@ -5671,13 +5681,10 @@ 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.weights(), n = s.length, i = [
-      ...s,
-      ...s.slice(0, t)
-    ], h = [
-      ...e,
-      ...e.slice(0, t)
-    ], r = this.createClosedKnotVector(n, t);
+    const t = this._nurbsCurve.degree(), s = this._nurbsCurve.controlPoints(), e = this._nurbsCurve.knots(), n = this._nurbsCurve.weights(), i = [...s], h = [...n];
+    for (let a = 0; a < t; a++)
+      i.push([...s[0]]), h.push(n[0]);
+    const r = this.createClosedKnotVector(e, t);
     this._nurbsCurve = D.byKnotsControlPointsWeights(
       t,
       r,
@@ -5700,13 +5707,13 @@ class Es extends Mt {
     ), this._controlPoints = [...this._originalControlPoints];
   }
   /**
-   * Create periodic knot vector for closed curve
+   * Create knot vector for closed curve
    */
   createClosedKnotVector(t, s) {
-    const e = t + 2 * s + 1, n = [];
-    for (let i = 0; i < e; i++)
-      n.push(i);
-    return n;
+    const e = [...t], n = t[t.length - 1], i = s;
+    for (let h = 1; h <= i; h++)
+      e.push(n + h);
+    return e;
   }
   /**
    * Degree of the spline to be created.
@@ -5722,16 +5729,14 @@ 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 S(n[0], n[1], n[2]);
+    return new B(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 S(n[0], n[1], n[2]);
+    return new B(n[0], n[1], n[2]);
   }
   /**
    * @inheritdoc
@@ -5764,26 +5769,16 @@ class Es extends Mt {
     return this._controlPoints[e];
   }
   /**
-   * Divide this spline into the specified number of points
+   * Divide this spline into the specified nubmer of points
    * those points as an array of points.
-   * @param numPoints Input the number of points returned
+   * @param numPoints Input the nubmer of points returned
    * @returns Return an array of point
    */
   getPoints(t = 100) {
-    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]));
-      }
+    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++) {
+      const c = o === t - 1 ? r : h + o * a, l = s.point(c);
+      e.push(new B(l[0], l[1], l[2]));
     }
     return e;
   }
@@ -5844,28 +5839,28 @@ export {
   gt as AcGeCircArc2d,
   yt as AcGeCircArc3d,
   st as AcGeCurve2d,
-  Zt as AcGeEllipseArc2d,
-  Gt as AcGeEllipseArc3d,
+  Gt as AcGeEllipseArc2d,
+  Kt as AcGeEllipseArc3d,
   Nt as AcGeEuler,
   xs as AcGeGeometryUtil,
-  Kt as AcGeLine2d,
+  Qt as AcGeLine2d,
   _t as AcGeLine3d,
   Is as AcGeLoop2d,
-  C as AcGeMathUtil,
+  S as AcGeMathUtil,
   v as AcGeMatrix2d,
   tt as AcGeMatrix3d,
-  zt as AcGePlane,
+  Mt as AcGePlane,
   b as AcGePoint2d,
-  S as AcGePoint3d,
+  B as AcGePoint3d,
   Bs as AcGePolyline2d,
   pt as AcGeQuaternion,
-  Yt as AcGeShape2d,
+  Zt as AcGeShape2d,
   Es as AcGeSpline3d,
-  ds as AcGeTol,
+  Ft as AcGeTol,
   P as AcGeVector2d,
   y as AcGeVector3d,
-  Ft as DEFAULT_TOL,
-  Rt as DEG2RAD,
+  Xt as DEFAULT_TOL,
+  Lt as DEG2RAD,
   Q as FLOAT_TOL,
   Ss as ORIGIN_POINT_2D,
   jt as ORIGIN_POINT_3D,
@@ -5873,35 +5868,35 @@ export {
   I as TAU,
   bt as basisFunction,
   ps as calculateCurveLength,
-  os as ceilPowerOfTwo,
+  as as ceilPowerOfTwo,
   j as clamp,
-  Ht as damp,
-  is as degToRad,
+  $t as damp,
+  rs as degToRad,
   Vt as euclideanModulo,
   xt as evaluateNurbsPoint,
-  as as floorPowerOfTwo,
+  cs as floorPowerOfTwo,
   gs as generateChordKnots,
   _s as generateSqrtChordKnots,
-  Qt as generateUUID,
+  Ot as generateUUID,
   ys as generateUniformKnots,
   qt as intPartLength,
-  zs as interpolateControlPoints,
-  Wt as inverseLerp,
-  cs as isBetween,
-  ls as isBetweenAngle,
-  Xt as isPointInPolygon,
+  Ms as interpolateControlPoints,
+  Ht as inverseLerp,
+  ls as isBetween,
+  us as isBetweenAngle,
+  Dt as isPointInPolygon,
   ms as isPolygonIntersect,
-  hs as isPowerOfTwo,
+  os as isPowerOfTwo,
   Ut as lerp,
-  Ot as mapLinear,
+  Wt as mapLinear,
   mt as normalizeAngle,
-  $t as pingpong,
-  rs as radToDeg,
-  ss as randFloat,
-  es as randFloatSpread,
-  ts as randInt,
-  us as relativeEps,
-  ns as seededRandom,
-  vt as smootherstep,
-  Jt as smoothstep
+  Jt as pingpong,
+  hs as radToDeg,
+  es as randFloat,
+  ns as randFloatSpread,
+  ss as randInt,
+  ds as relativeEps,
+  is as seededRandom,
+  ts as smootherstep,
+  vt as smoothstep
 };