@agrotools1/at-components 0.3.4-5 → 0.3.5-5

package/dist/orientedBoundingBox-57ea94d0.js

@@ -0,0 +1,447 @@
+import { bo as et, bp as lt, b9 as d, aS as kt, bg as Pt, gf as Lt, fg as D, fq as y, gg as mt, gh as At, gi as Ut, gj as pt, g2 as ta, fh as aa, gk as Ft, b7 as xt, gl as Xt, en as Wt, em as sa, gm as ia, gn as ea, el as na, g7 as Ct, fr as gt, go as oa, gp as ha, bE as Et } from "./index-4ead5b97.js";
+import { t as ra, e as ca } from "./mat3f64-03233387.js";
+import { e as ua } from "./mat4f64-cce69db4.js";
+import { X as da, O as U, x as fa } from "./quat-c6160033.js";
+import { o as Bt, e as St } from "./quatf64-bec1af25.js";
+import { z as la } from "./vec42-689e76ac.js";
+import { n as ma } from "./vec4f64-043e974c.js";
+import { a as _t, R as _a } from "./computeTranslationToOriginAndRotation-204021f3.js";
+import { c as Qt, o as ga, F as It } from "./plane-e6309fb6.js";
+class Nt {
+  constructor(t, a, s = a) {
+    this.data = t, this.size = a, this.stride = s;
+  }
+}
+class Ja extends Nt {
+  constructor(t, a, s, n = !1, o = s) {
+    super(t, s, o), this.indices = a, this.exclusive = n;
+  }
+}
+const nt = 1e-6, ot = d(), bt = d();
+function ba(i, t) {
+  const { data: a, size: s } = i, n = a.length / s;
+  if (n <= 0)
+    return;
+  const o = new qa(i);
+  wt(ot, o.minProj, o.maxProj), dt(ot, ot, 0.5), N(bt, o.maxProj, o.minProj);
+  const h = qt(bt), c = new wa();
+  c.quality = h, n < 14 && (i = new Nt(new Float64Array(o.buffer, 112, 42), 3));
+  const e = d(), r = d(), b = d(), m = d(), z = d(), A = d(), M = d();
+  switch (Ma(o, i, M, e, r, b, m, z, A, c)) {
+    case 1:
+      return void Ht(ot, bt, t);
+    case 2:
+      return void Ia(i, m, t);
+  }
+  $a(i, M, e, r, b, m, z, A, c), Ot(i, c.b0, c.b1, c.b2, at, st);
+  const v = d();
+  N(v, st, at), c.quality = qt(v), c.quality < h ? Zt(c.b0, c.b1, c.b2, at, st, v, t) : Ht(ot, bt, t);
+}
+function Ma(i, t, a, s, n, o, h, c, e, r) {
+  return Pa(i, s, n), yt(s, n) < nt ? 1 : (N(h, s, n), g(h, h), ja(t, s, h, o) < nt ? 2 : (N(c, n, o), g(c, c), N(e, o, s), g(e, e), V(a, c, h), g(a, a), Z(t, a, h, c, e, r), 0));
+}
+const ht = d(), rt = d(), I = d(), p = d(), q = d(), G = d(), X = d(), W = d();
+function $a(i, t, a, s, n, o, h, c, e) {
+  xa(i, t, a, ht, rt), ht[0] !== void 0 && (N(I, ht, a), g(I, I), N(p, ht, s), g(p, p), N(q, ht, n), g(q, q), V(G, p, o), g(G, G), V(X, q, h), g(X, X), V(W, I, c), g(W, W), Z(i, G, o, p, I, e), Z(i, X, h, q, p, e), Z(i, W, c, I, q, e)), rt[0] !== void 0 && (N(I, rt, a), g(I, I), N(p, rt, s), g(p, p), N(q, rt, n), g(q, q), V(G, p, o), g(G, G), V(X, q, h), g(X, X), V(W, I, c), g(W, W), Z(i, G, o, p, I, e), Z(i, X, h, q, p, e), Z(i, W, c, I, q, e));
+}
+function Pa(i, t, a) {
+  let s = yt(i.maxVert[0], i.minVert[0]), n = 0;
+  for (let o = 1; o < 7; ++o) {
+    const h = yt(i.maxVert[o], i.minVert[o]);
+    h > s && (s = h, n = o);
+  }
+  S(t, i.minVert[n]), S(a, i.maxVert[n]);
+}
+const w = [0, 0, 0];
+function ja(i, t, a, s) {
+  const { data: n, size: o } = i;
+  let h = Number.NEGATIVE_INFINITY, c = 0;
+  for (let e = 0; e < n.length; e += o) {
+    w[0] = n[e] - t[0], w[1] = n[e + 1] - t[1], w[2] = n[e + 2] - t[2];
+    const r = a[0] * w[0] + a[1] * w[1] + a[2] * w[2], b = a[0] * a[0] + a[1] * a[1] + a[2] * a[2], m = w[0] * w[0] + w[1] * w[1] + w[2] * w[2] - r * r / b;
+    m > h && (h = m, c = e);
+  }
+  return S(s, n, c), h;
+}
+const _ = kt();
+function xa(i, t, a, s, n) {
+  za(i, t, _, n, s);
+  const o = Jt(a, t);
+  _[1] - nt <= o && (s[0] = void 0), _[0] + nt >= o && (n[0] = void 0);
+}
+const Tt = d(), vt = d(), Yt = d(), J = d(), K = d(), Mt = d();
+function Z(i, t, a, s, n, o) {
+  if (Dt(t) < nt)
+    return;
+  V(Tt, a, t), V(vt, s, t), V(Yt, n, t), tt(i, t, _), K[1] = _[0], J[1] = _[1], Mt[1] = J[1] - K[1];
+  const h = [a, s, n], c = [Tt, vt, Yt];
+  for (let e = 0; e < 3; ++e) {
+    tt(i, h[e], _), K[0] = _[0], J[0] = _[1], tt(i, c[e], _), K[2] = _[0], J[2] = _[1], Mt[0] = J[0] - K[0], Mt[2] = J[2] - K[2];
+    const r = qt(Mt);
+    r < o.quality && (S(o.b0, h[e]), S(o.b1, t), S(o.b2, c[e]), o.quality = r);
+  }
+}
+const Sa = d();
+function tt(i, t, a) {
+  const { data: s, size: n } = i;
+  a[0] = Number.POSITIVE_INFINITY, a[1] = Number.NEGATIVE_INFINITY;
+  for (let o = 0; o < s.length; o += n) {
+    const h = s[o] * t[0] + s[o + 1] * t[1] + s[o + 2] * t[2];
+    a[0] = Math.min(a[0], h), a[1] = Math.max(a[1], h);
+  }
+}
+function za(i, t, a, s, n) {
+  const { data: o, size: h } = i;
+  S(s, o), S(n, s), a[0] = Jt(Sa, t), a[1] = a[0];
+  for (let c = h; c < o.length; c += h) {
+    const e = o[c] * t[0] + o[c + 1] * t[1] + o[c + 2] * t[2];
+    e < a[0] && (a[0] = e, S(s, o, c)), e > a[1] && (a[1] = e, S(n, o, c));
+  }
+}
+function Ht(i, t, a) {
+  a.center = i, a.halfSize = et(t, t, 0.5), a.quaternion = Bt;
+}
+const Y = d(), k = d(), ct = d(), at = d(), st = d(), Rt = d();
+function Ia(i, t, a) {
+  S(Y, t), Math.abs(t[0]) > Math.abs(t[1]) && Math.abs(t[0]) > Math.abs(t[2]) ? Y[0] = 0 : Math.abs(t[1]) > Math.abs(t[2]) ? Y[1] = 0 : Y[2] = 0, Dt(Y) < nt && (Y[0] = Y[1] = Y[2] = 1), V(k, t, Y), g(k, k), V(ct, t, k), g(ct, ct), Ot(i, t, k, ct, at, st), N(Rt, st, at), Zt(t, k, ct, at, st, Rt, a);
+}
+function Ot(i, t, a, s, n, o) {
+  tt(i, t, _), n[0] = _[0], o[0] = _[1], tt(i, a, _), n[1] = _[0], o[1] = _[1], tt(i, s, _), n[2] = _[0], o[2] = _[1];
+}
+const B = d(), ut = d(), $t = d(), Q = ra(1, 0, 0, 0, 1, 0, 0, 0, 1), pa = St();
+function Zt(i, t, a, s, n, o, h) {
+  Q[0] = i[0], Q[1] = i[1], Q[2] = i[2], Q[3] = t[0], Q[4] = t[1], Q[5] = t[2], Q[6] = a[0], Q[7] = a[1], Q[8] = a[2], h.quaternion = ya(pa, Q), wt(B, s, n), dt(B, B, 0.5), dt(ut, i, B[0]), dt($t, t, B[1]), wt(ut, ut, $t), dt($t, a, B[2]), h.center = lt(ut, ut, $t), h.halfSize = et(B, o, 0.5);
+}
+const P = 7;
+let qa = class {
+  constructor(t) {
+    this.minVert = new Array(P), this.maxVert = new Array(P);
+    const a = 64 * P;
+    this.buffer = new ArrayBuffer(a);
+    let s = 0;
+    this.minProj = new Float64Array(this.buffer, s, P), s += 8 * P, this.maxProj = new Float64Array(this.buffer, s, P), s += 8 * P;
+    for (let e = 0; e < P; ++e)
+      this.minVert[e] = new Float64Array(this.buffer, s, 3), s += 24;
+    for (let e = 0; e < P; ++e)
+      this.maxVert[e] = new Float64Array(this.buffer, s, 3), s += 24;
+    for (let e = 0; e < P; ++e)
+      this.minProj[e] = Number.POSITIVE_INFINITY, this.maxProj[e] = Number.NEGATIVE_INFINITY;
+    const n = new Array(P), o = new Array(P), { data: h, size: c } = t;
+    for (let e = 0; e < h.length; e += c) {
+      let r = h[e];
+      r < this.minProj[0] && (this.minProj[0] = r, n[0] = e), r > this.maxProj[0] && (this.maxProj[0] = r, o[0] = e), r = h[e + 1], r < this.minProj[1] && (this.minProj[1] = r, n[1] = e), r > this.maxProj[1] && (this.maxProj[1] = r, o[1] = e), r = h[e + 2], r < this.minProj[2] && (this.minProj[2] = r, n[2] = e), r > this.maxProj[2] && (this.maxProj[2] = r, o[2] = e), r = h[e] + h[e + 1] + h[e + 2], r < this.minProj[3] && (this.minProj[3] = r, n[3] = e), r > this.maxProj[3] && (this.maxProj[3] = r, o[3] = e), r = h[e] + h[e + 1] - h[e + 2], r < this.minProj[4] && (this.minProj[4] = r, n[4] = e), r > this.maxProj[4] && (this.maxProj[4] = r, o[4] = e), r = h[e] - h[e + 1] + h[e + 2], r < this.minProj[5] && (this.minProj[5] = r, n[5] = e), r > this.maxProj[5] && (this.maxProj[5] = r, o[5] = e), r = h[e] - h[e + 1] - h[e + 2], r < this.minProj[6] && (this.minProj[6] = r, n[6] = e), r > this.maxProj[6] && (this.maxProj[6] = r, o[6] = e);
+    }
+    for (let e = 0; e < P; ++e) {
+      let r = n[e];
+      S(this.minVert[e], h, r), r = o[e], S(this.maxVert[e], h, r);
+    }
+  }
+}, wa = class {
+  constructor() {
+    this.b0 = Pt(1, 0, 0), this.b1 = Pt(0, 1, 0), this.b2 = Pt(0, 0, 1), this.quality = 0;
+  }
+};
+function qt(i) {
+  return i[0] * i[1] + i[0] * i[2] + i[1] * i[2];
+}
+function wt(i, t, a) {
+  i[0] = t[0] + a[0], i[1] = t[1] + a[1], i[2] = t[2] + a[2];
+}
+function N(i, t, a) {
+  i[0] = t[0] - a[0], i[1] = t[1] - a[1], i[2] = t[2] - a[2];
+}
+function dt(i, t, a) {
+  i[0] = t[0] * a, i[1] = t[1] * a, i[2] = t[2] * a;
+}
+function S(i, t, a = 0) {
+  i[0] = t[a], i[1] = t[a + 1], i[2] = t[a + 2];
+}
+function V(i, t, a) {
+  const s = t[0], n = t[1], o = t[2], h = a[0], c = a[1], e = a[2];
+  i[0] = n * e - o * c, i[1] = o * h - s * e, i[2] = s * c - n * h;
+}
+function g(i, t) {
+  const a = t[0] * t[0] + t[1] * t[1] + t[2] * t[2];
+  if (a > 0) {
+    const s = 1 / Math.sqrt(a);
+    i[0] = t[0] * s, i[1] = t[1] * s, i[2] = t[2] * s;
+  }
+}
+function Dt(i) {
+  return i[0] * i[0] + i[1] * i[1] + i[2] * i[2];
+}
+function yt(i, t) {
+  const a = t[0] - i[0], s = t[1] - i[1], n = t[2] - i[2];
+  return a * a + s * s + n * n;
+}
+function Jt(i, t) {
+  return i[0] * t[0] + i[1] * t[1] + i[2] * t[2];
+}
+function ya(i, t) {
+  const a = t[0] + t[4] + t[8];
+  if (a > 0) {
+    let s = Math.sqrt(a + 1);
+    i[3] = 0.5 * s, s = 0.5 / s, i[0] = (t[5] - t[7]) * s, i[1] = (t[6] - t[2]) * s, i[2] = (t[1] - t[3]) * s;
+  } else {
+    let s = 0;
+    t[4] > t[0] && (s = 1), t[8] > t[3 * s + s] && (s = 2);
+    const n = (s + 1) % 3, o = (s + 2) % 3;
+    let h = Math.sqrt(t[3 * s + s] - t[3 * n + n] - t[3 * o + o] + 1);
+    i[s] = 0.5 * h, h = 0.5 / h, i[3] = (t[3 * n + o] - t[3 * o + n]) * h, i[n] = (t[3 * n + s] + t[3 * s + n]) * h, i[o] = (t[3 * o + s] + t[3 * s + o]) * h;
+  }
+  return i;
+}
+class ft {
+  constructor(t = Lt, a = Ya, s = Bt) {
+    this._data = [t[0], t[1], t[2], a[0], a[1], a[2], s[0], s[1], s[2], s[3]];
+  }
+  clone() {
+    const t = new ft();
+    return t._data = this._data.slice(), t;
+  }
+  invalidate() {
+    this._data[3] = -1;
+  }
+  get isValid() {
+    return this._data[3] >= 0;
+  }
+  static fromData(t) {
+    const a = new ft();
+    return a._data = t.slice(), a;
+  }
+  static fromJSON(t) {
+    return new ft(t.center, t.halfSize, t.quaternion);
+  }
+  copy(t) {
+    this._data = t.data.slice();
+  }
+  get center() {
+    return D(Qt.get(), this._data[0], this._data[1], this._data[2]);
+  }
+  get centerX() {
+    return this._data[0];
+  }
+  get centerY() {
+    return this._data[1];
+  }
+  get centerZ() {
+    return this._data[2];
+  }
+  getCenter(t) {
+    return t[0] = this._data[0], t[1] = this._data[1], t[2] = this._data[2], t;
+  }
+  set center(t) {
+    this._data[0] = t[0], this._data[1] = t[1], this._data[2] = t[2];
+  }
+  setCenter(t, a, s) {
+    this._data[0] = t, this._data[1] = a, this._data[2] = s;
+  }
+  get halfSize() {
+    return D(Qt.get(), this._data[3], this._data[4], this._data[5]);
+  }
+  get halfSizeX() {
+    return this._data[3];
+  }
+  get halfSizeY() {
+    return this._data[4];
+  }
+  get halfSizeZ() {
+    return this._data[5];
+  }
+  getHalfSize(t) {
+    return t[0] = this._data[3], t[1] = this._data[4], t[2] = this._data[5], t;
+  }
+  set halfSize(t) {
+    this._data[3] = t[0], this._data[4] = t[1], this._data[5] = t[2];
+  }
+  get quaternion() {
+    return da(ga.get(), this._data[6], this._data[7], this._data[8], this._data[9]);
+  }
+  getQuaternion(t) {
+    return t[0] = this._data[6], t[1] = this._data[7], t[2] = this._data[8], t[3] = this._data[9], t;
+  }
+  set quaternion(t) {
+    this._data[6] = t[0], this._data[7] = t[1], this._data[8] = t[2], this._data[9] = t[3];
+  }
+  get data() {
+    return this._data;
+  }
+  getCorners(t) {
+    const a = l, s = this._data;
+    a[0] = s[6], a[1] = s[7], a[2] = s[8], a[3] = s[9];
+    for (let n = 0; n < 8; ++n) {
+      const o = t[n];
+      o[0] = (1 & n ? -1 : 1) * s[3], o[1] = (2 & n ? -1 : 1) * s[4], o[2] = (4 & n ? -1 : 1) * s[5], y(o, o, a), o[0] += s[0], o[1] += s[1], o[2] += s[2];
+    }
+  }
+  isVisible(t) {
+    return this.intersectPlane(t[0]) <= 0 && this.intersectPlane(t[1]) <= 0 && this.intersectPlane(t[2]) <= 0 && this.intersectPlane(t[3]) <= 0 && this.intersectPlane(t[4]) <= 0 && this.intersectPlane(t[5]) <= 0;
+  }
+  get radius() {
+    const t = this._data[3], a = this._data[4], s = this._data[5];
+    return Math.sqrt(t * t + a * a + s * s);
+  }
+  intersectSphere(t) {
+    u[0] = this._data[0] - t[0], u[1] = this._data[1] - t[1], u[2] = this._data[2] - t[2];
+    const a = this.getQuaternion(R);
+    return U(l, a), y(u, u, l), mt(u, u), H[0] = Math.min(u[0], this._data[3]), H[1] = Math.min(u[1], this._data[4]), H[2] = Math.min(u[2], this._data[5]), At(H, u) < t[3] * t[3];
+  }
+  intersectSphereWithMBS(t, a = this.radius) {
+    const s = this._data;
+    u[0] = s[0] - t[0], u[1] = s[1] - t[1], u[2] = s[2] - t[2];
+    const n = t[3], o = n + a;
+    return !(Ut(u) > o * o) && (l[0] = -s[6], l[1] = -s[7], l[2] = -s[8], l[3] = s[9], y(u, u, l), mt(u, u), H[0] = Math.min(u[0], s[3]), H[1] = Math.min(u[1], s[4]), H[2] = Math.min(u[2], s[5]), At(H, u) < n * n);
+  }
+  intersectPlane(t) {
+    const a = t[0] * this._data[0] + t[1] * this._data[1] + t[2] * this._data[2] + t[3], s = this.projectedRadius(It(t));
+    return a > s ? 1 : a < -s ? -1 : 0;
+  }
+  intersectRay(t, a, s = 0) {
+    const n = this._data, o = l;
+    o[0] = -n[6], o[1] = -n[7], o[2] = -n[8], o[3] = n[9], u[0] = t[0] - n[0], u[1] = t[1] - n[1], u[2] = t[2] - n[2];
+    const h = y(u, u, l), c = y(H, a, l);
+    let e = -1 / 0, r = 1 / 0;
+    const b = this.getHalfSize(it);
+    for (let m = 0; m < 3; m++) {
+      const z = h[m], A = c[m], M = b[m] + s;
+      if (Math.abs(A) > 1e-6) {
+        const v = (M - z) / A, $ = (-M - z) / A;
+        e = Math.max(e, Math.min(v, $)), r = Math.min(r, Math.max(v, $));
+      } else if (z > M || z < -M)
+        return !1;
+    }
+    return e <= r;
+  }
+  projectedArea(t, a, s, n) {
+    const o = this.getQuaternion(R);
+    U(l, o), u[0] = t[0] - this._data[0], u[1] = t[1] - this._data[1], u[2] = t[2] - this._data[2], y(u, u, l);
+    const h = this.getHalfSize(it), c = u[0] < -h[0] ? -1 : u[0] > h[0] ? 1 : 0, e = u[1] < -h[1] ? -1 : u[1] > h[1] ? 1 : 0, r = u[2] < -h[2] ? -1 : u[2] > h[2] ? 1 : 0, b = Math.abs(c) + Math.abs(e) + Math.abs(r);
+    if (b === 0)
+      return 1 / 0;
+    const m = b === 1 ? 4 : 6, z = 6 * (c + 3 * e + 9 * r + 13);
+    pt(L, o), ta(L, L, h);
+    const A = this.getCenter(E);
+    for (let $ = 0; $ < m; $++) {
+      const zt = Aa[z + $];
+      D(u, ((1 & zt) << 1) - 1, (2 & zt) - 1, ((4 & zt) >> 1) - 1), aa(u, u, L), lt(O, A, u), O[3] = 1, la(O, O, a);
+      const Vt = 1 / Math.max(1e-6, O[3]);
+      F[2 * $] = O[0] * Vt, F[2 * $ + 1] = O[1] * Vt;
+    }
+    const M = 2 * m - 2;
+    let v = F[0] * (F[3] - F[M + 1]) + F[M] * (F[1] - F[M - 1]);
+    for (let $ = 2; $ < M; $ += 2)
+      v += F[$] * (F[$ + 3] - F[$ - 1]);
+    return Math.abs(v) * s * n * 0.125;
+  }
+  projectedRadius(t) {
+    const a = this.getQuaternion(R);
+    return U(l, a), y(u, t, l), Math.abs(u[0] * this._data[3]) + Math.abs(u[1] * this._data[4]) + Math.abs(u[2] * this._data[5]);
+  }
+  minimumDistancePlane(t) {
+    return t[0] * this._data[0] + t[1] * this._data[1] + t[2] * this._data[2] + t[3] - this.projectedRadius(It(t));
+  }
+  maximumDistancePlane(t) {
+    return t[0] * this._data[0] + t[1] * this._data[1] + t[2] * this._data[2] + t[3] + this.projectedRadius(It(t));
+  }
+  toAaBoundingBox(t) {
+    const a = this.getQuaternion(R), s = pt(L, a), n = this._data[3] * Math.abs(s[0]) + this._data[4] * Math.abs(s[3]) + this._data[5] * Math.abs(s[6]), o = this._data[3] * Math.abs(s[1]) + this._data[4] * Math.abs(s[4]) + this._data[5] * Math.abs(s[7]), h = this._data[3] * Math.abs(s[2]) + this._data[4] * Math.abs(s[5]) + this._data[5] * Math.abs(s[8]);
+    t[0] = this._data[0] - n, t[1] = this._data[1] - o, t[2] = this._data[2] - h, t[3] = this._data[0] + n, t[4] = this._data[1] + o, t[5] = this._data[2] + h;
+  }
+  transform(t, a, s, n = 0, o = _t(s), h = _t(a), c = Xt(a, h)) {
+    if (s === o)
+      a.isGeographic ? Qa(this, t, a, n, h) : Ea(this, t, a, n, h, c);
+    else if (a.isWGS84 && (s.isWebMercator || Ft(s)))
+      Fa(a, this, s, t, n);
+    else if (a.isWebMercator && Ft(s))
+      Ca(a, this, s, t, n);
+    else {
+      const e = this.getCenter(E);
+      e[2] += n, xt(e, a, 0, e, s, 0, 1), t.center = e, this !== t && (t.quaternion = this.getQuaternion(R), t.halfSize = this.getHalfSize(it));
+    }
+  }
+}
+const l = St(), R = St(), Na = St(), u = d(), H = d(), O = ma();
+function Va(i, t = new ft()) {
+  return ba(i, t), t;
+}
+const F = [0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1, 1.1, 1.2], Aa = (() => {
+  const i = new Int8Array(162);
+  let t = 0;
+  const a = (s) => {
+    for (let n = 0; n < s.length; n++)
+      i[t + n] = s[n];
+    t += 6;
+  };
+  return a([6, 2, 3, 1, 5, 4]), a([0, 2, 3, 1, 5, 4]), a([0, 2, 3, 7, 5, 4]), a([0, 1, 3, 2, 6, 4]), a([0, 1, 3, 2, 0, 0]), a([0, 1, 5, 7, 3, 2]), a([0, 1, 3, 7, 6, 4]), a([0, 1, 3, 7, 6, 2]), a([0, 1, 5, 7, 6, 2]), a([0, 1, 5, 4, 6, 2]), a([0, 1, 5, 4, 0, 0]), a([0, 1, 3, 7, 5, 4]), a([0, 2, 6, 4, 0, 0]), a([0, 0, 0, 0, 0, 0]), a([1, 3, 7, 5, 0, 0]), a([2, 3, 7, 6, 4, 0]), a([2, 3, 7, 6, 0, 0]), a([2, 3, 1, 5, 7, 6]), a([0, 1, 5, 7, 6, 2]), a([0, 1, 5, 7, 6, 4]), a([0, 1, 3, 7, 6, 4]), a([4, 5, 7, 6, 2, 0]), a([4, 5, 7, 6, 0, 0]), a([4, 5, 1, 3, 7, 6]), a([0, 2, 3, 7, 5, 4]), a([6, 2, 3, 7, 5, 4]), a([6, 2, 3, 1, 5, 4]), i;
+})();
+function La(i, t, a, s, n) {
+  const o = i.getQuaternion(R);
+  n.quaternion = o, U(l, o);
+  const h = i.getCenter(E), c = i.getHalfSize(it);
+  if (s === ea.Global) {
+    y(f, h, l), mt(C, f), na(x, C, c), Wt(x, C, x);
+    const e = Ct(x);
+    lt(x, C, c);
+    const r = Ct(x);
+    if (e < a)
+      n.center = h, D(f, a, a, a), n.halfSize = lt(f, c, f);
+    else {
+      const b = r > 0 ? 1 + t / r : 1, m = e > 0 ? 1 + a / e : 1, z = (m + b) / 2, A = (m - b) / 2;
+      et(x, C, A), n.halfSize = gt(x, x, c, z), et(x, C, z), gt(x, x, c, A), oa(f, f), ha(f, x, f);
+      const M = i.getQuaternion(Na);
+      n.center = y(f, f, M);
+    }
+  } else {
+    n.center = gt(f, h, Et, (a + t) / 2);
+    const e = y(f, Et, l);
+    mt(e, e), n.halfSize = gt(C, c, e, (a - t) / 2);
+  }
+  return n;
+}
+function Fa(i, t, a, s, n) {
+  t.getCenter(E), E[2] += n;
+  const o = _t(a);
+  xt(E, i, 0, E, o, 0, 1), Kt(o, t, E, a, s);
+}
+function Ca(i, t, a, s, n) {
+  t.getCenter(E), E[2] += n, Kt(i, t, E, a, s);
+}
+function Kt(i, t, a, s, n) {
+  const o = t.getQuaternion(R), h = pt(L, o), c = t.getHalfSize(it);
+  for (let e = 0; e < 8; ++e) {
+    for (let r = 0; r < 3; ++r)
+      T[r] = c[r] * (e & 1 << r ? -1 : 1);
+    for (let r = 0; r < 3; ++r) {
+      let b = a[r];
+      for (let m = 0; m < 3; ++m)
+        b += T[m] * h[3 * m + r];
+      jt[3 * e + r] = b;
+    }
+  }
+  xt(jt, i, 0, jt, s, 0, 8), Va(Ta, n);
+}
+function Ea(i, t, a, s, n = _t(a), o = Xt(a, n)) {
+  i.getCorners(Gt), i.getCenter(T), T[2] += s, _a(a, T, j, n), t.setCenter(j[12], j[13], j[14]);
+  const h = 2 * Math.sqrt(1 + j[0] + j[5] + j[10]);
+  l[0] = (j[6] - j[9]) / h, l[1] = (j[8] - j[2]) / h, l[2] = (j[1] - j[4]) / h, l[3] = 0.25 * h;
+  const c = i.getQuaternion(R);
+  t.quaternion = fa(l, l, c), U(l, l), D(C, 0, 0, 0);
+  const e = t.getCenter(va);
+  for (const r of Gt)
+    r[2] += s, o(r, 0, r, 0), Wt(f, r, e), y(f, f, l), mt(f, f), sa(C, C, f);
+  t.halfSize = C;
+}
+function Qa(i, t, a, s, n = _t(a)) {
+  const o = ia(a), h = 1 + Math.max(0, s) / (o.radius + i.centerZ);
+  i.getCenter(T), T[2] += s, xt(T, a, 0, T, n, 0, 1), t.center = T;
+  const c = i.getQuaternion(R);
+  t.quaternion = c, U(l, c), D(f, 0, 0, 1), y(f, f, l);
+  const e = i.getHalfSize(it);
+  D(f, e[0] * Math.abs(f[0]), e[1] * Math.abs(f[1]), e[2] * Math.abs(f[2])), et(f, f, o.inverseFlattening), lt(f, e, f), t.halfSize = et(f, f, h);
+}
+const jt = new Array(24), Ta = new Nt(jt, 3), T = d(), E = d(), va = d(), it = d(), L = ca(), j = ua(), Gt = [[0, 0, 0], [0, 0, 0], [0, 0, 0], [0, 0, 0], [0, 0, 0], [0, 0, 0], [0, 0, 0], [0, 0, 0]], f = d(), C = d(), x = d(), Ya = Pt(-1, -1, -1);
+export {
+  La as L,
+  ft as O,
+  Ja as t
+};