@mlightcad/geometry-engine 3.2.16 → 3.2.17

package/dist/geometry-engine.js

@@ -1,5 +1,5 @@
-import { AcCmErrors as q } from "@mlightcad/common";
-const R = [
+import { AcCmErrors as L } from "@mlightcad/common";
+const N = [
   "00",
   "01",
   "02",
@@ -257,100 +257,100 @@ const R = [
   "fe",
   "ff"
 ];
-let Nt = 1234567;
-const Ft = Math.PI / 180, Xt = 180 / Math.PI;
+let Rt = 1234567;
+const Xt = Math.PI / 180, Dt = 180 / Math.PI;
 function Jt() {
-  const u = Math.random() * 4294967295 | 0, t = Math.random() * 4294967295 | 0, s = Math.random() * 4294967295 | 0, e = Math.random() * 4294967295 | 0;
-  return (R[u & 255] + R[u >> 8 & 255] + R[u >> 16 & 255] + R[u >> 24 & 255] + "-" + R[t & 255] + R[t >> 8 & 255] + "-" + R[t >> 16 & 15 | 64] + R[t >> 24 & 255] + "-" + R[s & 63 | 128] + R[s >> 8 & 255] + "-" + R[s >> 16 & 255] + R[s >> 24 & 255] + R[e & 255] + R[e >> 8 & 255] + R[e >> 16 & 255] + R[e >> 24 & 255]).toLowerCase();
+  const d = Math.random() * 4294967295 | 0, t = Math.random() * 4294967295 | 0, s = Math.random() * 4294967295 | 0, e = Math.random() * 4294967295 | 0;
+  return (N[d & 255] + N[d >> 8 & 255] + N[d >> 16 & 255] + N[d >> 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 v(u, t, s) {
-  return Math.max(t, Math.min(s, u));
+function Z(d, t, s) {
+  return Math.max(t, Math.min(s, d));
 }
-function Yt(u, t) {
-  return (u % t + t) % t;
+function Yt(d, t) {
+  return (d % t + t) % t;
 }
-function ts(u, t, s, e, n) {
-  return e + (u - t) * (n - e) / (s - t);
+function ts(d, t, s, e, n) {
+  return e + (d - t) * (n - e) / (s - t);
 }
-function ss(u, t, s) {
-  return u !== t ? (s - u) / (t - u) : 0;
+function ss(d, t, s) {
+  return d !== t ? (s - d) / (t - d) : 0;
 }
-function Dt(u, t, s) {
-  return (1 - s) * u + s * t;
+function vt(d, t, s) {
+  return (1 - s) * d + s * t;
 }
-function es(u, t, s, e) {
-  return Dt(u, t, 1 - Math.exp(-s * e));
+function es(d, t, s, e) {
+  return vt(d, t, 1 - Math.exp(-s * e));
 }
-function ns(u, t = 1) {
-  return t - Math.abs(Yt(u, t * 2) - t);
+function ns(d, t = 1) {
+  return t - Math.abs(Yt(d, t * 2) - t);
 }
-function is(u, t, s) {
-  return u <= t ? 0 : u >= s ? 1 : (u = (u - t) / (s - t), u * u * (3 - 2 * u));
+function is(d, t, s) {
+  return d <= t ? 0 : d >= s ? 1 : (d = (d - t) / (s - t), d * d * (3 - 2 * d));
 }
-function rs(u, t, s) {
-  return u <= t ? 0 : u >= s ? 1 : (u = (u - t) / (s - t), u * u * u * (u * (u * 6 - 15) + 10));
+function rs(d, t, s) {
+  return d <= t ? 0 : d >= s ? 1 : (d = (d - t) / (s - t), d * d * d * (d * (d * 6 - 15) + 10));
 }
-function hs(u, t) {
-  return u + Math.floor(Math.random() * (t - u + 1));
+function os(d, t) {
+  return d + Math.floor(Math.random() * (t - d + 1));
 }
-function os(u, t) {
-  return u + Math.random() * (t - u);
+function hs(d, t) {
+  return d + Math.random() * (t - d);
 }
-function as(u) {
-  return u * (0.5 - Math.random());
+function as(d) {
+  return d * (0.5 - Math.random());
 }
-function cs(u) {
-  u !== void 0 && (Nt = u);
-  let t = Nt += 1831565813;
+function cs(d) {
+  d !== void 0 && (Rt = d);
+  let t = Rt += 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 ls(u) {
-  return u * Ft;
+function ls(d) {
+  return d * Xt;
 }
-function us(u) {
-  return u * Xt;
+function us(d) {
+  return d * Dt;
 }
-function ds(u) {
-  return (u & u - 1) === 0 && u !== 0;
+function ds(d) {
+  return (d & d - 1) === 0 && d !== 0;
 }
-function ms(u) {
-  return Math.pow(2, Math.ceil(Math.log(u) / Math.LN2));
+function ms(d) {
+  return Math.pow(2, Math.ceil(Math.log(d) / Math.LN2));
 }
-function xs(u) {
-  return Math.pow(2, Math.floor(Math.log(u) / Math.LN2));
+function xs(d) {
+  return Math.pow(2, Math.floor(Math.log(d) / Math.LN2));
 }
-function yt(u) {
+function pt(d) {
   const t = Math.PI * 2;
-  return (u % t + t) % t;
+  return (d % t + t) % t;
 }
-function gs(u, t, s) {
-  return u > t && u < s || u > s && u < t;
+function gs(d, t, s) {
+  return d > t && d < s || d > s && d < t;
 }
-function ys(u, t, s, e = !1) {
-  return u = yt(u), t = yt(t), s = yt(s), e ? t > s ? u <= t && u >= s : u <= t || u >= s : t < s ? u >= t && u <= s : u >= t || u <= s;
+function ys(d, t, s, e = !1) {
+  return d = pt(d), t = pt(t), s = pt(s), e ? t > s ? d <= t && d >= s : d <= t || d >= s : t < s ? d >= t && d <= s : d >= t || d <= s;
 }
-function Zt(u) {
-  return u = Math.abs(u), u < 1 ? 0 : Math.ceil(Math.log10(Math.abs(u) + 1));
+function Zt(d) {
+  return d = Math.abs(d), d < 1 ? 0 : Math.ceil(Math.log10(Math.abs(d) + 1));
 }
-function _s(u, t = 1e-7) {
-  const s = Zt(u);
+function _s(d, t = 1e-7) {
+  const s = Zt(d);
   return Math.max(Math.pow(10, s) * t, t);
 }
-const b = {
-  DEG2RAD: Ft,
-  RAD2DEG: Xt,
+const M = {
+  DEG2RAD: Xt,
+  RAD2DEG: Dt,
   generateUUID: Jt,
-  clamp: v,
+  clamp: Z,
   euclideanModulo: Yt,
   mapLinear: ts,
   inverseLerp: ss,
-  lerp: Dt,
+  lerp: vt,
   damp: es,
   pingpong: ns,
   smoothstep: is,
   smootherstep: rs,
-  randInt: hs,
-  randFloat: os,
+  randInt: os,
+  randFloat: hs,
   randFloatSpread: as,
   seededRandom: cs,
   degToRad: ls,
@@ -358,12 +358,12 @@ const b = {
   isPowerOfTwo: ds,
   ceilPowerOfTwo: ms,
   floorPowerOfTwo: xs,
-  normalizeAngle: yt,
+  normalizeAngle: pt,
   isBetween: gs,
   isBetweenAngle: ys,
   intPartLength: Zt,
   relativeEps: _s
-}, H = class H {
+}, tt = class tt {
   constructor(t, s) {
     this.x = 0, this.y = 0;
     const e = +(t !== void 0) + +(s !== void 0);
@@ -381,7 +381,7 @@ const b = {
         this.x = t, this.y = s;
         return;
       }
-      throw q.ILLEGAL_PARAMETERS;
+      throw L.ILLEGAL_PARAMETERS;
     }
   }
   get width() {
@@ -432,7 +432,7 @@ const b = {
     }
   }
   clone() {
-    return new H(this.x, this.y);
+    return new tt(this.x, this.y);
   }
   copy(t) {
     return this.x = t.x, this.y = t.y, this;
@@ -571,23 +571,23 @@ const b = {
   }
   relativeEps(t = 1e-7) {
     return Math.min(
-      b.relativeEps(this.x, t),
-      b.relativeEps(this.y, t)
+      M.relativeEps(this.x, t),
+      M.relativeEps(this.y, t)
     );
   }
   *[Symbol.iterator]() {
     yield this.x, yield this.y;
   }
 };
-H.EMPTY = Object.freeze(new H(0, 0));
-let B = H;
-const W = class W {
-  constructor(t, s, e, n, i, r, h, a, o) {
-    this.elements = [1, 0, 0, 0, 1, 0, 0, 0, 1], t != null && s != null && e != null && n != null && i != null && r != null && h != null && a != null && o != null && this.set(t, s, e, n, i, r, h, a, o);
+tt.EMPTY = Object.freeze(new tt(0, 0));
+let B = tt;
+const st = class st {
+  constructor(t, s, e, n, i, r, o, a, h) {
+    this.elements = [1, 0, 0, 0, 1, 0, 0, 0, 1], t != null && s != null && e != null && n != null && i != null && r != null && o != null && a != null && h != null && this.set(t, s, e, n, i, r, o, a, h);
   }
-  set(t, s, e, n, i, r, h, a, o) {
+  set(t, s, e, n, i, r, o, a, h) {
     const c = this.elements;
-    return c[0] = t, c[1] = n, c[2] = h, c[3] = s, c[4] = i, c[5] = a, c[6] = e, c[7] = r, c[8] = o, this;
+    return c[0] = t, c[1] = n, c[2] = o, c[3] = s, c[4] = i, c[5] = a, c[6] = e, c[7] = r, c[8] = h, this;
   }
   identity() {
     return this.set(1, 0, 0, 0, 1, 0, 0, 0, 1), this;
@@ -610,22 +610,22 @@ const W = class W {
     return this.multiplyMatrices(t, this);
   }
   multiplyMatrices(t, s) {
-    const e = t.elements, n = s.elements, i = this.elements, r = e[0], h = e[3], a = e[6], o = e[1], c = e[4], l = e[7], m = e[2], d = e[5], x = e[8], g = n[0], y = n[3], _ = n[6], M = n[1], A = n[4], P = n[7], z = n[2], E = n[5], f = n[8];
-    return i[0] = r * g + h * M + a * z, i[3] = r * y + h * A + a * E, i[6] = r * _ + h * P + a * f, i[1] = o * g + c * M + l * z, i[4] = o * y + c * A + l * E, i[7] = o * _ + c * P + l * f, i[2] = m * g + d * M + x * z, i[5] = m * y + d * A + x * E, i[8] = m * _ + d * P + x * f, 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], 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] = m * g + u * z + x * P, i[5] = m * y + u * f + x * I, i[8] = m * _ + u * b + x * A, this;
   }
   multiplyScalar(t) {
     const s = this.elements;
     return s[0] *= t, s[3] *= t, s[6] *= t, s[1] *= t, s[4] *= t, s[7] *= t, s[2] *= t, s[5] *= t, s[8] *= t, this;
   }
   determinant() {
-    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], h = t[5], a = t[6], o = t[7], c = t[8];
-    return s * r * c - s * h * o - e * i * c + e * h * a + n * i * o - n * r * a;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], o = t[5], a = t[6], h = t[7], c = t[8];
+    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], h = t[5], a = t[6], o = t[7], c = t[8], l = c * r - h * o, m = h * a - c * i, d = o * i - r * a, x = s * l + e * m + n * d;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], 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, u = h * i - r * a, x = s * l + e * m + n * u;
     if (x === 0) return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0);
     const g = 1 / x;
-    return t[0] = l * g, t[1] = (n * o - c * e) * g, t[2] = (h * e - n * r) * g, t[3] = m * g, t[4] = (c * s - n * a) * g, t[5] = (n * i - h * s) * g, t[6] = d * g, t[7] = (e * a - o * s) * g, t[8] = (r * s - e * i) * g, this;
+    return t[0] = l * g, t[1] = (n * 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] = u * g, t[7] = (e * a - h * s) * g, t[8] = (r * s - e * i) * g, this;
   }
   transpose() {
     let t;
@@ -639,28 +639,28 @@ const W = class W {
     const s = this.elements;
     return t.elements[0] = s[0], t.elements[1] = s[3], t.elements[2] = s[6], t.elements[3] = s[1], t.elements[4] = s[4], t.elements[5] = s[7], t.elements[6] = s[2], t.elements[7] = s[5], t.elements[8] = s[8], this;
   }
-  setUvTransform(t, s, e, n, i, r, h) {
-    const a = Math.cos(i), o = Math.sin(i);
+  setUvTransform(t, s, e, n, i, r, o) {
+    const a = Math.cos(i), h = Math.sin(i);
     return this.set(
       e * a,
-      e * o,
-      -e * (a * r + o * h) + r + t,
-      -n * o,
+      e * h,
+      -e * (a * r + h * o) + r + t,
+      -n * h,
       n * a,
-      -n * (-o * r + a * h) + h + s,
+      -n * (-h * r + a * o) + o + s,
       0,
       0,
       1
     ), this;
   }
   scale(t, s) {
-    return this.premultiply(St.makeScale(t, s)), this;
+    return this.premultiply(Ct.makeScale(t, s)), this;
   }
   rotate(t) {
-    return this.premultiply(St.makeRotation(-t)), this;
+    return this.premultiply(Ct.makeRotation(-t)), this;
   }
   translate(t, s) {
-    return this.premultiply(St.makeTranslation(t, s)), this;
+    return this.premultiply(Ct.makeTranslation(t, s)), this;
   }
   makeTranslation(t, s) {
     return t instanceof B ? this.set(1, 0, t.x, 0, 1, t.y, 0, 0, 1) : this.set(1, 0, t, 0, 1, s, 0, 0, 1), this;
@@ -688,22 +688,22 @@ const W = class W {
     return t[s] = e[0], t[s + 1] = e[1], t[s + 2] = e[2], t[s + 3] = e[3], t[s + 4] = e[4], t[s + 5] = e[5], t[s + 6] = e[6], t[s + 7] = e[7], t[s + 8] = e[8], t;
   }
   clone() {
-    return new W().fromArray(this.elements);
+    return new st().fromArray(this.elements);
   }
 };
-W.IDENTITY = Object.freeze(new W());
-let st = W;
-const St = new st(), Q = 1e-6, I = 2 * Math.PI, Bs = {
+st.IDENTITY = Object.freeze(new st());
+let it = st;
+const Ct = new it(), G = 1e-6, E = 2 * Math.PI, Bs = {
   x: 0,
   y: 0
-}, vt = {
+}, Ot = {
   x: 0,
   y: 0,
   z: 0
 };
-class Gt {
+class Qt {
   constructor() {
-    this.equalPointTol = Q, this.equalVectorTol = Q;
+    this.equalPointTol = G, this.equalVectorTol = G;
   }
   equalPoint2d(t, s) {
     return new B(t).sub(s).length() < this.equalPointTol;
@@ -711,50 +711,50 @@ class Gt {
   equalPoint3d(t, s) {
     return new p(t).sub(s).length() < this.equalPointTol;
   }
-  static equalToZero(t, s = Q) {
+  static equalToZero(t, s = G) {
     return t < s && t > -s;
   }
-  static equal(t, s, e = Q) {
+  static equal(t, s, e = G) {
     return Math.abs(t - s) < e;
   }
-  static great(t, s, e = Q) {
+  static great(t, s, e = G) {
     return t - s > e;
   }
-  static less(t, s, e = Q) {
+  static less(t, s, e = G) {
     return t - s < e;
   }
 }
-const Ot = new Gt();
-function Qt(u, t, s = !1) {
-  const e = u.x, n = u.y;
+const Kt = new Qt();
+function Gt(d, t, s = !1) {
+  const e = d.x, n = d.y;
   let i = !1;
   const r = t.length;
-  for (let h = 0, a = r - 1; h < r; a = h++) {
-    const o = t[h].x, c = t[h].y, l = t[a].x, m = t[a].y;
-    let d = c > n != m > n;
-    s && (d = c >= n != m >= n), d && e < (l - o) * (n - c) / (m - c) + o && (i = !i);
+  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 u = c > n != m > n;
+    s && (u = c >= n != m >= n), u && e < (l - h) * (n - c) / (m - c) + h && (i = !i);
   }
   return i;
 }
-function ps(u, t) {
-  if (u.length === 0 || t.length === 0)
+function ps(d, t) {
+  if (d.length === 0 || t.length === 0)
     return !1;
-  const s = new F().setFromPoints(u), e = new F().setFromPoints(t);
+  const s = new F().setFromPoints(d), e = new F().setFromPoints(t);
   if (!s.intersectsBox(e))
     return !1;
-  for (let n = 0; n < u.length; ) {
-    if (Qt(u[n], t, !0))
+  for (let n = 0; n < d.length; ) {
+    if (Gt(d[n], t, !0))
       return !0;
-    n < u.length - 1 && Ot.equalPoint2d(u[n + 1], u[n]) && ++n, ++n;
+    n < d.length - 1 && Kt.equalPoint2d(d[n + 1], d[n]) && ++n, ++n;
   }
   return !1;
 }
-const As = {
-  isPointInPolygon: Qt,
+const fs = {
+  isPointInPolygon: Gt,
   isPolygonIntersect: ps
 };
-function ks(u, t) {
-  const s = [], e = t - 1, n = u;
+function ks(d, t) {
+  const s = [], e = t - 1, n = d;
   for (let i = 0; i <= n; i++)
     s.push(0);
   for (let i = 1; i <= e - n; i++)
@@ -763,230 +763,230 @@ function ks(u, t) {
     s.push(e - n + 1);
   return s;
 }
-function Ns(u, t) {
-  const s = t.length - 1, e = u, n = [0];
+function Rs(d, t) {
+  const s = t.length - 1, e = d, n = [0];
   let i = 0;
-  for (let h = 1; h <= s; h++) {
-    const a = t[h][0] - t[h - 1][0], o = t[h][1] - t[h - 1][1], c = t[h][2] - t[h - 1][2], l = Math.sqrt(a * a + o * o + c * c);
+  for (let 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 h = 0; h <= e; h++)
+  for (let o = 0; o <= e; o++)
     r.push(0);
-  for (let h = 1; h <= s - e; h++) {
-    const a = n[h] / i;
+  for (let o = 1; o <= s - e; o++) {
+    const a = n[o] / i;
     r.push(a * (s - e + 1));
   }
-  for (let h = 0; h <= e; h++)
+  for (let o = 0; o <= e; o++)
     r.push(s - e + 1);
   return r;
 }
-function fs(u, t = "Uniform") {
-  const s = u.length;
+function As(d, t = "Uniform") {
+  const s = d.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, h) => h / e);
+    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 h = u[r][0] - u[r - 1][0], a = u[r][1] - u[r - 1][1], o = u[r][2] - u[r - 1][2], c = Math.sqrt(h * h + a * a + o * o), l = t === "SqrtChord" ? Math.sqrt(c) : c;
+    const o = d[r][0] - d[r - 1][0], a = d[r][1] - d[r - 1][1], h = d[r][2] - d[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, h) => h / e) : n.map((r) => r / i);
+  return i < 1e-12 ? new Array(s).fill(0).map((r, o) => o / e) : n.map((r) => r / i);
 }
-function zs(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 h = n - e; h <= n; h++)
-    i[h] = r;
-  for (let h = 1; h <= s - e; h++) {
+function zs(d, t) {
+  const s = t.length - 1, e = d, 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 o = h; o < h + e; o++)
-      a += t[o];
-    i[h + e] = a / e;
+    for (let h = o; h < o + e; h++)
+      a += t[h];
+    i[o + e] = a / e;
   }
   return i;
 }
-function Rs(u, t) {
-  const s = t.length - 1, e = u, n = [0];
+function Ns(d, t) {
+  const s = t.length - 1, e = d, n = [0];
   let i = 0;
-  for (let h = 1; h <= s; h++) {
-    const a = t[h][0] - t[h - 1][0], o = t[h][1] - t[h - 1][1], c = t[h][2] - t[h - 1][2], l = Math.sqrt(a * a + o * o + c * c), m = Math.sqrt(l);
+  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 h = 0; h <= e; h++)
+  for (let o = 0; o <= e; o++)
     r.push(0);
-  for (let h = 1; h <= s - e; h++) {
-    const a = n[h] / i;
+  for (let o = 1; o <= s - e; o++) {
+    const a = n[o] / i;
     r.push(a * (s - e + 1));
   }
-  for (let h = 0; h <= e; h++)
+  for (let o = 0; o <= e; o++)
     r.push(s - e + 1);
   return r;
 }
-function Ct(u, t) {
-  const s = u.length, e = u.map((r) => r.slice()), n = t.slice();
+function Et(d, t) {
+  const s = d.length, e = d.map((r) => r.slice()), n = t.slice();
   for (let r = 0; r < s; r++) {
-    let h = r, a = Math.abs(e[r][r]);
-    for (let o = r + 1; o < s; o++) {
-      const c = Math.abs(e[o][r]);
-      c > a && (a = c, h = o);
+    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 (h !== r) {
-      const o = e[r];
-      e[r] = e[h], e[h] = o;
+    if (o !== r) {
+      const h = e[r];
+      e[r] = e[o], e[o] = h;
       const c = n[r];
-      n[r] = n[h], n[h] = c;
+      n[r] = n[o], n[o] = c;
     }
-    for (let o = r + 1; o < s; o++) {
-      const c = e[o][r] / e[r][r];
+    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[o][l] -= c * e[r][l];
-        n[o] -= c * n[r];
+          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 h = n[r];
+    let o = n[r];
     for (let a = r + 1; a < s; a++)
-      h -= e[r][a] * i[a];
-    i[r] = h / e[r][r];
+      o -= e[r][a] * i[a];
+    i[r] = o / e[r][r];
   }
   return i;
 }
-function Kt(u, t, s = "Uniform", e, n) {
-  if (u.length === 0)
+function $t(d, t, s = "Uniform", e, n) {
+  if (d.length === 0)
     return { controlPoints: [], knots: [], weights: [] };
-  const i = u.map((w) => [w[0], w[1], w[2] ?? 0]), r = !!e, h = !!n, a = (r ? 1 : 0) + (h ? 1 : 0), o = i.length - 1, c = o + a;
+  const i = d.map((S) => [S[0], S[1], S[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 = fs(i, s), m = l.slice();
-  r && m.unshift(l[0]), h && m.push(l[l.length - 1]);
-  const d = zs(t, m), x = c + 1, g = new Array(x), y = new Array(x), _ = new Array(x), M = new Array(x);
-  let A = 0;
-  g[A] = new Array(x).fill(0), g[A][0] = 1, y[A] = i[0][0], _[A] = i[0][1], M[A] = i[0][2], A++;
-  for (let w = 1; w <= o - 1; w++) {
-    const T = l[w];
-    g[A] = new Array(x).fill(0);
-    for (let V = 0; V <= c; V++)
-      g[A][V] = At(V, t, T, d);
-    y[A] = i[w][0], _[A] = i[w][1], M[A] = i[w][2], A++;
-  }
-  if (g[A] = new Array(x).fill(0), g[A][c] = 1, y[A] = i[o][0], _[A] = i[o][1], M[A] = i[o][2], A++, r) {
-    const w = d[t + 1] - d[0], T = w !== 0 ? t / w : 0;
-    g[A] = new Array(x).fill(0), g[A][0] = -T, g[A][1] = T, y[A] = (e == null ? void 0 : e[0]) ?? 0, _[A] = (e == null ? void 0 : e[1]) ?? 0, M[A] = (e == null ? void 0 : e[2]) ?? 0, A++;
-  }
-  if (h) {
-    const w = d[c + t + 1] - d[c], T = w !== 0 ? t / w : 0;
-    g[A] = new Array(x).fill(0), g[A][c - 1] = -T, g[A][c] = T, y[A] = (n == null ? void 0 : n[0]) ?? 0, _[A] = (n == null ? void 0 : n[1]) ?? 0, M[A] = (n == null ? void 0 : n[2]) ?? 0, A++;
-  }
-  const P = Ct(g, y), z = Ct(g, _), E = Ct(g, M), f = new Array(x);
-  for (let w = 0; w < x; w++)
-    f[w] = [P[w], z[w], E[w]];
+  const l = As(i, s), m = l.slice();
+  r && m.unshift(l[0]), o && m.push(l[l.length - 1]);
+  const u = zs(t, m), 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 S = 1; S <= h - 1; S++) {
+    const T = l[S];
+    g[f] = new Array(x).fill(0);
+    for (let U = 0; U <= c; U++)
+      g[f][U] = wt(U, t, T, u);
+    y[f] = i[S][0], _[f] = i[S][1], z[f] = i[S][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 S = u[t + 1] - u[0], T = S !== 0 ? t / S : 0;
+    g[f] = new Array(x).fill(0), g[f][0] = -T, g[f][1] = T, 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 S = u[c + t + 1] - u[c], T = S !== 0 ? t / S : 0;
+    g[f] = new Array(x).fill(0), g[f][c - 1] = -T, g[f][c] = T, 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 = Et(g, y), P = Et(g, _), I = Et(g, z), A = new Array(x);
+  for (let S = 0; S < x; S++)
+    A[S] = [b[S], P[S], I[S]];
   const k = new Array(x).fill(1);
-  return { controlPoints: f, knots: d, weights: k };
+  return { controlPoints: A, knots: u, weights: k };
 }
-function At(u, t, s, e) {
+function wt(d, t, s, e) {
   if (t === 0)
-    return s >= e[u] && s < e[u + 1] ? 1 : 0;
-  const n = e[u + t] - e[u], i = e[u + t + 1] - e[u + 1], r = n > 1e-10 ? (s - e[u]) / n : 0, h = i > 1e-10 ? (e[u + t + 1] - s) / i : 0;
-  return r * At(u, t - 1, s, e) + h * At(u + 1, t - 1, s, e);
+    return s >= e[d] && s < e[d + 1] ? 1 : 0;
+  const n = e[d + t] - e[d], i = e[d + t + 1] - e[d + 1], r = n > 1e-10 ? (s - e[d]) / n : 0, o = i > 1e-10 ? (e[d + t + 1] - s) / i : 0;
+  return r * wt(d, t - 1, s, e) + o * wt(d + 1, t - 1, s, e);
 }
-function _t(u, t, s, e, n) {
+function ft(d, 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)
+  if (d = Math.max(s[r], Math.min(s[i + 1], d)), Math.abs(d - s[i + 1]) < 1e-8)
     return [...e[i]];
-  if (Math.abs(u - s[r]) < 1e-8)
+  if (Math.abs(d - s[r]) < 1e-8)
     return [...e[0]];
-  const h = [0, 0, 0];
+  const o = [0, 0, 0];
   let a = 0;
-  for (let o = 0; o <= i; o++) {
-    const c = At(o, r, u, s), l = n[o] * c;
-    h[0] += e[o][0] * l, h[1] += e[o][1] * l, h[2] += e[o][2] * l, a += l;
+  for (let h = 0; h <= i; h++) {
+    const c = wt(h, r, d, 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 o = s[s.length - r - 1];
-    if (Math.abs(u - o) < 1e-8)
+    const h = s[s.length - r - 1];
+    if (Math.abs(d - h) < 1e-8)
       return [...e[i]];
-    if (Math.abs(u - s[r]) < 1e-8)
+    if (Math.abs(d - s[r]) < 1e-8)
       return [...e[0]];
   }
-  return Math.abs(a) >= 1e-10 && (h[0] /= a, h[1] /= a, h[2] /= a), h;
+  return Math.abs(a) >= 1e-10 && (o[0] /= a, o[1] /= a, o[2] /= a), o;
 }
-function Ms(u, t, s, e) {
-  const n = u, i = t[n], r = t[t.length - n - 1];
-  let h = 0;
-  const a = 1e3, o = (r - i) / a;
-  let c = _t(
+function ws(d, t, s, e) {
+  const n = d, i = t[n], r = t[t.length - n - 1];
+  let o = 0;
+  const a = 1e3, h = (r - i) / a;
+  let c = ft(
     i,
-    u,
+    d,
     t,
     s,
     e
   );
   for (let g = 1; g <= a; g++) {
-    const y = i + g * o, _ = _t(y, u, t, s, e), M = _[0] - c[0], A = _[1] - c[1], P = _[2] - c[2];
-    h += Math.sqrt(M * M + A * A + P * P), c = _;
+    const y = i + g * h, _ = ft(y, d, 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 = _t(
+  const l = ft(
     r,
-    u,
+    d,
     t,
     s,
     e
-  ), m = l[0] - c[0], d = l[1] - c[1], x = l[2] - c[2];
-  return h += Math.sqrt(m * m + d * d + x * x), h;
+  ), m = l[0] - c[0], u = l[1] - c[1], x = l[2] - c[2];
+  return o += Math.sqrt(m * m + u * u + x * x), o;
 }
-function Ts(u, t = 3, s = "Uniform", e, n) {
-  return u.length === 0 ? [] : Kt(
-    u,
+function Ts(d, t = 3, s = "Uniform", e, n) {
+  return d.length === 0 ? [] : $t(
+    d,
     t,
     s,
     e,
     n
   ).controlPoints;
 }
-class Pt {
+class bt {
   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, h) {
-    let a = e[n + 0], o = e[n + 1], c = e[n + 2], l = e[n + 3];
-    const m = i[r + 0], d = i[r + 1], x = i[r + 2], g = i[r + 3];
-    if (h === 0) {
-      t[s + 0] = a, t[s + 1] = o, t[s + 2] = c, t[s + 3] = l;
+  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 m = i[r + 0], u = 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 (h === 1) {
-      t[s + 0] = m, t[s + 1] = d, t[s + 2] = x, t[s + 3] = g;
+    if (o === 1) {
+      t[s + 0] = m, t[s + 1] = u, t[s + 2] = x, t[s + 3] = g;
       return;
     }
-    if (l !== g || a !== m || o !== d || c !== x) {
-      let y = 1 - h;
-      const _ = a * m + o * d + c * x + l * g, M = _ >= 0 ? 1 : -1, A = 1 - _ * _;
-      if (A > Number.EPSILON) {
-        const z = Math.sqrt(A), E = Math.atan2(z, _ * M);
-        y = Math.sin(y * E) / z, h = Math.sin(h * E) / z;
+    if (l !== g || a !== m || h !== u || c !== x) {
+      let y = 1 - o;
+      const _ = a * m + h * u + c * x + l * g, z = _ >= 0 ? 1 : -1, f = 1 - _ * _;
+      if (f > Number.EPSILON) {
+        const P = Math.sqrt(f), I = Math.atan2(P, _ * z);
+        y = Math.sin(y * I) / P, o = Math.sin(o * I) / P;
       }
-      const P = h * M;
-      if (a = a * y + m * P, o = o * y + d * P, c = c * y + x * P, l = l * y + g * P, y === 1 - h) {
-        const z = 1 / Math.sqrt(a * a + o * o + c * c + l * l);
-        a *= z, o *= z, c *= z, l *= z;
+      const b = o * z;
+      if (a = a * y + m * b, h = h * y + u * 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;
       }
     }
-    t[s] = a, t[s + 1] = o, t[s + 2] = c, t[s + 3] = l;
+    t[s] = a, t[s + 1] = h, t[s + 2] = c, t[s + 3] = l;
   }
   static multiplyQuaternionsFlat(t, s, e, n, i, r) {
-    const h = e[n], a = e[n + 1], o = e[n + 2], c = e[n + 3], l = i[r], m = i[r + 1], d = i[r + 2], x = i[r + 3];
-    return t[s] = h * x + c * l + a * d - o * m, t[s + 1] = a * x + c * m + o * l - h * d, t[s + 2] = o * x + c * d + h * m - a * l, t[s + 3] = c * x - h * l - a * m - o * d, t;
+    const o = e[n], a = e[n + 1], h = e[n + 2], c = e[n + 3], l = i[r], m = i[r + 1], u = i[r + 2], x = i[r + 3];
+    return t[s] = o * x + c * l + a * u - h * m, t[s + 1] = a * x + c * m + h * l - o * u, t[s + 2] = h * x + c * u + o * m - a * l, t[s + 3] = c * x - o * l - a * m - h * u, t;
   }
   get x() {
     return this._x;
@@ -1016,31 +1016,31 @@ class Pt {
     return this._x = t, this._y = s, this._z = e, this._w = n, this._onChangeCallback(), this;
   }
   clone() {
-    return new Pt(this._x, this._y, this._z, this._w);
+    return new bt(this._x, this._y, this._z, this._w);
   }
   copy(t) {
     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, h = Math.cos, a = Math.sin, o = h(e / 2), c = h(n / 2), l = h(i / 2), m = a(e / 2), d = a(n / 2), x = a(i / 2);
+    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), u = a(n / 2), x = a(i / 2);
     switch (r) {
       case "XYZ":
-        this._x = m * c * l + o * d * x, this._y = o * d * l - m * c * x, this._z = o * c * x + m * d * l, this._w = o * c * l - m * d * x;
+        this._x = m * c * l + h * u * x, this._y = h * u * l - m * c * x, this._z = h * c * x + m * u * l, this._w = h * c * l - m * u * x;
         break;
       case "YXZ":
-        this._x = m * c * l + o * d * x, this._y = o * d * l - m * c * x, this._z = o * c * x - m * d * l, this._w = o * c * l + m * d * x;
+        this._x = m * c * l + h * u * x, this._y = h * u * l - m * c * x, this._z = h * c * x - m * u * l, this._w = h * c * l + m * u * x;
         break;
       case "ZXY":
-        this._x = m * c * l - o * d * x, this._y = o * d * l + m * c * x, this._z = o * c * x + m * d * l, this._w = o * c * l - m * d * x;
+        this._x = m * c * l - h * u * x, this._y = h * u * l + m * c * x, this._z = h * c * x + m * u * l, this._w = h * c * l - m * u * x;
         break;
       case "ZYX":
-        this._x = m * c * l - o * d * x, this._y = o * d * l + m * c * x, this._z = o * c * x - m * d * l, this._w = o * c * l + m * d * x;
+        this._x = m * c * l - h * u * x, this._y = h * u * l + m * c * x, this._z = h * c * x - m * u * l, this._w = h * c * l + m * u * x;
         break;
       case "YZX":
-        this._x = m * c * l + o * d * x, this._y = o * d * l + m * c * x, this._z = o * c * x - m * d * l, this._w = o * c * l - m * d * x;
+        this._x = m * c * l + h * u * x, this._y = h * u * l + m * c * x, this._z = h * c * x - m * u * l, this._w = h * c * l - m * u * x;
         break;
       case "XZY":
-        this._x = m * c * l - o * d * x, this._y = o * d * l - m * c * x, this._z = o * c * x + m * d * l, this._w = o * c * l + m * d * x;
+        this._x = m * c * l - h * u * x, this._y = h * u * l - m * c * x, this._z = h * c * x + m * u * l, this._w = h * c * l + m * u * x;
         break;
     }
     return s === !0 && this._onChangeCallback(), this;
@@ -1050,19 +1050,19 @@ class Pt {
     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], h = s[5], a = s[9], o = s[2], c = s[6], l = s[10], m = e + h + l;
+    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 - o) * d, this._z = (r - n) * d;
-    } else if (e > h && e > l) {
-      const d = 2 * Math.sqrt(1 + e - h - l);
-      this._w = (c - a) / d, this._x = 0.25 * d, this._y = (n + r) / d, this._z = (i + o) / d;
-    } else if (h > l) {
-      const d = 2 * Math.sqrt(1 + h - e - l);
-      this._w = (i - o) / d, this._x = (n + r) / d, this._y = 0.25 * d, this._z = (a + c) / d;
+      const u = 0.5 / Math.sqrt(m + 1);
+      this._w = 0.25 / u, this._x = (c - a) * u, this._y = (i - h) * u, this._z = (r - n) * u;
+    } 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;
+    } 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;
     } else {
-      const d = 2 * Math.sqrt(1 + l - e - h);
-      this._w = (r - n) / d, this._x = (i + o) / d, this._y = (a + c) / d, this._z = 0.25 * d;
+      const 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;
     }
     return this._onChangeCallback(), this;
   }
@@ -1071,7 +1071,7 @@ class Pt {
     return e < Number.EPSILON ? (e = 0, Math.abs(t.x) > Math.abs(t.z) ? (this._x = -t.y, this._y = t.x, this._z = 0, this._w = e) : (this._x = 0, this._y = -t.z, this._z = t.y, this._w = e)) : (this._x = t.y * s.z - t.z * s.y, this._y = t.z * s.x - t.x * s.z, this._z = t.x * s.y - t.y * s.x, this._w = e), this.normalize();
   }
   angleTo(t) {
-    return 2 * Math.acos(Math.abs(v(this.dot(t), -1, 1)));
+    return 2 * Math.acos(Math.abs(Z(this.dot(t), -1, 1)));
   }
   rotateTowards(t, s) {
     const e = this.angleTo(t);
@@ -1110,22 +1110,22 @@ class Pt {
     return this.multiplyQuaternions(t, this);
   }
   multiplyQuaternions(t, s) {
-    const e = t._x, n = t._y, i = t._z, r = t._w, h = s._x, a = s._y, o = s._z, c = s._w;
-    return this._x = e * c + r * h + n * o - i * a, this._y = n * c + r * a + i * h - e * o, this._z = i * c + r * o + e * a - n * h, this._w = r * c - e * h - n * a - i * o, this._onChangeCallback(), this;
+    const e = t._x, n = t._y, i = t._z, r = t._w, o = s._x, a = s._y, h = s._z, c = s._w;
+    return this._x = e * c + r * o + n * h - i * a, this._y = n * c + r * a + i * o - e * h, this._z = i * c + r * h + e * a - n * o, this._w = r * c - e * o - n * a - i * h, this._onChangeCallback(), this;
   }
   slerp(t, s) {
     if (s === 0) return this;
     if (s === 1) return this.copy(t);
     const e = this._x, n = this._y, i = this._z, r = this._w;
-    let h = r * t._w + e * t._x + n * t._y + i * t._z;
-    if (h < 0 ? (this._w = -t._w, this._x = -t._x, this._y = -t._y, this._z = -t._z, h = -h) : this.copy(t), h >= 1)
+    let o = r * t._w + e * t._x + n * t._y + i * t._z;
+    if (o < 0 ? (this._w = -t._w, this._x = -t._x, this._y = -t._y, this._z = -t._z, o = -o) : this.copy(t), o >= 1)
       return this._w = r, this._x = e, this._y = n, this._z = i, this;
-    const a = 1 - h * h;
+    const a = 1 - o * o;
     if (a <= Number.EPSILON) {
-      const d = 1 - s;
-      return this._w = d * r + s * this._w, this._x = d * e + s * this._x, this._y = d * n + s * this._y, this._z = d * i + s * this._z, this.normalize(), this;
+      const 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 o = Math.sqrt(a), c = Math.atan2(o, h), l = Math.sin((1 - s) * c) / o, m = Math.sin(s * c) / o;
+    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) {
@@ -1161,7 +1161,7 @@ class Pt {
     yield this._x, yield this._y, yield this._z, yield this._w;
   }
 }
-const N = class N {
+const R = class R {
   constructor(t, s, e) {
     this.x = 0, this.y = 0, this.z = 0;
     const n = +(t !== void 0) + +(s !== void 0) + +(e !== void 0);
@@ -1171,15 +1171,15 @@ const N = class N {
         return;
       }
       if (n === 1) {
-        const { x: i, y: r, z: h } = t;
-        this.x = i, this.y = r, this.z = h || 0;
+        const { x: i, y: r, z: o } = t;
+        this.x = i, this.y = r, this.z = o || 0;
         return;
       }
       if (n === 3) {
         this.x = t, this.y = s, this.z = e;
         return;
       }
-      throw q.ILLEGAL_PARAMETERS;
+      throw L.ILLEGAL_PARAMETERS;
     }
   }
   set(t, s, e) {
@@ -1226,7 +1226,7 @@ const N = class N {
     }
   }
   clone() {
-    return new N(this.x, this.y, this.z);
+    return new R(this.x, this.y, this.z);
   }
   copy(t) {
     return this.x = t.x, this.y = t.y, this.z = t.z || 0, this;
@@ -1262,10 +1262,10 @@ const N = class N {
     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(Rt.setFromEuler(t));
+    return this.applyQuaternion(Nt.setFromEuler(t));
   }
   applyAxisAngle(t, s) {
-    return this.applyQuaternion(Rt.setFromAxisAngle(t, s));
+    return this.applyQuaternion(Nt.setFromAxisAngle(t, s));
   }
   applyMatrix3(t) {
     const s = this.x, e = this.y, n = this.z, i = t.elements;
@@ -1279,8 +1279,8 @@ const N = class N {
     return this.x = (i[0] * s + i[4] * e + i[8] * n + i[12]) * r, this.y = (i[1] * s + i[5] * e + i[9] * n + i[13]) * r, this.z = (i[2] * s + i[6] * e + i[10] * n + i[14]) * r, this;
   }
   applyQuaternion(t) {
-    const s = this.x, e = this.y, n = this.z, i = t.x, r = t.y, h = t.z, a = t.w, o = 2 * (r * n - h * e), c = 2 * (h * s - i * n), l = 2 * (i * e - r * s);
-    return this.x = s + a * o + r * l - h * c, this.y = e + a * c + h * o - i * l, this.z = n + a * l + i * c - r * o, this;
+    const s = this.x, e = this.y, n = this.z, i = t.x, r = t.y, o = t.z, a = t.w, h = 2 * (r * n - o * e), c = 2 * (o * s - i * n), l = 2 * (i * e - r * s);
+    return this.x = s + a * h + r * l - o * c, this.y = e + a * c + o * h - i * l, this.z = n + a * l + i * c - r * h, this;
   }
   transformDirection(t) {
     const s = this.x, e = this.y, n = this.z, i = t.elements;
@@ -1357,8 +1357,8 @@ const N = class N {
     return this.crossVectors(this, t);
   }
   crossVectors(t, s) {
-    const e = t.x, n = t.y, i = t.z, r = s.x, h = s.y, a = s.z;
-    return this.x = n * a - i * h, this.y = i * r - e * a, this.z = e * h - n * r, this;
+    const e = t.x, n = t.y, i = t.z, r = s.x, o = s.y, a = s.z;
+    return this.x = n * a - i * o, this.y = i * r - e * a, this.z = e * o - n * r, this;
   }
   projectOnVector(t) {
     const s = t.lengthSq();
@@ -1367,10 +1367,10 @@ const N = class N {
     return this.copy(t).multiplyScalar(e);
   }
   projectOnPlane(t) {
-    return Et.copy(this).projectOnVector(t), this.sub(Et);
+    return It.copy(this).projectOnVector(t), this.sub(It);
   }
   reflect(t) {
-    return this.sub(Et.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());
@@ -1422,38 +1422,38 @@ const N = class N {
     yield this.x, yield this.y, yield this.z;
   }
 };
-N.ORIGIN = Object.freeze(new N(0, 0, 0)), N.X_AXIS = Object.freeze(new N(1, 0, 0)), N.NEGATIVE_X_AXIS = Object.freeze(new N(-1, 0, 0)), N.Y_AXIS = Object.freeze(new N(0, 1, 0)), N.NEGATIVE_Y_AXIS = Object.freeze(new N(0, -1, 0)), N.Z_AXIS = Object.freeze(new N(0, 0, 1)), N.NEGATIVE_Z_AXIS = Object.freeze(new N(0, 0, -1));
-let p = N;
-const Et = new p(), Rt = new Pt(), J = class J {
-  constructor(t, s, e, n, i, r, h, a, o, 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 && h != null && a != null && o != null && c != null && l != null && m != null && d != null && x != null && g != null && y != null && this.set(
+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 It = new p(), Nt = new bt(), et = class et {
+  constructor(t, s, e, n, i, r, o, a, h, c, l, m, 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 && m != null && u != null && x != null && g != null && y != null && this.set(
       t,
       s,
       e,
       n,
       i,
       r,
-      h,
-      a,
       o,
+      a,
+      h,
       c,
       l,
       m,
-      d,
+      u,
       x,
       g,
       y
     );
   }
-  set(t, s, e, n, i, r, h, a, o, c, l, m, d, x, g, y) {
+  set(t, s, e, n, i, r, o, a, h, c, l, m, u, x, g, y) {
     const _ = this.elements;
-    return _[0] = t, _[4] = s, _[8] = e, _[12] = n, _[1] = i, _[5] = r, _[9] = h, _[13] = a, _[2] = o, _[6] = c, _[10] = l, _[14] = m, _[3] = d, _[7] = x, _[11] = g, _[15] = y, this;
+    return _[0] = t, _[4] = s, _[8] = e, _[12] = n, _[1] = i, _[5] = r, _[9] = o, _[13] = a, _[2] = h, _[6] = c, _[10] = l, _[14] = m, _[3] = u, _[7] = x, _[11] = g, _[15] = y, this;
   }
   identity() {
     return this.set(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1), this;
   }
   clone() {
-    return new J().fromArray(this.elements);
+    return new et().fromArray(this.elements);
   }
   copy(t) {
     const s = this.elements, e = t.elements;
@@ -1485,7 +1485,7 @@ const Et = new p(), Rt = new Pt(), J = class J {
     ), this;
   }
   setFromExtrusionDirection(t) {
-    if (Ot.equalPoint3d(t, p.Z_AXIS))
+    if (Kt.equalPoint3d(t, p.Z_AXIS))
       this.identity();
     else {
       const s = new p(1, 0, 0);
@@ -1536,15 +1536,15 @@ const Et = new p(), Rt = new Pt(), J = class J {
     ), this;
   }
   extractRotation(t) {
-    const s = this.elements, e = t.elements, n = 1 / K.setFromMatrixColumn(t, 0).length(), i = 1 / K.setFromMatrixColumn(t, 1).length(), r = 1 / K.setFromMatrixColumn(t, 2).length();
+    const s = this.elements, e = t.elements, n = 1 / $.setFromMatrixColumn(t, 0).length(), i = 1 / $.setFromMatrixColumn(t, 1).length(), r = 1 / $.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) {
-    return this.compose(ws, t, Ps);
+    return this.compose(Ms, t, Ps);
   }
   lookAt(t, s, e) {
     const n = this.elements;
-    return L.subVectors(t, s), L.lengthSq() === 0 && (L.z = 1), L.normalize(), Z.crossVectors(e, L), Z.lengthSq() === 0 && (Math.abs(e.z) === 1 ? L.x += 1e-4 : L.z += 1e-4, L.normalize(), Z.crossVectors(e, L)), Z.normalize(), xt.crossVectors(L, Z), n[0] = Z.x, n[4] = xt.x, n[8] = L.x, n[1] = Z.y, n[5] = xt.y, n[9] = L.y, n[2] = Z.z, n[6] = xt.z, n[10] = L.z, this;
+    return V.subVectors(t, s), V.lengthSq() === 0 && (V.z = 1), V.normalize(), v.crossVectors(e, V), v.lengthSq() === 0 && (Math.abs(e.z) === 1 ? V.x += 1e-4 : V.z += 1e-4, V.normalize(), v.crossVectors(e, V)), v.normalize(), yt.crossVectors(V, v), n[0] = v.x, n[4] = yt.x, n[8] = V.x, n[1] = v.y, n[5] = yt.y, n[9] = V.y, n[2] = v.z, n[6] = yt.z, n[10] = V.z, this;
   }
   multiply(t) {
     return this.multiplyMatrices(this, t);
@@ -1553,16 +1553,16 @@ const Et = new p(), Rt = new Pt(), J = class J {
     return this.multiplyMatrices(t, this);
   }
   multiplyMatrices(t, s) {
-    const e = t.elements, n = s.elements, i = this.elements, r = e[0], h = e[4], a = e[8], o = e[12], c = e[1], l = e[5], m = e[9], d = e[13], x = e[2], g = e[6], y = e[10], _ = e[14], M = e[3], A = e[7], P = e[11], z = e[15], E = n[0], f = n[4], k = n[8], w = n[12], T = n[1], V = n[5], O = n[9], rt = n[13], ht = n[2], ot = n[6], at = n[10], ct = n[14], lt = n[3], ut = n[7], dt = n[11], mt = n[15];
-    return i[0] = r * E + h * T + a * ht + o * lt, i[4] = r * f + h * V + a * ot + o * ut, i[8] = r * k + h * O + a * at + o * dt, i[12] = r * w + h * rt + a * ct + o * mt, i[1] = c * E + l * T + m * ht + d * lt, i[5] = c * f + l * V + m * ot + d * ut, i[9] = c * k + l * O + m * at + d * dt, i[13] = c * w + l * rt + m * ct + d * mt, i[2] = x * E + g * T + y * ht + _ * lt, i[6] = x * f + g * V + y * ot + _ * ut, i[10] = x * k + g * O + y * at + _ * dt, i[14] = x * w + g * rt + y * ct + _ * mt, i[3] = M * E + A * T + P * ht + z * lt, i[7] = M * f + A * V + P * ot + z * ut, i[11] = M * k + A * O + P * at + z * dt, i[15] = M * w + A * rt + P * ct + z * mt, 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], 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], S = n[12], T = n[1], U = n[5], K = 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 * T + a * at + h * dt, i[4] = r * A + o * U + a * ct + h * mt, i[8] = r * k + o * K + a * lt + h * xt, i[12] = r * S + o * ht + a * ut + h * gt, i[1] = c * I + l * T + m * at + u * dt, i[5] = c * A + l * U + m * ct + u * mt, i[9] = c * k + l * K + m * lt + u * xt, i[13] = c * S + l * ht + m * ut + u * gt, i[2] = x * I + g * T + y * at + _ * dt, i[6] = x * A + g * U + y * ct + _ * mt, i[10] = x * k + g * K + y * lt + _ * xt, i[14] = x * S + g * ht + y * ut + _ * gt, i[3] = z * I + f * T + b * at + P * dt, i[7] = z * A + f * U + b * ct + P * mt, i[11] = z * k + f * K + b * lt + P * xt, i[15] = z * S + 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], h = t[5], a = t[9], o = t[13], c = t[2], l = t[6], m = t[10], d = t[14], x = t[3], g = t[7], y = t[11], _ = t[15];
-    return x * (+i * a * l - n * o * l - i * h * m + e * o * m + n * h * d - e * a * d) + g * (+s * a * d - s * o * m + i * r * m - n * r * d + n * o * c - i * a * c) + y * (+s * o * l - s * h * d - i * r * l + e * r * d + i * h * c - e * o * c) + _ * (-n * h * c - s * a * l + s * h * m + n * r * l - e * r * m + e * a * c);
+    const t = this.elements, s = t[0], e = t[4], n = t[8], i = t[12], r = t[1], o = t[5], a = t[9], h = t[13], c = t[2], l = t[6], m = 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 * m + e * h * m + n * o * u - e * a * u) + g * (+s * a * u - s * h * m + i * r * m - 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 * m + n * r * l - e * r * m + e * a * c);
   }
   transpose() {
     const t = this.elements;
@@ -1574,11 +1574,11 @@ const Et = new p(), Rt = new Pt(), J = class J {
     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;
   }
   invert() {
-    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], h = t[5], a = t[6], o = t[7], c = t[8], l = t[9], m = t[10], d = t[11], x = t[12], g = t[13], y = t[14], _ = t[15], M = l * y * o - g * m * o + g * a * d - h * y * d - l * a * _ + h * m * _, A = x * m * o - c * y * o - x * a * d + r * y * d + c * a * _ - r * m * _, P = c * g * o - x * l * o + x * h * d - r * g * d - c * h * _ + r * l * _, z = x * l * a - c * g * a - x * h * m + r * g * m + c * h * y - r * l * y, E = s * M + e * A + n * P + i * z;
-    if (E === 0)
+    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], u = t[11], x = t[12], g = t[13], y = t[14], _ = t[15], z = l * y * h - g * m * h + g * a * u - o * y * u - l * a * _ + o * m * _, f = x * m * h - c * y * h - x * a * u + r * y * u + c * a * _ - r * m * _, 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 * 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 f = 1 / E;
-    return t[0] = M * f, t[1] = (g * m * i - l * y * i - g * n * d + e * y * d + l * n * _ - e * m * _) * f, t[2] = (h * y * i - g * a * i + g * n * o - e * y * o - h * n * _ + e * a * _) * f, t[3] = (l * a * i - h * m * i - l * n * o + e * m * o + h * n * d - e * a * d) * f, t[4] = A * f, t[5] = (c * y * i - x * m * i + x * n * d - s * y * d - c * n * _ + s * m * _) * f, t[6] = (x * a * i - r * y * i - x * n * o + s * y * o + r * n * _ - s * a * _) * f, t[7] = (r * m * i - c * a * i + c * n * o - s * m * o - r * n * d + s * a * d) * f, t[8] = P * f, t[9] = (x * l * i - c * g * i - x * e * d + s * g * d + c * e * _ - s * l * _) * f, t[10] = (r * g * i - x * h * i + x * e * o - s * g * o - r * e * _ + s * h * _) * f, t[11] = (c * h * i - r * l * i - c * e * o + s * l * o + r * e * d - s * h * d) * f, t[12] = z * f, t[13] = (c * g * n - x * l * n + x * e * m - s * g * m - c * e * y + s * l * y) * f, t[14] = (x * h * n - r * g * n - x * e * a + s * g * a + r * e * y - s * h * y) * f, t[15] = (r * l * n - c * h * n + c * e * a - s * l * a - r * e * m + s * h * m) * f, this;
+    const A = 1 / I;
+    return t[0] = z * A, t[1] = (g * m * i - l * y * i - g * n * u + e * y * u + l * n * _ - e * m * _) * 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 * m * i - l * n * h + e * m * h + o * n * u - e * a * u) * A, t[4] = f * A, t[5] = (c * y * i - x * m * i + x * n * u - s * y * u - c * n * _ + s * m * _) * A, t[6] = (x * a * i - r * y * i - x * n * h + s * y * h + r * n * _ - s * a * _) * A, t[7] = (r * m * i - c * a * i + c * n * h - s * m * 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 * 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;
@@ -1604,17 +1604,17 @@ const Et = new p(), Rt = new Pt(), J = class J {
     return this.set(s, -e, 0, 0, e, s, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1), this;
   }
   makeRotationAxis(t, s) {
-    const e = Math.cos(s), n = Math.sin(s), i = 1 - e, r = t.x, h = t.y, a = t.z, o = i * r, c = i * h;
+    const e = Math.cos(s), n = Math.sin(s), i = 1 - e, r = t.x, o = t.y, a = t.z, h = i * r, c = i * o;
     return this.set(
-      o * r + e,
-      o * h - n * a,
-      o * a + n * h,
+      h * r + e,
+      h * o - n * a,
+      h * a + n * o,
       0,
-      o * h + n * a,
-      c * h + e,
+      h * o + n * a,
+      c * o + e,
       c * a - n * r,
       0,
-      o * a - n * h,
+      h * a - n * o,
       c * a + n * r,
       i * a * a + e,
       0,
@@ -1631,16 +1631,16 @@ const Et = new p(), Rt = new Pt(), J = class J {
     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, h = s.z, a = s.w, o = i + i, c = r + r, l = h + h, m = i * o, d = i * c, x = i * l, g = r * c, y = r * l, _ = h * l, M = a * o, A = a * c, P = a * l, z = e.x, E = e.y, f = e.z;
-    return n[0] = (1 - (g + _)) * z, n[1] = (d + P) * z, n[2] = (x - A) * z, n[3] = 0, n[4] = (d - P) * E, n[5] = (1 - (m + _)) * E, n[6] = (y + M) * E, n[7] = 0, n[8] = (x + A) * f, n[9] = (y - M) * f, n[10] = (1 - (m + g)) * f, 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, 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 - (m + _)) * 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 = K.set(n[0], n[1], n[2]).length();
-    const r = K.set(n[4], n[5], n[6]).length(), h = K.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], j.copy(this);
-    const o = 1 / i, c = 1 / r, l = 1 / h;
-    return j.elements[0] *= o, j.elements[1] *= o, j.elements[2] *= o, j.elements[4] *= c, j.elements[5] *= c, j.elements[6] *= c, j.elements[8] *= l, j.elements[9] *= l, j.elements[10] *= l, s.setFromRotationMatrix(j), e.x = i, e.y = r, e.z = h, this;
+    let i = $.set(n[0], n[1], n[2]).length();
+    const r = $.set(n[4], n[5], n[6]).length(), o = $.set(n[8], n[9], n[10]).length();
+    this.determinant() < 0 && (i = -i), t.x = n[12], t.y = n[13], t.z = n[14], q.copy(this);
+    const h = 1 / i, c = 1 / r, l = 1 / o;
+    return q.elements[0] *= h, q.elements[1] *= h, q.elements[2] *= h, q.elements[4] *= c, q.elements[5] *= c, q.elements[6] *= c, q.elements[8] *= l, q.elements[9] *= l, q.elements[10] *= l, s.setFromRotationMatrix(q), e.x = i, e.y = r, e.z = o, this;
   }
   equals(t) {
     const s = this.elements, e = t.elements;
@@ -1658,10 +1658,10 @@ const Et = new p(), Rt = new Pt(), J = class J {
     return t[s] = e[0], t[s + 1] = e[1], t[s + 2] = e[2], t[s + 3] = e[3], t[s + 4] = e[4], t[s + 5] = e[5], t[s + 6] = e[6], t[s + 7] = e[7], t[s + 8] = e[8], t[s + 9] = e[9], t[s + 10] = e[10], t[s + 11] = e[11], t[s + 12] = e[12], t[s + 13] = e[13], t[s + 14] = e[14], t[s + 15] = e[15], t;
   }
 };
-J.IDENTITY = Object.freeze(new J());
-let et = J;
-const K = new p(), j = new et(), ws = new p(0, 0, 0), Ps = new p(1, 1, 1), Z = new p(), xt = new p(), L = new p();
-class D {
+et.IDENTITY = Object.freeze(new et());
+let H = et;
+const $ = new p(), q = new H(), Ms = new p(0, 0, 0), Ps = new p(1, 1, 1), v = new p(), yt = new p(), V = new p();
+class Y {
   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);
   }
@@ -1671,7 +1671,7 @@ class D {
   setFromArray(t) {
     this.makeEmpty();
     for (let s = 0, e = t.length; s < e; s += 3)
-      this.expandByPoint(It.fromArray(t, s));
+      this.expandByPoint(Bt.fromArray(t, s));
     return this;
   }
   setFromPoints(t) {
@@ -1681,11 +1681,11 @@ class D {
     return this;
   }
   setFromCenterAndSize(t, s) {
-    const e = It.copy(s).multiplyScalar(0.5);
+    const e = Bt.copy(s).multiplyScalar(0.5);
     return this.min.copy(t).sub(e), this.max.copy(t).add(e), this;
   }
   clone() {
-    return new D().copy(this);
+    return new Y().copy(this);
   }
   copy(t) {
     return this.min.copy(t.min), this.max.copy(t.max), this;
@@ -1741,7 +1741,7 @@ class D {
     return s.copy(t).clamp(this.min, this.max);
   }
   distanceToPoint(t) {
-    return this.clampPoint(t, It).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;
@@ -1750,7 +1750,7 @@ class D {
     return this.min.min(t.min), this.max.max(t.max), this;
   }
   applyMatrix4(t) {
-    return this.isEmpty() ? this : (Y[0].set(this.min.x, this.min.y, this.min.z).applyMatrix4(t), Y[1].set(this.min.x, this.min.y, this.max.z).applyMatrix4(t), Y[2].set(this.min.x, this.max.y, this.min.z).applyMatrix4(t), Y[3].set(this.min.x, this.max.y, this.max.z).applyMatrix4(t), Y[4].set(this.max.x, this.min.y, this.min.z).applyMatrix4(t), Y[5].set(this.max.x, this.min.y, this.max.z).applyMatrix4(t), Y[6].set(this.max.x, this.max.y, this.min.z).applyMatrix4(t), Y[7].set(this.max.x, this.max.y, this.max.z).applyMatrix4(t), this.setFromPoints(Y), 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;
@@ -1759,7 +1759,7 @@ class D {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const Y = [
+const D = [
   new p(),
   new p(),
   new p(),
@@ -1768,7 +1768,7 @@ const Y = [
   new p(),
   new p(),
   new p()
-], It = new p(), Tt = new B();
+], Bt = new p(), Tt = new B();
 class F {
   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);
@@ -1853,8 +1853,8 @@ class F {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const Lt = new p(), bs = new p(), Ss = new st();
-class bt {
+const jt = new p(), bs = new p(), Ss = new it();
+class St {
   constructor(t = new p(1, 0, 0), s = 0) {
     this.normal = t, this.constant = s;
   }
@@ -1868,7 +1868,7 @@ class bt {
     return this.normal.copy(t), this.constant = -s.dot(this.normal), this;
   }
   setFromCoplanarPoints(t, s, e) {
-    const n = Lt.subVectors(e, s).cross(bs.subVectors(t, s)).normalize();
+    const n = jt.subVectors(e, s).cross(bs.subVectors(t, s)).normalize();
     return this.setFromNormalAndCoplanarPoint(n, t), this;
   }
   copy(t) {
@@ -1894,7 +1894,7 @@ class bt {
     return t.copy(this.normal).multiplyScalar(-this.constant);
   }
   applyMatrix4(t, s) {
-    const e = s || Ss.getNormalMatrix(t), n = this.coplanarPoint(Lt).applyMatrix4(t), i = this.normal.applyMatrix3(e).normalize();
+    const e = s || Ss.getNormalMatrix(t), n = this.coplanarPoint(jt).applyMatrix4(t), i = this.normal.applyMatrix3(e).normalize();
     return this.constant = -n.dot(i), this;
   }
   translate(t) {
@@ -1904,7 +1904,7 @@ class bt {
     return t.normal.equals(this.normal) && t.constant === this.constant;
   }
   clone() {
-    return new bt().copy(this);
+    return new St().copy(this);
   }
 }
 class C extends B {
@@ -1915,7 +1915,7 @@ class C extends B {
     }), s;
   }
 }
-class S extends p {
+class w extends p {
   static pointArrayToNumberArray(t, s = !0) {
     const e = s ? 3 : 2, n = new Array(t.length * e);
     return t.forEach((i, r) => {
@@ -1923,8 +1923,8 @@ class S extends p {
     }), n;
   }
 }
-const Ut = new et(), Vt = new Pt(), tt = class tt {
-  constructor(t = 0, s = 0, e = 0, n = tt.DEFAULT_ORDER) {
+const Vt = new H(), Ut = new bt(), 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;
   }
   get x() {
@@ -1955,43 +1955,43 @@ const Ut = new et(), Vt = new Pt(), tt = class tt {
     return this._x = t, this._y = s, this._z = e, this._order = n, this._onChangeCallback(), this;
   }
   clone() {
-    return new tt(this._x, this._y, this._z, this._order);
+    return new nt(this._x, this._y, this._z, this._order);
   }
   copy(t) {
     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], h = n[8], a = n[1], o = n[5], c = n[9], l = n[2], m = n[6], d = n[10];
+    const n = t.elements, i = n[0], r = n[4], o = n[8], a = n[1], h = n[5], c = n[9], l = n[2], m = n[6], u = n[10];
     switch (s) {
       case "XYZ":
-        this._y = Math.asin(v(h, -1, 1)), Math.abs(h) < 0.9999999 ? (this._x = Math.atan2(-c, d), this._z = Math.atan2(-r, i)) : (this._x = Math.atan2(m, o), this._z = 0);
+        this._y = Math.asin(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(m, h), this._z = 0);
         break;
       case "YXZ":
-        this._x = Math.asin(-v(c, -1, 1)), Math.abs(c) < 0.9999999 ? (this._y = Math.atan2(h, d), this._z = Math.atan2(a, o)) : (this._y = Math.atan2(-l, i), this._z = 0);
+        this._x = Math.asin(-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);
         break;
       case "ZXY":
-        this._x = Math.asin(v(m, -1, 1)), Math.abs(m) < 0.9999999 ? (this._y = Math.atan2(-l, d), this._z = Math.atan2(-r, o)) : (this._y = 0, this._z = Math.atan2(a, i));
+        this._x = Math.asin(Z(m, -1, 1)), Math.abs(m) < 0.9999999 ? (this._y = Math.atan2(-l, u), this._z = Math.atan2(-r, h)) : (this._y = 0, this._z = Math.atan2(a, i));
         break;
       case "ZYX":
-        this._y = Math.asin(-v(l, -1, 1)), Math.abs(l) < 0.9999999 ? (this._x = Math.atan2(m, d), this._z = Math.atan2(a, i)) : (this._x = 0, this._z = Math.atan2(-r, o));
+        this._y = Math.asin(-Z(l, -1, 1)), Math.abs(l) < 0.9999999 ? (this._x = Math.atan2(m, u), this._z = Math.atan2(a, i)) : (this._x = 0, this._z = Math.atan2(-r, h));
         break;
       case "YZX":
-        this._z = Math.asin(v(a, -1, 1)), Math.abs(a) < 0.9999999 ? (this._x = Math.atan2(-c, o), this._y = Math.atan2(-l, i)) : (this._x = 0, this._y = Math.atan2(h, d));
+        this._z = Math.asin(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));
         break;
       case "XZY":
-        this._z = Math.asin(-v(r, -1, 1)), Math.abs(r) < 0.9999999 ? (this._x = Math.atan2(m, o), this._y = Math.atan2(h, i)) : (this._x = Math.atan2(-c, d), this._y = 0);
+        this._z = Math.asin(-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, u), 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 Vt.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Vt, s, e);
   }
   setFromVector3(t, s = this._order) {
     return this.set(t.x, t.y, t.z, s);
   }
   reorder(t) {
-    return Vt.setFromEuler(this), this.setFromQuaternion(Vt, t);
+    return Ut.setFromEuler(this), this.setFromQuaternion(Ut, t);
   }
   equals(t) {
     return t._x === this._x && t._y === this._y && t._z === this._z && t._order === this._order;
@@ -2011,9 +2011,9 @@ const Ut = new et(), Vt = new Pt(), tt = class tt {
     yield this._x, yield this._y, yield this._z, yield this._order;
   }
 };
-tt.DEFAULT_ORDER = "XYZ";
-let qt = tt;
-class $t {
+nt.DEFAULT_ORDER = "XYZ";
+let Lt = nt;
+class Wt {
   constructor() {
     this._boundingBoxNeedsUpdate = !1;
   }
@@ -2021,15 +2021,15 @@ class $t {
     return this._boundingBoxNeedsUpdate;
   }
 }
-class Ht extends $t {
+class Ht extends Wt {
   translate(t) {
-    return this.transform(new st().makeTranslation(t.x, t.y));
+    return this.transform(new it().makeTranslation(t.x, t.y));
   }
   get box() {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class Ls extends Ht {
+class js extends Ht {
   constructor() {
     super(), this._loops = [];
   }
@@ -2048,7 +2048,9 @@ class Ls extends Ht {
     return t ? t.box : new F();
   }
   transform(t) {
-    return this._boundingBoxNeedsUpdate = !0, this;
+    return this._loops.forEach((s) => {
+      s.transform(t);
+    }), this._boundingBoxNeedsUpdate = !0, this;
   }
   getPoints(t) {
     const s = [];
@@ -2059,7 +2061,7 @@ class Ls extends Ht {
     return s;
   }
   buildHierarchy() {
-    var h;
+    var o;
     const t = this.getPoints(100), s = this.calculateBoundaryBoxes(t), e = this.sortBoundaryBoxesByAreas(s), n = /* @__PURE__ */ new Map(), i = e.length;
     for (let a = 0; a < i; a++)
       n.set(e[a], {
@@ -2068,19 +2070,19 @@ class Ls extends Ht {
       });
     const r = { index: -1, children: [] };
     for (let a = 0; a < i; a++) {
-      const o = e[a], c = t[o], l = s[o];
+      const h = e[a], c = t[h], l = s[h];
       let m = a + 1;
       for (; m < i; m++) {
-        const d = e[m], x = t[d];
-        if (s[d].containsBox(l) && As.isPointInPolygon(
-          c[b.randInt(0, c.length - 1)],
+        const u = e[m], x = t[u];
+        if (s[u].containsBox(l) && fs.isPointInPolygon(
+          c[M.randInt(0, c.length - 1)],
           x
         )) {
-          (h = n.get(d)) == null || h.children.push(n.get(o));
+          (o = n.get(u)) == null || o.children.push(n.get(h));
           break;
         }
       }
-      m === i && r.children.push(n.get(o));
+      m === i && r.children.push(n.get(h));
     }
     return r;
   }
@@ -2098,8 +2100,8 @@ class Ls extends Ht {
     if (s < 3) return 0;
     let e = 0;
     for (let n = 0, i = s - 1; n < s; i = n++) {
-      const r = t[i], h = t[n];
-      e += r.x * h.y - h.x * r.y;
+      const r = t[i], o = t[n];
+      e += r.x * o.y - o.x * r.y;
     }
     return e * 0.5;
   }
@@ -2112,9 +2114,9 @@ class Ls extends Ht {
   sortBoundaryBoxesByAreas(t) {
     const s = [];
     t.forEach((n, i) => {
-      const r = n.size, h = r.width * r.height;
+      const r = n.size, o = r.width * r.height;
       s.push({
-        area: h,
+        area: o,
         index: i
       });
     }), s.sort((n, i) => n.area - i.area);
@@ -2124,7 +2126,7 @@ class Ls extends Ht {
     }), e;
   }
 }
-class nt extends Ht {
+class rt extends Ht {
   constructor() {
     super(), this.arcLengthDivisions = 100;
   }
@@ -2174,11 +2176,11 @@ class nt extends Ht {
     const i = e.length;
     let r;
     s ? r = s : r = t * e[i - 1];
-    let h = 0, a = i - 1, o;
-    for (; h <= a; )
-      if (n = Math.floor(h + (a - h) / 2), o = e[n] - r, o < 0)
-        h = n + 1;
-      else if (o > 0)
+    let o = 0, a = i - 1, h;
+    for (; o <= a; )
+      if (n = Math.floor(o + (a - o) / 2), h = e[n] - r, h < 0)
+        o = n + 1;
+      else if (h > 0)
         a = n - 1;
       else {
         a = n;
@@ -2186,21 +2188,21 @@ class nt extends Ht {
       }
     if (n = a, e[n] === r)
       return n / (i - 1);
-    const c = e[n], m = e[n + 1] - c, d = (r - c) / m;
-    return (n + d) / (i - 1);
+    const c = e[n], m = e[n + 1] - c, u = (r - c) / m;
+    return (n + u) / (i - 1);
   }
   getTangent(t) {
     let e = t - 1e-4, n = t + 1e-4;
     e < 0 && (e = 0), n > 1 && (n = 1);
-    const i = this.getPoint(e), r = this.getPoint(n), h = new C();
-    return h.copy(r).sub(i).normalize(), h;
+    const i = this.getPoint(e), r = this.getPoint(n), o = new C();
+    return o.copy(r).sub(i).normalize(), o;
   }
   getTangentAt(t) {
     const s = this.getUtoTmapping(t);
     return this.getTangent(s);
   }
 }
-class $ extends nt {
+class Q 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);
@@ -2215,32 +2217,32 @@ class $ extends nt {
         e
       );
     else if (r == 5) {
-      const h = t;
-      this.center = new C(h.x, h.y), this.radius = s, this._clockwise = i, this._startAngle = this._clockwise ? this._mirrorAngle(b.normalizeAngle(e)) : b.normalizeAngle(e), this._endAngle = this._clockwise ? this._mirrorAngle(b.normalizeAngle(n)) : b.normalizeAngle(n);
+      const o = t;
+      this.center = new C(o.x, o.y), this.radius = s, this._clockwise = i, this._startAngle = this._clockwise ? this._mirrorAngle(M.normalizeAngle(e)) : M.normalizeAngle(e), this._endAngle = this._clockwise ? this._mirrorAngle(M.normalizeAngle(n)) : M.normalizeAngle(n);
     } else
-      throw q.ILLEGAL_PARAMETERS;
+      throw L.ILLEGAL_PARAMETERS;
   }
   createByThreePoints(t, s, e) {
-    const n = (f, k) => ({
-      x: (f.x + k.x) / 2,
-      y: (f.y + k.y) / 2
-    }), i = (f, k) => (k.y - f.y) / (k.x - f.x), r = (f) => -1 / f, h = n(t, s), a = n(s, e), o = i(t, s), c = i(s, e), l = r(o), m = r(c), d = (f, k, w, T) => {
-      const V = (T - k) / (f - w), O = f * V + k;
-      return { x: V, y: O };
-    }, x = h.y - l * h.x, g = a.y - m * a.x, y = d(l, x, m, g), _ = Math.sqrt(
+    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), m = r(c), u = (A, k, S, T) => {
+      const U = (T - k) / (A - S), K = A * U + k;
+      return { x: U, y: K };
+    }, x = o.y - l * o.x, g = a.y - m * a.x, y = u(l, x, m, g), _ = Math.sqrt(
       Math.pow(t.x - y.x, 2) + Math.pow(t.y - y.y, 2)
-    ), M = (f, k) => Math.atan2(f.y - k.y, f.x - k.x), A = M(t, y), P = M(s, y), z = M(e, y), E = z > A && z < P || A > z && A < P || P > z && P < A;
-    this.center = y, this.radius = _, this._clockwise = !E, this._startAngle = A, this._endAngle = z;
+    ), 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;
   }
   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 h = new B().subVectors(r, i), a = h.length(), o = new B().addVectors(i, h.multiplyScalar(0.5)), c = Math.abs(a / 2 / Math.tan(n / 2)), l = h.normalize(), m = e < 0 ? -Math.PI / 2 : Math.PI / 2, d = new B(
+    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, u = 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 = o.add(d.multiplyScalar(c)) : x = o.add(d.multiplyScalar(-c)) : e < 0 ? x = o.add(d.multiplyScalar(-c)) : x = o.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();
+    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();
   }
   get center() {
     return this._center;
@@ -2258,13 +2260,13 @@ class $ extends nt {
     return this._clockwise ? this._mirrorAngle(this._startAngle) : this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = this._clockwise ? this._mirrorAngle(b.normalizeAngle(t)) : b.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = this._clockwise ? this._mirrorAngle(M.normalizeAngle(t)) : M.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   get endAngle() {
     return this._clockwise ? this._mirrorAngle(this._endAngle) : this._endAngle;
   }
   set endAngle(t) {
-    const s = this.startAngle == 0 && t == I ? t : b.normalizeAngle(t);
+    const s = this.startAngle == 0 && t == E ? t : M.normalizeAngle(t);
     this._endAngle = this._clockwise ? this._mirrorAngle(s) : s, this._boundingBoxNeedsUpdate = !0;
   }
   _mirrorAngle(t) {
@@ -2275,7 +2277,7 @@ class $ extends nt {
   }
   get deltaAngle() {
     const t = this._getInternalAngle(this.startAngle), s = this._getInternalAngle(this.endAngle);
-    return this.clockwise ? b.normalizeAngle(t - s) : b.normalizeAngle(s - t);
+    return this.clockwise ? M.normalizeAngle(t - s) : M.normalizeAngle(s - t);
   }
   get clockwise() {
     return this._clockwise;
@@ -2290,7 +2292,7 @@ class $ extends nt {
     return this.getPointAtAngle(this.endAngle);
   }
   get midPoint() {
-    const t = this._getInternalAngle(this.startAngle), s = this._clockwise ? b.normalizeAngle(t - this.deltaAngle / 2) : b.normalizeAngle(t + this.deltaAngle / 2), e = this._clockwise ? this._mirrorAngle(s) : s;
+    const t = this._getInternalAngle(this.startAngle), s = this._clockwise ? M.normalizeAngle(t - this.deltaAngle / 2) : M.normalizeAngle(t + this.deltaAngle / 2), e = this._clockwise ? this._mirrorAngle(s) : s;
     return this.getPointAtAngle(e);
   }
   get closed() {
@@ -2301,7 +2303,7 @@ class $ extends nt {
     const t = [this.startPoint, this.endPoint], s = [0, Math.PI / 2, Math.PI, 3 * Math.PI / 2];
     for (const i of s) {
       const r = this._getInternalAngle(i);
-      b.isBetweenAngle(
+      M.isBetweenAngle(
         r,
         this._getInternalAngle(this.startAngle),
         this._getInternalAngle(this.endAngle),
@@ -2318,10 +2320,34 @@ class $ extends nt {
     return Math.abs(this.deltaAngle * this.radius);
   }
   transform(t) {
-    return this._boundingBoxNeedsUpdate = !0, this;
+    const s = t, e = this.center.clone().applyMatrix2d(s), n = this.startPoint.clone().applyMatrix2d(s);
+    if (this.closed)
+      return this.center = e, this.radius = e.distanceTo(n), this._startAngle = Math.atan2(
+        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 Q(
+      n,
+      i,
+      r
+    ), a = s.determinant() < 0 ? !this.clockwise : this.clockwise, h = (c) => {
+      const l = M.normalizeAngle(c);
+      return a ? this._mirrorAngle(l) : l;
+    };
+    return this.center = o.center, this.radius = o.radius, this.clockwise = a, this.startAngle = h(
+      Math.atan2(
+        n.y - o.center.y,
+        n.x - o.center.x
+      )
+    ), this.endAngle = h(
+      Math.atan2(
+        r.y - o.center.y,
+        r.x - o.center.x
+      )
+    ), this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return new $(
+    return new Q(
       this.center.clone(),
       this.radius,
       this._startAngle,
@@ -2336,32 +2362,32 @@ class $ extends nt {
   getPoints(t = 100) {
     const s = [];
     let e = this.deltaAngle, n = this._getInternalAngle(this.startAngle);
-    if (this.closed && (e = I, n = 0), this.clockwise)
+    if (this.closed && (e = E, n = 0), this.clockwise)
       for (let i = 0; i <= t; i++) {
-        const r = n - e * (i / t), h = this._clockwise ? this._mirrorAngle(r) : r, a = this.getPointAtAngle(h);
+        const r = n - e * (i / t), o = this._clockwise ? this._mirrorAngle(r) : r, a = this.getPointAtAngle(o);
         s.push(new C(a.x, a.y));
       }
     else
       for (let i = 0; i <= t; i++) {
-        const r = n + e * (i / t), h = this._clockwise ? this._mirrorAngle(r) : r, a = this.getPointAtAngle(h);
+        const r = n + e * (i / t), o = this._clockwise ? this._mirrorAngle(r) : r, a = this.getPointAtAngle(o);
         s.push(new C(a.x, a.y));
       }
     return s;
   }
 }
-class Cs extends $t {
+class Cs extends Wt {
   translate(t) {
-    return this.transform(new et().makeTranslation(t.x, t.y, t.z));
+    return this.transform(new H().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 it extends Cs {
+class ot extends Cs {
 }
-class ft extends it {
+class Mt extends ot {
   constructor(t, s) {
-    super(), this._start = new S(t), this._end = new S(s);
+    super(), this._start = new w(t), this._end = new w(s);
   }
   get startPoint() {
     return this._start;
@@ -2379,7 +2405,7 @@ class ft extends it {
     return new p().subVectors(this.endPoint, this.startPoint).normalize();
   }
   get midPoint() {
-    return new S(
+    return new w(
       (this._start.x + this._end.x) / 2,
       (this._start.y + this._end.y) / 2,
       (this._start.z + this._end.z) / 2
@@ -2399,31 +2425,31 @@ class ft extends it {
   }
   atLength(t, s = !1) {
     if (s) {
-      const e = this.delta(G).normalize();
-      return new S(this._start).addScaledVector(e, t);
+      const e = this.delta(O).normalize();
+      return new w(this._start).addScaledVector(e, t);
     } else {
-      const e = this.delta(G).normalize();
-      return new S(this._end).addScaledVector(e, t);
+      const e = this.delta(O).normalize();
+      return new w(this._end).addScaledVector(e, t);
     }
   }
   extend(t, s = !1) {
     if (s) {
-      const e = G.subVectors(this._start, this._end).normalize();
-      this._start = new S(this._start).addScaledVector(
+      const e = O.subVectors(this._start, this._end).normalize();
+      this._start = new w(this._start).addScaledVector(
         e,
         t
       );
     } else {
-      const e = this.delta(G).normalize();
-      this._end = new S(this._end).addScaledVector(e, t);
+      const e = this.delta(O).normalize();
+      this._end = new w(this._end).addScaledVector(e, t);
     }
     return this._boundingBoxNeedsUpdate = !0, this;
   }
   closestPointToPointParameter(t, s) {
-    jt.subVectors(t, this._start), gt.subVectors(this.endPoint, this.startPoint);
-    const e = gt.dot(gt);
-    let i = gt.dot(jt) / e;
-    return s && (i = b.clamp(i, 0, 1)), i;
+    qt.subVectors(t, this._start), _t.subVectors(this.endPoint, this.startPoint);
+    const e = _t.dot(_t);
+    let i = _t.dot(qt) / e;
+    return s && (i = M.clamp(i, 0, 1)), i;
   }
   closestPointToPoint(t, s, e) {
     const n = this.closestPointToPointParameter(t, s);
@@ -2439,24 +2465,24 @@ class ft extends it {
     return this._start.distanceTo(this._end);
   }
   project(t) {
-    const s = this.direction, n = G.subVectors(t, this.startPoint).dot(s);
-    return new S().copy(s).multiplyScalar(n).add(this.startPoint);
+    const s = this.direction, n = O.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 = G.subVectors(t, e).dot(s), r = G.copy(s).multiplyScalar(i);
-    return new S().addVectors(e, r);
+    const s = this.direction, e = this.startPoint, i = O.subVectors(t, e).dot(s), r = O.copy(s).multiplyScalar(i);
+    return new w().addVectors(e, r);
   }
   calculateBoundingBox() {
-    const t = new S(
+    const t = new w(
       Math.min(this._start.x, this._end.x),
       Math.min(this._start.y, this._end.y),
       Math.min(this._start.z, this._end.z)
-    ), s = new S(
+    ), s = new w(
       Math.max(this._start.x, this._end.x),
       Math.max(this._start.y, this._end.y),
       Math.max(this._start.z, this._end.z)
     );
-    return new D(t, s);
+    return new Y(t, s);
   }
   transform(t) {
     return this._start.applyMatrix4(t), this._end.applyMatrix4(t), this._boundingBoxNeedsUpdate = !0, this;
@@ -2468,65 +2494,65 @@ class ft extends it {
     return this.startPoint = t.startPoint, this.endPoint = t.endPoint, this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return new ft(this._start.clone(), this._end.clone());
+    return new Mt(this._start.clone(), this._end.clone());
   }
 }
-const G = new p(), jt = new p(), gt = new p();
-class pt extends it {
+const O = new p(), qt = new p(), _t = new p();
+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), h = new p().subVectors(e, t), a = new p().crossVectors(r, h).normalize();
+    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();
     if (a.lengthSq() === 0)
       return null;
-    const o = new p().crossVectors(r, a).normalize(), c = new p().crossVectors(h, a).normalize(), l = o.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), m = c.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), d = new ft(n, n.clone().add(l)), x = new ft(i, i.clone().add(m)), g = new p();
-    return d.closestPointToPoint(x.startPoint, !0, g) ? g : null;
+    const h = new p().crossVectors(r, a).normalize(), c = new p().crossVectors(o, a).normalize(), l = h.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), m = c.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), u = new Mt(n, n.clone().add(l)), x = new Mt(i, i.clone().add(m)), g = new p();
+    return u.closestPointToPoint(x.startPoint, !0, g) ? g : null;
   }
   static createByThreePoints(t, s, e) {
-    const n = pt.computeCenterPoint(
+    const n = At.computeCenterPoint(
       t,
       s,
       e
     );
     if (n) {
-      const i = n.distanceTo(t), r = new p().subVectors(t, n), h = new p().subVectors(s, n), a = Math.atan2(r.y, r.x), o = Math.atan2(h.y, h.x);
-      return new pt(
+      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);
+      return new At(
         n,
         i,
         a,
-        o,
+        h,
         p.Z_AXIS
       );
     }
   }
   constructor(t, s, e, n, i, r = p.X_AXIS) {
-    super(), this.center = t, this.radius = s, this.startAngle = e, this.endAngle = n, this.normal = i, this.refVec = r, (n - e) % I == 0 ? (this.startAngle = 0, this.endAngle = I) : (this.startAngle = e, this.endAngle = n);
+    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() {
     return this._center;
   }
   set center(t) {
-    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new w(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   get radius() {
     return this._radius;
   }
   set radius(t) {
-    if (t < 0) throw q.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._radius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get startAngle() {
     return this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = b.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = M.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   get endAngle() {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == I ? t : b.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == E ? t : M.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   get deltaAngle() {
-    return b.normalizeAngle(this.endAngle - this.startAngle);
+    return M.normalizeAngle(this.endAngle - this.startAngle);
   }
   get isLargeArc() {
     return Math.abs(this.deltaAngle) > Math.PI ? 1 : 0;
@@ -2554,7 +2580,7 @@ class pt extends it {
   }
   get midPoint() {
     let t = this.startAngle, s = this.deltaAngle;
-    this.closed && (t = 0, s = I);
+    this.closed && (t = 0, s = E);
     const e = t + s * 0.5;
     return this.getPointAtAngle(e);
   }
@@ -2569,18 +2595,18 @@ class pt extends it {
     if (a.lengthSq() === 0)
       return this.startPoint.clone();
     a.normalize().multiplyScalar(this.radius);
-    const o = e.clone().add(a), c = this.getAngle(o.clone()), l = this.startAngle, m = this.deltaAngle;
-    let d = b.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), _ = this.endPoint.distanceTo(s);
+    const h = e.clone().add(a), c = this.getAngle(h.clone()), l = this.startAngle, m = this.deltaAngle;
+    let u = M.normalizeAngle(c - l);
+    u < 0 && (u = 0), u > m && (u = m);
+    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;
   }
   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), o = e.clone().sub(i.clone().multiplyScalar(a)), c = n.clone(), m = o.clone().sub(c).length();
+    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(), m = h.clone().sub(c).length();
     if (m < r) return s;
-    const d = Math.acos(r / m), x = this.getAngle(o.clone()), g = [x + d, x - d];
+    const u = Math.acos(r / m), x = this.getAngle(h.clone()), g = [x + u, x - u];
     for (const y of g) {
-      const _ = b.normalizeAngle(y - this.startAngle);
+      const _ = M.normalizeAngle(y - this.startAngle);
       _ >= 0 && _ <= this.deltaAngle && s.push(this.getPointAtAngle(this.startAngle + _));
     }
     return s;
@@ -2588,21 +2614,21 @@ class pt extends it {
   nearestTangentPoint(t) {
     const s = this.tangentPoints(t);
     if (s.length === 0) return null;
-    const e = new S(t.x, t.y, t.z || 0);
+    const e = new w(t.x, t.y, t.z || 0);
     return s.length === 1 || s[0].distanceTo(e) < s[1].distanceTo(e) ? s[0] : s[1];
   }
   calculateBoundingBox() {
     const t = [this.startAngle, this.endAngle];
     for (let a = 0; a < 2 * Math.PI; a += Math.PI / 2)
-      b.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
-    let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, h = -1 / 0;
+      M.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
+    let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, o = -1 / 0;
     for (const a of t) {
-      const o = this.getPointAtAngle(a);
-      o.x < s && (s = o.x), o.y < e && (e = o.y), o.z < n && (n = o.z), o.x > i && (i = o.x), o.y > r && (r = o.y), o.z > h && (h = o.z);
+      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 Y(
       { x: s, y: e, z: n },
-      { x: i, y: r, z: h }
+      { x: i, y: r, z: o }
     );
   }
   get closed() {
@@ -2611,22 +2637,36 @@ class pt extends it {
   getPoints(t) {
     const s = [];
     let e = this.deltaAngle, n = this.startAngle;
-    this.closed && (e = I, n = 0);
+    this.closed && (e = E, n = 0);
     for (let i = 0; i <= t; i++) {
-      const r = n + e * (i / t), h = this.getPointAtAngle(r);
-      s.push(h);
+      const r = n + e * (i / t), o = this.getPointAtAngle(r);
+      s.push(o);
     }
     return s;
   }
   transform(t) {
-    const s = Bt.copy(this.refVec).applyAxisAngle(this.normal, this.startAngle).multiplyScalar(this.radius), e = Bt.copy(this.refVec).applyAxisAngle(this.normal, this.endAngle).multiplyScalar(this.radius);
-    return this.center.applyMatrix4(t), s.applyMatrix4(t), e.applyMatrix4(t), this.normal.applyMatrix4(t).normalize(), this.refVec.applyMatrix4(t).normalize(), this.startAngle = this.getAngle(s), this.endAngle = this.getAngle(e), this._boundingBoxNeedsUpdate = !0, this;
+    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)
+    ).normalize();
+    a.lengthSq() === 0 && (a = this.normal.clone().transformDirection(t));
+    const h = (c) => {
+      const l = new p(c).sub(s);
+      return Math.atan2(
+        l.dot(Ft.crossVectors(a, r)),
+        l.dot(r)
+      );
+    };
+    return this.center = s, this.radius = o, this.normal = a, this.refVec = r, this.startAngle = 0, this.endAngle = this.closed ? E : h(n), this._boundingBoxNeedsUpdate = !0, this;
   }
   copy(t) {
     return this.center = t.center, this.radius = t.radius, this.startAngle = t.startAngle, this.endAngle = t.endAngle, this.normal = t.normal, this.refVec = t.refVec, this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return new pt(
+    return new At(
       this.center.clone(),
       this.radius,
       this.startAngle,
@@ -2637,7 +2677,7 @@ class pt extends it {
   }
   getAngle(t) {
     return t.sub(this.center), Math.atan2(
-      t.dot(Bt.crossVectors(this.refVec, this.normal)),
+      t.dot(Ft.crossVectors(this.refVec, this.normal)),
       t.dot(this.refVec)
     );
   }
@@ -2647,53 +2687,53 @@ class pt extends it {
       y: s.z * e.x - s.x * e.z,
       z: s.x * e.y - s.y * e.x
     }, i = this.center, r = this.radius;
-    return new S(
+    return new w(
       i.x + r * (e.x * Math.cos(t) + n.x * Math.sin(t)),
       i.y + r * (e.y * Math.cos(t) + n.y * Math.sin(t)),
       i.z + r * (e.z * Math.cos(t) + n.z * Math.sin(t))
     );
   }
   get plane() {
-    const t = new p(this.center).distanceTo(vt);
-    return new bt(this.normal, t);
+    const t = new p(this.center).distanceTo(Ot);
+    return new St(this.normal, t);
   }
 }
-const Bt = new p();
-class zt extends nt {
-  constructor(t, s, e, n = 0, i = I, r = !1, h = 0) {
-    super(), this.center = t, this.majorAxisRadius = s, this.minorAxisRadius = e, (i - n) % I == 0 ? (this.startAngle = 0, this.endAngle = I) : (this.startAngle = n, this.endAngle = i), this.clockwise = r, this.rotation = h;
+const Ft = new p();
+class W 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;
   }
   get center() {
     return this._center;
   }
   set center(t) {
-    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new w(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   get majorAxisRadius() {
     return this._majorAxisRadius;
   }
   set majorAxisRadius(t) {
-    if (t < 0) throw q.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._majorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get minorAxisRadius() {
     return this._minorAxisRadius;
   }
   set minorAxisRadius(t) {
-    if (t < 0) throw q.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._minorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get startAngle() {
     return this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = b.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = M.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   get endAngle() {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == I ? t : b.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == E ? t : M.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   get clockwise() {
     return this._clockwise;
@@ -2708,7 +2748,7 @@ class zt extends nt {
     this._rotation = t, this._boundingBoxNeedsUpdate = !0;
   }
   get deltaAngle() {
-    return b.normalizeAngle(this.endAngle - this.startAngle);
+    return M.normalizeAngle(this.endAngle - this.startAngle);
   }
   get isLargeArc() {
     return Math.abs(this.deltaAngle) > Math.PI ? 1 : 0;
@@ -2716,8 +2756,8 @@ class zt extends nt {
   calculateBoundingBox() {
     let s = 1 / 0, e = 1 / 0, n = -1 / 0, i = -1 / 0;
     for (let r = 0; r <= 100; r++) {
-      const h = this.getPoint(r / 100);
-      s = Math.min(s, h.x), e = Math.min(e, h.y), n = Math.max(n, h.x), i = Math.max(i, h.y);
+      const o = this.getPoint(r / 100);
+      s = Math.min(s, o.x), e = Math.min(e, o.y), n = Math.max(n, o.x), i = Math.max(i, o.y);
     }
     return new F({ x: s, y: e }, { x: n, y: i });
   }
@@ -2732,21 +2772,58 @@ class zt extends nt {
     for (; e > s; ) e -= s;
     e < Number.EPSILON && (n ? e = 0 : e = s), this.clockwise === !0 && !n && (e === s ? e = -s : e = e - s);
     const i = this.startAngle + t * e;
-    let r = this.center.x + this.majorAxisRadius * Math.cos(i), h = this.center.y + this.minorAxisRadius * Math.sin(i);
+    let r = this.center.x + this.majorAxisRadius * Math.cos(i), o = this.center.y + this.minorAxisRadius * Math.sin(i);
     if (this.rotation !== 0) {
-      const a = Math.cos(this.rotation), o = Math.sin(this.rotation), c = r - this.center.x, l = h - this.center.y;
-      r = c * a - l * o + this.center.x, h = c * o + l * a + this.center.y;
+      const a = Math.cos(this.rotation), h = Math.sin(this.rotation), c = r - this.center.x, l = o - this.center.y;
+      r = c * a - l * h + this.center.x, o = c * h + l * a + this.center.y;
     }
-    return new C(r, h);
+    return new C(r, o);
   }
   transform(t) {
-    return this._boundingBoxNeedsUpdate = !0, this;
+    const s = t, e = new C(this.center).applyMatrix2d(
+      s
+    ), n = new w(
+      e.x,
+      e.y,
+      this.center.z
+    ), i = this.getPointAtAngle(0).clone().applyMatrix2d(s), r = this.getPointAtAngle(Math.PI / 2).clone().applyMatrix2d(s), o = new C(i).sub(
+      e
+    ), a = new C(r).sub(
+      e
+    ), h = o.length(), c = a.length(), l = Math.atan2(o.y, o.x), m = o.clone().normalize(), u = a.clone().normalize(), x = (_) => {
+      const z = new C(_).sub(e), f = z.dot(m), b = z.dot(u);
+      return M.normalizeAngle(
+        Math.atan2(b / c, f / h)
+      );
+    }, g = s.determinant() < 0 ? !this.clockwise : this.clockwise, y = this.closed ? new W(
+      n,
+      h,
+      c,
+      0,
+      E,
+      g,
+      l
+    ) : new W(
+      n,
+      h,
+      c,
+      x(this.startPoint.clone().applyMatrix2d(s)),
+      x(this.endPoint.clone().applyMatrix2d(s)),
+      g,
+      l
+    );
+    return this.center = y.center, this.majorAxisRadius = y.majorAxisRadius, this.minorAxisRadius = y.minorAxisRadius, this._startAngle = y._startAngle, this._endAngle = y._endAngle, this._clockwise = y._clockwise, this.rotation = y.rotation, this._boundingBoxNeedsUpdate = !0, this;
+  }
+  getPointAtAngle(t) {
+    return this.getPoint(
+      this.closed ? t / E : M.normalizeAngle(t - this.startAngle) / this.deltaAngle
+    );
   }
   copy(t) {
     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 zt(
+    return new W(
       this.center,
       this.majorAxisRadius,
       this.minorAxisRadius,
@@ -2757,47 +2834,47 @@ class zt extends nt {
     );
   }
 }
-class Wt extends it {
-  constructor(t, s, e, n, i, r = 0, h = I) {
+class zt 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(h - r);
-    Math.abs(a - I) < 1e-10 || Math.abs(a - 2 * I) < 1e-10 ? (this.startAngle = 0, this.endAngle = I) : (this.startAngle = r, this.endAngle = h);
+    const a = Math.abs(o - r);
+    Math.abs(a - E) < 1e-10 || Math.abs(a - 2 * E) < 1e-10 ? (this.startAngle = 0, this.endAngle = E) : (this.startAngle = r, this.endAngle = o);
   }
   get center() {
     return this._center;
   }
   set center(t) {
-    this._center = new S(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
+    this._center = new w(t.x, t.y, t.z || 0), this._boundingBoxNeedsUpdate = !0;
   }
   get majorAxisRadius() {
     return this._majorAxisRadius;
   }
   set majorAxisRadius(t) {
-    if (t < 0) throw q.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._majorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get minorAxisRadius() {
     return this._minorAxisRadius;
   }
   set minorAxisRadius(t) {
-    if (t < 0) throw q.ILLEGAL_PARAMETERS;
+    if (t < 0) throw L.ILLEGAL_PARAMETERS;
     this._minorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get startAngle() {
     return this._startAngle;
   }
   set startAngle(t) {
-    this._startAngle = b.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._startAngle = M.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   get endAngle() {
     return this._endAngle;
   }
   set endAngle(t) {
-    this._endAngle = this.startAngle == 0 && t == I ? t : b.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
+    this._endAngle = this.startAngle == 0 && t == E ? t : M.normalizeAngle(t), this._boundingBoxNeedsUpdate = !0;
   }
   get deltaAngle() {
     const t = this.endAngle - this.startAngle;
-    return Math.abs(t - I) < 1e-10 ? I : b.normalizeAngle(t);
+    return Math.abs(t - E) < 1e-10 ? E : M.normalizeAngle(t);
   }
   get isLargeArc() {
     return Math.abs(this.deltaAngle) > Math.PI ? 1 : 0;
@@ -2828,12 +2905,12 @@ class Wt extends it {
   }
   get midPoint() {
     let t = this.startAngle, s = this.deltaAngle;
-    (this.closed || Math.abs(s - I) < 1e-10) && (t = 0, s = I);
+    (this.closed || Math.abs(s - E) < 1e-10) && (t = 0, s = E);
     const e = t + s / 2;
     return this.getPointAtAngle(e);
   }
   get isCircular() {
-    return Gt.equal(this.majorAxisRadius, this.minorAxisRadius);
+    return Qt.equal(this.majorAxisRadius, this.minorAxisRadius);
   }
   get length() {
     if (this.isCircular)
@@ -2841,14 +2918,14 @@ class Wt extends it {
     const t = 1e3, s = this.deltaAngle / t;
     let e = 0, n = this.getPointAtAngle(this.startAngle);
     for (let i = 1; i <= t; i++) {
-      const r = this.startAngle + i * s, h = this.getPointAtAngle(r), a = h.x - n.x, o = h.y - n.y, c = h.z - n.z;
-      e += Math.sqrt(a * a + o * o + c * c), n = h;
+      const r = this.startAngle + i * s, o = this.getPointAtAngle(r), a = o.x - n.x, h = o.y - n.y, c = o.z - n.z;
+      e += Math.sqrt(a * a + h * h + c * c), n = o;
     }
     return e;
   }
   get area() {
     const t = this.majorAxisRadius, s = this.minorAxisRadius, e = this.startAngle, n = e + this.deltaAngle;
-    if (Math.abs(this.deltaAngle - I) < 1e-10)
+    if (Math.abs(this.deltaAngle - E) < 1e-10)
       return Math.PI * t * s;
     const i = t * s / 2 * (n - e - (Math.sin(n) * Math.cos(n) - Math.sin(e) * Math.cos(e)));
     return Math.abs(i);
@@ -2857,25 +2934,25 @@ class Wt extends it {
     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)) {
       const t = [this.startAngle, this.endAngle];
       for (let a = 0; a < 2 * Math.PI; a += Math.PI / 2)
-        b.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
-      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, h = -1 / 0;
+        M.isBetweenAngle(a, this.startAngle, this.endAngle) && t.push(a);
+      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, o = -1 / 0;
       for (const a of t) {
-        const o = this.getPointAtAngle(a);
-        o.x < s && (s = o.x), o.y < e && (e = o.y), o.z < n && (n = o.z), o.x > i && (i = o.x), o.y > r && (r = o.y), o.z > h && (h = o.z);
+        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 Y(
         { x: s, y: e, z: n },
-        { x: i, y: r, z: h }
+        { x: i, y: r, z: o }
       );
     } else {
-      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, h = -1 / 0;
+      let s = 1 / 0, e = 1 / 0, n = 1 / 0, i = -1 / 0, r = -1 / 0, o = -1 / 0;
       for (let a = 0; a <= 100; a++) {
-        const o = this.startAngle + this.deltaAngle * (a / 100), c = this.getPointAtAngle(o);
-        s = Math.min(s, c.x), e = Math.min(e, c.y), n = Math.min(n, c.z), i = Math.max(i, c.x), r = Math.max(r, c.y), h = Math.max(h, c.z);
+        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 Y(
         { x: s, y: e, z: n },
-        { x: i, y: r, z: h }
+        { x: i, y: r, z: o }
       );
     }
   }
@@ -2885,16 +2962,16 @@ class Wt extends it {
   getPoints(t = 100) {
     const s = [];
     let e = this.deltaAngle, n = this.startAngle;
-    this.closed && (e = I, n = 0);
+    this.closed && (e = E, n = 0);
     for (let i = 0; i <= t; i++) {
-      const r = n + e * (i / t), h = this.getPointAtAngle(r);
-      s.push(h);
+      const r = n + e * (i / t), o = this.getPointAtAngle(r);
+      s.push(o);
     }
     return s;
   }
   getPointAtAngle(t) {
     const s = Math.cos(t), e = Math.sin(t), n = this.minorAxis.clone().multiplyScalar(this.minorAxisRadius).multiplyScalar(e), i = this.majorAxis.clone().multiplyScalar(s * this.majorAxisRadius).add(n);
-    return new S(
+    return new w(
       this.center.x + i.x,
       this.center.y + i.y,
       this.center.z + i.z
@@ -2905,13 +2982,42 @@ class Wt extends it {
     return i * i + r * r <= 1;
   }
   transform(t) {
-    return this._boundingBoxNeedsUpdate = !0, this;
+    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(
+      e
+    ), o = new p(i).sub(
+      e
+    ), a = r.length(), h = o.length(), c = r.clone().normalize(), l = new p().crossVectors(r, o).normalize();
+    let m = new p().crossVectors(l, c).normalize();
+    m.dot(o) < 0 && (l.negate(), m = new p().crossVectors(l, c).normalize());
+    const u = (g) => {
+      const y = new p(g).sub(e), _ = y.dot(c), z = y.dot(m);
+      return M.normalizeAngle(
+        Math.atan2(z / h, _ / a)
+      );
+    }, x = this.closed ? new zt(
+      e,
+      l,
+      c,
+      a,
+      h,
+      0,
+      E
+    ) : new zt(
+      e,
+      l,
+      c,
+      a,
+      h,
+      u(this.startPoint.clone().applyMatrix4(s)),
+      u(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;
   }
   copy(t) {
     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 Wt(
+    return new zt(
       this.center,
       this.normal,
       this.majorAxis,
@@ -2922,11 +3028,11 @@ class Wt extends it {
     );
   }
   get plane() {
-    const t = new p(this.center).distanceTo(vt);
-    return new bt(this.normal, t);
+    const t = new p(this.center).distanceTo(Ot);
+    return new St(this.normal, t);
   }
 }
-class Us extends nt {
+class Vs extends rt {
   constructor(t = null, s = !1) {
     super(), this._vertices = t || new Array(), this._closed = s;
   }
@@ -2966,7 +3072,7 @@ class Us extends nt {
       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 $(n, i, n.bulge);
+          const r = new Q(n, i, n.bulge);
           t += r.length;
         } else
           t += new C(n.x, n.y).distanceTo(i);
@@ -2998,12 +3104,16 @@ class Us extends nt {
     return new F().setFromPoints(t);
   }
   transform(t) {
-    return this._boundingBoxNeedsUpdate = !0, this;
+    const s = t.determinant() < 0;
+    return this._vertices.forEach((e) => {
+      const n = new C(e).applyMatrix2d(t);
+      e.x = n.x, e.y = n.y, s && e.bulge != null && (e.bulge = -e.bulge);
+    }), this._boundingBoxNeedsUpdate = !0, this;
   }
   getPoints3d(t, s) {
     const e = [];
     return this.getPoints(t).forEach(
-      (i) => e.push(new S().set(i.x, i.y, s))
+      (i) => e.push(new w().set(i.x, i.y, s))
     ), e;
   }
   getPoints(t) {
@@ -3013,8 +3123,8 @@ class Us extends nt {
       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 $(i, r, i.bulge).getPoints(t), o = a.length;
-          for (let c = 0; c < o; ++c) {
+          const a = new Q(i, r, i.bulge).getPoints(t), h = a.length;
+          for (let c = 0; c < h; ++c) {
             const l = a[c];
             s.push(new C(l.x, l.y));
           }
@@ -3025,7 +3135,7 @@ class Us extends nt {
     return s;
   }
 }
-class Mt extends nt {
+class Pt extends rt {
   constructor(t, s) {
     super(), this._start = new C(t), this._end = new C(s);
   }
@@ -3067,10 +3177,10 @@ class Mt extends nt {
     return this.startPoint = t.startPoint, this.endPoint = t.endPoint, this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return new Mt(this._start.clone(), this._end.clone());
+    return new Pt(this._start.clone(), this._end.clone());
   }
 }
-class X extends nt {
+class X extends rt {
   constructor(t = []) {
     super(), this._curves = t;
   }
@@ -3079,16 +3189,16 @@ class X extends nt {
   }
   static buildFromEdges(t, s = 1e-3) {
     if (t.length === 0) return [];
-    const e = [...t], n = [], i = s * s, r = (h, a) => {
-      const o = h.x - a.x, c = h.y - a.y;
-      return o * o + c * c <= i;
+    const e = [...t], n = [], i = s * s, r = (o, a) => {
+      const h = o.x - a.x, c = o.y - a.y;
+      return h * h + c * c <= i;
     };
     for (; e.length > 0; ) {
-      const h = [], a = e.shift();
-      h.push(a);
-      const o = X.getEdgeStartPoint(a);
+      const o = [], a = e.shift();
+      o.push(a);
+      const h = X.getEdgeStartPoint(a);
       let c = X.getEdgeEndPoint(a);
-      if (!r(o, c))
+      if (!r(h, c))
         for (; e.length > 0; ) {
           const l = X.findConnectingEdge(
             e,
@@ -3097,9 +3207,9 @@ class X extends nt {
           );
           if (l.index < 0) break;
           let m = e.splice(l.index, 1)[0];
-          if (l.reverse && (m = X.reverseEdge(m)), h.push(m), c = X.getEdgeEndPoint(m), r(c, o)) break;
+          if (l.reverse && (m = X.reverseEdge(m)), o.push(m), c = X.getEdgeEndPoint(m), r(c, h)) break;
         }
-      n.push(new X(h));
+      n.push(new X(o));
     }
     return n;
   }
@@ -3130,7 +3240,27 @@ class X extends nt {
     return s.setFromPoints(t), s;
   }
   transform(t) {
-    return this._boundingBoxNeedsUpdate = !0, this;
+    const s = new H().set(
+      t.elements[0],
+      t.elements[3],
+      0,
+      t.elements[6],
+      t.elements[1],
+      t.elements[4],
+      0,
+      t.elements[7],
+      0,
+      0,
+      1,
+      0,
+      0,
+      0,
+      0,
+      1
+    );
+    return this._curves.forEach((e) => {
+      e instanceof J ? e.transform(s) : e.transform(t);
+    }), this._boundingBoxNeedsUpdate = !0, this;
   }
   get closed() {
     return !0;
@@ -3145,11 +3275,11 @@ class X extends nt {
   }
   static findConnectingEdge(t, s, e) {
     let n = -1, i = !1, r = Number.POSITIVE_INFINITY;
-    for (let h = 0; h < t.length; h++) {
-      const a = t[h], o = X.getEdgeStartPoint(a), c = X.getEdgeEndPoint(a), l = s.x - o.x, m = s.y - o.y, d = l * l + m * m;
-      d < r && (r = d, n = h, i = !1);
+    for (let o = 0; o < t.length; o++) {
+      const a = t[o], h = X.getEdgeStartPoint(a), c = X.getEdgeEndPoint(a), l = s.x - h.x, m = s.y - h.y, u = l * l + m * m;
+      u < r && (r = u, 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 = h, i = !0);
+      y < r && (r = y, n = o, i = !0);
     }
     return r > e ? { index: -1, reverse: !1 } : { index: n, reverse: i };
   }
@@ -3162,13 +3292,13 @@ class X extends nt {
     return new C(s.x, s.y);
   }
   static reverseEdge(t) {
-    return t instanceof Mt ? new Mt(t.endPoint, t.startPoint) : t instanceof $ ? new $(
+    return t instanceof Pt ? new Pt(t.endPoint, t.startPoint) : t instanceof Q ? new Q(
       t.center,
       t.radius,
       t.endAngle,
       t.startAngle,
       !t.clockwise
-    ) : t instanceof zt ? new zt(
+    ) : t instanceof W ? new W(
       t.center,
       t.majorAxisRadius,
       t.minorAxisRadius,
@@ -3176,11 +3306,11 @@ class X extends nt {
       t.startAngle,
       !t.clockwise,
       t.rotation
-    ) : t instanceof wt ? X.reverseSplineEdge(t) : t;
+    ) : t instanceof J ? X.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((o) => n + i - o).reverse(), h = t.weights, a = h.length > 0 ? [...h].reverse() : void 0;
-    return new wt(
+    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 J(
       s,
       r,
       a,
@@ -3199,18 +3329,18 @@ class kt {
   initCatmullRom(t, s, e, n, i) {
     this.init(s, e, i * (e - t), i * (n - s));
   }
-  initNonuniformCatmullRom(t, s, e, n, i, r, h) {
-    let a = (s - t) / i - (e - t) / (i + r) + (e - s) / r, o = (e - s) / r - (n - s) / (r + h) + (n - e) / h;
-    a *= r, o *= r, this.init(s, e, a, o);
+  initNonuniformCatmullRom(t, s, e, n, i, r, o) {
+    let a = (s - t) / i - (e - t) / (i + r) + (e - s) / r, h = (e - s) / r - (n - s) / (r + o) + (n - e) / o;
+    a *= r, h *= r, this.init(s, e, a, h);
   }
   calc(t) {
     const s = t * t, e = s * t;
     return this.c0 + this.c1 * t + this.c2 * s + this.c3 * e;
   }
 }
-class Es extends it {
+class Es 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 kt(), this._py = new kt(), this._pz = new kt(), this._points = t.map((i) => new S(i)), this._closed = s, this._curveType = e, this._tension = n;
+    super(), this.isCatmullRomCurve3d = !0, this.type = "CatmullRomCurve3d", this._tmp = new p(), this._px = new kt(), this._py = new kt(), this._pz = new kt(), this._points = t.map((i) => new w(i)), this._closed = s, this._curveType = e, this._tension = n;
   }
   get points() {
     return this._points;
@@ -3225,10 +3355,10 @@ class Es extends it {
     return this._tension;
   }
   get startPoint() {
-    return this._points.length > 0 ? this._points[0] : new S();
+    return this._points.length > 0 ? this._points[0] : new w();
   }
   get endPoint() {
-    return this._points.length > 0 ? this._points[this._points.length - 1] : new S();
+    return this._points.length > 0 ? this._points[this._points.length - 1] : new w();
   }
   get length() {
     if (this._points.length < 2) return 0;
@@ -3239,23 +3369,23 @@ class Es extends it {
       this._points[0]
     )), t;
   }
-  getPoint(t, s = new S()) {
+  getPoint(t, s = new w()) {
     const e = s, n = this._points, i = n.length;
     if (i === 0)
       return e.set(0, 0, 0);
     if (i === 1)
       return e.copy(n[0]);
     const r = (i - (this._closed ? 0 : 1)) * t;
-    let h = Math.floor(r), a = r - h;
-    this._closed ? h += h > 0 ? 0 : (Math.floor(Math.abs(h) / i) + 1) * i : a === 0 && h === i - 1 && (h = i - 2, a = 1);
-    let o, c;
-    this._closed || h > 0 ? o = n[(h - 1) % i] : (this._tmp.subVectors(n[0], n[1]).add(n[0]), o = new S(this._tmp.x, this._tmp.y, this._tmp.z));
-    const l = n[h % i], m = n[(h + 1) % i];
-    if (this._closed || h + 2 < i ? c = n[(h + 2) % i] : (this._tmp.subVectors(n[i - 1], n[i - 2]).add(n[i - 1]), c = new S(this._tmp.x, this._tmp.y, this._tmp.z)), this._curveType === "centripetal" || this._curveType === "chordal") {
-      const d = this._curveType === "chordal" ? 0.5 : 0.25;
-      let x = Math.pow(o.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(o.x, l.x, m.x, c.x, x, g, y), this._py.initNonuniformCatmullRom(o.y, l.y, m.y, c.y, x, g, y), this._pz.initNonuniformCatmullRom(o.z, l.z, m.z, c.z, x, g, y);
-    } else this._curveType === "catmullrom" && (this._px.initCatmullRom(o.x, l.x, m.x, c.x, this._tension), this._py.initCatmullRom(o.y, l.y, m.y, c.y, this._tension), this._pz.initCatmullRom(o.z, l.z, m.z, c.z, this._tension));
+    let o = Math.floor(r), a = r - o;
+    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], 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(m), u), y = Math.pow(m.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, 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),
@@ -3269,7 +3399,7 @@ class Es extends it {
     return s;
   }
   setPoints(t) {
-    this._points = t.map((s) => new S(s)), this._boundingBoxNeedsUpdate = !0;
+    this._points = t.map((s) => new w(s)), this._boundingBoxNeedsUpdate = !0;
   }
   setClosed(t) {
     this._closed !== t && (this._closed = t, this._boundingBoxNeedsUpdate = !0);
@@ -3282,20 +3412,20 @@ class Es extends it {
   }
   transform(t) {
     return this._points = this._points.map((s) => {
-      const e = new S();
+      const e = new w();
       return e.copy(s), e.applyMatrix4(t), e;
     }), this._boundingBoxNeedsUpdate = !0, this;
   }
   calculateBoundingBox() {
     if (this._points.length === 0)
-      return new D();
-    const t = new D();
+      return new Y();
+    const t = new Y();
     return this._points.forEach((s) => {
       t.expandByPoint(s);
     }), t;
   }
 }
-class U {
+class j {
   constructor(t, s, e, n) {
     this._degree = t, this._knots = [...s], this._controlPoints = e.map((i) => ({ x: i.x, y: i.y, z: i.z })), this._weights = n ? [...n] : new Array(e.length).fill(1);
   }
@@ -3313,7 +3443,7 @@ class U {
   }
   point(t) {
     const s = this._controlPoints.map((e) => [e.x, e.y, e.z]);
-    return _t(
+    return ft(
       t,
       this._degree,
       this._knots,
@@ -3323,7 +3453,7 @@ class U {
   }
   length() {
     const t = this._controlPoints.map((s) => [s.x, s.y, s.z]);
-    return Ms(
+    return ws(
       this._degree,
       this._knots,
       t,
@@ -3331,24 +3461,24 @@ class U {
     );
   }
   static byKnotsControlPointsWeights(t, s, e, n) {
-    return new U(t, s, e, n);
+    return new j(t, s, e, n);
   }
   static byPoints(t, s, e = "Uniform", n, i) {
-    const r = Kt(
+    const r = $t(
       t,
       s,
       e,
       n,
       i
-    ), h = r.controlPoints.map((a) => ({
+    ), o = r.controlPoints.map((a) => ({
       x: a[0],
       y: a[1],
       z: a[2]
     }));
-    return new U(
+    return new j(
       s,
       r.knots,
-      h,
+      o,
       r.weights
     );
   }
@@ -3365,8 +3495,8 @@ class U {
     return s;
   }
   isClosed(t = 1e-6) {
-    const { start: s, end: e } = this.getParameterRange(), n = this.point(s), i = this.point(e), r = n[0] - i[0], h = n[1] - i[1], a = n[2] - i[2];
-    return Math.sqrt(r * r + h * h + a * a) < t;
+    const { start: s, end: e } = this.getParameterRange(), n = this.point(s), i = this.point(e), r = n[0] - i[0], o = n[1] - i[1], a = n[2] - i[2];
+    return Math.sqrt(r * r + o * o + a * a) < t;
   }
   static createFitPointsForClosedCurve(t) {
     if (t.length < 4)
@@ -3380,44 +3510,44 @@ class U {
   }
   static createClosedCurve(t, s, e = "Chord") {
     const i = this.createFitPointsForClosedCurve(t).map((r) => [r.x, r.y, r.z]);
-    return U.byPoints(i, s, e);
+    return j.byPoints(i, s, e);
   }
 }
-class wt extends it {
+class J extends ot {
   constructor(t, s, e, n, i, r) {
     super();
-    const h = arguments.length;
+    const o = arguments.length;
     if (this._degree = 3, this._closed = !1, Array.isArray(s)) {
-      if (h < 2 || h > 5)
-        throw q.ILLEGAL_PARAMETERS;
+      if (o < 2 || o > 5)
+        throw L.ILLEGAL_PARAMETERS;
       this._controlPoints = t;
-      let a, o = 3, c = !1;
-      if (h >= 3 && (Array.isArray(e) ? (a = e, h >= 4 && (o = n || 3), h >= 5 && (c = i)) : e !== void 0 && (o = e || 3, h >= 4 && (c = n))), e === void 0 && h >= 4 && (o = n || 3, h >= 5 && (c = i)), this._degree = o, this._closed = c, this._controlPoints.length < this._degree + 1)
-        throw q.ILLEGAL_PARAMETERS;
-      this._nurbsCurve = U.byKnotsControlPointsWeights(
+      let a, h = 3, c = !1;
+      if (o >= 3 && (Array.isArray(e) ? (a = e, o >= 4 && (h = n || 3), o >= 5 && (c = i)) : e !== void 0 && (h = e || 3, o >= 4 && (c = n))), e === void 0 && o >= 4 && (h = n || 3, o >= 5 && (c = i)), this._degree = h, this._closed = c, this._controlPoints.length < this._degree + 1)
+        throw L.ILLEGAL_PARAMETERS;
+      this._nurbsCurve = j.byKnotsControlPointsWeights(
         this._degree,
         s,
         this._controlPoints,
         a
       );
     } else {
-      if (h < 2 || h > 6)
-        throw q.ILLEGAL_PARAMETERS;
-      this._fitPoints = t, this._knotParameterization = s, h >= 3 && (this._degree = e || 3);
+      if (o < 2 || o > 6)
+        throw L.ILLEGAL_PARAMETERS;
+      this._fitPoints = t, this._knotParameterization = s, o >= 3 && (this._degree = e || 3);
       const a = typeof n == "boolean";
-      h >= 4 && a && (this._closed = n), a ? (h >= 5 && (this._startTangent = i), h >= 6 && (this._endTangent = r)) : (h >= 4 && (this._startTangent = n), h >= 5 && (this._endTangent = i)), this._closed && (this._startTangent = void 0, this._endTangent = void 0);
-      const o = (this._startTangent ? 1 : 0) + (this._endTangent ? 1 : 0);
-      if (this._fitPoints.length + o < this._degree + 1)
-        throw q.ILLEGAL_PARAMETERS;
+      o >= 4 && a && (this._closed = n), a ? (o >= 5 && (this._startTangent = i), o >= 6 && (this._endTangent = r)) : (o >= 4 && (this._startTangent = n), o >= 5 && (this._endTangent = i)), this._closed && (this._startTangent = void 0, this._endTangent = void 0);
+      const h = (this._startTangent ? 1 : 0) + (this._endTangent ? 1 : 0);
+      if (this._fitPoints.length + h < this._degree + 1)
+        throw L.ILLEGAL_PARAMETERS;
       if (this._closed)
-        this._nurbsCurve = U.createClosedCurve(
+        this._nurbsCurve = j.createClosedCurve(
           this._fitPoints,
           this._degree,
           this._knotParameterization
         );
       else {
         const c = this.toNurbsPoints(this._fitPoints);
-        this._nurbsCurve = U.byPoints(
+        this._nurbsCurve = j.byPoints(
           c,
           this._degree,
           this._knotParameterization,
@@ -3433,17 +3563,17 @@ class wt extends it {
   buildCurve() {
     if (this._fitPoints && this._knotParameterization) {
       if (this._closed) {
-        const t = U.createFitPointsForClosedCurve(
+        const t = j.createFitPointsForClosedCurve(
           this._fitPoints
         ), s = this.toNurbsPoints(t);
-        this._nurbsCurve = U.byPoints(
+        this._nurbsCurve = j.byPoints(
           s,
           this._degree,
           this._knotParameterization
         );
       } else {
         const t = this.toNurbsPoints(this._fitPoints);
-        this._nurbsCurve = U.byPoints(
+        this._nurbsCurve = j.byPoints(
           t,
           this._degree,
           this._knotParameterization,
@@ -3456,10 +3586,10 @@ class wt extends it {
       );
     } else if (this._controlPoints)
       if (this._closed) {
-        const t = U.createFitPointsForClosedCurve(
+        const t = j.createFitPointsForClosedCurve(
           this._controlPoints
         ), s = this.toNurbsPoints(t);
-        this._nurbsCurve = U.byPoints(
+        this._nurbsCurve = j.byPoints(
           s,
           this._degree,
           this._knotParameterization
@@ -3468,7 +3598,7 @@ class wt extends it {
         );
       } else {
         const t = this._nurbsCurve.knots(), s = this._nurbsCurve.weights();
-        this._nurbsCurve = U.byKnotsControlPointsWeights(
+        this._nurbsCurve = j.byKnotsControlPointsWeights(
           this._degree,
           t,
           this._controlPoints,
@@ -3508,11 +3638,11 @@ class wt extends it {
   }
   get startPoint() {
     const t = this._nurbsCurve.knots(), s = this._nurbsCurve.degree(), e = t[s], n = this._nurbsCurve.point(e);
-    return new S(n[0], n[1], n[2]);
+    return new w(n[0], n[1], n[2]);
   }
   get endPoint() {
     const t = this._nurbsCurve.knots(), s = this._nurbsCurve.degree(), e = t[t.length - s - 1], n = this._nurbsCurve.point(e);
-    return new S(n[0], n[1], n[2]);
+    return new w(n[0], n[1], n[2]);
   }
   get length() {
     return this._nurbsCurve.length();
@@ -3528,24 +3658,24 @@ class wt extends it {
     return this._controlPoints[e];
   }
   getPoints(t = 100) {
-    const s = this._nurbsCurve, e = [], n = s.knots(), i = this._nurbsCurve.degree(), r = n[i], h = n[n.length - i - 1], a = (h - r) / (t - 1);
-    for (let o = 0; o < t; o++) {
-      const c = o === t - 1 ? h : r + o * a, l = s.point(c);
-      e.push(new S(l[0], l[1], l[2]));
+    const s = this._nurbsCurve, e = [], n = s.knots(), i = this._nurbsCurve.degree(), r = n[i], o = n[n.length - i - 1], a = (o - r) / (t - 1);
+    for (let h = 0; h < t; h++) {
+      const c = h === t - 1 ? o : r + h * a, l = s.point(c);
+      e.push(new w(l[0], l[1], l[2]));
     }
     return e;
   }
   getCurvePoints(t, s) {
     const e = [], n = t.knots(), i = t.degree(), r = n[i], a = (n[n.length - i - 1] - r) / (s - 1);
-    for (let o = 0; o < s; o++) {
-      const c = r + o * a;
+    for (let h = 0; h < s; h++) {
+      const c = r + h * a;
       e.push(t.point(c));
     }
     return e;
   }
   calculateBoundingBox() {
     const t = this.getPoints(100);
-    return new D().setFromPoints(t);
+    return new Y().setFromPoints(t);
   }
   get closed() {
     return this._closed;
@@ -3554,6 +3684,25 @@ class wt extends it {
     this.setClosed(t);
   }
   transform(t) {
+    if (this._fitPoints && this._knotParameterization)
+      this._fitPoints = this._fitPoints.map(
+        (s) => new w(s).applyMatrix4(t)
+      ), this._startTangent && (this._startTangent = new w(
+        this._startTangent
+      ).transformDirection(t)), this._endTangent && (this._endTangent = new w(this._endTangent).transformDirection(
+        t
+      )), this.buildCurve();
+    else {
+      const s = this._nurbsCurve.knots(), e = this._nurbsCurve.weights();
+      this._controlPoints = this._controlPoints.map(
+        (n) => new w(n).applyMatrix4(t)
+      ), this._nurbsCurve = j.byKnotsControlPointsWeights(
+        this._degree,
+        s,
+        this._controlPoints,
+        e.length > 0 ? e : void 0
+      );
+    }
     return this._boundingBoxNeedsUpdate = !0, this;
   }
   toNurbsPoints(t) {
@@ -3576,77 +3725,77 @@ class wt extends it {
       throw new Error(
         `At least ${e + 1} points are required for a degree ${e} closed spline`
       );
-    return new wt(t, s, e, !0);
+    return new J(t, s, e, !0);
   }
 }
 export {
-  Ls as AcGeArea2d,
+  js as AcGeArea2d,
   F as AcGeBox2d,
-  D as AcGeBox3d,
+  Y as AcGeBox3d,
   Es as AcGeCatmullRomCurve3d,
-  $ as AcGeCircArc2d,
-  pt as AcGeCircArc3d,
-  nt as AcGeCurve2d,
-  zt as AcGeEllipseArc2d,
-  Wt as AcGeEllipseArc3d,
-  qt as AcGeEuler,
-  As as AcGeGeometryUtil,
-  Mt as AcGeLine2d,
-  ft as AcGeLine3d,
+  Q as AcGeCircArc2d,
+  At as AcGeCircArc3d,
+  rt as AcGeCurve2d,
+  W as AcGeEllipseArc2d,
+  zt as AcGeEllipseArc3d,
+  Lt as AcGeEuler,
+  fs as AcGeGeometryUtil,
+  Pt as AcGeLine2d,
+  Mt as AcGeLine3d,
   X as AcGeLoop2d,
-  b as AcGeMathUtil,
-  st as AcGeMatrix2d,
-  et as AcGeMatrix3d,
-  U as AcGeNurbsCurve,
-  bt as AcGePlane,
+  M as AcGeMathUtil,
+  it as AcGeMatrix2d,
+  H as AcGeMatrix3d,
+  j as AcGeNurbsCurve,
+  St as AcGePlane,
   C as AcGePoint2d,
-  S as AcGePoint3d,
-  Us as AcGePolyline2d,
-  Pt as AcGeQuaternion,
+  w as AcGePoint3d,
+  Vs as AcGePolyline2d,
+  bt as AcGeQuaternion,
   Ht as AcGeShape2d,
-  wt as AcGeSpline3d,
-  Gt as AcGeTol,
+  J as AcGeSpline3d,
+  Qt as AcGeTol,
   B as AcGeVector2d,
   p as AcGeVector3d,
-  Ot as DEFAULT_TOL,
-  Ft as DEG2RAD,
-  Q as FLOAT_TOL,
+  Kt as DEFAULT_TOL,
+  Xt as DEG2RAD,
+  G as FLOAT_TOL,
   Bs as ORIGIN_POINT_2D,
-  vt as ORIGIN_POINT_3D,
-  Xt as RAD2DEG,
-  I as TAU,
-  At as basisFunction,
-  Ms as calculateCurveLength,
+  Ot as ORIGIN_POINT_3D,
+  Dt as RAD2DEG,
+  E as TAU,
+  wt as basisFunction,
+  ws as calculateCurveLength,
   ms as ceilPowerOfTwo,
-  v as clamp,
-  fs as computeParameterValues,
+  Z as clamp,
+  As as computeParameterValues,
   es as damp,
   ls as degToRad,
   Yt as euclideanModulo,
-  _t as evaluateNurbsPoint,
+  ft as evaluateNurbsPoint,
   xs as floorPowerOfTwo,
   zs as generateAveragedKnots,
-  Ns as generateChordKnots,
-  Rs as generateSqrtChordKnots,
+  Rs as generateChordKnots,
+  Ns as generateSqrtChordKnots,
   Jt as generateUUID,
   ks as generateUniformKnots,
   Zt as intPartLength,
   Ts as interpolateControlPoints,
-  Kt as interpolateNurbsCurve,
+  $t as interpolateNurbsCurve,
   ss as inverseLerp,
   gs as isBetween,
   ys as isBetweenAngle,
-  Qt as isPointInPolygon,
+  Gt as isPointInPolygon,
   ps as isPolygonIntersect,
   ds as isPowerOfTwo,
-  Dt as lerp,
+  vt as lerp,
   ts as mapLinear,
-  yt as normalizeAngle,
+  pt as normalizeAngle,
   ns as pingpong,
   us as radToDeg,
-  os as randFloat,
+  hs as randFloat,
   as as randFloatSpread,
-  hs as randInt,
+  os as randInt,
   _s as relativeEps,
   cs as seededRandom,
   rs as smootherstep,