@roomle/web-sdk 5.1.0-alpha.2 → 5.1.0-alpha.3

package/lib/src-HhklrVDg.mjs

@@ -0,0 +1,1950 @@
+import { Bt as e, Ci as t, Er as n, Qr as r, Si as i, cn as a, f as o, h as s, kn as c, m as l, sn as u, ui as d } from "./three.core-0KaTx8dm.mjs";
+var f = 1.25, p = 65535;
+p << 16;
+var m = 2 ** -24, h = Symbol("SKIP_GENERATION"), g = {
+	strategy: 0,
+	maxDepth: 40,
+	targetLeafSize: 10,
+	useSharedArrayBuffer: !1,
+	setBoundingBox: !0,
+	onProgress: null,
+	indirect: !1,
+	verbose: !0,
+	range: null,
+	[h]: !1
+};
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/utils/ArrayBoxUtilities.js
+function _(e, t, n) {
+	return n.min.x = t[e], n.min.y = t[e + 1], n.min.z = t[e + 2], n.max.x = t[e + 3], n.max.y = t[e + 4], n.max.z = t[e + 5], n;
+}
+function v(e) {
+	let t = -1, n = -Infinity;
+	for (let r = 0; r < 3; r++) {
+		let i = e[r + 3] - e[r];
+		i > n && (n = i, t = r);
+	}
+	return t;
+}
+function y(e, t) {
+	t.set(e);
+}
+function b(e, t, n) {
+	let r, i;
+	for (let a = 0; a < 3; a++) {
+		let o = a + 3;
+		r = e[a], i = t[a], n[a] = r < i ? r : i, r = e[o], i = t[o], n[o] = r > i ? r : i;
+	}
+}
+function x(e, t, n) {
+	for (let r = 0; r < 3; r++) {
+		let i = t[e + 2 * r], a = t[e + 2 * r + 1], o = i - a, s = i + a;
+		o < n[r] && (n[r] = o), s > n[r + 3] && (n[r + 3] = s);
+	}
+}
+function S(e) {
+	let t = e[3] - e[0], n = e[4] - e[1], r = e[5] - e[2];
+	return 2 * (t * n + n * r + r * t);
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/utils/nodeBufferUtils.js
+function C(e, t) {
+	return t[e + 15] === p;
+}
+function w(e, t) {
+	return t[e + 6];
+}
+function T(e, t) {
+	return t[e + 14];
+}
+function E(e) {
+	return e + 8;
+}
+function D(e, t) {
+	return e + t[e + 6] * 8;
+}
+function O(e, t) {
+	return t[e + 7];
+}
+function k(e) {
+	return e;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/build/computeBoundsUtils.js
+function A(e, t, n, r, i) {
+	let a = Infinity, o = Infinity, s = Infinity, c = -Infinity, l = -Infinity, u = -Infinity, d = Infinity, f = Infinity, p = Infinity, m = -Infinity, h = -Infinity, g = -Infinity, _ = e.offset || 0;
+	for (let r = (t - _) * 6, i = (t + n - _) * 6; r < i; r += 6) {
+		let t = e[r + 0], n = e[r + 1], i = t - n, _ = t + n;
+		i < a && (a = i), _ > c && (c = _), t < d && (d = t), t > m && (m = t);
+		let v = e[r + 2], y = e[r + 3], b = v - y, x = v + y;
+		b < o && (o = b), x > l && (l = x), v < f && (f = v), v > h && (h = v);
+		let S = e[r + 4], C = e[r + 5], w = S - C, T = S + C;
+		w < s && (s = w), T > u && (u = T), S < p && (p = S), S > g && (g = S);
+	}
+	r[0] = a, r[1] = o, r[2] = s, r[3] = c, r[4] = l, r[5] = u, i[0] = d, i[1] = f, i[2] = p, i[3] = m, i[4] = h, i[5] = g;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/build/splitUtils.js
+var j = 32, ee = (e, t) => e.candidate - t.candidate, M = /* @__PURE__ */ Array(j).fill().map(() => ({
+	count: 0,
+	bounds: new Float32Array(6),
+	rightCacheBounds: new Float32Array(6),
+	leftCacheBounds: new Float32Array(6),
+	candidate: 0
+})), te = /* @__PURE__ */ new Float32Array(6);
+function ne(e, t, n, r, i, a) {
+	let o = -1, s = 0;
+	if (a === 0) o = v(t), o !== -1 && (s = (t[o] + t[o + 3]) / 2);
+	else if (a === 1) o = v(e), o !== -1 && (s = re(n, r, i, o));
+	else if (a === 2) {
+		let a = S(e), c = f * i, l = n.offset || 0, u = (r - l) * 6, d = (r + i - l) * 6;
+		for (let e = 0; e < 3; e++) {
+			let r = t[e], l = (t[e + 3] - r) / j;
+			if (i < j / 4) {
+				let t = [...M];
+				t.length = i;
+				let r = 0;
+				for (let i = u; i < d; i += 6, r++) {
+					let a = t[r];
+					a.candidate = n[i + 2 * e], a.count = 0;
+					let { bounds: o, leftCacheBounds: s, rightCacheBounds: c } = a;
+					for (let e = 0; e < 3; e++) c[e] = Infinity, c[e + 3] = -Infinity, s[e] = Infinity, s[e + 3] = -Infinity, o[e] = Infinity, o[e + 3] = -Infinity;
+					x(i, n, o);
+				}
+				t.sort(ee);
+				let l = i;
+				for (let e = 0; e < l; e++) {
+					let n = t[e];
+					for (; e + 1 < l && t[e + 1].candidate === n.candidate;) t.splice(e + 1, 1), l--;
+				}
+				for (let r = u; r < d; r += 6) {
+					let i = n[r + 2 * e];
+					for (let e = 0; e < l; e++) {
+						let a = t[e];
+						i >= a.candidate ? x(r, n, a.rightCacheBounds) : (x(r, n, a.leftCacheBounds), a.count++);
+					}
+				}
+				for (let n = 0; n < l; n++) {
+					let r = t[n], l = r.count, u = i - r.count, d = r.leftCacheBounds, p = r.rightCacheBounds, m = 0;
+					l !== 0 && (m = S(d) / a);
+					let h = 0;
+					u !== 0 && (h = S(p) / a);
+					let g = 1 + f * (m * l + h * u);
+					g < c && (o = e, c = g, s = r.candidate);
+				}
+			} else {
+				for (let e = 0; e < j; e++) {
+					let t = M[e];
+					t.count = 0, t.candidate = r + l + e * l;
+					let n = t.bounds;
+					for (let e = 0; e < 3; e++) n[e] = Infinity, n[e + 3] = -Infinity;
+				}
+				for (let t = u; t < d; t += 6) {
+					let i = ~~((n[t + 2 * e] - r) / l);
+					i >= j && (i = j - 1);
+					let a = M[i];
+					a.count++, x(t, n, a.bounds);
+				}
+				let t = M[j - 1];
+				y(t.bounds, t.rightCacheBounds);
+				for (let e = j - 2; e >= 0; e--) {
+					let t = M[e], n = M[e + 1];
+					b(t.bounds, n.rightCacheBounds, t.rightCacheBounds);
+				}
+				let p = 0;
+				for (let t = 0; t < j - 1; t++) {
+					let n = M[t], r = n.count, l = n.bounds, u = M[t + 1].rightCacheBounds;
+					r !== 0 && (p === 0 ? y(l, te) : b(l, te, te)), p += r;
+					let d = 0, m = 0;
+					p !== 0 && (d = S(te) / a);
+					let h = i - p;
+					h !== 0 && (m = S(u) / a);
+					let g = 1 + f * (d * p + m * h);
+					g < c && (o = e, c = g, s = n.candidate);
+				}
+			}
+		}
+	} else console.warn(`BVH: Invalid build strategy value ${a} used.`);
+	return {
+		axis: o,
+		pos: s
+	};
+}
+function re(e, t, n, r) {
+	let i = 0, a = e.offset;
+	for (let o = t, s = t + n; o < s; o++) i += e[(o - a) * 6 + r * 2];
+	return i / n;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/BVHNode.js
+var ie = class {
+	constructor() {
+		this.boundingData = new Float32Array(6);
+	}
+};
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/build/sortUtils.js
+function ae(e, t, n, r, i, a) {
+	let o = r, s = r + i - 1, c = a.pos, l = a.axis * 2, u = n.offset || 0;
+	for (;;) {
+		for (; o <= s && n[(o - u) * 6 + l] < c;) o++;
+		for (; o <= s && n[(s - u) * 6 + l] >= c;) s--;
+		if (o < s) {
+			for (let n = 0; n < t; n++) {
+				let r = e[o * t + n];
+				e[o * t + n] = e[s * t + n], e[s * t + n] = r;
+			}
+			for (let e = 0; e < 6; e++) {
+				let t = o - u, r = s - u, i = n[t * 6 + e];
+				n[t * 6 + e] = n[r * 6 + e], n[r * 6 + e] = i;
+			}
+			o++, s--;
+		} else return o;
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/build/buildUtils.js
+var oe, se, ce, le, ue = 2 ** 32;
+function de(e) {
+	return "count" in e ? 1 : 1 + de(e.left) + de(e.right);
+}
+function fe(e, t, n) {
+	return oe = new Float32Array(n), se = new Uint32Array(n), ce = new Uint16Array(n), le = new Uint8Array(n), pe(e, t);
+}
+function pe(e, t) {
+	let n = e / 4, r = e / 2, i = "count" in t, a = t.boundingData;
+	for (let e = 0; e < 6; e++) oe[n + e] = a[e];
+	if (i) return t.buffer ? (le.set(new Uint8Array(t.buffer), e), e + t.buffer.byteLength) : (se[n + 6] = t.offset, ce[r + 14] = t.count, ce[r + 15] = p, e + 32);
+	{
+		let { left: r, right: i, splitAxis: a } = t, o = pe(e + 32, r), s = e / 32, c = o / 32 - s;
+		if (c > ue) throw Error("MeshBVH: Cannot store relative child node offset greater than 32 bits.");
+		return se[n + 6] = c, se[n + 7] = a, pe(o, i);
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/build/buildTree.js
+function me(e, t, n, r, i, a) {
+	let { maxDepth: o, verbose: s, targetLeafSize: c, _strictLeafSize: l = Infinity, strategy: u, onProgress: d } = i, f = e.primitiveBuffer, p = e.primitiveBufferStride, m = new Float32Array(6), h = !1, g = new ie();
+	return A(t, n, r, g.boundingData, m), y(g, n, r, m), g;
+	function _(e) {
+		d && d((e - a.offset) / a.count);
+	}
+	function y(e, n, r, i = null, a = 0) {
+		!h && a >= o && (h = !0, s && console.warn(`BVH: Max depth of ${o} reached when generating BVH. Consider increasing maxDepth.`));
+		let d = r > l;
+		if (r <= c && !d || a >= o) return _(n + r), e.offset = n, e.count = r, e;
+		let g = ne(e.boundingData, i, t, n, r, u), b = g.axis === -1 ? -1 : ae(f, p, t, n, r, g);
+		if (g.axis === -1 || b === n || b === n + r) {
+			if (!d) return _(n + r), e.offset = n, e.count = r, e;
+			g.axis = Math.max(0, v(e.boundingData)), b = n + Math.max(1, Math.floor(r / 2));
+		}
+		e.splitAxis = g.axis;
+		let x = new ie(), S = n, C = b - n;
+		e.left = x, A(t, S, C, x.boundingData, m), y(x, S, C, m, a + 1);
+		let w = new ie(), T = b, E = r - C;
+		return e.right = w, A(t, T, E, w.boundingData, m), y(w, T, E, m, a + 1), e;
+	}
+}
+function he(e, t) {
+	let n = t.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer, r = e.getRootRanges(t.range), i = r[0], a = r[r.length - 1], o = {
+		offset: i.offset,
+		count: a.offset + a.count - i.offset
+	}, s = new Float32Array(6 * o.count);
+	s.offset = o.offset, e.computePrimitiveBounds(o.offset, o.count, s), e._roots = r.map((r) => {
+		let i = me(e, s, r.offset, r.count, t, o), a = new n(32 * de(i));
+		return fe(0, i, a), a;
+	});
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/utils/PrimitivePool.js
+var ge = class {
+	constructor(e) {
+		this._getNewPrimitive = e, this._primitives = [];
+	}
+	getPrimitive() {
+		let e = this._primitives;
+		return e.length === 0 ? this._getNewPrimitive() : e.pop();
+	}
+	releasePrimitive(e) {
+		this._primitives.push(e);
+	}
+}, N = /* @__PURE__ */ new class {
+	constructor() {
+		this.float32Array = null, this.uint16Array = null, this.uint32Array = null;
+		let e = [], t = null;
+		this.setBuffer = (n) => {
+			t && e.push(t), t = n, this.float32Array = new Float32Array(n), this.uint16Array = new Uint16Array(n), this.uint32Array = new Uint32Array(n);
+		}, this.clearBuffer = () => {
+			t = null, this.float32Array = null, this.uint16Array = null, this.uint32Array = null, e.length !== 0 && this.setBuffer(e.pop());
+		};
+	}
+}(), P, _e, ve = [], ye = /* @__PURE__ */ new ge(() => new o());
+function be(e, t, n, r, i, a) {
+	P = ye.getPrimitive(), _e = ye.getPrimitive(), ve.push(P, _e), N.setBuffer(e._roots[t]);
+	let o = xe(0, e.geometry, n, r, i, a);
+	N.clearBuffer(), ye.releasePrimitive(P), ye.releasePrimitive(_e), ve.pop(), ve.pop();
+	let s = ve.length;
+	return s > 0 && (_e = ve[s - 1], P = ve[s - 2]), o;
+}
+function xe(e, t, n, r, i = null, a = 0, o = 0) {
+	let { float32Array: s, uint16Array: c, uint32Array: l } = N, u = e * 2;
+	if (C(u, c)) {
+		let t = w(e, l), n = T(u, c);
+		return _(k(e), s, P), r(t, n, !1, o, a + e / 8, P);
+	} else {
+		let u = E(e), d = D(e, l), f = u, p = d, m, h, g, v;
+		if (i && (g = P, v = _e, _(k(f), s, g), _(k(p), s, v), m = i(g), h = i(v), h < m)) {
+			f = d, p = u;
+			let e = m;
+			m = h, h = e, g = v;
+		}
+		g || (g = P, _(k(f), s, g));
+		let y = C(f * 2, c), b = n(g, y, m, o + 1, a + f / 8), x;
+		if (b === 2) {
+			let e = j(f);
+			x = r(e, ee(f) - e, !0, o + 1, a + f / 8, g);
+		} else x = b && xe(f, t, n, r, i, a, o + 1);
+		if (x) return !0;
+		v = _e, _(k(p), s, v);
+		let S = C(p * 2, c), O = n(v, S, h, o + 1, a + p / 8), A;
+		if (O === 2) {
+			let e = j(p);
+			A = r(e, ee(p) - e, !0, o + 1, a + p / 8, v);
+		} else A = O && xe(p, t, n, r, i, a, o + 1);
+		if (A) return !0;
+		return !1;
+		function j(e) {
+			let { uint16Array: t, uint32Array: n } = N, r = e * 2;
+			for (; !C(r, t);) e = E(e), r = e * 2;
+			return w(e, n);
+		}
+		function ee(e) {
+			let { uint16Array: t, uint32Array: n } = N, r = e * 2;
+			for (; !C(r, t);) e = D(e, n), r = e * 2;
+			return w(e, n) + T(r, t);
+		}
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/bvhcast.js
+var Se = /* @__PURE__ */ new N.constructor(), Ce = /* @__PURE__ */ new N.constructor(), F = /* @__PURE__ */ new ge(() => new o()), we = /* @__PURE__ */ new o(), Te = /* @__PURE__ */ new o(), Ee = /* @__PURE__ */ new o(), De = /* @__PURE__ */ new o(), Oe = !1;
+function ke(e, t, n, r) {
+	if (Oe) throw Error("MeshBVH: Recursive calls to bvhcast not supported.");
+	Oe = !0;
+	let i = e._roots, a = t._roots, o, s = 0, c = 0, l = new u().copy(n).invert();
+	for (let e = 0, t = i.length; e < t; e++) {
+		Se.setBuffer(i[e]), c = 0;
+		let t = F.getPrimitive();
+		_(k(0), Se.float32Array, t), t.applyMatrix4(l);
+		for (let e = 0, i = a.length; e < i && (Ce.setBuffer(a[e]), o = I(0, 0, n, l, r, s, c, 0, 0, t), Ce.clearBuffer(), c += a[e].byteLength / 32, !o); e++);
+		if (F.releasePrimitive(t), Se.clearBuffer(), s += i[e].byteLength / 32, o) break;
+	}
+	return Oe = !1, o;
+}
+function I(e, t, n, r, i, a = 0, o = 0, s = 0, c = 0, l = null, u = !1) {
+	let d, f;
+	u ? (d = Ce, f = Se) : (d = Se, f = Ce);
+	let p = d.float32Array, m = d.uint32Array, h = d.uint16Array, g = f.float32Array, v = f.uint32Array, y = f.uint16Array, b = e * 2, x = t * 2, S = C(b, h), O = C(x, y), A = !1;
+	if (O && S) A = u ? i(w(t, v), T(t * 2, y), w(e, m), T(e * 2, h), c, o + t / 8, s, a + e / 8) : i(w(e, m), T(e * 2, h), w(t, v), T(t * 2, y), s, a + e / 8, c, o + t / 8);
+	else if (O) {
+		let l = F.getPrimitive();
+		_(k(t), g, l), l.applyMatrix4(n);
+		let d = E(e), f = D(e, m);
+		_(k(d), p, we), _(k(f), p, Te);
+		let h = l.intersectsBox(we), v = l.intersectsBox(Te);
+		A = h && I(t, d, r, n, i, o, a, c, s + 1, l, !u) || v && I(t, f, r, n, i, o, a, c, s + 1, l, !u), F.releasePrimitive(l);
+	} else {
+		let d = E(t), f = D(t, v);
+		_(k(d), g, Ee), _(k(f), g, De);
+		let h = l.intersectsBox(Ee), y = l.intersectsBox(De);
+		if (h && y) A = I(e, d, n, r, i, a, o, s, c + 1, l, u) || I(e, f, n, r, i, a, o, s, c + 1, l, u);
+		else if (h) if (S) A = I(e, d, n, r, i, a, o, s, c + 1, l, u);
+		else {
+			let t = F.getPrimitive();
+			t.copy(Ee).applyMatrix4(n);
+			let l = E(e), f = D(e, m);
+			_(k(l), p, we), _(k(f), p, Te);
+			let h = t.intersectsBox(we), g = t.intersectsBox(Te);
+			A = h && I(d, l, r, n, i, o, a, c, s + 1, t, !u) || g && I(d, f, r, n, i, o, a, c, s + 1, t, !u), F.releasePrimitive(t);
+		}
+		else if (y) if (S) A = I(e, f, n, r, i, a, o, s, c + 1, l, u);
+		else {
+			let t = F.getPrimitive();
+			t.copy(De).applyMatrix4(n);
+			let l = E(e), d = D(e, m);
+			_(k(l), p, we), _(k(d), p, Te);
+			let h = t.intersectsBox(we), g = t.intersectsBox(Te);
+			A = h && I(f, l, r, n, i, o, a, c, s + 1, t, !u) || g && I(f, d, r, n, i, o, a, c, s + 1, t, !u), F.releasePrimitive(t);
+		}
+	}
+	return A;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/BVHTraversalHelper.js
+var Ae = new class {
+	constructor() {
+		let e = null, t = null, n = null, r = !1;
+		this.root = null, this.buffer = null, this.uint32Array = null, this.uint16Array = null, this.setBVH = (i, a) => {
+			if (r) throw Error("BVHTraversalHelper: cannot call setBVH during an active traversal.");
+			this.root = a, this.buffer = e = i._roots[a], this.uint16Array = n = new Uint16Array(e), this.uint32Array = t = new Uint32Array(e);
+		}, this.reset = () => {
+			this.root = null, this.buffer = e = null, this.uint16Array = n = null, this.uint32Array = t = null;
+		}, this.getRangeStart = (e) => {
+			let r = e * 2;
+			for (; !C(r, n);) e = E(e), r = e * 2;
+			return w(e, t);
+		}, this.getRangeEnd = (e) => {
+			let r = e * 2;
+			for (; !C(r, n);) e = D(e, t), r = e * 2;
+			return w(e, t) + T(r, n);
+		};
+		let i = (e, r, a) => {
+			let o = C(r * 2, n);
+			if (!e(a, o, r) && !o) {
+				let n = E(r), o = D(r, t);
+				i(e, n, a + 1), i(e, o, a + 1);
+			}
+		};
+		this.traverseBuffer = (e) => {
+			if (r) throw Error("BVHTraversalHelper: cannot start a traversal during an active traversal.");
+			r = !0;
+			try {
+				i(e, 0, 0);
+			} finally {
+				r = !1;
+			}
+		}, this.traverse = (r) => {
+			this.traverseBuffer((i, a, o) => {
+				if (a) {
+					let s = o * 2, c = t[o + 6], l = n[s + 14];
+					return r(i, a, new Float32Array(e, o * 4, 6), c, l);
+				} else {
+					let n = O(o, t);
+					return r(i, a, new Float32Array(e, o * 4, 6), n);
+				}
+			});
+		};
+	}
+}(), je = /* @__PURE__ */ new o(), Me = /* @__PURE__ */ new Float32Array(6), Ne = class {
+	constructor() {
+		this._roots = null, this.primitiveBuffer = null, this.primitiveBufferStride = null;
+	}
+	init(e) {
+		e = {
+			...g,
+			...e
+		}, "maxLeafSize" in e && (console.warn("BVH: \"maxLeafSize\" option has been deprecated. Use \"targetLeafSize\", instead."), e = {
+			...e,
+			targetLeafSize: e.maxLeafSize
+		}), he(this, e);
+	}
+	getRootRanges() {
+		throw Error("BVH: getRootRanges() not implemented");
+	}
+	writePrimitiveBounds() {
+		throw Error("BVH: writePrimitiveBounds() not implemented");
+	}
+	writePrimitiveRangeBounds(e, t, n, r) {
+		let i = Infinity, a = Infinity, o = Infinity, s = -Infinity, c = -Infinity, l = -Infinity;
+		for (let n = e, r = e + t; n < r; n++) {
+			this.writePrimitiveBounds(n, Me, 0);
+			let [e, t, r, u, d, f] = Me;
+			e < i && (i = e), u > s && (s = u), t < a && (a = t), d > c && (c = d), r < o && (o = r), f > l && (l = f);
+		}
+		return n[r + 0] = i, n[r + 1] = a, n[r + 2] = o, n[r + 3] = s, n[r + 4] = c, n[r + 5] = l, n;
+	}
+	computePrimitiveBounds(e, t, n) {
+		let r = n.offset || 0;
+		for (let i = e, a = e + t; i < a; i++) {
+			this.writePrimitiveBounds(i, Me, 0);
+			let [e, t, a, o, s, c] = Me, l = (e + o) / 2, u = (t + s) / 2, d = (a + c) / 2, f = (o - e) / 2, p = (s - t) / 2, h = (c - a) / 2, g = (i - r) * 6;
+			n[g + 0] = l, n[g + 1] = f + (Math.abs(l) + f) * m, n[g + 2] = u, n[g + 3] = p + (Math.abs(u) + p) * m, n[g + 4] = d, n[g + 5] = h + (Math.abs(d) + h) * m;
+		}
+		return n;
+	}
+	shiftPrimitiveOffsets(e) {
+		let t = this._indirectBuffer;
+		if (t) for (let n = 0, r = t.length; n < r; n++) t[n] += e;
+		else {
+			let t = this._roots;
+			for (let n = 0; n < t.length; n++) {
+				let r = t[n], i = new Uint32Array(r), a = new Uint16Array(r), o = r.byteLength / 32;
+				for (let t = 0; t < o; t++) {
+					let n = 8 * t;
+					C(2 * n, a) && (i[n + 6] += e);
+				}
+			}
+		}
+	}
+	traverse(e, t = 0) {
+		Ae.setBVH(this, t), Ae.traverse(e), Ae.reset();
+	}
+	refit() {
+		let e = this._roots;
+		for (let t = 0, n = e.length; t < n; t++) {
+			let n = e[t], r = new Uint32Array(n), i = new Uint16Array(n), a = new Float32Array(n), o = n.byteLength / 32;
+			for (let e = o - 1; e >= 0; e--) {
+				let t = e * 8, n = t * 2;
+				if (C(n, i)) {
+					let e = w(t, r), o = T(n, i);
+					this.writePrimitiveRangeBounds(e, o, Me, 0), a.set(Me, t);
+				} else {
+					let e = E(t), n = D(t, r);
+					for (let r = 0; r < 3; r++) {
+						let i = a[e + r], o = a[e + r + 3], s = a[n + r], c = a[n + r + 3];
+						a[t + r] = i < s ? i : s, a[t + r + 3] = o > c ? o : c;
+					}
+				}
+			}
+		}
+	}
+	getBoundingBox(e) {
+		return e.makeEmpty(), this._roots.forEach((t) => {
+			_(0, new Float32Array(t), je), e.union(je);
+		}), e;
+	}
+	shapecast(e) {
+		let { boundsTraverseOrder: t, intersectsBounds: n, intersectsRange: r, intersectsPrimitive: i, scratchPrimitive: a, iterate: o } = e;
+		if (r && i) {
+			let e = r;
+			r = (t, n, r, s, c) => e(t, n, r, s, c) ? !0 : o(t, n, this, i, r, s, a);
+		} else r ||= i ? (e, t, n, r) => o(e, t, this, i, n, r, a) : (e, t, n) => n;
+		let s = !1, c = 0, l = this._roots;
+		for (let e = 0, i = l.length; e < i; e++) {
+			let i = l[e];
+			if (s = be(this, e, n, r, t, c), s) break;
+			c += i.byteLength / 32;
+		}
+		return s;
+	}
+	bvhcast(e, t, n) {
+		let { intersectsRanges: r } = n;
+		return ke(this, e, t, r);
+	}
+};
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/utils/BufferUtils.js
+function Pe() {
+	return typeof SharedArrayBuffer < "u";
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/build/geometryUtils.js
+function Fe(e) {
+	return e.index ? e.index.count : e.attributes.position.count;
+}
+function Ie(e) {
+	return Fe(e) / 3;
+}
+function Le(e, t = ArrayBuffer) {
+	return e > 65535 ? new Uint32Array(new t(4 * e)) : new Uint16Array(new t(2 * e));
+}
+function Re(e, t) {
+	if (!e.index) {
+		let n = e.attributes.position.count, r = Le(n, t.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer);
+		e.setIndex(new l(r, 1));
+		for (let e = 0; e < n; e++) r[e] = e;
+	}
+}
+function ze(e, t, n) {
+	let r = Fe(e) / n, i = t || e.drawRange, a = i.start / n, o = (i.start + i.count) / n, s = Math.max(0, a), c = Math.min(r, o) - s;
+	return {
+		offset: Math.floor(s),
+		count: Math.floor(c)
+	};
+}
+function Be(e, t) {
+	return e.groups.map((e) => ({
+		offset: e.start / t,
+		count: e.count / t
+	}));
+}
+function Ve(e, t, n) {
+	let r = ze(e, t, n), i = Be(e, n);
+	if (!i.length) return [r];
+	let a = [], o = r.offset, s = r.offset + r.count, c = Fe(e) / n, l = [];
+	for (let e of i) {
+		let { offset: t, count: n } = e, r = t, i = t + (isFinite(n) ? n : c - t);
+		r < s && i > o && (l.push({
+			pos: Math.max(o, r),
+			isStart: !0
+		}), l.push({
+			pos: Math.min(s, i),
+			isStart: !1
+		}));
+	}
+	l.sort((e, t) => e.pos === t.pos ? e.type === "end" ? -1 : 1 : e.pos - t.pos);
+	let u = 0, d = null;
+	for (let e of l) {
+		let t = e.pos;
+		u !== 0 && t !== d && a.push({
+			offset: d,
+			count: t - d
+		}), u += e.isStart ? 1 : -1, d = t;
+	}
+	return a;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/GeometryBVH.js
+function He(e, t) {
+	let n = e[e.length - 1], r = n.offset + n.count > 2 ** 16, i = e.reduce((e, t) => e + t.count, 0), a = r ? 4 : 2, o = t ? new SharedArrayBuffer(i * a) : new ArrayBuffer(i * a), s = r ? new Uint32Array(o) : new Uint16Array(o), c = 0;
+	for (let t = 0; t < e.length; t++) {
+		let { offset: n, count: r } = e[t];
+		for (let e = 0; e < r; e++) s[c + e] = n + e;
+		c += r;
+	}
+	return s;
+}
+var Ue = class extends Ne {
+	get indirect() {
+		return !!this._indirectBuffer;
+	}
+	get primitiveStride() {
+		return null;
+	}
+	get primitiveBufferStride() {
+		return this.indirect ? 1 : this.primitiveStride;
+	}
+	set primitiveBufferStride(e) {}
+	get primitiveBuffer() {
+		return this.indirect ? this._indirectBuffer : this.geometry.index.array;
+	}
+	set primitiveBuffer(e) {}
+	constructor(e, t = {}) {
+		if (!e.isBufferGeometry) throw Error("BVH: Only BufferGeometries are supported.");
+		if (e.index && e.index.isInterleavedBufferAttribute) throw Error("BVH: InterleavedBufferAttribute is not supported for the index attribute.");
+		if (t.useSharedArrayBuffer && !Pe()) throw Error("BVH: SharedArrayBuffer is not available.");
+		super(), this.geometry = e, this.resolvePrimitiveIndex = t.indirect ? (e) => this._indirectBuffer[e] : (e) => e, this.primitiveBuffer = null, this.primitiveBufferStride = null, this._indirectBuffer = null, t = {
+			...g,
+			...t
+		}, t[h] || this.init(t);
+	}
+	init(e) {
+		let { geometry: t, primitiveStride: n } = this;
+		e.indirect ? this._indirectBuffer = He(Ve(t, e.range, n), e.useSharedArrayBuffer) : Re(t, e), super.init(e), !t.boundingBox && e.setBoundingBox && (t.boundingBox = this.getBoundingBox(new o()));
+	}
+	getRootRanges(e) {
+		return this.indirect ? [{
+			offset: 0,
+			count: this._indirectBuffer.length
+		}] : Ve(this.geometry, e, this.primitiveStride);
+	}
+	raycastObject3D() {
+		throw Error("BVH: raycastObject3D() not implemented");
+	}
+}, L = class {
+	constructor() {
+		this.min = Infinity, this.max = -Infinity;
+	}
+	setFromPointsField(e, t) {
+		let n = Infinity, r = -Infinity;
+		for (let i = 0, a = e.length; i < a; i++) {
+			let a = e[i][t];
+			n = a < n ? a : n, r = a > r ? a : r;
+		}
+		this.min = n, this.max = r;
+	}
+	setFromPoints(e, t) {
+		let n = Infinity, r = -Infinity;
+		for (let i = 0, a = t.length; i < a; i++) {
+			let a = t[i], o = e.dot(a);
+			n = o < n ? o : n, r = o > r ? o : r;
+		}
+		this.min = n, this.max = r;
+	}
+	isSeparated(e) {
+		return this.min > e.max || e.min > this.max;
+	}
+};
+L.prototype.setFromBox = (function() {
+	let e = /* @__PURE__ */ new t();
+	return function(t, n) {
+		let r = n.min, i = n.max, a = Infinity, o = -Infinity;
+		for (let n = 0; n <= 1; n++) for (let s = 0; s <= 1; s++) for (let c = 0; c <= 1; c++) {
+			e.x = r.x * n + i.x * (1 - n), e.y = r.y * s + i.y * (1 - s), e.z = r.z * c + i.z * (1 - c);
+			let l = t.dot(e);
+			a = Math.min(l, a), o = Math.max(l, o);
+		}
+		this.min = a, this.max = o;
+	};
+})(), (function() {
+	let e = /* @__PURE__ */ new L();
+	return function(t, n) {
+		let r = t.points, i = t.satAxes, a = t.satBounds, o = n.points, s = n.satAxes, c = n.satBounds;
+		for (let t = 0; t < 3; t++) {
+			let n = a[t], r = i[t];
+			if (e.setFromPoints(r, o), n.isSeparated(e)) return !1;
+		}
+		for (let t = 0; t < 3; t++) {
+			let n = c[t], i = s[t];
+			if (e.setFromPoints(i, r), n.isSeparated(e)) return !1;
+		}
+	};
+})();
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/math/MathUtilities.js
+var We = (function() {
+	let e = /* @__PURE__ */ new t(), n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t();
+	return function(t, i, a) {
+		let o = t.start, s = e, c = i.start, l = n;
+		r.subVectors(o, c), e.subVectors(t.end, t.start), n.subVectors(i.end, i.start);
+		let u = r.dot(l), d = l.dot(s), f = l.dot(l), p = r.dot(s), m = s.dot(s) * f - d * d, h, g;
+		h = m === 0 ? 0 : (u * d - p * f) / m, g = (u + h * d) / f, a.x = h, a.y = g;
+	};
+})(), Ge = (function() {
+	let e = /* @__PURE__ */ new i(), n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t();
+	return function(t, i, a, o) {
+		We(t, i, e);
+		let s = e.x, c = e.y;
+		if (s >= 0 && s <= 1 && c >= 0 && c <= 1) {
+			t.at(s, a), i.at(c, o);
+			return;
+		} else if (s >= 0 && s <= 1) {
+			c < 0 ? i.at(0, o) : i.at(1, o), t.closestPointToPoint(o, !0, a);
+			return;
+		} else if (c >= 0 && c <= 1) {
+			s < 0 ? t.at(0, a) : t.at(1, a), i.closestPointToPoint(a, !0, o);
+			return;
+		} else {
+			let e;
+			e = s < 0 ? t.start : t.end;
+			let l;
+			l = c < 0 ? i.start : i.end;
+			let u = n, d = r;
+			if (t.closestPointToPoint(l, !0, n), i.closestPointToPoint(e, !0, r), u.distanceToSquared(l) <= d.distanceToSquared(e)) {
+				a.copy(u), o.copy(l);
+				return;
+			} else {
+				a.copy(e), o.copy(d);
+				return;
+			}
+		}
+	};
+})(), Ke = (function() {
+	let n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t(), i = /* @__PURE__ */ new c(), a = /* @__PURE__ */ new e();
+	return function(e, t) {
+		let { radius: o, center: s } = e, { a: c, b: l, c: u } = t;
+		if (a.start = c, a.end = l, a.closestPointToPoint(s, !0, n).distanceTo(s) <= o || (a.start = c, a.end = u, a.closestPointToPoint(s, !0, n).distanceTo(s) <= o) || (a.start = l, a.end = u, a.closestPointToPoint(s, !0, n).distanceTo(s) <= o)) return !0;
+		let d = t.getPlane(i);
+		if (Math.abs(d.distanceToPoint(s)) <= o) {
+			let e = d.projectPoint(s, r);
+			if (t.containsPoint(e)) return !0;
+		}
+		return !1;
+	};
+})(), qe = [
+	"x",
+	"y",
+	"z"
+], R = 1e-15, Je = R * R;
+function z(e) {
+	return Math.abs(e) < R;
+}
+var B = class extends d {
+	constructor(...n) {
+		super(...n), this.isExtendedTriangle = !0, this.satAxes = [
+			,
+			,
+			,
+			,
+		].fill().map(() => new t()), this.satBounds = [
+			,
+			,
+			,
+			,
+		].fill().map(() => new L()), this.points = [
+			this.a,
+			this.b,
+			this.c
+		], this.plane = new c(), this.isDegenerateIntoSegment = !1, this.isDegenerateIntoPoint = !1, this.degenerateSegment = new e(), this.needsUpdate = !0;
+	}
+	intersectsSphere(e) {
+		return Ke(e, this);
+	}
+	update() {
+		let e = this.a, t = this.b, n = this.c, r = this.points, i = this.satAxes, a = this.satBounds, o = i[0], s = a[0];
+		this.getNormal(o), s.setFromPoints(o, r);
+		let c = i[1], l = a[1];
+		c.subVectors(e, t), l.setFromPoints(c, r);
+		let u = i[2], d = a[2];
+		u.subVectors(t, n), d.setFromPoints(u, r);
+		let f = i[3], p = a[3];
+		f.subVectors(n, e), p.setFromPoints(f, r);
+		let m = c.length(), h = u.length(), g = f.length();
+		this.isDegenerateIntoPoint = !1, this.isDegenerateIntoSegment = !1, m < R ? h < R || g < R ? this.isDegenerateIntoPoint = !0 : (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(e), this.degenerateSegment.end.copy(n)) : h < R ? g < R ? this.isDegenerateIntoPoint = !0 : (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(t), this.degenerateSegment.end.copy(e)) : g < R && (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(n), this.degenerateSegment.end.copy(t)), this.plane.setFromNormalAndCoplanarPoint(o, e), this.needsUpdate = !1;
+	}
+};
+B.prototype.closestPointToSegment = (function() {
+	let n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t(), i = /* @__PURE__ */ new e();
+	return function(e, t = null, a = null) {
+		let { start: o, end: s } = e, c = this.points, l, u = Infinity;
+		for (let o = 0; o < 3; o++) {
+			let s = (o + 1) % 3;
+			i.start.copy(c[o]), i.end.copy(c[s]), Ge(i, e, n, r), l = n.distanceToSquared(r), l < u && (u = l, t && t.copy(n), a && a.copy(r));
+		}
+		return this.closestPointToPoint(o, n), l = o.distanceToSquared(n), l < u && (u = l, t && t.copy(n), a && a.copy(o)), this.closestPointToPoint(s, n), l = s.distanceToSquared(n), l < u && (u = l, t && t.copy(n), a && a.copy(s)), Math.sqrt(u);
+	};
+})(), B.prototype.intersectsTriangle = (function() {
+	let n = /* @__PURE__ */ new B(), r = /* @__PURE__ */ new L(), a = /* @__PURE__ */ new L(), o = /* @__PURE__ */ new t(), s = /* @__PURE__ */ new t(), c = /* @__PURE__ */ new t(), l = /* @__PURE__ */ new t(), u = /* @__PURE__ */ new e(), d = /* @__PURE__ */ new e(), f = /* @__PURE__ */ new t(), p = /* @__PURE__ */ new i(), m = /* @__PURE__ */ new i();
+	function h(e, t, n, i) {
+		let s = o;
+		!e.isDegenerateIntoPoint && !e.isDegenerateIntoSegment ? s.copy(e.plane.normal) : s.copy(t.plane.normal);
+		let c = e.satBounds, u = e.satAxes;
+		for (let n = 1; n < 4; n++) {
+			let i = c[n], o = u[n];
+			if (r.setFromPoints(o, t.points), i.isSeparated(r) || (l.copy(s).cross(o), r.setFromPoints(l, e.points), a.setFromPoints(l, t.points), r.isSeparated(a))) return !1;
+		}
+		let d = t.satBounds, f = t.satAxes;
+		for (let n = 1; n < 4; n++) {
+			let i = d[n], o = f[n];
+			if (r.setFromPoints(o, e.points), i.isSeparated(r) || (l.crossVectors(s, o), r.setFromPoints(l, e.points), a.setFromPoints(l, t.points), r.isSeparated(a))) return !1;
+		}
+		return n && (i || console.warn("ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0."), n.start.set(0, 0, 0), n.end.set(0, 0, 0)), !0;
+	}
+	function g(e, t, n, r, i, a, o, s, c, l, u) {
+		let d = o / (o - s);
+		l.x = r + (i - r) * d, u.start.subVectors(t, e).multiplyScalar(d).add(e), d = o / (o - c), l.y = r + (a - r) * d, u.end.subVectors(n, e).multiplyScalar(d).add(e);
+	}
+	function _(e, t, n, r, i, a, o, s, c, l, u) {
+		if (i > 0) g(e.c, e.a, e.b, r, t, n, c, o, s, l, u);
+		else if (a > 0) g(e.b, e.a, e.c, n, t, r, s, o, c, l, u);
+		else if (s * c > 0 || o != 0) g(e.a, e.b, e.c, t, n, r, o, s, c, l, u);
+		else if (s != 0) g(e.b, e.a, e.c, n, t, r, s, o, c, l, u);
+		else if (c != 0) g(e.c, e.a, e.b, r, t, n, c, o, s, l, u);
+		else return !0;
+		return !1;
+	}
+	function v(e, t, n, r) {
+		let i = t.degenerateSegment, a = e.plane.distanceToPoint(i.start), s = e.plane.distanceToPoint(i.end);
+		return z(a) ? z(s) ? h(e, t, n, r) : (n && (n.start.copy(i.start), n.end.copy(i.start)), e.containsPoint(i.start)) : z(s) ? (n && (n.start.copy(i.end), n.end.copy(i.end)), e.containsPoint(i.end)) : e.plane.intersectLine(i, o) == null ? !1 : (n && (n.start.copy(o), n.end.copy(o)), e.containsPoint(o));
+	}
+	function y(e, t, n) {
+		let r = t.a;
+		return z(e.plane.distanceToPoint(r)) && e.containsPoint(r) ? (n && (n.start.copy(r), n.end.copy(r)), !0) : !1;
+	}
+	function b(e, t, n) {
+		let r = e.degenerateSegment, i = t.a;
+		return r.closestPointToPoint(i, !0, o), i.distanceToSquared(o) < Je ? (n && (n.start.copy(i), n.end.copy(i)), !0) : !1;
+	}
+	function x(e, t, n, r) {
+		if (e.isDegenerateIntoSegment) if (t.isDegenerateIntoSegment) {
+			let r = e.degenerateSegment, i = t.degenerateSegment, a = s, l = c;
+			r.delta(a), i.delta(l);
+			let u = o.subVectors(i.start, r.start), d = a.x * l.y - a.y * l.x;
+			if (z(d)) return !1;
+			let f = (u.x * l.y - u.y * l.x) / d, p = -(a.x * u.y - a.y * u.x) / d;
+			return f < 0 || f > 1 || p < 0 || p > 1 ? !1 : z(r.start.z + a.z * f - (i.start.z + l.z * p)) ? (n && (n.start.copy(r.start).addScaledVector(a, f), n.end.copy(r.start).addScaledVector(a, f)), !0) : !1;
+		} else if (t.isDegenerateIntoPoint) return b(e, t, n);
+		else return v(t, e, n, r);
+		else if (e.isDegenerateIntoPoint) return t.isDegenerateIntoPoint ? t.a.distanceToSquared(e.a) < Je ? (n && (n.start.copy(e.a), n.end.copy(e.a)), !0) : !1 : t.isDegenerateIntoSegment ? b(t, e, n) : y(t, e, n);
+		else if (t.isDegenerateIntoPoint) return y(e, t, n);
+		else if (t.isDegenerateIntoSegment) return v(e, t, n, r);
+	}
+	return function(e, t = null, r = !1) {
+		this.needsUpdate && this.update(), e.isExtendedTriangle ? e.needsUpdate && e.update() : (n.copy(e), n.update(), e = n);
+		let i = x(this, e, t, r);
+		if (i !== void 0) return i;
+		let a = this.plane, o = e.plane, l = o.distanceToPoint(this.a), g = o.distanceToPoint(this.b), v = o.distanceToPoint(this.c);
+		z(l) && (l = 0), z(g) && (g = 0), z(v) && (v = 0);
+		let y = l * g, b = l * v;
+		if (y > 0 && b > 0) return !1;
+		let S = a.distanceToPoint(e.a), C = a.distanceToPoint(e.b), w = a.distanceToPoint(e.c);
+		z(S) && (S = 0), z(C) && (C = 0), z(w) && (w = 0);
+		let T = S * C, E = S * w;
+		if (T > 0 && E > 0) return !1;
+		s.copy(a.normal), c.copy(o.normal);
+		let D = s.cross(c), O = 0, k = Math.abs(D.x), A = Math.abs(D.y);
+		A > k && (k = A, O = 1), Math.abs(D.z) > k && (O = 2);
+		let j = qe[O], ee = this.a[j], M = this.b[j], te = this.c[j], ne = e.a[j], re = e.b[j], ie = e.c[j];
+		if (_(this, ee, M, te, y, b, l, g, v, p, u) || _(e, ne, re, ie, T, E, S, C, w, m, d)) return h(this, e, t, r);
+		if (p.y < p.x) {
+			let e = p.y;
+			p.y = p.x, p.x = e, f.copy(u.start), u.start.copy(u.end), u.end.copy(f);
+		}
+		if (m.y < m.x) {
+			let e = m.y;
+			m.y = m.x, m.x = e, f.copy(d.start), d.start.copy(d.end), d.end.copy(f);
+		}
+		return p.y < m.x || m.y < p.x ? !1 : (t && (m.x > p.x ? t.start.copy(d.start) : t.start.copy(u.start), m.y < p.y ? t.end.copy(d.end) : t.end.copy(u.end)), !0);
+	};
+})(), B.prototype.distanceToPoint = (function() {
+	let e = /* @__PURE__ */ new t();
+	return function(t) {
+		return this.closestPointToPoint(t, e), t.distanceTo(e);
+	};
+})(), B.prototype.distanceToTriangle = (function() {
+	let n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t(), i = [
+		"a",
+		"b",
+		"c"
+	], a = /* @__PURE__ */ new e(), o = /* @__PURE__ */ new e();
+	return function(e, t = null, s = null) {
+		let c = t || s ? a : null;
+		if (this.intersectsTriangle(e, c, !0)) return (t || s) && (t && c.getCenter(t), s && c.getCenter(s)), 0;
+		let l = Infinity;
+		for (let r = 0; r < 3; r++) {
+			let a, o = i[r], c = e[o];
+			this.closestPointToPoint(c, n), a = c.distanceToSquared(n), a < l && (l = a, t && t.copy(n), s && s.copy(c));
+			let u = this[o];
+			e.closestPointToPoint(u, n), a = u.distanceToSquared(n), a < l && (l = a, t && t.copy(u), s && s.copy(n));
+		}
+		for (let c = 0; c < 3; c++) {
+			let u = i[c], d = i[(c + 1) % 3];
+			a.set(this[u], this[d]);
+			for (let c = 0; c < 3; c++) {
+				let u = i[c], d = i[(c + 1) % 3];
+				o.set(e[u], e[d]), Ge(a, o, n, r);
+				let f = n.distanceToSquared(r);
+				f < l && (l = f, t && t.copy(n), s && s.copy(r));
+			}
+		}
+		return Math.sqrt(l);
+	};
+})();
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/math/OrientedBox.js
+var V = class {
+	constructor(e, n, r) {
+		this.isOrientedBox = !0, this.min = new t(), this.max = new t(), this.matrix = new u(), this.invMatrix = new u(), this.points = Array(8).fill().map(() => new t()), this.satAxes = [
+			,
+			,
+			,
+		].fill().map(() => new t()), this.satBounds = [
+			,
+			,
+			,
+		].fill().map(() => new L()), this.alignedSatBounds = [
+			,
+			,
+			,
+		].fill().map(() => new L()), this.needsUpdate = !1, e && this.min.copy(e), n && this.max.copy(n), r && this.matrix.copy(r);
+	}
+	set(e, t, n) {
+		this.min.copy(e), this.max.copy(t), this.matrix.copy(n), this.needsUpdate = !0;
+	}
+	copy(e) {
+		this.min.copy(e.min), this.max.copy(e.max), this.matrix.copy(e.matrix), this.needsUpdate = !0;
+	}
+};
+V.prototype.update = (function() {
+	return function() {
+		let e = this.matrix, t = this.min, n = this.max, r = this.points;
+		for (let i = 0; i <= 1; i++) for (let a = 0; a <= 1; a++) for (let o = 0; o <= 1; o++) {
+			let s = r[1 * i | 2 * a | 4 * o];
+			s.x = i ? n.x : t.x, s.y = a ? n.y : t.y, s.z = o ? n.z : t.z, s.applyMatrix4(e);
+		}
+		let i = this.satBounds, a = this.satAxes, o = r[0];
+		for (let e = 0; e < 3; e++) {
+			let t = a[e], n = i[e], s = r[1 << e];
+			t.subVectors(o, s), n.setFromPoints(t, r);
+		}
+		let s = this.alignedSatBounds;
+		s[0].setFromPointsField(r, "x"), s[1].setFromPointsField(r, "y"), s[2].setFromPointsField(r, "z"), this.invMatrix.copy(this.matrix).invert(), this.needsUpdate = !1;
+	};
+})(), V.prototype.intersectsBox = (function() {
+	let e = /* @__PURE__ */ new L();
+	return function(t) {
+		this.needsUpdate && this.update();
+		let n = t.min, r = t.max, i = this.satBounds, a = this.satAxes, o = this.alignedSatBounds;
+		if (e.min = n.x, e.max = r.x, o[0].isSeparated(e) || (e.min = n.y, e.max = r.y, o[1].isSeparated(e)) || (e.min = n.z, e.max = r.z, o[2].isSeparated(e))) return !1;
+		for (let n = 0; n < 3; n++) {
+			let r = a[n], o = i[n];
+			if (e.setFromBox(r, t), o.isSeparated(e)) return !1;
+		}
+		return !0;
+	};
+})(), V.prototype.intersectsTriangle = (function() {
+	let e = /* @__PURE__ */ new B(), n = [
+		,
+		,
+		,
+	], r = /* @__PURE__ */ new L(), i = /* @__PURE__ */ new L(), a = /* @__PURE__ */ new t();
+	return function(t) {
+		this.needsUpdate && this.update(), t.isExtendedTriangle ? t.needsUpdate && t.update() : (e.copy(t), e.update(), t = e);
+		let o = this.satBounds, s = this.satAxes;
+		n[0] = t.a, n[1] = t.b, n[2] = t.c;
+		for (let e = 0; e < 3; e++) {
+			let t = o[e], i = s[e];
+			if (r.setFromPoints(i, n), t.isSeparated(r)) return !1;
+		}
+		let c = t.satBounds, l = t.satAxes, u = this.points;
+		for (let e = 0; e < 3; e++) {
+			let t = c[e], n = l[e];
+			if (r.setFromPoints(n, u), t.isSeparated(r)) return !1;
+		}
+		for (let e = 0; e < 3; e++) {
+			let t = s[e];
+			for (let e = 0; e < 4; e++) {
+				let o = l[e];
+				if (a.crossVectors(t, o), r.setFromPoints(a, n), i.setFromPoints(a, u), r.isSeparated(i)) return !1;
+			}
+		}
+		return !0;
+	};
+})(), V.prototype.closestPointToPoint = (function() {
+	return function(e, t) {
+		return this.needsUpdate && this.update(), t.copy(e).applyMatrix4(this.invMatrix).clamp(this.min, this.max).applyMatrix4(this.matrix), t;
+	};
+})(), V.prototype.distanceToPoint = (function() {
+	let e = new t();
+	return function(t) {
+		return this.closestPointToPoint(t, e), t.distanceTo(e);
+	};
+})(), V.prototype.distanceToBox = (function() {
+	let n = [
+		"x",
+		"y",
+		"z"
+	], r = /* @__PURE__ */ Array(12).fill().map(() => new e()), i = /* @__PURE__ */ Array(12).fill().map(() => new e()), a = /* @__PURE__ */ new t(), o = /* @__PURE__ */ new t();
+	return function(e, t = 0, s = null, c = null) {
+		if (this.needsUpdate && this.update(), this.intersectsBox(e)) return (s || c) && (e.getCenter(o), this.closestPointToPoint(o, a), e.closestPointToPoint(a, o), s && s.copy(a), c && c.copy(o)), 0;
+		let l = t * t, u = e.min, d = e.max, f = this.points, p = Infinity;
+		for (let e = 0; e < 8; e++) {
+			let t = f[e];
+			o.copy(t).clamp(u, d);
+			let n = t.distanceToSquared(o);
+			if (n < p && (p = n, s && s.copy(t), c && c.copy(o), n < l)) return Math.sqrt(n);
+		}
+		let m = 0;
+		for (let e = 0; e < 3; e++) for (let t = 0; t <= 1; t++) for (let a = 0; a <= 1; a++) {
+			let o = (e + 1) % 3, s = (e + 2) % 3, c = t << o | a << s, l = 1 << e | t << o | a << s, p = f[c], h = f[l];
+			r[m].set(p, h);
+			let g = n[e], _ = n[o], v = n[s], y = i[m], b = y.start, x = y.end;
+			b[g] = u[g], b[_] = t ? u[_] : d[_], b[v] = a ? u[v] : d[_], x[g] = d[g], x[_] = t ? u[_] : d[_], x[v] = a ? u[v] : d[_], m++;
+		}
+		for (let e = 0; e <= 1; e++) for (let t = 0; t <= 1; t++) for (let n = 0; n <= 1; n++) {
+			o.x = e ? d.x : u.x, o.y = t ? d.y : u.y, o.z = n ? d.z : u.z, this.closestPointToPoint(o, a);
+			let r = o.distanceToSquared(a);
+			if (r < p && (p = r, s && s.copy(a), c && c.copy(o), r < l)) return Math.sqrt(r);
+		}
+		for (let e = 0; e < 12; e++) {
+			let t = r[e];
+			for (let e = 0; e < 12; e++) {
+				let n = i[e];
+				Ge(t, n, a, o);
+				let r = a.distanceToSquared(o);
+				if (r < p && (p = r, s && s.copy(a), c && c.copy(o), r < l)) return Math.sqrt(r);
+			}
+		}
+		return Math.sqrt(p);
+	};
+})();
+var H = /* @__PURE__ */ new class extends ge {
+	constructor() {
+		super(() => new B());
+	}
+}(), Ye = /* @__PURE__ */ new t(), Xe = /* @__PURE__ */ new t();
+function Ze(e, t, n = {}, r = 0, i = Infinity) {
+	let a = r * r, o = i * i, s = Infinity, c = null;
+	if (e.shapecast({
+		boundsTraverseOrder: (e) => (Ye.copy(t).clamp(e.min, e.max), Ye.distanceToSquared(t)),
+		intersectsBounds: (e, t, n) => n < s && n < o,
+		intersectsTriangle: (e, n) => {
+			e.closestPointToPoint(t, Ye);
+			let r = t.distanceToSquared(Ye);
+			return r < s && (Xe.copy(Ye), s = r, c = n), r < a;
+		}
+	}), s === Infinity) return null;
+	let l = Math.sqrt(s);
+	return n.point ? n.point.copy(Xe) : n.point = Xe.clone(), n.distance = l, n.faceIndex = c, n;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/utils/ThreeRayIntersectUtilities.js
+var Qe = !0, $e = !1, U = /* @__PURE__ */ new t(), W = /* @__PURE__ */ new t(), G = /* @__PURE__ */ new t(), et = /* @__PURE__ */ new i(), tt = /* @__PURE__ */ new i(), nt = /* @__PURE__ */ new i(), rt = /* @__PURE__ */ new t(), it = /* @__PURE__ */ new t(), at = /* @__PURE__ */ new t(), ot = /* @__PURE__ */ new t();
+function st(e, t, n, r, i, a, o, s) {
+	let c;
+	if (c = a === 1 ? e.intersectTriangle(r, n, t, !0, i) : e.intersectTriangle(t, n, r, a !== 2, i), c === null) return null;
+	let l = e.origin.distanceTo(i);
+	return l < o || l > s ? null : {
+		distance: l,
+		point: i.clone()
+	};
+}
+function ct(e, n, r, a, o, s, c, l, u, f, p) {
+	U.fromBufferAttribute(n, s), W.fromBufferAttribute(n, c), G.fromBufferAttribute(n, l);
+	let m = st(e, U, W, G, ot, u, f, p);
+	if (m) {
+		if (a) {
+			et.fromBufferAttribute(a, s), tt.fromBufferAttribute(a, c), nt.fromBufferAttribute(a, l), m.uv = new i();
+			let e = d.getInterpolation(ot, U, W, G, et, tt, nt, m.uv);
+			Qe || (m.uv = e);
+		}
+		if (o) {
+			et.fromBufferAttribute(o, s), tt.fromBufferAttribute(o, c), nt.fromBufferAttribute(o, l), m.uv1 = new i();
+			let e = d.getInterpolation(ot, U, W, G, et, tt, nt, m.uv1);
+			Qe || (m.uv1 = e), $e && (m.uv2 = m.uv1);
+		}
+		if (r) {
+			rt.fromBufferAttribute(r, s), it.fromBufferAttribute(r, c), at.fromBufferAttribute(r, l), m.normal = new t();
+			let n = d.getInterpolation(ot, U, W, G, rt, it, at, m.normal);
+			m.normal.dot(e.direction) > 0 && m.normal.multiplyScalar(-1), Qe || (m.normal = n);
+		}
+		let n = {
+			a: s,
+			b: c,
+			c: l,
+			normal: new t(),
+			materialIndex: 0
+		};
+		if (d.getNormal(U, W, G, n.normal), m.face = n, m.faceIndex = s, Qe) {
+			let e = new t();
+			d.getBarycoord(ot, U, W, G, e), m.barycoord = e;
+		}
+	}
+	return m;
+}
+function lt(e) {
+	return e && e.isMaterial ? e.side : e;
+}
+function ut(e, t, n, r, i, a, o) {
+	let s = r * 3, c = s + 0, l = s + 1, u = s + 2, { index: d, groups: f } = e;
+	e.index && (c = d.getX(c), l = d.getX(l), u = d.getX(u));
+	let { position: p, normal: m, uv: h, uv1: g } = e.attributes;
+	if (Array.isArray(t)) {
+		let e = r * 3;
+		for (let s = 0, d = f.length; s < d; s++) {
+			let { start: d, count: _, materialIndex: v } = f[s];
+			if (e >= d && e < d + _) {
+				let e = lt(t[v]), s = ct(n, p, m, h, g, c, l, u, e, a, o);
+				if (s) if (s.faceIndex = r, s.face.materialIndex = v, i) i.push(s);
+				else return s;
+			}
+		}
+	} else {
+		let e = lt(t), s = ct(n, p, m, h, g, c, l, u, e, a, o);
+		if (s) if (s.faceIndex = r, s.face.materialIndex = 0, i) i.push(s);
+		else return s;
+	}
+	return null;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/utils/TriangleUtilities.js
+function K(e, t, n, r) {
+	let i = e.a, a = e.b, o = e.c, s = t, c = t + 1, l = t + 2;
+	n && (s = n.getX(s), c = n.getX(c), l = n.getX(l)), i.x = r.getX(s), i.y = r.getY(s), i.z = r.getZ(s), a.x = r.getX(c), a.y = r.getY(c), a.z = r.getZ(c), o.x = r.getX(l), o.y = r.getY(l), o.z = r.getZ(l);
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/utils/iterationUtils.generated.js
+function dt(e, t, n, r, i, a, o, s) {
+	let { geometry: c, _indirectBuffer: l } = e;
+	for (let e = r, l = r + i; e < l; e++) ut(c, t, n, e, a, o, s);
+}
+function ft(e, t, n, r, i, a, o) {
+	let { geometry: s, _indirectBuffer: c } = e, l = Infinity, u = null;
+	for (let e = r, c = r + i; e < c; e++) {
+		let r;
+		r = ut(s, t, n, e, null, a, o), r && r.distance < l && (u = r, l = r.distance);
+	}
+	return u;
+}
+function pt(e, t, n, r, i, a, o) {
+	let { geometry: s } = n, { index: c } = s, l = s.attributes.position;
+	for (let n = e, s = t + e; n < s; n++) {
+		let e;
+		if (e = n, K(o, e * 3, c, l), o.needsUpdate = !0, r(o, e, i, a)) return !0;
+	}
+	return !1;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/refit.generated.js
+function mt(e, t = null) {
+	t && Array.isArray(t) && (t = new Set(t));
+	let n = e.geometry, r = n.index ? n.index.array : null, i = n.attributes.position, a, o, s, c, l = 0, u = e._roots;
+	for (let e = 0, t = u.length; e < t; e++) a = u[e], o = new Uint32Array(a), s = new Uint16Array(a), c = new Float32Array(a), d(0, l), l += a.byteLength;
+	function d(e, n, a = !1) {
+		let l = e * 2;
+		if (C(l, s)) {
+			let t = w(e, o), n = T(l, s), a = Infinity, u = Infinity, d = Infinity, f = -Infinity, p = -Infinity, m = -Infinity;
+			for (let e = 3 * t, o = 3 * (t + n); e < o; e++) {
+				let t = r[e], n = i.getX(t), o = i.getY(t), s = i.getZ(t);
+				n < a && (a = n), n > f && (f = n), o < u && (u = o), o > p && (p = o), s < d && (d = s), s > m && (m = s);
+			}
+			return c[e + 0] !== a || c[e + 1] !== u || c[e + 2] !== d || c[e + 3] !== f || c[e + 4] !== p || c[e + 5] !== m ? (c[e + 0] = a, c[e + 1] = u, c[e + 2] = d, c[e + 3] = f, c[e + 4] = p, c[e + 5] = m, !0) : !1;
+		} else {
+			let r = E(e), i = D(e, o), s = a, l = !1, u = !1;
+			if (t) {
+				if (!s) {
+					let e = r / 8 + n / 32, a = i / 8 + n / 32;
+					l = t.has(e), u = t.has(a), s = !l && !u;
+				}
+			} else l = !0, u = !0;
+			let f = s || l, p = s || u, m = !1;
+			f && (m = d(r, n, s));
+			let h = !1;
+			p && (h = d(i, n, s));
+			let g = m || h;
+			if (g) for (let t = 0; t < 3; t++) {
+				let n = r + t, a = i + t, o = c[n], s = c[n + 3], l = c[a], u = c[a + 3];
+				c[e + t] = o < l ? o : l, c[e + t + 3] = s > u ? s : u;
+			}
+			return g;
+		}
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/utils/intersectUtils.js
+function q(e, t, n, r, i) {
+	let a, o, s, c, l, u, d = 1 / n.direction.x, f = 1 / n.direction.y, p = 1 / n.direction.z, m = n.origin.x, h = n.origin.y, g = n.origin.z, _ = t[e], v = t[e + 3], y = t[e + 1], b = t[e + 3 + 1], x = t[e + 2], S = t[e + 3 + 2];
+	return d >= 0 ? (a = (_ - m) * d, o = (v - m) * d) : (a = (v - m) * d, o = (_ - m) * d), f >= 0 ? (s = (y - h) * f, c = (b - h) * f) : (s = (b - h) * f, c = (y - h) * f), a > c || s > o || ((s > a || isNaN(a)) && (a = s), (c < o || isNaN(o)) && (o = c), p >= 0 ? (l = (x - g) * p, u = (S - g) * p) : (l = (S - g) * p, u = (x - g) * p), a > u || l > o) ? !1 : ((l > a || a !== a) && (a = l), (u < o || o !== o) && (o = u), a <= i && o >= r);
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/utils/iterationUtils_indirect.generated.js
+function ht(e, t, n, r, i, a, o, s) {
+	let { geometry: c, _indirectBuffer: l } = e;
+	for (let e = r, u = r + i; e < u; e++) ut(c, t, n, l ? l[e] : e, a, o, s);
+}
+function gt(e, t, n, r, i, a, o) {
+	let { geometry: s, _indirectBuffer: c } = e, l = Infinity, u = null;
+	for (let e = r, d = r + i; e < d; e++) {
+		let r;
+		r = ut(s, t, n, c ? c[e] : e, null, a, o), r && r.distance < l && (u = r, l = r.distance);
+	}
+	return u;
+}
+function _t(e, t, n, r, i, a, o) {
+	let { geometry: s } = n, { index: c } = s, l = s.attributes.position;
+	for (let s = e, u = t + e; s < u; s++) {
+		let e;
+		if (e = n.resolveTriangleIndex(s), K(o, e * 3, c, l), o.needsUpdate = !0, r(o, e, i, a)) return !0;
+	}
+	return !1;
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/raycast.generated.js
+function vt(e, t, n, r, i, a, o) {
+	N.setBuffer(e._roots[t]), yt(0, e, n, r, i, a, o), N.clearBuffer();
+}
+function yt(e, t, n, r, i, a, o) {
+	let { float32Array: s, uint16Array: c, uint32Array: l } = N, u = e * 2;
+	if (C(u, c)) dt(t, n, r, w(e, l), T(u, c), i, a, o);
+	else {
+		let c = E(e);
+		q(c, s, r, a, o) && yt(c, t, n, r, i, a, o);
+		let u = D(e, l);
+		q(u, s, r, a, o) && yt(u, t, n, r, i, a, o);
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/raycastFirst.generated.js
+var bt = [
+	"x",
+	"y",
+	"z"
+];
+function xt(e, t, n, r, i, a) {
+	N.setBuffer(e._roots[t]);
+	let o = St(0, e, n, r, i, a);
+	return N.clearBuffer(), o;
+}
+function St(e, t, n, r, i, a) {
+	let { float32Array: o, uint16Array: s, uint32Array: c } = N, l = e * 2;
+	if (C(l, s)) return ft(t, n, r, w(e, c), T(l, s), i, a);
+	{
+		let s = O(e, c), l = bt[s], u = r.direction[l] >= 0, d, f;
+		u ? (d = E(e), f = D(e, c)) : (d = D(e, c), f = E(e));
+		let p = q(d, o, r, i, a) ? St(d, t, n, r, i, a) : null;
+		if (p) {
+			let e = p.point[l];
+			if (u ? e <= o[f + s] : e >= o[f + s + 3]) return p;
+		}
+		let m = q(f, o, r, i, a) ? St(f, t, n, r, i, a) : null;
+		return p && m ? p.distance <= m.distance ? p : m : p || m || null;
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry.generated.js
+var Ct = /* @__PURE__ */ new o(), wt = /* @__PURE__ */ new B(), Tt = /* @__PURE__ */ new B(), Et = /* @__PURE__ */ new u(), Dt = /* @__PURE__ */ new V(), Ot = /* @__PURE__ */ new V();
+function kt(e, t, n, r) {
+	N.setBuffer(e._roots[t]);
+	let i = At(0, e, n, r);
+	return N.clearBuffer(), i;
+}
+function At(e, t, n, r, i = null) {
+	let { float32Array: a, uint16Array: o, uint32Array: s } = N, c = e * 2;
+	if (i === null && (n.boundingBox || n.computeBoundingBox(), Dt.set(n.boundingBox.min, n.boundingBox.max, r), i = Dt), C(c, o)) {
+		let i = t.geometry, l = i.index, u = i.attributes.position, d = n.index, f = n.attributes.position, p = w(e, s), m = T(c, o);
+		if (Et.copy(r).invert(), n.boundsTree) return _(k(e), a, Ot), Ot.matrix.copy(Et), Ot.needsUpdate = !0, n.boundsTree.shapecast({
+			intersectsBounds: (e) => Ot.intersectsBox(e),
+			intersectsTriangle: (e) => {
+				e.a.applyMatrix4(r), e.b.applyMatrix4(r), e.c.applyMatrix4(r), e.needsUpdate = !0;
+				for (let t = p * 3, n = (m + p) * 3; t < n; t += 3) if (K(Tt, t, l, u), Tt.needsUpdate = !0, e.intersectsTriangle(Tt)) return !0;
+				return !1;
+			}
+		});
+		{
+			let e = Ie(n);
+			for (let t = p * 3, n = (m + p) * 3; t < n; t += 3) {
+				K(wt, t, l, u), wt.a.applyMatrix4(Et), wt.b.applyMatrix4(Et), wt.c.applyMatrix4(Et), wt.needsUpdate = !0;
+				for (let t = 0, n = e * 3; t < n; t += 3) if (K(Tt, t, d, f), Tt.needsUpdate = !0, wt.intersectsTriangle(Tt)) return !0;
+			}
+		}
+	} else {
+		let o = E(e), c = D(e, s);
+		return _(k(o), a, Ct), !!(i.intersectsBox(Ct) && At(o, t, n, r, i) || (_(k(c), a, Ct), i.intersectsBox(Ct) && At(c, t, n, r, i)));
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry.generated.js
+var jt = /* @__PURE__ */ new u(), Mt = /* @__PURE__ */ new V(), Nt = /* @__PURE__ */ new V(), Pt = /* @__PURE__ */ new t(), Ft = /* @__PURE__ */ new t(), It = /* @__PURE__ */ new t(), Lt = /* @__PURE__ */ new t();
+function Rt(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
+	t.boundingBox || t.computeBoundingBox(), Mt.set(t.boundingBox.min, t.boundingBox.max, n), Mt.needsUpdate = !0;
+	let s = e.geometry, c = s.attributes.position, l = s.index, u = t.attributes.position, d = t.index, f = H.getPrimitive(), p = H.getPrimitive(), m = Pt, h = Ft, g = null, _ = null;
+	i && (g = It, _ = Lt);
+	let v = Infinity, y = null, b = null;
+	return jt.copy(n).invert(), Nt.matrix.copy(jt), e.shapecast({
+		boundsTraverseOrder: (e) => Mt.distanceToBox(e),
+		intersectsBounds: (e, t, n) => n < v && n < o ? (t && (Nt.min.copy(e.min), Nt.max.copy(e.max), Nt.needsUpdate = !0), !0) : !1,
+		intersectsRange: (e, r) => {
+			if (t.boundsTree) return t.boundsTree.shapecast({
+				boundsTraverseOrder: (e) => Nt.distanceToBox(e),
+				intersectsBounds: (e, t, n) => n < v && n < o,
+				intersectsRange: (t, i) => {
+					for (let o = t, s = t + i; o < s; o++) {
+						K(p, 3 * o, d, u), p.a.applyMatrix4(n), p.b.applyMatrix4(n), p.c.applyMatrix4(n), p.needsUpdate = !0;
+						for (let t = e, n = e + r; t < n; t++) {
+							K(f, 3 * t, l, c), f.needsUpdate = !0;
+							let e = f.distanceToTriangle(p, m, g);
+							if (e < v && (h.copy(m), _ && _.copy(g), v = e, y = t, b = o), e < a) return !0;
+						}
+					}
+				}
+			});
+			{
+				let i = Ie(t);
+				for (let t = 0, o = i; t < o; t++) {
+					K(p, 3 * t, d, u), p.a.applyMatrix4(n), p.b.applyMatrix4(n), p.c.applyMatrix4(n), p.needsUpdate = !0;
+					for (let n = e, i = e + r; n < i; n++) {
+						K(f, 3 * n, l, c), f.needsUpdate = !0;
+						let e = f.distanceToTriangle(p, m, g);
+						if (e < v && (h.copy(m), _ && _.copy(g), v = e, y = n, b = t), e < a) return !0;
+					}
+				}
+			}
+		}
+	}), H.releasePrimitive(f), H.releasePrimitive(p), v === Infinity ? null : (r.point ? r.point.copy(h) : r.point = h.clone(), r.distance = v, r.faceIndex = y, i && (i.point ? i.point.copy(_) : i.point = _.clone(), i.point.applyMatrix4(jt), h.applyMatrix4(jt), i.distance = h.sub(i.point).length(), i.faceIndex = b), r);
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/refit_indirect.generated.js
+function zt(e, t = null) {
+	t && Array.isArray(t) && (t = new Set(t));
+	let n = e.geometry, r = n.index ? n.index.array : null, i = n.attributes.position, a, o, s, c, l = 0, u = e._roots;
+	for (let e = 0, t = u.length; e < t; e++) a = u[e], o = new Uint32Array(a), s = new Uint16Array(a), c = new Float32Array(a), d(0, l), l += a.byteLength;
+	function d(n, a, l = !1) {
+		let u = n * 2;
+		if (C(u, s)) {
+			let t = w(n, o), a = T(u, s), l = Infinity, d = Infinity, f = Infinity, p = -Infinity, m = -Infinity, h = -Infinity;
+			for (let n = t, o = t + a; n < o; n++) {
+				let t = 3 * e.resolveTriangleIndex(n);
+				for (let e = 0; e < 3; e++) {
+					let n = t + e;
+					n = r ? r[n] : n;
+					let a = i.getX(n), o = i.getY(n), s = i.getZ(n);
+					a < l && (l = a), a > p && (p = a), o < d && (d = o), o > m && (m = o), s < f && (f = s), s > h && (h = s);
+				}
+			}
+			return c[n + 0] !== l || c[n + 1] !== d || c[n + 2] !== f || c[n + 3] !== p || c[n + 4] !== m || c[n + 5] !== h ? (c[n + 0] = l, c[n + 1] = d, c[n + 2] = f, c[n + 3] = p, c[n + 4] = m, c[n + 5] = h, !0) : !1;
+		} else {
+			let e = E(n), r = D(n, o), i = l, s = !1, u = !1;
+			if (t) {
+				if (!i) {
+					let n = e / 8 + a / 32, o = r / 8 + a / 32;
+					s = t.has(n), u = t.has(o), i = !s && !u;
+				}
+			} else s = !0, u = !0;
+			let f = i || s, p = i || u, m = !1;
+			f && (m = d(e, a, i));
+			let h = !1;
+			p && (h = d(r, a, i));
+			let g = m || h;
+			if (g) for (let t = 0; t < 3; t++) {
+				let i = e + t, a = r + t, o = c[i], s = c[i + 3], l = c[a], u = c[a + 3];
+				c[n + t] = o < l ? o : l, c[n + t + 3] = s > u ? s : u;
+			}
+			return g;
+		}
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/raycast_indirect.generated.js
+function Bt(e, t, n, r, i, a, o) {
+	N.setBuffer(e._roots[t]), Vt(0, e, n, r, i, a, o), N.clearBuffer();
+}
+function Vt(e, t, n, r, i, a, o) {
+	let { float32Array: s, uint16Array: c, uint32Array: l } = N, u = e * 2;
+	if (C(u, c)) ht(t, n, r, w(e, l), T(u, c), i, a, o);
+	else {
+		let c = E(e);
+		q(c, s, r, a, o) && Vt(c, t, n, r, i, a, o);
+		let u = D(e, l);
+		q(u, s, r, a, o) && Vt(u, t, n, r, i, a, o);
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/raycastFirst_indirect.generated.js
+var Ht = [
+	"x",
+	"y",
+	"z"
+];
+function Ut(e, t, n, r, i, a) {
+	N.setBuffer(e._roots[t]);
+	let o = Wt(0, e, n, r, i, a);
+	return N.clearBuffer(), o;
+}
+function Wt(e, t, n, r, i, a) {
+	let { float32Array: o, uint16Array: s, uint32Array: c } = N, l = e * 2;
+	if (C(l, s)) return gt(t, n, r, w(e, c), T(l, s), i, a);
+	{
+		let s = O(e, c), l = Ht[s], u = r.direction[l] >= 0, d, f;
+		u ? (d = E(e), f = D(e, c)) : (d = D(e, c), f = E(e));
+		let p = q(d, o, r, i, a) ? Wt(d, t, n, r, i, a) : null;
+		if (p) {
+			let e = p.point[l];
+			if (u ? e <= o[f + s] : e >= o[f + s + 3]) return p;
+		}
+		let m = q(f, o, r, i, a) ? Wt(f, t, n, r, i, a) : null;
+		return p && m ? p.distance <= m.distance ? p : m : p || m || null;
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry_indirect.generated.js
+var Gt = /* @__PURE__ */ new o(), Kt = /* @__PURE__ */ new B(), qt = /* @__PURE__ */ new B(), Jt = /* @__PURE__ */ new u(), Yt = /* @__PURE__ */ new V(), Xt = /* @__PURE__ */ new V();
+function Zt(e, t, n, r) {
+	N.setBuffer(e._roots[t]);
+	let i = Qt(0, e, n, r);
+	return N.clearBuffer(), i;
+}
+function Qt(e, t, n, r, i = null) {
+	let { float32Array: a, uint16Array: o, uint32Array: s } = N, c = e * 2;
+	if (i === null && (n.boundingBox || n.computeBoundingBox(), Yt.set(n.boundingBox.min, n.boundingBox.max, r), i = Yt), C(c, o)) {
+		let i = t.geometry, l = i.index, u = i.attributes.position, d = n.index, f = n.attributes.position, p = w(e, s), m = T(c, o);
+		if (Jt.copy(r).invert(), n.boundsTree) return _(k(e), a, Xt), Xt.matrix.copy(Jt), Xt.needsUpdate = !0, n.boundsTree.shapecast({
+			intersectsBounds: (e) => Xt.intersectsBox(e),
+			intersectsTriangle: (e) => {
+				e.a.applyMatrix4(r), e.b.applyMatrix4(r), e.c.applyMatrix4(r), e.needsUpdate = !0;
+				for (let n = p, r = m + p; n < r; n++) if (K(qt, 3 * t.resolveTriangleIndex(n), l, u), qt.needsUpdate = !0, e.intersectsTriangle(qt)) return !0;
+				return !1;
+			}
+		});
+		{
+			let e = Ie(n);
+			for (let n = p, r = m + p; n < r; n++) {
+				K(Kt, 3 * t.resolveTriangleIndex(n), l, u), Kt.a.applyMatrix4(Jt), Kt.b.applyMatrix4(Jt), Kt.c.applyMatrix4(Jt), Kt.needsUpdate = !0;
+				for (let t = 0, n = e * 3; t < n; t += 3) if (K(qt, t, d, f), qt.needsUpdate = !0, Kt.intersectsTriangle(qt)) return !0;
+			}
+		}
+	} else {
+		let o = E(e), c = D(e, s);
+		return _(k(o), a, Gt), !!(i.intersectsBox(Gt) && Qt(o, t, n, r, i) || (_(k(c), a, Gt), i.intersectsBox(Gt) && Qt(c, t, n, r, i)));
+	}
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry_indirect.generated.js
+var $t = /* @__PURE__ */ new u(), en = /* @__PURE__ */ new V(), tn = /* @__PURE__ */ new V(), nn = /* @__PURE__ */ new t(), rn = /* @__PURE__ */ new t(), an = /* @__PURE__ */ new t(), on = /* @__PURE__ */ new t();
+function sn(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
+	t.boundingBox || t.computeBoundingBox(), en.set(t.boundingBox.min, t.boundingBox.max, n), en.needsUpdate = !0;
+	let s = e.geometry, c = s.attributes.position, l = s.index, u = t.attributes.position, d = t.index, f = H.getPrimitive(), p = H.getPrimitive(), m = nn, h = rn, g = null, _ = null;
+	i && (g = an, _ = on);
+	let v = Infinity, y = null, b = null;
+	return $t.copy(n).invert(), tn.matrix.copy($t), e.shapecast({
+		boundsTraverseOrder: (e) => en.distanceToBox(e),
+		intersectsBounds: (e, t, n) => n < v && n < o ? (t && (tn.min.copy(e.min), tn.max.copy(e.max), tn.needsUpdate = !0), !0) : !1,
+		intersectsRange: (r, i) => {
+			if (t.boundsTree) {
+				let s = t.boundsTree;
+				return s.shapecast({
+					boundsTraverseOrder: (e) => tn.distanceToBox(e),
+					intersectsBounds: (e, t, n) => n < v && n < o,
+					intersectsRange: (t, o) => {
+						for (let x = t, S = t + o; x < S; x++) {
+							K(p, 3 * s.resolveTriangleIndex(x), d, u), p.a.applyMatrix4(n), p.b.applyMatrix4(n), p.c.applyMatrix4(n), p.needsUpdate = !0;
+							for (let t = r, n = r + i; t < n; t++) {
+								K(f, 3 * e.resolveTriangleIndex(t), l, c), f.needsUpdate = !0;
+								let n = f.distanceToTriangle(p, m, g);
+								if (n < v && (h.copy(m), _ && _.copy(g), v = n, y = t, b = x), n < a) return !0;
+							}
+						}
+					}
+				});
+			} else {
+				let o = Ie(t);
+				for (let t = 0, s = o; t < s; t++) {
+					K(p, 3 * t, d, u), p.a.applyMatrix4(n), p.b.applyMatrix4(n), p.c.applyMatrix4(n), p.needsUpdate = !0;
+					for (let n = r, o = r + i; n < o; n++) {
+						K(f, 3 * e.resolveTriangleIndex(n), l, c), f.needsUpdate = !0;
+						let r = f.distanceToTriangle(p, m, g);
+						if (r < v && (h.copy(m), _ && _.copy(g), v = r, y = n, b = t), r < a) return !0;
+					}
+				}
+			}
+		}
+	}), H.releasePrimitive(f), H.releasePrimitive(p), v === Infinity ? null : (r.point ? r.point.copy(h) : r.point = h.clone(), r.distance = v, r.faceIndex = y, i && (i.point ? i.point.copy(_) : i.point = _.clone(), i.point.applyMatrix4($t), h.applyMatrix4($t), i.distance = h.sub(i.point).length(), i.faceIndex = b), r);
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/utils/GeometryRayIntersectUtilities.js
+function cn(e, t, n) {
+	return e === null ? null : (e.point.applyMatrix4(t.matrixWorld), e.distance = e.point.distanceTo(n.ray.origin), e.object = t, e);
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/MeshBVH.js
+var ln = /* @__PURE__ */ new V(), un = /* @__PURE__ */ new n(), dn = /* @__PURE__ */ new t(), fn = /* @__PURE__ */ new u(), pn = /* @__PURE__ */ new t(), mn = [
+	"getX",
+	"getY",
+	"getZ"
+], hn = class e extends Ue {
+	static serialize(e, t = {}) {
+		t = {
+			cloneBuffers: !0,
+			...t
+		};
+		let n = e.geometry, r = e._roots, i = e._indirectBuffer, a = n.getIndex(), o = {
+			version: 1,
+			roots: null,
+			index: null,
+			indirectBuffer: null
+		};
+		return t.cloneBuffers ? (o.roots = r.map((e) => e.slice()), o.index = a ? a.array.slice() : null, o.indirectBuffer = i ? i.slice() : null) : (o.roots = r, o.index = a ? a.array : null, o.indirectBuffer = i), o;
+	}
+	static deserialize(t, n, r = {}) {
+		r = {
+			setIndex: !0,
+			indirect: !!t.indirectBuffer,
+			...r
+		};
+		let { index: i, roots: a, indirectBuffer: o } = t;
+		t.version || (console.warn("MeshBVH.deserialize: Serialization format has been changed and will be fixed up. It is recommended to regenerate any stored serialized data."), c(a));
+		let s = new e(n, {
+			...r,
+			[h]: !0
+		});
+		if (s._roots = a, s._indirectBuffer = o || null, r.setIndex) {
+			let e = n.getIndex();
+			if (e === null) {
+				let e = new l(t.index, 1, !1);
+				n.setIndex(e);
+			} else e.array !== i && (e.array.set(i), e.needsUpdate = !0);
+		}
+		return s;
+		function c(e) {
+			for (let t = 0; t < e.length; t++) {
+				let n = e[t], r = new Uint32Array(n), i = new Uint16Array(n);
+				for (let e = 0, t = n.byteLength / 32; e < t; e++) {
+					let t = 8 * e;
+					C(2 * t, i) || (r[t + 6] = r[t + 6] / 8 - e);
+				}
+			}
+		}
+	}
+	get primitiveStride() {
+		return 3;
+	}
+	get resolveTriangleIndex() {
+		return this.resolvePrimitiveIndex;
+	}
+	constructor(e, t = {}) {
+		t.maxLeafTris && (console.warn("MeshBVH: \"maxLeafTris\" option has been deprecated. Use \"targetLeafSize\", instead."), t = {
+			...t,
+			targetLeafSize: t.maxLeafTris
+		}), super(e, t);
+	}
+	shiftTriangleOffsets(e) {
+		return super.shiftPrimitiveOffsets(e);
+	}
+	writePrimitiveBounds(e, t, n) {
+		let r = this.geometry, i = this._indirectBuffer, a = r.attributes.position, o = r.index ? r.index.array : null, s = (i ? i[e] : e) * 3, c = s + 0, l = s + 1, u = s + 2;
+		o && (c = o[c], l = o[l], u = o[u]);
+		for (let e = 0; e < 3; e++) {
+			let r = a[mn[e]](c), i = a[mn[e]](l), o = a[mn[e]](u), s = r;
+			i < s && (s = i), o < s && (s = o);
+			let d = r;
+			i > d && (d = i), o > d && (d = o), t[n + e] = s, t[n + e + 3] = d;
+		}
+		return t;
+	}
+	computePrimitiveBounds(e, t, n) {
+		let r = this.geometry, i = this._indirectBuffer, a = r.attributes.position, o = r.index ? r.index.array : null, s = a.normalized;
+		if (e < 0 || t + e - n.offset > n.length / 6) throw Error("MeshBVH: compute triangle bounds range is invalid.");
+		let c = a.array, l = a.offset || 0, u = 3;
+		a.isInterleavedBufferAttribute && (u = a.data.stride);
+		let d = [
+			"getX",
+			"getY",
+			"getZ"
+		], f = n.offset;
+		for (let r = e, p = e + t; r < p; r++) {
+			let e = (i ? i[r] : r) * 3, t = (r - f) * 6, p = e + 0, h = e + 1, g = e + 2;
+			o && (p = o[p], h = o[h], g = o[g]), s || (p = p * u + l, h = h * u + l, g = g * u + l);
+			for (let e = 0; e < 3; e++) {
+				let r, i, o;
+				s ? (r = a[d[e]](p), i = a[d[e]](h), o = a[d[e]](g)) : (r = c[p + e], i = c[h + e], o = c[g + e]);
+				let l = r;
+				i < l && (l = i), o < l && (l = o);
+				let u = r;
+				i > u && (u = i), o > u && (u = o);
+				let f = (u - l) / 2, _ = e * 2;
+				n[t + _ + 0] = l + f, n[t + _ + 1] = f + (Math.abs(l) + f) * m;
+			}
+		}
+		return n;
+	}
+	raycastObject3D(e, t, n = []) {
+		let { material: r } = e;
+		if (r === void 0) return;
+		fn.copy(e.matrixWorld).invert(), un.copy(t.ray).applyMatrix4(fn), pn.setFromMatrixScale(e.matrixWorld), dn.copy(un.direction).multiply(pn);
+		let i = dn.length(), a = t.near / i, o = t.far / i;
+		if (t.firstHitOnly === !0) {
+			let i = this.raycastFirst(un, r, a, o);
+			i = cn(i, e, t), i && n.push(i);
+		} else {
+			let i = this.raycast(un, r, a, o);
+			for (let r = 0, a = i.length; r < a; r++) {
+				let a = cn(i[r], e, t);
+				a && n.push(a);
+			}
+		}
+		return n;
+	}
+	refit(e = null) {
+		return (this.indirect ? zt : mt)(this, e);
+	}
+	raycast(e, t = 0, n = 0, r = Infinity) {
+		let i = this._roots, a = [], o = this.indirect ? Bt : vt;
+		for (let s = 0, c = i.length; s < c; s++) o(this, s, t, e, a, n, r);
+		return a;
+	}
+	raycastFirst(e, t = 0, n = 0, r = Infinity) {
+		let i = this._roots, a = null, o = this.indirect ? Ut : xt;
+		for (let s = 0, c = i.length; s < c; s++) {
+			let i = o(this, s, t, e, n, r);
+			i != null && (a == null || i.distance < a.distance) && (a = i);
+		}
+		return a;
+	}
+	intersectsGeometry(e, t) {
+		let n = !1, r = this._roots, i = this.indirect ? Zt : kt;
+		for (let a = 0, o = r.length; a < o && (n = i(this, a, e, t), !n); a++);
+		return n;
+	}
+	shapecast(e) {
+		let t = H.getPrimitive(), n = super.shapecast({
+			...e,
+			intersectsPrimitive: e.intersectsTriangle,
+			scratchPrimitive: t,
+			iterate: this.indirect ? _t : pt
+		});
+		return H.releasePrimitive(t), n;
+	}
+	bvhcast(t, n, r) {
+		let { intersectsRanges: i, intersectsTriangles: a } = r, o = H.getPrimitive(), s = this.geometry.index, c = this.geometry.attributes.position, l = this.indirect ? (e) => {
+			K(o, this.resolveTriangleIndex(e) * 3, s, c);
+		} : (e) => {
+			K(o, e * 3, s, c);
+		}, u = H.getPrimitive(), d = t.geometry.index, f = t.geometry.attributes.position, p = t.indirect ? (e) => {
+			K(u, t.resolveTriangleIndex(e) * 3, d, f);
+		} : (e) => {
+			K(u, e * 3, d, f);
+		};
+		if (a) {
+			if (!(t instanceof e)) throw Error("MeshBVH: \"intersectsTriangles\" callback can only be used with another MeshBVH.");
+			let r = (e, t, r, i, s, c, d, f) => {
+				for (let m = r, h = r + i; m < h; m++) {
+					p(m), u.a.applyMatrix4(n), u.b.applyMatrix4(n), u.c.applyMatrix4(n), u.needsUpdate = !0;
+					for (let n = e, r = e + t; n < r; n++) if (l(n), o.needsUpdate = !0, a(o, u, n, m, s, c, d, f)) return !0;
+				}
+				return !1;
+			};
+			if (i) {
+				let e = i;
+				i = function(t, n, i, a, o, s, c, l) {
+					return e(t, n, i, a, o, s, c, l) ? !0 : r(t, n, i, a, o, s, c, l);
+				};
+			} else i = r;
+		}
+		return super.bvhcast(t, n, { intersectsRanges: i });
+	}
+	intersectsBox(e, t) {
+		return ln.set(e.min, e.max, t), ln.needsUpdate = !0, this.shapecast({
+			intersectsBounds: (e) => ln.intersectsBox(e),
+			intersectsTriangle: (e) => ln.intersectsTriangle(e)
+		});
+	}
+	intersectsSphere(e) {
+		return this.shapecast({
+			intersectsBounds: (t) => e.intersectsBox(t),
+			intersectsTriangle: (t) => t.intersectsSphere(e)
+		});
+	}
+	closestPointToGeometry(e, t, n = {}, r = {}, i = 0, a = Infinity) {
+		return (this.indirect ? sn : Rt)(this, e, t, n, r, i, a);
+	}
+	closestPointToPoint(e, t = {}, n = 0, r = Infinity) {
+		return Ze(this, e, t, n, r);
+	}
+}, J = /* @__PURE__ */ new s(), Y = /* @__PURE__ */ new u(), gn = /* @__PURE__ */ new u(), _n = /* @__PURE__ */ new o(), vn = /* @__PURE__ */ new r(), X = /* @__PURE__ */ new t(), yn = /* @__PURE__ */ new n(), Z = /* @__PURE__ */ new a(), bn = {}, xn = class extends Ne {
+	constructor(e, t = {}) {
+		t = {
+			precise: !1,
+			includeInstances: !0,
+			matrixWorld: Array.isArray(e) ? new u() : e.matrixWorld,
+			targetLeafSize: 1,
+			...t
+		}, super();
+		let n = /* @__PURE__ */ new Set();
+		wn(e, n);
+		let r = Array.from(n), i = Math.ceil(Math.log2(r.length)), a = (1 << i) - 1;
+		this.objects = r, this.idBits = i, this.idMask = a, this.primitiveBuffer = null, this.primitiveBufferStride = 1, this.precise = t.precise, this.includeInstances = t.includeInstances, this.matrixWorld = t.matrixWorld, this.init(t);
+	}
+	getObjectFromId(e) {
+		let { idMask: t, objects: n } = this;
+		return n[Sn(e, t)];
+	}
+	getInstanceFromId(e) {
+		let { idMask: t, idBits: n } = this;
+		return Cn(e, n, t);
+	}
+	init(e) {
+		let { objects: t, idBits: n, matrixWorld: r } = this;
+		gn.copy(r).invert(), this.primitiveBuffer = new Uint32Array(this._countPrimitives(t)), this._fillPrimitiveBuffer(t, n, this.primitiveBuffer), super.init(e);
+	}
+	refit(...e) {
+		gn.copy(this.matrixWorld).invert(), super.refit(...e);
+	}
+	writePrimitiveBounds(e, t, n) {
+		let { primitiveBuffer: r } = this;
+		this._getPrimitiveBoundingBox(r[e], gn, _n);
+		let { min: i, max: a } = _n;
+		t[n + 0] = i.x, t[n + 1] = i.y, t[n + 2] = i.z, t[n + 3] = a.x, t[n + 4] = a.y, t[n + 5] = a.z;
+	}
+	getRootRanges() {
+		return [{
+			offset: 0,
+			count: this.primitiveBuffer.length
+		}];
+	}
+	shapecast(e) {
+		return super.shapecast({
+			...e,
+			intersectsPrimitive: e.intersectsObject,
+			scratchPrimitive: null,
+			iterate: En
+		});
+	}
+	raycast(e, t = []) {
+		let { matrixWorld: n, includeInstances: r } = this, { firstHitOnly: i } = e, a = [];
+		gn.copy(n).invert(), yn.copy(e.ray).applyMatrix4(gn);
+		let o = Infinity, s = null;
+		return this.shapecast({
+			boundsTraverseOrder: (e) => e.distanceToPoint(yn.origin),
+			intersectsBounds: (t) => {
+				if (i) {
+					if (!yn.intersectBox(t, X)) return 0;
+					let r;
+					return t.containsPoint(yn.origin) ? r = 0 : (X.applyMatrix4(n), r = e.ray.origin.distanceTo(X)), r < o ? 1 : 0;
+				} else return yn.intersectsBox(t) ? 1 : 0;
+			},
+			intersectsObject(n, c) {
+				if (n.visible) {
+					if (a.length = 0, n.isInstancedMesh && r) Z.geometry = n.geometry, Z.material = n.material, n.getMatrixAt(c, Z.matrixWorld), Z.matrixWorld.premultiply(n.matrixWorld), Z.raycast(e, a), a.forEach((e) => {
+						e.object = n, e.instanceId = c;
+					}), Z.material = null;
+					else if (n.isBatchedMesh && r) {
+						if (!n.getVisibleAt(c)) return;
+						let t = n.getGeometryIdAt(c), r = n.getGeometryRangeAt(t, bn);
+						J.index = n.geometry.index, J.attributes = n.geometry.attributes, J.setDrawRange(r.start, r.count), Z.geometry = J, Z.material = n.material, n.getMatrixAt(c, Z.matrixWorld), Z.matrixWorld.premultiply(n.matrixWorld), Z.raycast(e, a), a.forEach((e) => {
+							e.object = n, e.batchId = c;
+						}), Z.material = null, J.index = null, J.attributes = null, J.setDrawRange(0, Infinity);
+					} else n.raycast(e, a);
+					i ? a.forEach((e) => {
+						e.distance < o && (o = e.distance, s = e);
+					}) : t.push(...a);
+				}
+			}
+		}), i && s && t.push(s), t;
+	}
+	_getPrimitiveBoundingBox(e, t, n) {
+		let { objects: r, idMask: i, idBits: a, precise: o, includeInstances: s } = this, c = Sn(e, i), l = Cn(e, a, i), u = r[c];
+		if (!s && (u.isInstancedMesh || u.isBatchedMesh)) u.boundingBox || u.computeBoundingBox(), u.boundingSphere || u.computeBoundingSphere(), Y.copy(u.matrixWorld).premultiply(t), vn.copy(u.boundingSphere).applyMatrix4(Y), n.copy(u.boundingBox).applyMatrix4(Y), Dn(n, vn);
+		else if (o) if (u.isInstancedMesh) u.getMatrixAt(l, Y), Y.premultiply(u.matrixWorld).premultiply(t), Tn(u.geometry, Y, n);
+		else if (u.isBatchedMesh) {
+			let e = u.getGeometryIdAt(l), r = u.getGeometryRangeAt(e, bn);
+			J.index = u.geometry.index, J.attributes = u.geometry.attributes, J.setDrawRange(r.start, r.count), u.getMatrixAt(l, Y), Y.premultiply(u.matrixWorld).premultiply(t), Tn(J, Y, n), J.attributes = null;
+		} else Y.copy(u.matrixWorld).premultiply(t), n.setFromObject(u, !0).applyMatrix4(t);
+		else if (u.isInstancedMesh) u.geometry.boundingBox || u.geometry.computeBoundingBox(), u.geometry.boundingSphere || u.geometry.computeBoundingSphere(), u.getMatrixAt(l, Y), Y.premultiply(u.matrixWorld).premultiply(t), vn.copy(u.geometry.boundingSphere).applyMatrix4(Y), n.copy(u.geometry.boundingBox).applyMatrix4(Y), Dn(n, vn);
+		else if (u.isBatchedMesh) {
+			let e = u.getGeometryIdAt(l);
+			u.getMatrixAt(l, Y), Y.premultiply(u.matrixWorld).premultiply(t), u.getBoundingSphereAt(e, vn).applyMatrix4(Y), u.getBoundingBoxAt(e, n).applyMatrix4(Y), Dn(n, vn);
+		} else n.setFromObject(u, !1).applyMatrix4(t);
+	}
+	_countPrimitives(e) {
+		let { includeInstances: t } = this, n = 0;
+		return e.forEach((e) => {
+			if (e.isInstancedMesh && t) n += e.count;
+			else if (e.isBatchedMesh && t) {
+				if (!("instanceCount" in e)) throw Error("ObjectBVH: Three.js revision >= r169 is required to use BatchedMesh.");
+				n += e.instanceCount;
+			} else n++;
+		}), n;
+	}
+	_fillPrimitiveBuffer(e, t, n) {
+		let { includeInstances: r } = this, i = 0;
+		e.forEach((e, a) => {
+			if (e.isInstancedMesh && r) {
+				let r = e.count;
+				for (let e = 0; e < r; e++) n[i] = e << t | a, i++;
+			} else if (e.isBatchedMesh && r) {
+				let { instanceCount: r, maxInstanceCount: o } = e, s = 0, c = 0;
+				for (; s < r && c < o;) {
+					try {
+						e.getVisibleAt(c), n[i] = c << t | a, s++, i++;
+					} catch {}
+					c++;
+				}
+			} else n[i] = a, i++;
+		});
+	}
+};
+function Sn(e, t) {
+	return e & t;
+}
+function Cn(e, t, n) {
+	return (e & ~n) >>> t;
+}
+function wn(e, t = /* @__PURE__ */ new Set()) {
+	Array.isArray(e) ? e.forEach((e) => wn(e, t)) : e.traverse((e) => {
+		(e.isMesh || e.isLine || e.isPoints) && t.add(e);
+	});
+}
+function Tn(e, t, n) {
+	n.makeEmpty();
+	let r = e.drawRange, i = e.index, a = e.attributes.position, o = r.start, s = i ? i.count : a.count, c = Math.min(s - o, r.count);
+	for (let e = o, r = o + c; e < r; e++) {
+		let r = e;
+		i && (r = i.getX(r)), X.fromBufferAttribute(a, r).applyMatrix4(t), n.expandByPoint(X);
+	}
+	return n;
+}
+function En(e, t, n, r, i, a) {
+	let { primitiveBuffer: o, objects: s, idMask: c, idBits: l } = n;
+	for (let n = e, u = t + e; n < u; n++) {
+		let e = o[n], t = Sn(e, c), u = Cn(e, l, c), d = s[t];
+		if (r(d, u, i, a)) return !0;
+	}
+	return !1;
+}
+function Dn(e, t) {
+	X.copy(t.center).addScalar(-t.radius), e.min.max(X), X.copy(t.center).addScalar(t.radius), e.max.min(X);
+}
+//#endregion
+//#region ../../node_modules/three-mesh-bvh/src/core/SkinnedMeshBVH.js
+var On = /* @__PURE__ */ new t(), kn = /* @__PURE__ */ new t(), An = /* @__PURE__ */ new t(), Q = /* @__PURE__ */ new n(), jn = /* @__PURE__ */ new u(), $ = /* @__PURE__ */ new t(), Mn = /* @__PURE__ */ new t(), Nn = [
+	"x",
+	"y",
+	"z"
+], Pn = !0, Fn = !1, In = /* @__PURE__ */ new i(), Ln = /* @__PURE__ */ new i(), Rn = /* @__PURE__ */ new i(), zn = /* @__PURE__ */ new t(), Bn = /* @__PURE__ */ new t(), Vn = /* @__PURE__ */ new t(), Hn = class extends Ue {
+	get primitiveStride() {
+		return 3;
+	}
+	constructor(e, t = {}) {
+		if (!e.isMesh) throw Error("SkinnedMeshBVH: First argument must be a Mesh.");
+		super(e.geometry, {
+			...t,
+			[h]: !0
+		}), this.mesh = e, t[h] || this.init(t);
+	}
+	writePrimitiveBounds(e, t, n) {
+		let { mesh: r, geometry: i } = this, a = this._indirectBuffer, o = i.index ? i.index.array : null, s = (a ? a[e] : e) * 3, c = s + 0, l = s + 1, u = s + 2;
+		o && (c = o[c], l = o[l], u = o[u]), r.getVertexPosition(c, On), r.getVertexPosition(l, kn), r.getVertexPosition(u, An);
+		for (let e = 0; e < 3; e++) {
+			let r = Nn[e], i = On[r], a = kn[r], o = An[r], s = i;
+			a < s && (s = a), o < s && (s = o);
+			let c = i;
+			a > c && (c = a), o > c && (c = o), t[n + e] = s, t[n + e + 3] = c;
+		}
+		return t;
+	}
+	shapecast(e) {
+		let t = new B();
+		return super.shapecast({
+			...e,
+			intersectsPrimitive: e.intersectsTriangle,
+			scratchPrimitive: t,
+			iterate: Un
+		});
+	}
+	raycastObject3D(e, n, r = []) {
+		let { material: a } = e;
+		if (a === void 0) return;
+		let { matrixWorld: o } = e, { firstHitOnly: s } = n;
+		jn.copy(o).invert(), Q.copy(n.ray).applyMatrix4(jn);
+		let c = null, l = Infinity;
+		return this.shapecast({
+			boundsTraverseOrder: (e) => e.distanceToPoint(Q.origin),
+			intersectsBounds: (e) => {
+				if (s) {
+					if (!Q.intersectBox(e, Mn)) return 0;
+					let t;
+					return e.containsPoint(Q.origin) ? t = 0 : (Mn.applyMatrix4(o), t = n.ray.origin.distanceTo(Mn)), t < l ? 1 : 0;
+				} else return Q.intersectsBox(e) ? 1 : 0;
+			},
+			intersectsTriangle: (u, f) => {
+				let p = null;
+				if (p = a.side === 0 ? Q.intersectTriangle(u.a, u.b, u.c, !0, $) : a.side === 1 ? Q.intersectTriangle(u.c, u.b, u.a, !0, $) : Q.intersectTriangle(u.a, u.b, u.c, !1, $), !p) return;
+				p = p.clone().applyMatrix4(o);
+				let m = n.ray.origin.distanceTo(p);
+				if (m >= n.near && m <= n.far) {
+					if (s && m >= l) return;
+					let { geometry: n } = this, { index: a } = n, o = this.resolvePrimitiveIndex(f), h = o * 3, g = h + 0, _ = h + 1, v = h + 2;
+					a && (g = a.array[g], _ = a.array[_], v = a.array[v]);
+					let y = {
+						distance: m,
+						point: p.clone(),
+						object: e,
+						uv: null,
+						uv1: null,
+						normal: null,
+						face: {
+							a: g,
+							b: _,
+							c: v,
+							normal: d.getNormal(u.a, u.b, u.c, new t()),
+							materialIndex: 0
+						},
+						faceIndex: o
+					};
+					if (Pn) {
+						let e = new t();
+						d.getBarycoord($, u.a, u.b, u.c, e), y.barycoord = e;
+					}
+					let b = n.attributes.uv, x = n.attributes.uv1, S = n.attributes.normal;
+					if (b) {
+						In.fromBufferAttribute(b, g), Ln.fromBufferAttribute(b, _), Rn.fromBufferAttribute(b, v), y.uv = new i();
+						let e = d.getInterpolation($, u.a, u.b, u.c, In, Ln, Rn, y.uv);
+						Pn || (y.uv = e);
+					}
+					if (x) {
+						In.fromBufferAttribute(x, g), Ln.fromBufferAttribute(x, _), Rn.fromBufferAttribute(x, v), y.uv1 = new i();
+						let e = d.getInterpolation($, u.a, u.b, u.c, In, Ln, Rn, y.uv1);
+						Pn || (y.uv1 = e), Fn && (y.uv2 = y.uv1);
+					}
+					if (S) {
+						zn.fromBufferAttribute(S, g), Bn.fromBufferAttribute(S, _), Vn.fromBufferAttribute(S, v), y.normal = new t();
+						let e = d.getInterpolation($, u.a, u.b, u.c, zn, Bn, Vn, y.normal);
+						y.normal.dot(Q.direction) > 0 && y.normal.multiplyScalar(-1), Pn || (y.normal = e);
+					}
+					l = y.distance, c = y, s || r.push(y);
+				}
+			}
+		}), s && c && r.push(c), r;
+	}
+};
+function Un(e, t, n, r, i, a, o) {
+	let { mesh: s, geometry: c } = n, l = c.index ? c.index.array : null;
+	for (let c = e, u = t + e; c < u; c++) {
+		let e = n.resolvePrimitiveIndex(c), t = 3 * e + 0, u = 3 * e + 1, d = 3 * e + 2;
+		if (l && (t = l[t], u = l[u], d = l[d]), s.getVertexPosition(t, o.a), s.getVertexPosition(u, o.b), s.getVertexPosition(d, o.c), o.needsUpdate = !0, r(o, c, i, a)) return !0;
+	}
+	return !1;
+}
+//#endregion
+export { B as a, Ne as c, V as i, p as l, xn as n, Ue as o, hn as r, He as s, Hn as t, h as u };
+
+//# sourceMappingURL=src-HhklrVDg.mjs.map