rm-graphical-computing 1.0.39 → 1.0.40

package/dist/index.js

@@ -595,9 +595,14 @@ function de(e) {
 	}
 	e.dispose();
 }
-//#endregion
-//#region src/geometry/handleWallSegment.mjs
-var fe = class {
+var fe = (e, t = .001) => {
+	let n = /* @__PURE__ */ new Map(), r = [];
+	for (let i of e) {
+		let e = `${Math.round(i.x / t)},${Math.round(i.y / t)},${Math.round(i.z / t)}`;
+		n.has(e) || (n.set(e, !0), r.push(i));
+	}
+	return r;
+}, pe = class {
 	results;
 	clusterResults;
 	constructor() {
@@ -1029,12 +1034,12 @@ var fe = class {
 			return console.error("合并网格时出错:", e), null;
 		}
 	}
-}, pe = (e) => {
+}, me = (e) => {
 	let t = {}, n = [], r = [], i = [];
 	return e[0].width, e[0].height, e.forEach((e) => {
 		r.push(...e.vertices), i.push(e.center), n.push(e.vertices);
 	}), t.originalVertices = n, t.allCenterPoints = i, t;
-}, me = (e) => {
+}, he = (e) => {
 	let t = new d().copy(e.start).add(e.end).multiplyScalar(.5), n = new d().subVectors(new d(t.x, t.y, t.z + 1), t).normalize(), r = new d(e.direction.x, e.direction.y, 0);
 	r.applyAxisAngle(n, Math.PI / 2);
 	let i = new d().copy(t).add(r.clone().multiplyScalar(e.length)), a = new d().copy(t).sub(r.clone().multiplyScalar(e.length));
@@ -1044,7 +1049,7 @@ var fe = class {
 		center: t,
 		direction: r
 	};
-}, he = (t, n, r = !0) => {
+}, ge = (t, n, r = !0) => {
 	let i = [];
 	if (!t) return [];
 	for (let a = 0; a < t.length; a++) {
@@ -1065,7 +1070,7 @@ var fe = class {
 			wireframe: !1,
 			transparent: !0,
 			opacity: .5
-		}), g = new e.Group(), _ = new fe(), { horizontalSubdivisions: v, verticalSubdivisions: y } = _.initLimits4(p, m), b = _.createSubdividedWallPlane(o, y, v, h, g);
+		}), g = new e.Group(), _ = new pe(), { horizontalSubdivisions: v, verticalSubdivisions: y } = _.initLimits4(p, m), b = _.createSubdividedWallPlane(o, y, v, h, g);
 		_.analyzePointDistribution(b, f, .01);
 		let x = new e.MeshBasicMaterial({
 			color: "black",
@@ -1074,14 +1079,14 @@ var fe = class {
 			side: e.DoubleSide
 		}), S = _.highlightEmptySegments(b, x, g), C = [];
 		for (let e of S.clusters) {
-			let t = pe(e);
+			let t = me(e);
 			t && C.push(t);
 		}
-		let w = me(o).direction;
+		let w = he(o).direction;
 		o.checkResults = C, o.verticalDirection = w, o.originaIndex = a, i.push(o);
 	}
 	return i;
-}, ge = (t, n) => {
+}, _e = (t, n) => {
 	console.log("lines", t);
 	for (let r = 0; r < t.length; r++) {
 		let i = t[r], a = [];
@@ -1099,8 +1104,8 @@ var fe = class {
 			let e = [];
 			e.push(s.clone().addScaledVector(u, 1)), e.push(e[0].clone().addScaledVector(l, m)), e.push(e[1].clone().addScaledVector(d, 2)), e.push(s.clone().addScaledVector(d, m));
 			let t = [];
-			for (let n = 0; n < a.length; n++) f.includes(n) || ye(a[n], e) && (f.push(n), t.push(a[n]));
-			t.length > 0 && p.push(be(t)), s = s.addScaledVector(l, m);
+			for (let n = 0; n < a.length; n++) f.includes(n) || be(a[n], e) && (f.push(n), t.push(a[n]));
+			t.length > 0 && p.push(xe(t)), s = s.addScaledVector(l, m);
 		}
 		let h = new Float32Array(a.length * 3);
 		a.forEach((e, t) => {
@@ -1111,14 +1116,14 @@ var fe = class {
 			color: le(),
 			size: .02
 		})));
-		let [_, v] = Te(p, {
+		let [_, v] = Ee(p, {
 			plane: "xy",
 			trimRatio: 0
 		});
 		D(_, v, n);
 	}
 };
-function _e(e, t = "xy") {
+function ve(e, t = "xy") {
 	if (t === "xy") return {
 		x: e.x,
 		y: e.y
@@ -1133,30 +1138,30 @@ function _e(e, t = "xy") {
 	};
 	throw Error(`Unsupported plane: ${t}`);
 }
-function ve(e, t, n) {
+function ye(e, t, n) {
 	let r = t.x - e.x, i = t.y - e.y, a = n.x - e.x;
 	return r * (n.y - e.y) - i * a;
 }
-function ye(e, t, n = "xy") {
+function be(e, t, n = "xy") {
 	if (!t || t.length !== 4) throw Error("rectPoints must contain 4 points");
-	let r = _e(e, n), i = t.map((e) => _e(e, n)), a = !1, o = !1;
+	let r = ve(e, n), i = t.map((e) => ve(e, n)), a = !1, o = !1;
 	for (let e = 0; e < 4; e++) {
-		let t = i[e], n = i[(e + 1) % 4], s = ve(t, n, r);
+		let t = i[e], n = i[(e + 1) % 4], s = ye(t, n, r);
 		if (s > 1e-9 && (a = !0), s < -1e-9 && (o = !0), a && o) return !1;
 	}
 	return !0;
 }
-function be(t) {
+function xe(t) {
 	if (!t || t.length === 0) return null;
 	let n = new e.Vector3(0, 0, 0);
 	for (let e of t) Array.isArray(e) ? (n.x += e[0], n.y += e[1], n.z += e[2]) : (n.x += e.x, n.y += e.y, n.z += e.z);
 	return n.divideScalar(t.length), n;
 }
-function xe(t) {
+function Se(t) {
 	return t instanceof e.Vector3 ? t.clone() : Array.isArray(t) ? new e.Vector3(t[0], t[1], t[2]) : new e.Vector3(t.x, t.y, t.z);
 }
-function Se(e, t = "xy") {
-	let n = xe(e);
+function Ce(e, t = "xy") {
+	let n = Se(e);
 	if (t === "xy") return {
 		x: n.x,
 		y: n.y,
@@ -1174,13 +1179,13 @@ function Se(e, t = "xy") {
 	};
 	throw Error(`Unsupported plane: ${t}`);
 }
-function Ce(t, n, r, i = "xy") {
+function we(t, n, r, i = "xy") {
 	if (i === "xy") return new e.Vector3(t, n, r);
 	if (i === "xz") return new e.Vector3(t, r, n);
 	if (i === "yz") return new e.Vector3(r, t, n);
 	throw Error(`Unsupported plane: ${i}`);
 }
-function we(e, t, n) {
+function Te(e, t, n) {
 	let r = 1e-12;
 	if (Math.abs(t) < r) return e >= n ? {
 		x: 1,
@@ -1198,10 +1203,10 @@ function we(e, t, n) {
 		y: l / u
 	};
 }
-function Te(e, t = {}) {
+function Ee(e, t = {}) {
 	let { plane: n = "xy", trimRatio: r = 0 } = t;
 	if (!e || e.length < 2) return null;
-	let i = e.map((e) => Se(e, n)), a = 0, o = 0, s = 0;
+	let i = e.map((e) => Ce(e, n)), a = 0, o = 0, s = 0;
 	for (let e of i) a += e.x, o += e.y, s += e.up;
 	a /= i.length, o /= i.length, s /= i.length;
 	let c = 0, l = 0, u = 0;
@@ -1210,7 +1215,7 @@ function Te(e, t = {}) {
 		c += t * t, l += t * n, u += n * n;
 	}
 	c /= i.length, l /= i.length, u /= i.length;
-	let d = we(c, l, u), f = {
+	let d = Te(c, l, u), f = {
 		x: -d.y,
 		y: d.x
 	}, p = [];
@@ -1232,11 +1237,11 @@ function Te(e, t = {}) {
 		let e = p.map((e) => e.up).sort((e, t) => e - t), t = Math.floor(e.length / 2);
 		return e.length % 2 == 0 ? (e[t - 1] + e[t]) * .5 : e[t];
 	})(), x = _.s, S = v.s, C = y, w = y, T = b, E = b, D = a + d.x * x + f.x * C, O = o + d.y * x + f.y * C, k = a + d.x * S + f.x * w, A = o + d.y * S + f.y * w;
-	return [Ce(D, O, T, n), Ce(k, A, E, n)];
+	return [we(D, O, T, n), we(k, A, E, n)];
 }
 //#endregion
 //#region src/geometry/beamLine.mjs
-var Ee = async (t, n, r, i) => {
+var De = async (t, n, r, i) => {
 	ce(i);
 	let a = await fetch(t);
 	if (!a) return;
@@ -1263,7 +1268,7 @@ var Ee = async (t, n, r, i) => {
 		}
 	}
 	i.add(m), console.time();
-	let { beamGroup: x } = await De(o, _, y, i);
+	let { beamGroup: x } = await Oe(o, _, y, i);
 	console.timeEnd(), console.log("beamGroup", x);
 	let S = new e.MeshBasicMaterial({
 		color: "#cffd00",
@@ -1420,7 +1425,7 @@ var Ee = async (t, n, r, i) => {
 		beamDoorGroup: p,
 		lineIndexGroup: m
 	};
-}, De = async (t, n, r, i) => {
+}, Oe = async (t, n, r, i) => {
 	if (ae(t, i), t.length <= 0 || n.length <= 0) return t;
 	r ||= [];
 	for (let n of t) {
@@ -1822,7 +1827,7 @@ var Ee = async (t, n, r, i) => {
 								for (let i = 0; i < t[o].checkResults.length; i++) {
 									let i = [];
 									t[o].originalPoints.forEach((t) => {
-										t.z > M.z && t.z < M.z + x / 2 && i.push(new e.Vector3(t.x, t.y, M.z));
+										t.z > M.z + .2 && t.z < M.z + x / 2 && i.push(new e.Vector3(t.x, t.y, M.z));
 									});
 									let c = new e.Vector3(), u = [], d = [];
 									for (let e = 0; e < i.length; e++) {
@@ -1830,7 +1835,7 @@ var Ee = async (t, n, r, i) => {
 										t.distanceTo(i[e]) < .15 && (u.push(i[e]), d.push(t.clone()));
 									}
 									for (let e = 0; e < d.length; e++) oe(a, d[e]) && u.push(d[e]);
-									if (u = d, u.length < 500) continue;
+									if (u = d, u = fe(u), u.length < 150) continue;
 									let f = se(u);
 									if (f.length == 2) {
 										let e = f[0].distanceTo(f[1]);
@@ -1982,7 +1987,7 @@ var Ee = async (t, n, r, i) => {
 		lines: t,
 		beamGroup: f
 	};
-}, Oe = (t, n) => {
+}, ke = (t, n) => {
 	if (t.length <= 0) return t;
 	for (let n of t) {
 		let t = [];
@@ -2073,7 +2078,7 @@ var Ee = async (t, n, r, i) => {
 		}
 	}
 	return t;
-}, ke = (t, n) => {
+}, Ae = (t, n) => {
 	let r = {
 		rectangles: [],
 		threeEdgeRect: []
@@ -2196,8 +2201,8 @@ var Ee = async (t, n, r, i) => {
 		l.indexs.length == 3 && (l.indexs.forEach((e) => i.add(e)), r.threeEdgeRect.push(l));
 	}
 	return r;
-}, U = 11102230246251565e-32, W = 134217729, Ae = (3 + 8 * U) * U;
-function je(e, t, n, r, i) {
+}, U = 11102230246251565e-32, W = 134217729, je = (3 + 8 * U) * U;
+function Me(e, t, n, r, i) {
 	let a, o, s, c, l = t[0], u = r[0], d = 0, f = 0;
 	u > l == u > -l ? (a = l, l = t[++d]) : (a = u, u = r[++f]);
 	let p = 0;
@@ -2206,7 +2211,7 @@ function je(e, t, n, r, i) {
 	for (; f < n;) o = a + u, c = o - a, s = a - (o - c) + (u - c), u = r[++f], a = o, s !== 0 && (i[p++] = s);
 	return (a !== 0 || p === 0) && (i[p++] = a), p;
 }
-function Me(e, t) {
+function Ne(e, t) {
 	let n = t[0];
 	for (let r = 1; r < e; r++) n += t[r];
 	return n;
@@ -2216,27 +2221,27 @@ function G(e) {
 }
 //#endregion
 //#region node_modules/robust-predicates/esm/orient2d.js
-var Ne = (3 + 16 * U) * U, Pe = (2 + 12 * U) * U, Fe = (9 + 64 * U) * U * U, Ie = G(4), Le = G(8), Re = G(12), ze = G(16), K = G(4);
-function Be(e, t, n, r, i, a, o) {
+var Pe = (3 + 16 * U) * U, Fe = (2 + 12 * U) * U, Ie = (9 + 64 * U) * U * U, Le = G(4), Re = G(8), ze = G(12), Be = G(16), K = G(4);
+function Ve(e, t, n, r, i, a, o) {
 	let s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T = e - i, E = n - i, D = t - a, O = r - a;
-	b = T * O, f = W * T, p = f - (f - T), m = T - p, f = W * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = D * E, f = W * D, p = f - (f - D), m = D - p, f = W * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, Ie[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, Ie[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, Ie[2] = v - (w - d) + (_ - d), Ie[3] = w;
-	let k = Me(4, Ie), A = Pe * o;
-	if (k >= A || -k >= A || (d = e - T, s = e - (T + d) + (d - i), d = n - E, l = n - (E + d) + (d - i), d = t - D, c = t - (D + d) + (d - a), d = r - O, u = r - (O + d) + (d - a), s === 0 && c === 0 && l === 0 && u === 0) || (A = Fe * o + Ae * Math.abs(k), k += T * u + O * s - (D * l + E * c), k >= A || -k >= A)) return k;
+	b = T * O, f = W * T, p = f - (f - T), m = T - p, f = W * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = D * E, f = W * D, p = f - (f - D), m = D - p, f = W * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, Le[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, Le[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, Le[2] = v - (w - d) + (_ - d), Le[3] = w;
+	let k = Ne(4, Le), A = Fe * o;
+	if (k >= A || -k >= A || (d = e - T, s = e - (T + d) + (d - i), d = n - E, l = n - (E + d) + (d - i), d = t - D, c = t - (D + d) + (d - a), d = r - O, u = r - (O + d) + (d - a), s === 0 && c === 0 && l === 0 && u === 0) || (A = Ie * o + je * Math.abs(k), k += T * u + O * s - (D * l + E * c), k >= A || -k >= A)) return k;
 	b = s * O, f = W * s, p = f - (f - s), m = s - p, f = W * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = c * E, f = W * c, p = f - (f - c), m = c - p, f = W * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w;
-	let j = je(4, Ie, 4, K, Le);
+	let j = Me(4, Le, 4, K, Re);
 	b = T * u, f = W * T, p = f - (f - T), m = T - p, f = W * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = D * l, f = W * D, p = f - (f - D), m = D - p, f = W * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w;
-	let M = je(j, Le, 4, K, Re);
-	return b = s * u, f = W * s, p = f - (f - s), m = s - p, f = W * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = c * l, f = W * c, p = f - (f - c), m = c - p, f = W * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w, ze[je(M, Re, 4, K, ze) - 1];
+	let M = Me(j, Re, 4, K, ze);
+	return b = s * u, f = W * s, p = f - (f - s), m = s - p, f = W * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = c * l, f = W * c, p = f - (f - c), m = c - p, f = W * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w, Be[Me(M, ze, 4, K, Be) - 1];
 }
-function Ve(e, t, n, r, i, a) {
+function He(e, t, n, r, i, a) {
 	let o = (t - a) * (n - i), s = (e - i) * (r - a), c = o - s, l = Math.abs(o + s);
-	return Math.abs(c) >= Ne * l ? c : -Be(e, t, n, r, i, a, l);
+	return Math.abs(c) >= Pe * l ? c : -Ve(e, t, n, r, i, a, l);
 }
 (7 + 56 * U) * U, (3 + 28 * U) * U, (26 + 288 * U) * U * U, G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(8), G(8), G(8), G(4), G(8), G(8), G(16), G(12), G(192), G(192), (10 + 96 * U) * U, (4 + 48 * U) * U, (44 + 576 * U) * U * U, G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(8), G(8), G(8), G(8), G(8), G(8), G(8), G(8), G(8), G(4), G(4), G(4), G(8), G(16), G(16), G(16), G(32), G(32), G(48), G(64), G(1152), G(1152), (16 + 224 * U) * U, (5 + 72 * U) * U, (71 + 1408 * U) * U * U, G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(24), G(24), G(24), G(24), G(24), G(24), G(24), G(24), G(24), G(24), G(1152), G(1152), G(1152), G(1152), G(1152), G(2304), G(2304), G(3456), G(5760), G(8), G(8), G(8), G(16), G(24), G(48), G(48), G(96), G(192), G(384), G(384), G(384), G(768), G(96), G(96), G(96), G(1152);
 //#endregion
 //#region node_modules/delaunator/index.js
-var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
-	static from(t, n = Qe, r = $e) {
+var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
+	static from(t, n = $e, r = et) {
 		let i = t.length, a = new Float64Array(i * 2);
 		for (let e = 0; e < i; e++) {
 			let i = t[e];
@@ -2259,25 +2264,25 @@ var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
 		}
 		let u = (o + c) / 2, d = (s + l) / 2, f = 0, p = 0, m = 0;
 		for (let t = 0, n = Infinity; t < a; t++) {
-			let r = Ke(u, d, e[2 * t], e[2 * t + 1]);
+			let r = qe(u, d, e[2 * t], e[2 * t + 1]);
 			r < n && (f = t, n = r);
 		}
 		let h = e[2 * f], g = e[2 * f + 1];
 		for (let t = 0, n = Infinity; t < a; t++) {
 			if (t === f) continue;
-			let r = Ke(h, g, e[2 * t], e[2 * t + 1]);
+			let r = qe(h, g, e[2 * t], e[2 * t + 1]);
 			r < n && r > 0 && (p = t, n = r);
 		}
 		let _ = e[2 * p], v = e[2 * p + 1], y = Infinity;
 		for (let t = 0; t < a; t++) {
 			if (t === f || t === p) continue;
-			let n = Je(h, g, _, v, e[2 * t], e[2 * t + 1]);
+			let n = Ye(h, g, _, v, e[2 * t], e[2 * t + 1]);
 			n < y && (m = t, y = n);
 		}
 		let b = e[2 * m], x = e[2 * m + 1];
 		if (y === Infinity) {
 			for (let t = 0; t < a; t++) this._dists[t] = e[2 * t] - e[0] || e[2 * t + 1] - e[1];
-			Xe(this._ids, this._dists, 0, a - 1);
+			Ze(this._ids, this._dists, 0, a - 1);
 			let t = new Uint32Array(a), n = 0;
 			for (let e = 0, r = -Infinity; e < a; e++) {
 				let i = this._ids[e], a = this._dists[i];
@@ -2286,24 +2291,24 @@ var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
 			this.hull = t.subarray(0, n), this.triangles = new Uint32Array(), this.halfedges = new Int32Array();
 			return;
 		}
-		if (Ve(h, g, _, v, b, x) < 0) {
+		if (He(h, g, _, v, b, x) < 0) {
 			let e = p, t = _, n = v;
 			p = m, _ = b, v = x, m = e, b = t, x = n;
 		}
-		let S = Ye(h, g, _, v, b, x);
+		let S = Xe(h, g, _, v, b, x);
 		this._cx = S.x, this._cy = S.y;
-		for (let t = 0; t < a; t++) this._dists[t] = Ke(e[2 * t], e[2 * t + 1], S.x, S.y);
-		Xe(this._ids, this._dists, 0, a - 1), this._hullStart = f;
+		for (let t = 0; t < a; t++) this._dists[t] = qe(e[2 * t], e[2 * t + 1], S.x, S.y);
+		Ze(this._ids, this._dists, 0, a - 1), this._hullStart = f;
 		let C = 3;
 		n[f] = t[m] = p, n[p] = t[f] = m, n[m] = t[p] = f, r[f] = 0, r[p] = 1, r[m] = 2, i.fill(-1), i[this._hashKey(h, g)] = f, i[this._hashKey(_, v)] = p, i[this._hashKey(b, x)] = m, this.trianglesLen = 0, this._addTriangle(f, p, m, -1, -1, -1);
 		for (let a = 0, o = 0, s = 0; a < this._ids.length; a++) {
 			let c = this._ids[a], l = e[2 * c], u = e[2 * c + 1];
-			if (a > 0 && Math.abs(l - o) <= He && Math.abs(u - s) <= He || (o = l, s = u, c === f || c === p || c === m)) continue;
+			if (a > 0 && Math.abs(l - o) <= Ue && Math.abs(u - s) <= Ue || (o = l, s = u, c === f || c === p || c === m)) continue;
 			let d = 0;
 			for (let e = 0, t = this._hashKey(l, u); e < this._hashSize && (d = i[(t + e) % this._hashSize], !(d !== -1 && d !== n[d])); e++);
 			d = t[d];
 			let h = d, g;
-			for (; g = n[h], Ve(l, u, e[2 * h], e[2 * h + 1], e[2 * g], e[2 * g + 1]) >= 0;) if (h = g, h === d) {
+			for (; g = n[h], He(l, u, e[2 * h], e[2 * h + 1], e[2 * g], e[2 * g + 1]) >= 0;) if (h = g, h === d) {
 				h = -1;
 				break;
 			}
@@ -2311,8 +2316,8 @@ var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
 			let _ = this._addTriangle(h, c, n[h], -1, -1, r[h]);
 			r[c] = this._legalize(_ + 2), r[h] = _, C++;
 			let v = n[h];
-			for (; g = n[v], Ve(l, u, e[2 * v], e[2 * v + 1], e[2 * g], e[2 * g + 1]) < 0;) _ = this._addTriangle(v, c, g, r[c], -1, r[v]), r[c] = this._legalize(_ + 2), n[v] = v, C--, v = g;
-			if (h === d) for (; g = t[h], Ve(l, u, e[2 * g], e[2 * g + 1], e[2 * h], e[2 * h + 1]) < 0;) _ = this._addTriangle(g, c, h, -1, r[h], r[g]), this._legalize(_ + 2), r[g] = _, n[h] = h, C--, h = g;
+			for (; g = n[v], He(l, u, e[2 * v], e[2 * v + 1], e[2 * g], e[2 * g + 1]) < 0;) _ = this._addTriangle(v, c, g, r[c], -1, r[v]), r[c] = this._legalize(_ + 2), n[v] = v, C--, v = g;
+			if (h === d) for (; g = t[h], He(l, u, e[2 * g], e[2 * g + 1], e[2 * h], e[2 * h + 1]) < 0;) _ = this._addTriangle(g, c, h, -1, r[h], r[g]), this._legalize(_ + 2), r[g] = _, n[h] = h, C--, h = g;
 			this._hullStart = t[c] = h, n[h] = t[v] = c, n[c] = v, i[this._hashKey(l, u)] = c, i[this._hashKey(e[2 * h], e[2 * h + 1])] = h;
 		}
 		this.hull = new Uint32Array(C);
@@ -2320,7 +2325,7 @@ var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
 		this.triangles = this._triangles.subarray(0, this.trianglesLen), this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
 	}
 	_hashKey(e, t) {
-		return Math.floor(Ge(e - this._cx, t - this._cy) * this._hashSize) % this._hashSize;
+		return Math.floor(Ke(e - this._cx, t - this._cy) * this._hashSize) % this._hashSize;
 	}
 	_legalize(e) {
 		let { _triangles: t, _halfedges: n, coords: r } = this, i = 0, a = 0;
@@ -2328,11 +2333,11 @@ var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
 			let o = n[e], s = e - e % 3;
 			if (a = s + (e + 2) % 3, o === -1) {
 				if (i === 0) break;
-				e = Ue[--i];
+				e = We[--i];
 				continue;
 			}
 			let c = o - o % 3, l = s + (e + 1) % 3, u = c + (o + 2) % 3, d = t[a], f = t[e], p = t[l], m = t[u];
-			if (qe(r[2 * d], r[2 * d + 1], r[2 * f], r[2 * f + 1], r[2 * p], r[2 * p + 1], r[2 * m], r[2 * m + 1])) {
+			if (Je(r[2 * d], r[2 * d + 1], r[2 * f], r[2 * f + 1], r[2 * p], r[2 * p + 1], r[2 * m], r[2 * m + 1])) {
 				t[e] = m, t[o] = d;
 				let r = n[u];
 				if (r === -1) {
@@ -2347,10 +2352,10 @@ var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
 				}
 				this._link(e, r), this._link(o, n[a]), this._link(a, u);
 				let s = c + (o + 1) % 3;
-				i < Ue.length && (Ue[i++] = s);
+				i < We.length && (We[i++] = s);
 			} else {
 				if (i === 0) break;
-				e = Ue[--i];
+				e = We[--i];
 			}
 		}
 		return a;
@@ -2363,30 +2368,30 @@ var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
 		return this._triangles[o] = e, this._triangles[o + 1] = t, this._triangles[o + 2] = n, this._link(o, r), this._link(o + 1, i), this._link(o + 2, a), this.trianglesLen += 3, o;
 	}
 };
-function Ge(e, t) {
+function Ke(e, t) {
 	let n = e / (Math.abs(e) + Math.abs(t));
 	return (t > 0 ? 3 - n : 1 + n) / 4;
 }
-function Ke(e, t, n, r) {
+function qe(e, t, n, r) {
 	let i = e - n, a = t - r;
 	return i * i + a * a;
 }
-function qe(e, t, n, r, i, a, o, s) {
+function Je(e, t, n, r, i, a, o, s) {
 	let c = e - o, l = t - s, u = n - o, d = r - s, f = i - o, p = a - s, m = c * c + l * l, h = u * u + d * d, g = f * f + p * p;
 	return c * (d * g - h * p) - l * (u * g - h * f) + m * (u * p - d * f) < 0;
 }
-function Je(e, t, n, r, i, a) {
+function Ye(e, t, n, r, i, a) {
 	let o = n - e, s = r - t, c = i - e, l = a - t, u = o * o + s * s, d = c * c + l * l, f = .5 / (o * l - s * c), p = (l * u - s * d) * f, m = (o * d - c * u) * f;
 	return p * p + m * m;
 }
-function Ye(e, t, n, r, i, a) {
+function Xe(e, t, n, r, i, a) {
 	let o = n - e, s = r - t, c = i - e, l = a - t, u = o * o + s * s, d = c * c + l * l, f = .5 / (o * l - s * c);
 	return {
 		x: e + (l * u - s * d) * f,
 		y: t + (o * d - c * u) * f
 	};
 }
-function Xe(e, t, n, r) {
+function Ze(e, t, n, r) {
 	if (r - n <= 20) for (let i = n + 1; i <= r; i++) {
 		let r = e[i], a = t[r], o = i - 1;
 		for (; o >= n && t[e[o]] > a;) e[o + 1] = e[o--];
@@ -2394,7 +2399,7 @@ function Xe(e, t, n, r) {
 	}
 	else {
 		let i = n + r >> 1, a = n + 1, o = r;
-		Ze(e, i, a), t[e[n]] > t[e[r]] && Ze(e, n, r), t[e[a]] > t[e[r]] && Ze(e, a, r), t[e[n]] > t[e[a]] && Ze(e, n, a);
+		Qe(e, i, a), t[e[n]] > t[e[r]] && Qe(e, n, r), t[e[a]] > t[e[r]] && Qe(e, a, r), t[e[n]] > t[e[a]] && Qe(e, n, a);
 		let s = e[a], c = t[s];
 		for (;;) {
 			do
@@ -2404,24 +2409,24 @@ function Xe(e, t, n, r) {
 				o--;
 			while (t[e[o]] > c);
 			if (o < a) break;
-			Ze(e, a, o);
+			Qe(e, a, o);
 		}
-		e[n + 1] = e[o], e[o] = s, r - a + 1 >= o - n ? (Xe(e, t, a, r), Xe(e, t, n, o - 1)) : (Xe(e, t, n, o - 1), Xe(e, t, a, r));
+		e[n + 1] = e[o], e[o] = s, r - a + 1 >= o - n ? (Ze(e, t, a, r), Ze(e, t, n, o - 1)) : (Ze(e, t, n, o - 1), Ze(e, t, a, r));
 	}
 }
-function Ze(e, t, n) {
+function Qe(e, t, n) {
 	let r = e[t];
 	e[t] = e[n], e[n] = r;
 }
-function Qe(e) {
+function $e(e) {
 	return e[0];
 }
-function $e(e) {
+function et(e) {
 	return e[1];
 }
 //#endregion
 //#region node_modules/d3-delaunay/src/path.js
-var et = 1e-6, tt = class {
+var tt = 1e-6, nt = class {
 	constructor() {
 		this._x0 = this._y0 = this._x1 = this._y1 = null, this._ = "";
 	}
@@ -2438,7 +2443,7 @@ var et = 1e-6, tt = class {
 		e = +e, t = +t, n = +n;
 		let r = e + n, i = t;
 		if (n < 0) throw Error("negative radius");
-		this._x1 === null ? this._ += `M${r},${i}` : (Math.abs(this._x1 - r) > et || Math.abs(this._y1 - i) > et) && (this._ += "L" + r + "," + i), n && (this._ += `A${n},${n},0,1,1,${e - n},${t}A${n},${n},0,1,1,${this._x1 = r},${this._y1 = i}`);
+		this._x1 === null ? this._ += `M${r},${i}` : (Math.abs(this._x1 - r) > tt || Math.abs(this._y1 - i) > tt) && (this._ += "L" + r + "," + i), n && (this._ += `A${n},${n},0,1,1,${e - n},${t}A${n},${n},0,1,1,${this._x1 = r},${this._y1 = i}`);
 	}
 	rect(e, t, n, r) {
 		this._ += `M${this._x0 = this._x1 = +e},${this._y0 = this._y1 = +t}h${+n}v${+r}h${-n}Z`;
@@ -2446,7 +2451,7 @@ var et = 1e-6, tt = class {
 	value() {
 		return this._ || null;
 	}
-}, nt = class {
+}, rt = class {
 	constructor() {
 		this._ = [];
 	}
@@ -2462,7 +2467,7 @@ var et = 1e-6, tt = class {
 	value() {
 		return this._.length ? this._ : null;
 	}
-}, rt = class {
+}, it = class {
 	constructor(e, [t, n, r, i] = [
 		0,
 		0,
@@ -2498,7 +2503,7 @@ var et = 1e-6, tt = class {
 		for (let n = 0; n < t.length; ++n) s = t[n], c = l, u = d, f = p, l = s * 4, d = e[2 * s], p = e[2 * s + 1], r[c + 2] = r[l] = f - p, r[c + 3] = r[l + 1] = d - u;
 	}
 	render(e) {
-		let t = e == null ? e = new tt() : void 0, { delaunay: { halfedges: n, inedges: r, hull: i }, circumcenters: a, vectors: o } = this;
+		let t = e == null ? e = new nt() : void 0, { delaunay: { halfedges: n, inedges: r, hull: i }, circumcenters: a, vectors: o } = this;
 		if (i.length <= 1) return null;
 		for (let t = 0, r = n.length; t < r; ++t) {
 			let r = n[t];
@@ -2515,11 +2520,11 @@ var et = 1e-6, tt = class {
 		return t && t.value();
 	}
 	renderBounds(e) {
-		let t = e == null ? e = new tt() : void 0;
+		let t = e == null ? e = new nt() : void 0;
 		return e.rect(this.xmin, this.ymin, this.xmax - this.xmin, this.ymax - this.ymin), t && t.value();
 	}
 	renderCell(e, t) {
-		let n = t == null ? t = new tt() : void 0, r = this._clip(e);
+		let n = t == null ? t = new nt() : void 0, r = this._clip(e);
 		if (r === null || !r.length) return;
 		t.moveTo(r[0], r[1]);
 		let i = r.length;
@@ -2535,7 +2540,7 @@ var et = 1e-6, tt = class {
 		}
 	}
 	cellPolygon(e) {
-		let t = new nt();
+		let t = new rt();
 		return this.renderCell(e, t), t.value();
 	}
 	_renderSegment(e, t, n, r, i) {
@@ -2719,14 +2724,14 @@ var et = 1e-6, tt = class {
 		}
 		return e;
 	}
-}, it = 2 * Math.PI, at = Math.pow;
-function ot(e) {
+}, at = 2 * Math.PI, ot = Math.pow;
+function st(e) {
 	return e[0];
 }
-function st(e) {
+function ct(e) {
 	return e[1];
 }
-function ct(e) {
+function lt(e) {
 	let { triangles: t, coords: n } = e;
 	for (let e = 0; e < t.length; e += 3) {
 		let r = 2 * t[e], i = 2 * t[e + 1], a = 2 * t[e + 2];
@@ -2734,22 +2739,22 @@ function ct(e) {
 	}
 	return !0;
 }
-function lt(e, t, n) {
+function ut(e, t, n) {
 	return [e + Math.sin(e + t) * n, t + Math.cos(e - t) * n];
 }
-var ut = class e {
-	static from(t, n = ot, r = st, i) {
-		return new e("length" in t ? dt(t, n, r, i) : Float64Array.from(ft(t, n, r, i)));
+var dt = class e {
+	static from(t, n = st, r = ct, i) {
+		return new e("length" in t ? ft(t, n, r, i) : Float64Array.from(pt(t, n, r, i)));
 	}
 	constructor(e) {
-		this._delaunator = new We(e), this.inedges = new Int32Array(e.length / 2), this._hullIndex = new Int32Array(e.length / 2), this.points = this._delaunator.coords, this._init();
+		this._delaunator = new Ge(e), this.inedges = new Int32Array(e.length / 2), this._hullIndex = new Int32Array(e.length / 2), this.points = this._delaunator.coords, this._init();
 	}
 	update() {
 		return this._delaunator.update(), this._init(), this;
 	}
 	_init() {
 		let e = this._delaunator, t = this.points;
-		if (e.hull && e.hull.length > 2 && ct(e)) {
+		if (e.hull && e.hull.length > 2 && lt(e)) {
 			this.collinear = Int32Array.from({ length: t.length / 2 }, (e, t) => t).sort((e, n) => t[2 * e] - t[2 * n] || t[2 * e + 1] - t[2 * n + 1]);
 			let e = this.collinear[0], n = this.collinear[this.collinear.length - 1], r = [
 				t[2 * e],
@@ -2758,10 +2763,10 @@ var ut = class e {
 				t[2 * n + 1]
 			], i = 1e-8 * Math.hypot(r[3] - r[1], r[2] - r[0]);
 			for (let e = 0, n = t.length / 2; e < n; ++e) {
-				let n = lt(t[2 * e], t[2 * e + 1], i);
+				let n = ut(t[2 * e], t[2 * e + 1], i);
 				t[2 * e] = n[0], t[2 * e + 1] = n[1];
 			}
-			this._delaunator = new We(t);
+			this._delaunator = new Ge(t);
 		} else delete this.collinear;
 		let n = this.halfedges = this._delaunator.halfedges, r = this.hull = this._delaunator.hull, i = this.triangles = this._delaunator.triangles, a = this.inedges.fill(-1), o = this._hullIndex.fill(-1);
 		for (let e = 0, t = n.length; e < t; ++e) {
@@ -2772,7 +2777,7 @@ var ut = class e {
 		r.length <= 2 && r.length > 0 && (this.triangles = new Int32Array(3).fill(-1), this.halfedges = new Int32Array(3).fill(-1), this.triangles[0] = r[0], a[r[0]] = 1, r.length === 2 && (a[r[1]] = 0, this.triangles[1] = r[1], this.triangles[2] = r[1]));
 	}
 	voronoi(e) {
-		return new rt(this, e);
+		return new it(this, e);
 	}
 	*neighbors(e) {
 		let { inedges: t, hull: n, _hullIndex: r, halfedges: i, triangles: a, collinear: o } = this;
@@ -2802,19 +2807,19 @@ var ut = class e {
 	_step(e, t, n) {
 		let { inedges: r, hull: i, _hullIndex: a, halfedges: o, triangles: s, points: c } = this;
 		if (r[e] === -1 || !c.length) return (e + 1) % (c.length >> 1);
-		let l = e, u = at(t - c[e * 2], 2) + at(n - c[e * 2 + 1], 2), d = r[e], f = d;
+		let l = e, u = ot(t - c[e * 2], 2) + ot(n - c[e * 2 + 1], 2), d = r[e], f = d;
 		do {
-			let r = s[f], d = at(t - c[r * 2], 2) + at(n - c[r * 2 + 1], 2);
+			let r = s[f], d = ot(t - c[r * 2], 2) + ot(n - c[r * 2 + 1], 2);
 			if (d < u && (u = d, l = r), f = f % 3 == 2 ? f - 2 : f + 1, s[f] !== e) break;
 			if (f = o[f], f === -1) {
-				if (f = i[(a[e] + 1) % i.length], f !== r && at(t - c[f * 2], 2) + at(n - c[f * 2 + 1], 2) < u) return f;
+				if (f = i[(a[e] + 1) % i.length], f !== r && ot(t - c[f * 2], 2) + ot(n - c[f * 2 + 1], 2) < u) return f;
 				break;
 			}
 		} while (f !== d);
 		return l;
 	}
 	render(e) {
-		let t = e == null ? e = new tt() : void 0, { points: n, halfedges: r, triangles: i } = this;
+		let t = e == null ? e = new nt() : void 0, { points: n, halfedges: r, triangles: i } = this;
 		for (let t = 0, a = r.length; t < a; ++t) {
 			let a = r[t];
 			if (a < t) continue;
@@ -2825,15 +2830,15 @@ var ut = class e {
 	}
 	renderPoints(e, t) {
 		t === void 0 && (!e || typeof e.moveTo != "function") && (t = e, e = null), t = t == null ? 2 : +t;
-		let n = e == null ? e = new tt() : void 0, { points: r } = this;
+		let n = e == null ? e = new nt() : void 0, { points: r } = this;
 		for (let n = 0, i = r.length; n < i; n += 2) {
 			let i = r[n], a = r[n + 1];
-			e.moveTo(i + t, a), e.arc(i, a, t, 0, it);
+			e.moveTo(i + t, a), e.arc(i, a, t, 0, at);
 		}
 		return n && n.value();
 	}
 	renderHull(e) {
-		let t = e == null ? e = new tt() : void 0, { hull: n, points: r } = this, i = n[0] * 2, a = n.length;
+		let t = e == null ? e = new nt() : void 0, { hull: n, points: r } = this, i = n[0] * 2, a = n.length;
 		e.moveTo(r[i], r[i + 1]);
 		for (let t = 1; t < a; ++t) {
 			let i = 2 * n[t];
@@ -2842,11 +2847,11 @@ var ut = class e {
 		return e.closePath(), t && t.value();
 	}
 	hullPolygon() {
-		let e = new nt();
+		let e = new rt();
 		return this.renderHull(e), e.value();
 	}
 	renderTriangle(e, t) {
-		let n = t == null ? t = new tt() : void 0, { points: r, triangles: i } = this, a = i[e *= 3] * 2, o = i[e + 1] * 2, s = i[e + 2] * 2;
+		let n = t == null ? t = new nt() : void 0, { points: r, triangles: i } = this, a = i[e *= 3] * 2, o = i[e + 1] * 2, s = i[e + 2] * 2;
 		return t.moveTo(r[a], r[a + 1]), t.lineTo(r[o], r[o + 1]), t.lineTo(r[s], r[s + 1]), t.closePath(), n && n.value();
 	}
 	*trianglePolygons() {
@@ -2854,11 +2859,11 @@ var ut = class e {
 		for (let t = 0, n = e.length / 3; t < n; ++t) yield this.trianglePolygon(t);
 	}
 	trianglePolygon(e) {
-		let t = new nt();
+		let t = new rt();
 		return this.renderTriangle(e, t), t.value();
 	}
 };
-function dt(e, t, n, r) {
+function ft(e, t, n, r) {
 	let i = e.length, a = new Float64Array(i * 2);
 	for (let o = 0; o < i; ++o) {
 		let i = e[o];
@@ -2866,20 +2871,20 @@ function dt(e, t, n, r) {
 	}
 	return a;
 }
-function* ft(e, t, n, r) {
+function* pt(e, t, n, r) {
 	let i = 0;
 	for (let a of e) yield t.call(r, a, i, e), yield n.call(r, a, i, e), ++i;
 }
 //#endregion
 //#region src/utils/clusert.mjs
-function pt(e, t, n, r) {
+function mt(e, t, n, r) {
 	return 1 + (e[t][0] === 0 || e[n][0] === 0 || e[r][0] === 0 ? 1 : 0);
 }
-function mt(e, t, n, r, i, a) {
+function ht(e, t, n, r, i, a) {
 	let o = Math.hypot(n - i, r - a), s = Math.hypot(e - i, t - a), c = Math.hypot(e - n, t - r), l = Math.abs((n - e) * (a - t) - (i - e) * (r - t)) / 2;
 	return l === 0 ? Infinity : o * s * c / (4 * l);
 }
-function ht(e) {
+function gt(e) {
 	if (!e || e.length < 3) return [];
 	let t = /* @__PURE__ */ new Set(), n = [];
 	for (let r of e) {
@@ -2887,12 +2892,12 @@ function ht(e) {
 		t.has(e) || (t.add(e), n.push(r));
 	}
 	if (n.length < 3) return [];
-	let { triangles: r } = new ut(Float64Array.from(n.flat()));
+	let { triangles: r } = new dt(Float64Array.from(n.flat()));
 	if (!r.length) return [];
 	let i = /* @__PURE__ */ new Map(), a = (e, t) => e < t ? `${e}_${t}` : `${t}_${e}`;
 	for (let e = 0; e < r.length; e += 3) {
 		let t = r[e], o = r[e + 1], s = r[e + 2], [c, l] = n[t], [u, d] = n[o], [f, p] = n[s];
-		if (mt(c, l, u, d, f, p) <= 1 / pt(n, t, o, s)) for (let [e, n] of [
+		if (ht(c, l, u, d, f, p) <= 1 / mt(n, t, o, s)) for (let [e, n] of [
 			[t, o],
 			[o, s],
 			[s, t]
@@ -2941,7 +2946,7 @@ var q = {
 	[],
 	[],
 	[]
-], Z = [], gt = new d(), _t = new d(), vt = new d(), Q = new d(), yt = new d(), bt = new d(), xt = new a(), St = new t(), Ct = new o(), wt = new o(), Tt = new l(), Et = class {
+], Z = [], _t = new d(), vt = new d(), yt = new d(), Q = new d(), bt = new d(), xt = new d(), St = new a(), Ct = new t(), wt = new o(), Tt = new o(), Et = new l(), Dt = class {
 	constructor(e = new d(), t = new d(), n = new a()) {
 		this.center = e, this.halfSize = t, this.rotation = n;
 	}
@@ -2959,22 +2964,22 @@ var q = {
 	}
 	clampPoint(e, t) {
 		let n = this.halfSize;
-		Q.subVectors(e, this.center), this.rotation.extractBasis(gt, _t, vt), t.copy(this.center);
-		let r = i.clamp(Q.dot(gt), -n.x, n.x);
-		t.add(gt.multiplyScalar(r));
-		let a = i.clamp(Q.dot(_t), -n.y, n.y);
-		t.add(_t.multiplyScalar(a));
-		let o = i.clamp(Q.dot(vt), -n.z, n.z);
-		return t.add(vt.multiplyScalar(o)), t;
+		Q.subVectors(e, this.center), this.rotation.extractBasis(_t, vt, yt), t.copy(this.center);
+		let r = i.clamp(Q.dot(_t), -n.x, n.x);
+		t.add(_t.multiplyScalar(r));
+		let a = i.clamp(Q.dot(vt), -n.y, n.y);
+		t.add(vt.multiplyScalar(a));
+		let o = i.clamp(Q.dot(yt), -n.z, n.z);
+		return t.add(yt.multiplyScalar(o)), t;
 	}
 	containsPoint(e) {
-		return Q.subVectors(e, this.center), this.rotation.extractBasis(gt, _t, vt), Math.abs(Q.dot(gt)) <= this.halfSize.x && Math.abs(Q.dot(_t)) <= this.halfSize.y && Math.abs(Q.dot(vt)) <= this.halfSize.z;
+		return Q.subVectors(e, this.center), this.rotation.extractBasis(_t, vt, yt), Math.abs(Q.dot(_t)) <= this.halfSize.x && Math.abs(Q.dot(vt)) <= this.halfSize.y && Math.abs(Q.dot(yt)) <= this.halfSize.z;
 	}
 	intersectsBox3(e) {
-		return this.intersectsOBB(Dt.fromBox3(e));
+		return this.intersectsOBB(Ot.fromBox3(e));
 	}
 	intersectsSphere(e) {
-		return this.clampPoint(e.center, bt), bt.distanceToSquared(e.center) <= e.radius * e.radius;
+		return this.clampPoint(e.center, xt), xt.distanceToSquared(e.center) <= e.radius * e.radius;
 	}
 	intersectsOBB(e, t = 2 ** -52) {
 		q.c = this.center, q.e[0] = this.halfSize.x, q.e[1] = this.halfSize.y, q.e[2] = this.halfSize.z, this.rotation.extractBasis(q.u[0], q.u[1], q.u[2]), J.c = e.center, J.e[0] = e.halfSize.x, J.e[1] = e.halfSize.y, J.e[2] = e.halfSize.z, e.rotation.extractBasis(J.u[0], J.u[1], J.u[2]);
@@ -2987,12 +2992,12 @@ var q = {
 		return n = q.e[1] * X[2][0] + q.e[2] * X[1][0], r = J.e[1] * X[0][2] + J.e[2] * X[0][1], !(Math.abs(Z[2] * Y[1][0] - Z[1] * Y[2][0]) > n + r || (n = q.e[1] * X[2][1] + q.e[2] * X[1][1], r = J.e[0] * X[0][2] + J.e[2] * X[0][0], Math.abs(Z[2] * Y[1][1] - Z[1] * Y[2][1]) > n + r) || (n = q.e[1] * X[2][2] + q.e[2] * X[1][2], r = J.e[0] * X[0][1] + J.e[1] * X[0][0], Math.abs(Z[2] * Y[1][2] - Z[1] * Y[2][2]) > n + r) || (n = q.e[0] * X[2][0] + q.e[2] * X[0][0], r = J.e[1] * X[1][2] + J.e[2] * X[1][1], Math.abs(Z[0] * Y[2][0] - Z[2] * Y[0][0]) > n + r) || (n = q.e[0] * X[2][1] + q.e[2] * X[0][1], r = J.e[0] * X[1][2] + J.e[2] * X[1][0], Math.abs(Z[0] * Y[2][1] - Z[2] * Y[0][1]) > n + r) || (n = q.e[0] * X[2][2] + q.e[2] * X[0][2], r = J.e[0] * X[1][1] + J.e[1] * X[1][0], Math.abs(Z[0] * Y[2][2] - Z[2] * Y[0][2]) > n + r) || (n = q.e[0] * X[1][0] + q.e[1] * X[0][0], r = J.e[1] * X[2][2] + J.e[2] * X[2][1], Math.abs(Z[1] * Y[0][0] - Z[0] * Y[1][0]) > n + r) || (n = q.e[0] * X[1][1] + q.e[1] * X[0][1], r = J.e[0] * X[2][2] + J.e[2] * X[2][0], Math.abs(Z[1] * Y[0][1] - Z[0] * Y[1][1]) > n + r) || (n = q.e[0] * X[1][2] + q.e[1] * X[0][2], r = J.e[0] * X[2][1] + J.e[1] * X[2][0], Math.abs(Z[1] * Y[0][2] - Z[0] * Y[1][2]) > n + r));
 	}
 	intersectsPlane(e) {
-		this.rotation.extractBasis(gt, _t, vt);
-		let t = this.halfSize.x * Math.abs(e.normal.dot(gt)) + this.halfSize.y * Math.abs(e.normal.dot(_t)) + this.halfSize.z * Math.abs(e.normal.dot(vt)), n = e.normal.dot(this.center) - e.constant;
+		this.rotation.extractBasis(_t, vt, yt);
+		let t = this.halfSize.x * Math.abs(e.normal.dot(_t)) + this.halfSize.y * Math.abs(e.normal.dot(vt)) + this.halfSize.z * Math.abs(e.normal.dot(yt)), n = e.normal.dot(this.center) - e.constant;
 		return Math.abs(n) <= t;
 	}
 	intersectRay(e, t) {
-		return this.getSize(yt), St.setFromCenterAndSize(Q.set(0, 0, 0), yt), Ct.setFromMatrix3(this.rotation), Ct.setPosition(this.center), wt.copy(Ct).invert(), Tt.copy(e).applyMatrix4(wt), Tt.intersectBox(St, t) ? t.applyMatrix4(Ct) : null;
+		return this.getSize(bt), Ct.setFromCenterAndSize(Q.set(0, 0, 0), bt), wt.setFromMatrix3(this.rotation), wt.setPosition(this.center), Tt.copy(wt).invert(), Et.copy(e).applyMatrix4(Tt), Et.intersectBox(Ct, t) ? t.applyMatrix4(wt) : null;
 	}
 	intersectsRay(e) {
 		return this.intersectRay(e, Q) !== null;
@@ -3005,11 +3010,11 @@ var q = {
 	}
 	applyMatrix4(e) {
 		let t = e.elements, n = Q.set(t[0], t[1], t[2]).length(), r = Q.set(t[4], t[5], t[6]).length(), i = Q.set(t[8], t[9], t[10]).length();
-		e.determinant() < 0 && (n = -n), xt.setFromMatrix4(e);
+		e.determinant() < 0 && (n = -n), St.setFromMatrix4(e);
 		let a = 1 / n, o = 1 / r, s = 1 / i;
-		return xt.elements[0] *= a, xt.elements[1] *= a, xt.elements[2] *= a, xt.elements[3] *= o, xt.elements[4] *= o, xt.elements[5] *= o, xt.elements[6] *= s, xt.elements[7] *= s, xt.elements[8] *= s, this.rotation.multiply(xt), this.halfSize.x *= n, this.halfSize.y *= r, this.halfSize.z *= i, Q.setFromMatrixPosition(e), this.center.add(Q), this;
+		return St.elements[0] *= a, St.elements[1] *= a, St.elements[2] *= a, St.elements[3] *= o, St.elements[4] *= o, St.elements[5] *= o, St.elements[6] *= s, St.elements[7] *= s, St.elements[8] *= s, this.rotation.multiply(St), this.halfSize.x *= n, this.halfSize.y *= r, this.halfSize.z *= i, Q.setFromMatrixPosition(e), this.center.add(Q), this;
 	}
-}, Dt = new Et(), $ = 6371008.8, Ot = {
+}, Ot = new Dt(), $ = 6371008.8, kt = {
 	centimeters: $ * 100,
 	centimetres: $ * 100,
 	degrees: 360 / (2 * Math.PI),
@@ -3026,60 +3031,60 @@ var q = {
 	radians: 1,
 	yards: $ * 1.0936
 };
-function kt(e, t, n = {}) {
+function At(e, t, n = {}) {
 	let r = { type: "Feature" };
 	return (n.id === 0 || n.id) && (r.id = n.id), n.bbox && (r.bbox = n.bbox), r.properties = t || {}, r.geometry = e, r;
 }
-function At(e, t, n = {}) {
+function jt(e, t, n = {}) {
 	if (!e) throw Error("coordinates is required");
 	if (!Array.isArray(e)) throw Error("coordinates must be an Array");
 	if (e.length < 2) throw Error("coordinates must be at least 2 numbers long");
-	if (!Lt(e[0]) || !Lt(e[1])) throw Error("coordinates must contain numbers");
-	return kt({
+	if (!Rt(e[0]) || !Rt(e[1])) throw Error("coordinates must contain numbers");
+	return At({
 		type: "Point",
 		coordinates: e
 	}, t, n);
 }
-function jt(e, t, n = {}) {
+function Mt(e, t, n = {}) {
 	for (let t of e) {
 		if (t.length < 4) throw Error("Each LinearRing of a Polygon must have 4 or more Positions.");
 		if (t[t.length - 1].length !== t[0].length) throw Error("First and last Position are not equivalent.");
 		for (let e = 0; e < t[t.length - 1].length; e++) if (t[t.length - 1][e] !== t[0][e]) throw Error("First and last Position are not equivalent.");
 	}
-	return kt({
+	return At({
 		type: "Polygon",
 		coordinates: e
 	}, t, n);
 }
-function Mt(e, t = "kilometers") {
-	let n = Ot[t];
+function Nt(e, t = "kilometers") {
+	let n = kt[t];
 	if (!n) throw Error(t + " units is invalid");
 	return e * n;
 }
-function Nt(e, t = "kilometers") {
-	let n = Ot[t];
+function Pt(e, t = "kilometers") {
+	let n = kt[t];
 	if (!n) throw Error(t + " units is invalid");
 	return e / n;
 }
-function Pt(e) {
+function Ft(e) {
 	return e % (2 * Math.PI) * 180 / Math.PI;
 }
-function Ft(e) {
+function It(e) {
 	return e % 360 * Math.PI / 180;
 }
-function It(e, t = "kilometers", n = "kilometers") {
+function Lt(e, t = "kilometers", n = "kilometers") {
 	if (!(e >= 0)) throw Error("length must be a positive number");
-	return Mt(Nt(e, t), n);
+	return Nt(Pt(e, t), n);
 }
-function Lt(e) {
+function Rt(e) {
 	return !isNaN(e) && e !== null && !Array.isArray(e);
 }
-function Rt(e) {
+function zt(e) {
 	return typeof e == "object" && !!e && !Array.isArray(e);
 }
 //#endregion
 //#region node_modules/@turf/meta/dist/esm/index.js
-function zt(e, t, n) {
+function Bt(e, t, n) {
 	if (e !== null) for (var r, i, a, o, s, c, l, u = 0, d = 0, f, p = e.type, m = p === "FeatureCollection", h = p === "Feature", g = m ? e.features.length : 1, _ = 0; _ < g; _++) {
 		l = m ? e.features[_].geometry : h ? e.geometry : e, f = l ? l.type === "GeometryCollection" : !1, s = f ? l.geometries.length : 1;
 		for (var v = 0; v < s; v++) {
@@ -3125,7 +3130,7 @@ function zt(e, t, n) {
 						}
 						break;
 					case "GeometryCollection":
-						for (r = 0; r < o.geometries.length; r++) if (zt(o.geometries[r], t, n) === !1) return !1;
+						for (r = 0; r < o.geometries.length; r++) if (Bt(o.geometries[r], t, n) === !1) return !1;
 						break;
 					default: throw Error("Unknown Geometry Type");
 				}
@@ -3133,13 +3138,13 @@ function zt(e, t, n) {
 		}
 	}
 }
-function Bt(e) {
+function Vt(e) {
 	var t = [];
-	return zt(e, function(e) {
+	return Bt(e, function(e) {
 		t.push(e);
 	}), t;
 }
-function Vt(e, t) {
+function Ht(e, t) {
 	var n, r, i, a, o, s, c, l, u, d, f = 0, p = e.type === "FeatureCollection", m = e.type === "Feature", h = p ? e.features.length : 1;
 	for (n = 0; n < h; n++) {
 		for (s = p ? e.features[n].geometry : m ? e.geometry : e, l = p ? e.features[n].properties : m ? e.properties : {}, u = p ? e.features[n].bbox : m ? e.bbox : void 0, d = p ? e.features[n].id : m ? e.id : void 0, c = s ? s.type === "GeometryCollection" : !1, o = c ? s.geometries.length : 1, i = 0; i < o; i++) {
@@ -3165,15 +3170,15 @@ function Vt(e, t) {
 		f++;
 	}
 }
-function Ht(e, t, n) {
+function Ut(e, t, n) {
 	var r = n;
-	return Vt(e, function(e, i, a, o, s) {
+	return Ht(e, function(e, i, a, o, s) {
 		r = i === 0 && n === void 0 ? e : t(r, e, i, a, o, s);
 	}), r;
 }
 //#endregion
 //#region node_modules/rbush/rbush.min.js
-var Ut = /* @__PURE__ */ y(((e, t) => {
+var Wt = /* @__PURE__ */ y(((e, t) => {
 	(function(n, r) {
 		typeof e == "object" && t !== void 0 ? t.exports = r() : typeof define == "function" && define.amd ? define(r) : (n ||= self).RBush = r();
 	})(e, function() {
@@ -3390,13 +3395,13 @@ var Ut = /* @__PURE__ */ y(((e, t) => {
 			for (var t = e.length - 1, n = void 0; t >= 0; t--) e[t].children.length === 0 ? t > 0 ? (n = e[t - 1].children).splice(n.indexOf(e[t]), 1) : this.clear() : a(e[t], this.toBBox);
 		}, r;
 	});
-})), Wt = /* @__PURE__ */ b({ default: () => Kt });
-function Gt(e, t) {
+})), Gt = /* @__PURE__ */ b({ default: () => qt });
+function Kt(e, t) {
 	return e < t ? -1 : e > t ? 1 : 0;
 }
-var Kt, qt = v((() => {
-	Kt = class {
-		constructor(e = [], t = Gt) {
+var qt, Jt = v((() => {
+	qt = class {
+		constructor(e = [], t = Kt) {
 			if (this.data = e, this.length = this.data.length, this.compare = t, this.length > 0) for (let e = (this.length >> 1) - 1; e >= 0; e--) this._down(e);
 		}
 		push(e) {
@@ -3429,7 +3434,7 @@ var Kt, qt = v((() => {
 			t[e] = i;
 		}
 	};
-})), Jt = /* @__PURE__ */ y(((e, t) => {
+})), Yt = /* @__PURE__ */ y(((e, t) => {
 	t.exports = function(e, t, n, r) {
 		var i = e[0], a = e[1], o = !1;
 		n === void 0 && (n = 0), r === void 0 && (r = t.length);
@@ -3439,7 +3444,7 @@ var Kt, qt = v((() => {
 		}
 		return o;
 	};
-})), Yt = /* @__PURE__ */ y(((e, t) => {
+})), Xt = /* @__PURE__ */ y(((e, t) => {
 	t.exports = function(e, t, n, r) {
 		var i = e[0], a = e[1], o = !1;
 		n === void 0 && (n = 0), r === void 0 && (r = t.length);
@@ -3449,12 +3454,12 @@ var Kt, qt = v((() => {
 		}
 		return o;
 	};
-})), Xt = /* @__PURE__ */ y(((e, t) => {
-	var n = Jt(), r = Yt();
+})), Zt = /* @__PURE__ */ y(((e, t) => {
+	var n = Yt(), r = Xt();
 	t.exports = function(e, t, i, a) {
 		return t.length > 0 && Array.isArray(t[0]) ? r(e, t, i, a) : n(e, t, i, a);
 	}, t.exports.nested = r, t.exports.flat = n;
-})), Zt = /* @__PURE__ */ y(((e, t) => {
+})), Qt = /* @__PURE__ */ y(((e, t) => {
 	(function(n, r) {
 		typeof e == "object" && t !== void 0 ? r(e) : typeof define == "function" && define.amd ? define(["exports"], r) : r((n ||= self).predicates = {});
 	})(e, function(e) {
@@ -3495,8 +3500,8 @@ var Kt, qt = v((() => {
 			return (t - a) * (n - i) - (e - i) * (r - a);
 		}, Object.defineProperty(e, "__esModule", { value: !0 });
 	});
-})), Qt = /* @__PURE__ */ S((/* @__PURE__ */ y(((e, t) => {
-	var n = Ut(), r = (qt(), C(Wt)), i = Xt(), a = Zt().orient2d;
+})), $t = /* @__PURE__ */ S((/* @__PURE__ */ y(((e, t) => {
+	var n = Wt(), r = (Jt(), C(Gt)), i = Zt(), a = Qt().orient2d;
 	r.default && (r = r.default), t.exports = o, t.exports.default = o;
 	function o(e, t, r) {
 		t = Math.max(0, t === void 0 ? 2 : t), r ||= 0;
@@ -3646,26 +3651,26 @@ var Kt, qt = v((() => {
 		return r.pop(), t.pop(), t.concat(r);
 	}
 })))(), 1);
-function $t(e, t = {}) {
+function en(e, t = {}) {
 	t.concavity = t.concavity || Infinity;
 	let n = [];
-	if (zt(e, (e) => {
+	if (Bt(e, (e) => {
 		n.push([e[0], e[1]]);
 	}), !n.length) return null;
-	let r = (0, Qt.default)(n, t.concavity);
-	return r.length > 3 ? jt([r]) : null;
+	let r = (0, $t.default)(n, t.concavity);
+	return r.length > 3 ? Mt([r]) : null;
 }
 //#endregion
 //#region node_modules/@turf/centroid/dist/esm/index.js
-function en(e, t = {}) {
+function tn(e, t = {}) {
 	let n = 0, r = 0, i = 0;
-	return zt(e, function(e) {
+	return Bt(e, function(e) {
 		n += e[0], r += e[1], i++;
-	}, !0), At([n / i, r / i], t.properties);
+	}, !0), jt([n / i, r / i], t.properties);
 }
 //#endregion
 //#region node_modules/@turf/invariant/dist/esm/index.js
-function tn(e) {
+function nn(e) {
 	if (!e) throw Error("coord is required");
 	if (!Array.isArray(e)) {
 		if (e.type === "Feature" && e.geometry !== null && e.geometry.type === "Point") return [...e.geometry.coordinates];
@@ -3674,7 +3679,7 @@ function tn(e) {
 	if (Array.isArray(e) && e.length >= 2 && !Array.isArray(e[0]) && !Array.isArray(e[1])) return [...e];
 	throw Error("coord must be GeoJSON Point or an Array of numbers");
 }
-function nn(e) {
+function rn(e) {
 	if (Array.isArray(e)) return e;
 	if (e.type === "Feature") {
 		if (e.geometry !== null) return e.geometry.coordinates;
@@ -3683,23 +3688,23 @@ function nn(e) {
 }
 //#endregion
 //#region node_modules/@turf/rhumb-bearing/dist/esm/index.js
-function rn(e, t, n = {}) {
+function an(e, t, n = {}) {
 	let r;
-	return r = n.final ? an(tn(t), tn(e)) : an(tn(e), tn(t)), r > 180 ? -(360 - r) : r;
+	return r = n.final ? on(nn(t), nn(e)) : on(nn(e), nn(t)), r > 180 ? -(360 - r) : r;
 }
-function an(e, t) {
-	let n = Ft(e[1]), r = Ft(t[1]), i = Ft(t[0] - e[0]);
+function on(e, t) {
+	let n = It(e[1]), r = It(t[1]), i = It(t[0] - e[0]);
 	i > Math.PI && (i -= 2 * Math.PI), i < -Math.PI && (i += 2 * Math.PI);
 	let a = Math.log(Math.tan(r / 2 + Math.PI / 4) / Math.tan(n / 2 + Math.PI / 4));
-	return (Pt(Math.atan2(i, a)) + 360) % 360;
+	return (Ft(Math.atan2(i, a)) + 360) % 360;
 }
 //#endregion
 //#region node_modules/@turf/rhumb-distance/dist/esm/index.js
-function on(e, t, n = {}) {
-	let r = tn(e), i = tn(t);
-	return i[0] += i[0] - r[0] > 180 ? -360 : r[0] - i[0] > 180 ? 360 : 0, It(sn(r, i), "meters", n.units);
+function sn(e, t, n = {}) {
+	let r = nn(e), i = nn(t);
+	return i[0] += i[0] - r[0] > 180 ? -360 : r[0] - i[0] > 180 ? 360 : 0, Lt(cn(r, i), "meters", n.units);
 }
-function sn(e, t, n) {
+function cn(e, t, n) {
 	n = n === void 0 ? $ : Number(n);
 	let r = n, i = e[1] * Math.PI / 180, a = t[1] * Math.PI / 180, o = a - i, s = Math.abs(t[0] - e[0]) * Math.PI / 180;
 	s > Math.PI && (s -= 2 * Math.PI);
@@ -3708,37 +3713,37 @@ function sn(e, t, n) {
 }
 //#endregion
 //#region node_modules/@turf/rhumb-destination/dist/esm/index.js
-function cn(e, t, n, r = {}) {
-	let i = t < 0, a = It(Math.abs(t), r.units, "meters");
+function ln(e, t, n, r = {}) {
+	let i = t < 0, a = Lt(Math.abs(t), r.units, "meters");
 	i && (a = -Math.abs(a));
-	let o = tn(e), s = ln(o, a, n);
-	return s[0] += s[0] - o[0] > 180 ? -360 : o[0] - s[0] > 180 ? 360 : 0, At(s, r.properties);
+	let o = nn(e), s = un(o, a, n);
+	return s[0] += s[0] - o[0] > 180 ? -360 : o[0] - s[0] > 180 ? 360 : 0, jt(s, r.properties);
 }
-function ln(e, t, n, r) {
+function un(e, t, n, r) {
 	r = r === void 0 ? $ : Number(r);
-	let i = t / r, a = e[0] * Math.PI / 180, o = Ft(e[1]), s = Ft(n), c = i * Math.cos(s), l = o + c;
+	let i = t / r, a = e[0] * Math.PI / 180, o = It(e[1]), s = It(n), c = i * Math.cos(s), l = o + c;
 	Math.abs(l) > Math.PI / 2 && (l = l > 0 ? Math.PI - l : -Math.PI - l);
 	let u = Math.log(Math.tan(l / 2 + Math.PI / 4) / Math.tan(o / 2 + Math.PI / 4)), d = Math.abs(u) > 1e-11 ? c / u : Math.cos(o);
 	return [((a + i * Math.sin(s) / d) * 180 / Math.PI + 540) % 360 - 180, l * 180 / Math.PI];
 }
 //#endregion
 //#region node_modules/@turf/clone/dist/esm/index.js
-function un(e) {
+function dn(e) {
 	if (!e) throw Error("geojson is required");
 	switch (e.type) {
-		case "Feature": return dn(e);
-		case "FeatureCollection": return pn(e);
+		case "Feature": return fn(e);
+		case "FeatureCollection": return mn(e);
 		case "Point":
 		case "LineString":
 		case "Polygon":
 		case "MultiPoint":
 		case "MultiLineString":
 		case "MultiPolygon":
-		case "GeometryCollection": return mn(e);
+		case "GeometryCollection": return hn(e);
 		default: throw Error("unknown GeoJSON type");
 	}
 }
-function dn(e) {
+function fn(e) {
 	let t = { type: "Feature" };
 	return Object.keys(e).forEach((n) => {
 		switch (n) {
@@ -3747,16 +3752,16 @@ function dn(e) {
 			case "geometry": return;
 			default: t[n] = e[n];
 		}
-	}), t.properties = fn(e.properties), e.geometry == null ? t.geometry = null : t.geometry = mn(e.geometry), t;
+	}), t.properties = pn(e.properties), e.geometry == null ? t.geometry = null : t.geometry = hn(e.geometry), t;
 }
-function fn(e) {
+function pn(e) {
 	let t = {};
 	return e && Object.keys(e).forEach((n) => {
 		let r = e[n];
-		typeof r == "object" ? r === null ? t[n] = null : Array.isArray(r) ? t[n] = r.map((e) => e) : t[n] = fn(r) : t[n] = r;
+		typeof r == "object" ? r === null ? t[n] = null : Array.isArray(r) ? t[n] = r.map((e) => e) : t[n] = pn(r) : t[n] = r;
 	}), t;
 }
-function pn(e) {
+function mn(e) {
 	let t = { type: "FeatureCollection" };
 	return Object.keys(e).forEach((n) => {
 		switch (n) {
@@ -3764,44 +3769,44 @@ function pn(e) {
 			case "features": return;
 			default: t[n] = e[n];
 		}
-	}), t.features = e.features.map((e) => dn(e)), t;
+	}), t.features = e.features.map((e) => fn(e)), t;
 }
-function mn(e) {
+function hn(e) {
 	let t = { type: e.type };
-	return e.bbox && (t.bbox = e.bbox), e.type === "GeometryCollection" ? (t.geometries = e.geometries.map((e) => mn(e)), t) : (t.coordinates = hn(e.coordinates), t);
+	return e.bbox && (t.bbox = e.bbox), e.type === "GeometryCollection" ? (t.geometries = e.geometries.map((e) => hn(e)), t) : (t.coordinates = gn(e.coordinates), t);
 }
-function hn(e) {
+function gn(e) {
 	let t = e;
-	return typeof t[0] == "object" ? t.map((e) => hn(e)) : t.slice();
+	return typeof t[0] == "object" ? t.map((e) => gn(e)) : t.slice();
 }
 //#endregion
 //#region node_modules/@turf/transform-rotate/dist/esm/index.js
-function gn(e, t, n) {
-	if (n ||= {}, !Rt(n)) throw Error("options is invalid");
+function _n(e, t, n) {
+	if (n ||= {}, !zt(n)) throw Error("options is invalid");
 	let r = n.pivot, i = n.mutate;
 	if (!e) throw Error("geojson is required");
 	if (t == null || isNaN(t)) throw Error("angle is required");
 	if (t === 0) return e;
-	let a = r ?? en(e);
-	return (i === !1 || i === void 0) && (e = un(e)), zt(e, function(e) {
-		let n = rn(a, e) + t, r = nn(cn(a, on(a, e), n));
+	let a = r ?? tn(e);
+	return (i === !1 || i === void 0) && (e = dn(e)), Bt(e, function(e) {
+		let n = an(a, e) + t, r = rn(ln(a, sn(a, e), n));
 		e[0] = r[0], e[1] = r[1];
 	}), e;
 }
 //#endregion
 //#region node_modules/@turf/bearing/dist/esm/index.js
-function _n(e, t, n = {}) {
-	if (n.final === !0) return vn(e, t);
-	let r = tn(e), i = tn(t), a = Ft(r[0]), o = Ft(i[0]), s = Ft(r[1]), c = Ft(i[1]), l = Math.sin(o - a) * Math.cos(c), u = Math.cos(s) * Math.sin(c) - Math.sin(s) * Math.cos(c) * Math.cos(o - a);
-	return Pt(Math.atan2(l, u));
+function vn(e, t, n = {}) {
+	if (n.final === !0) return yn(e, t);
+	let r = nn(e), i = nn(t), a = It(r[0]), o = It(i[0]), s = It(r[1]), c = It(i[1]), l = Math.sin(o - a) * Math.cos(c), u = Math.cos(s) * Math.sin(c) - Math.sin(s) * Math.cos(c) * Math.cos(o - a);
+	return Ft(Math.atan2(l, u));
 }
-function vn(e, t) {
-	let n = _n(t, e);
+function yn(e, t) {
+	let n = vn(t, e);
 	return n = (n + 180) % 360, n;
 }
 //#endregion
 //#region node_modules/@turf/bbox/dist/esm/index.js
-function yn(e, t = {}) {
+function bn(e, t = {}) {
 	if (e.bbox != null && !0 !== t.recompute) return e.bbox;
 	let n = [
 		Infinity,
@@ -3809,17 +3814,17 @@ function yn(e, t = {}) {
 		-Infinity,
 		-Infinity
 	];
-	return zt(e, (e) => {
+	return Bt(e, (e) => {
 		n[0] > e[0] && (n[0] = e[0]), n[1] > e[1] && (n[1] = e[1]), n[2] < e[0] && (n[2] = e[0]), n[3] < e[1] && (n[3] = e[1]);
 	}), n;
 }
 //#endregion
 //#region node_modules/@turf/bbox-polygon/dist/esm/index.js
-function bn(e, t = {}) {
+function xn(e, t = {}) {
 	let n = Number(e[0]), r = Number(e[1]), i = Number(e[2]), a = Number(e[3]);
 	if (e.length === 6) throw Error("@turf/bbox-polygon does not support BBox with 6 positions");
 	let o = [n, r];
-	return jt([[
+	return Mt([[
 		o,
 		[i, r],
 		[i, a],
@@ -3832,20 +3837,20 @@ function bn(e, t = {}) {
 }
 //#endregion
 //#region node_modules/@turf/envelope/dist/esm/index.js
-function xn(e) {
-	return bn(yn(e));
+function Sn(e) {
+	return xn(bn(e));
 }
 //#endregion
 //#region node_modules/@turf/area/dist/esm/index.js
-function Sn(e) {
-	return Ht(e, (e, t) => e + Cn(t), 0);
-}
 function Cn(e) {
+	return Ut(e, (e, t) => e + wn(t), 0);
+}
+function wn(e) {
 	let t = 0, n;
 	switch (e.type) {
-		case "Polygon": return wn(e.coordinates);
+		case "Polygon": return Tn(e.coordinates);
 		case "MultiPolygon":
-			for (n = 0; n < e.coordinates.length; n++) t += wn(e.coordinates[n]);
+			for (n = 0; n < e.coordinates.length; n++) t += Tn(e.coordinates[n]);
 			return t;
 		case "Point":
 		case "MultiPoint":
@@ -3854,57 +3859,57 @@ function Cn(e) {
 	}
 	return 0;
 }
-function wn(e) {
+function Tn(e) {
 	let t = 0;
 	if (e && e.length > 0) {
-		t += Math.abs(Dn(e[0]));
-		for (let n = 1; n < e.length; n++) t -= Math.abs(Dn(e[n]));
+		t += Math.abs(On(e[0]));
+		for (let n = 1; n < e.length; n++) t -= Math.abs(On(e[n]));
 	}
 	return t;
 }
-var Tn = $ * $ / 2, En = Math.PI / 180;
-function Dn(e) {
+var En = $ * $ / 2, Dn = Math.PI / 180;
+function On(e) {
 	let t = e.length - 1;
 	if (t <= 2) return 0;
 	let n = 0, r = 0;
 	for (; r < t;) {
-		let i = e[r], a = e[r + 1 === t ? 0 : r + 1], o = e[r + 2 >= t ? (r + 2) % t : r + 2], s = i[0] * En, c = a[1] * En, l = o[0] * En;
+		let i = e[r], a = e[r + 1 === t ? 0 : r + 1], o = e[r + 2 >= t ? (r + 2) % t : r + 2], s = i[0] * Dn, c = a[1] * Dn, l = o[0] * Dn;
 		n += (l - s) * Math.sin(c), r++;
 	}
-	return n * Tn;
+	return n * En;
 }
 //#endregion
 //#region node_modules/geojson-minimum-bounding-rectangle/dist/index.js
-function On(e) {
-	let t = $t(e);
+function kn(e) {
+	let t = en(e);
 	if (!t) throw Error("Can't calculate smallestSurroundingRectangleByArea for given geometry");
-	let n = en(t), r = Bt(t), i = 2 ** 53 - 1, a = null;
+	let n = tn(t), r = Vt(t), i = 2 ** 53 - 1, a = null;
 	for (let e = 0; e < r.length - 1; e++) {
-		let o = _n(r[e], r[e + 1]), s = xn(gn(t, -1 * o, { pivot: n })), c = Sn(s);
-		c < i && (i = c, a = gn(s, o, { pivot: n }));
+		let o = vn(r[e], r[e + 1]), s = Sn(_n(t, -1 * o, { pivot: n })), c = Cn(s);
+		c < i && (i = c, a = _n(s, o, { pivot: n }));
 	}
 	return a;
 }
 //#endregion
 //#region src/utils/OBB.mjs
-function kn(e, t) {
+function An(e, t) {
 	let n = t[0] - e[0], r = t[1] - e[1];
 	return Math.sqrt(n * n + r * r);
 }
-function An(e) {
+function jn(e) {
 	let t = Infinity, n = -Infinity, r = Infinity, i = -Infinity;
 	for (let [a, o] of e) a < t && (t = a), a > n && (n = a), o < r && (r = o), o > i && (i = o);
 	return [(n + t) * .5, (i + r) * .5];
 }
-var jn = class t extends Et {
+var Mn = class t extends Dt {
 	getBoxMesh() {
-		Mn.identity(), Mn.setFromMatrix3(this.rotation), Mn.decompose(In, Nn, new e.Vector3());
+		Nn.identity(), Nn.setFromMatrix3(this.rotation), Nn.decompose(Ln, Pn, new e.Vector3());
 		let t = this.halfSize.clone().multiplyScalar(2), n = new e.Mesh(new e.BoxGeometry(t.x, t.y, t.z));
-		return n.position.copy(this.center), n.rotation.setFromQuaternion(Nn), n;
+		return n.position.copy(this.center), n.rotation.setFromQuaternion(Pn), n;
 	}
 	getBoxEdge(t = 16776960) {
 		let n = this.getBoxMesh();
-		Ln.setFromObject(n);
+		Rn.setFromObject(n);
 		let r = new e.EdgesGeometry(n.geometry.clone().applyMatrix4(n.matrixWorld));
 		return new e.LineSegments(r, new e.LineBasicMaterial({
 			color: t,
@@ -3912,33 +3917,33 @@ var jn = class t extends Et {
 		}));
 	}
 	toJson() {
-		return Mn.identity(), Mn.setFromMatrix3(this.rotation), Mn.decompose(In, Nn, new e.Vector3()), {
+		return Nn.identity(), Nn.setFromMatrix3(this.rotation), Nn.decompose(Ln, Pn, new e.Vector3()), {
 			size: this.halfSize.toArray(),
 			center: this.center.toArray(),
-			quaternion: Nn.toArray()
+			quaternion: Pn.toArray()
 		};
 	}
 	static from(n, r, i, a = new t()) {
-		if (i instanceof e.Euler) Nn.setFromEuler(i);
-		else if (i instanceof e.Quaternion) Nn.copy(i);
+		if (i instanceof e.Euler) Pn.setFromEuler(i);
+		else if (i instanceof e.Quaternion) Pn.copy(i);
 		else throw Error("传入的旋转不是欧拉角或者四元数");
-		return Mn.compose(r, Nn, Fn), a.center.copy(r), a.halfSize.copy(n.multiplyScalar(.5)), a.rotation.setFromMatrix4(Mn), a;
+		return Nn.compose(r, Pn, In), a.center.copy(r), a.halfSize.copy(n.multiplyScalar(.5)), a.rotation.setFromMatrix4(Nn), a;
 	}
 	static fromByPath2D(e, n, r, i = new t()) {
-		let a = On({
+		let a = kn({
 			type: "Polygon",
 			coordinates: [e.map((e) => [e.x, e.y])]
 		});
 		if (!a) throw Error("2d obb 获取失败");
-		let o = a.geometry.coordinates[0], s = kn(o[0], o[1]), c = kn(o[1], o[2]), l = Math.atan2(o[1][1] - o[0][1], o[1][0] - o[0][0]);
-		In.set(s, c, r), Pn.set(0, 0, l);
-		let [u, d] = An(o);
-		return n.x = u, n.y = d, this.from(In, n, Pn, i);
+		let o = a.geometry.coordinates[0], s = An(o[0], o[1]), c = An(o[1], o[2]), l = Math.atan2(o[1][1] - o[0][1], o[1][0] - o[0][0]);
+		Ln.set(s, c, r), Fn.set(0, 0, l);
+		let [u, d] = jn(o);
+		return n.x = u, n.y = d, this.from(Ln, n, Fn, i);
 	}
-}, Mn = new e.Matrix4(), Nn = new e.Quaternion(), Pn = new e.Euler(), Fn = new e.Vector3(1, 1, 1), In = new e.Vector3(), Ln = new e.Box3();
+}, Nn = new e.Matrix4(), Pn = new e.Quaternion(), Fn = new e.Euler(), In = new e.Vector3(1, 1, 1), Ln = new e.Vector3(), Rn = new e.Box3();
 //#endregion
 //#region src/pointCloudProcessing/mergeMeaning.mjs
-function Rn(e, t, n = .005, r = .2) {
+function zn(e, t, n = .005, r = .2) {
 	if (!e.length || !t.length) return 0;
 	let i = Math.max(n * 3, .05), a = n * n, o = /* @__PURE__ */ new Map(), s = (e, t, n) => `${Math.floor(e / i)},${Math.floor(t / i)},${Math.floor(n / i)}`;
 	for (let e of t) {
@@ -3967,26 +3972,26 @@ function Rn(e, t, n = .005, r = .2) {
 	}
 	return c / e.length;
 }
-function zn(e, t, n = .5) {
+function Bn(e, t, n = .5) {
 	let r = 0, i = 0;
 	for (let a of e) if (t.containsPoint(a) && (r++, i = r / e.length, i > n)) break;
 	return i;
 }
-function Bn(e, t, n, r) {
+function Vn(e, t, n, r) {
 	if (e.intersectsOBB(t)) return !0;
 	{
-		let i = Hn(e, r), a = Hn(t, n);
+		let i = Un(e, r), a = Un(t, n);
 		if (i || a) return !0;
 	}
 	return !1;
 }
-function Vn(t, n) {
+function Hn(t, n) {
 	let r = new e.Vector3(), i = new e.Vector3();
 	t.getSize(r), n.getSize(i);
 	let a = r.x * r.y * r.z, o = i.x * i.y * i.z;
 	return a > o ? 1 : a < o ? -1 : 0;
 }
-function Hn(e, t) {
+function Un(e, t) {
 	let n = !0;
 	for (let r = 0; r < t.length; r++) if (!e.containsPoint(t[r])) {
 		n = !1;
@@ -3994,7 +3999,7 @@ function Hn(e, t) {
 	}
 	return n;
 }
-function Un(e) {
+function Wn(e) {
 	if (e.length === 0) return {
 		x: 0,
 		y: 0,
@@ -4012,25 +4017,25 @@ function Un(e) {
 		h: r - i
 	};
 }
-function Wn(t, n, r, i) {
+function Gn(t, n, r, i) {
 	let a = [];
 	for (let n = 0; n < t.length; n++) a.push(new e.Vector3(t[n][0], t[n][1], 0));
 	if (a.length == 0) return null;
-	let o = jn.fromByPath2D(a, n, r);
+	let o = Mn.fromByPath2D(a, n, r);
 	return o.center.z = i, o;
 }
-var Gn = (t) => {
+var Kn = (t) => {
 	if (t.length == 0) return [];
 	let n = [], r = /* @__PURE__ */ new Map();
 	for (let i = 0; i < t.length; i++) {
-		let a = t[i].points.map((e) => [e.x, e.y]), o = Un(t[i].points), s = t[i].obj_id;
-		s = s.replace(/calcony railing/g, "balcony railing").replace(/glass balcony railing/g, "balcony railing").replace(/metal balcony railing/g, "balcony railing").replace(/temporary construction guardrail/g, "balcony railing"), s.split("_").slice(1, 3).join("_").split(".")[0].split("_")[0];
-		let c = s.indexOf("_") + 1, l = s.lastIndexOf("_"), u = s.substring(c, l);
-		if (u === "wall") continue;
-		let d = [];
-		for (let n = 0; n < t[i].points.length; n++) d.push(new e.Vector3(t[i].points[n].x, t[i].points[n].y, t[i].points[n].z));
-		let f = -99999;
-		if (u === "floor") {
+		let a = t[i].points.map((e) => [e.x, e.y]), o = t[i].obj_id;
+		o = o.replace(/calcony railing/g, "balcony railing").replace(/glass balcony railing/g, "balcony railing").replace(/metal balcony railing/g, "balcony railing").replace(/temporary construction guardrail/g, "balcony railing").replace(/the floor of the house/g, "floor").replace(/the outdoor floor/g, "floor"), o.split("_").slice(1, 3).join("_").split(".")[0].split("_")[0];
+		let s = o.indexOf("_") + 1, c = o.lastIndexOf("_"), l = o.substring(s, c);
+		if (l === "wall") continue;
+		let u = [];
+		for (let n = 0; n < t[i].points.length; n++) u.push(new e.Vector3(t[i].points[n].x, t[i].points[n].y, t[i].points[n].z));
+		let d = -99999;
+		if (l === "floor") {
 			let n = /* @__PURE__ */ new Map();
 			for (let e = 0; e < t[i].points.length; e++) {
 				let r = t[i].points[e].z;
@@ -4043,40 +4048,40 @@ var Gn = (t) => {
 				});
 			}
 			let r = [...n.entries()].reduce((e, t) => t[1].num > e[1].num ? t : e);
-			a = [], a = r[1].points.map((e) => [e.x, e.y]), d = [], d = r[1].points.map((t) => new e.Vector3(t.x, t.y, t.z)), f = r[0];
+			a = [], a = r[1].points.map((e) => [e.x, e.y]), u = [], u = r[1].points.map((t) => new e.Vector3(t.x, t.y, t.z)), d = r[0];
 		}
-		let p = {
-			points: d,
-			path: ht(a),
-			h: o.h,
-			minz: o.minz,
-			maxz: o.maxz,
+		let f = Wn(u), p = {
+			points: u,
+			path: gt(a),
+			h: f.h,
+			minz: f.minz,
+			maxz: f.maxz,
 			center: {
-				x: o.x,
-				y: o.y,
-				z: o.z
+				x: f.x,
+				y: f.y,
+				z: f.z
 			},
 			obj_id: t[i].obj_id,
-			type: u,
+			type: l,
 			averagePz: t[i].averagePz,
 			obb: null,
 			isDel: !1,
-			obj_id: s,
+			obj_id: o,
 			positionArr: [t[i].position]
 		};
-		if (p.obb = Wn(p.path, p.center, p.h, (p.maxz + p.minz) / 2), p.obb == null) continue;
+		if (p.obb = Gn(p.path, p.center, p.h, (p.maxz + p.minz) / 2), p.obb == null) continue;
 		let m = -1;
-		for (let e = 0; e < n.length; e++) if (n[e].type == u) {
+		for (let e = 0; e < n.length; e++) if (n[e].type == l) {
 			m = e;
 			break;
 		}
 		if (m == -1 ? n.push({
-			type: u,
+			type: l,
 			array: [p]
-		}) : n[m].array.push(p), u == "floor" && f != -99999) if (r.has(f)) {
-			let e = r.get(f);
-			e.num += p.points.length, e.datas.push(p), r.set(f, e);
-		} else r.set(f, {
+		}) : n[m].array.push(p), l == "floor" && d != -99999) if (r.has(d)) {
+			let e = r.get(d);
+			e.num += p.points.length, e.datas.push(p), r.set(d, e);
+		} else r.set(d, {
 			num: p.points.length,
 			datas: [p]
 		});
@@ -4101,13 +4106,13 @@ var Gn = (t) => {
 				obb: t[e].obb.clone()
 			};
 			for (let i = e + 1; i < t.length; i++) if (!(t[i].obb == null || r.includes(i)) && n.obb.intersectsOBB(t[i].obb)) {
-				r.push(i), n.points.push(...t[i].points), n.path = ht(n.points.map((e) => [e.x, e.y]));
-				let a = Un(n.points);
+				r.push(i), n.points.push(...t[i].points), n.path = gt(n.points.map((e) => [e.x, e.y]));
+				let a = Wn(n.points);
 				n.h = a.h, n.minz = a.minz, n.maxz = a.maxz, n.center = {
 					x: a.x,
 					y: a.y,
 					z: a.z
-				}, n.obb = Wn(n.path, n.center, n.h, (n.maxz + n.minz) / 2), n.positionArr.push(...t[i].positionArr), i = e;
+				}, n.obb = Gn(n.path, n.center, n.h, (n.maxz + n.minz) / 2), n.positionArr.push(...t[i].positionArr), i = e;
 			}
 			n.path.length > t[e].path.length && (r.push(e), i.push(n));
 		}
@@ -4144,54 +4149,54 @@ var Gn = (t) => {
 					if (l[e].isDel) continue;
 					let n = l[e].obb, u = l[e].minz;
 					if (l[e].maxz, o.intersectsOBB(n)) {
-						zn(l[e].points, o);
-						let d = zn(i[a].points, n), f = Vn(o, n);
+						Bn(l[e].points, o);
+						let d = Bn(i[a].points, n), f = Hn(o, n);
 						if (d >= .3 && f == -1) {
 							i[a].isDel = !0;
 							break;
 						}
 						if (r !== "wall" && r !== "floor" && r !== "roof") {
 							if (r === "window") {
-								if (t === "balcony railing" && Hn(o, l[e].points)) {
+								if (t === "balcony railing" && Un(o, l[e].points)) {
 									l[e].isDel = !0;
 									continue;
 								}
-								if (t === "balcony railing" && Hn(n, i[a].points)) {
+								if (t === "balcony railing" && Un(n, i[a].points)) {
 									i[a].isDel = !0;
 									break;
 								}
-								if (t === "balcony railing" && Bn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(u - c) > .3)) {
+								if (t === "balcony railing" && Vn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(u - c) > .3)) {
 									l[e].isDel = !0;
 									continue;
 								}
 							} else if (r === "balcony railing") {
-								if (t === "window" && Hn(o, l[e].points)) {
+								if (t === "window" && Un(o, l[e].points)) {
 									l[e].isDel = !0;
 									continue;
 								}
-								if (t === "window" && Hn(n, i[a].points)) {
+								if (t === "window" && Un(n, i[a].points)) {
 									i[a].isDel = !0;
 									break;
 								}
-								if (t === "window" && Bn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(s - c) > .3)) {
+								if (t === "window" && Vn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(s - c) > .3)) {
 									i[a].isDel = !0;
 									break;
 								}
 							}
 							let d = !1, f = [], p = [], m = i[a].points, h = l[e].points;
-							if (m.length > h.length ? (d = !0, f = m, p = h) : (f = h, p = m), Rn(p, f, .03, .5) > .5) if (d) l[e].isDel = !0;
+							if (m.length > h.length ? (d = !0, f = m, p = h) : (f = h, p = m), zn(p, f, .03, .5) > .5) if (d) l[e].isDel = !0;
 							else {
 								i[a].isDel = !0;
 								break;
 							}
-							else if (Bn(o, n)) {
-								let s = Vn(o, n);
+							else if (Vn(o, n)) {
+								let s = Hn(o, n);
 								if (s === 1 || s === 0) {
 									if (t === "switch") continue;
-									zn(p, o) >= .5 && (l[e].isDel = !0);
+									Bn(p, o) >= .5 && (l[e].isDel = !0);
 								} else {
 									if (r === "switch") continue;
-									if (zn(p, n) >= .5) {
+									if (Bn(p, n) >= .5) {
 										i[a].isDel = !0;
 										break;
 									}
@@ -4220,7 +4225,7 @@ var Gn = (t) => {
 				let n = new e.Vector3();
 				i[t].obb.getSize(n), (n.x < .1 || n.y < .1) && (i[t].isDel = !0);
 			}
-			r === "balcony railing" && (Math.abs(n - a) < .4 && (i[t].isDel = !0), (a < s && Math.abs(a - s) > 1 || a > s && Math.abs(a - s) > 1) && (i[t].isDel = !0), n < s && (i[t].isDel = !0)), r === "people" && (Math.abs(n - a) < 1 && (i[t].isDel = !0), a > s && a - s > .3 && (i[t].isDel = !0), n < s && (i[t].isDel = !0));
+			r === "balcony railing" && (Math.abs(n - a) < .4 && (i[t].isDel = !0), (a < s && Math.abs(a - s) > 1 || a > s && Math.abs(a - s) > 1) && (i[t].isDel = !0), n < s && (i[t].isDel = !0)), r === "people" && (Math.abs(n - a) < 1 && (i[t].isDel = !0), a > s && a - s > .3 && (i[t].isDel = !0), n < s && (i[t].isDel = !0)), r === "floor" && i[t].points.length < 500 && (i[t].isDel = !0);
 		}
 	}
 	for (let e = 0; e < n.length; e++) n[e].array = n[e].array.filter((e) => !e.isDel);
@@ -4245,4 +4250,4 @@ var Gn = (t) => {
 	return i;
 };
 //#endregion
-export { z as classifySegments, he as getAllGeometry, De as getBeamLine, ke as getColLine, Oe as getMainBeamLine, Gn as getMergeMeaning, I as getParallelism, re as getPointCloudMinMax, te as getPointCoverageOnQuad, j as isParallel, L as perpendicularInfo, ae as removeNoisePoints, O as segmentsIntersect2D, ge as updateStEdPoint, Ee as usegetBeamLine };
+export { z as classifySegments, ge as getAllGeometry, Oe as getBeamLine, Ae as getColLine, ke as getMainBeamLine, Kn as getMergeMeaning, I as getParallelism, re as getPointCloudMinMax, te as getPointCoverageOnQuad, j as isParallel, L as perpendicularInfo, ae as removeNoisePoints, O as segmentsIntersect2D, _e as updateStEdPoint, De as usegetBeamLine };