@mlightcad/geometry-engine 1.0.7 → 2.0.1

package/dist/geometry-engine.js

@@ -1,5 +1,5 @@
-import { AcCmErrors as T } from "@mlightcad/common";
-const k = [
+import { AcCmErrors as L } from "@mlightcad/common";
+const R = [
   "00",
   "01",
   "02",
@@ -257,113 +257,113 @@ const k = [
   "fe",
   "ff"
 ];
-let St = 1234567;
-const Rt = Math.PI / 180, Tt = 180 / Math.PI;
-function Qt() {
+let Ct = 1234567;
+const Lt = Math.PI / 180, Ut = 180 / Math.PI;
+function $t() {
   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();
+  return (R[u & 255] + R[u >> 8 & 255] + R[u >> 16 & 255] + R[u >> 24 & 255] + "-" + R[t & 255] + R[t >> 8 & 255] + "-" + R[t >> 16 & 15 | 64] + R[t >> 24 & 255] + "-" + R[s & 63 | 128] + R[s >> 8 & 255] + "-" + R[s >> 16 & 255] + R[s >> 24 & 255] + R[e & 255] + R[e >> 8 & 255] + R[e >> 16 & 255] + R[e >> 24 & 255]).toLowerCase();
 }
-function j(u, t, s) {
+function X(u, t, s) {
   return Math.max(t, Math.min(s, u));
 }
-function Vt(u, t) {
+function qt(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 Jt(u, t, s) {
   return u !== t ? (s - u) / (t - u) : 0;
 }
-function Ut(u, t, s) {
+function Vt(u, t, s) {
   return (1 - s) * u + s * t;
 }
-function Ht(u, t, s, e) {
-  return Ut(u, t, 1 - Math.exp(-s * e));
+function vt(u, t, s, e) {
+  return Vt(u, t, 1 - Math.exp(-s * e));
 }
-function $t(u, t = 1) {
-  return t - Math.abs(Vt(u, t * 2) - t);
+function ts(u, t = 1) {
+  return t - Math.abs(qt(u, t * 2) - t);
 }
-function Jt(u, t, s) {
+function ss(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 es(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 ns(u, t) {
   return u + Math.floor(Math.random() * (t - u + 1));
 }
-function ss(u, t) {
+function is(u, t) {
   return u + Math.random() * (t - u);
 }
-function es(u) {
+function rs(u) {
   return u * (0.5 - Math.random());
 }
-function ns(u) {
-  u !== void 0 && (St = u);
-  let t = St += 1831565813;
+function hs(u) {
+  u !== void 0 && (Ct = u);
+  let t = Ct += 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 os(u) {
+  return u * Lt;
 }
-function rs(u) {
-  return u * Tt;
+function as(u) {
+  return u * Ut;
 }
-function hs(u) {
+function cs(u) {
   return (u & u - 1) === 0 && u !== 0;
 }
-function os(u) {
+function ls(u) {
   return Math.pow(2, Math.ceil(Math.log(u) / Math.LN2));
 }
-function as(u) {
+function us(u) {
   return Math.pow(2, Math.floor(Math.log(u) / Math.LN2));
 }
-function mt(u) {
+function xt(u) {
   const t = Math.PI * 2;
   return (u % t + t) % t;
 }
-function cs(u, t, s) {
+function ds(u, t, s) {
   return u > t && u < s || u > s && u < t;
 }
-function ls(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 ms(u, t, s, e = !1) {
+  return u = xt(u), t = xt(t), s = xt(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) {
+function jt(u) {
   return u = Math.abs(u), u < 1 ? 0 : Math.ceil(Math.log10(Math.abs(u) + 1));
 }
-function us(u, t = 1e-7) {
-  const s = qt(u);
+function xs(u, t = 1e-7) {
+  const s = jt(u);
   return Math.max(Math.pow(10, s) * t, t);
 }
 const C = {
-  DEG2RAD: Rt,
-  RAD2DEG: Tt,
-  generateUUID: Qt,
-  clamp: j,
-  euclideanModulo: Vt,
-  mapLinear: Ot,
-  inverseLerp: Wt,
-  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,
-  normalizeAngle: mt,
-  isBetween: cs,
-  isBetweenAngle: ls,
-  intPartLength: qt,
-  relativeEps: us
-}, W = class W {
+  DEG2RAD: Lt,
+  RAD2DEG: Ut,
+  generateUUID: $t,
+  clamp: X,
+  euclideanModulo: qt,
+  mapLinear: Wt,
+  inverseLerp: Jt,
+  lerp: Vt,
+  damp: vt,
+  pingpong: ts,
+  smoothstep: ss,
+  smootherstep: es,
+  randInt: ns,
+  randFloat: is,
+  randFloatSpread: rs,
+  seededRandom: hs,
+  degToRad: os,
+  radToDeg: as,
+  isPowerOfTwo: cs,
+  ceilPowerOfTwo: ls,
+  floorPowerOfTwo: us,
+  normalizeAngle: xt,
+  isBetween: ds,
+  isBetweenAngle: ms,
+  intPartLength: jt,
+  relativeEps: xs
+}, K = class K {
   /**
    * Construct one vector by two numbers
    */
@@ -384,7 +384,7 @@ const C = {
         this.x = t, this.y = s;
         return;
       }
-      throw T.ILLEGAL_PARAMETERS;
+      throw L.ILLEGAL_PARAMETERS;
     }
   }
   /**
@@ -479,7 +479,7 @@ const C = {
    * @returns Return the cloned vector
    */
   clone() {
-    return new W(this.x, this.y);
+    return new K(this.x, this.y);
   }
   /**
    * Copy the values of the passed vector's x and y properties to this vector.
@@ -859,9 +859,9 @@ const C = {
     yield this.x, yield this.y;
   }
 };
-W.EMPTY = Object.freeze(new W(0, 0));
-let P = W;
-const H = class H {
+K.EMPTY = Object.freeze(new K(0, 0));
+let b = K;
+const $ = class $ {
   /**
    * Create a 3x3 matrix with the given arguments in row-major order. If no arguments are provided,
    * the constructor initializes the Matrix3 to the 3x3 identity matrix.
@@ -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], d = e[2], m = e[5], x = e[8], y = n[0], _ = n[3], p = n[6], P = n[1], w = n[4], f = n[7], M = n[2], B = n[5], z = n[8];
+    return i[0] = h * y + r * P + a * M, i[3] = h * _ + r * w + a * B, i[6] = h * p + r * f + a * z, i[1] = o * y + c * P + l * M, i[4] = o * _ + c * w + l * B, i[7] = o * p + c * f + l * z, i[2] = d * y + m * P + x * M, i[5] = d * _ + m * w + x * B, i[8] = d * p + m * f + x * z, this;
   }
   /**
    * Multiply every component of the matrix by the scalar value s.
@@ -982,8 +982,8 @@ const H = class H {
   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;
     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;
+    const y = 1 / x;
+    return t[0] = l * y, t[1] = (n * o - c * e) * y, t[2] = (r * e - n * h) * y, t[3] = d * y, t[4] = (c * s - n * a) * y, t[5] = (n * i - r * s) * y, t[6] = m * y, t[7] = (e * a - o * s) * y, t[8] = (h * s - e * i) * y, this;
   }
   /**
    * Transpose this matrix in place.
@@ -1071,7 +1071,7 @@ const H = class H {
    * @returns Return this matrix
    */
   makeTranslation(t, s) {
-    return t instanceof P ? this.set(1, 0, t.x, 0, 1, t.y, 0, 0, 1) : this.set(1, 0, t, 0, 1, s, 0, 0, 1), this;
+    return t instanceof b ? this.set(1, 0, t.x, 0, 1, t.y, 0, 0, 1) : this.set(1, 0, t, 0, 1, s, 0, 0, 1), this;
   }
   /**
    * Set this matrix as a 2D rotational transformation by theta radians
@@ -1128,25 +1128,25 @@ const H = class H {
    * @returns Return the cloned matrix
    */
   clone() {
-    return new H().fromArray(this.elements);
+    return new $().fromArray(this.elements);
   }
 };
-H.IDENTITY = Object.freeze(new H());
-let v = H;
-const At = /* @__PURE__ */ new v(), Q = 1e-6, I = 2 * Math.PI, Ss = {
+$.IDENTITY = Object.freeze(new $());
+let v = $;
+const At = /* @__PURE__ */ new v(), O = 1e-6, I = 2 * Math.PI, Bs = {
   x: 0,
   y: 0
-}, jt = {
+}, Ft = {
   x: 0,
   y: 0,
   z: 0
 };
-class ds {
+class Xt {
   /**
    * Create tolerance class with default tolerance values
    */
   constructor() {
-    this.equalPointTol = Q, this.equalVectorTol = Q;
+    this.equalPointTol = O, this.equalVectorTol = O;
   }
   /**
    * Return true if two points are equal with the specified tolerance.
@@ -1155,7 +1155,7 @@ class ds {
    * @returns Return true if two poitns are equal with the specified tolerance.
    */
   equalPoint2d(t, s) {
-    return new P(t).sub(s).length() < this.equalPointTol;
+    return new b(t).sub(s).length() < this.equalPointTol;
   }
   /**
    * Return true if two points are equal with the specified tolerance.
@@ -1164,12 +1164,12 @@ class ds {
    * @returns Return true if two poitns are equal with the specified tolerance.
    */
   equalPoint3d(t, s) {
-    return new y(t).sub(s).length() < this.equalPointTol;
+    return new g(t).sub(s).length() < this.equalPointTol;
   }
   /**
    * Return true if the value is equal to zero with the specified tolerance.
    */
-  static equalToZero(t, s = Q) {
+  static equalToZero(t, s = O) {
     return t < s && t > -s;
   }
   /**
@@ -1180,7 +1180,7 @@ class ds {
    * @param tol Input the tolerance value
    * @returns Return true if two values are equal with the sepcified tolerance
    */
-  static equal(t, s, e = Q) {
+  static equal(t, s, e = O) {
     return Math.abs(t - s) < e;
   }
   /**
@@ -1193,7 +1193,7 @@ class ds {
    * @returns Return true if the first argument are greater than the second argument with the
    * sepcified tolerance.
    */
-  static great(t, s, e = Q) {
+  static great(t, s, e = O) {
     return t - s > e;
   }
   /**
@@ -1206,12 +1206,12 @@ class ds {
    * @returns Return *true* if the first argument less than the second argument with the specified
    * tolerance value
    */
-  static less(t, s, e = Q) {
+  static less(t, s, e = O) {
     return t - s < e;
   }
 }
-const Ft = new ds();
-function Xt(u, t, s = !1) {
+const Dt = new Xt();
+function Yt(u, t, s = !1) {
   const e = u.x, n = u.y;
   let i = !1;
   const h = t.length;
@@ -1222,24 +1222,24 @@ function Xt(u, t, s = !1) {
   }
   return i;
 }
-function ms(u, t) {
+function ys(u, t) {
   if (u.length === 0 || t.length === 0)
     return !1;
-  const s = new V().setFromPoints(u), e = new V().setFromPoints(t);
+  const s = new U().setFromPoints(u), e = new U().setFromPoints(t);
   if (!s.intersectsBox(e))
     return !1;
   for (let n = 0; n < u.length; ) {
-    if (Xt(u[n], t, !0))
+    if (Yt(u[n], t, !0))
       return !0;
-    n < u.length - 1 && Ft.equalPoint2d(u[n + 1], u[n]) && ++n, ++n;
+    n < u.length - 1 && Dt.equalPoint2d(u[n + 1], u[n]) && ++n, ++n;
   }
   return !1;
 }
-const xs = {
-  isPointInPolygon: Xt,
-  isPolygonIntersect: ms
+const gs = {
+  isPointInPolygon: Yt,
+  isPolygonIntersect: ys
 };
-function ys(u, t) {
+function _s(u, t) {
   const s = [], e = t - 1, n = u;
   for (let i = 0; i <= n; i++)
     s.push(0);
@@ -1249,7 +1249,7 @@ function ys(u, t) {
     s.push(e - n + 1);
   return s;
 }
-function gs(u, t) {
+function ps(u, t) {
   const s = t.length - 1, e = u, n = [0];
   let i = 0;
   for (let r = 1; r <= s; r++) {
@@ -1267,7 +1267,7 @@ function gs(u, t) {
     h.push(s - e + 1);
   return h;
 }
-function _s(u, t) {
+function zs(u, t) {
   const s = t.length - 1, e = u, n = [0];
   let i = 0;
   for (let r = 1; r <= s; r++) {
@@ -1285,13 +1285,13 @@ function _s(u, t) {
     h.push(s - e + 1);
   return h;
 }
-function bt(u, t, s, e) {
+function St(u, t, s, e) {
   if (t === 0)
     return s >= e[u] && s < e[u + 1] ? 1 : 0;
   const n = e[u + t] - e[u], i = e[u + t + 1] - e[u + 1], h = n > 1e-10 ? (s - e[u]) / n : 0, r = i > 1e-10 ? (e[u + t + 1] - s) / i : 0;
-  return h * bt(u, t - 1, s, e) + r * bt(u + 1, t - 1, s, e);
+  return h * St(u, t - 1, s, e) + r * St(u + 1, t - 1, s, e);
 }
-function xt(u, t, s, e, n) {
+function yt(u, t, s, e, n) {
   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]];
@@ -1300,7 +1300,7 @@ function xt(u, t, s, e, n) {
   const r = [0, 0, 0];
   let a = 0;
   for (let o = 0; o <= i; o++) {
-    const c = bt(o, h, u, s), l = n[o] * c;
+    const c = St(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) {
@@ -1312,22 +1312,22 @@ function xt(u, t, s, e, n) {
   }
   return a > 1e-10 && (r[0] /= a, r[1] /= a, r[2] /= a), r;
 }
-function ps(u, t, s, e) {
+function Ms(u, t, s, e) {
   const n = u, i = t[n], h = t[t.length - n - 1];
   let r = 0;
   const a = 1e3, o = (h - i) / a;
-  let c = xt(
+  let c = yt(
     i,
     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];
-    r += Math.sqrt(f * f + w * w + A * A), c = _;
+  for (let y = 1; y <= a; y++) {
+    const _ = i + y * o, p = yt(_, u, t, s, e), P = p[0] - c[0], w = p[1] - c[1], f = p[2] - c[2];
+    r += Math.sqrt(P * P + w * w + f * f), c = p;
   }
-  const l = xt(
+  const l = yt(
     h,
     u,
     t,
@@ -1336,10 +1336,10 @@ function ps(u, 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;
 }
-function zs(u) {
+function Is(u) {
   return u.map((t) => [...t]);
 }
-class pt {
+class zt {
   /**
    * Create one instance of this class
    * @param x Input x coordinate
@@ -1362,24 +1362,24 @@ 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 d = i[h + 0], m = i[h + 1], x = i[h + 2], y = 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] = d, t[s + 1] = m, t[s + 2] = x, t[s + 3] = y;
       return;
     }
-    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 (l !== y || a !== d || o !== m || c !== x) {
+      let _ = 1 - r;
+      const p = a * d + o * m + c * x + l * y, P = p >= 0 ? 1 : -1, w = 1 - p * p;
       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 M = Math.sqrt(w), B = Math.atan2(M, p * P);
+        _ = Math.sin(_ * B) / M, r = Math.sin(r * B) / M;
       }
-      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 f = r * P;
+      if (a = a * _ + d * f, o = o * _ + m * f, c = c * _ + x * f, l = l * _ + y * f, _ === 1 - r) {
         const M = 1 / Math.sqrt(a * a + o * o + c * c + l * l);
         a *= M, o *= M, c *= M, l *= M;
       }
@@ -1452,7 +1452,7 @@ class pt {
    * @returns Return cloned instance
    */
   clone() {
-    return new pt(this._x, this._y, this._z, this._w);
+    return new zt(this._x, this._y, this._z, this._w);
   }
   /**
    * Copy the x, y, z and w properties of q into this quaternion.
@@ -1545,7 +1545,7 @@ class pt {
    * @returns Return the angle between this quaternion and quaternion q in radians.
    */
   angleTo(t) {
-    return 2 * Math.acos(Math.abs(j(this.dot(t), -1, 1)));
+    return 2 * Math.acos(Math.abs(X(this.dot(t), -1, 1)));
   }
   /**
    * Rotate this quaternion by a given angular step to the defined quaternion q. The method ensures
@@ -1730,7 +1730,7 @@ class pt {
     yield this._x, yield this._y, yield this._z, yield this._w;
   }
 }
-const N = class N {
+const k = class k {
   /**
    * Vector may be constructed by three points, or by three float numbers,
    * or by array of three numbers
@@ -1752,7 +1752,7 @@ const N = class N {
         this.x = t, this.y = s, this.z = e;
         return;
       }
-      throw T.ILLEGAL_PARAMETERS;
+      throw L.ILLEGAL_PARAMETERS;
     }
   }
   /**
@@ -1847,7 +1847,7 @@ const N = class N {
    * @returns Return a new vector3 with the same x, y and z values as this one.
    */
   clone() {
-    return new N(this.x, this.y, this.z);
+    return new k(this.x, this.y, this.z);
   }
   /**
    * Copy the values of the passed vector3's x, y and z properties to this vector3.
@@ -1947,7 +1947,7 @@ const N = class N {
    * @returns Return this vector
    */
   applyEuler(t) {
-    return this.applyQuaternion(Ct.setFromEuler(t));
+    return this.applyQuaternion(Bt.setFromEuler(t));
   }
   /**
    * Apply a rotation specified by an axis and an angle to this vector.
@@ -1956,7 +1956,7 @@ const N = class N {
    * @returns Return this vector
    */
   applyAxisAngle(t, s) {
-    return this.applyQuaternion(Ct.setFromAxisAngle(t, s));
+    return this.applyQuaternion(Bt.setFromAxisAngle(t, s));
   }
   /**
    * Multipliy this vector by m
@@ -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.
@@ -2372,9 +2372,9 @@ const N = class N {
     yield this.x, yield this.y, yield this.z;
   }
 };
-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 $ {
+k.X_AXIS = Object.freeze(new k(1, 0, 0)), k.NEGATIVE_X_AXIS = Object.freeze(new k(-1, 0, 0)), k.Y_AXIS = Object.freeze(new k(0, 1, 0)), k.NEGATIVE_Y_AXIS = Object.freeze(new k(0, -1, 0)), k.Z_AXIS = Object.freeze(new k(0, 0, 1)), k.NEGATIVE_Z_AXIS = Object.freeze(new k(0, 0, -1));
+let g = k;
+const ft = /* @__PURE__ */ new g(), Bt = /* @__PURE__ */ new zt(), W = class W {
   /**
    * 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, d, m, x, y, _) {
+    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 && y != null && _ != null && this.set(
       t,
       s,
       e,
@@ -2412,8 +2412,8 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
       d,
       m,
       x,
-      g,
-      p
+      y,
+      _
     );
   }
   /**
@@ -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) {
-    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;
+  set(t, s, e, n, i, h, r, a, o, c, l, d, m, x, y, _) {
+    const p = this.elements;
+    return p[0] = t, p[4] = s, p[8] = e, p[12] = n, p[1] = i, p[5] = h, p[9] = r, p[13] = a, p[2] = o, p[6] = c, p[10] = l, p[14] = d, p[3] = m, p[7] = x, p[11] = y, p[15] = _, this;
   }
   /**
    * Reset this matrix to the identity matrix.
@@ -2449,7 +2449,7 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
     return this.set(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1), this;
   }
   clone() {
-    return new $().fromArray(this.elements);
+    return new W().fromArray(this.elements);
   }
   /**
    * Copy the elements of matrix m into this matrix.
@@ -2501,11 +2501,11 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @returns Return this matrix
    */
   setFromExtrusionDirection(t) {
-    if (Ft.equalPoint3d(t, y.Z_AXIS))
+    if (Dt.equalPoint3d(t, g.Z_AXIS))
       this.identity();
     else {
-      const s = new y(1, 0, 0);
-      Math.abs(t.x) < 1 / 64 && Math.abs(t.y) < 1 / 64 ? s.crossVectors(y.Y_AXIS, t).normalize() : s.crossVectors(y.Z_AXIS, t).normalize();
+      const s = new g(1, 0, 0);
+      Math.abs(t.x) < 1 / 64 && Math.abs(t.y) < 1 / 64 ? s.crossVectors(g.Y_AXIS, t).normalize() : s.crossVectors(g.Z_AXIS, t).normalize();
       const e = t.clone().cross(s).normalize();
       this.set(
         s.x,
@@ -2571,7 +2571,7 @@ 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(), h = 1 / O.setFromMatrixColumn(t, 2).length();
+    const s = this.elements, e = t.elements, n = 1 / H.setFromMatrixColumn(t, 0).length(), i = 1 / H.setFromMatrixColumn(t, 1).length(), h = 1 / H.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) {
@@ -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(As, t, fs);
   }
   /**
    * 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 N.subVectors(t, s), N.lengthSq() === 0 && (N.z = 1), N.normalize(), F.crossVectors(e, N), F.lengthSq() === 0 && (Math.abs(e.z) === 1 ? N.x += 1e-4 : N.z += 1e-4, N.normalize(), F.crossVectors(e, N)), F.normalize(), dt.crossVectors(N, F), n[0] = F.x, n[4] = dt.x, n[8] = N.x, n[1] = F.y, n[5] = dt.y, n[9] = N.y, n[2] = F.z, n[6] = dt.z, n[10] = N.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], d = e[9], m = e[13], x = e[2], y = e[6], _ = e[10], p = e[14], P = e[3], w = e[7], f = e[11], M = e[15], B = n[0], z = n[4], E = n[8], Z = n[12], G = n[1], D = n[5], Q = n[9], nt = n[13], it = n[2], rt = n[6], ht = n[10], ot = n[14], at = n[3], ct = n[7], lt = n[11], ut = n[15];
+    return i[0] = h * B + r * G + a * it + o * at, i[4] = h * z + r * D + a * rt + o * ct, i[8] = h * E + r * Q + a * ht + o * lt, i[12] = h * Z + r * nt + a * ot + o * ut, i[1] = c * B + l * G + d * it + m * at, i[5] = c * z + l * D + d * rt + m * ct, i[9] = c * E + l * Q + d * ht + m * lt, i[13] = c * Z + l * nt + d * ot + m * ut, i[2] = x * B + y * G + _ * it + p * at, i[6] = x * z + y * D + _ * rt + p * ct, i[10] = x * E + y * Q + _ * ht + p * lt, i[14] = x * Z + y * nt + _ * ot + p * ut, i[3] = P * B + w * G + f * it + M * at, i[7] = P * z + w * D + f * rt + M * ct, i[11] = P * E + w * Q + f * ht + M * lt, i[15] = P * Z + w * nt + f * ot + M * ut, 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], d = t[10], m = t[14], x = t[3], y = t[7], _ = t[11], p = t[15];
+    return x * (+i * a * l - n * o * l - i * r * d + e * o * d + n * r * m - e * a * m) + y * (+s * a * m - s * o * d + i * h * d - n * h * m + n * o * c - i * a * c) + _ * (+s * o * l - s * r * m - i * h * l + e * h * m + i * r * c - e * o * c) + p * (-n * r * c - s * a * l + s * r * d + n * h * l - e * h * d + e * a * c);
   }
   /**
    * Transposes this matrix.
@@ -2761,7 +2761,7 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    */
   setPosition(t, s, e) {
     const n = this.elements;
-    return t instanceof y ? (n[12] = t.x, n[13] = t.y, n[14] = t.z) : (n[12] = t, n[13] = s, n[14] = e), this;
+    return t instanceof g ? (n[12] = t.x, n[13] = t.y, n[14] = t.z) : (n[12] = t, n[13] = s, n[14] = e), this;
   }
   /**
    * Invert this matrix, using the analytic method. You can not invert with a determinant of zero.
@@ -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;
+    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], y = t[13], _ = t[14], p = t[15], P = l * _ * o - y * d * o + y * a * m - r * _ * m - l * a * p + r * d * p, w = x * d * o - c * _ * o - x * a * m + h * _ * m + c * a * p - h * d * p, f = c * y * o - x * l * o + x * r * m - h * y * m - c * r * p + h * l * p, M = x * l * a - c * y * a - x * r * d + h * y * d + c * r * _ - h * l * _, B = s * P + e * w + n * f + i * M;
     if (B === 0)
       return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
     const z = 1 / B;
-    return t[0] = 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;
+    return t[0] = P * z, t[1] = (y * d * i - l * _ * i - y * n * m + e * _ * m + l * n * p - e * d * p) * z, t[2] = (r * _ * i - y * a * i + y * n * o - e * _ * o - r * n * p + e * a * p) * z, t[3] = (l * a * i - r * d * i - l * n * o + e * d * o + r * n * m - e * a * m) * z, t[4] = w * z, t[5] = (c * _ * i - x * d * i + x * n * m - s * _ * m - c * n * p + s * d * p) * z, t[6] = (x * a * i - h * _ * i - x * n * o + s * _ * o + h * n * p - s * a * p) * z, t[7] = (h * d * i - c * a * i + c * n * o - s * d * o - h * n * m + s * a * m) * z, t[8] = f * z, t[9] = (x * l * i - c * y * i - x * e * m + s * y * m + c * e * p - s * l * p) * z, t[10] = (h * y * i - x * r * i + x * e * o - s * y * o - h * e * p + s * r * p) * z, t[11] = (c * r * i - h * l * i - c * e * o + s * l * o + h * e * m - s * r * m) * z, t[12] = M * z, t[13] = (c * y * n - x * l * n + x * e * d - s * y * d - c * e * _ + s * l * _) * z, t[14] = (x * r * n - h * y * n - x * e * a + s * y * a + h * e * _ - s * r * _) * z, t[15] = (h * l * n - c * r * n + c * e * a - s * l * a - h * e * d + s * r * d) * z, this;
   }
   /**
    * Multiply the columns of this matrix by vector v.
@@ -2800,7 +2800,7 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
    * @returns Return this matrix
    */
   makeTranslation(t, s, e) {
-    return t instanceof y ? this.set(1, 0, 0, t.x, 0, 1, 0, t.y, 0, 0, 1, t.z, 0, 0, 0, 1) : this.set(1, 0, 0, t, 0, 1, 0, s, 0, 0, 1, e, 0, 0, 0, 1), this;
+    return t instanceof g ? this.set(1, 0, 0, t.x, 0, 1, 0, t.y, 0, 0, 1, t.z, 0, 0, 0, 1) : this.set(1, 0, 0, t, 0, 1, 0, s, 0, 0, 1, e, 0, 0, 0, 1), this;
   }
   /**
    * Set this matrix as a rotational transformation around the X axis by theta (θ) radians.
@@ -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, d = i * o, m = i * c, x = i * l, y = h * c, _ = h * l, p = r * l, P = a * o, w = a * c, f = a * l, M = e.x, B = e.y, z = e.z;
+    return n[0] = (1 - (y + p)) * M, n[1] = (m + f) * M, n[2] = (x - w) * M, n[3] = 0, n[4] = (m - f) * B, n[5] = (1 - (d + p)) * B, n[6] = (_ + P) * B, n[7] = 0, n[8] = (x + w) * z, n[9] = (_ - P) * z, n[10] = (1 - (d + y)) * 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.
@@ -2903,11 +2903,11 @@ 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 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);
+    let i = H.set(n[0], n[1], n[2]).length();
+    const h = H.set(n[4], n[5], n[6]).length(), r = H.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], T.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 T.elements[0] *= o, T.elements[1] *= o, T.elements[2] *= o, T.elements[4] *= c, T.elements[5] *= c, T.elements[6] *= c, T.elements[8] *= l, T.elements[9] *= l, T.elements[10] *= l, s.setFromRotationMatrix(T), e.x = i, e.y = h, e.z = r, this;
   }
   // makePerspective(
   //   left,
@@ -3033,10 +3033,10 @@ const wt = /* @__PURE__ */ new y(), Ct = /* @__PURE__ */ new pt(), $ = class $ {
     return t[s] = e[0], t[s + 1] = e[1], t[s + 2] = e[2], t[s + 3] = e[3], t[s + 4] = e[4], t[s + 5] = e[5], t[s + 6] = e[6], t[s + 7] = e[7], t[s + 8] = e[8], t[s + 9] = e[9], t[s + 10] = e[10], t[s + 11] = e[11], t[s + 12] = e[12], t[s + 13] = e[13], t[s + 14] = e[14], t[s + 15] = e[15], t;
   }
 };
-$.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();
-class Y {
+W.IDENTITY = Object.freeze(new W());
+let tt = W;
+const H = /* @__PURE__ */ new g(), T = /* @__PURE__ */ new tt(), As = /* @__PURE__ */ new g(0, 0, 0), fs = /* @__PURE__ */ new g(1, 1, 1), F = /* @__PURE__ */ new g(), dt = /* @__PURE__ */ new g(), N = /* @__PURE__ */ new g();
+class j {
   /**
    * Create a 3d box bounded by min and max.
    * @param min (optional) Input the lower (x, y, z) boundary of the box.
@@ -3045,7 +3045,7 @@ class Y {
    * Set it to ( - Infinity, - Infinity, - Infinity ) if undefined or null provided.
    */
   constructor(t = void 0, s = void 0) {
-    this.min = t == null ? new y(1 / 0, 1 / 0, 1 / 0) : new y(t.x, t.y, t.z), this.max = s == null ? new y(-1 / 0, -1 / 0, -1 / 0) : new y(s.x, s.y, s.z);
+    this.min = t == null ? new g(1 / 0, 1 / 0, 1 / 0) : new g(t.x, t.y, t.z), this.max = s == null ? new g(-1 / 0, -1 / 0, -1 / 0) : new g(s.x, s.y, s.z);
   }
   /**
    * Set the lower and upper (x, y, z) boundaries of this box.
@@ -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;
   }
   /**
@@ -3094,7 +3094,7 @@ class Y {
    * @returns Return a new box with the same min and max as this one.
    */
   clone() {
-    return new Y().copy(this);
+    return new j().copy(this);
   }
   /**
    * Copy the min and max from box to this box.
@@ -3139,13 +3139,13 @@ class Y {
    * Center point of this box
    */
   get center() {
-    return this.isEmpty() ? new y(0, 0, 0) : new y(0, 0, 0).addVectors(this.min, this.max).multiplyScalar(0.5);
+    return this.isEmpty() ? new g(0, 0, 0) : new g(0, 0, 0).addVectors(this.min, this.max).multiplyScalar(0.5);
   }
   /**
    * Return the width, height and depth of this box.
    */
   get size() {
-    return this.isEmpty() ? new y(0, 0, 0) : new y(0, 0, 0).subVectors(this.max, this.min);
+    return this.isEmpty() ? new g(0, 0, 0) : new g(0, 0, 0).subVectors(this.max, this.min);
   }
   /**
    * Expand the boundaries of this box to include point.
@@ -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
@@ -3264,7 +3264,7 @@ class Y {
    * @returns Return this box
    */
   applyMatrix4(t) {
-    return this.isEmpty() ? this : (U[0].set(this.min.x, this.min.y, this.min.z).applyMatrix3d(t), U[1].set(this.min.x, this.min.y, this.max.z).applyMatrix3d(t), U[2].set(this.min.x, this.max.y, this.min.z).applyMatrix3d(t), U[3].set(this.min.x, this.max.y, this.max.z).applyMatrix3d(t), U[4].set(this.max.x, this.min.y, this.min.z).applyMatrix3d(t), U[5].set(this.max.x, this.min.y, this.max.z).applyMatrix3d(t), U[6].set(this.max.x, this.max.y, this.min.z).applyMatrix3d(t), U[7].set(this.max.x, this.max.y, this.max.z).applyMatrix3d(t), this.setFromPoints(U), this);
+    return this.isEmpty() ? this : (V[0].set(this.min.x, this.min.y, this.min.z).applyMatrix3d(t), V[1].set(this.min.x, this.min.y, this.max.z).applyMatrix3d(t), V[2].set(this.min.x, this.max.y, this.min.z).applyMatrix3d(t), V[3].set(this.min.x, this.max.y, this.max.z).applyMatrix3d(t), V[4].set(this.max.x, this.min.y, this.min.z).applyMatrix3d(t), V[5].set(this.max.x, this.min.y, this.max.z).applyMatrix3d(t), V[6].set(this.max.x, this.max.y, this.min.z).applyMatrix3d(t), V[7].set(this.max.x, this.max.y, this.max.z).applyMatrix3d(t), this.setFromPoints(V), this);
   }
   /**
    * Add offset to both the upper and lower bounds of this box, effectively moving this box offset units
@@ -3284,17 +3284,17 @@ class Y {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const U = [
-  /* @__PURE__ */ new y(),
-  /* @__PURE__ */ new y(),
-  /* @__PURE__ */ new y(),
-  /* @__PURE__ */ new y(),
-  /* @__PURE__ */ new y(),
-  /* @__PURE__ */ new y(),
-  /* @__PURE__ */ new y(),
-  /* @__PURE__ */ new y()
-], ft = /* @__PURE__ */ new y(), Bt = /* @__PURE__ */ new P();
-class V {
+const V = [
+  /* @__PURE__ */ new g(),
+  /* @__PURE__ */ new g(),
+  /* @__PURE__ */ new g(),
+  /* @__PURE__ */ new g(),
+  /* @__PURE__ */ new g(),
+  /* @__PURE__ */ new g(),
+  /* @__PURE__ */ new g(),
+  /* @__PURE__ */ new g()
+], wt = /* @__PURE__ */ new g(), It = /* @__PURE__ */ new b();
+class U {
   /**
    * Create a 2d box bounded by min and max.
    * @param min (optional) Input 2d vector representing the lower (x, y) boundary of the box.
@@ -3303,7 +3303,7 @@ class V {
    * Set it to ( - Infinity, - Infinity ) if undefined or null provided.
    */
   constructor(t = void 0, s = void 0) {
-    this.min = t == null ? new P(1 / 0, 1 / 0) : new P(t.x, t.y), this.max = s == null ? new P(-1 / 0, -1 / 0) : new P(s.x, s.y);
+    this.min = t == null ? new b(1 / 0, 1 / 0) : new b(t.x, t.y), this.max = s == null ? new b(-1 / 0, -1 / 0) : new b(s.x, s.y);
   }
   /**
    * Set the lower and upper (x, y) boundaries of this box.
@@ -3333,7 +3333,7 @@ class V {
    * @returns Return this box
    */
   setFromCenterAndSize(t, s) {
-    const e = Bt.copy(s).multiplyScalar(0.5);
+    const e = It.copy(s).multiplyScalar(0.5);
     return this.min.copy(t).sub(e), this.max.copy(t).add(e), this;
   }
   /**
@@ -3341,7 +3341,7 @@ class V {
    * @returns Return a new 2d box with the same min and max as this one.
    */
   clone() {
-    return new V().copy(this);
+    return new U().copy(this);
   }
   /**
    * Copy the min and max from box to this box.
@@ -3386,13 +3386,13 @@ class V {
    * Center point of this box
    */
   get center() {
-    return this.isEmpty() ? new P(0, 0) : new P(0, 0).addVectors(this.min, this.max).multiplyScalar(0.5);
+    return this.isEmpty() ? new b(0, 0) : new b(0, 0).addVectors(this.min, this.max).multiplyScalar(0.5);
   }
   /**
    * Return the width, height and depth of this box.
    */
   get size() {
-    return this.isEmpty() ? new P(0, 0) : new P(0, 0).subVectors(this.max, this.min);
+    return this.isEmpty() ? new b(0, 0) : new b(0, 0).subVectors(this.max, this.min);
   }
   /**
    * Expand the boundaries of this box to include point.
@@ -3473,7 +3473,7 @@ class V {
    * @returns Return the distance from any edge of this box to the specified point.
    */
   distanceToPoint(t) {
-    return this.clampPoint(t, Bt).distanceTo(t);
+    return this.clampPoint(t, It).distanceTo(t);
   }
   /**
    * Return the intersection of this and box, setting the upper bound of this box to the lesser of the
@@ -3511,15 +3511,15 @@ 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 Et = /* @__PURE__ */ new g(), ws = /* @__PURE__ */ new g(), Ps = /* @__PURE__ */ new v();
+class Mt {
   /**
    * Create one plane
    * @param normal (optional) Input a unit length Vector3 defining the normal of the plane.
    * Default is (1, 0, 0).
    * @param constant (optional) Input the signed distance from the origin to the plane. Default is 0.
    */
-  constructor(t = new y(1, 0, 0), s = 0) {
+  constructor(t = new g(1, 0, 0), s = 0) {
     this.normal = t, this.constant = s;
   }
   /**
@@ -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 = Et.subVectors(e, s).cross(ws.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 || Ps.getNormalMatrix(t), n = this.coplanarPoint(Et).applyMatrix3d(t), i = this.normal.applyMatrix3(e).normalize();
     return this.constant = -n.dot(i), this;
   }
   /**
@@ -3687,10 +3687,10 @@ class zt {
    * @returns Return the cloned plane
    */
   clone() {
-    return new zt().copy(this);
+    return new Mt().copy(this);
   }
 }
-class b extends P {
+class S extends b {
   /**
    * Convert one point array to one number array
    * @param array Input one point array
@@ -3703,7 +3703,7 @@ class b extends P {
     }), s;
   }
 }
-class S extends y {
+class A extends g {
   /**
    * Convert one point array to one number array
    * @param array Input one point array
@@ -3717,7 +3717,7 @@ class S extends y {
     }), n;
   }
 }
-const Et = /* @__PURE__ */ new tt(), kt = /* @__PURE__ */ new pt(), J = class J {
+const Rt = /* @__PURE__ */ new tt(), kt = /* @__PURE__ */ new zt(), J = class J {
   /**
    * Create one instance of this class
    * @param x (optional) the angle of the x axis in radians. Default is 0.
@@ -3812,22 +3812,22 @@ const Et = /* @__PURE__ */ new tt(), kt = /* @__PURE__ */ new pt(), J = class J
     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(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(X(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(r, m), this._z = Math.atan2(a, o)) : (this._y = Math.atan2(-l, i), this._z = 0);
+        this._x = Math.asin(-X(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(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(X(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(d, m), this._z = Math.atan2(a, i)) : (this._x = 0, this._z = Math.atan2(-h, o));
+        this._y = Math.asin(-X(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(r, m));
+        this._z = Math.asin(X(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(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(-X(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(
@@ -3846,7 +3846,7 @@ const Et = /* @__PURE__ */ new tt(), kt = /* @__PURE__ */ new pt(), J = class J
    * @returns Return this euler
    */
   setFromQuaternion(t, s, e = !0) {
-    return Et.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Et, s, e);
+    return Rt.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Rt, s, e);
   }
   /**
    * Set the x, y and z, and optionally update the order.
@@ -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 Zt {
   constructor() {
     this._boundingBoxNeedsUpdate = !1;
   }
@@ -3923,7 +3923,7 @@ class Dt {
     return this._boundingBoxNeedsUpdate;
   }
 }
-class Yt extends Dt {
+class Gt extends Zt {
   /**
    * 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 Es extends Gt {
   /**
    * Create one 2d area defined by one outter loop and multiple inner loops
    */
@@ -3972,7 +3972,7 @@ class Cs extends Yt {
    */
   calculateBoundingBox() {
     const t = this.outter;
-    return t ? t.box : new V();
+    return t ? t.box : new U();
   }
   /**
    * @inheritdoc
@@ -4007,7 +4007,7 @@ class Cs extends Yt {
       let d = a + 1;
       for (; d < i; d++) {
         const m = e[d], x = t[m];
-        if (s[m].containsBox(l) && xs.isPointInPolygon(
+        if (s[m].containsBox(l) && gs.isPointInPolygon(
           c[C.randInt(0, c.length - 1)],
           x
         )) {
@@ -4027,7 +4027,7 @@ class Cs extends Yt {
   calculateBoundaryBoxes(t) {
     const s = [];
     return t.forEach((e) => {
-      s.push(new V().setFromPoints(e));
+      s.push(new U().setFromPoints(e));
     }), s;
   }
   /**
@@ -4050,7 +4050,7 @@ class Cs extends Yt {
     }), e;
   }
 }
-class st extends Yt {
+class st extends Gt {
   constructor() {
     super(), this.arcLengthDivisions = 100;
   }
@@ -4169,7 +4169,7 @@ class st extends Yt {
   getTangent(t) {
     let e = t - 1e-4, n = t + 1e-4;
     e < 0 && (e = 0), n > 1 && (n = 1);
-    const i = this.getPoint(e), h = this.getPoint(n), r = new b();
+    const i = this.getPoint(e), h = this.getPoint(n), r = new S();
     return r.copy(h).sub(i).normalize(), r;
   }
   /**
@@ -4184,7 +4184,7 @@ class st extends Yt {
     return this.getTangent(s);
   }
 }
-class gt extends st {
+class _t extends st {
   constructor(t, s, e, n, i) {
     super();
     const h = +(t !== void 0) + +(s !== void 0) + +(e !== void 0) + +(n !== void 0) + +(i !== void 0);
@@ -4200,9 +4200,9 @@ class gt extends st {
       );
     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;
+      this.center = new S(r.x, r.y), this.radius = s, this.startAngle = e, this.endAngle = n, this.clockwise = i;
     } else
-      throw T.ILLEGAL_PARAMETERS;
+      throw L.ILLEGAL_PARAMETERS;
   }
   /**
    * Create arc by three points
@@ -4215,12 +4215,12 @@ class gt extends st {
       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;
-      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(
-      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;
+      const D = (G - E) / (z - Z), Q = z * D + E;
+      return { x: D, y: Q };
+    }, x = r.y - l * r.x, y = a.y - d * a.x, _ = m(l, x, d, y), p = Math.sqrt(
+      Math.pow(t.x - _.x, 2) + Math.pow(t.y - _.y, 2)
+    ), P = (z, E) => Math.atan2(z.y - E.y, z.x - E.x), w = P(t, _), f = P(s, _), M = P(e, _), B = M > w && M < f || w > M && w < f || f > M && f < w;
+    this.center = _, this.radius = p, this.startAngle = w, this.endAngle = M, this.clockwise = !B;
   }
   /**
    * Create circular arc by two points and one bugle factor
@@ -4235,17 +4235,17 @@ class gt extends st {
    */
   createByStartEndPointsAndBulge(t, s, e) {
     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();
+    e < 0 ? (n = Math.atan(-e) * 4, i = new b(t), h = new b(s)) : (n = Math.atan(e) * 4, i = new b(s), h = new b(t));
+    const r = new b().subVectors(h, i), a = r.length(), o = new b().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 m = new P(
+      const m = new b(
         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));
     } else {
-      const m = new P(
+      const m = new b(
         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)
       );
@@ -4260,7 +4260,7 @@ class gt extends st {
     return this._center;
   }
   set center(t) {
-    this._center = new b(t.x, t.y), this._boundingBoxNeedsUpdate = !0;
+    this._center = new S(t.x, t.y), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Radius of circular arc
@@ -4344,9 +4344,9 @@ class gt extends st {
         this.clockwise
       ) && t.push(this.getPointAtAngle(i));
     const e = t.map((i) => i.x), n = t.map((i) => i.y);
-    return new V(
-      new b(Math.min(...e), Math.min(...n)),
-      new b(Math.max(...e), Math.max(...n))
+    return new U(
+      new S(Math.min(...e), Math.min(...n)),
+      new S(Math.max(...e), Math.max(...n))
     );
   }
   /**
@@ -4365,7 +4365,7 @@ class gt extends st {
    * @inheritdoc
    */
   clone() {
-    return new gt(
+    return new _t(
       this.center.clone(),
       this.radius,
       this.startAngle,
@@ -4380,7 +4380,7 @@ class gt extends st {
    */
   getPointAtAngle(t) {
     const s = this.center.x + this.radius * Math.cos(t), e = this.center.y + this.radius * Math.sin(t);
-    return new b(s, e);
+    return new S(s, e);
   }
   /**
    * Divide this arc into the specified nubmer of points and return those points as an array of points.
@@ -4393,17 +4393,17 @@ class gt extends st {
     if (this.closed && (e = I, n = 0), this.clockwise)
       for (let i = 0; i <= t; i++) {
         const h = n - e * (i / t), r = this.getPointAtAngle(h);
-        s.push(new b(r.x, r.y));
+        s.push(new S(r.x, r.y));
       }
     else
       for (let i = 0; i <= t; i++) {
         const h = n + e * (i / t), r = this.getPointAtAngle(h);
-        s.push(new b(r.x, r.y));
+        s.push(new S(r.x, r.y));
       }
     return s;
   }
 }
-class Ps extends Dt {
+class bs extends Zt {
   /**
    * 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 et extends bs {
 }
-class _t extends Mt {
+class pt extends et {
   /**
    * 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 A(t), this._end = new A(s);
   }
   /**
    * The line's startpoint in WCS coordinates
@@ -4452,13 +4452,13 @@ class _t extends Mt {
    * Normalized direction vector of this line
    */
   get direction() {
-    return new y().subVectors(this.endPoint, this.startPoint).normalize();
+    return new g().subVectors(this.endPoint, this.startPoint).normalize();
   }
   /**
    * The middle point of this line.
    */
   get midPoint() {
-    return new S(
+    return new A(
       (this._start.x + this._end.x) / 2,
       (this._start.y + this._end.y) / 2,
       (this._start.z + this._end.z) / 2
@@ -4497,11 +4497,11 @@ class _t extends Mt {
    */
   atLength(t, s = !1) {
     if (s) {
-      const e = this.delta(X).normalize();
-      return new S(this._start).addScaledVector(e, t);
+      const e = this.delta(Y).normalize();
+      return new A(this._start).addScaledVector(e, t);
     } else {
-      const e = this.delta(X).normalize();
-      return new S(this._end).addScaledVector(e, t);
+      const e = this.delta(Y).normalize();
+      return new A(this._end).addScaledVector(e, t);
     }
   }
   /**
@@ -4513,14 +4513,14 @@ 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(
+      const e = Y.subVectors(this._start, this._end).normalize();
+      this._start = new A(this._start).addScaledVector(
         e,
         t
       );
     } else {
-      const e = this.delta(X).normalize();
-      this._end = new S(this._end).addScaledVector(e, t);
+      const e = this.delta(Y).normalize();
+      this._end = new A(this._end).addScaledVector(e, t);
     }
     return this._boundingBoxNeedsUpdate = !0, this;
   }
@@ -4532,9 +4532,9 @@ 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);
-    const e = dt.dot(dt);
-    let i = dt.dot(Lt) / e;
+    Tt.subVectors(t, this._start), mt.subVectors(this.endPoint, this.startPoint);
+    const e = mt.dot(mt);
+    let i = mt.dot(Tt) / e;
     return s && (i = C.clamp(i, 0, 1)), i;
   }
   /**
@@ -4577,8 +4577,8 @@ class _t extends Mt {
    * Project a 3d point onto this line
    */
   project(t) {
-    const s = this.direction, n = X.subVectors(t, this.startPoint).dot(s);
-    return new S().copy(s).multiplyScalar(n).add(this.startPoint);
+    const s = this.direction, n = Y.subVectors(t, this.startPoint).dot(s);
+    return new A().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,23 +4588,23 @@ 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), h = X.copy(s).multiplyScalar(i);
-    return new S().addVectors(e, h);
+    const s = this.direction, e = this.startPoint, i = Y.subVectors(t, e).dot(s), h = Y.copy(s).multiplyScalar(i);
+    return new A().addVectors(e, h);
   }
   /**
    * @inheritdoc
    */
   calculateBoundingBox() {
-    const t = new S(
+    const t = new A(
       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 A(
       Math.max(this._start.x, this._end.x),
       Math.max(this._start.y, this._end.y),
       Math.max(this._start.z, this._end.z)
     );
-    return new Y(t, s);
+    return new j(t, s);
   }
   /**
    * @inheritdoc
@@ -4628,11 +4628,11 @@ class _t extends Mt {
    * @inheritdoc
    */
   clone() {
-    return new _t(this._start.clone(), this._end.clone());
+    return new pt(this._start.clone(), this._end.clone());
   }
 }
-const X = /* @__PURE__ */ new y(), Lt = /* @__PURE__ */ new y(), dt = /* @__PURE__ */ new y();
-class yt extends Mt {
+const Y = /* @__PURE__ */ new g(), Tt = /* @__PURE__ */ new g(), mt = /* @__PURE__ */ new g();
+class gt extends et {
   /**
    * Compute center point of the arc given three points
    * @param startPoint Input start point of the arc
@@ -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), h = new y().subVectors(s, t), r = new y().subVectors(e, t), a = new y().crossVectors(h, r).normalize();
+    const n = new g().addVectors(t, s).multiplyScalar(0.5), i = new g().addVectors(t, e).multiplyScalar(0.5), h = new g().subVectors(s, t), r = new g().subVectors(e, t), a = new g().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 g().crossVectors(h, a).normalize(), c = new g().crossVectors(r, a).normalize(), l = o.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), d = c.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), m = new pt(n, n.clone().add(l)), x = new pt(i, i.clone().add(d)), y = new g();
+    return m.closestPointToPoint(x.startPoint, !0, y) ? y : (console.error("Cannot find a valid center for the arc."), null);
   }
   /**
    * Create arc by three points
@@ -4654,19 +4654,19 @@ class yt extends Mt {
    * @param pointOnArc Input one point between the start point and the end point
    */
   static createByThreePoints(t, s, e) {
-    const n = yt.computeCenterPoint(
+    const n = gt.computeCenterPoint(
       t,
       s,
       e
     );
     if (n) {
-      const i = n.distanceTo(t), h = new y().subVectors(t, n), r = new y().subVectors(s, n), a = Math.atan2(h.y, h.x), o = Math.atan2(r.y, r.x);
-      return new yt(
+      const i = n.distanceTo(t), h = new g().subVectors(t, n), r = new g().subVectors(s, n), a = Math.atan2(h.y, h.x), o = Math.atan2(r.y, r.x);
+      return new gt(
         n,
         i,
         a,
         o,
-        y.Z_AXIS
+        g.Z_AXIS
       );
     }
   }
@@ -4679,7 +4679,7 @@ 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, h = y.X_AXIS) {
+  constructor(t, s, e, n, i, h = g.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);
   }
   /**
@@ -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 A(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Radius of circular arc
@@ -4698,7 +4698,7 @@ class yt extends Mt {
     return this._radius;
   }
   set radius(t) {
-    if (t < 0) throw T.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._radius = t, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -4744,7 +4744,7 @@ class yt extends Mt {
     return this._normal;
   }
   set normal(t) {
-    this._normal = new y(t.x, t.y, t.z), this._normal.normalize(), this._boundingBoxNeedsUpdate = !0;
+    this._normal = new g(t.x, t.y, t.z), this._normal.normalize(), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * The unit reference vector of circular arc
@@ -4753,7 +4753,7 @@ class yt extends Mt {
     return this._refVec;
   }
   set refVec(t) {
-    this._refVec = new y(t.x, t.y, t.z), this._refVec.normalize(), this._boundingBoxNeedsUpdate = !0;
+    this._refVec = new g(t.x, t.y, t.z), this._refVec.normalize(), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * The start point of circular arc
@@ -4785,7 +4785,7 @@ class yt extends Mt {
       const o = this.getPointAtAngle(a);
       o.x < s && (s = o.x), o.y < e && (e = o.y), o.z < n && (n = o.z), o.x > i && (i = o.x), o.y > h && (h = o.y), o.z > r && (r = o.z);
     }
-    return new Y(
+    return new j(
       { x: s, y: e, z: n },
       { x: i, y: h, z: r }
     );
@@ -4829,7 +4829,7 @@ class yt extends Mt {
    * @inheritdoc
    */
   clone() {
-    return new yt(
+    return new gt(
       this.center.clone(),
       this.radius,
       this.startAngle,
@@ -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 A(
       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))
@@ -4869,12 +4869,12 @@ class yt extends Mt {
    * Return the plane in which the circular arc lies.
    */
   get plane() {
-    const t = new y(this.center).distanceTo(jt);
-    return new zt(this.normal, t);
+    const t = new g(this.center).distanceTo(Ft);
+    return new Mt(this.normal, t);
   }
 }
-const Pt = /* @__PURE__ */ new y();
-class Zt extends st {
+const Pt = /* @__PURE__ */ new g();
+class Qt 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 A(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Major axis radius of the ellipse
@@ -4905,7 +4905,7 @@ class Zt extends st {
     return this._majorAxisRadius;
   }
   set majorAxisRadius(t) {
-    if (t < 0) throw T.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._majorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -4915,7 +4915,7 @@ class Zt extends st {
     return this._minorAxisRadius;
   }
   set minorAxisRadius(t) {
-    if (t < 0) throw T.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._minorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -4978,7 +4978,7 @@ class Zt extends st {
       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 });
+    return new U({ x: s, y: e }, { x: n, y: i });
   }
   /**
    * Return true if its start point is identical to its end point. Otherwise, return false.
@@ -5004,7 +5004,7 @@ class Zt extends st {
       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(h, r);
+    return new S(h, r);
   }
   /**
    * @inheritdoc
@@ -5022,7 +5022,7 @@ class Zt extends st {
    * @inheritdoc
    */
   clone() {
-    return new Zt(
+    return new Qt(
       this.center,
       this.majorAxisRadius,
       this.minorAxisRadius,
@@ -5033,7 +5033,7 @@ class Zt extends st {
     );
   }
 }
-class Gt extends Mt {
+class Ot extends et {
   /**
    * 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 A(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Major axis radius of the ellipse
@@ -5065,7 +5065,7 @@ class Gt extends Mt {
     return this._majorAxisRadius;
   }
   set majorAxisRadius(t) {
-    if (t < 0) throw T.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._majorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -5075,7 +5075,7 @@ class Gt extends Mt {
     return this._minorAxisRadius;
   }
   set minorAxisRadius(t) {
-    if (t < 0) throw T.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._minorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   /**
@@ -5122,7 +5122,7 @@ class Gt extends Mt {
     return this._normal;
   }
   set normal(t) {
-    this._normal = new y(t.x, t.y, t.z), this._normal.normalize(), this._boundingBoxNeedsUpdate = !0;
+    this._normal = new g(t.x, t.y, t.z), this._normal.normalize(), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Unit major axis vector (in WCS coordinates) of the ellipse. The major axis vector is the vector from the
@@ -5132,13 +5132,13 @@ class Gt extends Mt {
     return this._majorAxis;
   }
   set majorAxis(t) {
-    this._majorAxis = new y(t.x, t.y, t.z), this._majorAxis.normalize(), this._boundingBoxNeedsUpdate = !0;
+    this._majorAxis = new g(t.x, t.y, t.z), this._majorAxis.normalize(), this._boundingBoxNeedsUpdate = !0;
   }
   /**
    * Unit minor axis vector (in WCS coordinates) of the ellipse.
    */
   get minorAxis() {
-    return new y().crossVectors(this.normal, this.majorAxis).normalize();
+    return new g().crossVectors(this.normal, this.majorAxis).normalize();
   }
   /**
    * Compute the start point of the ellipse arc.
@@ -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 Xt.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;
     }
@@ -5172,7 +5181,7 @@ class Gt extends Mt {
    * @returns Return bounding box containing the min and max coordinates
    */
   calculateBoundingBox() {
-    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)) {
+    if (this.majorAxis.equals(g.X_AXIS) || this.majorAxis.equals(g.Y_AXIS) || this.majorAxis.isParallelTo(g.X_AXIS) || this.majorAxis.isParallelTo(g.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);
@@ -5181,7 +5190,7 @@ class Gt extends Mt {
         const o = this.getPointAtAngle(a);
         o.x < s && (s = o.x), o.y < e && (e = o.y), o.z < n && (n = o.z), o.x > i && (i = o.x), o.y > h && (h = o.y), o.z > r && (r = o.z);
       }
-      return new Y(
+      return new j(
         { x: s, y: e, z: n },
         { x: i, y: h, z: r }
       );
@@ -5191,7 +5200,7 @@ class Gt extends Mt {
         const o = this.startAngle + this.deltaAngle * (a / 100), c = this.getPointAtAngle(o);
         s = Math.min(s, c.x), e = Math.min(e, c.y), n = Math.min(n, c.z), i = Math.max(i, c.x), h = Math.max(h, c.y), r = Math.max(r, c.z);
       }
-      return new Y(
+      return new j(
         { x: s, y: e, z: n },
         { x: i, y: h, z: r }
       );
@@ -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 A(
       this.center.x + i.x,
       this.center.y + i.y,
       this.center.z + i.z
@@ -5232,7 +5241,7 @@ 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, h = n / this.minorAxisRadius;
+    const s = new g(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;
   }
   /**
@@ -5251,7 +5260,7 @@ class Gt extends Mt {
    * @inheritdoc
    */
   clone() {
-    return new Gt(
+    return new Ot(
       this.center,
       this.normal,
       this.majorAxis,
@@ -5265,11 +5274,11 @@ class Gt extends Mt {
    * Return the plane in which the ellipse arc lies.
    */
   get plane() {
-    const t = new y(this.center).distanceTo(jt);
-    return new zt(this.normal, t);
+    const t = new g(this.center).distanceTo(Ft);
+    return new Mt(this.normal, t);
   }
 }
-class Bs extends st {
+class Rs extends st {
   constructor(t = null, s = !1) {
     super(), this._vertices = t || new Array(), this._closed = s;
   }
@@ -5291,7 +5300,7 @@ class Bs extends st {
   get startPoint() {
     if (this.numberOfVertices > 0) {
       const t = this._vertices[0];
-      return new b(t.x, t.y);
+      return new S(t.x, t.y);
     }
     throw new Error("Start point does not exist in an empty polyline.");
   }
@@ -5303,10 +5312,10 @@ class Bs extends st {
     if (t > 0)
       if (this.closed) {
         const s = this._vertices[0];
-        return new b(s.x, s.y);
+        return new S(s.x, s.y);
       } else {
         const s = this._vertices[t - 1];
-        return new b(s.x, s.y);
+        return new S(s.x, s.y);
       }
     throw new Error("End point does not exist in an empty polyline.");
   }
@@ -5321,10 +5330,10 @@ 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 h = new gt(n, i, n.bulge);
+          const h = new _t(n, i, n.bulge);
           t += h.length;
         } else
-          t += new b(n.x, n.y).distanceTo(i);
+          t += new S(n.x, n.y).distanceTo(i);
     }
     return t;
   }
@@ -5355,14 +5364,14 @@ class Bs extends st {
    */
   getPointAt(t) {
     const s = this._vertices[t];
-    return new b(s.x, s.y);
+    return new S(s.x, s.y);
   }
   /**
    * @inheritdoc
    */
   calculateBoundingBox() {
     const t = this.getPoints(100);
-    return new V().setFromPoints(t);
+    return new U().setFromPoints(t);
   }
   /**
    * @inheritdoc
@@ -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 A().set(i.x, i.y, s))
     ), e;
   }
   /**
@@ -5394,25 +5403,25 @@ class Bs extends st {
       if (i.bulge) {
         let h = null;
         if (n < e - 1 ? h = this._vertices[n + 1] : n == e - 1 && this.closed && (h = this._vertices[0]), h) {
-          const a = new gt(i, h, i.bulge).getPoints(t), o = a.length;
+          const a = new _t(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));
+            s.push(new S(l.x, l.y));
           }
         }
       } else
-        s.push(new b(i.x, i.y)), n == e - 1 && this.closed && s.push(s[0]);
+        s.push(new S(i.x, i.y)), n == e - 1 && this.closed && s.push(s[0]);
     }
     return s;
   }
 }
-class Kt extends st {
+class Ht extends st {
   /**
    * This constructor initializes the line object to use start as the start point, and end
    * as the endpoint. Both points must be in WCS coordinates.
    */
   constructor(t, s) {
-    super(), this._start = new 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
@@ -5451,14 +5460,14 @@ class Kt extends st {
    * @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)
-    ), s = new b(
+    ), s = new S(
       Math.max(this._start.x, this._end.x),
       Math.max(this._start.y, this._end.y)
     );
-    return new V(t, s);
+    return new U(t, s);
   }
   /**
    * @inheritdoc
@@ -5482,10 +5491,10 @@ class Kt extends st {
    * @inheritdoc
    */
   clone() {
-    return new Kt(this._start.clone(), this._end.clone());
+    return new Ht(this._start.clone(), this._end.clone());
   }
 }
-class Is extends st {
+class ks extends st {
   /**
    * Create one loop by connected curves
    * @param curves Input one array of connected curves
@@ -5515,7 +5524,7 @@ class Is extends st {
   get startPoint() {
     if (this._curves.length > 0) {
       const t = this._curves[0].startPoint;
-      return new b(t.x, t.y);
+      return new S(t.x, t.y);
     }
     throw new Error("Start point does not exist in an empty loop.");
   }
@@ -5538,7 +5547,7 @@ class Is extends st {
    * @inheritdoc
    */
   calculateBoundingBox() {
-    const t = this.getPoints(100), s = new V();
+    const t = this.getPoints(100), s = new U();
     return s.setFromPoints(t), s;
   }
   /**
@@ -5562,24 +5571,225 @@ class Is extends st {
     const s = [];
     return this.curves.forEach((e) => {
       e.getPoints(t).forEach((n) => {
-        s.push(new b(n.x, n.y));
+        s.push(new S(n.x, n.y));
       });
     }), s;
   }
 }
-class D {
+class bt {
+  constructor() {
+    this.c0 = 0, this.c1 = 0, this.c2 = 0, this.c3 = 0;
+  }
+  /**
+   * Compute coefficients for a cubic polynomial
+   *   p(s) = c0 + c1*s + c2*s^2 + c3*s^3
+   * such that
+   *   p(0) = x0, p(1) = x1
+   *  and
+   *   p'(0) = t0, p'(1) = t1.
+   */
+  init(t, s, e, n) {
+    this.c0 = t, this.c1 = e, this.c2 = -3 * t + 3 * s - 2 * e - n, this.c3 = 2 * t - 2 * s + e + n;
+  }
+  /**
+   * Initialize for Catmull-Rom interpolation
+   */
+  initCatmullRom(t, s, e, n, i) {
+    this.init(s, e, i * (e - t), i * (n - s));
+  }
+  /**
+   * Initialize for non-uniform Catmull-Rom interpolation
+   */
+  initNonuniformCatmullRom(t, s, e, n, i, h, r) {
+    let a = (s - t) / i - (e - t) / (i + h) + (e - s) / h, o = (e - s) / h - (n - s) / (h + r) + (n - e) / r;
+    a *= h, o *= h, this.init(s, e, a, o);
+  }
+  /**
+   * Calculate the polynomial value at parameter t
+   */
+  calc(t) {
+    const s = t * t, e = s * t;
+    return this.c0 + this.c1 * t + this.c2 * s + this.c3 * e;
+  }
+}
+class Ss extends et {
+  /**
+   * Constructs a new Catmull-Rom curve.
+   *
+   * @param points - An array of 3D points defining the curve.
+   * @param closed - Whether the curve is closed or not.
+   * @param curveType - The curve type.
+   * @param tension - Tension of the curve.
+   */
+  constructor(t = [], s = !1, e = "centripetal", n = 0.5) {
+    super(), this.isCatmullRomCurve3d = !0, this.type = "CatmullRomCurve3d", this._tmp = new g(), this._px = new bt(), this._py = new bt(), this._pz = new bt(), this._points = t.map((i) => new A(i)), this._closed = s, this._curveType = e, this._tension = n;
+  }
+  /**
+   * An array of 3D points defining the curve.
+   */
+  get points() {
+    return this._points;
+  }
+  /**
+   * Whether the curve is closed or not.
+   */
+  get closed() {
+    return this._closed;
+  }
+  /**
+   * The curve type.
+   */
+  get curveType() {
+    return this._curveType;
+  }
+  /**
+   * Tension of the curve.
+   */
+  get tension() {
+    return this._tension;
+  }
+  /**
+   * Start point of this curve.
+   */
+  get startPoint() {
+    return this._points.length > 0 ? this._points[0] : new A();
+  }
+  /**
+   * End point of this curve.
+   */
+  get endPoint() {
+    return this._points.length > 0 ? this._points[this._points.length - 1] : new A();
+  }
+  /**
+   * Length of this curve (approximated).
+   */
+  get length() {
+    if (this._points.length < 2) return 0;
+    let t = 0;
+    for (let s = 1; s < this._points.length; s++)
+      t += this._points[s - 1].distanceTo(this._points[s]);
+    return this._closed && this._points.length > 2 && (t += this._points[this._points.length - 1].distanceTo(
+      this._points[0]
+    )), t;
+  }
+  /**
+   * Returns a point on the curve.
+   *
+   * @param t - A interpolation factor representing a position on the curve. Must be in the range `[0,1]`.
+   * @param optionalTarget - The optional target vector the result is written to.
+   * @return The position on the curve.
+   */
+  getPoint(t, s = new A()) {
+    const e = s, n = this._points, i = n.length;
+    if (i === 0)
+      return e.set(0, 0, 0);
+    if (i === 1)
+      return e.copy(n[0]);
+    const h = (i - (this._closed ? 0 : 1)) * t;
+    let r = Math.floor(h), a = h - r;
+    this._closed ? r += r > 0 ? 0 : (Math.floor(Math.abs(r) / i) + 1) * i : a === 0 && r === i - 1 && (r = i - 2, a = 1);
+    let o, c;
+    this._closed || r > 0 ? o = n[(r - 1) % i] : (this._tmp.subVectors(n[0], n[1]).add(n[0]), o = new A(this._tmp.x, this._tmp.y, this._tmp.z));
+    const l = n[r % i], d = n[(r + 1) % i];
+    if (this._closed || r + 2 < i ? c = n[(r + 2) % i] : (this._tmp.subVectors(n[i - 1], n[i - 2]).add(n[i - 1]), c = new A(this._tmp.x, this._tmp.y, this._tmp.z)), this._curveType === "centripetal" || this._curveType === "chordal") {
+      const m = this._curveType === "chordal" ? 0.5 : 0.25;
+      let x = Math.pow(o.distanceToSquared(l), m), y = Math.pow(l.distanceToSquared(d), m), _ = Math.pow(d.distanceToSquared(c), m);
+      y < 1e-4 && (y = 1), x < 1e-4 && (x = y), _ < 1e-4 && (_ = y), this._px.initNonuniformCatmullRom(o.x, l.x, d.x, c.x, x, y, _), this._py.initNonuniformCatmullRom(o.y, l.y, d.y, c.y, x, y, _), this._pz.initNonuniformCatmullRom(o.z, l.z, d.z, c.z, x, y, _);
+    } else this._curveType === "catmullrom" && (this._px.initCatmullRom(o.x, l.x, d.x, c.x, this._tension), this._py.initCatmullRom(o.y, l.y, d.y, c.y, this._tension), this._pz.initCatmullRom(o.z, l.z, d.z, c.z, this._tension));
+    return e.set(
+      this._px.calc(a),
+      this._py.calc(a),
+      this._pz.calc(a)
+    ), e;
+  }
+  /**
+   * Get an array of points along the curve
+   * @param divisions - Number of divisions to create
+   * @returns Array of points along the curve
+   */
+  getPoints(t) {
+    const s = [];
+    for (let e = 0; e <= t; e++)
+      s.push(this.getPoint(e / t));
+    return s;
+  }
+  /**
+   * Set the points defining the curve
+   * @param points - Array of points
+   */
+  setPoints(t) {
+    this._points = t.map((s) => new A(s)), this._boundingBoxNeedsUpdate = !0;
+  }
+  /**
+   * Set whether the curve is closed
+   * @param closed - Whether the curve should be closed
+   */
+  setClosed(t) {
+    this._closed !== t && (this._closed = t, this._boundingBoxNeedsUpdate = !0);
+  }
+  /**
+   * Set the curve type
+   * @param curveType - The curve type
+   */
+  setCurveType(t) {
+    this._curveType = t;
+  }
+  /**
+   * Set the tension of the curve
+   * @param tension - The tension value
+   */
+  setTension(t) {
+    this._tension = t;
+  }
+  /**
+   * Transforms the curve by applying the input matrix.
+   * @param matrix Input transformation matrix
+   * @return Return this curve
+   */
+  transform(t) {
+    return this._points = this._points.map((s) => {
+      const e = new A();
+      return e.copy(s), e.applyMatrix3d(t), e;
+    }), this._boundingBoxNeedsUpdate = !0, this;
+  }
+  /**
+   * Calculate the bounding box of this curve.
+   * @return The bounding box
+   */
+  calculateBoundingBox() {
+    if (this._points.length === 0)
+      return new j();
+    const t = new j();
+    return this._points.forEach((s) => {
+      t.expandByPoint(s);
+    }), t;
+  }
+}
+class q {
   constructor(t, s, e, n) {
-    this._degree = t, this._knots = [...s], this._controlPoints = e.map((i) => [...i]), this._weights = n ? [...n] : new Array(e.length).fill(1);
+    this._degree = t, this._knots = [...s], this._controlPoints = e.map((i) => ({ x: i.x, y: i.y, z: i.z })), this._weights = n ? [...n] : new Array(e.length).fill(1);
   }
+  /**
+   * Get the degree of the NURBS curve
+   */
   degree() {
     return this._degree;
   }
+  /**
+   * Get the knot vector
+   */
   knots() {
     return [...this._knots];
   }
+  /**
+   * Get the control points
+   */
   controlPoints() {
-    return this._controlPoints.map((t) => [...t]);
+    return this._controlPoints.map((t) => ({ x: t.x, y: t.y, z: t.z }));
   }
+  /**
+   * Get the weights
+   */
   weights() {
     return [...this._weights];
   }
@@ -5587,11 +5797,12 @@ class D {
    * Calculate a point on the curve at parameter u
    */
   point(t) {
-    return xt(
+    const s = this._controlPoints.map((e) => [e.x, e.y, e.z]);
+    return yt(
       t,
       this._degree,
       this._knots,
-      this._controlPoints,
+      s,
       this._weights
     );
   }
@@ -5599,10 +5810,11 @@ class D {
    * Calculate curve length using numerical integration
    */
   length() {
-    return ps(
+    const t = this._controlPoints.map((s) => [s.x, s.y, s.z]);
+    return Ms(
       this._degree,
       this._knots,
-      this._controlPoints,
+      t,
       this._weights
     );
   }
@@ -5610,7 +5822,7 @@ class D {
    * Create a NURBS curve from control points and knots
    */
   static byKnotsControlPointsWeights(t, s, e, n) {
-    return new D(t, s, e, n);
+    return new q(t, s, e, n);
   }
   /**
    * Create a NURBS curve from fit points using interpolation
@@ -5619,94 +5831,131 @@ class D {
     let n;
     switch (e) {
       case "Chord":
-        n = gs(s, t);
+        n = ps(s, t);
         break;
       case "SqrtChord":
-        n = _s(s, t);
+        n = zs(s, t);
         break;
       case "Uniform":
       default:
-        n = ys(s, t.length);
+        n = _s(s, t.length);
         break;
     }
-    const i = zs(t), h = new Array(i.length).fill(1);
-    return new D(s, n, i, h);
+    const i = t.map((r) => ({ x: r[0], y: r[1], z: r[2] })), h = new Array(i.length).fill(1);
+    return new q(s, n, i, h);
   }
-}
-class Es extends Mt {
-  constructor(t, s, e) {
-    super();
-    const n = +(t !== void 0) + +(s !== void 0) + +(e !== void 0);
-    if (n != 2 && n != 3)
-      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)
-        throw T.ILLEGAL_PARAMETERS;
-      const h = this.toNurbsPoints(this._controlPoints);
-      this._nurbsCurve = D.byKnotsControlPointsWeights(
-        i,
-        s,
-        h,
-        e
-      ), this._originalControlPoints = [...this._controlPoints], this._originalKnots = [...this._nurbsCurve.knots()], this._originalWeights = e ? [...e] : new Array(this._controlPoints.length).fill(1);
+  /**
+   * Get the valid parameter range for this curve
+   */
+  getParameterRange() {
+    const t = this._knots[this._degree], s = this._knots[this._knots.length - this._degree - 1];
+    return { start: t, end: s };
+  }
+  /**
+   * Get points along the curve
+   * @param divisions - Number of divisions to create
+   * @returns Array of points along the curve
+   */
+  getPoints(t) {
+    const s = [], { start: e, end: n } = this.getParameterRange();
+    for (let i = 0; i <= t; i++) {
+      const h = e + (n - e) * (i / t);
+      s.push(this.point(h));
     }
+    return s;
   }
   /**
-   * Set the closed property and rebuild the curve if necessary
+   * Check if the curve is closed by comparing start and end points
    */
-  setClosed(t) {
-    this._closed !== t && (this._closed = t, this._boundingBoxNeedsUpdate = !0, t ? this.makeClosed() : this.makeOpen());
+  isClosed(t = 1e-6) {
+    const { start: s, end: e } = this.getParameterRange(), n = this.point(s), i = this.point(e), h = n[0] - i[0], r = n[1] - i[1], a = n[2] - i[2];
+    return Math.sqrt(h * h + r * r + a * a) < t;
   }
   /**
-   * Make the spline closed by adding control points and adjusting knots
+   * Create a closed NURBS curve using Catmull-Rom interpolation for smooth closure
    */
-  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);
-    this._nurbsCurve = D.byKnotsControlPointsWeights(
+  static createClosedCurve(t, s, e = "Chord") {
+    if (t.length < 4)
+      throw new Error("At least 4 points are required for a closed NURBS curve");
+    const n = new Ss(
       t,
-      r,
-      i,
-      h
-    ), this._controlPoints = this.toGePoints(i);
+      !0,
+      "centripetal"
+    ), i = Math.max(50, t.length * 2), r = n.getPoints(i).map((a) => [a.x, a.y, a.z]);
+    return q.byPoints(r, s, e);
+  }
+}
+class Kt extends et {
+  constructor(t, s, e, n) {
+    super();
+    const i = +(t !== void 0) + +(s !== void 0) + +(e !== void 0) + +(n !== void 0);
+    if (i < 2 || i > 4)
+      throw L.ILLEGAL_PARAMETERS;
+    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 L.ILLEGAL_PARAMETERS;
+      this._nurbsCurve = q.byKnotsControlPointsWeights(
+        h,
+        s,
+        this._controlPoints,
+        e
+      );
+    } else {
+      if (this._fitPoints = t, this._knotParameterization = s, i >= 3 && (this._closed = e), this._fitPoints.length < 4)
+        throw L.ILLEGAL_PARAMETERS;
+      const r = this.toNurbsPoints(this._fitPoints);
+      this._nurbsCurve = q.byPoints(
+        r,
+        h,
+        this._knotParameterization
+      ), this._controlPoints = this._nurbsCurve.controlPoints();
+    }
+    this._closed && this.buildCurve();
   }
   /**
-   * Make the spline open by restoring the original curve
+   * Build the NURBS curve using stored data
    */
-  makeOpen() {
-    if (!this._originalControlPoints || !this._originalKnots || !this._originalWeights)
-      throw new Error("Original curve data not available");
-    const t = this._nurbsCurve.degree(), s = this.toNurbsPoints(this._originalControlPoints);
-    this._nurbsCurve = D.byKnotsControlPointsWeights(
-      t,
-      this._originalKnots,
-      s,
-      this._originalWeights
-    ), this._controlPoints = [...this._originalControlPoints];
+  buildCurve() {
+    if (this._fitPoints && this._knotParameterization) {
+      if (this._closed)
+        this._nurbsCurve = q.createClosedCurve(
+          this._fitPoints,
+          3,
+          this._knotParameterization
+        );
+      else {
+        const s = this.toNurbsPoints(this._fitPoints);
+        this._nurbsCurve = q.byPoints(
+          s,
+          3,
+          this._knotParameterization
+        );
+      }
+      this._controlPoints = this._nurbsCurve.controlPoints();
+    } else if (this._controlPoints)
+      if (this._closed) {
+        const s = this._knotParameterization || "Chord";
+        this._nurbsCurve = q.createClosedCurve(
+          this._controlPoints,
+          3,
+          s
+        ), this._controlPoints = this._nurbsCurve.controlPoints();
+      } else {
+        const s = this._nurbsCurve.knots(), e = this._nurbsCurve.weights();
+        this._nurbsCurve = q.byKnotsControlPointsWeights(
+          3,
+          s,
+          this._controlPoints,
+          e
+        );
+      }
   }
   /**
-   * Create periodic knot vector for closed curve
+   * Set the closed property and rebuild the curve if necessary
    */
-  createClosedKnotVector(t, s) {
-    const e = t + 2 * s + 1, n = [];
-    for (let i = 0; i < e; i++)
-      n.push(i);
-    return n;
+  setClosed(t) {
+    this._closed !== t && (this._closed = t, this._boundingBoxNeedsUpdate = !0, this.buildCurve());
   }
   /**
    * Degree of the spline to be created.
@@ -5722,16 +5971,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 A(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 A(n[0], n[1], n[2]);
   }
   /**
    * @inheritdoc
@@ -5764,26 +6011,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 A(l[0], l[1], l[2]));
     }
     return e;
   }
@@ -5800,7 +6037,7 @@ class Es extends Mt {
    */
   calculateBoundingBox() {
     const t = this.getPoints(100);
-    return new Y().setFromPoints(t);
+    return new j().setFromPoints(t);
   }
   get closed() {
     return this._closed;
@@ -5826,82 +6063,84 @@ class Es extends Mt {
     }), s;
   }
   /**
-   * Convert input points to points in geometry engine format
-   * @param points Input points to convert
-   * @returns Return converted points
+   * Create a closed spline from fit points using AcGeNurbsCurve.createClosedCurve
+   * @param fitPoints - Array of fit points defining the curve
+   * @param parameterization - Knot parameterization type for NURBS
+   * @returns A closed spline
    */
-  toGePoints(t) {
-    const s = new Array(t.length);
-    return t.forEach((e, n) => {
-      s[n] = { x: e[0], y: e[1], z: e[2] };
-    }), s;
+  static createClosedSpline(t, s = "Uniform") {
+    if (t.length < 4)
+      throw new Error("At least 4 points are required for a closed spline");
+    return new Kt(t, s, !0);
   }
 }
 export {
-  Cs as AcGeArea2d,
-  V as AcGeBox2d,
-  Y as AcGeBox3d,
-  gt as AcGeCircArc2d,
-  yt as AcGeCircArc3d,
+  Es as AcGeArea2d,
+  U as AcGeBox2d,
+  j as AcGeBox3d,
+  Ss as AcGeCatmullRomCurve3d,
+  _t as AcGeCircArc2d,
+  gt as AcGeCircArc3d,
   st as AcGeCurve2d,
-  Zt as AcGeEllipseArc2d,
-  Gt as AcGeEllipseArc3d,
+  Qt as AcGeEllipseArc2d,
+  Ot as AcGeEllipseArc3d,
   Nt as AcGeEuler,
-  xs as AcGeGeometryUtil,
-  Kt as AcGeLine2d,
-  _t as AcGeLine3d,
-  Is as AcGeLoop2d,
+  gs as AcGeGeometryUtil,
+  Ht as AcGeLine2d,
+  pt as AcGeLine3d,
+  ks as AcGeLoop2d,
   C as AcGeMathUtil,
   v as AcGeMatrix2d,
   tt as AcGeMatrix3d,
-  zt as AcGePlane,
-  b as AcGePoint2d,
-  S as AcGePoint3d,
-  Bs as AcGePolyline2d,
-  pt as AcGeQuaternion,
-  Yt as AcGeShape2d,
-  Es as AcGeSpline3d,
-  ds as AcGeTol,
-  P as AcGeVector2d,
-  y as AcGeVector3d,
-  Ft as DEFAULT_TOL,
-  Rt as DEG2RAD,
-  Q as FLOAT_TOL,
-  Ss as ORIGIN_POINT_2D,
-  jt as ORIGIN_POINT_3D,
-  Tt as RAD2DEG,
+  q as AcGeNurbsCurve,
+  Mt as AcGePlane,
+  S as AcGePoint2d,
+  A as AcGePoint3d,
+  Rs as AcGePolyline2d,
+  zt as AcGeQuaternion,
+  Gt as AcGeShape2d,
+  Kt as AcGeSpline3d,
+  Xt as AcGeTol,
+  b as AcGeVector2d,
+  g as AcGeVector3d,
+  Dt as DEFAULT_TOL,
+  Lt as DEG2RAD,
+  O as FLOAT_TOL,
+  Bs as ORIGIN_POINT_2D,
+  Ft as ORIGIN_POINT_3D,
+  Ut as RAD2DEG,
   I as TAU,
-  bt as basisFunction,
-  ps as calculateCurveLength,
-  os as ceilPowerOfTwo,
-  j as clamp,
-  Ht as damp,
-  is as degToRad,
-  Vt as euclideanModulo,
-  xt as evaluateNurbsPoint,
-  as as floorPowerOfTwo,
-  gs as generateChordKnots,
-  _s as generateSqrtChordKnots,
-  Qt 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 isPolygonIntersect,
-  hs as isPowerOfTwo,
-  Ut as lerp,
-  Ot 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
+  St as basisFunction,
+  Ms as calculateCurveLength,
+  ls as ceilPowerOfTwo,
+  X as clamp,
+  vt as damp,
+  os as degToRad,
+  qt as euclideanModulo,
+  yt as evaluateNurbsPoint,
+  us as floorPowerOfTwo,
+  ps as generateChordKnots,
+  zs as generateSqrtChordKnots,
+  $t as generateUUID,
+  _s as generateUniformKnots,
+  jt as intPartLength,
+  Is as interpolateControlPoints,
+  Jt as inverseLerp,
+  ds as isBetween,
+  ms as isBetweenAngle,
+  Yt as isPointInPolygon,
+  ys as isPolygonIntersect,
+  cs as isPowerOfTwo,
+  Vt as lerp,
+  Wt as mapLinear,
+  xt as normalizeAngle,
+  ts as pingpong,
+  as as radToDeg,
+  is as randFloat,
+  rs as randFloatSpread,
+  ns as randInt,
+  xs as relativeEps,
+  hs as seededRandom,
+  es as smootherstep,
+  ss as smoothstep
 };