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

package/lib/{src-HhklrVDg.mjs → src-Dg0wYIom.mjs}

@@ -1,4 +1,4 @@
-import { Bt as e, Ci as t, Er as n, Qr as r, Si as i, cn as a, f as o, h as s, kn as c, m as l, sn as u, ui as d } from "./three.core-0KaTx8dm.mjs";
+import { An as e, Dr as t, Ei as n, Ti as r, Vt as i, cn as a, ei as o, f as s, h as c, ln as l, m as u, pi as d } from "./three.core-BTUCraWz.mjs";
 var f = 1.25, p = 65535;
 p << 16;
 var m = 2 ** -24, h = Symbol("SKIP_GENERATION"), g = {
@@ -278,7 +278,7 @@ var ge = class {
 			t = null, this.float32Array = null, this.uint16Array = null, this.uint32Array = null, e.length !== 0 && this.setBuffer(e.pop());
 		};
 	}
-}(), P, _e, ve = [], ye = /* @__PURE__ */ new ge(() => new o());
+}(), P, _e, ve = [], ye = /* @__PURE__ */ new ge(() => new s());
 function be(e, t, n, r, i, a) {
 	P = ye.getPrimitive(), _e = ye.getPrimitive(), ve.push(P, _e), N.setBuffer(e._roots[t]);
 	let o = xe(0, e.geometry, n, r, i, a);
@@ -327,19 +327,19 @@ function xe(e, t, n, r, i = null, a = 0, o = 0) {
 }
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/core/cast/bvhcast.js
-var Se = /* @__PURE__ */ new N.constructor(), Ce = /* @__PURE__ */ new N.constructor(), F = /* @__PURE__ */ new ge(() => new o()), we = /* @__PURE__ */ new o(), Te = /* @__PURE__ */ new o(), Ee = /* @__PURE__ */ new o(), De = /* @__PURE__ */ new o(), Oe = !1;
+var Se = /* @__PURE__ */ new N.constructor(), Ce = /* @__PURE__ */ new N.constructor(), F = /* @__PURE__ */ new ge(() => new s()), we = /* @__PURE__ */ new s(), Te = /* @__PURE__ */ new s(), Ee = /* @__PURE__ */ new s(), De = /* @__PURE__ */ new s(), Oe = !1;
 function ke(e, t, n, r) {
 	if (Oe) throw Error("MeshBVH: Recursive calls to bvhcast not supported.");
 	Oe = !0;
-	let i = e._roots, a = t._roots, o, s = 0, c = 0, l = new u().copy(n).invert();
+	let i = e._roots, o = t._roots, s, c = 0, l = 0, u = new a().copy(n).invert();
 	for (let e = 0, t = i.length; e < t; e++) {
-		Se.setBuffer(i[e]), c = 0;
+		Se.setBuffer(i[e]), l = 0;
 		let t = F.getPrimitive();
-		_(k(0), Se.float32Array, t), t.applyMatrix4(l);
-		for (let e = 0, i = a.length; e < i && (Ce.setBuffer(a[e]), o = I(0, 0, n, l, r, s, c, 0, 0, t), Ce.clearBuffer(), c += a[e].byteLength / 32, !o); e++);
-		if (F.releasePrimitive(t), Se.clearBuffer(), s += i[e].byteLength / 32, o) break;
+		_(k(0), Se.float32Array, t), t.applyMatrix4(u);
+		for (let e = 0, i = o.length; e < i && (Ce.setBuffer(o[e]), s = I(0, 0, n, u, r, c, l, 0, 0, t), Ce.clearBuffer(), l += o[e].byteLength / 32, !s); e++);
+		if (F.releasePrimitive(t), Se.clearBuffer(), c += i[e].byteLength / 32, s) break;
 	}
-	return Oe = !1, o;
+	return Oe = !1, s;
 }
 function I(e, t, n, r, i, a = 0, o = 0, s = 0, c = 0, l = null, u = !1) {
 	let d, f;
@@ -425,7 +425,7 @@ var Ae = new class {
 			});
 		};
 	}
-}(), je = /* @__PURE__ */ new o(), Me = /* @__PURE__ */ new Float32Array(6), Ne = class {
+}(), je = /* @__PURE__ */ new s(), Me = /* @__PURE__ */ new Float32Array(6), Ne = class {
 	constructor() {
 		this._roots = null, this.primitiveBuffer = null, this.primitiveBufferStride = null;
 	}
@@ -541,7 +541,7 @@ function Le(e, t = ArrayBuffer) {
 function Re(e, t) {
 	if (!e.index) {
 		let n = e.attributes.position.count, r = Le(n, t.useSharedArrayBuffer ? SharedArrayBuffer : ArrayBuffer);
-		e.setIndex(new l(r, 1));
+		e.setIndex(new u(r, 1));
 		for (let e = 0; e < n; e++) r[e] = e;
 	}
 }
@@ -620,7 +620,7 @@ var Ue = class extends Ne {
 	}
 	init(e) {
 		let { geometry: t, primitiveStride: n } = this;
-		e.indirect ? this._indirectBuffer = He(Ve(t, e.range, n), e.useSharedArrayBuffer) : Re(t, e), super.init(e), !t.boundingBox && e.setBoundingBox && (t.boundingBox = this.getBoundingBox(new o()));
+		e.indirect ? this._indirectBuffer = He(Ve(t, e.range, n), e.useSharedArrayBuffer) : Re(t, e), super.init(e), !t.boundingBox && e.setBoundingBox && (t.boundingBox = this.getBoundingBox(new s()));
 	}
 	getRootRanges(e) {
 		return this.indirect ? [{
@@ -656,7 +656,7 @@ var Ue = class extends Ne {
 	}
 };
 L.prototype.setFromBox = (function() {
-	let e = /* @__PURE__ */ new t();
+	let e = /* @__PURE__ */ new n();
 	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++) {
@@ -683,34 +683,34 @@ L.prototype.setFromBox = (function() {
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/math/MathUtilities.js
 var We = (function() {
-	let e = /* @__PURE__ */ new t(), n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t();
-	return function(t, i, a) {
-		let o = t.start, s = e, c = i.start, l = n;
-		r.subVectors(o, c), e.subVectors(t.end, t.start), n.subVectors(i.end, i.start);
+	let e = /* @__PURE__ */ new n(), t = /* @__PURE__ */ new n(), r = /* @__PURE__ */ new n();
+	return function(n, i, a) {
+		let o = n.start, s = e, c = i.start, l = t;
+		r.subVectors(o, c), e.subVectors(n.end, n.start), t.subVectors(i.end, i.start);
 		let u = r.dot(l), d = l.dot(s), f = l.dot(l), p = r.dot(s), m = s.dot(s) * f - d * d, h, g;
 		h = m === 0 ? 0 : (u * d - p * f) / m, g = (u + h * d) / f, a.x = h, a.y = g;
 	};
 })(), Ge = (function() {
-	let e = /* @__PURE__ */ new i(), n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t();
-	return function(t, i, a, o) {
-		We(t, i, e);
+	let e = /* @__PURE__ */ new r(), t = /* @__PURE__ */ new n(), i = /* @__PURE__ */ new n();
+	return function(n, r, a, o) {
+		We(n, r, e);
 		let s = e.x, c = e.y;
 		if (s >= 0 && s <= 1 && c >= 0 && c <= 1) {
-			t.at(s, a), i.at(c, o);
+			n.at(s, a), r.at(c, o);
 			return;
 		} else if (s >= 0 && s <= 1) {
-			c < 0 ? i.at(0, o) : i.at(1, o), t.closestPointToPoint(o, !0, a);
+			c < 0 ? r.at(0, o) : r.at(1, o), n.closestPointToPoint(o, !0, a);
 			return;
 		} else if (c >= 0 && c <= 1) {
-			s < 0 ? t.at(0, a) : t.at(1, a), i.closestPointToPoint(a, !0, o);
+			s < 0 ? n.at(0, a) : n.at(1, a), r.closestPointToPoint(a, !0, o);
 			return;
 		} else {
 			let e;
-			e = s < 0 ? t.start : t.end;
+			e = s < 0 ? n.start : n.end;
 			let l;
-			l = c < 0 ? i.start : i.end;
-			let u = n, d = r;
-			if (t.closestPointToPoint(l, !0, n), i.closestPointToPoint(e, !0, r), u.distanceToSquared(l) <= d.distanceToSquared(e)) {
+			l = c < 0 ? r.start : r.end;
+			let u = t, d = i;
+			if (n.closestPointToPoint(l, !0, t), r.closestPointToPoint(e, !0, i), u.distanceToSquared(l) <= d.distanceToSquared(e)) {
 				a.copy(u), o.copy(l);
 				return;
 			} else {
@@ -720,14 +720,14 @@ var We = (function() {
 		}
 	};
 })(), Ke = (function() {
-	let n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t(), i = /* @__PURE__ */ new c(), a = /* @__PURE__ */ new e();
-	return function(e, t) {
-		let { radius: o, center: s } = e, { a: c, b: l, c: u } = t;
-		if (a.start = c, a.end = l, a.closestPointToPoint(s, !0, n).distanceTo(s) <= o || (a.start = c, a.end = u, a.closestPointToPoint(s, !0, n).distanceTo(s) <= o) || (a.start = l, a.end = u, a.closestPointToPoint(s, !0, n).distanceTo(s) <= o)) return !0;
-		let d = t.getPlane(i);
-		if (Math.abs(d.distanceToPoint(s)) <= o) {
+	let t = /* @__PURE__ */ new n(), r = /* @__PURE__ */ new n(), a = /* @__PURE__ */ new e(), o = /* @__PURE__ */ new i();
+	return function(e, n) {
+		let { radius: i, center: s } = e, { a: c, b: l, c: u } = n;
+		if (o.start = c, o.end = l, o.closestPointToPoint(s, !0, t).distanceTo(s) <= i || (o.start = c, o.end = u, o.closestPointToPoint(s, !0, t).distanceTo(s) <= i) || (o.start = l, o.end = u, o.closestPointToPoint(s, !0, t).distanceTo(s) <= i)) return !0;
+		let d = n.getPlane(a);
+		if (Math.abs(d.distanceToPoint(s)) <= i) {
 			let e = d.projectPoint(s, r);
-			if (t.containsPoint(e)) return !0;
+			if (n.containsPoint(e)) return !0;
 		}
 		return !1;
 	};
@@ -740,13 +740,13 @@ function z(e) {
 	return Math.abs(e) < R;
 }
 var B = class extends d {
-	constructor(...n) {
-		super(...n), this.isExtendedTriangle = !0, this.satAxes = [
+	constructor(...t) {
+		super(...t), this.isExtendedTriangle = !0, this.satAxes = [
 			,
 			,
 			,
 			,
-		].fill().map(() => new t()), this.satBounds = [
+		].fill().map(() => new n()), this.satBounds = [
 			,
 			,
 			,
@@ -755,7 +755,7 @@ var B = class extends d {
 			this.a,
 			this.b,
 			this.c
-		], this.plane = new c(), this.isDegenerateIntoSegment = !1, this.isDegenerateIntoPoint = !1, this.degenerateSegment = new e(), this.needsUpdate = !0;
+		], this.plane = new e(), this.isDegenerateIntoSegment = !1, this.isDegenerateIntoPoint = !1, this.degenerateSegment = new i(), this.needsUpdate = !0;
 	}
 	intersectsSphere(e) {
 		return Ke(e, this);
@@ -774,31 +774,31 @@ var B = class extends d {
 	}
 };
 B.prototype.closestPointToSegment = (function() {
-	let n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t(), i = /* @__PURE__ */ new e();
-	return function(e, t = null, a = null) {
-		let { start: o, end: s } = e, c = this.points, l, u = Infinity;
+	let e = /* @__PURE__ */ new n(), t = /* @__PURE__ */ new n(), r = /* @__PURE__ */ new i();
+	return function(n, i = null, a = null) {
+		let { start: o, end: s } = n, c = this.points, l, u = Infinity;
 		for (let o = 0; o < 3; o++) {
 			let s = (o + 1) % 3;
-			i.start.copy(c[o]), i.end.copy(c[s]), Ge(i, e, n, r), l = n.distanceToSquared(r), l < u && (u = l, t && t.copy(n), a && a.copy(r));
+			r.start.copy(c[o]), r.end.copy(c[s]), Ge(r, n, e, t), l = e.distanceToSquared(t), l < u && (u = l, i && i.copy(e), a && a.copy(t));
 		}
-		return this.closestPointToPoint(o, n), l = o.distanceToSquared(n), l < u && (u = l, t && t.copy(n), a && a.copy(o)), this.closestPointToPoint(s, n), l = s.distanceToSquared(n), l < u && (u = l, t && t.copy(n), a && a.copy(s)), Math.sqrt(u);
+		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);
 	};
 })(), B.prototype.intersectsTriangle = (function() {
-	let n = /* @__PURE__ */ new B(), r = /* @__PURE__ */ new L(), a = /* @__PURE__ */ new L(), o = /* @__PURE__ */ new t(), s = /* @__PURE__ */ new t(), c = /* @__PURE__ */ new t(), l = /* @__PURE__ */ new t(), u = /* @__PURE__ */ new e(), d = /* @__PURE__ */ new e(), f = /* @__PURE__ */ new t(), p = /* @__PURE__ */ new i(), m = /* @__PURE__ */ new i();
-	function h(e, t, n, i) {
+	let e = /* @__PURE__ */ new B(), t = /* @__PURE__ */ new L(), a = /* @__PURE__ */ new L(), o = /* @__PURE__ */ new n(), s = /* @__PURE__ */ new n(), c = /* @__PURE__ */ new n(), l = /* @__PURE__ */ new n(), u = /* @__PURE__ */ new i(), d = /* @__PURE__ */ new i(), f = /* @__PURE__ */ new n(), p = /* @__PURE__ */ new r(), m = /* @__PURE__ */ new r();
+	function h(e, n, r, i) {
 		let s = o;
-		!e.isDegenerateIntoPoint && !e.isDegenerateIntoSegment ? s.copy(e.plane.normal) : s.copy(t.plane.normal);
+		!e.isDegenerateIntoPoint && !e.isDegenerateIntoSegment ? s.copy(e.plane.normal) : s.copy(n.plane.normal);
 		let c = e.satBounds, u = e.satAxes;
-		for (let n = 1; n < 4; n++) {
-			let i = c[n], o = u[n];
-			if (r.setFromPoints(o, t.points), i.isSeparated(r) || (l.copy(s).cross(o), r.setFromPoints(l, e.points), a.setFromPoints(l, t.points), r.isSeparated(a))) return !1;
+		for (let r = 1; r < 4; r++) {
+			let i = c[r], o = u[r];
+			if (t.setFromPoints(o, n.points), i.isSeparated(t) || (l.copy(s).cross(o), t.setFromPoints(l, e.points), a.setFromPoints(l, n.points), t.isSeparated(a))) return !1;
 		}
-		let d = t.satBounds, f = t.satAxes;
-		for (let n = 1; n < 4; n++) {
-			let i = d[n], o = f[n];
-			if (r.setFromPoints(o, e.points), i.isSeparated(r) || (l.crossVectors(s, o), r.setFromPoints(l, e.points), a.setFromPoints(l, t.points), r.isSeparated(a))) return !1;
+		let d = n.satBounds, f = n.satAxes;
+		for (let r = 1; r < 4; r++) {
+			let i = d[r], o = f[r];
+			if (t.setFromPoints(o, e.points), i.isSeparated(t) || (l.crossVectors(s, o), t.setFromPoints(l, e.points), a.setFromPoints(l, n.points), t.isSeparated(a))) return !1;
 		}
-		return n && (i || console.warn("ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0."), n.start.set(0, 0, 0), n.end.set(0, 0, 0)), !0;
+		return r && (i || console.warn("ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0."), r.start.set(0, 0, 0), r.end.set(0, 0, 0)), !0;
 	}
 	function g(e, t, n, r, i, a, o, s, c, l, u) {
 		let d = o / (o - s);
@@ -839,23 +839,23 @@ B.prototype.closestPointToSegment = (function() {
 		else if (t.isDegenerateIntoPoint) return y(e, t, n);
 		else if (t.isDegenerateIntoSegment) return v(e, t, n, r);
 	}
-	return function(e, t = null, r = !1) {
-		this.needsUpdate && this.update(), e.isExtendedTriangle ? e.needsUpdate && e.update() : (n.copy(e), n.update(), e = n);
-		let i = x(this, e, t, r);
+	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 i = x(this, t, n, r);
 		if (i !== void 0) return i;
-		let a = this.plane, o = e.plane, l = o.distanceToPoint(this.a), g = o.distanceToPoint(this.b), v = o.distanceToPoint(this.c);
+		let a = this.plane, o = t.plane, l = o.distanceToPoint(this.a), g = o.distanceToPoint(this.b), v = o.distanceToPoint(this.c);
 		z(l) && (l = 0), z(g) && (g = 0), z(v) && (v = 0);
 		let y = l * g, b = l * v;
 		if (y > 0 && b > 0) return !1;
-		let S = a.distanceToPoint(e.a), C = a.distanceToPoint(e.b), w = a.distanceToPoint(e.c);
+		let S = a.distanceToPoint(t.a), C = a.distanceToPoint(t.b), w = a.distanceToPoint(t.c);
 		z(S) && (S = 0), z(C) && (C = 0), z(w) && (w = 0);
 		let T = S * C, E = S * w;
 		if (T > 0 && E > 0) return !1;
 		s.copy(a.normal), c.copy(o.normal);
 		let D = s.cross(c), O = 0, k = Math.abs(D.x), A = Math.abs(D.y);
 		A > k && (k = A, O = 1), Math.abs(D.z) > k && (O = 2);
-		let j = qe[O], ee = this.a[j], M = this.b[j], te = this.c[j], ne = e.a[j], re = e.b[j], ie = e.c[j];
-		if (_(this, ee, M, te, y, b, l, g, v, p, u) || _(e, ne, re, ie, T, E, S, C, w, m, d)) return h(this, e, t, r);
+		let j = qe[O], ee = this.a[j], M = this.b[j], te = this.c[j], ne = t.a[j], re = t.b[j], ie = t.c[j];
+		if (_(this, ee, M, te, y, b, l, g, v, p, u) || _(t, ne, re, ie, T, E, S, C, w, m, d)) return h(this, t, n, r);
 		if (p.y < p.x) {
 			let e = p.y;
 			p.y = p.x, p.x = e, f.copy(u.start), u.start.copy(u.end), u.end.copy(f);
@@ -864,37 +864,37 @@ B.prototype.closestPointToSegment = (function() {
 			let e = m.y;
 			m.y = m.x, m.x = e, f.copy(d.start), d.start.copy(d.end), d.end.copy(f);
 		}
-		return p.y < m.x || m.y < p.x ? !1 : (t && (m.x > p.x ? t.start.copy(d.start) : t.start.copy(u.start), m.y < p.y ? t.end.copy(d.end) : t.end.copy(u.end)), !0);
+		return p.y < m.x || m.y < p.x ? !1 : (n && (m.x > p.x ? n.start.copy(d.start) : n.start.copy(u.start), m.y < p.y ? n.end.copy(d.end) : n.end.copy(u.end)), !0);
 	};
 })(), B.prototype.distanceToPoint = (function() {
-	let e = /* @__PURE__ */ new t();
+	let e = /* @__PURE__ */ new n();
 	return function(t) {
 		return this.closestPointToPoint(t, e), t.distanceTo(e);
 	};
 })(), B.prototype.distanceToTriangle = (function() {
-	let n = /* @__PURE__ */ new t(), r = /* @__PURE__ */ new t(), i = [
+	let e = /* @__PURE__ */ new n(), t = /* @__PURE__ */ new n(), r = [
 		"a",
 		"b",
 		"c"
-	], a = /* @__PURE__ */ new e(), o = /* @__PURE__ */ new e();
-	return function(e, t = null, s = null) {
-		let c = t || s ? a : null;
-		if (this.intersectsTriangle(e, c, !0)) return (t || s) && (t && c.getCenter(t), s && c.getCenter(s)), 0;
+	], a = /* @__PURE__ */ new i(), o = /* @__PURE__ */ new i();
+	return function(n, i = null, s = null) {
+		let c = i || s ? a : null;
+		if (this.intersectsTriangle(n, c, !0)) return (i || s) && (i && c.getCenter(i), s && c.getCenter(s)), 0;
 		let l = Infinity;
-		for (let r = 0; r < 3; r++) {
-			let a, o = i[r], c = e[o];
-			this.closestPointToPoint(c, n), a = c.distanceToSquared(n), a < l && (l = a, t && t.copy(n), s && s.copy(c));
+		for (let t = 0; t < 3; t++) {
+			let a, o = r[t], c = n[o];
+			this.closestPointToPoint(c, e), a = c.distanceToSquared(e), a < l && (l = a, i && i.copy(e), s && s.copy(c));
 			let u = this[o];
-			e.closestPointToPoint(u, n), a = u.distanceToSquared(n), a < l && (l = a, t && t.copy(u), s && s.copy(n));
+			n.closestPointToPoint(u, e), a = u.distanceToSquared(e), a < l && (l = a, i && i.copy(u), s && s.copy(e));
 		}
 		for (let c = 0; c < 3; c++) {
-			let u = i[c], d = i[(c + 1) % 3];
+			let u = r[c], d = r[(c + 1) % 3];
 			a.set(this[u], this[d]);
 			for (let c = 0; c < 3; c++) {
-				let u = i[c], d = i[(c + 1) % 3];
-				o.set(e[u], e[d]), Ge(a, o, n, r);
-				let f = n.distanceToSquared(r);
-				f < l && (l = f, t && t.copy(n), s && s.copy(r));
+				let u = r[c], d = r[(c + 1) % 3];
+				o.set(n[u], n[d]), Ge(a, o, e, t);
+				let f = e.distanceToSquared(t);
+				f < l && (l = f, i && i.copy(e), s && s.copy(t));
 			}
 		}
 		return Math.sqrt(l);
@@ -903,12 +903,12 @@ B.prototype.closestPointToSegment = (function() {
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/math/OrientedBox.js
 var V = class {
-	constructor(e, n, r) {
-		this.isOrientedBox = !0, this.min = new t(), this.max = new t(), this.matrix = new u(), this.invMatrix = new u(), this.points = Array(8).fill().map(() => new t()), this.satAxes = [
+	constructor(e, t, r) {
+		this.isOrientedBox = !0, this.min = new n(), this.max = new n(), this.matrix = new a(), this.invMatrix = new a(), this.points = Array(8).fill().map(() => new n()), this.satAxes = [
 			,
 			,
 			,
-		].fill().map(() => new t()), this.satBounds = [
+		].fill().map(() => new n()), this.satBounds = [
 			,
 			,
 			,
@@ -916,7 +916,7 @@ var V = class {
 			,
 			,
 			,
-		].fill().map(() => new L()), this.needsUpdate = !1, e && this.min.copy(e), n && this.max.copy(n), r && this.matrix.copy(r);
+		].fill().map(() => new L()), this.needsUpdate = !1, e && this.min.copy(e), t && this.max.copy(t), r && this.matrix.copy(r);
 	}
 	set(e, t, n) {
 		this.min.copy(e), this.max.copy(t), this.matrix.copy(n), this.needsUpdate = !0;
@@ -953,29 +953,29 @@ V.prototype.update = (function() {
 		return !0;
 	};
 })(), V.prototype.intersectsTriangle = (function() {
-	let e = /* @__PURE__ */ new B(), n = [
+	let e = /* @__PURE__ */ new B(), t = [
 		,
 		,
 		,
-	], r = /* @__PURE__ */ new L(), i = /* @__PURE__ */ new L(), a = /* @__PURE__ */ new t();
-	return function(t) {
-		this.needsUpdate && this.update(), t.isExtendedTriangle ? t.needsUpdate && t.update() : (e.copy(t), e.update(), t = e);
+	], r = /* @__PURE__ */ new L(), i = /* @__PURE__ */ new L(), a = /* @__PURE__ */ new n();
+	return function(n) {
+		this.needsUpdate && this.update(), n.isExtendedTriangle ? n.needsUpdate && n.update() : (e.copy(n), e.update(), n = e);
 		let o = this.satBounds, s = this.satAxes;
-		n[0] = t.a, n[1] = t.b, n[2] = t.c;
+		t[0] = n.a, t[1] = n.b, t[2] = n.c;
 		for (let e = 0; e < 3; e++) {
-			let t = o[e], i = s[e];
-			if (r.setFromPoints(i, n), t.isSeparated(r)) return !1;
+			let n = o[e], i = s[e];
+			if (r.setFromPoints(i, t), n.isSeparated(r)) return !1;
 		}
-		let c = t.satBounds, l = t.satAxes, u = this.points;
+		let c = n.satBounds, l = n.satAxes, u = this.points;
 		for (let e = 0; e < 3; e++) {
 			let t = c[e], n = l[e];
 			if (r.setFromPoints(n, u), t.isSeparated(r)) return !1;
 		}
 		for (let e = 0; e < 3; e++) {
-			let t = s[e];
+			let n = s[e];
 			for (let e = 0; e < 4; e++) {
 				let o = l[e];
-				if (a.crossVectors(t, o), r.setFromPoints(a, n), i.setFromPoints(a, u), r.isSeparated(i)) return !1;
+				if (a.crossVectors(n, o), r.setFromPoints(a, t), i.setFromPoints(a, u), r.isSeparated(i)) return !1;
 			}
 		}
 		return !0;
@@ -985,19 +985,19 @@ V.prototype.update = (function() {
 		return this.needsUpdate && this.update(), t.copy(e).applyMatrix4(this.invMatrix).clamp(this.min, this.max).applyMatrix4(this.matrix), t;
 	};
 })(), V.prototype.distanceToPoint = (function() {
-	let e = new t();
+	let e = new n();
 	return function(t) {
 		return this.closestPointToPoint(t, e), t.distanceTo(e);
 	};
 })(), V.prototype.distanceToBox = (function() {
-	let n = [
+	let e = [
 		"x",
 		"y",
 		"z"
-	], r = /* @__PURE__ */ Array(12).fill().map(() => new e()), i = /* @__PURE__ */ Array(12).fill().map(() => new e()), a = /* @__PURE__ */ new t(), o = /* @__PURE__ */ new t();
-	return function(e, t = 0, s = null, c = null) {
-		if (this.needsUpdate && this.update(), this.intersectsBox(e)) return (s || c) && (e.getCenter(o), this.closestPointToPoint(o, a), e.closestPointToPoint(a, o), s && s.copy(a), c && c.copy(o)), 0;
-		let l = t * t, u = e.min, d = e.max, f = this.points, p = Infinity;
+	], t = /* @__PURE__ */ Array(12).fill().map(() => new i()), r = /* @__PURE__ */ Array(12).fill().map(() => new i()), a = /* @__PURE__ */ new n(), o = /* @__PURE__ */ new n();
+	return function(n, i = 0, s = null, c = null) {
+		if (this.needsUpdate && this.update(), this.intersectsBox(n)) return (s || c) && (n.getCenter(o), this.closestPointToPoint(o, a), n.closestPointToPoint(a, o), s && s.copy(a), c && c.copy(o)), 0;
+		let l = i * i, u = n.min, d = n.max, f = this.points, p = Infinity;
 		for (let e = 0; e < 8; e++) {
 			let t = f[e];
 			o.copy(t).clamp(u, d);
@@ -1005,11 +1005,11 @@ V.prototype.update = (function() {
 			if (n < p && (p = n, s && s.copy(t), c && c.copy(o), n < l)) return Math.sqrt(n);
 		}
 		let m = 0;
-		for (let e = 0; e < 3; e++) for (let t = 0; t <= 1; t++) for (let a = 0; a <= 1; a++) {
-			let o = (e + 1) % 3, s = (e + 2) % 3, c = t << o | a << s, l = 1 << e | t << o | a << s, p = f[c], h = f[l];
-			r[m].set(p, h);
-			let g = n[e], _ = n[o], v = n[s], y = i[m], b = y.start, x = y.end;
-			b[g] = u[g], b[_] = t ? u[_] : d[_], b[v] = a ? u[v] : d[_], x[g] = d[g], x[_] = t ? u[_] : d[_], x[v] = a ? u[v] : d[_], m++;
+		for (let n = 0; n < 3; n++) for (let i = 0; i <= 1; i++) for (let a = 0; a <= 1; a++) {
+			let o = (n + 1) % 3, s = (n + 2) % 3, c = i << o | a << s, l = 1 << n | i << o | a << s, p = f[c], h = f[l];
+			t[m].set(p, h);
+			let g = e[n], _ = e[o], v = e[s], y = r[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++) {
 			o.x = e ? d.x : u.x, o.y = t ? d.y : u.y, o.z = n ? d.z : u.z, this.closestPointToPoint(o, a);
@@ -1017,12 +1017,12 @@ V.prototype.update = (function() {
 			if (r < p && (p = r, s && s.copy(a), c && c.copy(o), r < l)) return Math.sqrt(r);
 		}
 		for (let e = 0; e < 12; e++) {
-			let t = r[e];
+			let n = t[e];
 			for (let e = 0; e < 12; e++) {
-				let n = i[e];
-				Ge(t, n, a, o);
-				let r = a.distanceToSquared(o);
-				if (r < p && (p = r, s && s.copy(a), c && c.copy(o), r < l)) return Math.sqrt(r);
+				let t = r[e];
+				Ge(n, t, a, o);
+				let i = a.distanceToSquared(o);
+				if (i < p && (p = i, s && s.copy(a), c && c.copy(o), i < l)) return Math.sqrt(i);
 			}
 		}
 		return Math.sqrt(p);
@@ -1032,7 +1032,7 @@ var H = /* @__PURE__ */ new class extends ge {
 	constructor() {
 		super(() => new B());
 	}
-}(), Ye = /* @__PURE__ */ new t(), Xe = /* @__PURE__ */ new t();
+}(), Ye = /* @__PURE__ */ new n(), Xe = /* @__PURE__ */ new n();
 function Ze(e, t, n = {}, r = 0, i = Infinity) {
 	let a = r * r, o = i * i, s = Infinity, c = null;
 	if (e.shapecast({
@@ -1049,7 +1049,7 @@ function Ze(e, t, n = {}, r = 0, i = Infinity) {
 }
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/utils/ThreeRayIntersectUtilities.js
-var Qe = !0, $e = !1, U = /* @__PURE__ */ new t(), W = /* @__PURE__ */ new t(), G = /* @__PURE__ */ new t(), et = /* @__PURE__ */ new i(), tt = /* @__PURE__ */ new i(), nt = /* @__PURE__ */ new i(), rt = /* @__PURE__ */ new t(), it = /* @__PURE__ */ new t(), at = /* @__PURE__ */ new t(), ot = /* @__PURE__ */ new t();
+var Qe = !0, $e = !1, U = /* @__PURE__ */ new n(), W = /* @__PURE__ */ new n(), G = /* @__PURE__ */ new n(), et = /* @__PURE__ */ new r(), tt = /* @__PURE__ */ new r(), nt = /* @__PURE__ */ new r(), rt = /* @__PURE__ */ new n(), it = /* @__PURE__ */ new n(), at = /* @__PURE__ */ new n(), ot = /* @__PURE__ */ new n();
 function st(e, t, n, r, i, a, o, s) {
 	let c;
 	if (c = a === 1 ? e.intersectTriangle(r, n, t, !0, i) : e.intersectTriangle(t, n, r, a !== 2, i), c === null) return null;
@@ -1059,34 +1059,34 @@ function st(e, t, n, r, i, a, o, s) {
 		point: i.clone()
 	};
 }
-function ct(e, n, r, a, o, s, c, l, u, f, p) {
-	U.fromBufferAttribute(n, s), W.fromBufferAttribute(n, c), G.fromBufferAttribute(n, l);
+function ct(e, t, i, a, o, s, c, l, u, f, p) {
+	U.fromBufferAttribute(t, s), W.fromBufferAttribute(t, c), G.fromBufferAttribute(t, l);
 	let m = st(e, U, W, G, ot, u, f, p);
 	if (m) {
 		if (a) {
-			et.fromBufferAttribute(a, s), tt.fromBufferAttribute(a, c), nt.fromBufferAttribute(a, l), m.uv = new i();
+			et.fromBufferAttribute(a, s), tt.fromBufferAttribute(a, c), nt.fromBufferAttribute(a, l), m.uv = new r();
 			let e = d.getInterpolation(ot, U, W, G, et, tt, nt, m.uv);
 			Qe || (m.uv = e);
 		}
 		if (o) {
-			et.fromBufferAttribute(o, s), tt.fromBufferAttribute(o, c), nt.fromBufferAttribute(o, l), m.uv1 = new i();
+			et.fromBufferAttribute(o, s), tt.fromBufferAttribute(o, c), nt.fromBufferAttribute(o, l), m.uv1 = new r();
 			let e = d.getInterpolation(ot, U, W, G, et, tt, nt, m.uv1);
 			Qe || (m.uv1 = e), $e && (m.uv2 = m.uv1);
 		}
-		if (r) {
-			rt.fromBufferAttribute(r, s), it.fromBufferAttribute(r, c), at.fromBufferAttribute(r, l), m.normal = new t();
-			let n = d.getInterpolation(ot, U, W, G, rt, it, at, m.normal);
-			m.normal.dot(e.direction) > 0 && m.normal.multiplyScalar(-1), Qe || (m.normal = n);
+		if (i) {
+			rt.fromBufferAttribute(i, s), it.fromBufferAttribute(i, c), at.fromBufferAttribute(i, l), m.normal = new n();
+			let t = d.getInterpolation(ot, U, W, G, rt, it, at, m.normal);
+			m.normal.dot(e.direction) > 0 && m.normal.multiplyScalar(-1), Qe || (m.normal = t);
 		}
-		let n = {
+		let t = {
 			a: s,
 			b: c,
 			c: l,
-			normal: new t(),
+			normal: new n(),
 			materialIndex: 0
 		};
-		if (d.getNormal(U, W, G, n.normal), m.face = n, m.faceIndex = s, Qe) {
-			let e = new t();
+		if (d.getNormal(U, W, G, t.normal), m.face = t, m.faceIndex = s, Qe) {
+			let e = new n();
 			d.getBarycoord(ot, U, W, G, e), m.barycoord = e;
 		}
 	}
@@ -1252,7 +1252,7 @@ function St(e, t, n, r, i, a) {
 }
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry.generated.js
-var Ct = /* @__PURE__ */ new o(), wt = /* @__PURE__ */ new B(), Tt = /* @__PURE__ */ new B(), Et = /* @__PURE__ */ new u(), Dt = /* @__PURE__ */ new V(), Ot = /* @__PURE__ */ new V();
+var Ct = /* @__PURE__ */ new s(), wt = /* @__PURE__ */ new B(), Tt = /* @__PURE__ */ new B(), Et = /* @__PURE__ */ new a(), Dt = /* @__PURE__ */ new V(), Ot = /* @__PURE__ */ new V();
 function kt(e, t, n, r) {
 	N.setBuffer(e._roots[t]);
 	let i = At(0, e, n, r);
@@ -1284,7 +1284,7 @@ function At(e, t, n, r, i = null) {
 }
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry.generated.js
-var jt = /* @__PURE__ */ new u(), Mt = /* @__PURE__ */ new V(), Nt = /* @__PURE__ */ new V(), Pt = /* @__PURE__ */ new t(), Ft = /* @__PURE__ */ new t(), It = /* @__PURE__ */ new t(), Lt = /* @__PURE__ */ new t();
+var jt = /* @__PURE__ */ new a(), Mt = /* @__PURE__ */ new V(), Nt = /* @__PURE__ */ new V(), Pt = /* @__PURE__ */ new n(), Ft = /* @__PURE__ */ new n(), It = /* @__PURE__ */ new n(), Lt = /* @__PURE__ */ new n();
 function Rt(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
 	t.boundingBox || t.computeBoundingBox(), Mt.set(t.boundingBox.min, t.boundingBox.max, n), Mt.needsUpdate = !0;
 	let s = e.geometry, c = s.attributes.position, l = s.index, u = t.attributes.position, d = t.index, f = H.getPrimitive(), p = H.getPrimitive(), m = Pt, h = Ft, g = null, _ = null;
@@ -1407,7 +1407,7 @@ function Wt(e, t, n, r, i, a) {
 }
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/core/cast/intersectsGeometry_indirect.generated.js
-var Gt = /* @__PURE__ */ new o(), Kt = /* @__PURE__ */ new B(), qt = /* @__PURE__ */ new B(), Jt = /* @__PURE__ */ new u(), Yt = /* @__PURE__ */ new V(), Xt = /* @__PURE__ */ new V();
+var Gt = /* @__PURE__ */ new s(), Kt = /* @__PURE__ */ new B(), qt = /* @__PURE__ */ new B(), Jt = /* @__PURE__ */ new a(), Yt = /* @__PURE__ */ new V(), Xt = /* @__PURE__ */ new V();
 function Zt(e, t, n, r) {
 	N.setBuffer(e._roots[t]);
 	let i = Qt(0, e, n, r);
@@ -1439,7 +1439,7 @@ function Qt(e, t, n, r, i = null) {
 }
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/core/cast/closestPointToGeometry_indirect.generated.js
-var $t = /* @__PURE__ */ new u(), en = /* @__PURE__ */ new V(), tn = /* @__PURE__ */ new V(), nn = /* @__PURE__ */ new t(), rn = /* @__PURE__ */ new t(), an = /* @__PURE__ */ new t(), on = /* @__PURE__ */ new t();
+var $t = /* @__PURE__ */ new a(), en = /* @__PURE__ */ new V(), tn = /* @__PURE__ */ new V(), nn = /* @__PURE__ */ new n(), rn = /* @__PURE__ */ new n(), an = /* @__PURE__ */ new n(), on = /* @__PURE__ */ new n();
 function sn(e, t, n, r = {}, i = {}, a = 0, o = Infinity) {
 	t.boundingBox || t.computeBoundingBox(), en.set(t.boundingBox.min, t.boundingBox.max, n), en.needsUpdate = !0;
 	let s = e.geometry, c = s.attributes.position, l = s.index, u = t.attributes.position, d = t.index, f = H.getPrimitive(), p = H.getPrimitive(), m = nn, h = rn, g = null, _ = null;
@@ -1486,7 +1486,7 @@ function cn(e, t, n) {
 }
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/core/MeshBVH.js
-var ln = /* @__PURE__ */ new V(), un = /* @__PURE__ */ new n(), dn = /* @__PURE__ */ new t(), fn = /* @__PURE__ */ new u(), pn = /* @__PURE__ */ new t(), mn = [
+var ln = /* @__PURE__ */ new V(), un = /* @__PURE__ */ new t(), dn = /* @__PURE__ */ new n(), fn = /* @__PURE__ */ new a(), pn = /* @__PURE__ */ new n(), mn = [
 	"getX",
 	"getY",
 	"getZ"
@@ -1519,7 +1519,7 @@ var ln = /* @__PURE__ */ new V(), un = /* @__PURE__ */ new n(), dn = /* @__PURE_
 		if (s._roots = a, s._indirectBuffer = o || null, r.setIndex) {
 			let e = n.getIndex();
 			if (e === null) {
-				let e = new l(t.index, 1, !1);
+				let e = new u(t.index, 1, !1);
 				n.setIndex(e);
 			} else e.array !== i && (e.array.set(i), e.needsUpdate = !0);
 		}
@@ -1679,19 +1679,19 @@ var ln = /* @__PURE__ */ new V(), un = /* @__PURE__ */ new n(), dn = /* @__PURE_
 	closestPointToPoint(e, t = {}, n = 0, r = Infinity) {
 		return Ze(this, e, t, n, r);
 	}
-}, J = /* @__PURE__ */ new s(), Y = /* @__PURE__ */ new u(), gn = /* @__PURE__ */ new u(), _n = /* @__PURE__ */ new o(), vn = /* @__PURE__ */ new r(), X = /* @__PURE__ */ new t(), yn = /* @__PURE__ */ new n(), Z = /* @__PURE__ */ new a(), bn = {}, xn = class extends Ne {
+}, J = /* @__PURE__ */ new c(), Y = /* @__PURE__ */ new a(), gn = /* @__PURE__ */ new a(), _n = /* @__PURE__ */ new s(), vn = /* @__PURE__ */ new o(), X = /* @__PURE__ */ new n(), yn = /* @__PURE__ */ new t(), Z = /* @__PURE__ */ new l(), bn = {}, xn = class extends Ne {
 	constructor(e, t = {}) {
 		t = {
 			precise: !1,
 			includeInstances: !0,
-			matrixWorld: Array.isArray(e) ? new u() : e.matrixWorld,
+			matrixWorld: Array.isArray(e) ? new a() : e.matrixWorld,
 			targetLeafSize: 1,
 			...t
 		}, super();
 		let n = /* @__PURE__ */ new Set();
 		wn(e, n);
-		let r = Array.from(n), i = Math.ceil(Math.log2(r.length)), a = (1 << i) - 1;
-		this.objects = r, this.idBits = i, this.idMask = a, this.primitiveBuffer = null, this.primitiveBufferStride = 1, this.precise = t.precise, this.includeInstances = t.includeInstances, this.matrixWorld = t.matrixWorld, this.init(t);
+		let r = Array.from(n), i = Math.ceil(Math.log2(r.length)), o = (1 << i) - 1;
+		this.objects = r, this.idBits = i, this.idMask = o, this.primitiveBuffer = null, this.primitiveBufferStride = 1, this.precise = t.precise, this.includeInstances = t.includeInstances, this.matrixWorld = t.matrixWorld, this.init(t);
 	}
 	getObjectFromId(e) {
 		let { idMask: t, objects: n } = this;
@@ -1835,11 +1835,11 @@ function Dn(e, t) {
 }
 //#endregion
 //#region ../../node_modules/three-mesh-bvh/src/core/SkinnedMeshBVH.js
-var On = /* @__PURE__ */ new t(), kn = /* @__PURE__ */ new t(), An = /* @__PURE__ */ new t(), Q = /* @__PURE__ */ new n(), jn = /* @__PURE__ */ new u(), $ = /* @__PURE__ */ new t(), Mn = /* @__PURE__ */ new t(), Nn = [
+var On = /* @__PURE__ */ new n(), kn = /* @__PURE__ */ new n(), An = /* @__PURE__ */ new n(), Q = /* @__PURE__ */ new t(), jn = /* @__PURE__ */ new a(), $ = /* @__PURE__ */ new n(), Mn = /* @__PURE__ */ new n(), Nn = [
 	"x",
 	"y",
 	"z"
-], Pn = !0, Fn = !1, In = /* @__PURE__ */ new i(), Ln = /* @__PURE__ */ new i(), Rn = /* @__PURE__ */ new i(), zn = /* @__PURE__ */ new t(), Bn = /* @__PURE__ */ new t(), Vn = /* @__PURE__ */ new t(), Hn = class extends Ue {
+], Pn = !0, Fn = !1, In = /* @__PURE__ */ new r(), Ln = /* @__PURE__ */ new r(), Rn = /* @__PURE__ */ new r(), zn = /* @__PURE__ */ new n(), Bn = /* @__PURE__ */ new n(), Vn = /* @__PURE__ */ new n(), Hn = class extends Ue {
 	get primitiveStride() {
 		return 3;
 	}
@@ -1870,29 +1870,29 @@ var On = /* @__PURE__ */ new t(), kn = /* @__PURE__ */ new t(), An = /* @__PURE_
 			iterate: Un
 		});
 	}
-	raycastObject3D(e, n, r = []) {
+	raycastObject3D(e, t, i = []) {
 		let { material: a } = e;
 		if (a === void 0) return;
-		let { matrixWorld: o } = e, { firstHitOnly: s } = n;
-		jn.copy(o).invert(), Q.copy(n.ray).applyMatrix4(jn);
+		let { matrixWorld: o } = e, { firstHitOnly: s } = t;
+		jn.copy(o).invert(), Q.copy(t.ray).applyMatrix4(jn);
 		let c = null, l = Infinity;
 		return this.shapecast({
 			boundsTraverseOrder: (e) => e.distanceToPoint(Q.origin),
 			intersectsBounds: (e) => {
 				if (s) {
 					if (!Q.intersectBox(e, Mn)) return 0;
-					let t;
-					return e.containsPoint(Q.origin) ? t = 0 : (Mn.applyMatrix4(o), t = n.ray.origin.distanceTo(Mn)), t < l ? 1 : 0;
+					let n;
+					return e.containsPoint(Q.origin) ? n = 0 : (Mn.applyMatrix4(o), n = t.ray.origin.distanceTo(Mn)), n < l ? 1 : 0;
 				} else return Q.intersectsBox(e) ? 1 : 0;
 			},
 			intersectsTriangle: (u, f) => {
 				let p = null;
 				if (p = a.side === 0 ? Q.intersectTriangle(u.a, u.b, u.c, !0, $) : a.side === 1 ? Q.intersectTriangle(u.c, u.b, u.a, !0, $) : Q.intersectTriangle(u.a, u.b, u.c, !1, $), !p) return;
 				p = p.clone().applyMatrix4(o);
-				let m = n.ray.origin.distanceTo(p);
-				if (m >= n.near && m <= n.far) {
+				let m = t.ray.origin.distanceTo(p);
+				if (m >= t.near && m <= t.far) {
 					if (s && m >= l) return;
-					let { geometry: n } = this, { index: a } = n, o = this.resolvePrimitiveIndex(f), h = o * 3, g = h + 0, _ = h + 1, v = h + 2;
+					let { geometry: t } = this, { index: a } = t, o = this.resolvePrimitiveIndex(f), h = o * 3, g = h + 0, _ = h + 1, v = h + 2;
 					a && (g = a.array[g], _ = a.array[_], v = a.array[v]);
 					let y = {
 						distance: m,
@@ -1905,35 +1905,35 @@ var On = /* @__PURE__ */ new t(), kn = /* @__PURE__ */ new t(), An = /* @__PURE_
 							a: g,
 							b: _,
 							c: v,
-							normal: d.getNormal(u.a, u.b, u.c, new t()),
+							normal: d.getNormal(u.a, u.b, u.c, new n()),
 							materialIndex: 0
 						},
 						faceIndex: o
 					};
 					if (Pn) {
-						let e = new t();
+						let e = new n();
 						d.getBarycoord($, u.a, u.b, u.c, e), y.barycoord = e;
 					}
-					let b = n.attributes.uv, x = n.attributes.uv1, S = n.attributes.normal;
+					let b = t.attributes.uv, x = t.attributes.uv1, S = t.attributes.normal;
 					if (b) {
-						In.fromBufferAttribute(b, g), Ln.fromBufferAttribute(b, _), Rn.fromBufferAttribute(b, v), y.uv = new i();
+						In.fromBufferAttribute(b, g), Ln.fromBufferAttribute(b, _), Rn.fromBufferAttribute(b, v), y.uv = new r();
 						let e = d.getInterpolation($, u.a, u.b, u.c, In, Ln, Rn, y.uv);
 						Pn || (y.uv = e);
 					}
 					if (x) {
-						In.fromBufferAttribute(x, g), Ln.fromBufferAttribute(x, _), Rn.fromBufferAttribute(x, v), y.uv1 = new i();
+						In.fromBufferAttribute(x, g), Ln.fromBufferAttribute(x, _), Rn.fromBufferAttribute(x, v), y.uv1 = new r();
 						let e = d.getInterpolation($, u.a, u.b, u.c, In, Ln, Rn, y.uv1);
 						Pn || (y.uv1 = e), Fn && (y.uv2 = y.uv1);
 					}
 					if (S) {
-						zn.fromBufferAttribute(S, g), Bn.fromBufferAttribute(S, _), Vn.fromBufferAttribute(S, v), y.normal = new t();
+						zn.fromBufferAttribute(S, g), Bn.fromBufferAttribute(S, _), Vn.fromBufferAttribute(S, v), y.normal = new n();
 						let e = d.getInterpolation($, u.a, u.b, u.c, zn, Bn, Vn, y.normal);
 						y.normal.dot(Q.direction) > 0 && y.normal.multiplyScalar(-1), Pn || (y.normal = e);
 					}
-					l = y.distance, c = y, s || r.push(y);
+					l = y.distance, c = y, s || i.push(y);
 				}
 			}
-		}), s && c && r.push(c), r;
+		}), s && c && i.push(c), i;
 	}
 };
 function Un(e, t, n, r, i, a, o) {
@@ -1947,4 +1947,4 @@ function Un(e, t, n, r, i, a, o) {
 //#endregion
 export { B as a, Ne as c, V as i, p as l, xn as n, Ue as o, hn as r, He as s, Hn as t, h as u };
 
-//# sourceMappingURL=src-HhklrVDg.mjs.map
+//# sourceMappingURL=src-Dg0wYIom.mjs.map