@mlightcad/geometry-engine 3.2.23 → 3.2.25

package/dist/geometry-engine.js

@@ -257,112 +257,112 @@ const N = [
   "fe",
   "ff"
 ];
-let Tt = 1234567;
-const Dt = Math.PI / 180, Yt = 180 / Math.PI;
-function es() {
-  const m = Math.random() * 4294967295 | 0, t = Math.random() * 4294967295 | 0, s = Math.random() * 4294967295 | 0, e = Math.random() * 4294967295 | 0;
-  return (N[m & 255] + N[m >> 8 & 255] + N[m >> 16 & 255] + N[m >> 24 & 255] + "-" + N[t & 255] + N[t >> 8 & 255] + "-" + N[t >> 16 & 15 | 64] + N[t >> 24 & 255] + "-" + N[s & 63 | 128] + N[s >> 8 & 255] + "-" + N[s >> 16 & 255] + N[s >> 24 & 255] + N[e & 255] + N[e >> 8 & 255] + N[e >> 16 & 255] + N[e >> 24 & 255]).toLowerCase();
+let jt = 1234567;
+const Qt = Math.PI / 180, Kt = 180 / Math.PI;
+function hs() {
+  const u = Math.random() * 4294967295 | 0, t = Math.random() * 4294967295 | 0, s = Math.random() * 4294967295 | 0, e = Math.random() * 4294967295 | 0;
+  return (N[u & 255] + N[u >> 8 & 255] + N[u >> 16 & 255] + N[u >> 24 & 255] + "-" + N[t & 255] + N[t >> 8 & 255] + "-" + N[t >> 16 & 15 | 64] + N[t >> 24 & 255] + "-" + N[s & 63 | 128] + N[s >> 8 & 255] + "-" + N[s >> 16 & 255] + N[s >> 24 & 255] + N[e & 255] + N[e >> 8 & 255] + N[e >> 16 & 255] + N[e >> 24 & 255]).toLowerCase();
 }
-function Z(m, t, s) {
-  return Math.max(t, Math.min(s, m));
+function Z(u, t, s) {
+  return Math.max(t, Math.min(s, u));
 }
-function Zt(m, t) {
-  return (m % t + t) % t;
+function $t(u, t) {
+  return (u % t + t) % t;
 }
-function ns(m, t, s, e, n) {
-  return e + (m - t) * (n - e) / (s - t);
+function as(u, t, s, e, n) {
+  return e + (u - t) * (n - e) / (s - t);
 }
-function is(m, t, s) {
-  return m !== t ? (s - m) / (t - m) : 0;
+function cs(u, t, s) {
+  return u !== t ? (s - u) / (t - u) : 0;
 }
-function Ot(m, t, s) {
-  return (1 - s) * m + s * t;
+function Wt(u, t, s) {
+  return (1 - s) * u + s * t;
 }
-function rs(m, t, s, e) {
-  return Ot(m, t, 1 - Math.exp(-s * e));
+function ls(u, t, s, e) {
+  return Wt(u, t, 1 - Math.exp(-s * e));
 }
-function os(m, t = 1) {
-  return t - Math.abs(Zt(m, t * 2) - t);
+function us(u, t = 1) {
+  return t - Math.abs($t(u, t * 2) - t);
 }
-function hs(m, t, s) {
-  return m <= t ? 0 : m >= s ? 1 : (m = (m - t) / (s - t), m * m * (3 - 2 * m));
+function ds(u, t, s) {
+  return u <= t ? 0 : u >= s ? 1 : (u = (u - t) / (s - t), u * u * (3 - 2 * u));
 }
-function as(m, t, s) {
-  return m <= t ? 0 : m >= s ? 1 : (m = (m - t) / (s - t), m * m * m * (m * (m * 6 - 15) + 10));
+function ms(u, t, s) {
+  return u <= t ? 0 : u >= s ? 1 : (u = (u - t) / (s - t), u * u * u * (u * (u * 6 - 15) + 10));
 }
-function cs(m, t) {
-  return m + Math.floor(Math.random() * (t - m + 1));
+function xs(u, t) {
+  return u + Math.floor(Math.random() * (t - u + 1));
 }
-function ls(m, t) {
-  return m + Math.random() * (t - m);
+function gs(u, t) {
+  return u + Math.random() * (t - u);
 }
-function us(m) {
-  return m * (0.5 - Math.random());
+function ys(u) {
+  return u * (0.5 - Math.random());
 }
-function ds(m) {
-  m !== void 0 && (Tt = m);
-  let t = Tt += 1831565813;
+function _s(u) {
+  u !== void 0 && (jt = u);
+  let t = jt += 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 ms(m) {
-  return m * Dt;
+function ps(u) {
+  return u * Qt;
 }
-function xs(m) {
-  return m * Yt;
+function fs(u) {
+  return u * Kt;
 }
-function gs(m) {
-  return (m & m - 1) === 0 && m !== 0;
+function As(u) {
+  return (u & u - 1) === 0 && u !== 0;
 }
-function ys(m) {
-  return Math.pow(2, Math.ceil(Math.log(m) / Math.LN2));
+function ws(u) {
+  return Math.pow(2, Math.ceil(Math.log(u) / Math.LN2));
 }
-function _s(m) {
-  return Math.pow(2, Math.floor(Math.log(m) / Math.LN2));
+function zs(u) {
+  return Math.pow(2, Math.floor(Math.log(u) / Math.LN2));
 }
-function pt(m) {
+function pt(u) {
   const t = Math.PI * 2;
-  return (m % t + t) % t;
+  return (u % t + t) % t;
 }
-function ps(m, t, s) {
-  return m > t && m < s || m > s && m < t;
+function Ms(u, t, s) {
+  return u > t && u < s || u > s && u < t;
 }
-function fs(m, t, s, e = !1) {
-  return m = pt(m), t = pt(t), s = pt(s), e ? t > s ? m <= t && m >= s : m <= t || m >= s : t < s ? m >= t && m <= s : m >= t || m <= s;
+function Ps(u, t, s, e = !1) {
+  return u = pt(u), t = pt(t), s = pt(s), e ? t > s ? u <= t && u >= s : u <= t || u >= s : t < s ? u >= t && u <= s : u >= t || u <= s;
 }
-function Qt(m) {
-  return m = Math.abs(m), m < 1 ? 0 : Math.ceil(Math.log10(Math.abs(m) + 1));
+function Ht(u) {
+  return u = Math.abs(u), u < 1 ? 0 : Math.ceil(Math.log10(Math.abs(u) + 1));
 }
-function As(m, t = 1e-7) {
-  const s = Qt(m);
+function bs(u, t = 1e-7) {
+  const s = Ht(u);
   return Math.max(Math.pow(10, s) * t, t);
 }
 const M = {
-  DEG2RAD: Dt,
-  RAD2DEG: Yt,
-  generateUUID: es,
+  DEG2RAD: Qt,
+  RAD2DEG: Kt,
+  generateUUID: hs,
   clamp: Z,
-  euclideanModulo: Zt,
-  mapLinear: ns,
-  inverseLerp: is,
-  lerp: Ot,
-  damp: rs,
-  pingpong: os,
-  smoothstep: hs,
-  smootherstep: as,
-  randInt: cs,
-  randFloat: ls,
-  randFloatSpread: us,
-  seededRandom: ds,
-  degToRad: ms,
-  radToDeg: xs,
-  isPowerOfTwo: gs,
-  ceilPowerOfTwo: ys,
-  floorPowerOfTwo: _s,
+  euclideanModulo: $t,
+  mapLinear: as,
+  inverseLerp: cs,
+  lerp: Wt,
+  damp: ls,
+  pingpong: us,
+  smoothstep: ds,
+  smootherstep: ms,
+  randInt: xs,
+  randFloat: gs,
+  randFloatSpread: ys,
+  seededRandom: _s,
+  degToRad: ps,
+  radToDeg: fs,
+  isPowerOfTwo: As,
+  ceilPowerOfTwo: ws,
+  floorPowerOfTwo: zs,
   normalizeAngle: pt,
-  isBetween: ps,
-  isBetweenAngle: fs,
-  intPartLength: Qt,
-  relativeEps: As
+  isBetween: Ms,
+  isBetweenAngle: Ps,
+  intPartLength: Ht,
+  relativeEps: bs
 }, tt = class tt {
   constructor(t, s) {
     this.x = 0, this.y = 0;
@@ -610,8 +610,8 @@ const st = class st {
     return this.multiplyMatrices(t, this);
   }
   multiplyMatrices(t, s) {
-    const e = t.elements, n = s.elements, i = this.elements, r = e[0], o = e[3], a = e[6], h = e[1], c = e[4], l = e[7], d = e[2], u = e[5], x = e[8], g = n[0], y = n[3], _ = n[6], z = n[1], f = n[4], b = n[7], P = n[2], I = n[5], A = n[8];
-    return i[0] = r * g + o * z + a * P, i[3] = r * y + o * f + a * I, i[6] = r * _ + o * b + a * A, i[1] = h * g + c * z + l * P, i[4] = h * y + c * f + l * I, i[7] = h * _ + c * b + l * A, i[2] = d * g + u * z + x * P, i[5] = d * y + u * f + x * I, i[8] = d * _ + u * b + x * A, this;
+    const e = t.elements, n = s.elements, i = this.elements, r = e[0], o = e[3], a = e[6], h = e[1], c = e[4], l = e[7], m = e[2], d = e[5], x = e[8], g = n[0], y = n[3], p = n[6], z = n[1], f = n[4], b = n[7], P = n[2], I = n[5], A = n[8];
+    return i[0] = r * g + o * z + a * P, i[3] = r * y + o * f + a * I, i[6] = r * p + o * b + a * A, i[1] = h * g + c * z + l * P, i[4] = h * y + c * f + l * I, i[7] = h * p + c * b + l * A, i[2] = m * g + d * z + x * P, i[5] = m * y + d * f + x * I, i[8] = m * p + d * b + x * A, this;
   }
   multiplyScalar(t) {
     const s = this.elements;
@@ -622,10 +622,10 @@ const st = class st {
     return s * r * c - s * o * h - e * i * c + e * o * a + n * i * h - n * r * a;
   }
   invert() {
-    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], o = t[5], a = t[6], h = t[7], c = t[8], l = c * r - o * h, d = o * a - c * i, u = h * i - r * a, x = s * l + e * d + n * u;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], o = t[5], a = t[6], h = t[7], c = t[8], l = c * r - o * h, m = o * a - c * i, d = h * i - r * a, x = s * l + e * m + n * d;
     if (x === 0) return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0);
     const g = 1 / x;
-    return t[0] = l * g, t[1] = (n * h - c * e) * g, t[2] = (o * e - n * r) * g, t[3] = d * g, t[4] = (c * s - n * a) * g, t[5] = (n * i - o * s) * g, t[6] = u * g, t[7] = (e * a - h * s) * g, t[8] = (r * s - e * i) * g, this;
+    return t[0] = l * g, t[1] = (n * h - c * e) * g, t[2] = (o * e - n * r) * g, t[3] = m * g, t[4] = (c * s - n * a) * g, t[5] = (n * i - o * s) * g, t[6] = d * g, t[7] = (e * a - h * s) * g, t[8] = (r * s - e * i) * g, this;
   }
   transpose() {
     let t;
@@ -693,17 +693,17 @@ const st = class st {
 };
 st.IDENTITY = Object.freeze(new st());
 let it = st;
-const Et = new it(), W = 1e-6, E = 2 * Math.PI, Rs = {
+const Et = new it(), H = 1e-6, E = 2 * Math.PI, Ls = {
   x: 0,
   y: 0
-}, Kt = {
+}, Jt = {
   x: 0,
   y: 0,
   z: 0
 };
 class bt {
   constructor() {
-    this.equalPointTol = W, this.equalVectorTol = W;
+    this.equalPointTol = H, this.equalVectorTol = H;
   }
   clone() {
     const t = new bt();
@@ -713,275 +713,46 @@ class bt {
     return new B(t).sub(s).length() < this.equalPointTol;
   }
   equalPoint3d(t, s) {
-    return new p(t).sub(s).length() < this.equalPointTol;
+    return new _(t).sub(s).length() < this.equalPointTol;
   }
-  static equalToZero(t, s = W) {
+  static equalToZero(t, s = H) {
     return t < s && t > -s;
   }
-  static equal(t, s, e = W) {
+  static equal(t, s, e = H) {
     return Math.abs(t - s) < e;
   }
-  static great(t, s, e = W) {
+  static great(t, s, e = H) {
     return t - s > e;
   }
-  static less(t, s, e = W) {
+  static less(t, s, e = H) {
     return t - s < e;
   }
 }
-const $t = new bt();
-function Wt(m, t, s = !1) {
-  const e = m.x, n = m.y;
-  let i = !1;
-  const r = t.length;
-  for (let o = 0, a = r - 1; o < r; a = o++) {
-    const h = t[o].x, c = t[o].y, l = t[a].x, d = t[a].y;
-    let u = c > n != d > n;
-    s && (u = c >= n != d >= n), u && e < (l - h) * (n - c) / (d - c) + h && (i = !i);
-  }
-  return i;
-}
-function zs(m, t) {
-  if (m.length === 0 || t.length === 0)
-    return !1;
-  const s = new X().setFromPoints(m), e = new X().setFromPoints(t);
-  if (!s.intersectsBox(e))
-    return !1;
-  for (let n = 0; n < m.length; ) {
-    if (Wt(m[n], t, !0))
-      return !0;
-    n < m.length - 1 && $t.equalPoint2d(m[n + 1], m[n]) && ++n, ++n;
-  }
-  return !1;
-}
-const ws = {
-  isPointInPolygon: Wt,
-  isPolygonIntersect: zs
-};
-function Ns(m, t) {
-  const s = [], e = t - 1, n = m;
-  for (let i = 0; i <= n; i++)
-    s.push(0);
-  for (let i = 1; i <= e - n; i++)
-    s.push(i);
-  for (let i = 0; i <= n; i++)
-    s.push(e - n + 1);
-  return s;
-}
-function Ts(m, t) {
-  const s = t.length - 1, e = m, n = [0];
-  let i = 0;
-  for (let o = 1; o <= s; o++) {
-    const a = t[o][0] - t[o - 1][0], h = t[o][1] - t[o - 1][1], c = t[o][2] - t[o - 1][2], l = Math.sqrt(a * a + h * h + c * c);
-    i += l, n.push(i);
-  }
-  const r = [];
-  for (let o = 0; o <= e; o++)
-    r.push(0);
-  for (let o = 1; o <= s - e; o++) {
-    const a = n[o] / i;
-    r.push(a * (s - e + 1));
-  }
-  for (let o = 0; o <= e; o++)
-    r.push(s - e + 1);
-  return r;
-}
-function Ms(m, t = "Uniform") {
-  const s = m.length;
-  if (s === 0)
-    return [];
-  if (s === 1)
-    return [0];
-  const e = s - 1;
-  if (t === "Uniform")
-    return new Array(s).fill(0).map((r, o) => o / e);
-  const n = [0];
-  let i = 0;
-  for (let r = 1; r <= e; r++) {
-    const o = m[r][0] - m[r - 1][0], a = m[r][1] - m[r - 1][1], h = m[r][2] - m[r - 1][2], c = Math.sqrt(o * o + a * a + h * h), l = t === "SqrtChord" ? Math.sqrt(c) : c;
-    i += l, n.push(i);
-  }
-  return i < 1e-12 ? new Array(s).fill(0).map((r, o) => o / e) : n.map((r) => r / i);
-}
-function Ps(m, t) {
-  const s = t.length - 1, e = m, n = s + e + 1, i = new Array(n + 1).fill(0), r = t[t.length - 1];
-  for (let o = n - e; o <= n; o++)
-    i[o] = r;
-  for (let o = 1; o <= s - e; o++) {
-    let a = 0;
-    for (let h = o; h < o + e; h++)
-      a += t[h];
-    i[o + e] = a / e;
-  }
-  return i;
-}
-function js(m, t) {
-  const s = t.length - 1, e = m, n = [0];
-  let i = 0;
-  for (let o = 1; o <= s; o++) {
-    const a = t[o][0] - t[o - 1][0], h = t[o][1] - t[o - 1][1], c = t[o][2] - t[o - 1][2], l = Math.sqrt(a * a + h * h + c * c), d = Math.sqrt(l);
-    i += d, n.push(i);
-  }
-  const r = [];
-  for (let o = 0; o <= e; o++)
-    r.push(0);
-  for (let o = 1; o <= s - e; o++) {
-    const a = n[o] / i;
-    r.push(a * (s - e + 1));
-  }
-  for (let o = 0; o <= e; o++)
-    r.push(s - e + 1);
-  return r;
-}
-function It(m, t) {
-  const s = m.length, e = m.map((r) => r.slice()), n = t.slice();
-  for (let r = 0; r < s; r++) {
-    let o = r, a = Math.abs(e[r][r]);
-    for (let h = r + 1; h < s; h++) {
-      const c = Math.abs(e[h][r]);
-      c > a && (a = c, o = h);
-    }
-    if (a < 1e-12)
-      throw new Error("Interpolation matrix is singular.");
-    if (o !== r) {
-      const h = e[r];
-      e[r] = e[o], e[o] = h;
-      const c = n[r];
-      n[r] = n[o], n[o] = c;
-    }
-    for (let h = r + 1; h < s; h++) {
-      const c = e[h][r] / e[r][r];
-      if (!(Math.abs(c) < 1e-14)) {
-        for (let l = r; l < s; l++)
-          e[h][l] -= c * e[r][l];
-        n[h] -= c * n[r];
-      }
-    }
-  }
-  const i = new Array(s).fill(0);
-  for (let r = s - 1; r >= 0; r--) {
-    let o = n[r];
-    for (let a = r + 1; a < s; a++)
-      o -= e[r][a] * i[a];
-    i[r] = o / e[r][r];
-  }
-  return i;
-}
-function Ht(m, t, s = "Uniform", e, n) {
-  if (m.length === 0)
-    return { controlPoints: [], knots: [], weights: [] };
-  const i = m.map((C) => [C[0], C[1], C[2] ?? 0]), r = !!e, o = !!n, a = (r ? 1 : 0) + (o ? 1 : 0), h = i.length - 1, c = h + a;
-  if (c < t)
-    throw new Error("Not enough points to interpolate a curve of this degree.");
-  const l = Ms(i, s), d = l.slice();
-  r && d.unshift(l[0]), o && d.push(l[l.length - 1]);
-  const u = Ps(t, d), x = c + 1, g = new Array(x), y = new Array(x), _ = new Array(x), z = new Array(x);
-  let f = 0;
-  g[f] = new Array(x).fill(0), g[f][0] = 1, y[f] = i[0][0], _[f] = i[0][1], z[f] = i[0][2], f++;
-  for (let C = 1; C <= h - 1; C++) {
-    const j = l[C];
-    g[f] = new Array(x).fill(0);
-    for (let q = 0; q <= c; q++)
-      g[f][q] = wt(q, t, j, u);
-    y[f] = i[C][0], _[f] = i[C][1], z[f] = i[C][2], f++;
-  }
-  if (g[f] = new Array(x).fill(0), g[f][c] = 1, y[f] = i[h][0], _[f] = i[h][1], z[f] = i[h][2], f++, r) {
-    const C = u[t + 1] - u[0], j = C !== 0 ? t / C : 0;
-    g[f] = new Array(x).fill(0), g[f][0] = -j, g[f][1] = j, y[f] = (e == null ? void 0 : e[0]) ?? 0, _[f] = (e == null ? void 0 : e[1]) ?? 0, z[f] = (e == null ? void 0 : e[2]) ?? 0, f++;
-  }
-  if (o) {
-    const C = u[c + t + 1] - u[c], j = C !== 0 ? t / C : 0;
-    g[f] = new Array(x).fill(0), g[f][c - 1] = -j, g[f][c] = j, y[f] = (n == null ? void 0 : n[0]) ?? 0, _[f] = (n == null ? void 0 : n[1]) ?? 0, z[f] = (n == null ? void 0 : n[2]) ?? 0, f++;
-  }
-  const b = It(g, y), P = It(g, _), I = It(g, z), A = new Array(x);
-  for (let C = 0; C < x; C++)
-    A[C] = [b[C], P[C], I[C]];
-  const k = new Array(x).fill(1);
-  return { controlPoints: A, knots: u, weights: k };
-}
-function wt(m, t, s, e) {
-  if (t === 0)
-    return s >= e[m] && s < e[m + 1] ? 1 : 0;
-  const n = e[m + t] - e[m], i = e[m + t + 1] - e[m + 1], r = n > 1e-10 ? (s - e[m]) / n : 0, o = i > 1e-10 ? (e[m + t + 1] - s) / i : 0;
-  return r * wt(m, t - 1, s, e) + o * wt(m + 1, t - 1, s, e);
-}
-function ft(m, t, s, e, n) {
-  const i = e.length - 1, r = t;
-  if (m = Math.max(s[r], Math.min(s[i + 1], m)), Math.abs(m - s[i + 1]) < 1e-8)
-    return [...e[i]];
-  if (Math.abs(m - s[r]) < 1e-8)
-    return [...e[0]];
-  const o = [0, 0, 0];
-  let a = 0;
-  for (let h = 0; h <= i; h++) {
-    const c = wt(h, r, m, s), l = n[h] * c;
-    o[0] += e[h][0] * l, o[1] += e[h][1] * l, o[2] += e[h][2] * l, a += l;
-  }
-  if (Math.abs(a) < 1e-10) {
-    const h = s[s.length - r - 1];
-    if (Math.abs(m - h) < 1e-8)
-      return [...e[i]];
-    if (Math.abs(m - s[r]) < 1e-8)
-      return [...e[0]];
-  }
-  return Math.abs(a) >= 1e-10 && (o[0] /= a, o[1] /= a, o[2] /= a), o;
-}
-function bs(m, t, s, e) {
-  const n = m, i = t[n], r = t[t.length - n - 1];
-  let o = 0;
-  const a = 1e3, h = (r - i) / a;
-  let c = ft(
-    i,
-    m,
-    t,
-    s,
-    e
-  );
-  for (let g = 1; g <= a; g++) {
-    const y = i + g * h, _ = ft(y, m, t, s, e), z = _[0] - c[0], f = _[1] - c[1], b = _[2] - c[2];
-    o += Math.sqrt(z * z + f * f + b * b), c = _;
-  }
-  const l = ft(
-    r,
-    m,
-    t,
-    s,
-    e
-  ), d = l[0] - c[0], u = l[1] - c[1], x = l[2] - c[2];
-  return o += Math.sqrt(d * d + u * u + x * x), o;
-}
-function Vs(m, t = 3, s = "Uniform", e, n) {
-  return m.length === 0 ? [] : Ht(
-    m,
-    t,
-    s,
-    e,
-    n
-  ).controlPoints;
-}
+const Gt = new bt();
 class St {
   constructor(t = 0, s = 0, e = 0, n = 1) {
     this._x = t, this._y = s, this._z = e, this._w = n;
   }
   static slerpFlat(t, s, e, n, i, r, o) {
     let a = e[n + 0], h = e[n + 1], c = e[n + 2], l = e[n + 3];
-    const d = i[r + 0], u = i[r + 1], x = i[r + 2], g = i[r + 3];
+    const m = i[r + 0], d = i[r + 1], x = i[r + 2], g = i[r + 3];
     if (o === 0) {
       t[s + 0] = a, t[s + 1] = h, t[s + 2] = c, t[s + 3] = l;
       return;
     }
     if (o === 1) {
-      t[s + 0] = d, t[s + 1] = u, t[s + 2] = x, t[s + 3] = g;
+      t[s + 0] = m, t[s + 1] = d, t[s + 2] = x, t[s + 3] = g;
       return;
     }
-    if (l !== g || a !== d || h !== u || c !== x) {
+    if (l !== g || a !== m || h !== d || c !== x) {
       let y = 1 - o;
-      const _ = a * d + h * u + c * x + l * g, z = _ >= 0 ? 1 : -1, f = 1 - _ * _;
+      const p = a * m + h * d + c * x + l * g, z = p >= 0 ? 1 : -1, f = 1 - p * p;
       if (f > Number.EPSILON) {
-        const P = Math.sqrt(f), I = Math.atan2(P, _ * z);
+        const P = Math.sqrt(f), I = Math.atan2(P, p * z);
         y = Math.sin(y * I) / P, o = Math.sin(o * I) / P;
       }
       const b = o * z;
-      if (a = a * y + d * b, h = h * y + u * b, c = c * y + x * b, l = l * y + g * b, y === 1 - o) {
+      if (a = a * y + m * b, h = h * y + d * b, c = c * y + x * b, l = l * y + g * b, y === 1 - o) {
         const P = 1 / Math.sqrt(a * a + h * h + c * c + l * l);
         a *= P, h *= P, c *= P, l *= P;
       }
@@ -989,8 +760,8 @@ class St {
     t[s] = a, t[s + 1] = h, t[s + 2] = c, t[s + 3] = l;
   }
   static multiplyQuaternionsFlat(t, s, e, n, i, r) {
-    const o = e[n], a = e[n + 1], h = e[n + 2], c = e[n + 3], l = i[r], d = i[r + 1], u = i[r + 2], x = i[r + 3];
-    return t[s] = o * x + c * l + a * u - h * d, t[s + 1] = a * x + c * d + h * l - o * u, t[s + 2] = h * x + c * u + o * d - a * l, t[s + 3] = c * x - o * l - a * d - h * u, t;
+    const o = e[n], a = e[n + 1], h = e[n + 2], c = e[n + 3], l = i[r], m = i[r + 1], d = i[r + 2], x = i[r + 3];
+    return t[s] = o * x + c * l + a * d - h * m, t[s + 1] = a * x + c * m + h * l - o * d, t[s + 2] = h * x + c * d + o * m - a * l, t[s + 3] = c * x - o * l - a * m - h * d, t;
   }
   get x() {
     return this._x;
@@ -1026,25 +797,25 @@ class St {
     return this._x = t.x, this._y = t.y, this._z = t.z, this._w = t.w, this._onChangeCallback(), this;
   }
   setFromEuler(t, s = !0) {
-    const e = t.x, n = t.y, i = t.z, r = t.order, o = Math.cos, a = Math.sin, h = o(e / 2), c = o(n / 2), l = o(i / 2), d = a(e / 2), u = a(n / 2), x = a(i / 2);
+    const e = t.x, n = t.y, i = t.z, r = t.order, o = Math.cos, a = Math.sin, h = o(e / 2), c = o(n / 2), l = o(i / 2), m = a(e / 2), d = a(n / 2), x = a(i / 2);
     switch (r) {
       case "XYZ":
-        this._x = d * c * l + h * u * x, this._y = h * u * l - d * c * x, this._z = h * c * x + d * u * l, this._w = h * c * l - d * u * x;
+        this._x = m * c * l + h * d * x, this._y = h * d * l - m * c * x, this._z = h * c * x + m * d * l, this._w = h * c * l - m * d * x;
         break;
       case "YXZ":
-        this._x = d * c * l + h * u * x, this._y = h * u * l - d * c * x, this._z = h * c * x - d * u * l, this._w = h * c * l + d * u * x;
+        this._x = m * c * l + h * d * x, this._y = h * d * l - m * c * x, this._z = h * c * x - m * d * l, this._w = h * c * l + m * d * x;
         break;
       case "ZXY":
-        this._x = d * c * l - h * u * x, this._y = h * u * l + d * c * x, this._z = h * c * x + d * u * l, this._w = h * c * l - d * u * x;
+        this._x = m * c * l - h * d * x, this._y = h * d * l + m * c * x, this._z = h * c * x + m * d * l, this._w = h * c * l - m * d * x;
         break;
       case "ZYX":
-        this._x = d * c * l - h * u * x, this._y = h * u * l + d * c * x, this._z = h * c * x - d * u * l, this._w = h * c * l + d * u * x;
+        this._x = m * c * l - h * d * x, this._y = h * d * l + m * c * x, this._z = h * c * x - m * d * l, this._w = h * c * l + m * d * x;
         break;
       case "YZX":
-        this._x = d * c * l + h * u * x, this._y = h * u * l + d * c * x, this._z = h * c * x - d * u * l, this._w = h * c * l - d * u * x;
+        this._x = m * c * l + h * d * x, this._y = h * d * l + m * c * x, this._z = h * c * x - m * d * l, this._w = h * c * l - m * d * x;
         break;
       case "XZY":
-        this._x = d * c * l - h * u * x, this._y = h * u * l - d * c * x, this._z = h * c * x + d * u * l, this._w = h * c * l + d * u * x;
+        this._x = m * c * l - h * d * x, this._y = h * d * l - m * c * x, this._z = h * c * x + m * d * l, this._w = h * c * l + m * d * x;
         break;
     }
     return s === !0 && this._onChangeCallback(), this;
@@ -1054,19 +825,19 @@ class St {
     return this._x = t.x * n, this._y = t.y * n, this._z = t.z * n, this._w = Math.cos(e), this._onChangeCallback(), this;
   }
   setFromRotationMatrix(t) {
-    const s = t.elements, e = s[0], n = s[4], i = s[8], r = s[1], o = s[5], a = s[9], h = s[2], c = s[6], l = s[10], d = e + o + l;
-    if (d > 0) {
-      const u = 0.5 / Math.sqrt(d + 1);
-      this._w = 0.25 / u, this._x = (c - a) * u, this._y = (i - h) * u, this._z = (r - n) * u;
+    const s = t.elements, e = s[0], n = s[4], i = s[8], r = s[1], o = s[5], a = s[9], h = s[2], c = s[6], l = s[10], m = e + o + l;
+    if (m > 0) {
+      const d = 0.5 / Math.sqrt(m + 1);
+      this._w = 0.25 / d, this._x = (c - a) * d, this._y = (i - h) * d, this._z = (r - n) * d;
     } else if (e > o && e > l) {
-      const u = 2 * Math.sqrt(1 + e - o - l);
-      this._w = (c - a) / u, this._x = 0.25 * u, this._y = (n + r) / u, this._z = (i + h) / u;
+      const d = 2 * Math.sqrt(1 + e - o - l);
+      this._w = (c - a) / d, this._x = 0.25 * d, this._y = (n + r) / d, this._z = (i + h) / d;
     } else if (o > l) {
-      const u = 2 * Math.sqrt(1 + o - e - l);
-      this._w = (i - h) / u, this._x = (n + r) / u, this._y = 0.25 * u, this._z = (a + c) / u;
+      const d = 2 * Math.sqrt(1 + o - e - l);
+      this._w = (i - h) / d, this._x = (n + r) / d, this._y = 0.25 * d, this._z = (a + c) / d;
     } else {
-      const u = 2 * Math.sqrt(1 + l - e - o);
-      this._w = (r - n) / u, this._x = (i + h) / u, this._y = (a + c) / u, this._z = 0.25 * u;
+      const d = 2 * Math.sqrt(1 + l - e - o);
+      this._w = (r - n) / d, this._x = (i + h) / d, this._y = (a + c) / d, this._z = 0.25 * d;
     }
     return this._onChangeCallback(), this;
   }
@@ -1126,11 +897,11 @@ class St {
       return this._w = r, this._x = e, this._y = n, this._z = i, this;
     const a = 1 - o * o;
     if (a <= Number.EPSILON) {
-      const u = 1 - s;
-      return this._w = u * r + s * this._w, this._x = u * e + s * this._x, this._y = u * n + s * this._y, this._z = u * i + s * this._z, this.normalize(), this;
+      const d = 1 - s;
+      return this._w = d * r + s * this._w, this._x = d * e + s * this._x, this._y = d * n + s * this._y, this._z = d * i + s * this._z, this.normalize(), this;
     }
-    const h = Math.sqrt(a), c = Math.atan2(h, o), l = Math.sin((1 - s) * c) / h, d = Math.sin(s * c) / h;
-    return this._w = r * l + this._w * d, this._x = e * l + this._x * d, this._y = n * l + this._y * d, this._z = i * l + this._z * d, this._onChangeCallback(), this;
+    const h = Math.sqrt(a), c = Math.atan2(h, o), l = Math.sin((1 - s) * c) / h, m = Math.sin(s * c) / h;
+    return this._w = r * l + this._w * m, this._x = e * l + this._x * m, this._y = n * l + this._y * m, this._z = i * l + this._z * m, this._onChangeCallback(), this;
   }
   slerpQuaternions(t, s, e) {
     return this.copy(t).slerp(s, e);
@@ -1266,10 +1037,10 @@ const R = class R {
     return this.x = t.x * s.x, this.y = t.y * s.y, this.z = t.z * s.z, this;
   }
   applyEuler(t) {
-    return this.applyQuaternion(jt.setFromEuler(t));
+    return this.applyQuaternion(Vt.setFromEuler(t));
   }
   applyAxisAngle(t, s) {
-    return this.applyQuaternion(jt.setFromAxisAngle(t, s));
+    return this.applyQuaternion(Vt.setFromAxisAngle(t, s));
   }
   applyMatrix3(t) {
     const s = this.x, e = this.y, n = this.z, i = t.elements;
@@ -1371,10 +1142,10 @@ const R = class R {
     return this.copy(t).multiplyScalar(e);
   }
   projectOnPlane(t) {
-    return Bt.copy(this).projectOnVector(t), this.sub(Bt);
+    return It.copy(this).projectOnVector(t), this.sub(It);
   }
   reflect(t) {
-    return this.sub(Bt.copy(t).multiplyScalar(2 * this.dot(t)));
+    return this.sub(It.copy(t).multiplyScalar(2 * this.dot(t)));
   }
   angleTo(t) {
     const s = Math.sqrt(this.lengthSq() * t.lengthSq());
@@ -1427,10 +1198,10 @@ const R = class R {
   }
 };
 R.ORIGIN = Object.freeze(new R(0, 0, 0)), R.X_AXIS = Object.freeze(new R(1, 0, 0)), R.NEGATIVE_X_AXIS = Object.freeze(new R(-1, 0, 0)), R.Y_AXIS = Object.freeze(new R(0, 1, 0)), R.NEGATIVE_Y_AXIS = Object.freeze(new R(0, -1, 0)), R.Z_AXIS = Object.freeze(new R(0, 0, 1)), R.NEGATIVE_Z_AXIS = Object.freeze(new R(0, 0, -1));
-let p = R;
-const Bt = new p(), jt = new St(), et = class et {
-  constructor(t, s, e, n, i, r, o, a, h, c, l, d, u, x, g, 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 && r != null && o != null && a != null && h != null && c != null && l != null && d != null && u != null && x != null && g != null && y != null && this.set(
+let _ = R;
+const It = new _(), Vt = new St(), et = class et {
+  constructor(t, s, e, n, i, r, o, a, h, c, l, m, d, x, g, 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 && r != null && o != null && a != null && h != null && c != null && l != null && m != null && d != null && x != null && g != null && y != null && this.set(
       t,
       s,
       e,
@@ -1442,16 +1213,16 @@ const Bt = new p(), jt = new St(), et = class et {
       h,
       c,
       l,
+      m,
       d,
-      u,
       x,
       g,
       y
     );
   }
-  set(t, s, e, n, i, r, o, a, h, c, l, d, u, x, g, y) {
-    const _ = this.elements;
-    return _[0] = t, _[4] = s, _[8] = e, _[12] = n, _[1] = i, _[5] = r, _[9] = o, _[13] = a, _[2] = h, _[6] = c, _[10] = l, _[14] = d, _[3] = u, _[7] = x, _[11] = g, _[15] = y, this;
+  set(t, s, e, n, i, r, o, a, h, c, l, m, d, x, g, y) {
+    const p = this.elements;
+    return p[0] = t, p[4] = s, p[8] = e, p[12] = n, p[1] = i, p[5] = r, p[9] = o, p[13] = a, p[2] = h, p[6] = c, p[10] = l, p[14] = m, p[3] = d, p[7] = x, p[11] = g, p[15] = y, this;
   }
   identity() {
     return this.set(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1), this;
@@ -1489,11 +1260,11 @@ const Bt = new p(), jt = new St(), et = class et {
     ), this;
   }
   setFromExtrusionDirection(t) {
-    if ($t.equalPoint3d(t, p.Z_AXIS))
+    if (Gt.equalPoint3d(t, _.Z_AXIS))
       this.identity();
     else {
-      const s = new p(1, 0, 0);
-      Math.abs(t.x) < 1 / 64 && Math.abs(t.y) < 1 / 64 ? s.crossVectors(p.Y_AXIS, t).normalize() : s.crossVectors(p.Z_AXIS, t).normalize();
+      const s = new _(1, 0, 0);
+      Math.abs(t.x) < 1 / 64 && Math.abs(t.y) < 1 / 64 ? s.crossVectors(_.Y_AXIS, t).normalize() : s.crossVectors(_.Z_AXIS, t).normalize();
       const e = t.clone().cross(s).normalize();
       this.set(
         s.x,
@@ -1540,7 +1311,7 @@ const Bt = new p(), jt = new St(), et = class et {
     ), this;
   }
   extractRotation(t) {
-    const s = this.elements, e = t.elements, n = 1 / H.setFromMatrixColumn(t, 0).length(), i = 1 / H.setFromMatrixColumn(t, 1).length(), r = 1 / H.setFromMatrixColumn(t, 2).length();
+    const s = this.elements, e = t.elements, n = 1 / J.setFromMatrixColumn(t, 0).length(), i = 1 / J.setFromMatrixColumn(t, 1).length(), r = 1 / J.setFromMatrixColumn(t, 2).length();
     return s[0] = e[0] * n, s[1] = e[1] * n, s[2] = e[2] * n, s[3] = 0, s[4] = e[4] * i, s[5] = e[5] * i, s[6] = e[6] * i, s[7] = 0, s[8] = e[8] * r, s[9] = e[9] * r, s[10] = e[10] * r, s[11] = 0, s[12] = 0, s[13] = 0, s[14] = 0, s[15] = 1, this;
   }
   makeRotationFromQuaternion(t) {
@@ -1557,16 +1328,16 @@ const Bt = new p(), jt = new St(), et = class et {
     return this.multiplyMatrices(t, this);
   }
   multiplyMatrices(t, s) {
-    const e = t.elements, n = s.elements, i = this.elements, r = e[0], o = e[4], a = e[8], h = e[12], c = e[1], l = e[5], d = e[9], u = e[13], x = e[2], g = e[6], y = e[10], _ = e[14], z = e[3], f = e[7], b = e[11], P = e[15], I = n[0], A = n[4], k = n[8], C = n[12], j = n[1], q = n[5], $ = n[9], ht = n[13], at = n[2], ct = n[6], lt = n[10], ut = n[14], dt = n[3], mt = n[7], xt = n[11], gt = n[15];
-    return i[0] = r * I + o * j + a * at + h * dt, i[4] = r * A + o * q + a * ct + h * mt, i[8] = r * k + o * $ + a * lt + h * xt, i[12] = r * C + o * ht + a * ut + h * gt, i[1] = c * I + l * j + d * at + u * dt, i[5] = c * A + l * q + d * ct + u * mt, i[9] = c * k + l * $ + d * lt + u * xt, i[13] = c * C + l * ht + d * ut + u * gt, i[2] = x * I + g * j + y * at + _ * dt, i[6] = x * A + g * q + y * ct + _ * mt, i[10] = x * k + g * $ + y * lt + _ * xt, i[14] = x * C + g * ht + y * ut + _ * gt, i[3] = z * I + f * j + b * at + P * dt, i[7] = z * A + f * q + b * ct + P * mt, i[11] = z * k + f * $ + b * lt + P * xt, i[15] = z * C + f * ht + b * ut + P * gt, this;
+    const e = t.elements, n = s.elements, i = this.elements, r = e[0], o = e[4], a = e[8], h = e[12], c = e[1], l = e[5], m = e[9], d = e[13], x = e[2], g = e[6], y = e[10], p = e[14], z = e[3], f = e[7], b = e[11], P = e[15], I = n[0], A = n[4], k = n[8], C = n[12], j = n[1], q = n[5], W = n[9], ht = n[13], at = n[2], ct = n[6], lt = n[10], ut = n[14], dt = n[3], mt = n[7], xt = n[11], gt = n[15];
+    return i[0] = r * I + o * j + a * at + h * dt, i[4] = r * A + o * q + a * ct + h * mt, i[8] = r * k + o * W + a * lt + h * xt, i[12] = r * C + o * ht + a * ut + h * gt, i[1] = c * I + l * j + m * at + d * dt, i[5] = c * A + l * q + m * ct + d * mt, i[9] = c * k + l * W + m * lt + d * xt, i[13] = c * C + l * ht + m * ut + d * gt, i[2] = x * I + g * j + y * at + p * dt, i[6] = x * A + g * q + y * ct + p * mt, i[10] = x * k + g * W + y * lt + p * xt, i[14] = x * C + g * ht + y * ut + p * gt, i[3] = z * I + f * j + b * at + P * dt, i[7] = z * A + f * q + b * ct + P * mt, i[11] = z * k + f * W + b * lt + P * xt, i[15] = z * C + f * ht + b * ut + P * gt, this;
   }
   multiplyScalar(t) {
     const s = this.elements;
     return s[0] *= t, s[4] *= t, s[8] *= t, s[12] *= t, s[1] *= t, s[5] *= t, s[9] *= t, s[13] *= t, s[2] *= t, s[6] *= t, s[10] *= t, s[14] *= t, s[3] *= t, s[7] *= t, s[11] *= t, s[15] *= t, this;
   }
   determinant() {
-    const t = this.elements, s = t[0], e = t[4], n = t[8], i = t[12], r = t[1], o = t[5], a = t[9], h = t[13], c = t[2], l = t[6], d = t[10], u = t[14], x = t[3], g = t[7], y = t[11], _ = t[15];
-    return x * (+i * a * l - n * h * l - i * o * d + e * h * d + n * o * u - e * a * u) + g * (+s * a * u - s * h * d + i * r * d - n * r * u + n * h * c - i * a * c) + y * (+s * h * l - s * o * u - i * r * l + e * r * u + i * o * c - e * h * c) + _ * (-n * o * c - s * a * l + s * o * d + n * r * l - e * r * d + e * a * c);
+    const t = this.elements, s = t[0], e = t[4], n = t[8], i = t[12], r = t[1], o = t[5], a = t[9], h = t[13], c = t[2], l = t[6], m = t[10], d = t[14], x = t[3], g = t[7], y = t[11], p = t[15];
+    return x * (+i * a * l - n * h * l - i * o * m + e * h * m + n * o * d - e * a * d) + g * (+s * a * d - s * h * m + i * r * m - n * r * d + n * h * c - i * a * c) + y * (+s * h * l - s * o * d - i * r * l + e * r * d + i * o * c - e * h * c) + p * (-n * o * c - s * a * l + s * o * m + n * r * l - e * r * m + e * a * c);
   }
   transpose() {
     const t = this.elements;
@@ -1575,14 +1346,14 @@ const Bt = new p(), jt = new St(), et = class et {
   }
   setPosition(t, s, e) {
     const n = this.elements;
-    return t instanceof p ? (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 _ ? (n[12] = t.x, n[13] = t.y, n[14] = t.z) : (n[12] = t, n[13] = s, n[14] = e), this;
   }
   invert() {
-    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], o = t[5], a = t[6], h = t[7], c = t[8], l = t[9], d = t[10], u = t[11], x = t[12], g = t[13], y = t[14], _ = t[15], z = l * y * h - g * d * h + g * a * u - o * y * u - l * a * _ + o * d * _, f = x * d * h - c * y * h - x * a * u + r * y * u + c * a * _ - r * d * _, b = c * g * h - x * l * h + x * o * u - r * g * u - c * o * _ + r * l * _, P = x * l * a - c * g * a - x * o * d + r * g * d + c * o * y - r * l * y, I = s * z + e * f + n * b + i * P;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], o = t[5], a = t[6], h = t[7], c = t[8], l = t[9], m = t[10], d = t[11], x = t[12], g = t[13], y = t[14], p = t[15], z = l * y * h - g * m * h + g * a * d - o * y * d - l * a * p + o * m * p, f = x * m * h - c * y * h - x * a * d + r * y * d + c * a * p - r * m * p, b = c * g * h - x * l * h + x * o * d - r * g * d - c * o * p + r * l * p, P = x * l * a - c * g * a - x * o * m + r * g * m + c * o * y - r * l * y, I = s * z + e * f + n * b + i * P;
     if (I === 0)
       return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
     const A = 1 / I;
-    return t[0] = z * A, t[1] = (g * d * i - l * y * i - g * n * u + e * y * u + l * n * _ - e * d * _) * A, t[2] = (o * y * i - g * a * i + g * n * h - e * y * h - o * n * _ + e * a * _) * A, t[3] = (l * a * i - o * d * i - l * n * h + e * d * h + o * n * u - e * a * u) * A, t[4] = f * A, t[5] = (c * y * i - x * d * i + x * n * u - s * y * u - c * n * _ + s * d * _) * A, t[6] = (x * a * i - r * y * i - x * n * h + s * y * h + r * n * _ - s * a * _) * A, t[7] = (r * d * i - c * a * i + c * n * h - s * d * h - r * n * u + s * a * u) * A, t[8] = b * A, t[9] = (x * l * i - c * g * i - x * e * u + s * g * u + c * e * _ - s * l * _) * A, t[10] = (r * g * i - x * o * i + x * e * h - s * g * h - r * e * _ + s * o * _) * A, t[11] = (c * o * i - r * l * i - c * e * h + s * l * h + r * e * u - s * o * u) * A, t[12] = P * A, t[13] = (c * g * n - x * l * n + x * e * d - s * g * d - c * e * y + s * l * y) * A, t[14] = (x * o * n - r * g * n - x * e * a + s * g * a + r * e * y - s * o * y) * A, t[15] = (r * l * n - c * o * n + c * e * a - s * l * a - r * e * d + s * o * d) * A, this;
+    return t[0] = z * A, t[1] = (g * m * i - l * y * i - g * n * d + e * y * d + l * n * p - e * m * p) * A, t[2] = (o * y * i - g * a * i + g * n * h - e * y * h - o * n * p + e * a * p) * A, t[3] = (l * a * i - o * m * i - l * n * h + e * m * h + o * n * d - e * a * d) * A, t[4] = f * A, t[5] = (c * y * i - x * m * i + x * n * d - s * y * d - c * n * p + s * m * p) * A, t[6] = (x * a * i - r * y * i - x * n * h + s * y * h + r * n * p - s * a * p) * A, t[7] = (r * m * i - c * a * i + c * n * h - s * m * h - r * n * d + s * a * d) * A, t[8] = b * A, t[9] = (x * l * i - c * g * i - x * e * d + s * g * d + c * e * p - s * l * p) * A, t[10] = (r * g * i - x * o * i + x * e * h - s * g * h - r * e * p + s * o * p) * A, t[11] = (c * o * i - r * l * i - c * e * h + s * l * h + r * e * d - s * o * d) * A, t[12] = P * A, t[13] = (c * g * n - x * l * n + x * e * m - s * g * m - c * e * y + s * l * y) * A, t[14] = (x * o * n - r * g * n - x * e * a + s * g * a + r * e * y - s * o * y) * A, t[15] = (r * l * n - c * o * n + c * e * a - s * l * a - r * e * m + s * o * m) * A, this;
   }
   scale(t) {
     const s = this.elements, e = t.x, n = t.y, i = t.z;
@@ -1593,7 +1364,7 @@ const Bt = new p(), jt = new St(), et = class et {
     return Math.sqrt(Math.max(s, e, n));
   }
   makeTranslation(t, s, e) {
-    return t instanceof p ? 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 _ ? 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;
   }
   makeRotationX(t) {
     const s = Math.cos(t), e = Math.sin(t);
@@ -1635,13 +1406,13 @@ const Bt = new p(), jt = new St(), et = class et {
     return this.set(1, e, i, 0, t, 1, r, 0, s, n, 1, 0, 0, 0, 0, 1), this;
   }
   compose(t, s, e) {
-    const n = this.elements, i = s.x, r = s.y, o = s.z, a = s.w, h = i + i, c = r + r, l = o + o, d = i * h, u = i * c, x = i * l, g = r * c, y = r * l, _ = o * l, z = a * h, f = a * c, b = a * l, P = e.x, I = e.y, A = e.z;
-    return n[0] = (1 - (g + _)) * P, n[1] = (u + b) * P, n[2] = (x - f) * P, n[3] = 0, n[4] = (u - b) * I, n[5] = (1 - (d + _)) * I, n[6] = (y + z) * I, n[7] = 0, n[8] = (x + f) * A, n[9] = (y - z) * A, n[10] = (1 - (d + g)) * A, n[11] = 0, n[12] = t.x, n[13] = t.y, n[14] = t.z, n[15] = 1, this;
+    const n = this.elements, i = s.x, r = s.y, o = s.z, a = s.w, h = i + i, c = r + r, l = o + o, m = i * h, d = i * c, x = i * l, g = r * c, y = r * l, p = o * l, z = a * h, f = a * c, b = a * l, P = e.x, I = e.y, A = e.z;
+    return n[0] = (1 - (g + p)) * P, n[1] = (d + b) * P, n[2] = (x - f) * P, n[3] = 0, n[4] = (d - b) * I, n[5] = (1 - (m + p)) * I, n[6] = (y + z) * I, n[7] = 0, n[8] = (x + f) * A, n[9] = (y - z) * A, n[10] = (1 - (m + g)) * A, n[11] = 0, n[12] = t.x, n[13] = t.y, n[14] = t.z, n[15] = 1, this;
   }
   decompose(t, s, e) {
     const n = this.elements;
-    let i = H.set(n[0], n[1], n[2]).length();
-    const r = H.set(n[4], n[5], n[6]).length(), o = H.set(n[8], n[9], n[10]).length();
+    let i = J.set(n[0], n[1], n[2]).length();
+    const r = J.set(n[4], n[5], n[6]).length(), o = J.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], L.copy(this);
     const h = 1 / i, c = 1 / r, l = 1 / o;
     return L.elements[0] *= h, L.elements[1] *= h, L.elements[2] *= h, L.elements[4] *= c, L.elements[5] *= c, L.elements[6] *= c, L.elements[8] *= l, L.elements[9] *= l, L.elements[10] *= l, s.setFromRotationMatrix(L), e.x = i, e.y = r, e.z = o, this;
@@ -1663,11 +1434,11 @@ const Bt = new p(), jt = new St(), et = class et {
   }
 };
 et.IDENTITY = Object.freeze(new et());
-let G = et;
-const H = new p(), L = new G(), Ss = new p(0, 0, 0), Cs = new p(1, 1, 1), Y = new p(), yt = new p(), V = new p();
-class D {
+let O = et;
+const J = new _(), L = new O(), Ss = new _(0, 0, 0), Cs = new _(1, 1, 1), Y = new _(), yt = new _(), V = new _();
+class v {
   constructor(t = void 0, s = void 0) {
-    this.min = t == null ? new p(1 / 0, 1 / 0, 1 / 0) : new p(t.x, t.y, t.z), this.max = s == null ? new p(-1 / 0, -1 / 0, -1 / 0) : new p(s.x, s.y, s.z);
+    this.min = t == null ? new _(1 / 0, 1 / 0, 1 / 0) : new _(t.x, t.y, t.z), this.max = s == null ? new _(-1 / 0, -1 / 0, -1 / 0) : new _(s.x, s.y, s.z);
   }
   set(t, s) {
     return this.min.copy(t), this.max.copy(s), this;
@@ -1675,7 +1446,7 @@ class D {
   setFromArray(t) {
     this.makeEmpty();
     for (let s = 0, e = t.length; s < e; s += 3)
-      this.expandByPoint(kt.fromArray(t, s));
+      this.expandByPoint(Bt.fromArray(t, s));
     return this;
   }
   setFromPoints(t) {
@@ -1685,11 +1456,11 @@ class D {
     return this;
   }
   setFromCenterAndSize(t, s) {
-    const e = kt.copy(s).multiplyScalar(0.5);
+    const e = Bt.copy(s).multiplyScalar(0.5);
     return this.min.copy(t).sub(e), this.max.copy(t).add(e), this;
   }
   clone() {
-    return new D().copy(this);
+    return new v().copy(this);
   }
   copy(t) {
     return this.min.copy(t.min), this.max.copy(t.max), this;
@@ -1707,10 +1478,10 @@ class D {
     return this.isEmpty() ? t.set(0, 0, 0) : t.subVectors(this.max, this.min);
   }
   get center() {
-    return this.isEmpty() ? new p(0, 0, 0) : new p(0, 0, 0).addVectors(this.min, this.max).multiplyScalar(0.5);
+    return this.isEmpty() ? new _(0, 0, 0) : new _(0, 0, 0).addVectors(this.min, this.max).multiplyScalar(0.5);
   }
   get size() {
-    return this.isEmpty() ? new p(0, 0, 0) : new p(0, 0, 0).subVectors(this.max, this.min);
+    return this.isEmpty() ? new _(0, 0, 0) : new _(0, 0, 0).subVectors(this.max, this.min);
   }
   expandByPoint(t) {
     return this.min.min(t), this.max.max(t), this;
@@ -1745,7 +1516,7 @@ class D {
     return s.copy(t).clamp(this.min, this.max);
   }
   distanceToPoint(t) {
-    return this.clampPoint(t, kt).distanceTo(t);
+    return this.clampPoint(t, Bt).distanceTo(t);
   }
   intersect(t) {
     return this.min.max(t.min), this.max.min(t.max), this.isEmpty() && this.makeEmpty(), this;
@@ -1754,7 +1525,7 @@ class D {
     return this.min.min(t.min), this.max.max(t.max), this;
   }
   applyMatrix4(t) {
-    return this.isEmpty() ? this : (v[0].set(this.min.x, this.min.y, this.min.z).applyMatrix4(t), v[1].set(this.min.x, this.min.y, this.max.z).applyMatrix4(t), v[2].set(this.min.x, this.max.y, this.min.z).applyMatrix4(t), v[3].set(this.min.x, this.max.y, this.max.z).applyMatrix4(t), v[4].set(this.max.x, this.min.y, this.min.z).applyMatrix4(t), v[5].set(this.max.x, this.min.y, this.max.z).applyMatrix4(t), v[6].set(this.max.x, this.max.y, this.min.z).applyMatrix4(t), v[7].set(this.max.x, this.max.y, this.max.z).applyMatrix4(t), this.setFromPoints(v), this);
+    return this.isEmpty() ? this : (D[0].set(this.min.x, this.min.y, this.min.z).applyMatrix4(t), D[1].set(this.min.x, this.min.y, this.max.z).applyMatrix4(t), D[2].set(this.min.x, this.max.y, this.min.z).applyMatrix4(t), D[3].set(this.min.x, this.max.y, this.max.z).applyMatrix4(t), D[4].set(this.max.x, this.min.y, this.min.z).applyMatrix4(t), D[5].set(this.max.x, this.min.y, this.max.z).applyMatrix4(t), D[6].set(this.max.x, this.max.y, this.min.z).applyMatrix4(t), D[7].set(this.max.x, this.max.y, this.max.z).applyMatrix4(t), this.setFromPoints(D), this);
   }
   translate(t) {
     return this.min.add(t), this.max.add(t), this;
@@ -1763,16 +1534,16 @@ class D {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const v = [
-  new p(),
-  new p(),
-  new p(),
-  new p(),
-  new p(),
-  new p(),
-  new p(),
-  new p()
-], kt = new p(), Vt = new B();
+const D = [
+  new _(),
+  new _(),
+  new _(),
+  new _(),
+  new _(),
+  new _(),
+  new _(),
+  new _()
+], Bt = new _(), qt = new B();
 class X {
   constructor(t = void 0, s = void 0) {
     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);
@@ -1787,7 +1558,7 @@ class X {
     return this;
   }
   setFromCenterAndSize(t, s) {
-    const e = Vt.copy(s).multiplyScalar(0.5);
+    const e = qt.copy(s).multiplyScalar(0.5);
     return this.min.copy(t).sub(e), this.max.copy(t).add(e), this;
   }
   clone() {
@@ -1842,7 +1613,7 @@ class X {
     return s.copy(t).clamp(this.min, this.max);
   }
   distanceToPoint(t) {
-    return this.clampPoint(t, Vt).distanceTo(t);
+    return this.clampPoint(t, qt).distanceTo(t);
   }
   intersect(t) {
     return this.min.max(t.min), this.max.min(t.max), this.isEmpty() && this.makeEmpty(), this;
@@ -1857,9 +1628,9 @@ class X {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const qt = new p(), Es = new p(), Is = new it();
+const Ut = new _(), Es = new _(), Is = new it();
 class Ct {
-  constructor(t = new p(1, 0, 0), s = 0) {
+  constructor(t = new _(1, 0, 0), s = 0) {
     this.normal = t, this.constant = s;
   }
   set(t, s) {
@@ -1872,7 +1643,7 @@ class Ct {
     return this.normal.copy(t), this.constant = -s.dot(this.normal), this;
   }
   setFromCoplanarPoints(t, s, e) {
-    const n = qt.subVectors(e, s).cross(Es.subVectors(t, s)).normalize();
+    const n = Ut.subVectors(e, s).cross(Es.subVectors(t, s)).normalize();
     return this.setFromNormalAndCoplanarPoint(n, t), this;
   }
   copy(t) {
@@ -1898,7 +1669,7 @@ class Ct {
     return t.copy(this.normal).multiplyScalar(-this.constant);
   }
   applyMatrix4(t, s) {
-    const e = s || Is.getNormalMatrix(t), n = this.coplanarPoint(qt).applyMatrix4(t), i = this.normal.applyMatrix3(e).normalize();
+    const e = s || Is.getNormalMatrix(t), n = this.coplanarPoint(Ut).applyMatrix4(t), i = this.normal.applyMatrix3(e).normalize();
     return this.constant = -n.dot(i), this;
   }
   translate(t) {
@@ -1922,7 +1693,7 @@ class S extends B {
     }), s;
   }
 }
-class w extends p {
+class w extends _ {
   clone() {
     return new w(this.x, this.y, this.z);
   }
@@ -1933,7 +1704,7 @@ class w extends p {
     }), n;
   }
 }
-const Ut = new G(), Lt = new St(), nt = class nt {
+const Lt = new O(), Ft = new St(), nt = class nt {
   constructor(t = 0, s = 0, e = 0, n = nt.DEFAULT_ORDER) {
     this._x = t, this._y = s, this._z = e, this._order = n;
   }
@@ -1971,37 +1742,37 @@ const Ut = new G(), Lt = new St(), nt = class nt {
     return this._x = t._x, this._y = t._y, this._z = t._z, this._order = t._order, this._onChangeCallback(), this;
   }
   setFromRotationMatrix(t, s = this._order, e = !0) {
-    const n = t.elements, i = n[0], r = n[4], o = n[8], a = n[1], h = n[5], c = n[9], l = n[2], d = n[6], u = n[10];
+    const n = t.elements, i = n[0], r = n[4], o = n[8], a = n[1], h = n[5], c = n[9], l = n[2], m = n[6], d = n[10];
     switch (s) {
       case "XYZ":
-        this._y = Math.asin(Z(o, -1, 1)), Math.abs(o) < 0.9999999 ? (this._x = Math.atan2(-c, u), this._z = Math.atan2(-r, i)) : (this._x = Math.atan2(d, h), this._z = 0);
+        this._y = Math.asin(Z(o, -1, 1)), Math.abs(o) < 0.9999999 ? (this._x = Math.atan2(-c, d), this._z = Math.atan2(-r, i)) : (this._x = Math.atan2(m, h), this._z = 0);
         break;
       case "YXZ":
-        this._x = Math.asin(-Z(c, -1, 1)), Math.abs(c) < 0.9999999 ? (this._y = Math.atan2(o, u), this._z = Math.atan2(a, h)) : (this._y = Math.atan2(-l, i), this._z = 0);
+        this._x = Math.asin(-Z(c, -1, 1)), Math.abs(c) < 0.9999999 ? (this._y = Math.atan2(o, d), this._z = Math.atan2(a, h)) : (this._y = Math.atan2(-l, i), this._z = 0);
         break;
       case "ZXY":
-        this._x = Math.asin(Z(d, -1, 1)), Math.abs(d) < 0.9999999 ? (this._y = Math.atan2(-l, u), this._z = Math.atan2(-r, h)) : (this._y = 0, this._z = Math.atan2(a, i));
+        this._x = Math.asin(Z(m, -1, 1)), Math.abs(m) < 0.9999999 ? (this._y = Math.atan2(-l, d), this._z = Math.atan2(-r, h)) : (this._y = 0, this._z = Math.atan2(a, i));
         break;
       case "ZYX":
-        this._y = Math.asin(-Z(l, -1, 1)), Math.abs(l) < 0.9999999 ? (this._x = Math.atan2(d, u), this._z = Math.atan2(a, i)) : (this._x = 0, this._z = Math.atan2(-r, h));
+        this._y = Math.asin(-Z(l, -1, 1)), Math.abs(l) < 0.9999999 ? (this._x = Math.atan2(m, d), this._z = Math.atan2(a, i)) : (this._x = 0, this._z = Math.atan2(-r, h));
         break;
       case "YZX":
-        this._z = Math.asin(Z(a, -1, 1)), Math.abs(a) < 0.9999999 ? (this._x = Math.atan2(-c, h), this._y = Math.atan2(-l, i)) : (this._x = 0, this._y = Math.atan2(o, u));
+        this._z = Math.asin(Z(a, -1, 1)), Math.abs(a) < 0.9999999 ? (this._x = Math.atan2(-c, h), this._y = Math.atan2(-l, i)) : (this._x = 0, this._y = Math.atan2(o, d));
         break;
       case "XZY":
-        this._z = Math.asin(-Z(r, -1, 1)), Math.abs(r) < 0.9999999 ? (this._x = Math.atan2(d, h), this._y = Math.atan2(o, i)) : (this._x = Math.atan2(-c, u), this._y = 0);
+        this._z = Math.asin(-Z(r, -1, 1)), Math.abs(r) < 0.9999999 ? (this._x = Math.atan2(m, h), this._y = Math.atan2(o, i)) : (this._x = Math.atan2(-c, d), this._y = 0);
         break;
     }
     return this._order = s, e === !0 && this._onChangeCallback(), this;
   }
   setFromQuaternion(t, s, e = !0) {
-    return Ut.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Ut, s, e);
+    return Lt.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Lt, s, e);
   }
   setFromVector3(t, s = this._order) {
     return this.set(t.x, t.y, t.z, s);
   }
   reorder(t) {
-    return Lt.setFromEuler(this), this.setFromQuaternion(Lt, t);
+    return Ft.setFromEuler(this), this.setFromQuaternion(Ft, t);
   }
   equals(t) {
     return t._x === this._x && t._y === this._y && t._z === this._z && t._order === this._order;
@@ -2022,8 +1793,266 @@ const Ut = new G(), Lt = new St(), nt = class nt {
   }
 };
 nt.DEFAULT_ORDER = "XYZ";
-let Ft = nt;
-class Jt {
+let Xt = nt;
+function ts(u, t, s = !1) {
+  const e = u.x, n = u.y;
+  let i = !1;
+  const r = t.length;
+  for (let o = 0, a = r - 1; o < r; a = o++) {
+    const h = t[o].x, c = t[o].y, l = t[a].x, m = t[a].y;
+    let d = c > n != m > n;
+    s && (d = c >= n != m >= n), d && e < (l - h) * (n - c) / (m - c) + h && (i = !i);
+  }
+  return i;
+}
+function Bs(u, t) {
+  if (u.length === 0 || t.length === 0)
+    return !1;
+  const s = new X().setFromPoints(u), e = new X().setFromPoints(t);
+  if (!s.intersectsBox(e))
+    return !1;
+  for (let n = 0; n < u.length; ) {
+    if (ts(u[n], t, !0))
+      return !0;
+    n < u.length - 1 && Gt.equalPoint2d(u[n + 1], u[n]) && ++n, ++n;
+  }
+  return !1;
+}
+const ks = {
+  isPointInPolygon: ts,
+  isPolygonIntersect: Bs
+};
+function Fs(u, t) {
+  const s = [], e = t - 1, n = u;
+  for (let i = 0; i <= n; i++)
+    s.push(0);
+  for (let i = 1; i <= e - n; i++)
+    s.push(i);
+  for (let i = 0; i <= n; i++)
+    s.push(e - n + 1);
+  return s;
+}
+function Xs(u, t) {
+  const s = t.length - 1, e = u, n = [0];
+  let i = 0;
+  for (let o = 1; o <= s; o++) {
+    const a = t[o][0] - t[o - 1][0], h = t[o][1] - t[o - 1][1], c = t[o][2] - t[o - 1][2], l = Math.sqrt(a * a + h * h + c * c);
+    i += l, n.push(i);
+  }
+  const r = [];
+  for (let o = 0; o <= e; o++)
+    r.push(0);
+  for (let o = 1; o <= s - e; o++) {
+    const a = n[o] / i;
+    r.push(a * (s - e + 1));
+  }
+  for (let o = 0; o <= e; o++)
+    r.push(s - e + 1);
+  return r;
+}
+function Rs(u, t = "Uniform") {
+  const s = u.length;
+  if (s === 0)
+    return [];
+  if (s === 1)
+    return [0];
+  const e = s - 1;
+  if (t === "Uniform")
+    return new Array(s).fill(0).map((r, o) => o / e);
+  const n = [0];
+  let i = 0;
+  for (let r = 1; r <= e; r++) {
+    const o = u[r][0] - u[r - 1][0], a = u[r][1] - u[r - 1][1], h = u[r][2] - u[r - 1][2], c = Math.sqrt(o * o + a * a + h * h), l = t === "SqrtChord" ? Math.sqrt(c) : c;
+    i += l, n.push(i);
+  }
+  return i < 1e-12 ? new Array(s).fill(0).map((r, o) => o / e) : n.map((r) => r / i);
+}
+function Ns(u, t) {
+  const s = t.length - 1, e = u, n = s + e + 1, i = new Array(n + 1).fill(0), r = t[t.length - 1];
+  for (let o = n - e; o <= n; o++)
+    i[o] = r;
+  for (let o = 1; o <= s - e; o++) {
+    let a = 0;
+    for (let h = o; h < o + e; h++)
+      a += t[h];
+    i[o + e] = a / e;
+  }
+  return i;
+}
+function Ds(u, t) {
+  const s = t.length - 1, e = u, n = [0];
+  let i = 0;
+  for (let o = 1; o <= s; o++) {
+    const a = t[o][0] - t[o - 1][0], h = t[o][1] - t[o - 1][1], c = t[o][2] - t[o - 1][2], l = Math.sqrt(a * a + h * h + c * c), m = Math.sqrt(l);
+    i += m, n.push(i);
+  }
+  const r = [];
+  for (let o = 0; o <= e; o++)
+    r.push(0);
+  for (let o = 1; o <= s - e; o++) {
+    const a = n[o] / i;
+    r.push(a * (s - e + 1));
+  }
+  for (let o = 0; o <= e; o++)
+    r.push(s - e + 1);
+  return r;
+}
+function kt(u, t) {
+  const s = u.length, e = u.map((r) => r.slice()), n = t.slice();
+  for (let r = 0; r < s; r++) {
+    let o = r, a = Math.abs(e[r][r]);
+    for (let h = r + 1; h < s; h++) {
+      const c = Math.abs(e[h][r]);
+      c > a && (a = c, o = h);
+    }
+    if (a < 1e-12)
+      throw new Error("Interpolation matrix is singular.");
+    if (o !== r) {
+      const h = e[r];
+      e[r] = e[o], e[o] = h;
+      const c = n[r];
+      n[r] = n[o], n[o] = c;
+    }
+    for (let h = r + 1; h < s; h++) {
+      const c = e[h][r] / e[r][r];
+      if (!(Math.abs(c) < 1e-14)) {
+        for (let l = r; l < s; l++)
+          e[h][l] -= c * e[r][l];
+        n[h] -= c * n[r];
+      }
+    }
+  }
+  const i = new Array(s).fill(0);
+  for (let r = s - 1; r >= 0; r--) {
+    let o = n[r];
+    for (let a = r + 1; a < s; a++)
+      o -= e[r][a] * i[a];
+    i[r] = o / e[r][r];
+  }
+  return i;
+}
+function ss(u, t, s = "Uniform", e, n) {
+  if (u.length === 0)
+    return { controlPoints: [], knots: [], weights: [] };
+  const i = u.map((C) => [C[0], C[1], C[2] ?? 0]), r = !!e, o = !!n, a = (r ? 1 : 0) + (o ? 1 : 0), h = i.length - 1, c = h + a;
+  if (c < t)
+    throw new Error("Not enough points to interpolate a curve of this degree.");
+  const l = Rs(i, s), m = l.slice();
+  r && m.unshift(l[0]), o && m.push(l[l.length - 1]);
+  const d = Ns(t, m), x = c + 1, g = new Array(x), y = new Array(x), p = new Array(x), z = new Array(x);
+  let f = 0;
+  g[f] = new Array(x).fill(0), g[f][0] = 1, y[f] = i[0][0], p[f] = i[0][1], z[f] = i[0][2], f++;
+  for (let C = 1; C <= h - 1; C++) {
+    const j = l[C];
+    g[f] = new Array(x).fill(0);
+    for (let q = 0; q <= c; q++)
+      g[f][q] = zt(q, t, j, d);
+    y[f] = i[C][0], p[f] = i[C][1], z[f] = i[C][2], f++;
+  }
+  if (g[f] = new Array(x).fill(0), g[f][c] = 1, y[f] = i[h][0], p[f] = i[h][1], z[f] = i[h][2], f++, r) {
+    const C = d[t + 1] - d[0], j = C !== 0 ? t / C : 0;
+    g[f] = new Array(x).fill(0), g[f][0] = -j, g[f][1] = j, y[f] = (e == null ? void 0 : e[0]) ?? 0, p[f] = (e == null ? void 0 : e[1]) ?? 0, z[f] = (e == null ? void 0 : e[2]) ?? 0, f++;
+  }
+  if (o) {
+    const C = d[c + t + 1] - d[c], j = C !== 0 ? t / C : 0;
+    g[f] = new Array(x).fill(0), g[f][c - 1] = -j, g[f][c] = j, y[f] = (n == null ? void 0 : n[0]) ?? 0, p[f] = (n == null ? void 0 : n[1]) ?? 0, z[f] = (n == null ? void 0 : n[2]) ?? 0, f++;
+  }
+  const b = kt(g, y), P = kt(g, p), I = kt(g, z), A = new Array(x);
+  for (let C = 0; C < x; C++)
+    A[C] = [b[C], P[C], I[C]];
+  const k = new Array(x).fill(1);
+  return { controlPoints: A, knots: d, weights: k };
+}
+function zt(u, t, s, e) {
+  if (t === 0)
+    return s >= e[u] && s < e[u + 1] ? 1 : 0;
+  const n = e[u + t] - e[u], i = e[u + t + 1] - e[u + 1], r = n > 1e-10 ? (s - e[u]) / n : 0, o = i > 1e-10 ? (e[u + t + 1] - s) / i : 0;
+  return r * zt(u, t - 1, s, e) + o * zt(u + 1, t - 1, s, e);
+}
+function ft(u, t, s, e, n) {
+  const i = e.length - 1, r = t;
+  if (u = Math.max(s[r], Math.min(s[i + 1], u)), Math.abs(u - s[i + 1]) < 1e-8)
+    return [...e[i]];
+  if (Math.abs(u - s[r]) < 1e-8)
+    return [...e[0]];
+  const o = [0, 0, 0];
+  let a = 0;
+  for (let h = 0; h <= i; h++) {
+    const c = zt(h, r, u, s), l = n[h] * c;
+    o[0] += e[h][0] * l, o[1] += e[h][1] * l, o[2] += e[h][2] * l, a += l;
+  }
+  if (Math.abs(a) < 1e-10) {
+    const h = s[s.length - r - 1];
+    if (Math.abs(u - h) < 1e-8)
+      return [...e[i]];
+    if (Math.abs(u - s[r]) < 1e-8)
+      return [...e[0]];
+  }
+  return Math.abs(a) >= 1e-10 && (o[0] /= a, o[1] /= a, o[2] /= a), o;
+}
+function Ts(u, t, s, e) {
+  const n = u, i = t[n], r = t[t.length - n - 1];
+  let o = 0;
+  const a = 1e3, h = (r - i) / a;
+  let c = ft(
+    i,
+    u,
+    t,
+    s,
+    e
+  );
+  for (let g = 1; g <= a; g++) {
+    const y = i + g * h, p = ft(y, u, t, s, e), z = p[0] - c[0], f = p[1] - c[1], b = p[2] - c[2];
+    o += Math.sqrt(z * z + f * f + b * b), c = p;
+  }
+  const l = ft(
+    r,
+    u,
+    t,
+    s,
+    e
+  ), m = l[0] - c[0], d = l[1] - c[1], x = l[2] - c[2];
+  return o += Math.sqrt(m * m + d * d + x * x), o;
+}
+function vs(u, t = 3, s = "Uniform", e, n) {
+  return u.length === 0 ? [] : ss(
+    u,
+    t,
+    s,
+    e,
+    n
+  ).controlPoints;
+}
+const Dt = new O(), vt = new _(), js = new _(), Vs = new _(), Rt = new w();
+function es(u) {
+  return new O().setFromExtrusionDirection(
+    new _(u.x, u.y, u.z)
+  );
+}
+function Ys(u) {
+  return Dt.setFromExtrusionDirection(
+    new _(u.x, u.y, u.z)
+  ), Dt.extractBasis(vt, js, Vs), vt.clone();
+}
+function Zs(u, t) {
+  return new w(u.x, u.y, u.z ?? 0).applyMatrix4(
+    es(t)
+  );
+}
+function Yt(u, t) {
+  return new w(u.x, u.y, u.z ?? 0).applyMatrix4(
+    es(t).invert()
+  );
+}
+function Os(u, t, s) {
+  const e = Yt(u, s), n = Yt(t, s);
+  return Rt.set(
+    n.x - e.x,
+    n.y - e.y,
+    (n.z ?? 0) - (e.z ?? 0)
+  ), M.normalizeAngle(Math.atan2(Rt.y, Rt.x));
+}
+class ns {
   constructor() {
     this._boundingBoxNeedsUpdate = !1;
   }
@@ -2031,7 +2060,7 @@ class Jt {
     return this._boundingBoxNeedsUpdate;
   }
 }
-class Gt extends Jt {
+class is extends ns {
   translate(t) {
     return this.transform(new it().makeTranslation(t.x, t.y));
   }
@@ -2039,7 +2068,7 @@ class Gt extends Jt {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class ts extends Gt {
+class rs extends is {
   constructor() {
     super(), this._loops = [];
   }
@@ -2063,7 +2092,7 @@ class ts extends Gt {
     }), this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    const t = new ts();
+    const t = new rs();
     return this._loops.forEach((s) => {
       t.add(s.clone());
     }), t;
@@ -2087,18 +2116,18 @@ class ts extends Gt {
     const r = { index: -1, children: [] };
     for (let a = 0; a < i; a++) {
       const h = e[a], c = t[h], l = s[h];
-      let d = a + 1;
-      for (; d < i; d++) {
-        const u = e[d], x = t[u];
-        if (s[u].containsBox(l) && ws.isPointInPolygon(
+      let m = a + 1;
+      for (; m < i; m++) {
+        const d = e[m], x = t[d];
+        if (s[d].containsBox(l) && ks.isPointInPolygon(
           c[M.randInt(0, c.length - 1)],
           x
         )) {
-          (o = n.get(u)) == null || o.children.push(n.get(h));
+          (o = n.get(d)) == null || o.children.push(n.get(h));
           break;
         }
       }
-      d === i && r.children.push(n.get(h));
+      m === i && r.children.push(n.get(h));
     }
     return r;
   }
@@ -2142,7 +2171,7 @@ class ts extends Gt {
     }), e;
   }
 }
-class rt extends Gt {
+class rt extends is {
   constructor() {
     super(), this.arcLengthDivisions = 100;
   }
@@ -2204,8 +2233,8 @@ class rt extends Gt {
       }
     if (n = a, e[n] === r)
       return n / (i - 1);
-    const c = e[n], d = e[n + 1] - c, u = (r - c) / d;
-    return (n + u) / (i - 1);
+    const c = e[n], m = e[n + 1] - c, d = (r - c) / m;
+    return (n + d) / (i - 1);
   }
   getTangent(t) {
     let e = t - 1e-4, n = t + 1e-4;
@@ -2218,7 +2247,7 @@ class rt extends Gt {
     return this.getTangent(s);
   }
 }
-class K extends rt {
+class $ extends rt {
   constructor(t, s, e, n, i) {
     super();
     const r = +(t !== void 0) + +(s !== void 0) + +(e !== void 0) + +(n !== void 0) + +(i !== void 0);
@@ -2242,23 +2271,23 @@ class K extends rt {
     const n = (A, k) => ({
       x: (A.x + k.x) / 2,
       y: (A.y + k.y) / 2
-    }), i = (A, k) => (k.y - A.y) / (k.x - A.x), r = (A) => -1 / A, o = n(t, s), a = n(s, e), h = i(t, s), c = i(s, e), l = r(h), d = r(c), u = (A, k, C, j) => {
-      const q = (j - k) / (A - C), $ = A * q + k;
-      return { x: q, y: $ };
-    }, x = o.y - l * o.x, g = a.y - d * a.x, y = u(l, x, d, g), _ = Math.sqrt(
+    }), i = (A, k) => (k.y - A.y) / (k.x - A.x), r = (A) => -1 / A, o = n(t, s), a = n(s, e), h = i(t, s), c = i(s, e), l = r(h), m = r(c), d = (A, k, C, j) => {
+      const q = (j - k) / (A - C), W = A * q + k;
+      return { x: q, y: W };
+    }, x = o.y - l * o.x, g = a.y - m * a.x, y = d(l, x, m, g), p = Math.sqrt(
       Math.pow(t.x - y.x, 2) + Math.pow(t.y - y.y, 2)
     ), z = (A, k) => Math.atan2(A.y - k.y, A.x - k.x), f = z(t, y), b = z(s, y), P = z(e, y), I = P > f && P < b || f > P && f < b || b > P && b < f;
-    this.center = y, this.radius = _, this._clockwise = !I, this._startAngle = f, this._endAngle = P;
+    this.center = y, this.radius = p, this._clockwise = !I, this._startAngle = f, this._endAngle = P;
   }
   createByStartEndPointsAndBulge(t, s, e) {
     let n, i, r;
     e < 0 ? (n = Math.atan(-e) * 4, i = new B(t), r = new B(s)) : (n = Math.atan(e) * 4, i = new B(s), r = new B(t));
-    const o = new B().subVectors(r, i), a = o.length(), h = new B().addVectors(i, o.multiplyScalar(0.5)), c = Math.abs(a / 2 / Math.tan(n / 2)), l = o.normalize(), d = e < 0 ? -Math.PI / 2 : Math.PI / 2, u = new B(
-      l.x * Math.cos(d) - l.y * Math.sin(d),
-      l.y * Math.cos(d) + l.x * Math.sin(d)
+    const o = new B().subVectors(r, i), a = o.length(), h = new B().addVectors(i, o.multiplyScalar(0.5)), c = Math.abs(a / 2 / Math.tan(n / 2)), l = o.normalize(), m = e < 0 ? -Math.PI / 2 : Math.PI / 2, d = new B(
+      l.x * Math.cos(m) - l.y * Math.sin(m),
+      l.y * Math.cos(m) + l.x * Math.sin(m)
     );
     let x;
-    n < Math.PI ? e < 0 ? x = h.add(u.multiplyScalar(c)) : x = h.add(u.multiplyScalar(-c)) : e < 0 ? x = h.add(u.multiplyScalar(-c)) : x = h.add(u.multiplyScalar(c)), e < 0 ? (this._startAngle = Math.atan2(i.y - x.y, i.x - x.x), this._endAngle = Math.atan2(r.y - x.y, r.x - x.x)) : (this._startAngle = Math.atan2(r.y - x.y, r.x - x.x), this._endAngle = Math.atan2(i.y - x.y, i.x - x.x)), this._clockwise = e < 0, this.center = x, this.radius = r.sub(x).length();
+    n < Math.PI ? e < 0 ? x = h.add(d.multiplyScalar(c)) : x = h.add(d.multiplyScalar(-c)) : e < 0 ? x = h.add(d.multiplyScalar(-c)) : x = h.add(d.multiplyScalar(c)), e < 0 ? (this._startAngle = Math.atan2(i.y - x.y, i.x - x.x), this._endAngle = Math.atan2(r.y - x.y, r.x - x.x)) : (this._startAngle = Math.atan2(r.y - x.y, r.x - x.x), this._endAngle = Math.atan2(i.y - x.y, i.x - x.x)), this._clockwise = e < 0, this.center = x, this.radius = r.sub(x).length();
   }
   get center() {
     return this._center;
@@ -2342,7 +2371,7 @@ class K extends rt {
         n.y - e.y,
         n.x - e.x
       ), this._endAngle = this._startAngle, this._clockwise = s.determinant() < 0 ? !this._clockwise : this._clockwise, this._boundingBoxNeedsUpdate = !0, this;
-    const i = this.midPoint.clone().applyMatrix2d(s), r = this.endPoint.clone().applyMatrix2d(s), o = new K(
+    const i = this.midPoint.clone().applyMatrix2d(s), r = this.endPoint.clone().applyMatrix2d(s), o = new $(
       n,
       i,
       r
@@ -2363,7 +2392,7 @@ class K extends rt {
     ), this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return new K(
+    return new $(
       this.center.clone(),
       this.radius,
       this._startAngle,
@@ -2391,15 +2420,15 @@ class K extends rt {
     return s;
   }
 }
-class Bs extends Jt {
+class qs extends ns {
   translate(t) {
-    return this.transform(new G().makeTranslation(t.x, t.y, t.z));
+    return this.transform(new O().makeTranslation(t.x, t.y, t.z));
   }
   get box() {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class ot extends Bs {
+class ot extends qs {
 }
 class Mt extends ot {
   constructor(t, s) {
@@ -2418,7 +2447,7 @@ class Mt extends ot {
     this._end.copy(t), this._boundingBoxNeedsUpdate = !0;
   }
   get direction() {
-    return new p().subVectors(this.endPoint, this.startPoint).normalize();
+    return new _().subVectors(this.endPoint, this.startPoint).normalize();
   }
   get midPoint() {
     return new w(
@@ -2441,30 +2470,30 @@ class Mt extends ot {
   }
   atLength(t, s = !1) {
     if (s) {
-      const e = this.delta(O).normalize();
+      const e = this.delta(Q).normalize();
       return new w(this._start).addScaledVector(e, t);
     } else {
-      const e = this.delta(O).normalize();
+      const e = this.delta(Q).normalize();
       return new w(this._end).addScaledVector(e, t);
     }
   }
   extend(t, s = !1) {
     if (s) {
-      const e = O.subVectors(this._start, this._end).normalize();
+      const e = Q.subVectors(this._start, this._end).normalize();
       this._start = new w(this._start).addScaledVector(
         e,
         t
       );
     } else {
-      const e = this.delta(O).normalize();
+      const e = this.delta(Q).normalize();
       this._end = new w(this._end).addScaledVector(e, t);
     }
     return this._boundingBoxNeedsUpdate = !0, this;
   }
   closestPointToPointParameter(t, s) {
-    Xt.subVectors(t, this._start), _t.subVectors(this.endPoint, this.startPoint);
+    Zt.subVectors(t, this._start), _t.subVectors(this.endPoint, this.startPoint);
     const e = _t.dot(_t);
-    let i = _t.dot(Xt) / e;
+    let i = _t.dot(Zt) / e;
     return s && (i = M.clamp(i, 0, 1)), i;
   }
   closestPointToPoint(t, s, e) {
@@ -2481,11 +2510,11 @@ class Mt extends ot {
     return this._start.distanceTo(this._end);
   }
   project(t) {
-    const s = this.direction, n = O.subVectors(t, this.startPoint).dot(s);
+    const s = this.direction, n = Q.subVectors(t, this.startPoint).dot(s);
     return new w().copy(s).multiplyScalar(n).add(this.startPoint);
   }
   perpPoint(t) {
-    const s = this.direction, e = this.startPoint, i = O.subVectors(t, e).dot(s), r = O.copy(s).multiplyScalar(i);
+    const s = this.direction, e = this.startPoint, i = Q.subVectors(t, e).dot(s), r = Q.copy(s).multiplyScalar(i);
     return new w().addVectors(e, r);
   }
   calculateBoundingBox() {
@@ -2498,7 +2527,7 @@ class Mt extends ot {
       Math.max(this._start.y, this._end.y),
       Math.max(this._start.z, this._end.z)
     );
-    return new D(t, s);
+    return new v(t, s);
   }
   transform(t) {
     return this._start.applyMatrix4(t), this._end.applyMatrix4(t), this._boundingBoxNeedsUpdate = !0, this;
@@ -2513,14 +2542,14 @@ class Mt extends ot {
     return new Mt(this._start.clone(), this._end.clone());
   }
 }
-const O = new p(), Xt = new p(), _t = new p();
+const Q = new _(), Zt = new _(), _t = new _();
 class At extends ot {
   static computeCenterPoint(t, s, e) {
-    const n = new p().addVectors(t, s).multiplyScalar(0.5), i = new p().addVectors(t, e).multiplyScalar(0.5), r = new p().subVectors(s, t), o = new p().subVectors(e, t), a = new p().crossVectors(r, o).normalize();
+    const n = new _().addVectors(t, s).multiplyScalar(0.5), i = new _().addVectors(t, e).multiplyScalar(0.5), r = new _().subVectors(s, t), o = new _().subVectors(e, t), a = new _().crossVectors(r, o).normalize();
     if (a.lengthSq() === 0)
       return null;
-    const h = new p().crossVectors(r, a).normalize(), c = new p().crossVectors(o, a).normalize(), l = h.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), d = c.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), u = new Mt(n, n.clone().add(l)), x = new Mt(i, i.clone().add(d)), g = new p();
-    return u.closestPointToPoint(x.startPoint, !0, g) ? g : null;
+    const h = new _().crossVectors(r, a).normalize(), c = new _().crossVectors(o, a).normalize(), l = h.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), m = c.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), d = new Mt(n, n.clone().add(l)), x = new Mt(i, i.clone().add(m)), g = new _();
+    return d.closestPointToPoint(x.startPoint, !0, g) ? g : null;
   }
   static createByThreePoints(t, s, e) {
     const n = At.computeCenterPoint(
@@ -2529,17 +2558,17 @@ class At extends ot {
       e
     );
     if (n) {
-      const i = n.distanceTo(t), r = new p().subVectors(t, n), o = new p().subVectors(s, n), a = Math.atan2(r.y, r.x), h = Math.atan2(o.y, o.x);
+      const i = n.distanceTo(t), r = new _().subVectors(t, n), o = new _().subVectors(s, n), a = Math.atan2(r.y, r.x), h = Math.atan2(o.y, o.x);
       return new At(
         n,
         i,
         a,
         h,
-        p.Z_AXIS
+        _.Z_AXIS
       );
     }
   }
-  constructor(t, s, e, n, i, r = p.X_AXIS) {
+  constructor(t, s, e, n, i, r = _.X_AXIS) {
     super(), this.center = t, this.radius = s, this.startAngle = e, this.endAngle = n, this.normal = i, this.refVec = r, (n - e) % E == 0 ? (this.startAngle = 0, this.endAngle = E) : (this.startAngle = e, this.endAngle = n);
   }
   get center() {
@@ -2580,13 +2609,13 @@ class At extends ot {
     return this._normal;
   }
   set normal(t) {
-    this._normal = new p(t.x, t.y, t.z), this._normal.normalize(), this._boundingBoxNeedsUpdate = !0;
+    this._normal = new _(t.x, t.y, t.z), this._normal.normalize(), this._boundingBoxNeedsUpdate = !0;
   }
   get refVec() {
     return this._refVec;
   }
   set refVec(t) {
-    this._refVec = new p(t.x, t.y, t.z), this._refVec.normalize(), this._boundingBoxNeedsUpdate = !0;
+    this._refVec = new _(t.x, t.y, t.z), this._refVec.normalize(), this._boundingBoxNeedsUpdate = !0;
   }
   get startPoint() {
     return this.getPointAtAngle(this._startAngle);
@@ -2607,23 +2636,23 @@ class At extends ot {
     return this.closed ? Math.PI * this.radius * this.radius : Math.abs(this.deltaAngle * this.radius * this.radius);
   }
   nearestPoint(t) {
-    const s = new p(t.x, t.y, t.z || 0), e = this.center, n = this.normal, r = s.clone().sub(e).dot(n), a = s.clone().sub(n.clone().multiplyScalar(r)).clone().sub(e);
+    const s = new _(t.x, t.y, t.z || 0), e = this.center, n = this.normal, r = s.clone().sub(e).dot(n), a = s.clone().sub(n.clone().multiplyScalar(r)).clone().sub(e);
     if (a.lengthSq() === 0)
       return this.startPoint.clone();
     a.normalize().multiplyScalar(this.radius);
-    const h = e.clone().add(a), c = this.getAngle(h.clone()), l = this.startAngle, d = this.deltaAngle;
-    let u = M.normalizeAngle(c - l);
-    u < 0 && (u = 0), u > d && (u = d);
-    const x = this.getPointAtAngle(l + u), g = x.distanceTo(s), y = this.startPoint.distanceTo(s), _ = this.endPoint.distanceTo(s);
-    return y < g && y <= _ ? this.startPoint.clone() : _ < g && _ < y ? this.endPoint.clone() : x;
+    const h = e.clone().add(a), c = this.getAngle(h.clone()), l = this.startAngle, m = this.deltaAngle;
+    let d = M.normalizeAngle(c - l);
+    d < 0 && (d = 0), d > m && (d = m);
+    const x = this.getPointAtAngle(l + d), g = x.distanceTo(s), y = this.startPoint.distanceTo(s), p = this.endPoint.distanceTo(s);
+    return y < g && y <= p ? this.startPoint.clone() : p < g && p < y ? this.endPoint.clone() : x;
   }
   tangentPoints(t) {
-    const s = [], e = new p(t.x, t.y, t.z || 0), n = this.center, i = this.normal, r = this.radius, a = e.clone().sub(n).dot(i), h = e.clone().sub(i.clone().multiplyScalar(a)), c = n.clone(), d = h.clone().sub(c).length();
-    if (d < r) return s;
-    const u = Math.acos(r / d), x = this.getAngle(h.clone()), g = [x + u, x - u];
+    const s = [], e = new _(t.x, t.y, t.z || 0), n = this.center, i = this.normal, r = this.radius, a = e.clone().sub(n).dot(i), h = e.clone().sub(i.clone().multiplyScalar(a)), c = n.clone(), m = h.clone().sub(c).length();
+    if (m < r) return s;
+    const d = Math.acos(r / m), x = this.getAngle(h.clone()), g = [x + d, x - d];
     for (const y of g) {
-      const _ = M.normalizeAngle(y - this.startAngle);
-      _ >= 0 && _ <= this.deltaAngle && s.push(this.getPointAtAngle(this.startAngle + _));
+      const p = M.normalizeAngle(y - this.startAngle);
+      p >= 0 && p <= this.deltaAngle && s.push(this.getPointAtAngle(this.startAngle + p));
     }
     return s;
   }
@@ -2642,7 +2671,7 @@ class At extends ot {
       const h = this.getPointAtAngle(a);
       h.x < s && (s = h.x), h.y < e && (e = h.y), h.z < n && (n = h.z), h.x > i && (i = h.x), h.y > r && (r = h.y), h.z > o && (o = h.z);
     }
-    return new D(
+    return new v(
       { x: s, y: e, z: n },
       { x: i, y: r, z: o }
     );
@@ -2663,16 +2692,16 @@ class At extends ot {
   transform(t) {
     const s = this.center.clone().applyMatrix4(t), e = this.startPoint.clone().applyMatrix4(t), n = this.endPoint.clone().applyMatrix4(t), i = this.getPointAtAngle(
       this.closed ? Math.PI / 2 : this.startAngle + this.deltaAngle / 2
-    ).clone().applyMatrix4(t), r = new p(e).sub(s).normalize(), o = s.distanceTo(e);
-    let a = new p().crossVectors(
-      new p(e).sub(s),
-      new p(i).sub(s)
+    ).clone().applyMatrix4(t), r = new _(e).sub(s).normalize(), o = s.distanceTo(e);
+    let a = new _().crossVectors(
+      new _(e).sub(s),
+      new _(i).sub(s)
     ).normalize();
     a.lengthSq() === 0 && (a = this.normal.clone().transformDirection(t));
     const h = (c) => {
-      const l = new p(c).sub(s);
+      const l = new _(c).sub(s);
       return Math.atan2(
-        l.dot(vt.crossVectors(a, r)),
+        l.dot(Ot.crossVectors(a, r)),
         l.dot(r)
       );
     };
@@ -2693,7 +2722,7 @@ class At extends ot {
   }
   getAngle(t) {
     return t.sub(this.center), Math.atan2(
-      t.dot(vt.crossVectors(this.refVec, this.normal)),
+      t.dot(Ot.crossVectors(this.refVec, this.normal)),
       t.dot(this.refVec)
     );
   }
@@ -2710,12 +2739,12 @@ class At extends ot {
     );
   }
   get plane() {
-    const t = new p(this.center).distanceTo(Kt);
+    const t = new _(this.center).distanceTo(Jt);
     return new Ct(this.normal, t);
   }
 }
-const vt = new p();
-class J extends rt {
+const Ot = new _();
+class G extends rt {
   constructor(t, s, e, n = 0, i = E, r = !1, o = 0) {
     super(), this.center = t, this.majorAxisRadius = s, this.minorAxisRadius = e, (i - n) % E == 0 ? (this.startAngle = 0, this.endAngle = E) : (this.startAngle = n, this.endAngle = i), this.clockwise = r, this.rotation = o;
   }
@@ -2806,12 +2835,12 @@ class J extends rt {
       e
     ), a = new S(r).sub(
       e
-    ), h = o.length(), c = a.length(), l = Math.atan2(o.y, o.x), d = o.clone().normalize(), u = a.clone().normalize(), x = (_) => {
-      const z = new S(_).sub(e), f = z.dot(d), b = z.dot(u);
+    ), h = o.length(), c = a.length(), l = Math.atan2(o.y, o.x), m = o.clone().normalize(), d = a.clone().normalize(), x = (p) => {
+      const z = new S(p).sub(e), f = z.dot(m), b = z.dot(d);
       return M.normalizeAngle(
         Math.atan2(b / c, f / h)
       );
-    }, g = s.determinant() < 0 ? !this.clockwise : this.clockwise, y = this.closed ? new J(
+    }, g = s.determinant() < 0 ? !this.clockwise : this.clockwise, y = this.closed ? new G(
       n,
       h,
       c,
@@ -2819,7 +2848,7 @@ class J extends rt {
       E,
       g,
       l
-    ) : new J(
+    ) : new G(
       n,
       h,
       c,
@@ -2839,7 +2868,7 @@ class J extends rt {
     return this.center = t.center, this.majorAxisRadius = t.majorAxisRadius, this.minorAxisRadius = t.minorAxisRadius, this.startAngle = t.startAngle, this.endAngle = t.endAngle, this.clockwise = t.clockwise, this.rotation = t.rotation, this;
   }
   clone() {
-    return new J(
+    return new G(
       this.center,
       this.majorAxisRadius,
       this.minorAxisRadius,
@@ -2850,7 +2879,7 @@ class J extends rt {
     );
   }
 }
-class zt extends ot {
+class wt extends ot {
   constructor(t, s, e, n, i, r = 0, o = E) {
     super(), this.center = t, this.normal = s, this.majorAxis = e, this.majorAxisRadius = n, this.minorAxisRadius = i;
     const a = Math.abs(o - r);
@@ -2902,16 +2931,16 @@ class zt extends ot {
     return this._normal;
   }
   set normal(t) {
-    this._normal = new p(t.x, t.y, t.z), this._normal.normalize(), this._boundingBoxNeedsUpdate = !0;
+    this._normal = new _(t.x, t.y, t.z), this._normal.normalize(), this._boundingBoxNeedsUpdate = !0;
   }
   get majorAxis() {
     return this._majorAxis;
   }
   set majorAxis(t) {
-    this._majorAxis = new p(t.x, t.y, t.z), this._majorAxis.normalize(), this._boundingBoxNeedsUpdate = !0;
+    this._majorAxis = new _(t.x, t.y, t.z), this._majorAxis.normalize(), this._boundingBoxNeedsUpdate = !0;
   }
   get minorAxis() {
-    return new p().crossVectors(this.normal, this.majorAxis).normalize();
+    return new _().crossVectors(this.normal, this.majorAxis).normalize();
   }
   get startPoint() {
     return this.getPointAtAngle(this._startAngle);
@@ -2947,7 +2976,7 @@ class zt extends ot {
     return Math.abs(i);
   }
   calculateBoundingBox() {
-    if (this.majorAxis.equals(p.X_AXIS) || this.majorAxis.equals(p.Y_AXIS) || this.majorAxis.isParallelTo(p.X_AXIS) || this.majorAxis.isParallelTo(p.Y_AXIS)) {
+    if (this.majorAxis.equals(_.X_AXIS) || this.majorAxis.equals(_.Y_AXIS) || this.majorAxis.isParallelTo(_.X_AXIS) || this.majorAxis.isParallelTo(_.Y_AXIS)) {
       const t = [this.startAngle, this.endAngle];
       for (let a = 0; a < 2 * Math.PI; a += Math.PI / 2)
         M.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
@@ -2956,7 +2985,7 @@ class zt extends ot {
         const h = this.getPointAtAngle(a);
         h.x < s && (s = h.x), h.y < e && (e = h.y), h.z < n && (n = h.z), h.x > i && (i = h.x), h.y > r && (r = h.y), h.z > o && (o = h.z);
       }
-      return new D(
+      return new v(
         { x: s, y: e, z: n },
         { x: i, y: r, z: o }
       );
@@ -2966,7 +2995,7 @@ class zt extends ot {
         const h = this.startAngle + this.deltaAngle * (a / 100), c = this.getPointAtAngle(h);
         s = Math.min(s, c.x), e = Math.min(e, c.y), n = Math.min(n, c.z), i = Math.max(i, c.x), r = Math.max(r, c.y), o = Math.max(o, c.z);
       }
-      return new D(
+      return new v(
         { x: s, y: e, z: n },
         { x: i, y: r, z: o }
       );
@@ -2994,23 +3023,23 @@ class zt extends ot {
     );
   }
   contains(t) {
-    const s = new p(t).sub(this.center), e = s.dot(this.majorAxis), n = s.dot(this.minorAxis), i = e / this.majorAxisRadius, r = n / this.minorAxisRadius;
+    const s = new _(t).sub(this.center), e = s.dot(this.majorAxis), n = s.dot(this.minorAxis), i = e / this.majorAxisRadius, r = n / this.minorAxisRadius;
     return i * i + r * r <= 1;
   }
   transform(t) {
-    const s = t, e = this.center.clone().applyMatrix4(s), n = this.getPointAtAngle(0).clone().applyMatrix4(s), i = this.getPointAtAngle(Math.PI / 2).clone().applyMatrix4(s), r = new p(n).sub(
+    const s = t, e = this.center.clone().applyMatrix4(s), n = this.getPointAtAngle(0).clone().applyMatrix4(s), i = this.getPointAtAngle(Math.PI / 2).clone().applyMatrix4(s), r = new _(n).sub(
       e
-    ), o = new p(i).sub(
+    ), o = new _(i).sub(
       e
-    ), a = r.length(), h = o.length(), c = r.clone().normalize(), l = new p().crossVectors(r, o).normalize();
-    let d = new p().crossVectors(l, c).normalize();
-    d.dot(o) < 0 && (l.negate(), d = new p().crossVectors(l, c).normalize());
-    const u = (g) => {
-      const y = new p(g).sub(e), _ = y.dot(c), z = y.dot(d);
+    ), a = r.length(), h = o.length(), c = r.clone().normalize(), l = new _().crossVectors(r, o).normalize();
+    let m = new _().crossVectors(l, c).normalize();
+    m.dot(o) < 0 && (l.negate(), m = new _().crossVectors(l, c).normalize());
+    const d = (g) => {
+      const y = new _(g).sub(e), p = y.dot(c), z = y.dot(m);
       return M.normalizeAngle(
-        Math.atan2(z / h, _ / a)
+        Math.atan2(z / h, p / a)
       );
-    }, x = this.closed ? new zt(
+    }, x = this.closed ? new wt(
       e,
       l,
       c,
@@ -3018,14 +3047,14 @@ class zt extends ot {
       h,
       0,
       E
-    ) : new zt(
+    ) : new wt(
       e,
       l,
       c,
       a,
       h,
-      u(this.startPoint.clone().applyMatrix4(s)),
-      u(this.endPoint.clone().applyMatrix4(s))
+      d(this.startPoint.clone().applyMatrix4(s)),
+      d(this.endPoint.clone().applyMatrix4(s))
     );
     return this.center = x.center, this.normal = x.normal, this.majorAxis = x.majorAxis, this.majorAxisRadius = x.majorAxisRadius, this.minorAxisRadius = x.minorAxisRadius, this._startAngle = x._startAngle, this._endAngle = x._endAngle, this._boundingBoxNeedsUpdate = !0, this;
   }
@@ -3033,7 +3062,7 @@ class zt extends ot {
     return this.center = t.center, this.normal = t.normal, this.majorAxis = t.majorAxis, this.majorAxisRadius = t.majorAxisRadius, this.minorAxisRadius = t.minorAxisRadius, this.startAngle = t.startAngle, this.endAngle = t.endAngle, this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return new zt(
+    return new wt(
       this.center,
       this.normal,
       this.majorAxis,
@@ -3044,11 +3073,11 @@ class zt extends ot {
     );
   }
   get plane() {
-    const t = new p(this.center).distanceTo(Kt);
+    const t = new _(this.center).distanceTo(Jt);
     return new Ct(this.normal, t);
   }
 }
-class ss extends rt {
+class os extends rt {
   constructor(t = null, s = !1) {
     super(), this._vertices = t || new Array(), this._closed = s;
   }
@@ -3088,7 +3117,7 @@ class ss extends rt {
       let i = null;
       if (e < s - 1 ? i = this._vertices[e + 1] : e == s - 1 && this.closed && (i = this._vertices[0]), i)
         if (n.bulge) {
-          const r = new K(n, i, n.bulge);
+          const r = new $(n, i, n.bulge);
           t += r.length;
         } else
           t += new S(n.x, n.y).distanceTo(i);
@@ -3127,7 +3156,7 @@ class ss extends rt {
     }), this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return new ss(
+    return new os(
       this._vertices.map((t) => ({ ...t })),
       this._closed
     );
@@ -3145,7 +3174,7 @@ class ss extends rt {
       if (i.bulge) {
         let r = null;
         if (n < e - 1 ? r = this._vertices[n + 1] : n == e - 1 && this.closed && (r = this._vertices[0]), r) {
-          const a = new K(i, r, i.bulge).getPoints(t), h = a.length;
+          const a = new $(i, r, i.bulge).getPoints(t), h = a.length;
           for (let c = 0; c < h; ++c) {
             const l = a[c];
             s.push(new S(l.x, l.y));
@@ -3228,8 +3257,8 @@ class F extends rt {
             i
           );
           if (l.index < 0) break;
-          let d = e.splice(l.index, 1)[0];
-          if (l.reverse && (d = F.reverseEdge(d)), o.push(d), c = F.getEdgeEndPoint(d), r(c, h)) break;
+          let m = e.splice(l.index, 1)[0];
+          if (l.reverse && (m = F.reverseEdge(m)), o.push(m), c = F.getEdgeEndPoint(m), r(c, h)) break;
         }
       n.push(new F(o));
     }
@@ -3262,7 +3291,7 @@ class F extends rt {
     return s.setFromPoints(t), s;
   }
   transform(t) {
-    const s = new G().set(
+    const s = new O().set(
       t.elements[0],
       t.elements[3],
       0,
@@ -3281,7 +3310,7 @@ class F extends rt {
       1
     );
     return this._curves.forEach((e) => {
-      e instanceof Q ? e.transform(s) : e.transform(t);
+      e instanceof K ? e.transform(s) : e.transform(t);
     }), this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
@@ -3301,8 +3330,8 @@ class F extends rt {
   static findConnectingEdge(t, s, e) {
     let n = -1, i = !1, r = Number.POSITIVE_INFINITY;
     for (let o = 0; o < t.length; o++) {
-      const a = t[o], h = F.getEdgeStartPoint(a), c = F.getEdgeEndPoint(a), l = s.x - h.x, d = s.y - h.y, u = l * l + d * d;
-      u < r && (r = u, n = o, i = !1);
+      const a = t[o], h = F.getEdgeStartPoint(a), c = F.getEdgeEndPoint(a), l = s.x - h.x, m = s.y - h.y, d = l * l + m * m;
+      d < r && (r = d, n = o, i = !1);
       const x = s.x - c.x, g = s.y - c.y, y = x * x + g * g;
       y < r && (r = y, n = o, i = !0);
     }
@@ -3317,13 +3346,13 @@ class F extends rt {
     return new S(s.x, s.y);
   }
   static reverseEdge(t) {
-    return t instanceof Pt ? new Pt(t.endPoint, t.startPoint) : t instanceof K ? new K(
+    return t instanceof Pt ? new Pt(t.endPoint, t.startPoint) : t instanceof $ ? new $(
       t.center,
       t.radius,
       t.endAngle,
       t.startAngle,
       !t.clockwise
-    ) : t instanceof J ? new J(
+    ) : t instanceof G ? new G(
       t.center,
       t.majorAxisRadius,
       t.minorAxisRadius,
@@ -3331,11 +3360,11 @@ class F extends rt {
       t.startAngle,
       !t.clockwise,
       t.rotation
-    ) : t instanceof Q ? F.reverseSplineEdge(t) : t;
+    ) : t instanceof K ? F.reverseSplineEdge(t) : t;
   }
   static reverseSplineEdge(t) {
     const s = [...t.controlPoints].reverse(), e = t.knots, n = e[0], i = e[e.length - 1], r = e.map((h) => n + i - h).reverse(), o = t.weights, a = o.length > 0 ? [...o].reverse() : void 0;
-    return new Q(
+    return new K(
       s,
       r,
       a,
@@ -3344,7 +3373,7 @@ class F extends rt {
     );
   }
 }
-class Rt {
+class Nt {
   constructor() {
     this.c0 = 0, this.c1 = 0, this.c2 = 0, this.c3 = 0;
   }
@@ -3363,9 +3392,9 @@ class Rt {
     return this.c0 + this.c1 * t + this.c2 * s + this.c3 * e;
   }
 }
-class Nt extends ot {
+class Tt extends ot {
   constructor(t = [], s = !1, e = "centripetal", n = 0.5) {
-    super(), this.isCatmullRomCurve3d = !0, this.type = "CatmullRomCurve3d", this._tmp = new p(), this._px = new Rt(), this._py = new Rt(), this._pz = new Rt(), this._points = t.map((i) => new w(i)), this._closed = s, this._curveType = e, this._tension = n;
+    super(), this.isCatmullRomCurve3d = !0, this.type = "CatmullRomCurve3d", this._tmp = new _(), this._px = new Nt(), this._py = new Nt(), this._pz = new Nt(), this._points = t.map((i) => new w(i)), this._closed = s, this._curveType = e, this._tension = n;
   }
   get points() {
     return this._points;
@@ -3405,12 +3434,12 @@ class Nt extends ot {
     this._closed ? o += o > 0 ? 0 : (Math.floor(Math.abs(o) / i) + 1) * i : a === 0 && o === i - 1 && (o = i - 2, a = 1);
     let h, c;
     this._closed || o > 0 ? h = n[(o - 1) % i] : (this._tmp.subVectors(n[0], n[1]).add(n[0]), h = new w(this._tmp.x, this._tmp.y, this._tmp.z));
-    const l = n[o % i], d = n[(o + 1) % i];
+    const l = n[o % i], m = n[(o + 1) % i];
     if (this._closed || o + 2 < i ? c = n[(o + 2) % i] : (this._tmp.subVectors(n[i - 1], n[i - 2]).add(n[i - 1]), c = new w(this._tmp.x, this._tmp.y, this._tmp.z)), this._curveType === "centripetal" || this._curveType === "chordal") {
-      const u = this._curveType === "chordal" ? 0.5 : 0.25;
-      let x = Math.pow(h.distanceToSquared(l), u), g = Math.pow(l.distanceToSquared(d), u), y = Math.pow(d.distanceToSquared(c), u);
-      g < 1e-4 && (g = 1), x < 1e-4 && (x = g), y < 1e-4 && (y = g), this._px.initNonuniformCatmullRom(h.x, l.x, d.x, c.x, x, g, y), this._py.initNonuniformCatmullRom(h.y, l.y, d.y, c.y, x, g, y), this._pz.initNonuniformCatmullRom(h.z, l.z, d.z, c.z, x, g, y);
-    } else this._curveType === "catmullrom" && (this._px.initCatmullRom(h.x, l.x, d.x, c.x, this._tension), this._py.initCatmullRom(h.y, l.y, d.y, c.y, this._tension), this._pz.initCatmullRom(h.z, l.z, d.z, c.z, this._tension));
+      const d = this._curveType === "chordal" ? 0.5 : 0.25;
+      let x = Math.pow(h.distanceToSquared(l), d), g = Math.pow(l.distanceToSquared(m), d), y = Math.pow(m.distanceToSquared(c), d);
+      g < 1e-4 && (g = 1), x < 1e-4 && (x = g), y < 1e-4 && (y = g), this._px.initNonuniformCatmullRom(h.x, l.x, m.x, c.x, x, g, y), this._py.initNonuniformCatmullRom(h.y, l.y, m.y, c.y, x, g, y), this._pz.initNonuniformCatmullRom(h.z, l.z, m.z, c.z, x, g, y);
+    } else this._curveType === "catmullrom" && (this._px.initCatmullRom(h.x, l.x, m.x, c.x, this._tension), this._py.initCatmullRom(h.y, l.y, m.y, c.y, this._tension), this._pz.initCatmullRom(h.z, l.z, m.z, c.z, this._tension));
     return e.set(
       this._px.calc(a),
       this._py.calc(a),
@@ -3436,7 +3465,7 @@ class Nt extends ot {
     this._tension = t;
   }
   clone() {
-    return new Nt(
+    return new Tt(
       this._points.map((t) => t.clone()),
       this._closed,
       this._curveType,
@@ -3451,8 +3480,8 @@ class Nt extends ot {
   }
   calculateBoundingBox() {
     if (this._points.length === 0)
-      return new D();
-    const t = new D();
+      return new v();
+    const t = new v();
     return this._points.forEach((s) => {
       t.expandByPoint(s);
     }), t;
@@ -3494,7 +3523,7 @@ class T {
   }
   length() {
     const t = this._controlPoints.map((s) => [s.x, s.y, s.z]);
-    return bs(
+    return Ts(
       this._degree,
       this._knots,
       t,
@@ -3505,7 +3534,7 @@ class T {
     return new T(t, s, e, n);
   }
   static byPoints(t, s, e = "Uniform", n, i) {
-    const r = Ht(
+    const r = ss(
       t,
       s,
       e,
@@ -3542,7 +3571,7 @@ class T {
   static createFitPointsForClosedCurve(t) {
     if (t.length < 4)
       throw new Error("At least 4 points are required for a closed NURBS curve");
-    const s = new Nt(
+    const s = new Tt(
       t,
       !0,
       "centripetal"
@@ -3554,7 +3583,7 @@ class T {
     return T.byPoints(i, s, e);
   }
 }
-class Q extends ot {
+class K extends ot {
   constructor(t, s, e, n, i, r) {
     super();
     const o = arguments.length;
@@ -3716,7 +3745,7 @@ class Q extends ot {
   }
   calculateBoundingBox() {
     const t = this.getPoints(100);
-    return new D().setFromPoints(t);
+    return new v().setFromPoints(t);
   }
   get closed() {
     return this._closed;
@@ -3747,7 +3776,7 @@ class Q extends ot {
     return this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return this._fitPoints && this._knotParameterization ? new Q(
+    return this._fitPoints && this._knotParameterization ? new K(
       this._fitPoints.map((t) => ({
         x: t.x,
         y: t.y,
@@ -3766,7 +3795,7 @@ class Q extends ot {
         y: this._endTangent.y,
         z: this._endTangent.z || 0
       } : void 0
-    ) : new Q(
+    ) : new K(
       this._controlPoints.map((t) => ({
         x: t.x,
         y: t.y,
@@ -3798,79 +3827,83 @@ class Q extends ot {
       throw new Error(
         `At least ${e + 1} points are required for a degree ${e} closed spline`
       );
-    return new Q(t, s, e, !0);
+    return new K(t, s, e, !0);
   }
 }
 export {
-  ts as AcGeArea2d,
+  rs as AcGeArea2d,
   X as AcGeBox2d,
-  D as AcGeBox3d,
-  Nt as AcGeCatmullRomCurve3d,
-  K as AcGeCircArc2d,
+  v as AcGeBox3d,
+  Tt as AcGeCatmullRomCurve3d,
+  $ as AcGeCircArc2d,
   At as AcGeCircArc3d,
   rt as AcGeCurve2d,
-  J as AcGeEllipseArc2d,
-  zt as AcGeEllipseArc3d,
-  Ft as AcGeEuler,
-  ws as AcGeGeometryUtil,
+  G as AcGeEllipseArc2d,
+  wt as AcGeEllipseArc3d,
+  Xt as AcGeEuler,
+  ks as AcGeGeometryUtil,
   Pt as AcGeLine2d,
   Mt as AcGeLine3d,
   F as AcGeLoop2d,
   M as AcGeMathUtil,
   it as AcGeMatrix2d,
-  G as AcGeMatrix3d,
+  O as AcGeMatrix3d,
   T as AcGeNurbsCurve,
   Ct as AcGePlane,
   S as AcGePoint2d,
   w as AcGePoint3d,
-  ss as AcGePolyline2d,
+  os as AcGePolyline2d,
   St as AcGeQuaternion,
-  Gt as AcGeShape2d,
-  Q as AcGeSpline3d,
+  is as AcGeShape2d,
+  K as AcGeSpline3d,
   bt as AcGeTol,
   B as AcGeVector2d,
-  p as AcGeVector3d,
-  $t as DEFAULT_TOL,
-  Dt as DEG2RAD,
-  W as FLOAT_TOL,
-  Rs as ORIGIN_POINT_2D,
-  Kt as ORIGIN_POINT_3D,
-  Yt as RAD2DEG,
+  _ as AcGeVector3d,
+  Gt as DEFAULT_TOL,
+  Qt as DEG2RAD,
+  H as FLOAT_TOL,
+  Ls as ORIGIN_POINT_2D,
+  Jt as ORIGIN_POINT_3D,
+  Kt as RAD2DEG,
   E as TAU,
-  wt as basisFunction,
-  bs as calculateCurveLength,
-  ys as ceilPowerOfTwo,
+  zt as basisFunction,
+  Ts as calculateCurveLength,
+  ws as ceilPowerOfTwo,
   Z as clamp,
-  Ms as computeParameterValues,
-  rs as damp,
-  ms as degToRad,
-  Zt as euclideanModulo,
+  Rs as computeParameterValues,
+  ls as damp,
+  ps as degToRad,
+  $t as euclideanModulo,
   ft as evaluateNurbsPoint,
-  _s as floorPowerOfTwo,
-  Ps as generateAveragedKnots,
-  Ts as generateChordKnots,
-  js as generateSqrtChordKnots,
-  es as generateUUID,
-  Ns as generateUniformKnots,
-  Qt as intPartLength,
-  Vs as interpolateControlPoints,
-  Ht as interpolateNurbsCurve,
-  is as inverseLerp,
-  ps as isBetween,
-  fs as isBetweenAngle,
-  Wt as isPointInPolygon,
-  zs as isPolygonIntersect,
-  gs as isPowerOfTwo,
-  Ot as lerp,
-  ns as mapLinear,
+  zs as floorPowerOfTwo,
+  Ns as generateAveragedKnots,
+  Xs as generateChordKnots,
+  Ds as generateSqrtChordKnots,
+  hs as generateUUID,
+  Fs as generateUniformKnots,
+  Os as getOcsAngle,
+  Ys as getOcsReferenceVector,
+  Ht as intPartLength,
+  vs as interpolateControlPoints,
+  ss as interpolateNurbsCurve,
+  cs as inverseLerp,
+  Ms as isBetween,
+  Ps as isBetweenAngle,
+  ts as isPointInPolygon,
+  Bs as isPolygonIntersect,
+  As as isPowerOfTwo,
+  Wt as lerp,
+  as as mapLinear,
   pt as normalizeAngle,
-  os as pingpong,
-  xs as radToDeg,
-  ls as randFloat,
-  us as randFloatSpread,
-  cs as randInt,
-  As as relativeEps,
-  ds as seededRandom,
-  as as smootherstep,
-  hs as smoothstep
+  us as pingpong,
+  fs as radToDeg,
+  gs as randFloat,
+  ys as randFloatSpread,
+  xs as randInt,
+  bs as relativeEps,
+  _s as seededRandom,
+  ms as smootherstep,
+  ds as smoothstep,
+  Zs as transformOcsPointToWcs,
+  Yt as transformWcsPointToOcs
 };