@mlightcad/geometry-engine 3.2.17 → 3.2.19

package/dist/geometry-engine.js

@@ -1,4 +1,4 @@
-import { AcCmErrors as L } from "@mlightcad/common";
+import { AcCmErrors as U } from "@mlightcad/common";
 const N = [
   "00",
   "01",
@@ -257,112 +257,112 @@ const N = [
   "fe",
   "ff"
 ];
-let Rt = 1234567;
-const Xt = Math.PI / 180, Dt = 180 / Math.PI;
-function Jt() {
-  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();
+let Tt = 1234567;
+const Dt = Math.PI / 180, Yt = 180 / Math.PI;
+function es() {
+  const m = Math.random() * 4294967295 | 0, t = Math.random() * 4294967295 | 0, s = Math.random() * 4294967295 | 0, e = Math.random() * 4294967295 | 0;
+  return (N[m & 255] + N[m >> 8 & 255] + N[m >> 16 & 255] + N[m >> 24 & 255] + "-" + N[t & 255] + N[t >> 8 & 255] + "-" + N[t >> 16 & 15 | 64] + N[t >> 24 & 255] + "-" + N[s & 63 | 128] + N[s >> 8 & 255] + "-" + N[s >> 16 & 255] + N[s >> 24 & 255] + N[e & 255] + N[e >> 8 & 255] + N[e >> 16 & 255] + N[e >> 24 & 255]).toLowerCase();
 }
-function Z(d, t, s) {
-  return Math.max(t, Math.min(s, d));
+function Z(m, t, s) {
+  return Math.max(t, Math.min(s, m));
 }
-function Yt(d, t) {
-  return (d % t + t) % t;
+function Zt(m, t) {
+  return (m % t + t) % t;
 }
-function ts(d, t, s, e, n) {
-  return e + (d - t) * (n - e) / (s - t);
+function ns(m, t, s, e, n) {
+  return e + (m - t) * (n - e) / (s - t);
 }
-function ss(d, t, s) {
-  return d !== t ? (s - d) / (t - d) : 0;
+function is(m, t, s) {
+  return m !== t ? (s - m) / (t - m) : 0;
 }
-function vt(d, t, s) {
-  return (1 - s) * d + s * t;
+function Ot(m, t, s) {
+  return (1 - s) * m + s * t;
 }
-function es(d, t, s, e) {
-  return vt(d, t, 1 - Math.exp(-s * e));
+function rs(m, t, s, e) {
+  return Ot(m, t, 1 - Math.exp(-s * e));
 }
-function ns(d, t = 1) {
-  return t - Math.abs(Yt(d, t * 2) - t);
+function os(m, t = 1) {
+  return t - Math.abs(Zt(m, t * 2) - t);
 }
-function is(d, t, s) {
-  return d <= t ? 0 : d >= s ? 1 : (d = (d - t) / (s - t), d * d * (3 - 2 * d));
+function hs(m, t, s) {
+  return m <= t ? 0 : m >= s ? 1 : (m = (m - t) / (s - t), m * m * (3 - 2 * m));
 }
-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 as(m, t, s) {
+  return m <= t ? 0 : m >= s ? 1 : (m = (m - t) / (s - t), m * m * m * (m * (m * 6 - 15) + 10));
 }
-function os(d, t) {
-  return d + Math.floor(Math.random() * (t - d + 1));
+function cs(m, t) {
+  return m + Math.floor(Math.random() * (t - m + 1));
 }
-function hs(d, t) {
-  return d + Math.random() * (t - d);
+function ls(m, t) {
+  return m + Math.random() * (t - m);
 }
-function as(d) {
-  return d * (0.5 - Math.random());
+function us(m) {
+  return m * (0.5 - Math.random());
 }
-function cs(d) {
-  d !== void 0 && (Rt = d);
-  let t = Rt += 1831565813;
+function ds(m) {
+  m !== void 0 && (Tt = m);
+  let t = Tt += 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(d) {
-  return d * Xt;
+function ms(m) {
+  return m * Dt;
 }
-function us(d) {
-  return d * Dt;
+function xs(m) {
+  return m * Yt;
 }
-function ds(d) {
-  return (d & d - 1) === 0 && d !== 0;
+function gs(m) {
+  return (m & m - 1) === 0 && m !== 0;
 }
-function ms(d) {
-  return Math.pow(2, Math.ceil(Math.log(d) / Math.LN2));
+function ys(m) {
+  return Math.pow(2, Math.ceil(Math.log(m) / Math.LN2));
 }
-function xs(d) {
-  return Math.pow(2, Math.floor(Math.log(d) / Math.LN2));
+function _s(m) {
+  return Math.pow(2, Math.floor(Math.log(m) / Math.LN2));
 }
-function pt(d) {
+function pt(m) {
   const t = Math.PI * 2;
-  return (d % t + t) % t;
+  return (m % t + t) % t;
 }
-function gs(d, t, s) {
-  return d > t && d < s || d > s && d < t;
+function ps(m, t, s) {
+  return m > t && m < s || m > s && m < t;
 }
-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 fs(m, t, s, e = !1) {
+  return m = pt(m), t = pt(t), s = pt(s), e ? t > s ? m <= t && m >= s : m <= t || m >= s : t < s ? m >= t && m <= s : m >= t || m <= s;
 }
-function Zt(d) {
-  return d = Math.abs(d), d < 1 ? 0 : Math.ceil(Math.log10(Math.abs(d) + 1));
+function Qt(m) {
+  return m = Math.abs(m), m < 1 ? 0 : Math.ceil(Math.log10(Math.abs(m) + 1));
 }
-function _s(d, t = 1e-7) {
-  const s = Zt(d);
+function As(m, t = 1e-7) {
+  const s = Qt(m);
   return Math.max(Math.pow(10, s) * t, t);
 }
 const M = {
-  DEG2RAD: Xt,
-  RAD2DEG: Dt,
-  generateUUID: Jt,
+  DEG2RAD: Dt,
+  RAD2DEG: Yt,
+  generateUUID: es,
   clamp: Z,
-  euclideanModulo: Yt,
-  mapLinear: ts,
-  inverseLerp: ss,
-  lerp: vt,
-  damp: es,
-  pingpong: ns,
-  smoothstep: is,
-  smootherstep: rs,
-  randInt: os,
-  randFloat: hs,
-  randFloatSpread: as,
-  seededRandom: cs,
-  degToRad: ls,
-  radToDeg: us,
-  isPowerOfTwo: ds,
-  ceilPowerOfTwo: ms,
-  floorPowerOfTwo: xs,
+  euclideanModulo: Zt,
+  mapLinear: ns,
+  inverseLerp: is,
+  lerp: Ot,
+  damp: rs,
+  pingpong: os,
+  smoothstep: hs,
+  smootherstep: as,
+  randInt: cs,
+  randFloat: ls,
+  randFloatSpread: us,
+  seededRandom: ds,
+  degToRad: ms,
+  radToDeg: xs,
+  isPowerOfTwo: gs,
+  ceilPowerOfTwo: ys,
+  floorPowerOfTwo: _s,
   normalizeAngle: pt,
-  isBetween: gs,
-  isBetweenAngle: ys,
-  intPartLength: Zt,
-  relativeEps: _s
+  isBetween: ps,
+  isBetweenAngle: fs,
+  intPartLength: Qt,
+  relativeEps: As
 }, tt = class tt {
   constructor(t, s) {
     this.x = 0, this.y = 0;
@@ -381,7 +381,7 @@ const M = {
         this.x = t, this.y = s;
         return;
       }
-      throw L.ILLEGAL_PARAMETERS;
+      throw U.ILLEGAL_PARAMETERS;
     }
   }
   get width() {
@@ -610,8 +610,8 @@ const st = class st {
     return this.multiplyMatrices(t, this);
   }
   multiplyMatrices(t, s) {
-    const e = t.elements, n = s.elements, i = this.elements, r = e[0], o = e[3], a = e[6], h = e[1], c = e[4], l = e[7], 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;
+    const e = t.elements, n = s.elements, i = this.elements, r = e[0], o = e[3], a = e[6], h = e[1], c = e[4], l = e[7], d = e[2], u = e[5], x = e[8], g = n[0], y = n[3], _ = n[6], z = n[1], f = n[4], b = n[7], P = n[2], I = n[5], A = n[8];
+    return i[0] = r * g + o * z + a * P, i[3] = r * y + o * f + a * I, i[6] = r * _ + o * b + a * A, i[1] = h * g + c * z + l * P, i[4] = h * y + c * f + l * I, i[7] = h * _ + c * b + l * A, i[2] = d * g + u * z + x * P, i[5] = d * y + u * f + x * I, i[8] = d * _ + u * b + x * A, this;
   }
   multiplyScalar(t) {
     const s = this.elements;
@@ -622,10 +622,10 @@ const st = class st {
     return s * r * c - s * o * h - e * i * c + e * o * a + n * i * h - n * r * a;
   }
   invert() {
-    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], o = t[5], a = t[6], h = t[7], c = t[8], l = c * r - o * h, m = o * a - c * i, u = h * i - r * a, x = s * l + e * m + n * u;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], o = t[5], a = t[6], h = t[7], c = t[8], l = c * r - o * h, d = o * a - c * i, u = h * i - r * a, x = s * l + e * d + 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 * 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;
+    return t[0] = l * g, t[1] = (n * h - c * e) * g, t[2] = (o * e - n * r) * g, t[3] = d * g, t[4] = (c * s - n * a) * g, t[5] = (n * i - o * s) * g, t[6] = u * g, t[7] = (e * a - h * s) * g, t[8] = (r * s - e * i) * g, this;
   }
   transpose() {
     let t;
@@ -654,13 +654,13 @@ const st = class st {
     ), this;
   }
   scale(t, s) {
-    return this.premultiply(Ct.makeScale(t, s)), this;
+    return this.premultiply(Et.makeScale(t, s)), this;
   }
   rotate(t) {
-    return this.premultiply(Ct.makeRotation(-t)), this;
+    return this.premultiply(Et.makeRotation(-t)), this;
   }
   translate(t, s) {
-    return this.premultiply(Ct.makeTranslation(t, s)), this;
+    return this.premultiply(Et.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;
@@ -693,17 +693,21 @@ const st = class st {
 };
 st.IDENTITY = Object.freeze(new st());
 let it = st;
-const Ct = new it(), G = 1e-6, E = 2 * Math.PI, Bs = {
+const Et = new it(), W = 1e-6, E = 2 * Math.PI, Rs = {
   x: 0,
   y: 0
-}, Ot = {
+}, Kt = {
   x: 0,
   y: 0,
   z: 0
 };
-class Qt {
+class bt {
   constructor() {
-    this.equalPointTol = G, this.equalVectorTol = G;
+    this.equalPointTol = W, this.equalVectorTol = W;
+  }
+  clone() {
+    const t = new bt();
+    return t.equalPointTol = this.equalPointTol, t.equalVectorTol = this.equalVectorTol, t;
   }
   equalPoint2d(t, s) {
     return new B(t).sub(s).length() < this.equalPointTol;
@@ -711,50 +715,50 @@ class Qt {
   equalPoint3d(t, s) {
     return new p(t).sub(s).length() < this.equalPointTol;
   }
-  static equalToZero(t, s = G) {
+  static equalToZero(t, s = W) {
     return t < s && t > -s;
   }
-  static equal(t, s, e = G) {
+  static equal(t, s, e = W) {
     return Math.abs(t - s) < e;
   }
-  static great(t, s, e = G) {
+  static great(t, s, e = W) {
     return t - s > e;
   }
-  static less(t, s, e = G) {
+  static less(t, s, e = W) {
     return t - s < e;
   }
 }
-const Kt = new Qt();
-function Gt(d, t, s = !1) {
-  const e = d.x, n = d.y;
+const $t = new bt();
+function Wt(m, t, s = !1) {
+  const e = m.x, n = m.y;
   let i = !1;
   const r = t.length;
   for (let o = 0, a = r - 1; o < r; a = o++) {
-    const h = t[o].x, c = t[o].y, l = t[a].x, 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);
+    const h = t[o].x, c = t[o].y, l = t[a].x, d = t[a].y;
+    let u = c > n != d > n;
+    s && (u = c >= n != d >= n), u && e < (l - h) * (n - c) / (d - c) + h && (i = !i);
   }
   return i;
 }
-function ps(d, t) {
-  if (d.length === 0 || t.length === 0)
+function zs(m, t) {
+  if (m.length === 0 || t.length === 0)
     return !1;
-  const s = new F().setFromPoints(d), e = new F().setFromPoints(t);
+  const s = new X().setFromPoints(m), e = new X().setFromPoints(t);
   if (!s.intersectsBox(e))
     return !1;
-  for (let n = 0; n < d.length; ) {
-    if (Gt(d[n], t, !0))
+  for (let n = 0; n < m.length; ) {
+    if (Wt(m[n], t, !0))
       return !0;
-    n < d.length - 1 && Kt.equalPoint2d(d[n + 1], d[n]) && ++n, ++n;
+    n < m.length - 1 && $t.equalPoint2d(m[n + 1], m[n]) && ++n, ++n;
   }
   return !1;
 }
-const fs = {
-  isPointInPolygon: Gt,
-  isPolygonIntersect: ps
+const ws = {
+  isPointInPolygon: Wt,
+  isPolygonIntersect: zs
 };
-function ks(d, t) {
-  const s = [], e = t - 1, n = d;
+function Ns(m, t) {
+  const s = [], e = t - 1, n = m;
   for (let i = 0; i <= n; i++)
     s.push(0);
   for (let i = 1; i <= e - n; i++)
@@ -763,8 +767,8 @@ function ks(d, t) {
     s.push(e - n + 1);
   return s;
 }
-function Rs(d, t) {
-  const s = t.length - 1, e = d, n = [0];
+function Ts(m, t) {
+  const s = t.length - 1, e = m, n = [0];
   let i = 0;
   for (let o = 1; o <= s; o++) {
     const a = t[o][0] - t[o - 1][0], h = t[o][1] - t[o - 1][1], c = t[o][2] - t[o - 1][2], l = Math.sqrt(a * a + h * h + c * c);
@@ -781,8 +785,8 @@ function Rs(d, t) {
     r.push(s - e + 1);
   return r;
 }
-function As(d, t = "Uniform") {
-  const s = d.length;
+function Ms(m, t = "Uniform") {
+  const s = m.length;
   if (s === 0)
     return [];
   if (s === 1)
@@ -793,13 +797,13 @@ function As(d, t = "Uniform") {
   const n = [0];
   let i = 0;
   for (let r = 1; r <= e; r++) {
-    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;
+    const o = m[r][0] - m[r - 1][0], a = m[r][1] - m[r - 1][1], h = m[r][2] - m[r - 1][2], c = Math.sqrt(o * o + a * a + h * h), l = t === "SqrtChord" ? Math.sqrt(c) : c;
     i += l, n.push(i);
   }
   return i < 1e-12 ? new Array(s).fill(0).map((r, o) => o / e) : n.map((r) => r / i);
 }
-function 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];
+function Ps(m, t) {
+  const s = t.length - 1, e = m, n = s + e + 1, i = new Array(n + 1).fill(0), r = t[t.length - 1];
   for (let o = n - e; o <= n; o++)
     i[o] = r;
   for (let o = 1; o <= s - e; o++) {
@@ -810,12 +814,12 @@ function zs(d, t) {
   }
   return i;
 }
-function Ns(d, t) {
-  const s = t.length - 1, e = d, n = [0];
+function js(m, t) {
+  const s = t.length - 1, e = m, n = [0];
   let i = 0;
   for (let o = 1; o <= s; o++) {
-    const a = t[o][0] - t[o - 1][0], h = t[o][1] - t[o - 1][1], c = t[o][2] - t[o - 1][2], l = Math.sqrt(a * a + h * h + c * c), m = Math.sqrt(l);
-    i += m, n.push(i);
+    const a = t[o][0] - t[o - 1][0], h = t[o][1] - t[o - 1][1], c = t[o][2] - t[o - 1][2], l = Math.sqrt(a * a + h * h + c * c), d = Math.sqrt(l);
+    i += d, n.push(i);
   }
   const r = [];
   for (let o = 0; o <= e; o++)
@@ -828,8 +832,8 @@ function Ns(d, t) {
     r.push(s - e + 1);
   return r;
 }
-function Et(d, t) {
-  const s = d.length, e = d.map((r) => r.slice()), n = t.slice();
+function It(m, t) {
+  const s = m.length, e = m.map((r) => r.slice()), n = t.slice();
   for (let r = 0; r < s; r++) {
     let o = r, a = Math.abs(e[r][r]);
     for (let h = r + 1; h < s; h++) {
@@ -862,122 +866,122 @@ function Et(d, t) {
   }
   return i;
 }
-function $t(d, t, s = "Uniform", e, n) {
-  if (d.length === 0)
+function Ht(m, t, s = "Uniform", e, n) {
+  if (m.length === 0)
     return { controlPoints: [], knots: [], weights: [] };
-  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;
+  const i = m.map((C) => [C[0], C[1], C[2] ?? 0]), r = !!e, o = !!n, a = (r ? 1 : 0) + (o ? 1 : 0), h = i.length - 1, c = h + a;
   if (c < t)
     throw new Error("Not enough points to interpolate a curve of this degree.");
-  const l = 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);
+  const l = Ms(i, s), d = l.slice();
+  r && d.unshift(l[0]), o && d.push(l[l.length - 1]);
+  const u = Ps(t, d), x = c + 1, g = new Array(x), y = new Array(x), _ = new Array(x), z = new Array(x);
   let f = 0;
   g[f] = new Array(x).fill(0), g[f][0] = 1, y[f] = i[0][0], _[f] = i[0][1], z[f] = i[0][2], f++;
-  for (let S = 1; S <= h - 1; S++) {
-    const T = l[S];
+  for (let C = 1; C <= h - 1; C++) {
+    const j = l[C];
     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++;
+    for (let q = 0; q <= c; q++)
+      g[f][q] = wt(q, t, j, u);
+    y[f] = i[C][0], _[f] = i[C][1], z[f] = i[C][2], f++;
   }
   if (g[f] = new Array(x).fill(0), g[f][c] = 1, y[f] = i[h][0], _[f] = i[h][1], z[f] = i[h][2], f++, r) {
-    const 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++;
+    const C = u[t + 1] - u[0], j = C !== 0 ? t / C : 0;
+    g[f] = new Array(x).fill(0), g[f][0] = -j, g[f][1] = j, y[f] = (e == null ? void 0 : e[0]) ?? 0, _[f] = (e == null ? void 0 : e[1]) ?? 0, z[f] = (e == null ? void 0 : e[2]) ?? 0, f++;
   }
   if (o) {
-    const 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 C = u[c + t + 1] - u[c], j = C !== 0 ? t / C : 0;
+    g[f] = new Array(x).fill(0), g[f][c - 1] = -j, g[f][c] = j, y[f] = (n == null ? void 0 : n[0]) ?? 0, _[f] = (n == null ? void 0 : n[1]) ?? 0, z[f] = (n == null ? void 0 : n[2]) ?? 0, f++;
   }
-  const b = 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 b = It(g, y), P = It(g, _), I = It(g, z), A = new Array(x);
+  for (let C = 0; C < x; C++)
+    A[C] = [b[C], P[C], I[C]];
   const k = new Array(x).fill(1);
   return { controlPoints: A, knots: u, weights: k };
 }
-function wt(d, t, s, e) {
+function wt(m, t, s, e) {
   if (t === 0)
-    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);
+    return s >= e[m] && s < e[m + 1] ? 1 : 0;
+  const n = e[m + t] - e[m], i = e[m + t + 1] - e[m + 1], r = n > 1e-10 ? (s - e[m]) / n : 0, o = i > 1e-10 ? (e[m + t + 1] - s) / i : 0;
+  return r * wt(m, t - 1, s, e) + o * wt(m + 1, t - 1, s, e);
 }
-function ft(d, t, s, e, n) {
+function ft(m, t, s, e, n) {
   const i = e.length - 1, r = t;
-  if (d = Math.max(s[r], Math.min(s[i + 1], d)), Math.abs(d - s[i + 1]) < 1e-8)
+  if (m = Math.max(s[r], Math.min(s[i + 1], m)), Math.abs(m - s[i + 1]) < 1e-8)
     return [...e[i]];
-  if (Math.abs(d - s[r]) < 1e-8)
+  if (Math.abs(m - s[r]) < 1e-8)
     return [...e[0]];
   const o = [0, 0, 0];
   let a = 0;
   for (let h = 0; h <= i; h++) {
-    const c = wt(h, r, d, s), l = n[h] * c;
+    const c = wt(h, r, m, s), l = n[h] * c;
     o[0] += e[h][0] * l, o[1] += e[h][1] * l, o[2] += e[h][2] * l, a += l;
   }
   if (Math.abs(a) < 1e-10) {
     const h = s[s.length - r - 1];
-    if (Math.abs(d - h) < 1e-8)
+    if (Math.abs(m - h) < 1e-8)
       return [...e[i]];
-    if (Math.abs(d - s[r]) < 1e-8)
+    if (Math.abs(m - s[r]) < 1e-8)
       return [...e[0]];
   }
   return Math.abs(a) >= 1e-10 && (o[0] /= a, o[1] /= a, o[2] /= a), o;
 }
-function ws(d, t, s, e) {
-  const n = d, i = t[n], r = t[t.length - n - 1];
+function bs(m, t, s, e) {
+  const n = m, i = t[n], r = t[t.length - n - 1];
   let o = 0;
   const a = 1e3, h = (r - i) / a;
   let c = ft(
     i,
-    d,
+    m,
     t,
     s,
     e
   );
   for (let g = 1; g <= a; g++) {
-    const y = i + g * h, _ = ft(y, d, t, s, e), z = _[0] - c[0], f = _[1] - c[1], b = _[2] - c[2];
+    const y = i + g * h, _ = ft(y, m, t, s, e), z = _[0] - c[0], f = _[1] - c[1], b = _[2] - c[2];
     o += Math.sqrt(z * z + f * f + b * b), c = _;
   }
   const l = ft(
     r,
-    d,
+    m,
     t,
     s,
     e
-  ), 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;
+  ), d = l[0] - c[0], u = l[1] - c[1], x = l[2] - c[2];
+  return o += Math.sqrt(d * d + u * u + x * x), o;
 }
-function Ts(d, t = 3, s = "Uniform", e, n) {
-  return d.length === 0 ? [] : $t(
-    d,
+function Vs(m, t = 3, s = "Uniform", e, n) {
+  return m.length === 0 ? [] : Ht(
+    m,
     t,
     s,
     e,
     n
   ).controlPoints;
 }
-class bt {
+class St {
   constructor(t = 0, s = 0, e = 0, n = 1) {
     this._x = t, this._y = s, this._z = e, this._w = n;
   }
   static slerpFlat(t, s, e, n, i, r, o) {
     let a = e[n + 0], h = e[n + 1], c = e[n + 2], l = e[n + 3];
-    const m = i[r + 0], u = i[r + 1], x = i[r + 2], g = i[r + 3];
+    const d = 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 (o === 1) {
-      t[s + 0] = m, t[s + 1] = u, t[s + 2] = x, t[s + 3] = g;
+      t[s + 0] = d, t[s + 1] = u, t[s + 2] = x, t[s + 3] = g;
       return;
     }
-    if (l !== g || a !== m || h !== u || c !== x) {
+    if (l !== g || a !== d || h !== u || c !== x) {
       let y = 1 - o;
-      const _ = a * m + h * u + c * x + l * g, z = _ >= 0 ? 1 : -1, f = 1 - _ * _;
+      const _ = a * d + 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 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) {
+      if (a = a * y + d * 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;
       }
@@ -985,8 +989,8 @@ class bt {
     t[s] = a, t[s + 1] = h, t[s + 2] = c, t[s + 3] = l;
   }
   static multiplyQuaternionsFlat(t, s, e, n, i, r) {
-    const o = e[n], a = e[n + 1], h = e[n + 2], c = e[n + 3], l = i[r], 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;
+    const o = e[n], a = e[n + 1], h = e[n + 2], c = e[n + 3], l = i[r], d = i[r + 1], u = i[r + 2], x = i[r + 3];
+    return t[s] = o * x + c * l + a * u - h * d, t[s + 1] = a * x + c * d + h * l - o * u, t[s + 2] = h * x + c * u + o * d - a * l, t[s + 3] = c * x - o * l - a * d - h * u, t;
   }
   get x() {
     return this._x;
@@ -1016,31 +1020,31 @@ class bt {
     return this._x = t, this._y = s, this._z = e, this._w = n, this._onChangeCallback(), this;
   }
   clone() {
-    return new bt(this._x, this._y, this._z, this._w);
+    return new St(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, 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);
+    const e = t.x, n = t.y, i = t.z, r = t.order, o = Math.cos, a = Math.sin, h = o(e / 2), c = o(n / 2), l = o(i / 2), d = a(e / 2), u = a(n / 2), x = a(i / 2);
     switch (r) {
       case "XYZ":
-        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;
+        this._x = d * c * l + h * u * x, this._y = h * u * l - d * c * x, this._z = h * c * x + d * u * l, this._w = h * c * l - d * u * x;
         break;
       case "YXZ":
-        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;
+        this._x = d * c * l + h * u * x, this._y = h * u * l - d * c * x, this._z = h * c * x - d * u * l, this._w = h * c * l + d * u * x;
         break;
       case "ZXY":
-        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;
+        this._x = d * c * l - h * u * x, this._y = h * u * l + d * c * x, this._z = h * c * x + d * u * l, this._w = h * c * l - d * u * x;
         break;
       case "ZYX":
-        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;
+        this._x = d * c * l - h * u * x, this._y = h * u * l + d * c * x, this._z = h * c * x - d * u * l, this._w = h * c * l + d * u * x;
         break;
       case "YZX":
-        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;
+        this._x = d * c * l + h * u * x, this._y = h * u * l + d * c * x, this._z = h * c * x - d * u * l, this._w = h * c * l - d * u * x;
         break;
       case "XZY":
-        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;
+        this._x = d * c * l - h * u * x, this._y = h * u * l - d * c * x, this._z = h * c * x + d * u * l, this._w = h * c * l + d * u * x;
         break;
     }
     return s === !0 && this._onChangeCallback(), this;
@@ -1050,9 +1054,9 @@ class bt {
     return this._x = t.x * n, this._y = t.y * n, this._z = t.z * n, this._w = Math.cos(e), this._onChangeCallback(), this;
   }
   setFromRotationMatrix(t) {
-    const s = t.elements, e = s[0], n = s[4], i = s[8], r = s[1], o = s[5], a = s[9], h = s[2], c = s[6], l = s[10], m = e + o + l;
-    if (m > 0) {
-      const u = 0.5 / Math.sqrt(m + 1);
+    const s = t.elements, e = s[0], n = s[4], i = s[8], r = s[1], o = s[5], a = s[9], h = s[2], c = s[6], l = s[10], d = e + o + l;
+    if (d > 0) {
+      const u = 0.5 / Math.sqrt(d + 1);
       this._w = 0.25 / u, this._x = (c - a) * u, this._y = (i - h) * u, this._z = (r - n) * u;
     } else if (e > o && e > l) {
       const u = 2 * Math.sqrt(1 + e - o - l);
@@ -1125,8 +1129,8 @@ class bt {
       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 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;
+    const h = Math.sqrt(a), c = Math.atan2(h, o), l = Math.sin((1 - s) * c) / h, d = Math.sin(s * c) / h;
+    return this._w = r * l + this._w * d, this._x = e * l + this._x * d, this._y = n * l + this._y * d, this._z = i * l + this._z * d, this._onChangeCallback(), this;
   }
   slerpQuaternions(t, s, e) {
     return this.copy(t).slerp(s, e);
@@ -1179,7 +1183,7 @@ const R = class R {
         this.x = t, this.y = s, this.z = e;
         return;
       }
-      throw L.ILLEGAL_PARAMETERS;
+      throw U.ILLEGAL_PARAMETERS;
     }
   }
   set(t, s, e) {
@@ -1262,10 +1266,10 @@ const R = class R {
     return this.x = t.x * s.x, this.y = t.y * s.y, this.z = t.z * s.z, this;
   }
   applyEuler(t) {
-    return this.applyQuaternion(Nt.setFromEuler(t));
+    return this.applyQuaternion(jt.setFromEuler(t));
   }
   applyAxisAngle(t, s) {
-    return this.applyQuaternion(Nt.setFromAxisAngle(t, s));
+    return this.applyQuaternion(jt.setFromAxisAngle(t, s));
   }
   applyMatrix3(t) {
     const s = this.x, e = this.y, n = this.z, i = t.elements;
@@ -1367,10 +1371,10 @@ const R = class R {
     return this.copy(t).multiplyScalar(e);
   }
   projectOnPlane(t) {
-    return It.copy(this).projectOnVector(t), this.sub(It);
+    return Bt.copy(this).projectOnVector(t), this.sub(Bt);
   }
   reflect(t) {
-    return this.sub(It.copy(t).multiplyScalar(2 * this.dot(t)));
+    return this.sub(Bt.copy(t).multiplyScalar(2 * this.dot(t)));
   }
   angleTo(t) {
     const s = Math.sqrt(this.lengthSq() * t.lengthSq());
@@ -1424,9 +1428,9 @@ const R = class R {
 };
 R.ORIGIN = Object.freeze(new R(0, 0, 0)), R.X_AXIS = Object.freeze(new R(1, 0, 0)), R.NEGATIVE_X_AXIS = Object.freeze(new R(-1, 0, 0)), R.Y_AXIS = Object.freeze(new R(0, 1, 0)), R.NEGATIVE_Y_AXIS = Object.freeze(new R(0, -1, 0)), R.Z_AXIS = Object.freeze(new R(0, 0, 1)), R.NEGATIVE_Z_AXIS = Object.freeze(new R(0, 0, -1));
 let p = R;
-const 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(
+const Bt = new p(), jt = new St(), et = class et {
+  constructor(t, s, e, n, i, r, o, a, h, c, l, d, u, x, g, y) {
+    this.elements = [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1], t != null && s != null && e != null && n != null && i != null && r != null && o != null && a != null && h != null && c != null && l != null && d != null && u != null && x != null && g != null && y != null && this.set(
       t,
       s,
       e,
@@ -1438,16 +1442,16 @@ const It = new p(), Nt = new bt(), et = class et {
       h,
       c,
       l,
-      m,
+      d,
       u,
       x,
       g,
       y
     );
   }
-  set(t, s, e, n, i, r, o, a, h, c, l, m, u, x, g, y) {
+  set(t, s, e, n, i, r, o, a, h, c, l, d, u, x, g, y) {
     const _ = this.elements;
-    return _[0] = t, _[4] = s, _[8] = e, _[12] = n, _[1] = i, _[5] = r, _[9] = o, _[13] = a, _[2] = h, _[6] = c, _[10] = l, _[14] = m, _[3] = u, _[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] = d, _[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;
@@ -1485,7 +1489,7 @@ const It = new p(), Nt = new bt(), et = class et {
     ), this;
   }
   setFromExtrusionDirection(t) {
-    if (Kt.equalPoint3d(t, p.Z_AXIS))
+    if ($t.equalPoint3d(t, p.Z_AXIS))
       this.identity();
     else {
       const s = new p(1, 0, 0);
@@ -1536,15 +1540,15 @@ const It = new p(), Nt = new bt(), et = class et {
     ), this;
   }
   extractRotation(t) {
-    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();
+    const s = this.elements, e = t.elements, n = 1 / H.setFromMatrixColumn(t, 0).length(), i = 1 / H.setFromMatrixColumn(t, 1).length(), r = 1 / H.setFromMatrixColumn(t, 2).length();
     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(Ms, t, Ps);
+    return this.compose(Ss, t, Cs);
   }
   lookAt(t, s, e) {
     const n = this.elements;
-    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;
+    return V.subVectors(t, s), V.lengthSq() === 0 && (V.z = 1), V.normalize(), Y.crossVectors(e, V), Y.lengthSq() === 0 && (Math.abs(e.z) === 1 ? V.x += 1e-4 : V.z += 1e-4, V.normalize(), Y.crossVectors(e, V)), Y.normalize(), yt.crossVectors(V, Y), n[0] = Y.x, n[4] = yt.x, n[8] = V.x, n[1] = Y.y, n[5] = yt.y, n[9] = V.y, n[2] = Y.z, n[6] = yt.z, n[10] = V.z, this;
   }
   multiply(t) {
     return this.multiplyMatrices(this, t);
@@ -1553,16 +1557,16 @@ const It = new p(), Nt = new bt(), et = class et {
     return this.multiplyMatrices(t, this);
   }
   multiplyMatrices(t, s) {
-    const e = t.elements, n = s.elements, i = this.elements, r = e[0], o = e[4], a = e[8], h = e[12], c = e[1], l = e[5], 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;
+    const e = t.elements, n = s.elements, i = this.elements, r = e[0], o = e[4], a = e[8], h = e[12], c = e[1], l = e[5], d = e[9], u = e[13], x = e[2], g = e[6], y = e[10], _ = e[14], z = e[3], f = e[7], b = e[11], P = e[15], I = n[0], A = n[4], k = n[8], C = n[12], j = n[1], q = n[5], $ = n[9], ht = n[13], at = n[2], ct = n[6], lt = n[10], ut = n[14], dt = n[3], mt = n[7], xt = n[11], gt = n[15];
+    return i[0] = r * I + o * j + a * at + h * dt, i[4] = r * A + o * q + a * ct + h * mt, i[8] = r * k + o * $ + a * lt + h * xt, i[12] = r * C + o * ht + a * ut + h * gt, i[1] = c * I + l * j + d * at + u * dt, i[5] = c * A + l * q + d * ct + u * mt, i[9] = c * k + l * $ + d * lt + u * xt, i[13] = c * C + l * ht + d * ut + u * gt, i[2] = x * I + g * j + y * at + _ * dt, i[6] = x * A + g * q + y * ct + _ * mt, i[10] = x * k + g * $ + y * lt + _ * xt, i[14] = x * C + g * ht + y * ut + _ * gt, i[3] = z * I + f * j + b * at + P * dt, i[7] = z * A + f * q + b * ct + P * mt, i[11] = z * k + f * $ + b * lt + P * xt, i[15] = z * C + f * ht + b * ut + P * gt, this;
   }
   multiplyScalar(t) {
     const s = this.elements;
     return s[0] *= t, s[4] *= t, s[8] *= t, s[12] *= t, s[1] *= t, s[5] *= t, s[9] *= t, s[13] *= t, s[2] *= t, s[6] *= t, s[10] *= t, s[14] *= t, s[3] *= t, s[7] *= t, s[11] *= t, s[15] *= t, this;
   }
   determinant() {
-    const t = this.elements, s = t[0], e = t[4], n = t[8], i = t[12], r = t[1], o = t[5], a = t[9], h = t[13], c = t[2], l = t[6], 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);
+    const t = this.elements, s = t[0], e = t[4], n = t[8], i = t[12], r = t[1], o = t[5], a = t[9], h = t[13], c = t[2], l = t[6], d = t[10], u = t[14], x = t[3], g = t[7], y = t[11], _ = t[15];
+    return x * (+i * a * l - n * h * l - i * o * d + e * h * d + n * o * u - e * a * u) + g * (+s * a * u - s * h * d + i * r * d - n * r * u + n * h * c - i * a * c) + y * (+s * h * l - s * o * u - i * r * l + e * r * u + i * o * c - e * h * c) + _ * (-n * o * c - s * a * l + s * o * d + n * r * l - e * r * d + e * a * c);
   }
   transpose() {
     const t = this.elements;
@@ -1574,11 +1578,11 @@ const It = new p(), Nt = new bt(), et = class et {
     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], 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;
+    const t = this.elements, s = t[0], e = t[1], n = t[2], i = t[3], r = t[4], o = t[5], a = t[6], h = t[7], c = t[8], l = t[9], d = t[10], u = t[11], x = t[12], g = t[13], y = t[14], _ = t[15], z = l * y * h - g * d * h + g * a * u - o * y * u - l * a * _ + o * d * _, f = x * d * h - c * y * h - x * a * u + r * y * u + c * a * _ - r * d * _, b = c * g * h - x * l * h + x * o * u - r * g * u - c * o * _ + r * l * _, P = x * l * a - c * g * a - x * o * d + r * g * d + c * o * y - r * l * y, I = s * z + e * f + n * b + i * P;
     if (I === 0)
       return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
     const A = 1 / I;
-    return t[0] = z * A, t[1] = (g * 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;
+    return t[0] = z * A, t[1] = (g * d * i - l * y * i - g * n * u + e * y * u + l * n * _ - e * d * _) * A, t[2] = (o * y * i - g * a * i + g * n * h - e * y * h - o * n * _ + e * a * _) * A, t[3] = (l * a * i - o * d * i - l * n * h + e * d * h + o * n * u - e * a * u) * A, t[4] = f * A, t[5] = (c * y * i - x * d * i + x * n * u - s * y * u - c * n * _ + s * d * _) * A, t[6] = (x * a * i - r * y * i - x * n * h + s * y * h + r * n * _ - s * a * _) * A, t[7] = (r * d * i - c * a * i + c * n * h - s * d * h - r * n * u + s * a * u) * A, t[8] = b * A, t[9] = (x * l * i - c * g * i - x * e * u + s * g * u + c * e * _ - s * l * _) * A, t[10] = (r * g * i - x * o * i + x * e * h - s * g * h - r * e * _ + s * o * _) * A, t[11] = (c * o * i - r * l * i - c * e * h + s * l * h + r * e * u - s * o * u) * A, t[12] = P * A, t[13] = (c * g * n - x * l * n + x * e * d - s * g * d - c * e * y + s * l * y) * A, t[14] = (x * o * n - r * g * n - x * e * a + s * g * a + r * e * y - s * o * y) * A, t[15] = (r * l * n - c * o * n + c * e * a - s * l * a - r * e * d + s * o * d) * A, this;
   }
   scale(t) {
     const s = this.elements, e = t.x, n = t.y, i = t.z;
@@ -1631,16 +1635,16 @@ const It = new p(), Nt = new bt(), et = class et {
     return this.set(1, e, i, 0, t, 1, r, 0, s, n, 1, 0, 0, 0, 0, 1), this;
   }
   compose(t, s, e) {
-    const n = this.elements, i = s.x, r = s.y, o = s.z, a = s.w, h = i + i, c = r + r, l = o + o, 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;
+    const n = this.elements, i = s.x, r = s.y, o = s.z, a = s.w, h = i + i, c = r + r, l = o + o, d = i * h, u = i * c, x = i * l, g = r * c, y = r * l, _ = o * l, z = a * h, f = a * c, b = a * l, P = e.x, I = e.y, A = e.z;
+    return n[0] = (1 - (g + _)) * P, n[1] = (u + b) * P, n[2] = (x - f) * P, n[3] = 0, n[4] = (u - b) * I, n[5] = (1 - (d + _)) * I, n[6] = (y + z) * I, n[7] = 0, n[8] = (x + f) * A, n[9] = (y - z) * A, n[10] = (1 - (d + g)) * A, n[11] = 0, n[12] = t.x, n[13] = t.y, n[14] = t.z, n[15] = 1, this;
   }
   decompose(t, s, e) {
     const n = this.elements;
-    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);
+    let i = H.set(n[0], n[1], n[2]).length();
+    const r = H.set(n[4], n[5], n[6]).length(), o = H.set(n[8], n[9], n[10]).length();
+    this.determinant() < 0 && (i = -i), t.x = n[12], t.y = n[13], t.z = n[14], L.copy(this);
     const h = 1 / i, c = 1 / r, l = 1 / o;
-    return 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;
+    return L.elements[0] *= h, L.elements[1] *= h, L.elements[2] *= h, L.elements[4] *= c, L.elements[5] *= c, L.elements[6] *= c, L.elements[8] *= l, L.elements[9] *= l, L.elements[10] *= l, s.setFromRotationMatrix(L), e.x = i, e.y = r, e.z = o, this;
   }
   equals(t) {
     const s = this.elements, e = t.elements;
@@ -1659,9 +1663,9 @@ const It = new p(), Nt = new bt(), et = class et {
   }
 };
 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 {
+let G = et;
+const H = new p(), L = new G(), Ss = new p(0, 0, 0), Cs = new p(1, 1, 1), Y = new p(), yt = new p(), V = new p();
+class D {
   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 +1675,7 @@ class Y {
   setFromArray(t) {
     this.makeEmpty();
     for (let s = 0, e = t.length; s < e; s += 3)
-      this.expandByPoint(Bt.fromArray(t, s));
+      this.expandByPoint(kt.fromArray(t, s));
     return this;
   }
   setFromPoints(t) {
@@ -1681,11 +1685,11 @@ class Y {
     return this;
   }
   setFromCenterAndSize(t, s) {
-    const e = Bt.copy(s).multiplyScalar(0.5);
+    const e = kt.copy(s).multiplyScalar(0.5);
     return this.min.copy(t).sub(e), this.max.copy(t).add(e), this;
   }
   clone() {
-    return new Y().copy(this);
+    return new D().copy(this);
   }
   copy(t) {
     return this.min.copy(t.min), this.max.copy(t.max), this;
@@ -1741,7 +1745,7 @@ class Y {
     return s.copy(t).clamp(this.min, this.max);
   }
   distanceToPoint(t) {
-    return this.clampPoint(t, Bt).distanceTo(t);
+    return this.clampPoint(t, kt).distanceTo(t);
   }
   intersect(t) {
     return this.min.max(t.min), this.max.min(t.max), this.isEmpty() && this.makeEmpty(), this;
@@ -1750,7 +1754,7 @@ class Y {
     return this.min.min(t.min), this.max.max(t.max), this;
   }
   applyMatrix4(t) {
-    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);
+    return this.isEmpty() ? this : (v[0].set(this.min.x, this.min.y, this.min.z).applyMatrix4(t), v[1].set(this.min.x, this.min.y, this.max.z).applyMatrix4(t), v[2].set(this.min.x, this.max.y, this.min.z).applyMatrix4(t), v[3].set(this.min.x, this.max.y, this.max.z).applyMatrix4(t), v[4].set(this.max.x, this.min.y, this.min.z).applyMatrix4(t), v[5].set(this.max.x, this.min.y, this.max.z).applyMatrix4(t), v[6].set(this.max.x, this.max.y, this.min.z).applyMatrix4(t), v[7].set(this.max.x, this.max.y, this.max.z).applyMatrix4(t), this.setFromPoints(v), this);
   }
   translate(t) {
     return this.min.add(t), this.max.add(t), this;
@@ -1759,7 +1763,7 @@ class Y {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const D = [
+const v = [
   new p(),
   new p(),
   new p(),
@@ -1768,8 +1772,8 @@ const D = [
   new p(),
   new p(),
   new p()
-], Bt = new p(), Tt = new B();
-class F {
+], kt = new p(), Vt = new B();
+class X {
   constructor(t = void 0, s = void 0) {
     this.min = t == null ? new B(1 / 0, 1 / 0) : new B(t.x, t.y), this.max = s == null ? new B(-1 / 0, -1 / 0) : new B(s.x, s.y);
   }
@@ -1783,11 +1787,11 @@ class F {
     return this;
   }
   setFromCenterAndSize(t, s) {
-    const e = Tt.copy(s).multiplyScalar(0.5);
+    const e = Vt.copy(s).multiplyScalar(0.5);
     return this.min.copy(t).sub(e), this.max.copy(t).add(e), this;
   }
   clone() {
-    return new F().copy(this);
+    return new X().copy(this);
   }
   copy(t) {
     return this.min.copy(t.min), this.max.copy(t.max), this;
@@ -1838,7 +1842,7 @@ class F {
     return s.copy(t).clamp(this.min, this.max);
   }
   distanceToPoint(t) {
-    return this.clampPoint(t, Tt).distanceTo(t);
+    return this.clampPoint(t, Vt).distanceTo(t);
   }
   intersect(t) {
     return this.min.max(t.min), this.max.min(t.max), this.isEmpty() && this.makeEmpty(), this;
@@ -1853,8 +1857,8 @@ class F {
     return t.min.equals(this.min) && t.max.equals(this.max);
   }
 }
-const jt = new p(), bs = new p(), Ss = new it();
-class St {
+const qt = new p(), Es = new p(), Is = new it();
+class Ct {
   constructor(t = new p(1, 0, 0), s = 0) {
     this.normal = t, this.constant = s;
   }
@@ -1868,7 +1872,7 @@ class St {
     return this.normal.copy(t), this.constant = -s.dot(this.normal), this;
   }
   setFromCoplanarPoints(t, s, e) {
-    const n = jt.subVectors(e, s).cross(bs.subVectors(t, s)).normalize();
+    const n = qt.subVectors(e, s).cross(Es.subVectors(t, s)).normalize();
     return this.setFromNormalAndCoplanarPoint(n, t), this;
   }
   copy(t) {
@@ -1894,7 +1898,7 @@ class St {
     return t.copy(this.normal).multiplyScalar(-this.constant);
   }
   applyMatrix4(t, s) {
-    const e = s || Ss.getNormalMatrix(t), n = this.coplanarPoint(jt).applyMatrix4(t), i = this.normal.applyMatrix3(e).normalize();
+    const e = s || Is.getNormalMatrix(t), n = this.coplanarPoint(qt).applyMatrix4(t), i = this.normal.applyMatrix3(e).normalize();
     return this.constant = -n.dot(i), this;
   }
   translate(t) {
@@ -1904,10 +1908,13 @@ class St {
     return t.normal.equals(this.normal) && t.constant === this.constant;
   }
   clone() {
-    return new St().copy(this);
+    return new Ct().copy(this);
   }
 }
-class C extends B {
+class S extends B {
+  clone() {
+    return new S(this.x, this.y);
+  }
   static pointArrayToNumberArray(t) {
     const s = new Array(t.length * 2);
     return t.forEach((e, n) => {
@@ -1916,6 +1923,9 @@ class C extends B {
   }
 }
 class w extends p {
+  clone() {
+    return new w(this.x, this.y, this.z);
+  }
   static pointArrayToNumberArray(t, s = !0) {
     const e = s ? 3 : 2, n = new Array(t.length * e);
     return t.forEach((i, r) => {
@@ -1923,7 +1933,7 @@ class w extends p {
     }), n;
   }
 }
-const Vt = new H(), Ut = new bt(), nt = class nt {
+const Ut = new G(), Lt = new St(), nt = class nt {
   constructor(t = 0, s = 0, e = 0, n = nt.DEFAULT_ORDER) {
     this._x = t, this._y = s, this._z = e, this._order = n;
   }
@@ -1961,37 +1971,37 @@ const Vt = new H(), Ut = new bt(), nt = class nt {
     return this._x = t._x, this._y = t._y, this._z = t._z, this._order = t._order, this._onChangeCallback(), this;
   }
   setFromRotationMatrix(t, s = this._order, e = !0) {
-    const n = t.elements, i = n[0], r = n[4], o = n[8], a = n[1], h = n[5], c = n[9], l = n[2], m = n[6], u = n[10];
+    const n = t.elements, i = n[0], r = n[4], o = n[8], a = n[1], h = n[5], c = n[9], l = n[2], d = n[6], u = n[10];
     switch (s) {
       case "XYZ":
-        this._y = Math.asin(Z(o, -1, 1)), Math.abs(o) < 0.9999999 ? (this._x = Math.atan2(-c, u), this._z = Math.atan2(-r, i)) : (this._x = Math.atan2(m, h), 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(d, h), this._z = 0);
         break;
       case "YXZ":
         this._x = Math.asin(-Z(c, -1, 1)), Math.abs(c) < 0.9999999 ? (this._y = Math.atan2(o, u), this._z = Math.atan2(a, h)) : (this._y = Math.atan2(-l, i), this._z = 0);
         break;
       case "ZXY":
-        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));
+        this._x = Math.asin(Z(d, -1, 1)), Math.abs(d) < 0.9999999 ? (this._y = Math.atan2(-l, u), this._z = Math.atan2(-r, h)) : (this._y = 0, this._z = Math.atan2(a, i));
         break;
       case "ZYX":
-        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));
+        this._y = Math.asin(-Z(l, -1, 1)), Math.abs(l) < 0.9999999 ? (this._x = Math.atan2(d, u), this._z = Math.atan2(a, i)) : (this._x = 0, this._z = Math.atan2(-r, h));
         break;
       case "YZX":
         this._z = Math.asin(Z(a, -1, 1)), Math.abs(a) < 0.9999999 ? (this._x = Math.atan2(-c, h), this._y = Math.atan2(-l, i)) : (this._x = 0, this._y = Math.atan2(o, u));
         break;
       case "XZY":
-        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);
+        this._z = Math.asin(-Z(r, -1, 1)), Math.abs(r) < 0.9999999 ? (this._x = Math.atan2(d, h), this._y = Math.atan2(o, i)) : (this._x = Math.atan2(-c, u), this._y = 0);
         break;
     }
     return this._order = s, e === !0 && this._onChangeCallback(), this;
   }
   setFromQuaternion(t, s, e = !0) {
-    return Vt.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Vt, s, e);
+    return Ut.makeRotationFromQuaternion(t), this.setFromRotationMatrix(Ut, s, e);
   }
   setFromVector3(t, s = this._order) {
     return this.set(t.x, t.y, t.z, s);
   }
   reorder(t) {
-    return Ut.setFromEuler(this), this.setFromQuaternion(Ut, t);
+    return Lt.setFromEuler(this), this.setFromQuaternion(Lt, t);
   }
   equals(t) {
     return t._x === this._x && t._y === this._y && t._z === this._z && t._order === this._order;
@@ -2012,8 +2022,8 @@ const Vt = new H(), Ut = new bt(), nt = class nt {
   }
 };
 nt.DEFAULT_ORDER = "XYZ";
-let Lt = nt;
-class Wt {
+let Ft = nt;
+class Jt {
   constructor() {
     this._boundingBoxNeedsUpdate = !1;
   }
@@ -2021,7 +2031,7 @@ class Wt {
     return this._boundingBoxNeedsUpdate;
   }
 }
-class Ht extends Wt {
+class Gt extends Jt {
   translate(t) {
     return this.transform(new it().makeTranslation(t.x, t.y));
   }
@@ -2029,7 +2039,7 @@ class Ht extends Wt {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class js extends Ht {
+class ts extends Gt {
   constructor() {
     super(), this._loops = [];
   }
@@ -2045,13 +2055,19 @@ class js extends Ht {
   }
   calculateBoundingBox() {
     const t = this.outter;
-    return t ? t.box : new F();
+    return t ? t.box : new X();
   }
   transform(t) {
     return this._loops.forEach((s) => {
       s.transform(t);
     }), this._boundingBoxNeedsUpdate = !0, this;
   }
+  clone() {
+    const t = new ts();
+    return this._loops.forEach((s) => {
+      t.add(s.clone());
+    }), t;
+  }
   getPoints(t) {
     const s = [];
     for (let e = 0; e < this.loops.length; ++e) {
@@ -2071,10 +2087,10 @@ class js extends Ht {
     const r = { index: -1, children: [] };
     for (let a = 0; a < i; a++) {
       const h = e[a], c = t[h], l = s[h];
-      let m = a + 1;
-      for (; m < i; m++) {
-        const u = e[m], x = t[u];
-        if (s[u].containsBox(l) && fs.isPointInPolygon(
+      let d = a + 1;
+      for (; d < i; d++) {
+        const u = e[d], x = t[u];
+        if (s[u].containsBox(l) && ws.isPointInPolygon(
           c[M.randInt(0, c.length - 1)],
           x
         )) {
@@ -2082,7 +2098,7 @@ class js extends Ht {
           break;
         }
       }
-      m === i && r.children.push(n.get(h));
+      d === i && r.children.push(n.get(h));
     }
     return r;
   }
@@ -2108,7 +2124,7 @@ class js extends Ht {
   calculateBoundaryBoxes(t) {
     const s = [];
     return t.forEach((e) => {
-      s.push(new F().setFromPoints(e));
+      s.push(new X().setFromPoints(e));
     }), s;
   }
   sortBoundaryBoxesByAreas(t) {
@@ -2126,7 +2142,7 @@ class js extends Ht {
     }), e;
   }
 }
-class rt extends Ht {
+class rt extends Gt {
   constructor() {
     super(), this.arcLengthDivisions = 100;
   }
@@ -2188,13 +2204,13 @@ class rt extends Ht {
       }
     if (n = a, e[n] === r)
       return n / (i - 1);
-    const c = e[n], m = e[n + 1] - c, u = (r - c) / m;
+    const c = e[n], d = e[n + 1] - c, u = (r - c) / d;
     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), o = new C();
+    const i = this.getPoint(e), r = this.getPoint(n), o = new S();
     return o.copy(r).sub(i).normalize(), o;
   }
   getTangentAt(t) {
@@ -2202,7 +2218,7 @@ class rt extends Ht {
     return this.getTangent(s);
   }
 }
-class Q extends rt {
+class K 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);
@@ -2218,18 +2234,18 @@ class Q extends rt {
       );
     else if (r == 5) {
       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);
+      this.center = new S(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 L.ILLEGAL_PARAMETERS;
+      throw U.ILLEGAL_PARAMETERS;
   }
   createByThreePoints(t, s, e) {
     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(
+    }), i = (A, k) => (k.y - A.y) / (k.x - A.x), r = (A) => -1 / A, o = n(t, s), a = n(s, e), h = i(t, s), c = i(s, e), l = r(h), d = r(c), u = (A, k, C, j) => {
+      const q = (j - k) / (A - C), $ = A * q + k;
+      return { x: q, y: $ };
+    }, x = o.y - l * o.x, g = a.y - d * a.x, y = u(l, x, d, g), _ = Math.sqrt(
       Math.pow(t.x - y.x, 2) + Math.pow(t.y - y.y, 2)
     ), z = (A, k) => Math.atan2(A.y - k.y, A.x - k.x), f = z(t, y), b = z(s, y), P = z(e, y), I = P > f && P < b || f > P && f < b || b > P && b < f;
     this.center = y, this.radius = _, this._clockwise = !I, this._startAngle = f, this._endAngle = P;
@@ -2237,9 +2253,9 @@ class Q extends rt {
   createByStartEndPointsAndBulge(t, s, e) {
     let n, i, r;
     e < 0 ? (n = Math.atan(-e) * 4, i = new B(t), r = new B(s)) : (n = Math.atan(e) * 4, i = new B(s), r = new B(t));
-    const o = new B().subVectors(r, i), a = o.length(), h = new B().addVectors(i, o.multiplyScalar(0.5)), c = Math.abs(a / 2 / Math.tan(n / 2)), l = o.normalize(), 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)
+    const o = new B().subVectors(r, i), a = o.length(), h = new B().addVectors(i, o.multiplyScalar(0.5)), c = Math.abs(a / 2 / Math.tan(n / 2)), l = o.normalize(), d = e < 0 ? -Math.PI / 2 : Math.PI / 2, u = new B(
+      l.x * Math.cos(d) - l.y * Math.sin(d),
+      l.y * Math.cos(d) + l.x * Math.sin(d)
     );
     let x;
     n < Math.PI ? e < 0 ? x = h.add(u.multiplyScalar(c)) : x = h.add(u.multiplyScalar(-c)) : e < 0 ? x = h.add(u.multiplyScalar(-c)) : x = h.add(u.multiplyScalar(c)), e < 0 ? (this._startAngle = Math.atan2(i.y - x.y, i.x - x.x), this._endAngle = Math.atan2(r.y - x.y, r.x - x.x)) : (this._startAngle = Math.atan2(r.y - x.y, r.x - x.x), this._endAngle = Math.atan2(i.y - x.y, i.x - x.x)), this._clockwise = e < 0, this.center = x, this.radius = r.sub(x).length();
@@ -2248,7 +2264,7 @@ class Q extends rt {
     return this._center;
   }
   set center(t) {
-    this._center = new C(t.x, t.y), this._boundingBoxNeedsUpdate = !0;
+    this._center = new S(t.x, t.y), this._boundingBoxNeedsUpdate = !0;
   }
   get radius() {
     return this._radius;
@@ -2311,9 +2327,9 @@ class Q extends rt {
       ) && t.push(this.getPointAtAngle(i));
     }
     const e = t.map((i) => i.x), n = t.map((i) => i.y);
-    return new F(
-      new C(Math.min(...e), Math.min(...n)),
-      new C(Math.max(...e), Math.max(...n))
+    return new X(
+      new S(Math.min(...e), Math.min(...n)),
+      new S(Math.max(...e), Math.max(...n))
     );
   }
   get length() {
@@ -2326,7 +2342,7 @@ class Q extends rt {
         n.y - e.y,
         n.x - e.x
       ), this._endAngle = this._startAngle, this._clockwise = s.determinant() < 0 ? !this._clockwise : this._clockwise, this._boundingBoxNeedsUpdate = !0, this;
-    const i = this.midPoint.clone().applyMatrix2d(s), r = this.endPoint.clone().applyMatrix2d(s), o = new Q(
+    const i = this.midPoint.clone().applyMatrix2d(s), r = this.endPoint.clone().applyMatrix2d(s), o = new K(
       n,
       i,
       r
@@ -2347,7 +2363,7 @@ class Q extends rt {
     ), this._boundingBoxNeedsUpdate = !0, this;
   }
   clone() {
-    return new Q(
+    return new K(
       this.center.clone(),
       this.radius,
       this._startAngle,
@@ -2357,7 +2373,7 @@ class Q extends rt {
   }
   getPointAtAngle(t) {
     const s = this._getInternalAngle(t), e = this.center.x + this.radius * Math.cos(s), n = this.center.y + this.radius * Math.sin(s);
-    return new C(e, n);
+    return new S(e, n);
   }
   getPoints(t = 100) {
     const s = [];
@@ -2365,25 +2381,25 @@ class Q extends rt {
     if (this.closed && (e = E, n = 0), this.clockwise)
       for (let i = 0; i <= t; i++) {
         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));
+        s.push(new S(a.x, a.y));
       }
     else
       for (let i = 0; i <= t; i++) {
         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));
+        s.push(new S(a.x, a.y));
       }
     return s;
   }
 }
-class Cs extends Wt {
+class Bs extends Jt {
   translate(t) {
-    return this.transform(new H().makeTranslation(t.x, t.y, t.z));
+    return this.transform(new G().makeTranslation(t.x, t.y, t.z));
   }
   get box() {
     return (this._box == null || this._boundingBoxNeedsUpdate) && (this._box = this.calculateBoundingBox(), this._boundingBoxNeedsUpdate = !1), this._box;
   }
 }
-class ot extends Cs {
+class ot extends Bs {
 }
 class Mt extends ot {
   constructor(t, s) {
@@ -2446,9 +2462,9 @@ class Mt extends ot {
     return this._boundingBoxNeedsUpdate = !0, this;
   }
   closestPointToPointParameter(t, s) {
-    qt.subVectors(t, this._start), _t.subVectors(this.endPoint, this.startPoint);
+    Xt.subVectors(t, this._start), _t.subVectors(this.endPoint, this.startPoint);
     const e = _t.dot(_t);
-    let i = _t.dot(qt) / e;
+    let i = _t.dot(Xt) / e;
     return s && (i = M.clamp(i, 0, 1)), i;
   }
   closestPointToPoint(t, s, e) {
@@ -2482,7 +2498,7 @@ class Mt extends ot {
       Math.max(this._start.y, this._end.y),
       Math.max(this._start.z, this._end.z)
     );
-    return new Y(t, s);
+    return new D(t, s);
   }
   transform(t) {
     return this._start.applyMatrix4(t), this._end.applyMatrix4(t), this._boundingBoxNeedsUpdate = !0, this;
@@ -2497,13 +2513,13 @@ class Mt extends ot {
     return new Mt(this._start.clone(), this._end.clone());
   }
 }
-const O = new p(), qt = new p(), _t = new p();
+const O = new p(), Xt = 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), o = new p().subVectors(e, t), a = new p().crossVectors(r, o).normalize();
     if (a.lengthSq() === 0)
       return null;
-    const h = new p().crossVectors(r, a).normalize(), c = new p().crossVectors(o, a).normalize(), l = h.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), 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();
+    const h = new p().crossVectors(r, a).normalize(), c = new p().crossVectors(o, a).normalize(), l = h.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), d = c.clone().multiplyScalar(Number.MAX_SAFE_INTEGER), u = new Mt(n, n.clone().add(l)), x = new Mt(i, i.clone().add(d)), g = new p();
     return u.closestPointToPoint(x.startPoint, !0, g) ? g : null;
   }
   static createByThreePoints(t, s, e) {
@@ -2536,7 +2552,7 @@ class At extends ot {
     return this._radius;
   }
   set radius(t) {
-    if (t < 0) throw L.ILLEGAL_PARAMETERS;
+    if (t < 0) throw U.ILLEGAL_PARAMETERS;
     this._radius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get startAngle() {
@@ -2595,16 +2611,16 @@ class At extends ot {
     if (a.lengthSq() === 0)
       return this.startPoint.clone();
     a.normalize().multiplyScalar(this.radius);
-    const h = e.clone().add(a), c = this.getAngle(h.clone()), l = this.startAngle, m = this.deltaAngle;
+    const h = e.clone().add(a), c = this.getAngle(h.clone()), l = this.startAngle, d = this.deltaAngle;
     let u = M.normalizeAngle(c - l);
-    u < 0 && (u = 0), u > m && (u = m);
+    u < 0 && (u = 0), u > d && (u = d);
     const x = this.getPointAtAngle(l + u), g = x.distanceTo(s), y = this.startPoint.distanceTo(s), _ = this.endPoint.distanceTo(s);
     return y < g && y <= _ ? this.startPoint.clone() : _ < g && _ < y ? this.endPoint.clone() : x;
   }
   tangentPoints(t) {
-    const s = [], e = new p(t.x, t.y, t.z || 0), n = this.center, i = this.normal, r = this.radius, a = e.clone().sub(n).dot(i), h = e.clone().sub(i.clone().multiplyScalar(a)), c = n.clone(), m = h.clone().sub(c).length();
-    if (m < r) return s;
-    const u = Math.acos(r / m), x = this.getAngle(h.clone()), g = [x + u, x - u];
+    const s = [], e = new p(t.x, t.y, t.z || 0), n = this.center, i = this.normal, r = this.radius, a = e.clone().sub(n).dot(i), h = e.clone().sub(i.clone().multiplyScalar(a)), c = n.clone(), d = h.clone().sub(c).length();
+    if (d < r) return s;
+    const u = Math.acos(r / d), x = this.getAngle(h.clone()), g = [x + u, x - u];
     for (const y of g) {
       const _ = M.normalizeAngle(y - this.startAngle);
       _ >= 0 && _ <= this.deltaAngle && s.push(this.getPointAtAngle(this.startAngle + _));
@@ -2626,7 +2642,7 @@ class At extends ot {
       const h = this.getPointAtAngle(a);
       h.x < s && (s = h.x), h.y < e && (e = h.y), h.z < n && (n = h.z), h.x > i && (i = h.x), h.y > r && (r = h.y), h.z > o && (o = h.z);
     }
-    return new Y(
+    return new D(
       { x: s, y: e, z: n },
       { x: i, y: r, z: o }
     );
@@ -2656,7 +2672,7 @@ class At extends ot {
     const h = (c) => {
       const l = new p(c).sub(s);
       return Math.atan2(
-        l.dot(Ft.crossVectors(a, r)),
+        l.dot(vt.crossVectors(a, r)),
         l.dot(r)
       );
     };
@@ -2677,7 +2693,7 @@ class At extends ot {
   }
   getAngle(t) {
     return t.sub(this.center), Math.atan2(
-      t.dot(Ft.crossVectors(this.refVec, this.normal)),
+      t.dot(vt.crossVectors(this.refVec, this.normal)),
       t.dot(this.refVec)
     );
   }
@@ -2694,12 +2710,12 @@ class At extends ot {
     );
   }
   get plane() {
-    const t = new p(this.center).distanceTo(Ot);
-    return new St(this.normal, t);
+    const t = new p(this.center).distanceTo(Kt);
+    return new Ct(this.normal, t);
   }
 }
-const Ft = new p();
-class W extends rt {
+const vt = new p();
+class J 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;
   }
@@ -2713,14 +2729,14 @@ class W extends rt {
     return this._majorAxisRadius;
   }
   set majorAxisRadius(t) {
-    if (t < 0) throw L.ILLEGAL_PARAMETERS;
+    if (t < 0) throw U.ILLEGAL_PARAMETERS;
     this._majorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get minorAxisRadius() {
     return this._minorAxisRadius;
   }
   set minorAxisRadius(t) {
-    if (t < 0) throw L.ILLEGAL_PARAMETERS;
+    if (t < 0) throw U.ILLEGAL_PARAMETERS;
     this._minorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get startAngle() {
@@ -2759,7 +2775,7 @@ class W extends rt {
       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 });
+    return new X({ x: s, y: e }, { x: n, y: i });
   }
   get closed() {
     return this.deltaAngle == 0;
@@ -2777,25 +2793,25 @@ class W extends rt {
       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, o);
+    return new S(r, o);
   }
   transform(t) {
-    const s = t, e = new C(this.center).applyMatrix2d(
+    const s = t, e = new S(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(
+    ), i = this.getPointAtAngle(0).clone().applyMatrix2d(s), r = this.getPointAtAngle(Math.PI / 2).clone().applyMatrix2d(s), o = new S(i).sub(
       e
-    ), a = new C(r).sub(
+    ), a = new S(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);
+    ), h = o.length(), c = a.length(), l = Math.atan2(o.y, o.x), d = o.clone().normalize(), u = a.clone().normalize(), x = (_) => {
+      const z = new S(_).sub(e), f = z.dot(d), b = z.dot(u);
       return M.normalizeAngle(
         Math.atan2(b / c, f / h)
       );
-    }, g = s.determinant() < 0 ? !this.clockwise : this.clockwise, y = this.closed ? new W(
+    }, g = s.determinant() < 0 ? !this.clockwise : this.clockwise, y = this.closed ? new J(
       n,
       h,
       c,
@@ -2803,7 +2819,7 @@ class W extends rt {
       E,
       g,
       l
-    ) : new W(
+    ) : new J(
       n,
       h,
       c,
@@ -2823,7 +2839,7 @@ class W extends rt {
     return this.center = t.center, this.majorAxisRadius = t.majorAxisRadius, this.minorAxisRadius = t.minorAxisRadius, this.startAngle = t.startAngle, this.endAngle = t.endAngle, this.clockwise = t.clockwise, this.rotation = t.rotation, this;
   }
   clone() {
-    return new W(
+    return new J(
       this.center,
       this.majorAxisRadius,
       this.minorAxisRadius,
@@ -2850,14 +2866,14 @@ class zt extends ot {
     return this._majorAxisRadius;
   }
   set majorAxisRadius(t) {
-    if (t < 0) throw L.ILLEGAL_PARAMETERS;
+    if (t < 0) throw U.ILLEGAL_PARAMETERS;
     this._majorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get minorAxisRadius() {
     return this._minorAxisRadius;
   }
   set minorAxisRadius(t) {
-    if (t < 0) throw L.ILLEGAL_PARAMETERS;
+    if (t < 0) throw U.ILLEGAL_PARAMETERS;
     this._minorAxisRadius = t, this._boundingBoxNeedsUpdate = !0;
   }
   get startAngle() {
@@ -2910,7 +2926,7 @@ class zt extends ot {
     return this.getPointAtAngle(e);
   }
   get isCircular() {
-    return Qt.equal(this.majorAxisRadius, this.minorAxisRadius);
+    return bt.equal(this.majorAxisRadius, this.minorAxisRadius);
   }
   get length() {
     if (this.isCircular)
@@ -2940,7 +2956,7 @@ class zt extends ot {
         const h = this.getPointAtAngle(a);
         h.x < s && (s = h.x), h.y < e && (e = h.y), h.z < n && (n = h.z), h.x > i && (i = h.x), h.y > r && (r = h.y), h.z > o && (o = h.z);
       }
-      return new Y(
+      return new D(
         { x: s, y: e, z: n },
         { x: i, y: r, z: o }
       );
@@ -2950,7 +2966,7 @@ class zt extends ot {
         const h = this.startAngle + this.deltaAngle * (a / 100), c = this.getPointAtAngle(h);
         s = Math.min(s, c.x), e = Math.min(e, c.y), n = Math.min(n, c.z), i = Math.max(i, c.x), r = Math.max(r, c.y), o = Math.max(o, c.z);
       }
-      return new Y(
+      return new D(
         { x: s, y: e, z: n },
         { x: i, y: r, z: o }
       );
@@ -2987,10 +3003,10 @@ class zt extends ot {
     ), 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());
+    let d = new p().crossVectors(l, c).normalize();
+    d.dot(o) < 0 && (l.negate(), d = new p().crossVectors(l, c).normalize());
     const u = (g) => {
-      const y = new p(g).sub(e), _ = y.dot(c), z = y.dot(m);
+      const y = new p(g).sub(e), _ = y.dot(c), z = y.dot(d);
       return M.normalizeAngle(
         Math.atan2(z / h, _ / a)
       );
@@ -3028,11 +3044,11 @@ class zt extends ot {
     );
   }
   get plane() {
-    const t = new p(this.center).distanceTo(Ot);
-    return new St(this.normal, t);
+    const t = new p(this.center).distanceTo(Kt);
+    return new Ct(this.normal, t);
   }
 }
-class Vs extends rt {
+class ss extends rt {
   constructor(t = null, s = !1) {
     super(), this._vertices = t || new Array(), this._closed = s;
   }
@@ -3048,7 +3064,7 @@ class Vs extends rt {
   get startPoint() {
     if (this.numberOfVertices > 0) {
       const t = this._vertices[0];
-      return new C(t.x, t.y);
+      return new S(t.x, t.y);
     }
     throw new Error("Start point does not exist in an empty polyline.");
   }
@@ -3057,10 +3073,10 @@ class Vs extends rt {
     if (t > 0)
       if (this.closed) {
         const s = this._vertices[0];
-        return new C(s.x, s.y);
+        return new S(s.x, s.y);
       } else {
         const s = this._vertices[t - 1];
-        return new C(s.x, s.y);
+        return new S(s.x, s.y);
       }
     throw new Error("End point does not exist in an empty polyline.");
   }
@@ -3072,10 +3088,10 @@ class Vs extends rt {
       let i = null;
       if (e < s - 1 ? i = this._vertices[e + 1] : e == s - 1 && this.closed && (i = this._vertices[0]), i)
         if (n.bulge) {
-          const r = new Q(n, i, n.bulge);
+          const r = new K(n, i, n.bulge);
           t += r.length;
         } else
-          t += new C(n.x, n.y).distanceTo(i);
+          t += new S(n.x, n.y).distanceTo(i);
     }
     return t;
   }
@@ -3097,19 +3113,25 @@ class Vs extends rt {
   }
   getPointAt(t) {
     const s = this._vertices[t];
-    return new C(s.x, s.y);
+    return new S(s.x, s.y);
   }
   calculateBoundingBox() {
     const t = this.getPoints(100);
-    return new F().setFromPoints(t);
+    return new X().setFromPoints(t);
   }
   transform(t) {
     const s = t.determinant() < 0;
     return this._vertices.forEach((e) => {
-      const n = new C(e).applyMatrix2d(t);
+      const n = new S(e).applyMatrix2d(t);
       e.x = n.x, e.y = n.y, s && e.bulge != null && (e.bulge = -e.bulge);
     }), this._boundingBoxNeedsUpdate = !0, this;
   }
+  clone() {
+    return new ss(
+      this._vertices.map((t) => ({ ...t })),
+      this._closed
+    );
+  }
   getPoints3d(t, s) {
     const e = [];
     return this.getPoints(t).forEach(
@@ -3123,21 +3145,21 @@ class Vs extends rt {
       if (i.bulge) {
         let r = null;
         if (n < e - 1 ? r = this._vertices[n + 1] : n == e - 1 && this.closed && (r = this._vertices[0]), r) {
-          const a = new Q(i, r, i.bulge).getPoints(t), h = a.length;
+          const a = new K(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));
+            s.push(new S(l.x, l.y));
           }
         }
       } else
-        s.push(new C(i.x, i.y)), n == e - 1 && this.closed && s.push(s[0]);
+        s.push(new S(i.x, i.y)), n == e - 1 && this.closed && s.push(s[0]);
     }
     return s;
   }
 }
 class Pt extends rt {
   constructor(t, s) {
-    super(), this._start = new C(t), this._end = new C(s);
+    super(), this._start = new S(t), this._end = new S(s);
   }
   get startPoint() {
     return this._start;
@@ -3158,14 +3180,14 @@ class Pt extends rt {
     return this.startPoint.distanceTo(this.endPoint);
   }
   calculateBoundingBox() {
-    const t = new C(
+    const t = new S(
       Math.min(this._start.x, this._end.x),
       Math.min(this._start.y, this._end.y)
-    ), s = new C(
+    ), s = new S(
       Math.max(this._start.x, this._end.x),
       Math.max(this._start.y, this._end.y)
     );
-    return new F(t, s);
+    return new X(t, s);
   }
   transform(t) {
     return this._start.applyMatrix2d(t), this._end.applyMatrix2d(t), this._boundingBoxNeedsUpdate = !0, this;
@@ -3180,7 +3202,7 @@ class Pt extends rt {
     return new Pt(this._start.clone(), this._end.clone());
   }
 }
-class X extends rt {
+class F extends rt {
   constructor(t = []) {
     super(), this._curves = t;
   }
@@ -3196,20 +3218,20 @@ class X extends rt {
     for (; e.length > 0; ) {
       const o = [], a = e.shift();
       o.push(a);
-      const h = X.getEdgeStartPoint(a);
-      let c = X.getEdgeEndPoint(a);
+      const h = F.getEdgeStartPoint(a);
+      let c = F.getEdgeEndPoint(a);
       if (!r(h, c))
         for (; e.length > 0; ) {
-          const l = X.findConnectingEdge(
+          const l = F.findConnectingEdge(
             e,
             c,
             i
           );
           if (l.index < 0) break;
-          let m = e.splice(l.index, 1)[0];
-          if (l.reverse && (m = X.reverseEdge(m)), o.push(m), c = X.getEdgeEndPoint(m), r(c, h)) break;
+          let d = e.splice(l.index, 1)[0];
+          if (l.reverse && (d = F.reverseEdge(d)), o.push(d), c = F.getEdgeEndPoint(d), r(c, h)) break;
         }
-      n.push(new X(o));
+      n.push(new F(o));
     }
     return n;
   }
@@ -3222,7 +3244,7 @@ class X extends rt {
   get startPoint() {
     if (this._curves.length > 0) {
       const t = this._curves[0].startPoint;
-      return new C(t.x, t.y);
+      return new S(t.x, t.y);
     }
     throw new Error("Start point does not exist in an empty loop.");
   }
@@ -3236,11 +3258,11 @@ class X extends rt {
     }), t;
   }
   calculateBoundingBox() {
-    const t = this.getPoints(100), s = new F();
+    const t = this.getPoints(100), s = new X();
     return s.setFromPoints(t), s;
   }
   transform(t) {
-    const s = new H().set(
+    const s = new G().set(
       t.elements[0],
       t.elements[3],
       0,
@@ -3259,9 +3281,12 @@ class X extends rt {
       1
     );
     return this._curves.forEach((e) => {
-      e instanceof J ? e.transform(s) : e.transform(t);
+      e instanceof Q ? e.transform(s) : e.transform(t);
     }), this._boundingBoxNeedsUpdate = !0, this;
   }
+  clone() {
+    return new F(this._curves.map((t) => t.clone()));
+  }
   get closed() {
     return !0;
   }
@@ -3269,14 +3294,14 @@ class X extends rt {
     const s = [];
     return this.curves.forEach((e) => {
       e.getPoints(t).forEach((n) => {
-        s.push(new C(n.x, n.y));
+        s.push(new S(n.x, n.y));
       });
     }), s;
   }
   static findConnectingEdge(t, s, e) {
     let n = -1, i = !1, r = Number.POSITIVE_INFINITY;
     for (let o = 0; o < t.length; o++) {
-      const a = t[o], h = X.getEdgeStartPoint(a), c = X.getEdgeEndPoint(a), l = s.x - h.x, m = s.y - h.y, u = l * l + m * m;
+      const a = t[o], h = F.getEdgeStartPoint(a), c = F.getEdgeEndPoint(a), l = s.x - h.x, d = s.y - h.y, u = l * l + d * d;
       u < r && (r = u, n = o, i = !1);
       const x = s.x - c.x, g = s.y - c.y, y = x * x + g * g;
       y < r && (r = y, n = o, i = !0);
@@ -3285,20 +3310,20 @@ class X extends rt {
   }
   static getEdgeStartPoint(t) {
     const s = t.startPoint;
-    return new C(s.x, s.y);
+    return new S(s.x, s.y);
   }
   static getEdgeEndPoint(t) {
     const s = t.endPoint;
-    return new C(s.x, s.y);
+    return new S(s.x, s.y);
   }
   static reverseEdge(t) {
-    return t instanceof Pt ? new Pt(t.endPoint, t.startPoint) : t instanceof Q ? new Q(
+    return t instanceof Pt ? new Pt(t.endPoint, t.startPoint) : t instanceof K ? new K(
       t.center,
       t.radius,
       t.endAngle,
       t.startAngle,
       !t.clockwise
-    ) : t instanceof W ? new W(
+    ) : t instanceof J ? new J(
       t.center,
       t.majorAxisRadius,
       t.minorAxisRadius,
@@ -3306,11 +3331,11 @@ class X extends rt {
       t.startAngle,
       !t.clockwise,
       t.rotation
-    ) : t instanceof J ? X.reverseSplineEdge(t) : t;
+    ) : t instanceof Q ? F.reverseSplineEdge(t) : t;
   }
   static reverseSplineEdge(t) {
     const s = [...t.controlPoints].reverse(), e = t.knots, n = e[0], i = e[e.length - 1], r = e.map((h) => n + i - h).reverse(), o = t.weights, a = o.length > 0 ? [...o].reverse() : void 0;
-    return new J(
+    return new Q(
       s,
       r,
       a,
@@ -3319,7 +3344,7 @@ class X extends rt {
     );
   }
 }
-class kt {
+class Rt {
   constructor() {
     this.c0 = 0, this.c1 = 0, this.c2 = 0, this.c3 = 0;
   }
@@ -3338,9 +3363,9 @@ class kt {
     return this.c0 + this.c1 * t + this.c2 * s + this.c3 * e;
   }
 }
-class Es extends ot {
+class Nt 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 w(i)), this._closed = s, this._curveType = e, this._tension = n;
+    super(), this.isCatmullRomCurve3d = !0, this.type = "CatmullRomCurve3d", this._tmp = new p(), this._px = new Rt(), this._py = new Rt(), this._pz = new Rt(), this._points = t.map((i) => new w(i)), this._closed = s, this._curveType = e, this._tension = n;
   }
   get points() {
     return this._points;
@@ -3380,12 +3405,12 @@ class Es extends ot {
     this._closed ? o += o > 0 ? 0 : (Math.floor(Math.abs(o) / i) + 1) * i : a === 0 && o === i - 1 && (o = i - 2, a = 1);
     let h, c;
     this._closed || o > 0 ? h = n[(o - 1) % i] : (this._tmp.subVectors(n[0], n[1]).add(n[0]), h = new w(this._tmp.x, this._tmp.y, this._tmp.z));
-    const l = n[o % i], m = n[(o + 1) % i];
+    const l = n[o % i], d = 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));
+      let x = Math.pow(h.distanceToSquared(l), u), g = Math.pow(l.distanceToSquared(d), u), y = Math.pow(d.distanceToSquared(c), u);
+      g < 1e-4 && (g = 1), x < 1e-4 && (x = g), y < 1e-4 && (y = g), this._px.initNonuniformCatmullRom(h.x, l.x, d.x, c.x, x, g, y), this._py.initNonuniformCatmullRom(h.y, l.y, d.y, c.y, x, g, y), this._pz.initNonuniformCatmullRom(h.z, l.z, d.z, c.z, x, g, y);
+    } else this._curveType === "catmullrom" && (this._px.initCatmullRom(h.x, l.x, d.x, c.x, this._tension), this._py.initCatmullRom(h.y, l.y, d.y, c.y, this._tension), this._pz.initCatmullRom(h.z, l.z, d.z, c.z, this._tension));
     return e.set(
       this._px.calc(a),
       this._py.calc(a),
@@ -3410,6 +3435,14 @@ class Es extends ot {
   setTension(t) {
     this._tension = t;
   }
+  clone() {
+    return new Nt(
+      this._points.map((t) => t.clone()),
+      this._closed,
+      this._curveType,
+      this._tension
+    );
+  }
   transform(t) {
     return this._points = this._points.map((s) => {
       const e = new w();
@@ -3418,14 +3451,14 @@ class Es extends ot {
   }
   calculateBoundingBox() {
     if (this._points.length === 0)
-      return new Y();
-    const t = new Y();
+      return new D();
+    const t = new D();
     return this._points.forEach((s) => {
       t.expandByPoint(s);
     }), t;
   }
 }
-class j {
+class T {
   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);
   }
@@ -3441,6 +3474,14 @@ class j {
   weights() {
     return [...this._weights];
   }
+  clone() {
+    return new T(
+      this._degree,
+      this._knots,
+      this._controlPoints,
+      this._weights
+    );
+  }
   point(t) {
     const s = this._controlPoints.map((e) => [e.x, e.y, e.z]);
     return ft(
@@ -3453,7 +3494,7 @@ class j {
   }
   length() {
     const t = this._controlPoints.map((s) => [s.x, s.y, s.z]);
-    return ws(
+    return bs(
       this._degree,
       this._knots,
       t,
@@ -3461,10 +3502,10 @@ class j {
     );
   }
   static byKnotsControlPointsWeights(t, s, e, n) {
-    return new j(t, s, e, n);
+    return new T(t, s, e, n);
   }
   static byPoints(t, s, e = "Uniform", n, i) {
-    const r = $t(
+    const r = Ht(
       t,
       s,
       e,
@@ -3475,7 +3516,7 @@ class j {
       y: a[1],
       z: a[2]
     }));
-    return new j(
+    return new T(
       s,
       r.knots,
       o,
@@ -3501,7 +3542,7 @@ class j {
   static createFitPointsForClosedCurve(t) {
     if (t.length < 4)
       throw new Error("At least 4 points are required for a closed NURBS curve");
-    const s = new Es(
+    const s = new Nt(
       t,
       !0,
       "centripetal"
@@ -3510,21 +3551,21 @@ class j {
   }
   static createClosedCurve(t, s, e = "Chord") {
     const i = this.createFitPointsForClosedCurve(t).map((r) => [r.x, r.y, r.z]);
-    return j.byPoints(i, s, e);
+    return T.byPoints(i, s, e);
   }
 }
-class J extends ot {
+class Q extends ot {
   constructor(t, s, e, n, i, r) {
     super();
     const o = arguments.length;
     if (this._degree = 3, this._closed = !1, Array.isArray(s)) {
       if (o < 2 || o > 5)
-        throw L.ILLEGAL_PARAMETERS;
+        throw U.ILLEGAL_PARAMETERS;
       this._controlPoints = t;
       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(
+        throw U.ILLEGAL_PARAMETERS;
+      this._nurbsCurve = T.byKnotsControlPointsWeights(
         this._degree,
         s,
         this._controlPoints,
@@ -3532,22 +3573,22 @@ class J extends ot {
       );
     } else {
       if (o < 2 || o > 6)
-        throw L.ILLEGAL_PARAMETERS;
+        throw U.ILLEGAL_PARAMETERS;
       this._fitPoints = t, this._knotParameterization = s, o >= 3 && (this._degree = e || 3);
       const a = typeof n == "boolean";
       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;
+        throw U.ILLEGAL_PARAMETERS;
       if (this._closed)
-        this._nurbsCurve = j.createClosedCurve(
+        this._nurbsCurve = T.createClosedCurve(
           this._fitPoints,
           this._degree,
           this._knotParameterization
         );
       else {
         const c = this.toNurbsPoints(this._fitPoints);
-        this._nurbsCurve = j.byPoints(
+        this._nurbsCurve = T.byPoints(
           c,
           this._degree,
           this._knotParameterization,
@@ -3563,17 +3604,17 @@ class J extends ot {
   buildCurve() {
     if (this._fitPoints && this._knotParameterization) {
       if (this._closed) {
-        const t = j.createFitPointsForClosedCurve(
+        const t = T.createFitPointsForClosedCurve(
           this._fitPoints
         ), s = this.toNurbsPoints(t);
-        this._nurbsCurve = j.byPoints(
+        this._nurbsCurve = T.byPoints(
           s,
           this._degree,
           this._knotParameterization
         );
       } else {
         const t = this.toNurbsPoints(this._fitPoints);
-        this._nurbsCurve = j.byPoints(
+        this._nurbsCurve = T.byPoints(
           t,
           this._degree,
           this._knotParameterization,
@@ -3586,10 +3627,10 @@ class J extends ot {
       );
     } else if (this._controlPoints)
       if (this._closed) {
-        const t = j.createFitPointsForClosedCurve(
+        const t = T.createFitPointsForClosedCurve(
           this._controlPoints
         ), s = this.toNurbsPoints(t);
-        this._nurbsCurve = j.byPoints(
+        this._nurbsCurve = T.byPoints(
           s,
           this._degree,
           this._knotParameterization
@@ -3598,7 +3639,7 @@ class J extends ot {
         );
       } else {
         const t = this._nurbsCurve.knots(), s = this._nurbsCurve.weights();
-        this._nurbsCurve = j.byKnotsControlPointsWeights(
+        this._nurbsCurve = T.byKnotsControlPointsWeights(
           this._degree,
           t,
           this._controlPoints,
@@ -3675,7 +3716,7 @@ class J extends ot {
   }
   calculateBoundingBox() {
     const t = this.getPoints(100);
-    return new Y().setFromPoints(t);
+    return new D().setFromPoints(t);
   }
   get closed() {
     return this._closed;
@@ -3696,7 +3737,7 @@ class J extends ot {
       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._nurbsCurve = T.byKnotsControlPointsWeights(
         this._degree,
         s,
         this._controlPoints,
@@ -3705,6 +3746,38 @@ class J extends ot {
     }
     return this._boundingBoxNeedsUpdate = !0, this;
   }
+  clone() {
+    return this._fitPoints && this._knotParameterization ? new Q(
+      this._fitPoints.map((t) => ({
+        x: t.x,
+        y: t.y,
+        z: t.z || 0
+      })),
+      this._knotParameterization,
+      this._degree,
+      this._closed,
+      this._startTangent ? {
+        x: this._startTangent.x,
+        y: this._startTangent.y,
+        z: this._startTangent.z || 0
+      } : void 0,
+      this._endTangent ? {
+        x: this._endTangent.x,
+        y: this._endTangent.y,
+        z: this._endTangent.z || 0
+      } : void 0
+    ) : new Q(
+      this._controlPoints.map((t) => ({
+        x: t.x,
+        y: t.y,
+        z: t.z || 0
+      })),
+      this._nurbsCurve.knots(),
+      this._nurbsCurve.weights(),
+      this._degree,
+      this._closed
+    );
+  }
   toNurbsPoints(t) {
     const s = new Array(t.length);
     return t.forEach((e, n) => {
@@ -3725,79 +3798,79 @@ class J extends ot {
       throw new Error(
         `At least ${e + 1} points are required for a degree ${e} closed spline`
       );
-    return new J(t, s, e, !0);
+    return new Q(t, s, e, !0);
   }
 }
 export {
-  js as AcGeArea2d,
-  F as AcGeBox2d,
-  Y as AcGeBox3d,
-  Es as AcGeCatmullRomCurve3d,
-  Q as AcGeCircArc2d,
+  ts as AcGeArea2d,
+  X as AcGeBox2d,
+  D as AcGeBox3d,
+  Nt as AcGeCatmullRomCurve3d,
+  K as AcGeCircArc2d,
   At as AcGeCircArc3d,
   rt as AcGeCurve2d,
-  W as AcGeEllipseArc2d,
+  J as AcGeEllipseArc2d,
   zt as AcGeEllipseArc3d,
-  Lt as AcGeEuler,
-  fs as AcGeGeometryUtil,
+  Ft as AcGeEuler,
+  ws as AcGeGeometryUtil,
   Pt as AcGeLine2d,
   Mt as AcGeLine3d,
-  X as AcGeLoop2d,
+  F as AcGeLoop2d,
   M as AcGeMathUtil,
   it as AcGeMatrix2d,
-  H as AcGeMatrix3d,
-  j as AcGeNurbsCurve,
-  St as AcGePlane,
-  C as AcGePoint2d,
+  G as AcGeMatrix3d,
+  T as AcGeNurbsCurve,
+  Ct as AcGePlane,
+  S as AcGePoint2d,
   w as AcGePoint3d,
-  Vs as AcGePolyline2d,
-  bt as AcGeQuaternion,
-  Ht as AcGeShape2d,
-  J as AcGeSpline3d,
-  Qt as AcGeTol,
+  ss as AcGePolyline2d,
+  St as AcGeQuaternion,
+  Gt as AcGeShape2d,
+  Q as AcGeSpline3d,
+  bt as AcGeTol,
   B as AcGeVector2d,
   p as AcGeVector3d,
-  Kt as DEFAULT_TOL,
-  Xt as DEG2RAD,
-  G as FLOAT_TOL,
-  Bs as ORIGIN_POINT_2D,
-  Ot as ORIGIN_POINT_3D,
-  Dt as RAD2DEG,
+  $t as DEFAULT_TOL,
+  Dt as DEG2RAD,
+  W as FLOAT_TOL,
+  Rs as ORIGIN_POINT_2D,
+  Kt as ORIGIN_POINT_3D,
+  Yt as RAD2DEG,
   E as TAU,
   wt as basisFunction,
-  ws as calculateCurveLength,
-  ms as ceilPowerOfTwo,
+  bs as calculateCurveLength,
+  ys as ceilPowerOfTwo,
   Z as clamp,
-  As as computeParameterValues,
-  es as damp,
-  ls as degToRad,
-  Yt as euclideanModulo,
+  Ms as computeParameterValues,
+  rs as damp,
+  ms as degToRad,
+  Zt as euclideanModulo,
   ft as evaluateNurbsPoint,
-  xs as floorPowerOfTwo,
-  zs as generateAveragedKnots,
-  Rs as generateChordKnots,
-  Ns as generateSqrtChordKnots,
-  Jt as generateUUID,
-  ks as generateUniformKnots,
-  Zt as intPartLength,
-  Ts as interpolateControlPoints,
-  $t as interpolateNurbsCurve,
-  ss as inverseLerp,
-  gs as isBetween,
-  ys as isBetweenAngle,
-  Gt as isPointInPolygon,
-  ps as isPolygonIntersect,
-  ds as isPowerOfTwo,
-  vt as lerp,
-  ts as mapLinear,
+  _s as floorPowerOfTwo,
+  Ps as generateAveragedKnots,
+  Ts as generateChordKnots,
+  js as generateSqrtChordKnots,
+  es as generateUUID,
+  Ns as generateUniformKnots,
+  Qt as intPartLength,
+  Vs as interpolateControlPoints,
+  Ht as interpolateNurbsCurve,
+  is as inverseLerp,
+  ps as isBetween,
+  fs as isBetweenAngle,
+  Wt as isPointInPolygon,
+  zs as isPolygonIntersect,
+  gs as isPowerOfTwo,
+  Ot as lerp,
+  ns as mapLinear,
   pt as normalizeAngle,
-  ns as pingpong,
-  us as radToDeg,
-  hs as randFloat,
-  as as randFloatSpread,
-  os as randInt,
-  _s as relativeEps,
-  cs as seededRandom,
-  rs as smootherstep,
-  is as smoothstep
+  os as pingpong,
+  xs as radToDeg,
+  ls as randFloat,
+  us as randFloatSpread,
+  cs as randInt,
+  As as relativeEps,
+  ds as seededRandom,
+  as as smootherstep,
+  hs as smoothstep
 };