softbox 4.16.1 → 4.18.0

package/dist/ContactShadowBaker-MzqtJ-0h.js

@@ -0,0 +1,2052 @@
+import * as e from "three";
+import { BackSide as t, BatchedMesh as n, Box3 as r, BufferAttribute as i, DoubleSide as a, FrontSide as o, Line as s, Line3 as c, LineLoop as l, LineSegments as u, Matrix4 as d, Mesh as f, Plane as p, Points as m, REVISION as h, Ray as g, Sphere as _, Triangle as v, Vector2 as y, Vector3 as b } from "three";
+//#region src/errors/ThreeViewerError.ts
+var x = class e extends Error {
+	constructor(t, n, r) {
+		super(t), this.code = n, this.context = r, this.name = "ThreeViewerError", this.timestamp = /* @__PURE__ */ new Date(), Error.captureStackTrace && Error.captureStackTrace(this, e);
+	}
+	static fromError(t, n, r) {
+		if (t instanceof e) return t;
+		let i = t instanceof Error ? t.message : String(t), a = {
+			...r,
+			originalError: t instanceof Error ? {
+				name: t.name,
+				message: t.message,
+				stack: t.stack
+			} : t
+		};
+		return new e(i, n, a);
+	}
+}, S = /* @__PURE__ */ function(e) {
+	return e.SCENE_INIT_FAILED = "SCENE_INIT_FAILED", e.RENDERER_INIT_FAILED = "RENDERER_INIT_FAILED", e.RENDERER_NOT_INITIALIZED = "RENDERER_NOT_INITIALIZED", e.CAMERA_INIT_FAILED = "CAMERA_INIT_FAILED", e.WEBGL_NOT_SUPPORTED = "WEBGL_NOT_SUPPORTED", e.INITIALIZATION_FAILED = "INITIALIZATION_FAILED", e.PATH_TRACING_INIT_FAILED = "PATH_TRACING_INIT_FAILED", e.MODEL_LOAD_FAILED = "MODEL_LOAD_FAILED", e.TEXTURE_LOAD_FAILED = "TEXTURE_LOAD_FAILED", e.RESOURCE_NOT_FOUND = "RESOURCE_NOT_FOUND", e.UNSUPPORTED_FORMAT = "UNSUPPORTED_FORMAT", e.INVALID_CONFIGURATION = "INVALID_CONFIGURATION", e.RENDER_ERROR = "RENDER_ERROR", e.RENDER_FAILED = "RENDER_FAILED", e.SCENE_OPERATION_FAILED = "SCENE_OPERATION_FAILED", e.COMPONENT_NOT_MOUNTED = "COMPONENT_NOT_MOUNTED", e.INVALID_STATE = "INVALID_STATE", e.INVALID_PARAMETER = "INVALID_PARAMETER", e.OPERATION_FAILED = "OPERATION_FAILED", e.UNKNOWN = "UNKNOWN", e;
+}({}), C = {
+	ok(e) {
+		return {
+			ok: !0,
+			value: e
+		};
+	},
+	err(e) {
+		return {
+			ok: !1,
+			error: e
+		};
+	},
+	wrap(e) {
+		try {
+			return C.ok(e());
+		} catch (e) {
+			return C.err(e instanceof x ? e : new x(String(e), S.UNKNOWN, { originalError: e }));
+		}
+	}
+}, w = class {
+	constructor() {
+		this.listeners = /* @__PURE__ */ new Map();
+	}
+	on(e, t) {
+		this.listeners.has(e) || this.listeners.set(e, /* @__PURE__ */ new Set());
+		let n = this.listeners.get(e);
+		return n && n.add(t), () => {
+			this.listeners.get(e)?.delete(t);
+		};
+	}
+	emit(e, t) {
+		this.listeners.get(e)?.forEach((n) => {
+			try {
+				n(t);
+			} catch (t) {
+				console.error(`Error in event listener for ${String(e)}:`, t);
+			}
+		});
+	}
+	once(e, t) {
+		let n = this.on(e, (e) => {
+			n(), t(e);
+		});
+		return n;
+	}
+	removeAllListeners(e) {
+		e ? this.listeners.delete(e) : this.listeners.clear();
+	}
+	listenerCount(e) {
+		return this.listeners.get(e)?.size || 0;
+	}
+	off(e, t) {
+		this.listeners.get(e)?.delete(t);
+	}
+	removeListener(e, t) {
+		this.off(e, t);
+	}
+}, T = {
+	meters: 1,
+	centimeters: .01,
+	millimeters: .001,
+	feet: .3048,
+	inches: .0254
+}, ee = "softbox-units-scale", te = 1.25, E = 65535, ne = E << 16, re = 2 ** -24, D = Symbol("SKIP_GENERATION"), ie = {
+	strategy: 0,
+	maxDepth: 40,
+	targetLeafSize: 10,
+	useSharedArrayBuffer: !1,
+	setBoundingBox: !0,
+	onProgress: null,
+	indirect: !1,
+	verbose: !0,
+	range: null,
+	[D]: !1
+};
+//#endregion
+//#region node_modules/three-mesh-bvh/src/utils/ArrayBoxUtilities.js
+function O(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 ae(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 oe(e, t) {
+	t.set(e);
+}
+function se(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 ce(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 le(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 k(e, t) {
+	return t[e + 15] === E;
+}
+function A(e, t) {
+	return t[e + 6];
+}
+function j(e, t) {
+	return t[e + 14];
+}
+function M(e) {
+	return e + 8;
+}
+function N(e, t) {
+	return e + t[e + 6] * 8;
+}
+function ue(e, t) {
+	return t[e + 7];
+}
+function P(e) {
+	return e;
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/build/computeBoundsUtils.js
+function de(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 F = 32, fe = (e, t) => e.candidate - t.candidate, I = /* @__PURE__ */ Array(F).fill().map(() => ({
+	count: 0,
+	bounds: /* @__PURE__ */ new Float32Array(6),
+	rightCacheBounds: /* @__PURE__ */ new Float32Array(6),
+	leftCacheBounds: /* @__PURE__ */ new Float32Array(6),
+	candidate: 0
+})), pe = /* @__PURE__ */ new Float32Array(6);
+function me(e, t, n, r, i, a) {
+	let o = -1, s = 0;
+	if (a === 0) o = ae(t), o !== -1 && (s = (t[o] + t[o + 3]) / 2);
+	else if (a === 1) o = ae(e), o !== -1 && (s = he(n, r, i, o));
+	else if (a === 2) {
+		let a = le(e), c = te * 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) / F;
+			if (i < F / 4) {
+				let t = [...I];
+				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;
+					ce(i, n, o);
+				}
+				t.sort(fe);
+				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 ? ce(r, n, a.rightCacheBounds) : (ce(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, f = r.rightCacheBounds, p = 0;
+					l !== 0 && (p = le(d) / a);
+					let m = 0;
+					u !== 0 && (m = le(f) / a);
+					let h = 1 + te * (p * l + m * u);
+					h < c && (o = e, c = h, s = r.candidate);
+				}
+			} else {
+				for (let e = 0; e < F; e++) {
+					let t = I[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 >= F && (i = F - 1);
+					let a = I[i];
+					a.count++, ce(t, n, a.bounds);
+				}
+				let t = I[F - 1];
+				oe(t.bounds, t.rightCacheBounds);
+				for (let e = F - 2; e >= 0; e--) {
+					let t = I[e], n = I[e + 1];
+					se(t.bounds, n.rightCacheBounds, t.rightCacheBounds);
+				}
+				let f = 0;
+				for (let t = 0; t < F - 1; t++) {
+					let n = I[t], r = n.count, l = n.bounds, u = I[t + 1].rightCacheBounds;
+					r !== 0 && (f === 0 ? oe(l, pe) : se(l, pe, pe)), f += r;
+					let d = 0, p = 0;
+					f !== 0 && (d = le(pe) / a);
+					let m = i - f;
+					m !== 0 && (p = le(u) / a);
+					let h = 1 + te * (d * f + p * m);
+					h < c && (o = e, c = h, s = n.candidate);
+				}
+			}
+		}
+	} else console.warn(`BVH: Invalid build strategy value ${a} used.`);
+	return {
+		axis: o,
+		pos: s
+	};
+}
+function he(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 ge = class {
+	constructor() {
+		this.boundingData = /* @__PURE__ */ new Float32Array(6);
+	}
+};
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/build/sortUtils.js
+function _e(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 ve, ye, be, xe, Se = 2 ** 32;
+function Ce(e) {
+	return "count" in e ? 1 : 1 + Ce(e.left) + Ce(e.right);
+}
+function we(e, t, n) {
+	return ve = new Float32Array(n), ye = new Uint32Array(n), be = new Uint16Array(n), xe = new Uint8Array(n), Te(e, t);
+}
+function Te(e, t) {
+	let n = e / 4, r = e / 2, i = "count" in t, a = t.boundingData;
+	for (let e = 0; e < 6; e++) ve[n + e] = a[e];
+	if (i) return t.buffer ? (xe.set(new Uint8Array(t.buffer), e), e + t.buffer.byteLength) : (ye[n + 6] = t.offset, be[r + 14] = t.count, be[r + 15] = E, e + 32);
+	{
+		let { left: r, right: i, splitAxis: a } = t, o = Te(e + 32, r), s = e / 32, c = o / 32 - s;
+		if (c > Se) throw Error("MeshBVH: Cannot store relative child node offset greater than 32 bits.");
+		return ye[n + 6] = c, ye[n + 7] = a, Te(o, i);
+	}
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/build/buildTree.js
+function Ee(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 = /* @__PURE__ */ new Float32Array(6), h = !1, g = new ge();
+	return de(t, n, r, g.boundingData, m), v(g, n, r, m), g;
+	function _(e) {
+		d && d((e - a.offset) / a.count);
+	}
+	function v(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 = me(e.boundingData, i, t, n, r, u), y = g.axis === -1 ? -1 : _e(f, p, t, n, r, g);
+		if (g.axis === -1 || y === n || y === n + r) {
+			if (!d) return _(n + r), e.offset = n, e.count = r, e;
+			g.axis = Math.max(0, ae(e.boundingData)), y = n + Math.max(1, Math.floor(r / 2));
+		}
+		e.splitAxis = g.axis;
+		let b = new ge(), x = n, S = y - n;
+		e.left = b, de(t, x, S, b.boundingData, m), v(b, x, S, m, a + 1);
+		let C = new ge(), w = y, T = r - S;
+		return e.right = C, de(t, w, T, C.boundingData, m), v(C, w, T, m, a + 1), e;
+	}
+}
+function De(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 = Ee(e, s, r.offset, r.count, t, o), a = Ce(i), c = new n(32 * a);
+		return we(0, i, c), c;
+	});
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/utils/PrimitivePool.js
+var Oe = 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);
+	}
+}, L = /* @__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());
+		};
+	}
+}(), R, ke, Ae = [], je = /* @__PURE__ */ new Oe(() => new r());
+function Me(e, t, n, r, i, a) {
+	R = je.getPrimitive(), ke = je.getPrimitive(), Ae.push(R, ke), L.setBuffer(e._roots[t]);
+	let o = Ne(0, e.geometry, n, r, i, a);
+	L.clearBuffer(), je.releasePrimitive(R), je.releasePrimitive(ke), Ae.pop(), Ae.pop();
+	let s = Ae.length;
+	return s > 0 && (ke = Ae[s - 1], R = Ae[s - 2]), o;
+}
+function Ne(e, t, n, r, i = null, a = 0, o = 0) {
+	let { float32Array: s, uint16Array: c, uint32Array: l } = L, u = e * 2;
+	if (k(u, c)) {
+		let t = A(e, l), n = j(u, c);
+		return O(P(e), s, R), r(t, n, !1, o, a + e / 8, R);
+	} else {
+		let u = M(e), d = N(e, l), f = u, p = d, m, h, g, _;
+		if (i && (g = R, _ = ke, O(P(f), s, g), O(P(p), s, _), m = i(g), h = i(_), h < m)) {
+			f = d, p = u;
+			let e = m;
+			m = h, h = e, g = _;
+		}
+		g || (g = R, O(P(f), s, g));
+		let v = k(f * 2, c), y = n(g, v, m, o + 1, a + f / 8), b;
+		if (y === 2) {
+			let e = w(f);
+			b = r(e, T(f) - e, !0, o + 1, a + f / 8, g);
+		} else b = y && Ne(f, t, n, r, i, a, o + 1);
+		if (b) return !0;
+		_ = ke, O(P(p), s, _);
+		let x = k(p * 2, c), S = n(_, x, h, o + 1, a + p / 8), C;
+		if (S === 2) {
+			let e = w(p);
+			C = r(e, T(p) - e, !0, o + 1, a + p / 8, _);
+		} else C = S && Ne(p, t, n, r, i, a, o + 1);
+		if (C) return !0;
+		return !1;
+		function w(e) {
+			let { uint16Array: t, uint32Array: n } = L, r = e * 2;
+			for (; !k(r, t);) e = M(e), r = e * 2;
+			return A(e, n);
+		}
+		function T(e) {
+			let { uint16Array: t, uint32Array: n } = L, r = e * 2;
+			for (; !k(r, t);) e = N(e, n), r = e * 2;
+			return A(e, n) + j(r, t);
+		}
+	}
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/cast/bvhcast.js
+var Pe = /* @__PURE__ */ new L.constructor(), Fe = /* @__PURE__ */ new L.constructor(), z = /* @__PURE__ */ new Oe(() => new r()), B = /* @__PURE__ */ new r(), Ie = /* @__PURE__ */ new r(), Le = /* @__PURE__ */ new r(), Re = /* @__PURE__ */ new r(), ze = !1;
+function Be(e, t, n, r) {
+	if (ze) throw Error("MeshBVH: Recursive calls to bvhcast not supported.");
+	ze = !0;
+	let i = e._roots, a = t._roots, o, s = 0, c = 0, l = new d().copy(n).invert();
+	for (let e = 0, t = i.length; e < t; e++) {
+		Pe.setBuffer(i[e]), c = 0;
+		let t = z.getPrimitive();
+		O(P(0), Pe.float32Array, t), t.applyMatrix4(l);
+		for (let e = 0, i = a.length; e < i && (Fe.setBuffer(a[e]), o = V(0, 0, n, l, r, s, c, 0, 0, t), Fe.clearBuffer(), c += a[e].byteLength / 32, !o); e++);
+		if (z.releasePrimitive(t), Pe.clearBuffer(), s += i[e].byteLength / 32, o) break;
+	}
+	return ze = !1, o;
+}
+function V(e, t, n, r, i, a = 0, o = 0, s = 0, c = 0, l = null, u = !1) {
+	let d, f;
+	u ? (d = Fe, f = Pe) : (d = Pe, f = Fe);
+	let p = d.float32Array, m = d.uint32Array, h = d.uint16Array, g = f.float32Array, _ = f.uint32Array, v = f.uint16Array, y = e * 2, b = t * 2, x = k(y, h), S = k(b, v), C = !1;
+	if (S && x) C = u ? i(A(t, _), j(t * 2, v), A(e, m), j(e * 2, h), c, o + t / 8, s, a + e / 8) : i(A(e, m), j(e * 2, h), A(t, _), j(t * 2, v), s, a + e / 8, c, o + t / 8);
+	else if (S) {
+		let l = z.getPrimitive();
+		O(P(t), g, l), l.applyMatrix4(n);
+		let d = M(e), f = N(e, m);
+		O(P(d), p, B), O(P(f), p, Ie);
+		let h = l.intersectsBox(B), _ = l.intersectsBox(Ie);
+		C = h && V(t, d, r, n, i, o, a, c, s + 1, l, !u) || _ && V(t, f, r, n, i, o, a, c, s + 1, l, !u), z.releasePrimitive(l);
+	} else {
+		let d = M(t), f = N(t, _);
+		O(P(d), g, Le), O(P(f), g, Re);
+		let h = l.intersectsBox(Le), v = l.intersectsBox(Re);
+		if (h && v) C = V(e, d, n, r, i, a, o, s, c + 1, l, u) || V(e, f, n, r, i, a, o, s, c + 1, l, u);
+		else if (h) if (x) C = V(e, d, n, r, i, a, o, s, c + 1, l, u);
+		else {
+			let t = z.getPrimitive();
+			t.copy(Le).applyMatrix4(n);
+			let l = M(e), f = N(e, m);
+			O(P(l), p, B), O(P(f), p, Ie);
+			let h = t.intersectsBox(B), g = t.intersectsBox(Ie);
+			C = h && V(d, l, r, n, i, o, a, c, s + 1, t, !u) || g && V(d, f, r, n, i, o, a, c, s + 1, t, !u), z.releasePrimitive(t);
+		}
+		else if (v) if (x) C = V(e, f, n, r, i, a, o, s, c + 1, l, u);
+		else {
+			let t = z.getPrimitive();
+			t.copy(Re).applyMatrix4(n);
+			let l = M(e), d = N(e, m);
+			O(P(l), p, B), O(P(d), p, Ie);
+			let h = t.intersectsBox(B), g = t.intersectsBox(Ie);
+			C = h && V(f, l, r, n, i, o, a, c, s + 1, t, !u) || g && V(f, d, r, n, i, o, a, c, s + 1, t, !u), z.releasePrimitive(t);
+		}
+	}
+	return C;
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/BVHTraversalHelper.js
+var Ve = 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 (; !k(r, n);) e = M(e), r = e * 2;
+			return A(e, t);
+		}, this.getRangeEnd = (e) => {
+			let r = e * 2;
+			for (; !k(r, n);) e = N(e, t), r = e * 2;
+			return A(e, t) + j(r, n);
+		};
+		let i = (e, r, a) => {
+			let o = k(r * 2, n);
+			if (!e(a, o, r) && !o) {
+				let n = M(r), o = N(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 = ue(o, t);
+					return r(i, a, new Float32Array(e, o * 4, 6), n);
+				}
+			});
+		};
+	}
+}(), He = /* @__PURE__ */ new r(), Ue = /* @__PURE__ */ new Float32Array(6), We = class {
+	constructor() {
+		this._roots = null, this.primitiveBuffer = null, this.primitiveBufferStride = null;
+	}
+	init(e) {
+		e = {
+			...ie,
+			...e
+		}, "maxLeafSize" in e && (console.warn("BVH: \"maxLeafSize\" option has been deprecated. Use \"targetLeafSize\", instead."), e = {
+			...e,
+			targetLeafSize: e.maxLeafSize
+		}), De(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, Ue, 0);
+			let [e, t, r, u, d, f] = Ue;
+			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, Ue, 0);
+			let [e, t, a, o, s, c] = Ue, l = (e + o) / 2, u = (t + s) / 2, d = (a + c) / 2, f = (o - e) / 2, p = (s - t) / 2, m = (c - a) / 2, h = (i - r) * 6;
+			n[h + 0] = l, n[h + 1] = f + (Math.abs(l) + f) * re, n[h + 2] = u, n[h + 3] = p + (Math.abs(u) + p) * re, n[h + 4] = d, n[h + 5] = m + (Math.abs(d) + m) * re;
+		}
+		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;
+					k(2 * n, a) && (i[n + 6] += e);
+				}
+			}
+		}
+	}
+	traverse(e, t = 0) {
+		Ve.setBVH(this, t), Ve.traverse(e), Ve.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 (k(n, i)) {
+					let e = A(t, r), o = j(n, i);
+					this.writePrimitiveRangeBounds(e, o, Ue, 0), a.set(Ue, t);
+				} else {
+					let e = M(t), n = N(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) => {
+			O(0, new Float32Array(t), He), e.union(He);
+		}), 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 = Me(this, e, n, r, t, c), s) break;
+			c += i.byteLength / 32;
+		}
+		return s;
+	}
+	bvhcast(e, t, n) {
+		let { intersectsRanges: r } = n;
+		return Be(this, e, t, r);
+	}
+};
+//#endregion
+//#region node_modules/three-mesh-bvh/src/utils/BufferUtils.js
+function Ge() {
+	return typeof SharedArrayBuffer < "u";
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/build/geometryUtils.js
+function Ke(e) {
+	return e.index ? e.index.count : e.attributes.position.count;
+}
+function qe(e) {
+	return Ke(e) / 3;
+}
+function Je(e, t = ArrayBuffer) {
+	return e > 65535 ? new Uint32Array(new t(4 * e)) : new Uint16Array(new t(2 * e));
+}
+function Ye(e, t) {
+	if (!e.index) {
+		let n = e.attributes.position.count, r = Je(n, t.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer);
+		e.setIndex(new i(r, 1));
+		for (let e = 0; e < n; e++) r[e] = e;
+	}
+}
+function Xe(e, t, n) {
+	let r = Ke(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 Ze(e, t) {
+	return e.groups.map((e) => ({
+		offset: e.start / t,
+		count: e.count / t
+	}));
+}
+function Qe(e, t, n) {
+	let r = Xe(e, t, n), i = Ze(e, n);
+	if (!i.length) return [r];
+	let a = [], o = r.offset, s = r.offset + r.count, c = Ke(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 $e(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 et = class extends We {
+	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 && !Ge()) 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 = {
+			...ie,
+			...t
+		}, t[D] || this.init(t);
+	}
+	init(e) {
+		let { geometry: t, primitiveStride: n } = this;
+		if (e.indirect) {
+			let r = $e(Qe(t, e.range, n), e.useSharedArrayBuffer);
+			this._indirectBuffer = r;
+		} else Ye(t, e);
+		super.init(e), !t.boundingBox && e.setBoundingBox && (t.boundingBox = this.getBoundingBox(new r()));
+	}
+	getRootRanges(e) {
+		return this.indirect ? [{
+			offset: 0,
+			count: this._indirectBuffer.length
+		}] : Qe(this.geometry, e, this.primitiveStride);
+	}
+	raycastObject3D() {
+		throw Error("BVH: raycastObject3D() not implemented");
+	}
+}, H = 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;
+	}
+};
+H.prototype.setFromBox = (function() {
+	let e = /* @__PURE__ */ new b();
+	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;
+	};
+})();
+//#endregion
+//#region node_modules/three-mesh-bvh/src/math/MathUtilities.js
+var tt = (function() {
+	let e = /* @__PURE__ */ new b(), t = /* @__PURE__ */ new b(), n = /* @__PURE__ */ new b();
+	return function(r, i, a) {
+		let o = r.start, s = e, c = i.start, l = t;
+		n.subVectors(o, c), e.subVectors(r.end, r.start), t.subVectors(i.end, i.start);
+		let u = n.dot(l), d = l.dot(s), f = l.dot(l), p = n.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;
+	};
+})(), nt = (function() {
+	let e = /* @__PURE__ */ new y(), t = /* @__PURE__ */ new b(), n = /* @__PURE__ */ new b();
+	return function(r, i, a, o) {
+		tt(r, i, e);
+		let s = e.x, c = e.y;
+		if (s >= 0 && s <= 1 && c >= 0 && c <= 1) {
+			r.at(s, a), i.at(c, o);
+			return;
+		} else if (s >= 0 && s <= 1) {
+			c < 0 ? i.at(0, o) : i.at(1, o), r.closestPointToPoint(o, !0, a);
+			return;
+		} else if (c >= 0 && c <= 1) {
+			s < 0 ? r.at(0, a) : r.at(1, a), i.closestPointToPoint(a, !0, o);
+			return;
+		} else {
+			let e;
+			e = s < 0 ? r.start : r.end;
+			let l;
+			l = c < 0 ? i.start : i.end;
+			let u = t, d = n;
+			if (r.closestPointToPoint(l, !0, t), i.closestPointToPoint(e, !0, n), u.distanceToSquared(l) <= d.distanceToSquared(e)) {
+				a.copy(u), o.copy(l);
+				return;
+			} else {
+				a.copy(e), o.copy(d);
+				return;
+			}
+		}
+	};
+})(), rt = (function() {
+	let e = /* @__PURE__ */ new b(), t = /* @__PURE__ */ new b(), n = /* @__PURE__ */ new p(), r = /* @__PURE__ */ new c();
+	return function(i, a) {
+		let { radius: o, center: s } = i, { a: c, b: l, c: u } = a;
+		if (r.start = c, r.end = l, r.closestPointToPoint(s, !0, e).distanceTo(s) <= o || (r.start = c, r.end = u, r.closestPointToPoint(s, !0, e).distanceTo(s) <= o) || (r.start = l, r.end = u, r.closestPointToPoint(s, !0, e).distanceTo(s) <= o)) return !0;
+		let d = a.getPlane(n);
+		if (Math.abs(d.distanceToPoint(s)) <= o) {
+			let e = d.projectPoint(s, t);
+			if (a.containsPoint(e)) return !0;
+		}
+		return !1;
+	};
+})(), it = [
+	"x",
+	"y",
+	"z"
+], U = 1e-15, at = U * U;
+function W(e) {
+	return Math.abs(e) < U;
+}
+var G = class extends v {
+	constructor(...e) {
+		super(...e), this.isExtendedTriangle = !0, this.satAxes = [
+			,
+			,
+			,
+			,
+		].fill().map(() => new b()), this.satBounds = [
+			,
+			,
+			,
+			,
+		].fill().map(() => new H()), this.points = [
+			this.a,
+			this.b,
+			this.c
+		], this.plane = new p(), this.isDegenerateIntoSegment = !1, this.isDegenerateIntoPoint = !1, this.degenerateSegment = new c(), this.needsUpdate = !0;
+	}
+	intersectsSphere(e) {
+		return rt(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 < U ? h < U || g < U ? this.isDegenerateIntoPoint = !0 : (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(e), this.degenerateSegment.end.copy(n)) : h < U ? g < U ? this.isDegenerateIntoPoint = !0 : (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(t), this.degenerateSegment.end.copy(e)) : g < U && (this.isDegenerateIntoSegment = !0, this.degenerateSegment.start.copy(n), this.degenerateSegment.end.copy(t)), this.plane.setFromNormalAndCoplanarPoint(o, e), this.needsUpdate = !1;
+	}
+};
+G.prototype.closestPointToSegment = (function() {
+	let e = /* @__PURE__ */ new b(), t = /* @__PURE__ */ new b(), n = /* @__PURE__ */ new c();
+	return function(r, i = null, a = null) {
+		let { start: o, end: s } = r, c = this.points, l, u = Infinity;
+		for (let o = 0; o < 3; o++) {
+			let s = (o + 1) % 3;
+			n.start.copy(c[o]), n.end.copy(c[s]), nt(n, r, e, t), l = e.distanceToSquared(t), l < u && (u = l, i && i.copy(e), a && a.copy(t));
+		}
+		return this.closestPointToPoint(o, e), l = o.distanceToSquared(e), l < u && (u = l, i && i.copy(e), a && a.copy(o)), this.closestPointToPoint(s, e), l = s.distanceToSquared(e), l < u && (u = l, i && i.copy(e), a && a.copy(s)), Math.sqrt(u);
+	};
+})(), G.prototype.intersectsTriangle = (function() {
+	let e = /* @__PURE__ */ new G(), t = /* @__PURE__ */ new H(), n = /* @__PURE__ */ new H(), r = /* @__PURE__ */ new b(), i = /* @__PURE__ */ new b(), a = /* @__PURE__ */ new b(), o = /* @__PURE__ */ new b(), s = /* @__PURE__ */ new c(), l = /* @__PURE__ */ new c(), u = /* @__PURE__ */ new b(), d = /* @__PURE__ */ new y(), f = /* @__PURE__ */ new y();
+	function p(e, i, a, s) {
+		let c = r;
+		!e.isDegenerateIntoPoint && !e.isDegenerateIntoSegment ? c.copy(e.plane.normal) : c.copy(i.plane.normal);
+		let l = e.satBounds, u = e.satAxes;
+		for (let r = 1; r < 4; r++) {
+			let a = l[r], s = u[r];
+			if (t.setFromPoints(s, i.points), a.isSeparated(t) || (o.copy(c).cross(s), t.setFromPoints(o, e.points), n.setFromPoints(o, i.points), t.isSeparated(n))) return !1;
+		}
+		let d = i.satBounds, f = i.satAxes;
+		for (let r = 1; r < 4; r++) {
+			let a = d[r], s = f[r];
+			if (t.setFromPoints(s, e.points), a.isSeparated(t) || (o.crossVectors(c, s), t.setFromPoints(o, e.points), n.setFromPoints(o, i.points), t.isSeparated(n))) return !1;
+		}
+		return a && (s || console.warn("ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0."), a.start.set(0, 0, 0), a.end.set(0, 0, 0)), !0;
+	}
+	function m(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 h(e, t, n, r, i, a, o, s, c, l, u) {
+		if (i > 0) m(e.c, e.a, e.b, r, t, n, c, o, s, l, u);
+		else if (a > 0) m(e.b, e.a, e.c, n, t, r, s, o, c, l, u);
+		else if (s * c > 0 || o != 0) m(e.a, e.b, e.c, t, n, r, o, s, c, l, u);
+		else if (s != 0) m(e.b, e.a, e.c, n, t, r, s, o, c, l, u);
+		else if (c != 0) m(e.c, e.a, e.b, r, t, n, c, o, s, l, u);
+		else return !0;
+		return !1;
+	}
+	function g(e, t, n, i) {
+		let a = t.degenerateSegment, o = e.plane.distanceToPoint(a.start), s = e.plane.distanceToPoint(a.end);
+		return W(o) ? W(s) ? p(e, t, n, i) : (n && (n.start.copy(a.start), n.end.copy(a.start)), e.containsPoint(a.start)) : W(s) ? (n && (n.start.copy(a.end), n.end.copy(a.end)), e.containsPoint(a.end)) : e.plane.intersectLine(a, r) == null ? !1 : (n && (n.start.copy(r), n.end.copy(r)), e.containsPoint(r));
+	}
+	function _(e, t, n) {
+		let r = t.a;
+		return W(e.plane.distanceToPoint(r)) && e.containsPoint(r) ? (n && (n.start.copy(r), n.end.copy(r)), !0) : !1;
+	}
+	function v(e, t, n) {
+		let i = e.degenerateSegment, a = t.a;
+		return i.closestPointToPoint(a, !0, r), a.distanceToSquared(r) < at ? (n && (n.start.copy(a), n.end.copy(a)), !0) : !1;
+	}
+	function x(e, t, n, o) {
+		if (e.isDegenerateIntoSegment) if (t.isDegenerateIntoSegment) {
+			let o = e.degenerateSegment, s = t.degenerateSegment, c = i, l = a;
+			o.delta(c), s.delta(l);
+			let u = r.subVectors(s.start, o.start), d = c.x * l.y - c.y * l.x;
+			if (W(d)) return !1;
+			let f = (u.x * l.y - u.y * l.x) / d, p = -(c.x * u.y - c.y * u.x) / d;
+			return f < 0 || f > 1 || p < 0 || p > 1 ? !1 : W(o.start.z + c.z * f - (s.start.z + l.z * p)) ? (n && (n.start.copy(o.start).addScaledVector(c, f), n.end.copy(o.start).addScaledVector(c, f)), !0) : !1;
+		} else if (t.isDegenerateIntoPoint) return v(e, t, n);
+		else return g(t, e, n, o);
+		else if (e.isDegenerateIntoPoint) return t.isDegenerateIntoPoint ? t.a.distanceToSquared(e.a) < at ? (n && (n.start.copy(e.a), n.end.copy(e.a)), !0) : !1 : t.isDegenerateIntoSegment ? v(t, e, n) : _(t, e, n);
+		else if (t.isDegenerateIntoPoint) return _(e, t, n);
+		else if (t.isDegenerateIntoSegment) return g(e, t, n, o);
+	}
+	return function(t, n = null, r = !1) {
+		this.needsUpdate && this.update(), t.isExtendedTriangle ? t.needsUpdate && t.update() : (e.copy(t), e.update(), t = e);
+		let o = x(this, t, n, r);
+		if (o !== void 0) return o;
+		let c = this.plane, m = t.plane, g = m.distanceToPoint(this.a), _ = m.distanceToPoint(this.b), v = m.distanceToPoint(this.c);
+		W(g) && (g = 0), W(_) && (_ = 0), W(v) && (v = 0);
+		let y = g * _, b = g * v;
+		if (y > 0 && b > 0) return !1;
+		let S = c.distanceToPoint(t.a), C = c.distanceToPoint(t.b), w = c.distanceToPoint(t.c);
+		W(S) && (S = 0), W(C) && (C = 0), W(w) && (w = 0);
+		let T = S * C, ee = S * w;
+		if (T > 0 && ee > 0) return !1;
+		i.copy(c.normal), a.copy(m.normal);
+		let te = i.cross(a), E = 0, ne = Math.abs(te.x), re = Math.abs(te.y);
+		re > ne && (ne = re, E = 1), Math.abs(te.z) > ne && (E = 2);
+		let D = it[E], ie = this.a[D], O = this.b[D], ae = this.c[D], oe = t.a[D], se = t.b[D], ce = t.c[D];
+		if (h(this, ie, O, ae, y, b, g, _, v, d, s) || h(t, oe, se, ce, T, ee, S, C, w, f, l)) return p(this, t, n, r);
+		if (d.y < d.x) {
+			let e = d.y;
+			d.y = d.x, d.x = e, u.copy(s.start), s.start.copy(s.end), s.end.copy(u);
+		}
+		if (f.y < f.x) {
+			let e = f.y;
+			f.y = f.x, f.x = e, u.copy(l.start), l.start.copy(l.end), l.end.copy(u);
+		}
+		return d.y < f.x || f.y < d.x ? !1 : (n && (f.x > d.x ? n.start.copy(l.start) : n.start.copy(s.start), f.y < d.y ? n.end.copy(l.end) : n.end.copy(s.end)), !0);
+	};
+})(), G.prototype.distanceToPoint = (function() {
+	let e = /* @__PURE__ */ new b();
+	return function(t) {
+		return this.closestPointToPoint(t, e), t.distanceTo(e);
+	};
+})(), G.prototype.distanceToTriangle = (function() {
+	let e = /* @__PURE__ */ new b(), t = /* @__PURE__ */ new b(), n = [
+		"a",
+		"b",
+		"c"
+	], r = /* @__PURE__ */ new c(), i = /* @__PURE__ */ new c();
+	return function(a, o = null, s = null) {
+		let c = o || s ? r : null;
+		if (this.intersectsTriangle(a, c, !0)) return (o || s) && (o && c.getCenter(o), s && c.getCenter(s)), 0;
+		let l = Infinity;
+		for (let t = 0; t < 3; t++) {
+			let r, i = n[t], c = a[i];
+			this.closestPointToPoint(c, e), r = c.distanceToSquared(e), r < l && (l = r, o && o.copy(e), s && s.copy(c));
+			let u = this[i];
+			a.closestPointToPoint(u, e), r = u.distanceToSquared(e), r < l && (l = r, o && o.copy(u), s && s.copy(e));
+		}
+		for (let c = 0; c < 3; c++) {
+			let u = n[c], d = n[(c + 1) % 3];
+			r.set(this[u], this[d]);
+			for (let c = 0; c < 3; c++) {
+				let u = n[c], d = n[(c + 1) % 3];
+				i.set(a[u], a[d]), nt(r, i, e, t);
+				let f = e.distanceToSquared(t);
+				f < l && (l = f, o && o.copy(e), s && s.copy(t));
+			}
+		}
+		return Math.sqrt(l);
+	};
+})();
+//#endregion
+//#region node_modules/three-mesh-bvh/src/math/OrientedBox.js
+var K = class {
+	constructor(e, t, n) {
+		this.isOrientedBox = !0, this.min = new b(), this.max = new b(), this.matrix = new d(), this.invMatrix = new d(), this.points = Array(8).fill().map(() => new b()), this.satAxes = [
+			,
+			,
+			,
+		].fill().map(() => new b()), this.satBounds = [
+			,
+			,
+			,
+		].fill().map(() => new H()), this.alignedSatBounds = [
+			,
+			,
+			,
+		].fill().map(() => new H()), this.needsUpdate = !1, e && this.min.copy(e), t && this.max.copy(t), n && this.matrix.copy(n);
+	}
+	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;
+	}
+};
+K.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;
+	};
+})(), K.prototype.intersectsBox = (function() {
+	let e = /* @__PURE__ */ new H();
+	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;
+	};
+})(), K.prototype.intersectsTriangle = (function() {
+	let e = /* @__PURE__ */ new G(), t = [
+		,
+		,
+		,
+	], n = /* @__PURE__ */ new H(), r = /* @__PURE__ */ new H(), i = /* @__PURE__ */ new b();
+	return function(a) {
+		this.needsUpdate && this.update(), a.isExtendedTriangle ? a.needsUpdate && a.update() : (e.copy(a), e.update(), a = e);
+		let o = this.satBounds, s = this.satAxes;
+		t[0] = a.a, t[1] = a.b, t[2] = a.c;
+		for (let e = 0; e < 3; e++) {
+			let r = o[e], i = s[e];
+			if (n.setFromPoints(i, t), r.isSeparated(n)) return !1;
+		}
+		let c = a.satBounds, l = a.satAxes, u = this.points;
+		for (let e = 0; e < 3; e++) {
+			let t = c[e], r = l[e];
+			if (n.setFromPoints(r, u), t.isSeparated(n)) return !1;
+		}
+		for (let e = 0; e < 3; e++) {
+			let a = s[e];
+			for (let e = 0; e < 4; e++) {
+				let o = l[e];
+				if (i.crossVectors(a, o), n.setFromPoints(i, t), r.setFromPoints(i, u), n.isSeparated(r)) return !1;
+			}
+		}
+		return !0;
+	};
+})(), K.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;
+	};
+})(), K.prototype.distanceToPoint = (function() {
+	let e = new b();
+	return function(t) {
+		return this.closestPointToPoint(t, e), t.distanceTo(e);
+	};
+})(), K.prototype.distanceToBox = (function() {
+	let e = [
+		"x",
+		"y",
+		"z"
+	], t = /* @__PURE__ */ Array(12).fill().map(() => new c()), n = /* @__PURE__ */ Array(12).fill().map(() => new c()), r = /* @__PURE__ */ new b(), i = /* @__PURE__ */ new b();
+	return function(a, o = 0, s = null, c = null) {
+		if (this.needsUpdate && this.update(), this.intersectsBox(a)) return (s || c) && (a.getCenter(i), this.closestPointToPoint(i, r), a.closestPointToPoint(r, i), s && s.copy(r), c && c.copy(i)), 0;
+		let l = o * o, u = a.min, d = a.max, f = this.points, p = Infinity;
+		for (let e = 0; e < 8; e++) {
+			let t = f[e];
+			i.copy(t).clamp(u, d);
+			let n = t.distanceToSquared(i);
+			if (n < p && (p = n, s && s.copy(t), c && c.copy(i), n < l)) return Math.sqrt(n);
+		}
+		let m = 0;
+		for (let r = 0; r < 3; r++) for (let i = 0; i <= 1; i++) for (let a = 0; a <= 1; a++) {
+			let o = (r + 1) % 3, s = (r + 2) % 3, c = i << o | a << s, l = 1 << r | i << o | a << s, p = f[c], h = f[l];
+			t[m].set(p, h);
+			let g = e[r], _ = e[o], v = e[s], y = n[m], b = y.start, x = y.end;
+			b[g] = u[g], b[_] = i ? u[_] : d[_], b[v] = a ? u[v] : d[_], x[g] = d[g], x[_] = i ? 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++) {
+			i.x = e ? d.x : u.x, i.y = t ? d.y : u.y, i.z = n ? d.z : u.z, this.closestPointToPoint(i, r);
+			let a = i.distanceToSquared(r);
+			if (a < p && (p = a, s && s.copy(r), c && c.copy(i), a < l)) return Math.sqrt(a);
+		}
+		for (let e = 0; e < 12; e++) {
+			let a = t[e];
+			for (let e = 0; e < 12; e++) {
+				let t = n[e];
+				nt(a, t, r, i);
+				let o = r.distanceToSquared(i);
+				if (o < p && (p = o, s && s.copy(r), c && c.copy(i), o < l)) return Math.sqrt(o);
+			}
+		}
+		return Math.sqrt(p);
+	};
+})();
+var q = /* @__PURE__ */ new class extends Oe {
+	constructor() {
+		super(() => new G());
+	}
+}(), ot = /* @__PURE__ */ new b(), st = /* @__PURE__ */ new b();
+function ct(e, t, n = {}, r = 0, i = Infinity) {
+	let a = r * r, o = i * i, s = Infinity, c = null;
+	if (e.shapecast({
+		boundsTraverseOrder: (e) => (ot.copy(t).clamp(e.min, e.max), ot.distanceToSquared(t)),
+		intersectsBounds: (e, t, n) => n < s && n < o,
+		intersectsTriangle: (e, n) => {
+			e.closestPointToPoint(t, ot);
+			let r = t.distanceToSquared(ot);
+			return r < s && (st.copy(ot), s = r, c = n), r < a;
+		}
+	}), s === Infinity) return null;
+	let l = Math.sqrt(s);
+	return n.point ? n.point.copy(st) : n.point = st.clone(), n.distance = l, n.faceIndex = c, n;
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/utils/ThreeRayIntersectUtilities.js
+var lt = parseInt(h) >= 169, ut = parseInt(h) <= 161, J = /* @__PURE__ */ new b(), Y = /* @__PURE__ */ new b(), X = /* @__PURE__ */ new b(), dt = /* @__PURE__ */ new y(), ft = /* @__PURE__ */ new y(), pt = /* @__PURE__ */ new y(), mt = /* @__PURE__ */ new b(), ht = /* @__PURE__ */ new b(), gt = /* @__PURE__ */ new b(), _t = /* @__PURE__ */ new b();
+function vt(e, n, r, i, o, s, c, l) {
+	let u;
+	if (u = s === t ? e.intersectTriangle(i, r, n, !0, o) : e.intersectTriangle(n, r, i, s !== a, o), u === null) return null;
+	let d = e.origin.distanceTo(o);
+	return d < c || d > l ? null : {
+		distance: d,
+		point: o.clone()
+	};
+}
+function yt(e, t, n, r, i, a, o, s, c, l, u) {
+	J.fromBufferAttribute(t, a), Y.fromBufferAttribute(t, o), X.fromBufferAttribute(t, s);
+	let d = vt(e, J, Y, X, _t, c, l, u);
+	if (d) {
+		if (r) {
+			dt.fromBufferAttribute(r, a), ft.fromBufferAttribute(r, o), pt.fromBufferAttribute(r, s), d.uv = new y();
+			let e = v.getInterpolation(_t, J, Y, X, dt, ft, pt, d.uv);
+			lt || (d.uv = e);
+		}
+		if (i) {
+			dt.fromBufferAttribute(i, a), ft.fromBufferAttribute(i, o), pt.fromBufferAttribute(i, s), d.uv1 = new y();
+			let e = v.getInterpolation(_t, J, Y, X, dt, ft, pt, d.uv1);
+			lt || (d.uv1 = e), ut && (d.uv2 = d.uv1);
+		}
+		if (n) {
+			mt.fromBufferAttribute(n, a), ht.fromBufferAttribute(n, o), gt.fromBufferAttribute(n, s), d.normal = new b();
+			let t = v.getInterpolation(_t, J, Y, X, mt, ht, gt, d.normal);
+			d.normal.dot(e.direction) > 0 && d.normal.multiplyScalar(-1), lt || (d.normal = t);
+		}
+		let t = {
+			a,
+			b: o,
+			c: s,
+			normal: new b(),
+			materialIndex: 0
+		};
+		if (v.getNormal(J, Y, X, t.normal), d.face = t, d.faceIndex = a, lt) {
+			let e = new b();
+			v.getBarycoord(_t, J, Y, X, e), d.barycoord = e;
+		}
+	}
+	return d;
+}
+function bt(e) {
+	return e && e.isMaterial ? e.side : e;
+}
+function xt(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 = bt(t[v]), s = yt(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 = bt(t), s = yt(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 Z(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 St(e, t, n, r, i, a, o, s) {
+	let { geometry: c, _indirectBuffer: l } = e;
+	for (let e = r, l = r + i; e < l; e++) xt(c, t, n, e, a, o, s);
+}
+function Ct(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 = xt(s, t, n, e, null, a, o), r && r.distance < l && (u = r, l = r.distance);
+	}
+	return u;
+}
+function wt(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, Z(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 Tt(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 (k(l, s)) {
+			let t = A(e, o), n = j(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 = M(e), i = N(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 Et(e, t, n, r, i, a, o, s) {
+	let { geometry: c, _indirectBuffer: l } = e;
+	for (let e = r, u = r + i; e < u; e++) xt(c, t, n, l ? l[e] : e, a, o, s);
+}
+function Dt(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 = xt(s, t, n, c ? c[e] : e, null, a, o), r && r.distance < l && (u = r, l = r.distance);
+	}
+	return u;
+}
+function Ot(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), Z(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 kt(e, t, n, r, i, a, o) {
+	L.setBuffer(e._roots[t]), At(0, e, n, r, i, a, o), L.clearBuffer();
+}
+function At(e, t, n, r, i, a, o) {
+	let { float32Array: s, uint16Array: c, uint32Array: l } = L, u = e * 2;
+	if (k(u, c)) St(t, n, r, A(e, l), j(u, c), i, a, o);
+	else {
+		let c = M(e);
+		Q(c, s, r, a, o) && At(c, t, n, r, i, a, o);
+		let u = N(e, l);
+		Q(u, s, r, a, o) && At(u, t, n, r, i, a, o);
+	}
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/cast/raycastFirst.generated.js
+var jt = [
+	"x",
+	"y",
+	"z"
+];
+function Mt(e, t, n, r, i, a) {
+	L.setBuffer(e._roots[t]);
+	let o = Nt(0, e, n, r, i, a);
+	return L.clearBuffer(), o;
+}
+function Nt(e, t, n, r, i, a) {
+	let { float32Array: o, uint16Array: s, uint32Array: c } = L, l = e * 2;
+	if (k(l, s)) return Ct(t, n, r, A(e, c), j(l, s), i, a);
+	{
+		let s = ue(e, c), l = jt[s], u = r.direction[l] >= 0, d, f;
+		u ? (d = M(e), f = N(e, c)) : (d = N(e, c), f = M(e));
+		let p = Q(d, o, r, i, a) ? Nt(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) ? Nt(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 Pt = /* @__PURE__ */ new r(), Ft = /* @__PURE__ */ new G(), It = /* @__PURE__ */ new G(), Lt = /* @__PURE__ */ new d(), Rt = /* @__PURE__ */ new K(), zt = /* @__PURE__ */ new K();
+function Bt(e, t, n, r) {
+	L.setBuffer(e._roots[t]);
+	let i = Vt(0, e, n, r);
+	return L.clearBuffer(), i;
+}
+function Vt(e, t, n, r, i = null) {
+	let { float32Array: a, uint16Array: o, uint32Array: s } = L, c = e * 2;
+	if (i === null && (n.boundingBox || n.computeBoundingBox(), Rt.set(n.boundingBox.min, n.boundingBox.max, r), i = Rt), k(c, o)) {
+		let i = t.geometry, l = i.index, u = i.attributes.position, d = n.index, f = n.attributes.position, p = A(e, s), m = j(c, o);
+		if (Lt.copy(r).invert(), n.boundsTree) return O(P(e), a, zt), zt.matrix.copy(Lt), zt.needsUpdate = !0, n.boundsTree.shapecast({
+			intersectsBounds: (e) => zt.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 (Z(It, t, l, u), It.needsUpdate = !0, e.intersectsTriangle(It)) return !0;
+				return !1;
+			}
+		});
+		{
+			let e = qe(n);
+			for (let t = p * 3, n = (m + p) * 3; t < n; t += 3) {
+				Z(Ft, t, l, u), Ft.a.applyMatrix4(Lt), Ft.b.applyMatrix4(Lt), Ft.c.applyMatrix4(Lt), Ft.needsUpdate = !0;
+				for (let t = 0, n = e * 3; t < n; t += 3) if (Z(It, t, d, f), It.needsUpdate = !0, Ft.intersectsTriangle(It)) return !0;
+			}
+		}
+	} else {
+		let o = M(e), c = N(e, s);
+		return O(P(o), a, Pt), !!(i.intersectsBox(Pt) && Vt(o, t, n, r, i) || (O(P(c), a, Pt), i.intersectsBox(Pt) && Vt(c, t, n, r, i)));
+	}
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry.generated.js
+var Ht = /* @__PURE__ */ new d(), Ut = /* @__PURE__ */ new K(), Wt = /* @__PURE__ */ new K(), Gt = /* @__PURE__ */ new b(), Kt = /* @__PURE__ */ new b(), qt = /* @__PURE__ */ new b(), Jt = /* @__PURE__ */ new b();
+function Yt(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
+	t.boundingBox || t.computeBoundingBox(), Ut.set(t.boundingBox.min, t.boundingBox.max, n), Ut.needsUpdate = !0;
+	let s = e.geometry, c = s.attributes.position, l = s.index, u = t.attributes.position, d = t.index, f = q.getPrimitive(), p = q.getPrimitive(), m = Gt, h = Kt, g = null, _ = null;
+	i && (g = qt, _ = Jt);
+	let v = Infinity, y = null, b = null;
+	return Ht.copy(n).invert(), Wt.matrix.copy(Ht), e.shapecast({
+		boundsTraverseOrder: (e) => Ut.distanceToBox(e),
+		intersectsBounds: (e, t, n) => n < v && n < o ? (t && (Wt.min.copy(e.min), Wt.max.copy(e.max), Wt.needsUpdate = !0), !0) : !1,
+		intersectsRange: (e, r) => {
+			if (t.boundsTree) return t.boundsTree.shapecast({
+				boundsTraverseOrder: (e) => Wt.distanceToBox(e),
+				intersectsBounds: (e, t, n) => n < v && n < o,
+				intersectsRange: (t, i) => {
+					for (let o = t, s = t + i; o < s; o++) {
+						Z(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++) {
+							Z(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 = qe(t);
+				for (let t = 0, o = i; t < o; t++) {
+					Z(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++) {
+						Z(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;
+					}
+				}
+			}
+		}
+	}), q.releasePrimitive(f), q.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(Ht), h.applyMatrix4(Ht), 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 Xt(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 (k(u, s)) {
+			let t = A(n, o), a = j(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 = M(n), r = N(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 Zt(e, t, n, r, i, a, o) {
+	L.setBuffer(e._roots[t]), Qt(0, e, n, r, i, a, o), L.clearBuffer();
+}
+function Qt(e, t, n, r, i, a, o) {
+	let { float32Array: s, uint16Array: c, uint32Array: l } = L, u = e * 2;
+	if (k(u, c)) Et(t, n, r, A(e, l), j(u, c), i, a, o);
+	else {
+		let c = M(e);
+		Q(c, s, r, a, o) && Qt(c, t, n, r, i, a, o);
+		let u = N(e, l);
+		Q(u, s, r, a, o) && Qt(u, t, n, r, i, a, o);
+	}
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/cast/raycastFirst_indirect.generated.js
+var $t = [
+	"x",
+	"y",
+	"z"
+];
+function en(e, t, n, r, i, a) {
+	L.setBuffer(e._roots[t]);
+	let o = tn(0, e, n, r, i, a);
+	return L.clearBuffer(), o;
+}
+function tn(e, t, n, r, i, a) {
+	let { float32Array: o, uint16Array: s, uint32Array: c } = L, l = e * 2;
+	if (k(l, s)) return Dt(t, n, r, A(e, c), j(l, s), i, a);
+	{
+		let s = ue(e, c), l = $t[s], u = r.direction[l] >= 0, d, f;
+		u ? (d = M(e), f = N(e, c)) : (d = N(e, c), f = M(e));
+		let p = Q(d, o, r, i, a) ? tn(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) ? tn(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 nn = /* @__PURE__ */ new r(), rn = /* @__PURE__ */ new G(), an = /* @__PURE__ */ new G(), on = /* @__PURE__ */ new d(), sn = /* @__PURE__ */ new K(), cn = /* @__PURE__ */ new K();
+function ln(e, t, n, r) {
+	L.setBuffer(e._roots[t]);
+	let i = un(0, e, n, r);
+	return L.clearBuffer(), i;
+}
+function un(e, t, n, r, i = null) {
+	let { float32Array: a, uint16Array: o, uint32Array: s } = L, c = e * 2;
+	if (i === null && (n.boundingBox || n.computeBoundingBox(), sn.set(n.boundingBox.min, n.boundingBox.max, r), i = sn), k(c, o)) {
+		let i = t.geometry, l = i.index, u = i.attributes.position, d = n.index, f = n.attributes.position, p = A(e, s), m = j(c, o);
+		if (on.copy(r).invert(), n.boundsTree) return O(P(e), a, cn), cn.matrix.copy(on), cn.needsUpdate = !0, n.boundsTree.shapecast({
+			intersectsBounds: (e) => cn.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 (Z(an, 3 * t.resolveTriangleIndex(n), l, u), an.needsUpdate = !0, e.intersectsTriangle(an)) return !0;
+				return !1;
+			}
+		});
+		{
+			let e = qe(n);
+			for (let n = p, r = m + p; n < r; n++) {
+				Z(rn, 3 * t.resolveTriangleIndex(n), l, u), rn.a.applyMatrix4(on), rn.b.applyMatrix4(on), rn.c.applyMatrix4(on), rn.needsUpdate = !0;
+				for (let t = 0, n = e * 3; t < n; t += 3) if (Z(an, t, d, f), an.needsUpdate = !0, rn.intersectsTriangle(an)) return !0;
+			}
+		}
+	} else {
+		let o = M(e), c = N(e, s);
+		return O(P(o), a, nn), !!(i.intersectsBox(nn) && un(o, t, n, r, i) || (O(P(c), a, nn), i.intersectsBox(nn) && un(c, t, n, r, i)));
+	}
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry_indirect.generated.js
+var dn = /* @__PURE__ */ new d(), fn = /* @__PURE__ */ new K(), pn = /* @__PURE__ */ new K(), mn = /* @__PURE__ */ new b(), hn = /* @__PURE__ */ new b(), gn = /* @__PURE__ */ new b(), _n = /* @__PURE__ */ new b();
+function vn(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
+	t.boundingBox || t.computeBoundingBox(), fn.set(t.boundingBox.min, t.boundingBox.max, n), fn.needsUpdate = !0;
+	let s = e.geometry, c = s.attributes.position, l = s.index, u = t.attributes.position, d = t.index, f = q.getPrimitive(), p = q.getPrimitive(), m = mn, h = hn, g = null, _ = null;
+	i && (g = gn, _ = _n);
+	let v = Infinity, y = null, b = null;
+	return dn.copy(n).invert(), pn.matrix.copy(dn), e.shapecast({
+		boundsTraverseOrder: (e) => fn.distanceToBox(e),
+		intersectsBounds: (e, t, n) => n < v && n < o ? (t && (pn.min.copy(e.min), pn.max.copy(e.max), pn.needsUpdate = !0), !0) : !1,
+		intersectsRange: (r, i) => {
+			if (t.boundsTree) {
+				let s = t.boundsTree;
+				return s.shapecast({
+					boundsTraverseOrder: (e) => pn.distanceToBox(e),
+					intersectsBounds: (e, t, n) => n < v && n < o,
+					intersectsRange: (t, o) => {
+						for (let x = t, S = t + o; x < S; x++) {
+							let t = s.resolveTriangleIndex(x);
+							Z(p, 3 * t, 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++) {
+								let n = e.resolveTriangleIndex(t);
+								Z(f, 3 * n, l, c), f.needsUpdate = !0;
+								let r = f.distanceToTriangle(p, m, g);
+								if (r < v && (h.copy(m), _ && _.copy(g), v = r, y = t, b = x), r < a) return !0;
+							}
+						}
+					}
+				});
+			} else {
+				let o = qe(t);
+				for (let t = 0, s = o; t < s; t++) {
+					Z(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++) {
+						let r = e.resolveTriangleIndex(n);
+						Z(f, 3 * r, l, c), f.needsUpdate = !0;
+						let i = f.distanceToTriangle(p, m, g);
+						if (i < v && (h.copy(m), _ && _.copy(g), v = i, y = n, b = t), i < a) return !0;
+					}
+				}
+			}
+		}
+	}), q.releasePrimitive(f), q.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(dn), h.applyMatrix4(dn), i.distance = h.sub(i.point).length(), i.faceIndex = b), r);
+}
+//#endregion
+//#region node_modules/three-mesh-bvh/src/utils/GeometryRayIntersectUtilities.js
+function yn(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 bn = /* @__PURE__ */ new K(), xn = /* @__PURE__ */ new g(), Sn = /* @__PURE__ */ new b(), Cn = /* @__PURE__ */ new d(), wn = /* @__PURE__ */ new b(), Tn = [
+	"getX",
+	"getY",
+	"getZ"
+], En = class e extends et {
+	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: a, roots: o, indirectBuffer: s } = 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."), l(o));
+		let c = new e(n, {
+			...r,
+			[D]: !0
+		});
+		if (c._roots = o, c._indirectBuffer = s || null, r.setIndex) {
+			let e = n.getIndex();
+			if (e === null) {
+				let e = new i(t.index, 1, !1);
+				n.setIndex(e);
+			} else e.array !== a && (e.array.set(a), e.needsUpdate = !0);
+		}
+		return c;
+		function l(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;
+					k(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[Tn[e]](c), i = a[Tn[e]](l), o = a[Tn[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, m = e + 1, h = e + 2;
+			o && (p = o[p], m = o[m], h = o[h]), s || (p = p * u + l, m = m * u + l, h = h * u + l);
+			for (let e = 0; e < 3; e++) {
+				let r, i, o;
+				s ? (r = a[d[e]](p), i = a[d[e]](m), o = a[d[e]](h)) : (r = c[p + e], i = c[m + e], o = c[h + 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, g = e * 2;
+				n[t + g + 0] = l + f, n[t + g + 1] = f + (Math.abs(l) + f) * re;
+			}
+		}
+		return n;
+	}
+	raycastObject3D(e, t, n = []) {
+		let { material: r } = e;
+		if (r === void 0) return;
+		Cn.copy(e.matrixWorld).invert(), xn.copy(t.ray).applyMatrix4(Cn), wn.setFromMatrixScale(e.matrixWorld), Sn.copy(xn.direction).multiply(wn);
+		let i = Sn.length(), a = t.near / i, o = t.far / i;
+		if (t.firstHitOnly === !0) {
+			let i = this.raycastFirst(xn, r, a, o);
+			i = yn(i, e, t), i && n.push(i);
+		} else {
+			let i = this.raycast(xn, r, a, o);
+			for (let r = 0, a = i.length; r < a; r++) {
+				let a = yn(i[r], e, t);
+				a && n.push(a);
+			}
+		}
+		return n;
+	}
+	refit(e = null) {
+		return (this.indirect ? Xt : Tt)(this, e);
+	}
+	raycast(e, t = o, n = 0, r = Infinity) {
+		let i = this._roots, a = [], s = this.indirect ? Zt : kt;
+		for (let o = 0, c = i.length; o < c; o++) s(this, o, t, e, a, n, r);
+		return a;
+	}
+	raycastFirst(e, t = o, n = 0, r = Infinity) {
+		let i = this._roots, a = null, s = this.indirect ? en : Mt;
+		for (let o = 0, c = i.length; o < c; o++) {
+			let i = s(this, o, 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 ? ln : Bt;
+		for (let a = 0, o = r.length; a < o && (n = i(this, a, e, t), !n); a++);
+		return n;
+	}
+	shapecast(e) {
+		let t = q.getPrimitive(), n = super.shapecast({
+			...e,
+			intersectsPrimitive: e.intersectsTriangle,
+			scratchPrimitive: t,
+			iterate: this.indirect ? Ot : wt
+		});
+		return q.releasePrimitive(t), n;
+	}
+	bvhcast(t, n, r) {
+		let { intersectsRanges: i, intersectsTriangles: a } = r, o = q.getPrimitive(), s = this.geometry.index, c = this.geometry.attributes.position, l = this.indirect ? (e) => {
+			let t = this.resolveTriangleIndex(e);
+			Z(o, t * 3, s, c);
+		} : (e) => {
+			Z(o, e * 3, s, c);
+		}, u = q.getPrimitive(), d = t.geometry.index, f = t.geometry.attributes.position, p = t.indirect ? (e) => {
+			let n = t.resolveTriangleIndex(e);
+			Z(u, n * 3, d, f);
+		} : (e) => {
+			Z(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 bn.set(e.min, e.max, t), bn.needsUpdate = !0, this.shapecast({
+			intersectsBounds: (e) => bn.intersectsBox(e),
+			intersectsTriangle: (e) => bn.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 ? vn : Yt)(this, e, t, n, r, i, a);
+	}
+	closestPointToPoint(e, t = {}, n = 0, r = Infinity) {
+		return ct(this, e, t, n, r);
+	}
+}, Dn = {
+	Mesh: f.prototype.raycast,
+	Line: s.prototype.raycast,
+	LineSegments: u.prototype.raycast,
+	LineLoop: l.prototype.raycast,
+	Points: m.prototype.raycast,
+	BatchedMesh: n.prototype.raycast
+}, $ = /* @__PURE__ */ new f(), On = [];
+function kn(e, t) {
+	if (this.isBatchedMesh) An.call(this, e, t);
+	else {
+		let { geometry: n } = this;
+		if (n.boundsTree) n.boundsTree.raycastObject3D(this, e, t);
+		else {
+			let n;
+			if (this instanceof f) n = Dn.Mesh;
+			else if (this instanceof u) n = Dn.LineSegments;
+			else if (this instanceof l) n = Dn.LineLoop;
+			else if (this instanceof s) n = Dn.Line;
+			else if (this instanceof m) n = Dn.Points;
+			else throw Error("BVH: Fallback raycast function not found.");
+			n.call(this, e, t);
+		}
+	}
+}
+function An(e, t) {
+	if (this.boundsTrees) {
+		let n = this.boundsTrees, r = this._drawInfo || this._instanceInfo, i = this._drawRanges || this._geometryInfo, a = this.matrixWorld;
+		$.material = this.material, $.geometry = this.geometry;
+		let o = $.geometry.boundsTree, s = $.geometry.drawRange;
+		$.geometry.boundingSphere === null && ($.geometry.boundingSphere = new _());
+		for (let o = 0, s = r.length; o < s; o++) {
+			if (!this.getVisibleAt(o)) continue;
+			let s = r[o].geometryIndex;
+			if ($.geometry.boundsTree = n[s], this.getMatrixAt(o, $.matrixWorld).premultiply(a), !$.geometry.boundsTree) {
+				this.getBoundingBoxAt(s, $.geometry.boundingBox), this.getBoundingSphereAt(s, $.geometry.boundingSphere);
+				let e = i[s];
+				$.geometry.setDrawRange(e.start, e.count);
+			}
+			$.raycast(e, On);
+			for (let e = 0, n = On.length; e < n; e++) {
+				let n = On[e];
+				n.object = this, n.batchId = o, t.push(n);
+			}
+			On.length = 0;
+		}
+		$.geometry.boundsTree = o, $.geometry.drawRange = s, $.material = null, $.geometry = null;
+	} else Dn.BatchedMesh.call(this, e, t);
+}
+//#endregion
+//#region src/infrastructure/three/bvh.ts
+function jn(e) {
+	e.traverse((e) => {
+		let t = e;
+		if (!t.isMesh || t.isSkinnedMesh || t.isInstancedMesh || t.isBatchedMesh) return;
+		let n = t.geometry;
+		!n?.attributes?.position || n.morphAttributes?.position?.length || (n.boundsTree ||= new En(n), t.raycast = kn);
+	});
+}
+function Mn(e) {
+	e.boundsTree &&= void 0;
+}
+//#endregion
+//#region src/infrastructure/three/disposal.ts
+function Nn(t) {
+	let n = t;
+	for (let t of Object.keys(n)) {
+		let r = n[t];
+		r instanceof e.Texture && r.dispose();
+	}
+	let r = t;
+	if (r.isShaderMaterial && r.uniforms) for (let t of Object.values(r.uniforms)) t?.value instanceof e.Texture && t.value.dispose();
+	t.dispose();
+}
+function Pn(e) {
+	e.traverse((e) => {
+		let t = e;
+		t.geometry && typeof t.geometry.dispose == "function" && (Mn(t.geometry), t.geometry.dispose());
+		let n = t.material;
+		Array.isArray(n) ? n.forEach(Nn) : n && Nn(n);
+		let r = e;
+		r.isLight && r.shadow?.dispose && r.shadow.dispose();
+	});
+}
+function Fn(t, n) {
+	if (!n?.keepBackgrounds) {
+		t.background instanceof e.Texture && (t.background.dispose(), t.background = null), t.environment instanceof e.Texture && (t.environment.dispose(), t.environment = null);
+		let n = t;
+		n.__originalEnvironmentTexture &&= void 0;
+	}
+	for (let e of [...t.children]) Pn(e), t.remove(e);
+}
+//#endregion
+//#region src/infrastructure/three/ContactShadowBaker.ts
+var In = "contact-shadow-baked", Ln = "contact-shadow-live", Rn = "softboxContactShadowHelper", zn = "softboxPathTracingFloor", Bn = Math.PI * (3 - Math.sqrt(5));
+function Vn(e) {
+	let t = e.getObjectByName(In);
+	t && (e.remove(t), Pn(t));
+}
+function Hn(e) {
+	Vn(e);
+	let t = e.getObjectByName(Ln);
+	t && (t.visible = !0);
+}
+var Un = class t {
+	static {
+		this.AMBIENT_RATIO = .62;
+	}
+	static {
+		this.LIGHT_APERTURE_DEGREES = 13;
+	}
+	static {
+		this.AMBIENT_MIN_ELEVATION_DEGREES = 55;
+	}
+	static {
+		this.ACCUMULATION_TEXTURE_SIZE = 1024;
+	}
+	static {
+		this.BAKE_SHADOW_MAP_SIZE = 1024;
+	}
+	static {
+		this.SHADOW_STRENGTH = .55;
+	}
+	static {
+		this.DISC_FOOTPRINT_MARGIN = 1.4;
+	}
+	static {
+		this.DISC_HEIGHT_STRETCH = .45;
+	}
+	static {
+		this.DISC_MIN_HALF_EXTENT = .05;
+	}
+	static {
+		this.FLOOR_LIFT_PER_HEIGHT = .0025;
+	}
+	static {
+		this.FLOOR_LIFT_MIN = 2e-4;
+	}
+	static {
+		this.FLOOR_LIFT_MAX = .01;
+	}
+	static {
+		this.BAKE_BUDGET_MS = 100;
+	}
+	static {
+		this.MIN_PASSES = 24;
+	}
+	static {
+		this.MAX_PASSES = 96;
+	}
+	constructor(e) {
+		this.explicitPasses = e?.passes;
+	}
+	bake(n) {
+		let { renderer: r, scene: i, object: a, light: o } = n;
+		if (r.getContext().isContextLost()) {
+			this.leaveLiveCatcherInCharge(i);
+			return;
+		}
+		let s = this.measureBakeRegion(a);
+		if (!s) return;
+		let c = i.getObjectByName(Ln);
+		c?.geometry instanceof e.CircleGeometry && (s.halfExtent = Math.min(s.halfExtent, c.geometry.parameters.radius));
+		let l = new e.WebGLRenderTarget(t.ACCUMULATION_TEXTURE_SIZE, t.ACCUMULATION_TEXTURE_SIZE, {
+			type: r.capabilities.isWebGL2 ? e.HalfFloatType : e.UnsignedByteType,
+			depthBuffer: !1,
+			stencilBuffer: !1
+		}), u = new e.CircleGeometry(s.halfExtent, 64);
+		if (this.accumulateShadowPasses(r, a, o, s, l, u), r.getContext().isContextLost()) {
+			l.dispose(), u.dispose(), this.leaveLiveCatcherInCharge(i), console.warn("Contact-shadow bake aborted: WebGL context was lost mid-bake");
+			return;
+		}
+		this.installBakedMesh(i, s, l, u);
+	}
+	leaveLiveCatcherInCharge(e) {
+		Hn(e);
+	}
+	evictBakedMesh(e) {
+		Vn(e);
+	}
+	measureBakeRegion(n) {
+		let r = new e.Box3().setFromObject(n);
+		if (r.isEmpty() || !Number.isFinite(r.min.x) || !Number.isFinite(r.max.x)) return null;
+		let i = r.getSize(new e.Vector3()), a = r.getCenter(new e.Vector3()), o = Math.max(i.x, i.z);
+		return {
+			center: a,
+			halfExtent: Math.max(o * t.DISC_FOOTPRINT_MARGIN + i.y * t.DISC_HEIGHT_STRETCH, t.DISC_MIN_HALF_EXTENT),
+			objectHeight: i.y,
+			boundingRadius: i.length() / 2
+		};
+	}
+	accumulateShadowPasses(t, n, r, i, a, o) {
+		let s = new e.Scene(), c = n.parent;
+		s.add(n);
+		let l = this.disableColorWrite(n), u = this.createBakeLight(r);
+		s.add(u), s.add(u.target), u.target.position.copy(r.target.parent ? r.target.getWorldPosition(new e.Vector3()) : r.target.position);
+		let d = new e.ShadowMaterial({
+			transparent: !0,
+			opacity: 0,
+			depthWrite: !1
+		});
+		d.blending = e.CustomBlending, d.blendEquation = e.AddEquation, d.blendSrc = e.OneFactor, d.blendDst = e.OneFactor;
+		let f = new e.Mesh(o, d);
+		f.rotation.x = -Math.PI / 2, f.position.set(i.center.x, 0, i.center.z), f.receiveShadow = !0, s.add(f);
+		let p = this.createBakeCamera(i);
+		s.add(p);
+		let m = t.getRenderTarget(), h = t.autoClear, g = t.getClearColor(new e.Color()), _ = t.getClearAlpha(), v = t.shadowMap.autoUpdate;
+		try {
+			t.shadowMap.autoUpdate = !0, t.setRenderTarget(a), t.setClearColor(0, 0), t.clear(!0, !1, !1), t.autoClear = !1;
+			let e = this.explicitPasses ?? this.measureAffordablePasses(t, s, p, r, u, a);
+			d.opacity = 1 / e;
+			for (let n of this.sampleLightPositions(r, e)) u.position.copy(n), this.fitBakeDepthRange(u, i), t.render(s, p);
+		} finally {
+			t.autoClear = h, t.setClearColor(g, _), t.setRenderTarget(m), t.shadowMap.autoUpdate = v, this.restoreColorWrite(l), c ? c.add(n) : s.remove(n), u.dispose(), d.dispose();
+		}
+	}
+	measureAffordablePasses(n, r, i, a, o, s) {
+		o.position.copy(a.position), n.render(r, i), this.awaitGpuIdle(n, s);
+		let c = performance.now();
+		n.render(r, i), this.awaitGpuIdle(n, s);
+		let l = Math.max(performance.now() - c, .01);
+		return e.MathUtils.clamp(Math.round(t.BAKE_BUDGET_MS / l), t.MIN_PASSES, t.MAX_PASSES);
+	}
+	awaitGpuIdle(t, n) {
+		if (!t.capabilities.textureTypeReadable(n.texture.type)) return;
+		let r = n.texture.type === e.HalfFloatType ? /* @__PURE__ */ new Uint16Array(4) : /* @__PURE__ */ new Uint8Array(4);
+		t.readRenderTargetPixels(n, 0, 0, 1, 1, r);
+	}
+	createBakeLight(n) {
+		let r = new e.DirectionalLight(16777215, 1);
+		r.castShadow = !0, r.shadow.mapSize.set(t.BAKE_SHADOW_MAP_SIZE, t.BAKE_SHADOW_MAP_SIZE), r.shadow.bias = 0, r.shadow.normalBias = 0, r.shadow.radius = 6;
+		let i = n.shadow.camera, a = r.shadow.camera;
+		return a.left = i.left, a.right = i.right, a.top = i.top, a.bottom = i.bottom, a.updateProjectionMatrix(), r;
+	}
+	fitBakeDepthRange(e, t) {
+		let n = e.target.position.clone().sub(e.position).normalize(), r = t.center.clone().sub(e.position).dot(n), i = t.boundingRadius * 1.5 + t.halfExtent, a = e.shadow.camera;
+		a.near = Math.max(r - i, r * .01), a.far = r + i, a.updateProjectionMatrix();
+	}
+	createBakeCamera(t) {
+		let n = new e.OrthographicCamera(-t.halfExtent, t.halfExtent, t.halfExtent, -t.halfExtent, .1, Math.max(t.objectHeight, 1) * 4);
+		return n.position.set(t.center.x, Math.max(t.objectHeight, 1) * 2, t.center.z), n.up.set(0, 0, -1), n.lookAt(t.center.x, 0, t.center.z), n.updateProjectionMatrix(), n.updateMatrixWorld(!0), n;
+	}
+	sampleLightPositions(n, r) {
+		let i = n.position.clone(), a = n.target.parent ? n.target.getWorldPosition(new e.Vector3()) : n.target.position.clone(), o = a.clone().sub(i), s = o.length(), c = o.normalize(), l = new e.Vector3().crossVectors(c, new e.Vector3(0, 1, 0));
+		l.lengthSq() < 1e-6 && l.set(1, 0, 0), l.normalize();
+		let u = new e.Vector3().crossVectors(c, l), d = Math.round(r * t.AMBIENT_RATIO), f = r - d, p = e.MathUtils.degToRad(t.LIGHT_APERTURE_DEGREES), m = Math.tan(p / 2) * s, h = [];
+		for (let e = 0; e < f; e++) {
+			let t = m * Math.sqrt((e + .5) / f), n = e * Bn;
+			h.push(i.clone().addScaledVector(l, t * Math.cos(n)).addScaledVector(u, t * Math.sin(n)));
+		}
+		let g = Math.sin(e.MathUtils.degToRad(t.AMBIENT_MIN_ELEVATION_DEGREES));
+		for (let t = 0; t < d; t++) {
+			let n = Math.sqrt((t + .5) / d), r = g + (.98 - g) * n, i = Math.sqrt(1 - r * r), o = t * Bn;
+			h.push(new e.Vector3(i * Math.cos(o), r, i * Math.sin(o)).multiplyScalar(s).add(a));
+		}
+		return h;
+	}
+	installBakedMesh(n, r, i, a) {
+		this.evictBakedMesh(n);
+		let o = new e.MeshBasicMaterial({
+			map: i.texture,
+			transparent: !0,
+			opacity: t.SHADOW_STRENGTH,
+			depthWrite: !1,
+			toneMapped: !1
+		});
+		o.onBeforeCompile = (e) => {
+			e.fragmentShader = e.fragmentShader.replace("#include <map_fragment>", "#include <map_fragment>\n	diffuseColor.a = pow(diffuseColor.a, 0.75);");
+		}, o.customProgramCacheKey = () => "contact-shadow-alpha-gamma", o.addEventListener("dispose", () => i.dispose());
+		let s = new e.Mesh(a, o);
+		s.name = In, s.userData[Rn] = !0, s.rotation.x = -Math.PI / 2;
+		let c = e.MathUtils.clamp(r.objectHeight * t.FLOOR_LIFT_PER_HEIGHT, t.FLOOR_LIFT_MIN, t.FLOOR_LIFT_MAX);
+		s.position.set(r.center.x, c, r.center.z), s.userData.renderTarget = i, n.add(s);
+		let l = n.getObjectByName(Ln);
+		l && (l.visible = !1);
+	}
+	disableColorWrite(e) {
+		let t = /* @__PURE__ */ new Map();
+		return e.traverse((e) => {
+			let n = e;
+			if (!n.isMesh) return;
+			let r = Array.isArray(n.material) ? n.material : [n.material];
+			for (let e of r) e && !t.has(e) && (t.set(e, e.colorWrite), e.colorWrite = !1);
+		}), t;
+	}
+	restoreColorWrite(e) {
+		e.forEach((e, t) => {
+			t.colorWrite = e;
+		});
+	}
+};
+//#endregion
+export { S as C, C as S, ue as _, zn as a, T as b, Fn as c, Je as d, Ke as f, A as g, k as h, Un as i, jn as l, j as m, Rn as n, Hn as o, P as p, Ln as r, Pn as s, In as t, En as u, ne as v, x as w, w as x, ee as y };