softbox 4.25.1 → 4.26.1

package/dist/{smoothstep-gC155W8-.js → smoothstep-DJLgqxNL.js}

@@ -1,7 +1,7 @@
 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";
+import { BackSide as t, Box3 as n, BufferAttribute as r, DoubleSide as i, FrontSide as a, Line3 as o, Matrix4 as s, Plane as c, REVISION as l, Ray as u, Triangle as d, Vector2 as f, Vector3 as p } from "three";
 //#region src/errors/ThreeViewerError.ts
-var x = class e extends Error {
+var m = 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);
 	}
@@ -17,9 +17,9 @@ var x = class e extends Error {
 		};
 		return new e(i, n, a);
 	}
-}, S = /* @__PURE__ */ function(e) {
+}, h = /* @__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.POST_PROCESSING_FAILED = "POST_PROCESSING_FAILED", e.UNKNOWN = "UNKNOWN", e;
-}({}), C = {
+}({}), g = {
 	ok(e) {
 		return {
 			ok: !0,
@@ -34,12 +34,12 @@ var x = class e extends Error {
 	},
 	wrap(e) {
 		try {
-			return C.ok(e());
+			return g.ok(e());
 		} catch (e) {
-			return C.err(e instanceof x ? e : new x(String(e), S.UNKNOWN, { originalError: e }));
+			return g.err(e instanceof m ? e : new m(String(e), h.UNKNOWN, { originalError: e }));
 		}
 	}
-}, w = class {
+}, _ = class {
 	constructor() {
 		this.listeners = /* @__PURE__ */ new Map();
 	}
@@ -77,13 +77,49 @@ var x = class e extends Error {
 	removeListener(e, t) {
 		this.off(e, t);
 	}
-}, T = {
+}, v = {
 	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 = {
+}, y = "softbox-units-scale", b = "softboxExternallyOwnedTextures", x = "softboxBackgroundNode", S = "softboxStashedMaterials";
+function C(t) {
+	if (!t.userData.softboxDisposed) {
+		if (!t.userData?.softboxExternallyOwnedTextures) {
+			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(), t.userData.softboxDisposed = !0;
+	}
+}
+function w(e) {
+	e.boundsTree &&= void 0;
+}
+function T(e) {
+	e.traverse((e) => {
+		let t = e;
+		t.geometry && typeof t.geometry.dispose == "function" && (w(t.geometry), t.geometry.dispose());
+		let n = t.material;
+		Array.isArray(n) ? n.forEach(C) : n && C(n), (e.userData?.[S])?.forEach(C);
+		let r = e;
+		r.isLight && r.shadow?.dispose && r.shadow.dispose();
+	});
+}
+function ee(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]) n?.keepBackgrounds && e.userData?.softboxBackgroundNode || (T(e), t.remove(e));
+}
+var E = 1.25, te = 65535, ne = te << 16, re = 2 ** -24, D = Symbol("SKIP_GENERATION"), ie = {
 	strategy: 0,
 	maxDepth: 40,
 	targetLeafSize: 10,
@@ -131,7 +167,7 @@ function le(e) {
 //#endregion
 //#region node_modules/three-mesh-bvh/src/core/utils/nodeBufferUtils.js
 function k(e, t) {
-	return t[e + 15] === E;
+	return t[e + 15] === te;
 }
 function A(e, t) {
 	return t[e + 6];
@@ -179,7 +215,7 @@ function me(e, t, n, r, i, a) {
 	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;
+		let a = le(e), c = E * 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) {
@@ -211,7 +247,7 @@ function me(e, t, n, r, i, a) {
 					l !== 0 && (p = le(d) / a);
 					let m = 0;
 					u !== 0 && (m = le(f) / a);
-					let h = 1 + te * (p * l + m * u);
+					let h = 1 + E * (p * l + m * u);
 					h < c && (o = e, c = h, s = r.candidate);
 				}
 			} else {
@@ -241,7 +277,7 @@ function me(e, t, n, r, i, a) {
 					f !== 0 && (d = le(pe) / a);
 					let m = i - f;
 					m !== 0 && (p = le(u) / a);
-					let h = 1 + te * (d * f + p * m);
+					let h = 1 + E * (d * f + p * m);
 					h < c && (o = e, c = h, s = n.candidate);
 				}
 			}
@@ -296,7 +332,7 @@ function we(e, t, n) {
 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);
+	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] = te, 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.");
@@ -360,7 +396,7 @@ var Oe = class {
 			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());
+}(), R, ke, Ae = [], je = /* @__PURE__ */ new Oe(() => new n());
 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);
@@ -409,21 +445,21 @@ function Ne(e, t, n, r, i = null, a = 0, o = 0) {
 }
 //#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()), Ie = /* @__PURE__ */ new r(), Le = /* @__PURE__ */ new r(), Re = /* @__PURE__ */ new r(), ze = /* @__PURE__ */ new r(), Be = !1;
-function Ve(e, t, n, r) {
-	if (Be) throw Error("MeshBVH: Recursive calls to bvhcast not supported.");
-	Be = !0;
-	let i = e._roots, a = t._roots, o, s = 0, c = 0, l = new d().copy(n).invert();
+var Pe = /* @__PURE__ */ new L.constructor(), Fe = /* @__PURE__ */ new L.constructor(), z = /* @__PURE__ */ new Oe(() => new n()), B = /* @__PURE__ */ new n(), Ie = /* @__PURE__ */ new n(), Le = /* @__PURE__ */ new n(), Re = /* @__PURE__ */ new n(), 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, c = 0, l = 0, u = new s().copy(n).invert();
 	for (let e = 0, t = i.length; e < t; e++) {
-		Pe.setBuffer(i[e]), c = 0;
+		Pe.setBuffer(i[e]), l = 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 = B(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;
+		O(P(0), Pe.float32Array, t), t.applyMatrix4(u);
+		for (let e = 0, i = a.length; e < i && (Fe.setBuffer(a[e]), o = V(0, 0, n, u, r, c, l, 0, 0, t), Fe.clearBuffer(), l += a[e].byteLength / 32, !o); e++);
+		if (z.releasePrimitive(t), Pe.clearBuffer(), c += i[e].byteLength / 32, o) break;
 	}
-	return Be = !1, o;
+	return ze = !1, o;
 }
-function B(e, t, n, r, i, a = 0, o = 0, s = 0, c = 0, l = null, u = !1) {
+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;
@@ -432,38 +468,38 @@ function B(e, t, n, r, i, a = 0, o = 0, s = 0, c = 0, l = null, u = !1) {
 		let l = z.getPrimitive();
 		O(P(t), g, l), l.applyMatrix4(n);
 		let d = M(e), f = N(e, m);
-		O(P(d), p, Ie), O(P(f), p, Le);
-		let h = l.intersectsBox(Ie), _ = l.intersectsBox(Le);
-		C = h && B(t, d, r, n, i, o, a, c, s + 1, l, !u) || _ && B(t, f, r, n, i, o, a, c, s + 1, l, !u), z.releasePrimitive(l);
+		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, Re), O(P(f), g, ze);
-		let h = l.intersectsBox(Re), v = l.intersectsBox(ze);
-		if (h && v) C = B(e, d, n, r, i, a, o, s, c + 1, l, u) || B(e, f, n, r, i, a, o, s, c + 1, l, u);
-		else if (h) if (x) C = B(e, d, n, r, i, a, o, s, c + 1, l, u);
+		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(Re).applyMatrix4(n);
+			t.copy(Le).applyMatrix4(n);
 			let l = M(e), f = N(e, m);
-			O(P(l), p, Ie), O(P(f), p, Le);
-			let h = t.intersectsBox(Ie), g = t.intersectsBox(Le);
-			C = h && B(d, l, r, n, i, o, a, c, s + 1, t, !u) || g && B(d, f, r, n, i, o, a, c, s + 1, t, !u), z.releasePrimitive(t);
+			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 = B(e, f, n, r, i, a, o, s, c + 1, l, u);
+		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(ze).applyMatrix4(n);
+			t.copy(Re).applyMatrix4(n);
 			let l = M(e), d = N(e, m);
-			O(P(l), p, Ie), O(P(d), p, Le);
-			let h = t.intersectsBox(Ie), g = t.intersectsBox(Le);
-			C = h && B(f, l, r, n, i, o, a, c, s + 1, t, !u) || g && B(f, d, r, n, i, o, a, c, s + 1, t, !u), z.releasePrimitive(t);
+			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 He = new class {
+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) => {
@@ -507,7 +543,7 @@ var He = new class {
 			});
 		};
 	}
-}(), Ue = /* @__PURE__ */ new r(), V = /* @__PURE__ */ new Float32Array(6), We = class {
+}(), He = /* @__PURE__ */ new n(), Ue = /* @__PURE__ */ new Float32Array(6), We = class {
 	constructor() {
 		this._roots = null, this.primitiveBuffer = null, this.primitiveBufferStride = null;
 	}
@@ -529,8 +565,8 @@ var He = new class {
 	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, V, 0);
-			let [e, t, r, u, d, f] = V;
+			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;
@@ -538,8 +574,8 @@ var He = new class {
 	computePrimitiveBounds(e, t, n) {
 		let r = n.offset || 0;
 		for (let i = e, a = e + t; i < a; i++) {
-			this.writePrimitiveBounds(i, V, 0);
-			let [e, t, a, o, s, c] = V, 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;
+			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;
@@ -559,7 +595,7 @@ var He = new class {
 		}
 	}
 	traverse(e, t = 0) {
-		He.setBVH(this, t), He.traverse(e), He.reset();
+		Ve.setBVH(this, t), Ve.traverse(e), Ve.reset();
 	}
 	refit() {
 		let e = this._roots;
@@ -569,7 +605,7 @@ var He = new class {
 				let t = e * 8, n = t * 2;
 				if (k(n, i)) {
 					let e = A(t, r), o = j(n, i);
-					this.writePrimitiveRangeBounds(e, o, V, 0), a.set(V, t);
+					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++) {
@@ -582,7 +618,7 @@ var He = new class {
 	}
 	getBoundingBox(e) {
 		return e.makeEmpty(), this._roots.forEach((t) => {
-			O(0, new Float32Array(t), Ue), e.union(Ue);
+			O(0, new Float32Array(t), He), e.union(He);
 		}), e;
 	}
 	shapecast(e) {
@@ -601,7 +637,7 @@ var He = new class {
 	}
 	bvhcast(e, t, n) {
 		let { intersectsRanges: r } = n;
-		return Ve(this, e, t, r);
+		return Be(this, e, t, r);
 	}
 };
 //#endregion
@@ -622,9 +658,9 @@ function Je(e, t = ArrayBuffer) {
 }
 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;
+		let n = e.attributes.position.count, i = Je(n, t.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer);
+		e.setIndex(new r(i, 1));
+		for (let e = 0; e < n; e++) i[e] = e;
 	}
 }
 function Xe(e, t, n) {
@@ -701,12 +737,12 @@ var et = class extends We {
 		}, t[D] || this.init(t);
 	}
 	init(e) {
-		let { geometry: t, primitiveStride: n } = this;
+		let { geometry: t, primitiveStride: r } = this;
 		if (e.indirect) {
-			let r = $e(Qe(t, e.range, n), e.useSharedArrayBuffer);
-			this._indirectBuffer = r;
+			let n = $e(Qe(t, e.range, r), e.useSharedArrayBuffer);
+			this._indirectBuffer = n;
 		} else Ye(t, e);
-		super.init(e), !t.boundingBox && e.setBoundingBox && (t.boundingBox = this.getBoundingBox(new r()));
+		super.init(e), !t.boundingBox && e.setBoundingBox && (t.boundingBox = this.getBoundingBox(new n()));
 	}
 	getRootRanges(e) {
 		return this.indirect ? [{
@@ -742,7 +778,7 @@ var et = class extends We {
 	}
 };
 H.prototype.setFromBox = (function() {
-	let e = /* @__PURE__ */ new b();
+	let e = /* @__PURE__ */ new p();
 	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++) {
@@ -756,7 +792,7 @@ H.prototype.setFromBox = (function() {
 //#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();
+	let e = /* @__PURE__ */ new p(), t = /* @__PURE__ */ new p(), n = /* @__PURE__ */ new p();
 	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);
@@ -764,7 +800,7 @@ var tt = (function() {
 		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();
+	let e = /* @__PURE__ */ new f(), t = /* @__PURE__ */ new p(), n = /* @__PURE__ */ new p();
 	return function(r, i, a, o) {
 		tt(r, i, e);
 		let s = e.x, c = e.y;
@@ -793,7 +829,7 @@ var tt = (function() {
 		}
 	};
 })(), rt = (function() {
-	let e = /* @__PURE__ */ new b(), t = /* @__PURE__ */ new b(), n = /* @__PURE__ */ new p(), r = /* @__PURE__ */ new c();
+	let e = /* @__PURE__ */ new p(), t = /* @__PURE__ */ new p(), n = /* @__PURE__ */ new c(), r = /* @__PURE__ */ new o();
 	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;
@@ -812,14 +848,14 @@ var tt = (function() {
 function W(e) {
 	return Math.abs(e) < U;
 }
-var G = class extends v {
+var G = class extends d {
 	constructor(...e) {
 		super(...e), this.isExtendedTriangle = !0, this.satAxes = [
 			,
 			,
 			,
 			,
-		].fill().map(() => new b()), this.satBounds = [
+		].fill().map(() => new p()), this.satBounds = [
 			,
 			,
 			,
@@ -828,7 +864,7 @@ var G = class extends v {
 			this.a,
 			this.b,
 			this.c
-		], this.plane = new p(), this.isDegenerateIntoSegment = !1, this.isDegenerateIntoPoint = !1, this.degenerateSegment = new c(), this.needsUpdate = !0;
+		], this.plane = new c(), this.isDegenerateIntoSegment = !1, this.isDegenerateIntoPoint = !1, this.degenerateSegment = new o(), this.needsUpdate = !0;
 	}
 	intersectsSphere(e) {
 		return rt(e, this);
@@ -847,7 +883,7 @@ var G = class extends v {
 	}
 };
 G.prototype.closestPointToSegment = (function() {
-	let e = /* @__PURE__ */ new b(), t = /* @__PURE__ */ new b(), n = /* @__PURE__ */ new c();
+	let e = /* @__PURE__ */ new p(), t = /* @__PURE__ */ new p(), n = /* @__PURE__ */ new o();
 	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++) {
@@ -857,44 +893,44 @@ G.prototype.closestPointToSegment = (function() {
 		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 e = /* @__PURE__ */ new G(), t = /* @__PURE__ */ new H(), n = /* @__PURE__ */ new H(), r = /* @__PURE__ */ new p(), i = /* @__PURE__ */ new p(), a = /* @__PURE__ */ new p(), s = /* @__PURE__ */ new p(), c = /* @__PURE__ */ new o(), l = /* @__PURE__ */ new o(), u = /* @__PURE__ */ new p(), d = /* @__PURE__ */ new f(), m = /* @__PURE__ */ new f();
+	function h(e, i, a, o) {
 		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 a = l[r], o = u[r];
+			if (t.setFromPoints(o, i.points), a.isSeparated(t) || (s.copy(c).cross(o), t.setFromPoints(s, e.points), n.setFromPoints(s, 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;
+			let a = d[r], o = f[r];
+			if (t.setFromPoints(o, e.points), a.isSeparated(t) || (s.crossVectors(c, o), t.setFromPoints(s, e.points), n.setFromPoints(s, 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;
+		return a && (o || 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) {
+	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 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);
+	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 g(e, t, n, i) {
+	function v(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));
+		return W(o) ? W(s) ? h(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) {
+	function y(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) {
+	function b(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;
 	}
@@ -906,50 +942,50 @@ G.prototype.closestPointToSegment = (function() {
 			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);
+		} else if (t.isDegenerateIntoPoint) return b(e, t, n);
+		else return v(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 ? 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, 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;
+		let s = this.plane, f = t.plane, p = f.distanceToPoint(this.a), g = f.distanceToPoint(this.b), v = f.distanceToPoint(this.c);
+		W(p) && (p = 0), W(g) && (g = 0), W(v) && (v = 0);
+		let y = p * g, b = p * v;
 		if (y > 0 && b > 0) return !1;
-		let S = c.distanceToPoint(t.a), C = c.distanceToPoint(t.b), w = c.distanceToPoint(t.c);
+		let S = s.distanceToPoint(t.a), C = s.distanceToPoint(t.b), w = s.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);
+		i.copy(s.normal), a.copy(f.normal);
+		let E = i.cross(a), te = 0, ne = Math.abs(E.x), re = Math.abs(E.y);
+		re > ne && (ne = re, te = 1), Math.abs(E.z) > ne && (te = 2);
+		let D = it[te], 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 (_(this, ie, O, ae, y, b, p, g, v, d, c) || _(t, oe, se, ce, T, ee, S, C, w, m, l)) return h(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);
+			d.y = d.x, d.x = e, u.copy(c.start), c.start.copy(c.end), c.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);
+		if (m.y < m.x) {
+			let e = m.y;
+			m.y = m.x, m.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);
+		return d.y < m.x || m.y < d.x ? !1 : (n && (m.x > d.x ? n.start.copy(l.start) : n.start.copy(c.start), m.y < d.y ? n.end.copy(l.end) : n.end.copy(c.end)), !0);
 	};
 })(), G.prototype.distanceToPoint = (function() {
-	let e = /* @__PURE__ */ new b();
+	let e = /* @__PURE__ */ new p();
 	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 = [
+	let e = /* @__PURE__ */ new p(), t = /* @__PURE__ */ new p(), n = [
 		"a",
 		"b",
 		"c"
-	], r = /* @__PURE__ */ new c(), i = /* @__PURE__ */ new c();
+	], r = /* @__PURE__ */ new o(), i = /* @__PURE__ */ new o();
 	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;
@@ -977,11 +1013,11 @@ G.prototype.closestPointToSegment = (function() {
 //#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 = [
+		this.isOrientedBox = !0, this.min = new p(), this.max = new p(), this.matrix = new s(), this.invMatrix = new s(), this.points = Array(8).fill().map(() => new p()), this.satAxes = [
 			,
 			,
 			,
-		].fill().map(() => new b()), this.satBounds = [
+		].fill().map(() => new p()), this.satBounds = [
 			,
 			,
 			,
@@ -1030,7 +1066,7 @@ K.prototype.update = (function() {
 		,
 		,
 		,
-	], n = /* @__PURE__ */ new H(), r = /* @__PURE__ */ new H(), i = /* @__PURE__ */ new b();
+	], n = /* @__PURE__ */ new H(), r = /* @__PURE__ */ new H(), i = /* @__PURE__ */ new p();
 	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;
@@ -1058,7 +1094,7 @@ K.prototype.update = (function() {
 		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();
+	let e = new p();
 	return function(t) {
 		return this.closestPointToPoint(t, e), t.distanceTo(e);
 	};
@@ -1067,7 +1103,7 @@ K.prototype.update = (function() {
 		"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();
+	], t = /* @__PURE__ */ Array(12).fill().map(() => new o()), n = /* @__PURE__ */ Array(12).fill().map(() => new o()), r = /* @__PURE__ */ new p(), i = /* @__PURE__ */ new p();
 	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;
@@ -1105,7 +1141,7 @@ var q = /* @__PURE__ */ new class extends Oe {
 	constructor() {
 		super(() => new G());
 	}
-}(), ot = /* @__PURE__ */ new b(), st = /* @__PURE__ */ new b();
+}(), ot = /* @__PURE__ */ new p(), st = /* @__PURE__ */ new p();
 function ct(e, t, n = {}, r = 0, i = Infinity) {
 	let a = r * r, o = i * i, s = Infinity, c = null;
 	if (e.shapecast({
@@ -1122,10 +1158,10 @@ function ct(e, t, n = {}, r = 0, i = Infinity) {
 }
 //#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) {
+var lt = parseInt(l) >= 169, ut = parseInt(l) <= 161, J = /* @__PURE__ */ new p(), Y = /* @__PURE__ */ new p(), X = /* @__PURE__ */ new p(), dt = /* @__PURE__ */ new f(), ft = /* @__PURE__ */ new f(), pt = /* @__PURE__ */ new f(), mt = /* @__PURE__ */ new p(), ht = /* @__PURE__ */ new p(), gt = /* @__PURE__ */ new p(), _t = /* @__PURE__ */ new p();
+function vt(e, n, r, a, 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;
+	if (u = s === t ? e.intersectTriangle(a, r, n, !0, o) : e.intersectTriangle(n, r, a, s !== i, o), u === null) return null;
 	let d = e.origin.distanceTo(o);
 	return d < c || d > l ? null : {
 		distance: d,
@@ -1134,36 +1170,36 @@ function vt(e, n, r, i, o, s, c, l) {
 }
 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) {
+	let m = vt(e, J, Y, X, _t, c, l, u);
+	if (m) {
 		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);
+			dt.fromBufferAttribute(r, a), ft.fromBufferAttribute(r, o), pt.fromBufferAttribute(r, s), m.uv = new f();
+			let e = d.getInterpolation(_t, J, Y, X, dt, ft, pt, m.uv);
+			lt || (m.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);
+			dt.fromBufferAttribute(i, a), ft.fromBufferAttribute(i, o), pt.fromBufferAttribute(i, s), m.uv1 = new f();
+			let e = d.getInterpolation(_t, J, Y, X, dt, ft, pt, m.uv1);
+			lt || (m.uv1 = e), ut && (m.uv2 = m.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);
+			mt.fromBufferAttribute(n, a), ht.fromBufferAttribute(n, o), gt.fromBufferAttribute(n, s), m.normal = new p();
+			let t = d.getInterpolation(_t, J, Y, X, mt, ht, gt, m.normal);
+			m.normal.dot(e.direction) > 0 && m.normal.multiplyScalar(-1), lt || (m.normal = t);
 		}
 		let t = {
 			a,
 			b: o,
 			c: s,
-			normal: new b(),
+			normal: new p(),
 			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;
+		if (d.getNormal(J, Y, X, t.normal), m.face = t, m.faceIndex = a, lt) {
+			let e = new p();
+			d.getBarycoord(_t, J, Y, X, e), m.barycoord = e;
 		}
 	}
-	return d;
+	return m;
 }
 function bt(e) {
 	return e && e.isMaterial ? e.side : e;
@@ -1325,50 +1361,50 @@ function Nt(e, t, n, r, i, a) {
 }
 //#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) {
+var Pt = /* @__PURE__ */ new n(), Ft = /* @__PURE__ */ new G(), $ = /* @__PURE__ */ new G(), It = /* @__PURE__ */ new s(), Lt = /* @__PURE__ */ new K(), Rt = /* @__PURE__ */ new K();
+function zt(e, t, n, r) {
 	L.setBuffer(e._roots[t]);
-	let i = Vt(0, e, n, r);
+	let i = Bt(0, e, n, r);
 	return L.clearBuffer(), i;
 }
-function Vt(e, t, n, r, i = null) {
+function Bt(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)) {
+	if (i === null && (n.boundingBox || n.computeBoundingBox(), Lt.set(n.boundingBox.min, n.boundingBox.max, r), i = Lt), 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),
+		if (It.copy(r).invert(), n.boundsTree) return O(P(e), a, Rt), Rt.matrix.copy(It), Rt.needsUpdate = !0, n.boundsTree.shapecast({
+			intersectsBounds: (e) => Rt.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;
+				for (let t = p * 3, n = (m + p) * 3; t < n; t += 3) if (Z($, t, l, u), $.needsUpdate = !0, e.intersectsTriangle($)) 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;
+				Z(Ft, t, l, u), Ft.a.applyMatrix4(It), Ft.b.applyMatrix4(It), Ft.c.applyMatrix4(It), Ft.needsUpdate = !0;
+				for (let t = 0, n = e * 3; t < n; t += 3) if (Z($, t, d, f), $.needsUpdate = !0, Ft.intersectsTriangle($)) 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)));
+		return O(P(o), a, Pt), !!(i.intersectsBox(Pt) && Bt(o, t, n, r, i) || (O(P(c), a, Pt), i.intersectsBox(Pt) && Bt(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);
+var Vt = /* @__PURE__ */ new s(), Ht = /* @__PURE__ */ new K(), Ut = /* @__PURE__ */ new K(), Wt = /* @__PURE__ */ new p(), Gt = /* @__PURE__ */ new p(), Kt = /* @__PURE__ */ new p(), qt = /* @__PURE__ */ new p();
+function Jt(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
+	t.boundingBox || t.computeBoundingBox(), Ht.set(t.boundingBox.min, t.boundingBox.max, n), Ht.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 = Wt, h = Gt, g = null, _ = null;
+	i && (g = Kt, _ = qt);
 	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,
+	return Vt.copy(n).invert(), Ut.matrix.copy(Vt), e.shapecast({
+		boundsTraverseOrder: (e) => Ht.distanceToBox(e),
+		intersectsBounds: (e, t, n) => n < v && n < o ? (t && (Ut.min.copy(e.min), Ut.max.copy(e.max), Ut.needsUpdate = !0), !0) : !1,
 		intersectsRange: (e, r) => {
 			if (t.boundsTree) return t.boundsTree.shapecast({
-				boundsTraverseOrder: (e) => Wt.distanceToBox(e),
+				boundsTraverseOrder: (e) => Ut.distanceToBox(e),
 				intersectsBounds: (e, t, n) => n < v && n < o,
 				intersectsRange: (t, i) => {
 					for (let o = t, s = t + i; o < s; o++) {
@@ -1393,11 +1429,11 @@ function Yt(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
 				}
 			}
 		}
-	}), 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);
+	}), 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(Vt), h.applyMatrix4(Vt), 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) {
+function Yt(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;
@@ -1438,94 +1474,94 @@ function Xt(e, t = null) {
 }
 //#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 Xt(e, t, n, r, i, a, o) {
+	L.setBuffer(e._roots[t]), Zt(0, e, n, r, i, a, o), L.clearBuffer();
 }
-function Qt(e, t, n, r, i, a, o) {
+function Zt(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);
+		Q(c, s, r, a, o) && Zt(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);
+		Q(u, s, r, a, o) && Zt(u, t, n, r, i, a, o);
 	}
 }
 //#endregion
 //#region node_modules/three-mesh-bvh/src/core/cast/raycastFirst_indirect.generated.js
-var $t = [
+var Qt = [
 	"x",
 	"y",
 	"z"
 ];
-function en(e, t, n, r, i, a) {
+function $t(e, t, n, r, i, a) {
 	L.setBuffer(e._roots[t]);
-	let o = tn(0, e, n, r, i, a);
+	let o = en(0, e, n, r, i, a);
 	return L.clearBuffer(), o;
 }
-function tn(e, t, n, r, i, a) {
+function en(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;
+		let s = ue(e, c), l = Qt[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;
+		let p = Q(d, o, r, i, a) ? en(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;
+		let m = Q(f, o, r, i, a) ? en(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) {
+var tn = /* @__PURE__ */ new n(), nn = /* @__PURE__ */ new G(), rn = /* @__PURE__ */ new G(), an = /* @__PURE__ */ new s(), on = /* @__PURE__ */ new K(), sn = /* @__PURE__ */ new K();
+function cn(e, t, n, r) {
 	L.setBuffer(e._roots[t]);
-	let i = un(0, e, n, r);
+	let i = ln(0, e, n, r);
 	return L.clearBuffer(), i;
 }
-function un(e, t, n, r, i = null) {
+function ln(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)) {
+	if (i === null && (n.boundingBox || n.computeBoundingBox(), on.set(n.boundingBox.min, n.boundingBox.max, r), i = on), 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),
+		if (an.copy(r).invert(), n.boundsTree) return O(P(e), a, sn), sn.matrix.copy(an), sn.needsUpdate = !0, n.boundsTree.shapecast({
+			intersectsBounds: (e) => sn.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;
+				for (let n = p, r = m + p; n < r; n++) if (Z(rn, 3 * t.resolveTriangleIndex(n), l, u), rn.needsUpdate = !0, e.intersectsTriangle(rn)) 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;
+				Z(nn, 3 * t.resolveTriangleIndex(n), l, u), nn.a.applyMatrix4(an), nn.b.applyMatrix4(an), nn.c.applyMatrix4(an), nn.needsUpdate = !0;
+				for (let t = 0, n = e * 3; t < n; t += 3) if (Z(rn, t, d, f), rn.needsUpdate = !0, nn.intersectsTriangle(rn)) 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)));
+		return O(P(o), a, tn), !!(i.intersectsBox(tn) && ln(o, t, n, r, i) || (O(P(c), a, tn), i.intersectsBox(tn) && ln(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);
+var un = /* @__PURE__ */ new s(), dn = /* @__PURE__ */ new K(), fn = /* @__PURE__ */ new K(), pn = /* @__PURE__ */ new p(), mn = /* @__PURE__ */ new p(), hn = /* @__PURE__ */ new p(), gn = /* @__PURE__ */ new p();
+function _n(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
+	t.boundingBox || t.computeBoundingBox(), dn.set(t.boundingBox.min, t.boundingBox.max, n), dn.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 = pn, h = mn, g = null, _ = null;
+	i && (g = hn, _ = gn);
 	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,
+	return un.copy(n).invert(), fn.matrix.copy(un), e.shapecast({
+		boundsTraverseOrder: (e) => dn.distanceToBox(e),
+		intersectsBounds: (e, t, n) => n < v && n < o ? (t && (fn.min.copy(e.min), fn.max.copy(e.max), fn.needsUpdate = !0), !0) : !1,
 		intersectsRange: (r, i) => {
 			if (t.boundsTree) {
 				let s = t.boundsTree;
 				return s.shapecast({
-					boundsTraverseOrder: (e) => pn.distanceToBox(e),
+					boundsTraverseOrder: (e) => fn.distanceToBox(e),
 					intersectsBounds: (e, t, n) => n < v && n < o,
 					intersectsRange: (t, o) => {
 						for (let x = t, S = t + o; x < S; x++) {
@@ -1553,20 +1589,20 @@ function vn(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
 				}
 			}
 		}
-	}), 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);
+	}), 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(un), h.applyMatrix4(un), 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) {
+function vn(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 = [
+var yn = /* @__PURE__ */ new K(), bn = /* @__PURE__ */ new u(), xn = /* @__PURE__ */ new p(), Sn = /* @__PURE__ */ new s(), Cn = /* @__PURE__ */ new p(), wn = [
 	"getX",
 	"getY",
 	"getZ"
-], En = class e extends et {
+], Tn = class e extends et {
 	static serialize(e, t = {}) {
 		t = {
 			cloneBuffers: !0,
@@ -1580,22 +1616,22 @@ var bn = /* @__PURE__ */ new K(), xn = /* @__PURE__ */ new g(), Sn = /* @__PURE_
 		};
 		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 = {
+	static deserialize(t, n, i = {}) {
+		i = {
 			setIndex: !0,
 			indirect: !!t.indirectBuffer,
-			...r
+			...i
 		};
 		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,
+			...i,
 			[D]: !0
 		});
-		if (c._roots = o, c._indirectBuffer = s || null, r.setIndex) {
+		if (c._roots = o, c._indirectBuffer = s || null, i.setIndex) {
 			let e = n.getIndex();
 			if (e === null) {
-				let e = new i(t.index, 1, !1);
+				let e = new r(t.index, 1, !1);
 				n.setIndex(e);
 			} else e.array !== a && (e.array.set(a), e.needsUpdate = !0);
 		}
@@ -1629,7 +1665,7 @@ var bn = /* @__PURE__ */ new K(), xn = /* @__PURE__ */ new g(), Sn = /* @__PURE_
 		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;
+			let r = a[wn[e]](c), i = a[wn[e]](l), o = a[wn[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;
@@ -1665,38 +1701,38 @@ var bn = /* @__PURE__ */ new K(), xn = /* @__PURE__ */ new g(), Sn = /* @__PURE_
 	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;
+		Sn.copy(e.matrixWorld).invert(), bn.copy(t.ray).applyMatrix4(Sn), Cn.setFromMatrixScale(e.matrixWorld), xn.copy(bn.direction).multiply(Cn);
+		let i = xn.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);
+			let i = this.raycastFirst(bn, r, a, o);
+			i = vn(i, e, t), i && n.push(i);
 		} else {
-			let i = this.raycast(xn, r, a, o);
+			let i = this.raycast(bn, r, a, o);
 			for (let r = 0, a = i.length; r < a; r++) {
-				let a = yn(i[r], e, t);
+				let a = vn(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 (this.indirect ? Yt : Tt)(this, e);
+	}
+	raycast(e, t = a, n = 0, r = Infinity) {
+		let i = this._roots, o = [], s = this.indirect ? Xt : kt;
+		for (let a = 0, c = i.length; a < c; a++) s(this, a, t, e, o, n, r);
+		return o;
+	}
+	raycastFirst(e, t = a, n = 0, r = Infinity) {
+		let i = this._roots, o = null, s = this.indirect ? $t : Mt;
+		for (let a = 0, c = i.length; a < c; a++) {
+			let i = s(this, a, t, e, n, r);
+			i != null && (o == null || i.distance < o.distance) && (o = i);
 		}
-		return a;
+		return o;
 	}
 	intersectsGeometry(e, t) {
-		let n = !1, r = this._roots, i = this.indirect ? ln : Bt;
+		let n = !1, r = this._roots, i = this.indirect ? cn : zt;
 		for (let a = 0, o = r.length; a < o && (n = i(this, a, e, t), !n); a++);
 		return n;
 	}
@@ -1740,9 +1776,9 @@ var bn = /* @__PURE__ */ new K(), xn = /* @__PURE__ */ new g(), Sn = /* @__PURE_
 		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)
+		return yn.set(e.min, e.max, t), yn.needsUpdate = !0, this.shapecast({
+			intersectsBounds: (e) => yn.intersectsBox(e),
+			intersectsTriangle: (e) => yn.intersectsTriangle(e)
 		});
 	}
 	intersectsSphere(e) {
@@ -1752,121 +1788,22 @@ var bn = /* @__PURE__ */ new K(), xn = /* @__PURE__ */ new g(), Sn = /* @__PURE_
 		});
 	}
 	closestPointToGeometry(e, t, n = {}, r = {}, i = 0, a = Infinity) {
-		return (this.indirect ? vn : Yt)(this, e, t, n, r, i, a);
+		return (this.indirect ? _n : Jt)(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
+}, En = "contact-shadow-baked", Dn = "contact-shadow-live", On = "softboxContactShadowHelper", kn = "softboxPathTracingFloor", An = Math.PI * (3 - Math.sqrt(5));
 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);
-	});
+	let t = e.getObjectByName(En);
+	t && (e.remove(t), T(t));
 }
 function Mn(e) {
-	e.boundsTree &&= void 0;
-}
-//#endregion
-//#region src/infrastructure/three/disposal.ts
-var Nn = "softboxExternallyOwnedTextures", Pn = "softboxBackgroundNode", Fn = "softboxStashedMaterials";
-function In(t) {
-	if (!t.userData.softboxDisposed) {
-		if (!t.userData?.softboxExternallyOwnedTextures) {
-			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(), t.userData.softboxDisposed = !0;
-	}
-}
-function Ln(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(In) : n && In(n), (e.userData?.[Fn])?.forEach(In);
-		let r = e;
-		r.isLight && r.shadow?.dispose && r.shadow.dispose();
-	});
-}
-function Rn(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]) n?.keepBackgrounds && e.userData?.softboxBackgroundNode || (Ln(e), t.remove(e));
-}
-//#endregion
-//#region src/infrastructure/three/ContactShadowBaker.ts
-var zn = "contact-shadow-baked", Bn = "contact-shadow-live", Vn = "softboxContactShadowHelper", Hn = "softboxPathTracingFloor", Un = Math.PI * (3 - Math.sqrt(5));
-function Wn(e) {
-	let t = e.getObjectByName(zn);
-	t && (e.remove(t), Ln(t));
-}
-function Gn(e) {
-	Wn(e);
-	let t = e.getObjectByName(Bn);
+	jn(e);
+	let t = e.getObjectByName(Dn);
 	t && (t.visible = !0);
 }
-var Kn = class t {
+var Nn = class t {
 	static {
 		this.AMBIENT_RATIO = .62;
 	}
@@ -1929,7 +1866,7 @@ var Kn = class t {
 		}
 		let s = this.measureBakeRegion(a);
 		if (!s) return;
-		let c = i.getObjectByName(Bn);
+		let c = i.getObjectByName(Dn);
 		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,
@@ -1948,10 +1885,10 @@ var Kn = class t {
 		this.installBakedMesh(i, s, l, u);
 	}
 	leaveLiveCatcherInCharge(e) {
-		Gn(e);
+		Mn(e);
 	}
 	evictBakedMesh(e) {
-		Wn(e);
+		jn(e);
 	}
 	measureBakeRegion(n) {
 		let r = new e.Box3().setFromObject(n);
@@ -2020,12 +1957,12 @@ var Kn = class t {
 		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 * Un;
+			let t = m * Math.sqrt((e + .5) / f), n = e * An;
 			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)), _ = t.AMBIENT_MAX_ELEVATION_SIN;
 		for (let t = 0; t < d; t++) {
-			let n = Math.sqrt((t + .5) / d), r = g + (_ - g) * n, i = Math.sqrt(1 - r * r), o = t * Un;
+			let n = Math.sqrt((t + .5) / d), r = g + (_ - g) * n, i = Math.sqrt(1 - r * r), o = t * An;
 			h.push(new e.Vector3(i * Math.cos(o), r, i * Math.sin(o)).multiplyScalar(s).add(a));
 		}
 		return h;
@@ -2043,10 +1980,10 @@ var Kn = class t {
 			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 = zn, s.userData[Vn] = !0, s.rotation.x = -Math.PI / 2;
+		s.name = En, s.userData[On] = !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(Bn);
+		let l = n.getObjectByName(Dn);
 		l && (l.visible = !1);
 	}
 	disableColorWrite(e) {
@@ -2063,33 +2000,6 @@ var Kn = class t {
 			t.colorWrite = e;
 		});
 	}
-}, qn = (e, t) => {
-	if (e && typeof e == "object") {
-		let n = e[t];
-		if (typeof n == "function") return n.call(e);
-	}
-	return null;
-};
-function Jn(t) {
-	return qn(t, "getThreeObject") ?? (t instanceof e.Object3D ? t : null);
-}
-function Yn(t) {
-	return qn(t, "getThreeCamera") ?? (t instanceof e.Camera ? t : null);
-}
-function Xn(t) {
-	return qn(t, "getThreeScene") ?? (t instanceof e.Scene ? t : null);
-}
-function Zn(t) {
-	return qn(t, "getThreeTexture") ?? (t instanceof e.Texture ? t : null);
-}
-function Qn(t) {
-	return qn(t, "getThreeRenderer") ?? (t instanceof e.WebGLRenderer ? t : null);
-}
-function $n(e) {
-	return qn(e, "getThreeControls");
-}
-//#endregion
-//#region src/utils/smoothstep.ts
-var er = (e) => e * e * (3 - 2 * e);
+}, Pn = (e) => e * e * (3 - 2 * e);
 //#endregion
-export { ee as A, Ke as C, A as D, k as E, x as F, w as M, C as N, ue as O, S as P, Je as S, j as T, In as _, Qn as a, jn as b, zn as c, Kn as d, Hn as f, Fn as g, Nn as h, Jn as i, T as j, ne as k, Vn as l, Pn as m, Yn as n, Xn as o, Gn as p, $n as r, Zn as s, er as t, Bn as u, Ln as v, P as w, En as x, Rn as y };
+export { y as C, h as D, g as E, m as O, ee as S, _ as T, x as _, Nn as a, C as b, Tn as c, P as d, j as f, ne as g, ue as h, Dn as i, Je as l, A as m, En as n, kn as o, k as p, On as r, Mn as s, Pn as t, Ke as u, b as v, v as w, T as x, S as y };