rm-graphical-computing 1.0.37 → 1.0.39

package/dist/index.js

@@ -112,18 +112,23 @@ var E = class extends s {
 new d(), new o(), new o(), new d(), new d();
 //#endregion
 //#region src/utils/utils.mjs
-var D = (t, n, r, i, a = 1e-8) => {
+var D = (t, n, r) => {
+	let i = new e.LineBasicMaterial({ color: "#0011ff" }), a = [];
+	a.push(t), a.push(n);
+	let o = new e.BufferGeometry();
+	o.setFromPoints(a), o.rotateX(-Math.PI / 2), r.add(new e.Line(o, i));
+}, O = (t, n, r, i, a = 1e-8) => {
 	let o = n.x - t.x, s = n.y - t.y, c = i.x - r.x, l = i.y - r.y, u = o * l - s * c;
 	if (Math.abs(u) < a) return null;
 	let d = ((r.x - t.x) * l - (r.y - t.y) * c) / u, f = ((r.x - t.x) * s - (r.y - t.y) * o) / u;
 	return d < -a || d > 1 + a || f < -a || f > 1 + a ? null : { point: new e.Vector3(t.x + d * o, t.y + d * s, t.z) };
-}, O = (t, n, r = {}) => {
+}, k = (t, n, r = {}) => {
 	let { fontSize: i = 36, fontFamily: a = "sans-serif", backgroundColor: o = "rgba(0,0,0,0)", textColor: s = "#ffffff", padding: c = 10, maxWidth: l = 256 } = r, u = document.createElement("canvas").getContext("2d");
 	u.font = `bold ${i}px ${a}`;
 	let d = u.measureText(t).width, f = Math.min(d + c * 2, l), p = i + c * 2, m = document.createElement("canvas");
 	m.width = f, m.height = p;
 	let h = m.getContext("2d");
-	h.fillStyle = o, h.fillRect(0, 0, f, p), h.fillStyle = s, h.font = `bold ${i}px ${a}`, h.textAlign = "center", h.textBaseline = "middle", d > l - c * 2 ? k(h, t, f / 2, p / 2, l, i) : h.fillText(t, f / 2, p / 2);
+	h.fillStyle = o, h.fillRect(0, 0, f, p), h.fillStyle = s, h.font = `bold ${i}px ${a}`, h.textAlign = "center", h.textBaseline = "middle", d > l - c * 2 ? A(h, t, f / 2, p / 2, l, i) : h.fillText(t, f / 2, p / 2);
 	let g = new e.CanvasTexture(m), _ = new e.SpriteMaterial({
 		map: g,
 		depthTest: !1,
@@ -133,7 +138,7 @@ var D = (t, n, r, i, a = 1e-8) => {
 	let y = .005;
 	return v.scale.set(f * y, p * y, 1), v;
 };
-function k(e, t, n, r, i, a) {
+function A(e, t, n, r, i, a) {
 	let o = t.split(""), s = "", c = a * 1.2, l = r;
 	for (let t = 0; t < o.length; t++) {
 		let r = s + o[t];
@@ -141,7 +146,7 @@ function k(e, t, n, r, i, a) {
 	}
 	e.fillText(s, n, l);
 }
-var A = (e, t, n = .01) => {
+var j = (e, t, n = .01) => {
 	let r = Math.sqrt(e.x * e.x + e.y * e.y + e.z * e.z), i = Math.sqrt(t.x * t.x + t.y * t.y + t.z * t.z);
 	if (r < 1e-10 || i < 1e-10) return {
 		parallel: !1,
@@ -165,7 +170,7 @@ var A = (e, t, n = .01) => {
 		angle: c
 	};
 };
-function j(t, n, r) {
+function M(t, n, r) {
 	let i = new e.BufferGeometry(), a = [], o = [];
 	t.forEach((e) => a.push(e.x, e.y, e.z)), n.forEach((e) => a.push(e.x, e.y, e.z)), o.push(0, 2, 1, 0, 3, 2), o.push(4, 5, 6, 4, 6, 7), o.push(0, 1, 5, 0, 5, 4), o.push(1, 2, 6, 1, 6, 5), o.push(2, 3, 7, 2, 7, 6), o.push(3, 0, 4, 3, 4, 7), i.setAttribute("position", new e.Float32BufferAttribute(a, 3)), i.setIndex(o), i.computeVertexNormals();
 	let s = new e.MeshBasicMaterial({
@@ -176,7 +181,7 @@ function j(t, n, r) {
 	});
 	return new e.Mesh(i, s);
 }
-var M = class {
+var N = class {
 	constructor(t = {}) {
 		this.config = {
 			value: t.value || "0.0000m",
@@ -218,14 +223,14 @@ var M = class {
 	dispose() {
 		this.labelElement && this.labelElement.parentNode && this.labelElement.parentNode.removeChild(this.labelElement), this.label = null, this.labelElement = null;
 	}
-}, N = (t) => {
+}, P = (t) => {
 	let n = new e.Group(), r = new e.Group();
 	if (t && t.length) {
 		let i = /* @__PURE__ */ "green.red.pink.white.azure.yellow.bisque.grey.blanchedalmond.blue.blueviolet.brown.burlywood.cadetblue.chartreuse.chocolate.coral.cornflowerblue.cornsilk.crimson.cyan.darkblue.darkcyan.darkgoldenrod.darkgray.darkgreen.darkgrey.darkkhaki.darkmagenta.darkolivegreen.darkorange.darkorchid.darkred.darksalmon.darkseagreen.darkslateblue.darkslategray.darkslategrey.darkturquoise.darkviolet.deeppink.deepskyblue.dimgray.dimgrey.dodgerblue.firebrick.floralwhite.forestgreen.fuchsia.gainsboro.ghostwhite.gold.goldenrod.gray.aliceblue.greenyellow.black.honeydew.hotpink.indianred.indigo.ivory.khaki.lavender.lavenderblush.lawngreen.lemonchiffon.lightblue.lightcoral.lightcyan.lightgoldenrodyellow.lightgray.lightgreen.lightgrey.lightpink.lightsalmon.lightseagreen.lightskyblue.lightslategray.lightslategrey.lightsteelblue.lightyellow.lime.limegreen.linen.magenta.maroon.mediumaquamarine.mediumblue.mediumorchid.mediumpurple.mediumseagreen.mediumslateblue.mediumspringgreen.mediumturquoise.mediumvioletred.midnightblue.mintcream.mistyrose.moccasin.navajowhite.navy.oldlace.olive.olivedrab.orange.orangered.orchid.palegoldenrod.palegreen.paleturquoise.palevioletred.papayawhip.peachpuff.peru.pink.plum.powderblue.purple.rebeccapurple.yellow.rosybrown.royalblue.saddlebrown.salmon.sandybrown.seagreen.seashell.sienna.silver.skyblue.slateblue.slategray.slategrey.snow.springgreen.steelblue.tan.teal.thistle.tomato.turquoise.violet.wheat.white.whitesmoke.yellow.yellowgreen".split(".");
 		t.forEach((t, a) => {
 			let o = i[a], s = new e.Group(), { pcdPoints: c, category: l, name: u, center: d, box: f, obbBox: p, contour: m, nline: h, coordinatesByWidth: g, coordinatesByArea: _ } = t, v = c.length, y = new e.Box3(new e.Vector3(f.min.x, f.min.y, f.min.z), new e.Vector3(f.max.x, f.max.y, f.max.z)), b = new e.Box3Helper(y, o);
 			s.add(b);
-			let x = new M({
+			let x = new N({
 				value: u,
 				position: new e.Vector3(d.x, d.y, d.z)
 			}).getLabel();
@@ -274,15 +279,15 @@ var M = class {
 					depthWrite: !1
 				}), s = new e.Line(a, o);
 				l == "door" ? n.add(s) : r.add(s);
-				let c = j(i.map((t) => new e.Vector3(t.x, t.y, _.heightData.minZ)), i.map((t) => new e.Vector3(t.x, t.y, t.z)), l);
+				let c = M(i.map((t) => new e.Vector3(t.x, t.y, _.heightData.minZ)), i.map((t) => new e.Vector3(t.x, t.y, t.z)), l);
 				l == "door" ? n.add(c) : r.add(c);
 				let [u, d, f] = t, p = u.distanceTo(d), m = new e.Vector3().copy(u).add(d).multiplyScalar(.5);
-				new M({
+				new N({
 					value: String(p.toFixed(3)),
 					position: m
 				}).getLabel();
 				let h = d.distanceTo(f), g = new e.Vector3().copy(d).add(f).multiplyScalar(.5);
-				new M({
+				new N({
 					value: String(h.toFixed(3)),
 					position: g
 				}).getLabel();
@@ -300,7 +305,7 @@ var M = class {
 		AiProjectionGroup: n,
 		AiProjectionGroup2: r
 	};
-}, P = (t, n, r, i) => {
+}, F = (t, n, r, i) => {
 	let a = t, o = [];
 	if (i && i.length && (o = i.map((e) => e.clone())), !a || a.length < 4) return {};
 	let s = new e.Vector3().subVectors(a[1], a[0]).normalize(), c = new e.Vector3().subVectors(a[3], a[0]).normalize(), l = s.clone().cross(c).normalize(), u = Infinity, d = -Infinity, f = Infinity, p = -Infinity;
@@ -313,7 +318,7 @@ var M = class {
 		g,
 		_,
 		v
-	], b = A(new e.Vector3().subVectors(h, g), new e.Vector3(0, 0, 1));
+	], b = j(new e.Vector3().subVectors(h, g), new e.Vector3(0, 0, 1));
 	b && b.parallel && (y = [
 		h,
 		v,
@@ -371,7 +376,7 @@ var M = class {
 		boxArea: S,
 		totalInPlaneNum: x
 	};
-}, F = (t, n, r, i, a = e.MathUtils.degToRad(8)) => {
+}, I = (t, n, r, i, a = e.MathUtils.degToRad(8)) => {
 	let o = new e.Vector3(), s = new e.Vector3();
 	o.subVectors(new e.Vector3(n.x, n.y, 0), new e.Vector3(t.x, t.y, 0)).normalize(), s.subVectors(new e.Vector3(i.x, i.y, 0), new e.Vector3(r.x, r.y, 0)).normalize();
 	let c = o.dot(s), l = Math.acos(Math.min(Math.abs(c), 1)), u = 1 - Math.min(l / a, 1), d = c > 0 ? "same" : "opposite";
@@ -386,7 +391,7 @@ var M = class {
 			v2: s
 		}
 	};
-}, I = (t, n, r, i) => {
+}, L = (t, n, r, i) => {
 	let a = new e.Vector3().subVectors(n, t), o = new e.Vector3().subVectors(i, r), s = a.length(), c = o.length();
 	if (s === 0 || c === 0) return {
 		rate: NaN,
@@ -403,7 +408,7 @@ var M = class {
 		isPerpendicular: Math.abs(f - 90) < .01,
 		isParallel: f < .01
 	};
-}, L = (t, n, r = !1) => new e.Vector3((t.x + n.x) / 2, (t.y + n.y) / 2, r ? 0 : (t.z + n.z) / 2), R = (t, n, r, i, a = {}) => {
+}, R = (t, n, r = !1) => new e.Vector3((t.x + n.x) / 2, (t.y + n.y) / 2, r ? 0 : (t.z + n.z) / 2), z = (t, n, r, i, a = {}) => {
 	let { parallelAngleMax: o = e.MathUtils.degToRad(10), collinearAngleMax: s = e.MathUtils.degToRad(7), distanceThreshold: c = 2, overlapThreshold: l = .01 } = a, u = new e.Vector3().subVectors(n, t), d = new e.Vector3().subVectors(i, r), f = u.clone().normalize(), p = d.clone().normalize(), m = e.MathUtils.clamp(f.dot(p), -1, 1), h = Math.acos(Math.abs(m)), g = e.MathUtils.radToDeg(h);
 	if (h > o) return {
 		type: "not_parallel",
@@ -415,9 +420,9 @@ var M = class {
 		closestDistance: null
 	};
 	m < 0 && p.negate();
-	let _ = new e.Vector3().addVectors(f, p).normalize(), v = new e.Vector3().addVectors(t, n).multiplyScalar(.5), y = ee(r, v, f), b = ee(i, v, f), x = (y + b) / 2, S = Math.max(y, b), C = t.dot(_), w = n.dot(_), T = r.dot(_), E = i.dot(_), D = Math.min(C, w), O = Math.max(C, w), k = Math.min(T, E), A = Math.max(T, E), j = O - D, M = A - k, N = Math.min(j, M), P = Math.min(O, A) - Math.max(D, k), F = P < 0 ? -P : 0, I = P > 0 ? P : 0, L = N > 0 ? I / N : 0, R = te(t, n, r, i), z = h <= s && x < c, ne;
-	return z ? ne = L > .5 ? "collinear_overlap" : "collinear_gap" : h <= o && (ne = "parallel_offset"), {
-		type: ne,
+	let _ = new e.Vector3().addVectors(f, p).normalize(), v = new e.Vector3().addVectors(t, n).multiplyScalar(.5), y = B(r, v, f), b = B(i, v, f), x = (y + b) / 2, S = Math.max(y, b), C = t.dot(_), w = n.dot(_), T = r.dot(_), E = i.dot(_), D = Math.min(C, w), O = Math.max(C, w), k = Math.min(T, E), A = Math.max(T, E), j = O - D, M = A - k, N = Math.min(j, M), P = Math.min(O, A) - Math.max(D, k), F = P < 0 ? -P : 0, I = P > 0 ? P : 0, L = N > 0 ? I / N : 0, R = ee(t, n, r, i), z = h <= s && x < c, te;
+	return z ? te = L > .5 ? "collinear_overlap" : "collinear_gap" : h <= o && (te = "parallel_offset"), {
+		type: te,
 		angleDeg: g,
 		avgPerpendicularDistance: x,
 		maxPerpendicularDistance: S,
@@ -426,17 +431,17 @@ var M = class {
 		closestDistance: R
 	};
 };
-function ee(t, n, r) {
+function B(t, n, r) {
 	let i = new e.Vector3().subVectors(t, n), a = i.dot(r), o = r.clone().multiplyScalar(a);
 	return new e.Vector3().subVectors(i, o).length();
 }
-function te(t, n, r, i) {
+function ee(t, n, r, i) {
 	let a = new e.Vector3().subVectors(n, t), o = new e.Vector3().subVectors(i, r), s = new e.Vector3().subVectors(r, t), c = a.dot(a), l = a.dot(o), u = o.dot(o), d = a.dot(s), f = o.dot(s), p = c * u - l * l, m, h;
 	p < 1e-10 ? (m = 0, h = u === 0 ? 0 : f / u) : (m = (l * f - u * d) / p, h = (c * f - l * d) / p), m = e.MathUtils.clamp(m, 0, 1), h = u === 0 ? 0 : e.MathUtils.clamp((l * m + f) / u, 0, 1), m = c === 0 ? 0 : e.MathUtils.clamp((l * h - d) / c, 0, 1);
 	let g = t.clone().add(a.clone().multiplyScalar(m)), _ = r.clone().add(o.clone().multiplyScalar(h));
 	return g.distanceTo(_);
 }
-var z = (t, n, r, i = .05, a = .02) => {
+var te = (t, n, r, i = .05, a = .02) => {
 	let [o, s, c, l] = t, u = new e.Vector3().subVectors(s, o), d = new e.Vector3().subVectors(l, o), f = new e.Vector3().crossVectors(u, d).normalize(), p = u.length(), m = d.length(), h = u.clone().normalize(), g = d.clone().normalize(), _ = r - i, v = r + i, y = new e.Vector3(), b = [], x = Math.ceil(p / a), S = Math.ceil(m / a), C = p / x, w = m / S, T = new Uint8Array(x * S);
 	for (let t = 0; t < n.length; t++) {
 		y.subVectors(n[t], o);
@@ -545,7 +550,7 @@ var z = (t, n, r, i = .05, a = .02) => {
 		if (i.checkResults[0].originalVertices && i.checkResults[0].originalVertices.length > 0) {
 			let [t, n, r, s] = i.checkResults[0].originalVertices[0];
 			t = new e.Vector3(t.x, t.y, t.z), n = new e.Vector3(n.x, n.y, n.z), r = new e.Vector3(r.x, r.y, r.z), s = new e.Vector3(s.x, s.y, s.z), a = t.distanceTo(n), o = t.distanceTo(s);
-			let c = A(new e.Vector3().subVectors(t, n).normalize(), new e.Vector3(0, 0, 1));
+			let c = j(new e.Vector3().subVectors(t, n).normalize(), new e.Vector3(0, 0, 1));
 			c && c.parallel && ([o, a] = [a, o]);
 		}
 		if (a < 0 || o < 0) continue;
@@ -558,7 +563,7 @@ var z = (t, n, r, i = .05, a = .02) => {
 		let { newOriginalPoints: x } = ie(p, m, i.originalPoints);
 		i.originalPoints = x;
 	}
-}, B = (t, n) => new e.Vector3(t.x, t.y, 0).distanceTo(new e.Vector3(n.x, n.y, 0)), oe = (t, n, r = 1e-6) => {
+}, V = (t, n) => new e.Vector3(t.x, t.y, 0).distanceTo(new e.Vector3(n.x, n.y, 0)), oe = (t, n, r = 1e-6) => {
 	let i = new e.Vector3();
 	return t.closestPointToPoint(n, !0, i), i.distanceTo(n) < r;
 }, se = (e) => {
@@ -568,7 +573,7 @@ var z = (t, n, r, i = .05, a = .02) => {
 		a > t && (t = a, n = [e[r], e[i]]);
 	}
 	return n;
-}, V = (e, t, n = .03) => Math.abs(e.x - t.x) < n && Math.abs(e.y - t.y) < n && Math.abs(e.z - t.z) < n, ce = (e) => {
+}, H = (e, t, n = .03) => Math.abs(e.x - t.x) < n && Math.abs(e.y - t.y) < n && Math.abs(e.z - t.z) < n, ce = (e) => {
 	let t = [];
 	e.children.forEach((e) => {
 		e.type == "GridHelper" || e.type == "DirectionalLight" || e.type == "AmbientLight" || t.push(e);
@@ -1048,7 +1053,7 @@ var fe = class {
 		let s = new e.Vector3(o.start.x, o.start.y, o.start.z);
 		s.applyEuler(new e.Euler(-Math.PI / 2, 0, 0));
 		let l = new e.Vector3(o.end.x, o.end.y, o.end.z);
-		if (l.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), n.add(O(String(a), new e.Vector3((s.x + l.x) / 2, (s.y + l.y) / 2, (s.z + l.z) / 2))), (o.isBayWindow || o.isWindow) && r) continue;
+		if (l.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), n.add(k(String(a), new e.Vector3((s.x + l.x) / 2, (s.y + l.y) / 2, (s.z + l.z) / 2))), (o.isBayWindow || o.isWindow) && r) continue;
 		let u = new c().setFromCoplanarPoints(new d(o.start.x, o.start.y, o.start.z), new d(o.end.x, o.end.y, o.end.z), new d(o.start.x, o.start.y, o.rooftopPz)), f = [];
 		o.originalPoints.forEach((e, t) => {
 			let n = new d();
@@ -1076,7 +1081,162 @@ var fe = class {
 		o.checkResults = C, o.verticalDirection = w, o.originaIndex = a, i.push(o);
 	}
 	return i;
-}, ge = async (t, n, r, i) => {
+}, ge = (t, n) => {
+	console.log("lines", t);
+	for (let r = 0; r < t.length; r++) {
+		let i = t[r], a = [];
+		i.originalPoints.forEach((t) => {
+			let n = new e.Vector3(t.x, t.y, 0), r = !1;
+			for (let e = 0; e < a.length; e++) if (H(n, a[e], .01)) {
+				r = !0;
+				break;
+			}
+			r || a.push(n);
+		});
+		let o = Math.round(Math.max(5, Math.min(350, 20 * Math.sqrt(i.length)))), s = new e.Vector3(i.start.x, i.start.y, i.start.z), c = new e.Vector3(i.end.x, i.end.y, i.end.z), l = new e.Vector3().subVectors(c, s).normalize(), u = l.clone().cross(new e.Vector3(0, 0, 1)).normalize(), d = u.clone().negate(), f = [], p = [], m = i.length / o;
+		console.log(m);
+		for (let e = 0; e < o; e++) {
+			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);
+		}
+		let h = new Float32Array(a.length * 3);
+		a.forEach((e, t) => {
+			h[t * 3] = e.x, h[t * 3 + 1] = e.y, h[t * 3 + 2] = e.z;
+		});
+		let g = new e.BufferGeometry();
+		g.setAttribute("position", new e.BufferAttribute(h, 3)), g.rotateX(-Math.PI / 2), n.add(new e.Points(g, new e.PointsMaterial({
+			color: le(),
+			size: .02
+		})));
+		let [_, v] = Te(p, {
+			plane: "xy",
+			trimRatio: 0
+		});
+		D(_, v, n);
+	}
+};
+function _e(e, t = "xy") {
+	if (t === "xy") return {
+		x: e.x,
+		y: e.y
+	};
+	if (t === "xz") return {
+		x: e.x,
+		y: e.z
+	};
+	if (t === "yz") return {
+		x: e.y,
+		y: e.z
+	};
+	throw Error(`Unsupported plane: ${t}`);
+}
+function ve(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") {
+	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;
+	for (let e = 0; e < 4; e++) {
+		let t = i[e], n = i[(e + 1) % 4], s = ve(t, n, r);
+		if (s > 1e-9 && (a = !0), s < -1e-9 && (o = !0), a && o) return !1;
+	}
+	return !0;
+}
+function be(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) {
+	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);
+	if (t === "xy") return {
+		x: n.x,
+		y: n.y,
+		up: n.z
+	};
+	if (t === "xz") return {
+		x: n.x,
+		y: n.z,
+		up: n.y
+	};
+	if (t === "yz") return {
+		x: n.y,
+		y: n.z,
+		up: n.x
+	};
+	throw Error(`Unsupported plane: ${t}`);
+}
+function Ce(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) {
+	let r = 1e-12;
+	if (Math.abs(t) < r) return e >= n ? {
+		x: 1,
+		y: 0
+	} : {
+		x: 0,
+		y: 1
+	};
+	let i = e + n, a = e * n - t * t, o = Math.sqrt(Math.max(0, i * i * .25 - a)), s = i * .5 + o, c = t, l = s - e, u = Math.hypot(c, l);
+	return u < r ? {
+		x: 1,
+		y: 0
+	} : {
+		x: c / u,
+		y: l / u
+	};
+}
+function Te(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;
+	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;
+	for (let e of i) {
+		let t = e.x - a, n = e.y - o;
+		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 = {
+		x: -d.y,
+		y: d.x
+	}, p = [];
+	for (let e of i) {
+		let t = e.x - a, n = e.y - o, r = t * d.x + n * d.y, i = t * f.x + n * f.y;
+		p.push({
+			s: r,
+			t: i,
+			up: e.up
+		});
+	}
+	p.sort((e, t) => e.s - t.s);
+	let m = p.length, h = Math.floor(m * r), g = Math.ceil(m * (1 - r)) - 1;
+	h = Math.max(0, Math.min(m - 1, h)), g = Math.max(0, Math.min(m - 1, g));
+	let _ = p[h], v = p[g], y = (() => {
+		let e = p.map((e) => e.t).sort((e, t) => e - t), t = Math.floor(e.length / 2);
+		return e.length % 2 == 0 ? (e[t - 1] + e[t]) * .5 : e[t];
+	})(), b = (() => {
+		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)];
+}
+//#endregion
+//#region src/geometry/beamLine.mjs
+var Ee = async (t, n, r, i) => {
 	ce(i);
 	let a = await fetch(t);
 	if (!a) return;
@@ -1087,7 +1247,7 @@ var fe = class {
 		let r = new e.Vector3(n.start.x, n.start.y, n.start.z);
 		r.applyEuler(new e.Euler(-Math.PI / 2, 0, 0));
 		let i = new e.Vector3(n.end.x, n.end.y, n.end.z);
-		i.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), m.add(O(String(t), new e.Vector3((r.x + i.x) / 2, (r.y + i.y) / 2, (r.z + i.z) / 2)));
+		i.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), m.add(k(String(t), new e.Vector3((r.x + i.x) / 2, (r.y + i.y) / 2, (r.z + i.z) / 2)));
 	}
 	o.sort((e, t) => e.originalIndex - t.originalIndex), console.log("lins", o);
 	let h = await fetch(n);
@@ -1099,11 +1259,11 @@ var fe = class {
 		let n = y[t];
 		if (n.isFindBeam = !1, n.category == "door") {
 			let t = new e.Vector3(n.center.x, n.center.y, n.center.z);
-			t.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), m.add(O(`door:${b}`, t)), b++;
+			t.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), m.add(k(`door:${b}`, t)), b++;
 		}
 	}
 	i.add(m), console.time();
-	let { beamGroup: x } = await _e(o, _, y, i);
+	let { beamGroup: x } = await De(o, _, y, i);
 	console.timeEnd(), console.log("beamGroup", x);
 	let S = new e.MeshBasicMaterial({
 		color: "#cffd00",
@@ -1125,7 +1285,7 @@ var fe = class {
 		transparent: !0,
 		opacity: .4,
 		side: e.DoubleSide
-	}), D = new e.LineBasicMaterial({ color: "#cffd00" }), k = [];
+	}), D = new e.LineBasicMaterial({ color: "#cffd00" }), O = [];
 	for (let t = 0; t < o.length; t++) {
 		let n = o[t];
 		if (n.checkResults) for (let t of n.checkResults) for (let n of t.originalVertices) {
@@ -1152,12 +1312,12 @@ var fe = class {
 				3
 			]), o.computeVertexNormals();
 			let c = new e.EdgesGeometry(o, 1);
-			k.push(c);
+			O.push(c);
 		}
 	}
-	if (k.length > 0) {
-		let t = w(k, !1);
-		t.rotateX(-Math.PI / 2), s.add(new e.LineSegments(t, D)), s.visible = !1, i.add(s), k.forEach((e) => e.dispose());
+	if (O.length > 0) {
+		let t = w(O, !1);
+		t.rotateX(-Math.PI / 2), s.add(new e.LineSegments(t, D)), s.visible = !1, i.add(s), O.forEach((e) => e.dispose());
 	}
 	new e.PointsMaterial({
 		color: 65535,
@@ -1180,7 +1340,7 @@ var fe = class {
 		a.setFromPoints(i), a.rotateX(-Math.PI / 2), f.add(new e.Line(a, D));
 	}
 	f.visible = !1, i.add(c), i.add(f);
-	let A = [], j = [], M = new e.LineBasicMaterial({ color: "#f30606" }), P = new e.MeshBasicMaterial({ color: "#071ac4" });
+	let A = [], j = [], M = new e.LineBasicMaterial({ color: "#f30606" }), N = new e.MeshBasicMaterial({ color: "#071ac4" });
 	for (let t = 0; t < _.length; t++) {
 		let n = new e.SphereGeometry(.05);
 		n.translate(_[t].x, _[t].y, _[t].z);
@@ -1191,14 +1351,14 @@ var fe = class {
 	}
 	if (A.length > 0) {
 		let t = w(A, !1);
-		t.rotateX(-Math.PI / 2), l.add(new e.Mesh(t, P)), A.forEach((e) => e.dispose());
+		t.rotateX(-Math.PI / 2), l.add(new e.Mesh(t, N)), A.forEach((e) => e.dispose());
 	}
 	if (j.length > 0) {
 		let t = w(j, !1);
 		t.rotateX(-Math.PI / 2), l.add(new e.Line(t, M)), j.forEach((e) => e.dispose());
 	}
 	i.add(l);
-	let { AiProjectionGroup: F, AiProjectionGroup2: I } = N(y);
+	let { AiProjectionGroup: F, AiProjectionGroup2: I } = P(y);
 	return u.add(F), u.rotateX(-Math.PI / 2), i.add(u), d.add(I), d.visible = !1, d.rotateX(-Math.PI / 2), i.add(d), console.log("jsonpcdData", y), o.forEach((t) => {
 		t.doorAndBeamData && t.doorAndBeamData.length > 0 && (t.doorAndBeamData.forEach((t) => {
 			if (t.beamStart) {
@@ -1248,7 +1408,7 @@ var fe = class {
 				3
 			]), n.computeVertexNormals(), n.rotateX(-Math.PI / 2), t.isDoor ? p.add(new e.Mesh(n, E)) : t.type == "beam" ? p.add(new e.Mesh(n, T)) : p.add(new e.Mesh(n, C));
 			let i = `id:${t.id},Nid:${t.nearId}`, a = new e.Vector3((t.doorStart.x + t.doorEnd.x) / 2, (t.doorStart.y + t.doorEnd.y) / 2, t.doorStart.z + t.doorHeight);
-			a.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), p.add(O(i, a));
+			a.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), p.add(k(i, a));
 		}), i.add(p));
 	}), {
 		checkResultGroup: s,
@@ -1260,7 +1420,7 @@ var fe = class {
 		beamDoorGroup: p,
 		lineIndexGroup: m
 	};
-}, _e = async (t, n, r, i) => {
+}, De = async (t, n, r, i) => {
 	if (ae(t, i), t.length <= 0 || n.length <= 0) return t;
 	r ||= [];
 	for (let n of t) {
@@ -1304,7 +1464,7 @@ var fe = class {
 					if (i.points.push(...a[t]), i.area += o.distanceTo(s) * o.distanceTo(p), i.originalVertices.push(a[t]), i.index = r, i.centerPts.push(m), u == -1 || d == -1) {
 						let t = new e.Vector3().subVectors(o, s).normalize();
 						d = o.distanceTo(p), u = o.distanceTo(s);
-						let n = A(t, new e.Vector3(0, 0, 1));
+						let n = j(t, new e.Vector3(0, 0, 1));
 						n && n.parallel && ([d, u] = [u, d]);
 					}
 					i.gridWidth = u, i.gridHeight = d;
@@ -1326,9 +1486,9 @@ var fe = class {
 			totalHeight: t
 		});
 	}
-	let o = [...a.entries()].reduce((e, t) => t[1].num > e[1].num ? t : e), s = o[0];
-	o[1].totalHeight / o[1].num;
-	let c = [];
+	let o = [...a.entries()].reduce((e, t) => t[1].num > e[1].num ? t : e);
+	o[0], o[1].totalHeight / o[1].num;
+	let s = [];
 	for (let t = 0; t < r.length; t++) {
 		let n = r[t];
 		if (n.isFindBeam = !1, n.category == "door") {
@@ -1343,10 +1503,10 @@ var fe = class {
 				r[2],
 				r[1]
 			]);
-			let o = L(r[0], r[3], !0), s = L(r[1], r[2], !0);
-			c.push({
+			let o = R(r[0], r[3], !0), c = R(r[1], r[2], !0);
+			s.push({
 				doorStartPt: o,
-				doorEndPt: s,
+				doorEndPt: c,
 				boxPoints: r,
 				minZ: n.coordinatesByArea.heightData.minZ,
 				maxZ: n.coordinatesByArea.heightData.maxZ,
@@ -1356,12 +1516,12 @@ var fe = class {
 			});
 		}
 	}
-	for (let n = 0; n < c.length; n++) {
-		let r = c[n];
+	for (let n = 0; n < s.length; n++) {
+		let r = s[n];
 		for (let n = 0; n < t.length; n++) {
 			if (t[n].length < .5) continue;
-			let i = [], a = L(t[n].start, t[n].end, !0);
-			i.push(a), i.push(L(a, t[n].start, !0)), i.push(L(a, t[n].end, !0));
+			let i = [], a = R(t[n].start, t[n].end, !0);
+			i.push(a), i.push(R(a, t[n].start, !0)), i.push(R(a, t[n].end, !0));
 			let o = !1, s = r.boxPoints.length;
 			for (let e = 0; e < i.length; e++) {
 				let t = i[e].x, n = i[e].y;
@@ -1372,12 +1532,12 @@ var fe = class {
 				if (o) break;
 			}
 			if (o) {
-				let i = new e.Vector3(t[n].start.x, t[n].start.y, 0), a = new e.Vector3(t[n].end.x, t[n].end.y, 0), o = r.doorStartPt.distanceTo(r.doorEndPt), s = i.distanceTo(a), c = F(r.doorStartPt, r.doorEndPt, i, a);
+				let i = new e.Vector3(t[n].start.x, t[n].start.y, 0), a = new e.Vector3(t[n].end.x, t[n].end.y, 0), o = r.doorStartPt.distanceTo(r.doorEndPt), s = i.distanceTo(a), c = I(r.doorStartPt, r.doorEndPt, i, a);
 				if (Math.abs(s - o) < .5 && c && c.angleDeg < 15) {
 					r.doorStartPt = new e.Vector3(t[n].start.x, t[n].start.y, 0), r.doorEndPt = new e.Vector3(t[n].end.x, t[n].end.y, 0);
 					break;
 				} else if (Math.abs(s - o) > 1.3 && c && c.angleDeg < 15) {
-					let t = R(r.doorStartPt, r.doorEndPt, i, a, { parallelAngleMax: e.MathUtils.degToRad(15) }), n = r.doorStartPt.distanceTo(i), o = r.doorStartPt.distanceTo(a), s = r.doorEndPt.distanceTo(i), c = r.doorEndPt.distanceTo(a), l = n < .2 || o < .2 || s < .2 || c < .2;
+					let t = z(r.doorStartPt, r.doorEndPt, i, a, { parallelAngleMax: e.MathUtils.degToRad(15) }), n = r.doorStartPt.distanceTo(i), o = r.doorStartPt.distanceTo(a), s = r.doorEndPt.distanceTo(i), c = r.doorEndPt.distanceTo(a), l = n < .2 || o < .2 || s < .2 || c < .2;
 					if (t && t.type == "collinear_overlap" && t.maxPerpendicularDistance < .1 && !l) {
 						r.inWall = !0;
 						break;
@@ -1392,228 +1552,192 @@ var fe = class {
 			} else continue;
 		}
 	}
-	let l = 0, u = [], d = [], f = [], p = [], m = .2;
+	let c = 0, l = [], u = [], d = [], f = [], p = .2;
 	for (let i = 0; i < t.length; i++) {
 		let a = t[i];
 		if (!a.mergeCheckRegion || a.mergeCheckRegion.length == 0) continue;
 		a.doorAndBeamData = [], a.completePointAreaPercentage = -1;
 		let o = new e.Box3();
 		o.setFromPoints(a.originalPoints);
-		let h = o.max.z, g = o.min.z, _ = new e.Vector3(a.start.x, a.start.y, a.start.z), v = new e.Vector3(a.end.x, a.end.y, a.end.z), y = a.rooftopPz - a.start.z;
-		if (y < s - .5 || y > s + 2) continue;
-		let b = 0;
+		let m = o.max.z;
+		o.min.z;
+		let h = new e.Vector3(a.start.x, a.start.y, a.start.z), g = new e.Vector3(a.end.x, a.end.y, a.end.z), _ = a.rooftopPz - a.start.z, v = 0;
 		for (let o of a.mergeCheckRegion) {
-			let { facePoints: s, boxArea: x, totalInPlaneNum: S } = P(o.points, o.gridWidth, o.gridHeight, o.centerPts);
-			if (!s || s.length <= 0) continue;
-			s[0].distanceTo(s[1]);
-			let C = s[0].distanceTo(s[3]), w = o.gridHeight * (C / o.gridHeight / 3 * 2) + o.gridHeight / 2, T = new e.Vector3(s[0].x, s[0].y, s[0].z + w), E = new e.Vector3(s[1].x, s[1].y, s[1].z + w), O = new e.Line3(T, E), k = [], j = new e.Vector3();
+			let { facePoints: y, boxArea: b, totalInPlaneNum: x } = F(o.points, o.gridWidth, o.gridHeight, o.centerPts);
+			if (!y || y.length <= 0) continue;
+			y[0].distanceTo(y[1]);
+			let S = y[0].distanceTo(y[3]), C = o.gridHeight * (S / o.gridHeight / 3 * 2) + o.gridHeight / 2, w = new e.Vector3(y[0].x, y[0].y, y[0].z + C), T = new e.Vector3(y[1].x, y[1].y, y[1].z + C), E = new e.Line3(w, T), D = [], k = new e.Vector3();
 			o.points.forEach((e) => {
-				O.closestPointToPoint(e, !0, j).distanceTo(e) < o.gridHeight + .01 && k.push(e);
+				E.closestPointToPoint(e, !0, k).distanceTo(e) < o.gridHeight + .01 && D.push(e);
 			});
-			let M = [], N = [];
+			let A = [], M = [];
 			for (;;) {
 				let e = [];
-				for (let t = 0; t < k.length; t++) N.includes(t) || e.length == 0 && (e.push(k[t]), N.push(t));
-				for (let t = 0; t < k.length; t++) if (!N.includes(t)) {
-					for (let n = 0; n < e.length; n++) if (k[t].distanceTo(e[n]) < o.gridWidth + .01) {
-						e.push(k[t]), N.push(t), t = -1;
+				for (let t = 0; t < D.length; t++) M.includes(t) || e.length == 0 && (e.push(D[t]), M.push(t));
+				for (let t = 0; t < D.length; t++) if (!M.includes(t)) {
+					for (let n = 0; n < e.length; n++) if (D[t].distanceTo(e[n]) < o.gridWidth + .01) {
+						e.push(D[t]), M.push(t), t = -1;
 						break;
 					}
 				}
 				if (e.length == 0) break;
-				M.push(e);
+				A.push(e);
 			}
-			let ee = [];
-			for (let t = 0; t < M.length; t++) {
+			let N = [];
+			for (let t = 0; t < A.length; t++) {
 				let n = {
 					lineSt: new e.Vector3(),
 					lineEd: new e.Vector3(),
 					facePoints: []
-				}, r = se(M[t]);
-				Array.isArray(r) && r.length == 2 && (n.lineSt = r[0], n.lineEd = r[1], n.facePoints.push(new e.Vector3(r[0].x, r[0].y, s[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, s[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, s[2].z)), n.facePoints.push(new e.Vector3(r[0].x, r[0].y, s[2].z)), ee.push(n));
+				}, r = se(A[t]);
+				Array.isArray(r) && r.length == 2 && (n.lineSt = r[0], n.lineEd = r[1], n.facePoints.push(new e.Vector3(r[0].x, r[0].y, y[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, y[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, y[2].z)), n.facePoints.push(new e.Vector3(r[0].x, r[0].y, y[2].z)), N.push(n));
 			}
-			b += o.area;
-			let te = 0;
-			if (S != 0 && (te = o.gridHeight * o.gridWidth * S), (o.area - te) / x * 100 > 70 && ee.length == 1 || ee.length > 1) for (let s = 0; s < ee.length; s++) {
-				let b = ee[s], x = b.facePoints[0].distanceTo(b.facePoints[1]), S = b.facePoints[0].distanceTo(b.facePoints[3]), C = x / a.length * 100, w = a.rooftopPz - b.facePoints[2].z;
-				if (S < 1.5 || h < b.facePoints[2].z || w > y / 3 * 2) continue;
-				let T = !1, E = !1, O = !1, k = [], j = b.facePoints[2].clone(), M = b.facePoints[3].clone(), N = b.facePoints[0].clone(), P = b.facePoints[1].clone(), te = !1, z = -1;
-				if (Math.abs(b.facePoints[0].z - a.start.z) < .25) {
-					if (x > .17 && a.length > .5) {
-						let n = B(_, N), r = B(_, P), o = B(v, N), s = B(v, P), c = .1;
+			v += o.area;
+			let P = 0;
+			if (x != 0 && (P = o.gridHeight * o.gridWidth * x), (o.area - P) / b * 100 > 70 && N.length == 1 || N.length > 1) for (let v = 0; v < N.length; v++) {
+				let y = N[v], b = y.facePoints[0].distanceTo(y.facePoints[1]), x = y.facePoints[0].distanceTo(y.facePoints[3]), S = b / a.length * 100, C = a.rooftopPz - y.facePoints[2].z;
+				if (x < 1.5 || m < y.facePoints[2].z || C > _ / 3 * 2) continue;
+				let w = !1, T = !1, E = !1, D = [], k = y.facePoints[2].clone(), A = y.facePoints[3].clone(), M = y.facePoints[0].clone(), P = y.facePoints[1].clone(), F = !1, B = -1;
+				if (Math.abs(y.facePoints[0].z - a.start.z) < .25) {
+					if (b > .17 && a.length > .5) {
+						let n = V(h, M), r = V(h, P), o = V(g, M), s = V(g, P), c = .1;
 						if (n < c || r < c) {
-							let { newOriginalPoints: r } = ie(N, P, a.originalPoints), o = [], s = [];
+							let { newOriginalPoints: r } = ie(M, P, a.originalPoints), o = [], s = [];
 							if (r.forEach((e) => {
-								e.z >= j.z ? o.push(e) : e.z <= N.z && s.push(e);
+								e.z >= k.z ? o.push(e) : e.z <= M.z && s.push(e);
 							}), o.length > 10) {
-								let r = new e.Vector3(a.start.x, a.start.y, 0), o = new e.Vector3(a.end.x, a.end.y, 0), s = new e.Vector3().subVectors(r, o).normalize(), l = new e.Vector3(), u = Infinity, d = -1, f = !1;
+								let r = new e.Vector3(a.start.x, a.start.y, 0), o = new e.Vector3(a.end.x, a.end.y, 0), s = new e.Vector3().subVectors(r, o).normalize(), l = new e.Vector3(), u = Infinity, d = -1, f = !1, p = !1;
 								for (let n = 0; n < t.length; n++) {
 									if (n == i) continue;
-									let a = new e.Vector3(t[n].start.x, t[n].start.y, 0), c = new e.Vector3(t[n].end.x, t[n].end.y, 0), p = D(r, o, a, c), m = I(r, o, a, c);
-									if (p != null) {
-										if (m && m.angle > 64) {
-											let e = p.point.distanceTo(r);
-											if (p.point.distanceTo(o), e < .3) {
-												u = Infinity, d = -1;
+									let a = new e.Vector3(t[n].start.x, t[n].start.y, 0), c = new e.Vector3(t[n].end.x, t[n].end.y, 0), m = O(r, o, a, c), h = L(r, o, a, c);
+									if (m != null) {
+										if (h && h.angle > 85) {
+											let e = m.point.distanceTo(r);
+											if (m.point.distanceTo(o), e < .3) {
+												p = !0, u = Infinity, d = -1;
 												break;
 											}
 										}
 										continue;
 									}
-									if (m && m.angle > 64) {
-										let t = F(r, o, new e.Line3(a, c).closestPointToPoint(r, !0, l), r);
+									if (h && h.angle > 85) {
+										let t = I(r, o, new e.Line3(a, c).closestPointToPoint(r, !0, l), r);
 										if (!t || t.direction != "same") continue;
-										let i = r.clone().addScaledVector(s, 10), f = o.clone().addScaledVector(s.clone().negate(), 10), p = new e.Vector3().subVectors(c, a).normalize(), m = D(i, f, a.clone().addScaledVector(p.clone().negate(), .03), c.clone().addScaledVector(p, .03));
+										let i = r.clone().addScaledVector(s, 10), f = o.clone().addScaledVector(s.clone().negate(), 10), p = new e.Vector3().subVectors(c, a).normalize(), m = O(i, f, a.clone().addScaledVector(p.clone().negate(), .03), c.clone().addScaledVector(p, .03));
 										if (m == null) continue;
 										let h = r.distanceTo(m.point);
 										h < u && (u = h, d = n);
-									} else if (m && m.angle < 5) {
-										let t = new e.Vector3(N.x, N.y, 0), n = new e.Vector3(P.x, P.y, 0), r = B(t, a), i = B(t, c), o = B(n, a), s = B(n, c);
+									} else if (h && h.angle < 5) {
+										let t = new e.Vector3(M.x, M.y, 0), n = new e.Vector3(P.x, P.y, 0), r = V(t, a), i = V(t, c), o = V(n, a), s = V(n, c);
 										if (r < .08 || i < .08 || o < .08 || s < .08) {
 											f = !0, u = Infinity, d = -1;
 											break;
 										}
 									}
 								}
-								if (u != Infinity && u < 2) t[d].length > .25 && x + u > .5 && (te = !0, n < c ? (M = M.addScaledVector(s, u), N = N.addScaledVector(s, u)) : (j = j.addScaledVector(s, u), P = P.addScaledVector(s, u)));
-								else if (!f) {
-									let r = .05, a = _.clone().addScaledVector(s, r), o = _.clone().addScaledVector(s.clone().negate(), r);
-									a.z = o.z = 0;
-									let l = !1;
-									for (let d = 0; d < t.length; d++) {
-										if (d == i) continue;
-										let f = new e.Vector3(t[d].start.x, t[d].start.y, 0), p = new e.Vector3(t[d].end.x, t[d].end.y, 0), m = new e.Vector3().subVectors(p, f).normalize();
-										f = f.clone().addScaledVector(m.clone().negate(), r), p = p.clone().addScaledVector(m, r);
-										let h = D(a, o, f, p);
-										if (h) {
-											h.point.z = _.z;
-											let e = h.point.distanceTo(_);
-											if (h.point.distanceTo(v) < e) continue;
-											u > e && (u = e), l = !0;
-										}
-										if (l) break;
-										u != Infinity && u < 2 && (n < c ? (M = M.addScaledVector(s.clone().negate(), u), N = N.addScaledVector(s.clone().negate(), u)) : (j = j.addScaledVector(s.clone().negate(), u), P = P.addScaledVector(s.clone().negate(), u)));
-									}
-									if (!l) continue;
-								}
+								if (u != Infinity && u < 2 && a.length - b > .5 && u < b * 3) t[d].length > .25 && b + u > .5 && (F = !0, n < c ? (A = A.addScaledVector(s, u), M = M.addScaledVector(s, u)) : (k = k.addScaledVector(s, u), P = P.addScaledVector(s, u)));
+								else if (!f && !p) continue;
 							} else continue;
-						} else if (o < c || s < c) {
-							let { newOriginalPoints: n } = ie(N, P, a.originalPoints), r = [], s = [];
+						}
+						if (o < c || s < c) {
+							let { newOriginalPoints: n } = ie(M, P, a.originalPoints), r = [], s = [];
 							if (n.forEach((e) => {
-								e.z >= j.z ? r.push(e) : e.z <= N.z && s.push(e);
+								e.z >= k.z ? r.push(e) : e.z <= M.z && s.push(e);
 							}), r.length > 10) {
-								let n = new e.Vector3(a.start.x, a.start.y, 0), r = new e.Vector3(a.end.x, a.end.y, 0), s = new e.Vector3().subVectors(r, n).normalize(), l = new e.Vector3(), u = Infinity, d = -1, f = !1;
+								let n = new e.Vector3(a.start.x, a.start.y, 0), r = new e.Vector3(a.end.x, a.end.y, 0), s = new e.Vector3().subVectors(r, n).normalize(), l = new e.Vector3(), u = Infinity, d = -1, f = !1, p = !1;
 								for (let a = 0; a < t.length; a++) {
 									if (a == i) continue;
-									let o = new e.Vector3(t[a].start.x, t[a].start.y, 0), c = new e.Vector3(t[a].end.x, t[a].end.y, 0), p = D(n, r, o, c), m = I(n, r, o, c);
-									if (p != null) {
-										if (m && m.angle > 64 && (p.point.distanceTo(n), p.point.distanceTo(r) < .3)) {
-											u = Infinity, d = -1;
+									let o = new e.Vector3(t[a].start.x, t[a].start.y, 0), c = new e.Vector3(t[a].end.x, t[a].end.y, 0), m = O(n, r, o, c), h = L(n, r, o, c);
+									if (m != null) {
+										if (h && h.angle > 85 && (m.point.distanceTo(n), m.point.distanceTo(r) < .3)) {
+											p = !0, u = Infinity, d = -1;
 											break;
 										}
 										continue;
 									}
-									if (m && m.angle > 64) {
-										let t = F(r, n, new e.Line3(o, c).closestPointToPoint(r, !0, l), r);
+									if (h && h.angle > 85) {
+										let t = I(r, n, new e.Line3(o, c).closestPointToPoint(r, !0, l), r);
 										if (!t || t.direction != "same") continue;
-										let i = n.clone().addScaledVector(s.clone().negate(), 10), f = r.clone().addScaledVector(s, 10), p = new e.Vector3().subVectors(c, o).normalize(), m = D(i, f, o.clone().addScaledVector(p.clone().negate(), .03), c.clone().addScaledVector(p, .03));
+										let i = n.clone().addScaledVector(s.clone().negate(), 10), f = r.clone().addScaledVector(s, 10), p = new e.Vector3().subVectors(c, o).normalize(), m = O(i, f, o.clone().addScaledVector(p.clone().negate(), .03), c.clone().addScaledVector(p, .03));
 										if (m == null) continue;
 										let h = r.distanceTo(m.point);
 										h < u && (u = h, d = a);
-									} else if (m && m.angle < 5) {
-										let t = new e.Vector3(N.x, N.y, 0), n = new e.Vector3(P.x, P.y, 0), r = B(t, o), i = B(t, c), a = B(n, o), s = B(n, c);
+									} else if (h && h.angle < 5) {
+										let t = new e.Vector3(M.x, M.y, 0), n = new e.Vector3(P.x, P.y, 0), r = V(t, o), i = V(t, c), a = V(n, o), s = V(n, c);
 										if (r < .08 || i < .08 || a < .08 || s < .08) {
 											f = !0, u = Infinity, d = -1;
 											break;
 										}
 									}
 								}
-								if (u != Infinity && u < 2) t[d].length > .25 && x + u > .5 && (te = !0, o < c ? (M = M.addScaledVector(s, u), N = N.addScaledVector(s, u)) : (j = j.addScaledVector(s, u), P = P.addScaledVector(s, u)));
-								else if (!f) {
-									let n = .05, r = v.clone().addScaledVector(s, n), a = _.clone();
-									r.z = a.z = 0;
-									let l = !1;
-									for (let o = 0; o < t.length; o++) {
-										if (o == i) continue;
-										let s = new e.Vector3(t[o].start.x, t[o].start.y, 0), c = new e.Vector3(t[o].end.x, t[o].end.y, 0), d = new e.Vector3().subVectors(c, s).normalize();
-										s = s.clone().addScaledVector(d.clone().negate(), n), c = c.clone().addScaledVector(d, n);
-										let f = D(r, a, s, c);
-										if (f) {
-											f.point.z = v.z;
-											let e = f.point.distanceTo(v);
-											if (f.point.distanceTo(_) < e) continue;
-											u > e && (u = e), l = !0;
-										}
-									}
-									if (!l) continue;
-									u != Infinity && u < 2 && (o < c ? (M = M.addScaledVector(s.clone().negate(), u), N = N.addScaledVector(s.clone().negate(), u)) : (j = j.addScaledVector(s.clone().negate(), u), P = P.addScaledVector(s.clone().negate(), u)));
-								}
+								if (u != Infinity && u < 2 && a.length - b > .5 && u < b * 3) t[d].length > .25 && b + u > .5 && (F = !0, o < c ? (A = A.addScaledVector(s, u), M = M.addScaledVector(s, u)) : (k = k.addScaledVector(s, u), P = P.addScaledVector(s, u)));
+								else if (!f && !p) continue;
 							} else continue;
 						}
-						x = M.distanceTo(j);
+						b = A.distanceTo(k);
 					}
-					if (C < 85 && x > .35 || x > .7 && S > y - y / 3) {
+					if (S < 85 && b > .3 || b > .7 && x > _ - _ / 3) {
 						let t = !1;
 						for (let r = 0; r < n.length; r++) {
 							let i = r + 1;
 							if (i >= n.length) continue;
 							let a = new e.Vector3(n[r].x, n[r].y, n[r].z), o = new e.Vector3(n[i].x, n[i].y, n[i].z);
-							if (D(new e.Vector3(a.x, a.y, 0), new e.Vector3(o.x, o.y, 0), new e.Vector3(b.facePoints[0].x, b.facePoints[0].y, 0), new e.Vector3(b.facePoints[1].x, b.facePoints[1].y, 0), .1) != null) {
+							if (O(new e.Vector3(a.x, a.y, 0), new e.Vector3(o.x, o.y, 0), new e.Vector3(y.facePoints[0].x, y.facePoints[0].y, 0), new e.Vector3(y.facePoints[1].x, y.facePoints[1].y, 0), .1) != null) {
 								t = !0;
 								break;
 							}
 						}
-						for (let t = 0; t < c.length; t++) {
-							let n = new e.Vector3(c[t].doorStartPt.x, c[t].doorStartPt.y, 0), i = new e.Vector3(c[t].doorEndPt.x, c[t].doorEndPt.y, 0), o = new e.Vector3(b.facePoints[0].x, b.facePoints[0].y, 0), s = new e.Vector3(b.facePoints[1].x, b.facePoints[1].y, 0), l = b.facePoints[2].z < c[t].maxZ || Math.abs(b.facePoints[2].z - c[t].maxZ) < .3;
-							if (Math.abs(b.facePoints[2].z - c[t].maxZ), l) {
-								let l = R(n.clone(), i.clone(), o.clone(), s.clone(), { distanceThreshold: 2 });
+						for (let t = 0; t < s.length; t++) {
+							let n = new e.Vector3(s[t].doorStartPt.x, s[t].doorStartPt.y, 0), i = new e.Vector3(s[t].doorEndPt.x, s[t].doorEndPt.y, 0), o = new e.Vector3(y.facePoints[0].x, y.facePoints[0].y, 0), c = new e.Vector3(y.facePoints[1].x, y.facePoints[1].y, 0), l = y.facePoints[2].z < s[t].maxZ || Math.abs(y.facePoints[2].z - s[t].maxZ) < .3;
+							if (Math.abs(y.facePoints[2].z - s[t].maxZ), l) {
+								let l = z(n.clone(), i.clone(), o.clone(), c.clone(), { distanceThreshold: 2 });
 								if (l && l.type == "collinear_gap") {
-									let u = L(n, i), d = new e.Line3(new e.Vector3(a.start.x, a.start.y, 0), new e.Vector3(a.end.x, a.end.y, 0)), f = new e.Vector3(), p = d.closestPointToPoint(u, !0, f);
+									let u = R(n, i), d = new e.Line3(new e.Vector3(a.start.x, a.start.y, 0), new e.Vector3(a.end.x, a.end.y, 0)), f = new e.Vector3(), p = d.closestPointToPoint(u, !0, f);
 									if (u.distanceTo(p) < .15) {
-										let a = o.distanceTo(n), u = s.distanceTo(n);
+										let a = o.distanceTo(n), u = c.distanceTo(n);
 										if (a > .25 && u > .25) {
-											let e = o.distanceTo(i), t = s.distanceTo(i);
+											let e = o.distanceTo(i), t = c.distanceTo(i);
 											if (e > .2 && t > .2) continue;
 										}
-										E = !0, O = !0, k.push(c[t].index), c[t].isFind = !0, z = t, r[c[t].index].isFindBeam = !0;
-										let d = new e.Vector3().subVectors(o, s).normalize(), f = n.distanceTo(i) - l.overlap;
-										u < a && d.negate(), a > u ? (j = b.facePoints[2].clone().addScaledVector(d, f), M = b.facePoints[3].clone(), N = M.clone(), P = j.clone(), N.z = P.z = b.facePoints[0].z) : (j = b.facePoints[2].clone(), M = b.facePoints[3].clone().addScaledVector(d, f), N = M.clone(), P = j.clone(), N.z = P.z = b.facePoints[0].z);
+										T = !0, E = !0, D.push(s[t].index), s[t].isFind = !0, B = t, r[s[t].index].isFindBeam = !0;
+										let d = new e.Vector3().subVectors(o, c).normalize(), f = n.distanceTo(i) - l.overlap;
+										u < a && d.negate(), a > u ? (k = y.facePoints[2].clone().addScaledVector(d, f), A = y.facePoints[3].clone(), M = A.clone(), P = k.clone(), M.z = P.z = y.facePoints[0].z) : (k = y.facePoints[2].clone(), A = y.facePoints[3].clone().addScaledVector(d, f), M = A.clone(), P = k.clone(), M.z = P.z = y.facePoints[0].z);
 									}
 								} else if (l && l.type == "collinear_overlap" && l.maxPerpendicularDistance < .35) {
-									let a = o.distanceTo(s), u = i.distanceTo(n);
+									let a = o.distanceTo(c), u = i.distanceTo(n);
 									if (Math.abs(a - l.overlap) < .25 || Math.abs(u - l.overlap) < .25) {
 										if (u > a && Math.abs(u - l.overlap) > 1) {
-											let t = o.distanceTo(n), r = o.distanceTo(i), a = s.distanceTo(n), c = s.distanceTo(i), d = t < r ? t : r, f = a < c ? a : c, p = new e.Vector3().subVectors(o, s).normalize(), m = u - l.overlap;
-											d < f ? (p.negate(), j = b.facePoints[2].clone().addScaledVector(p, m), M = b.facePoints[3].clone(), N = M.clone(), P = j.clone(), N.z = P.z = b.facePoints[0].z) : (j = b.facePoints[2].clone(), M = b.facePoints[3].clone().addScaledVector(p, m), N = M.clone(), P = j.clone(), N.z = P.z = b.facePoints[0].z);
+											let t = o.distanceTo(n), r = o.distanceTo(i), a = c.distanceTo(n), s = c.distanceTo(i), d = t < r ? t : r, f = a < s ? a : s, p = new e.Vector3().subVectors(o, c).normalize(), m = u - l.overlap;
+											d < f ? (p.negate(), k = y.facePoints[2].clone().addScaledVector(p, m), A = y.facePoints[3].clone(), M = A.clone(), P = k.clone(), M.z = P.z = y.facePoints[0].z) : (k = y.facePoints[2].clone(), A = y.facePoints[3].clone().addScaledVector(p, m), M = A.clone(), P = k.clone(), M.z = P.z = y.facePoints[0].z);
 										}
-										E = !0, O = !0, k.push(c[t].index), c[t].isFind = !0, r[c[t].index].isFindBeam = !0, z = t;
+										T = !0, E = !0, D.push(s[t].index), s[t].isFind = !0, r[s[t].index].isFindBeam = !0, B = t;
 									}
 								}
 							}
 						}
-						if (!O) for (let t = 0; t < c.length; t++) {
-							if (c[t].inWall) continue;
-							let n = new e.Vector3(c[t].doorStartPt.x, c[t].doorStartPt.y, 0), i = new e.Vector3(c[t].doorEndPt.x, c[t].doorEndPt.y, 0), a = new e.Vector3(b.facePoints[0].x, b.facePoints[0].y, 0), o = new e.Vector3(b.facePoints[1].x, b.facePoints[1].y, 0), s = new e.Vector3().subVectors(n, i).normalize(), l = new e.Vector3().subVectors(a, o).normalize(), u = .25, d = D(n.clone().addScaledVector(s, u), i.clone().addScaledVector(s.clone().negate(), u), a.clone().addScaledVector(l, u), o.clone().addScaledVector(l.clone().negate(), u)), f = b.facePoints[2].z < c[t].maxZ || Math.abs(b.facePoints[2].z - c[t].maxZ) < .3, p = n.distanceTo(a), h = n.distanceTo(o), g = i.distanceTo(a), _ = i.distanceTo(o);
-							(p < m || h < m || g < m || _ < m || d) && f && (r[c[t].index].isFindBeam = !0, E = !0, c[t].isFind = !0, z = t);
+						if (!E) for (let t = 0; t < s.length; t++) {
+							if (s[t].inWall) continue;
+							let n = new e.Vector3(s[t].doorStartPt.x, s[t].doorStartPt.y, 0), i = new e.Vector3(s[t].doorEndPt.x, s[t].doorEndPt.y, 0), a = new e.Vector3(y.facePoints[0].x, y.facePoints[0].y, 0), o = new e.Vector3(y.facePoints[1].x, y.facePoints[1].y, 0), c = new e.Vector3().subVectors(n, i).normalize(), l = new e.Vector3().subVectors(a, o).normalize(), u = .25, d = O(n.clone().addScaledVector(c, u), i.clone().addScaledVector(c.clone().negate(), u), a.clone().addScaledVector(l, u), o.clone().addScaledVector(l.clone().negate(), u)), f = n.distanceTo(a), m = n.distanceTo(o), h = i.distanceTo(a), g = i.distanceTo(o);
+							(f < p || m < p || h < p || g < p || d) && (r[s[t].index].isFindBeam = !0, T = !0, s[t].isFind = !0, B = t);
 						}
-						(E || t || Math.abs(S - y) > .1 && S > y / 2 && x > .3 && Math.abs(g - a.start.z) < .4) && (T = !0);
+						(T || t || Math.abs(x - _) > .1 && x > _ / 2 && b > .3) && (w = !0);
 					}
 				}
-				if (T) {
+				if (w) {
 					let n = !1;
-					for (let e = 0; e < f.length; e++) {
-						let t = R(f[e].start, f[e].end, N, P);
+					for (let e = 0; e < d.length; e++) {
+						let t = z(d[e].start, d[e].end, M, P);
 						if (t && t.type == "collinear_overlap" && t.maxPerpendicularDistance < .01) {
 							n = !0;
 							break;
 						}
 					}
 					if (n) {
-						z != -1 && (r[c[z].index].isFindBeam = !1, c[z].isFind = !1);
+						B != -1 && (r[s[B].index].isFindBeam = !1, s[B].isFind = !1);
 						continue;
 					}
-					f.push({
-						start: N,
+					d.push({
+						start: M,
 						end: P
 					});
 					{
@@ -1621,19 +1745,19 @@ var fe = class {
 							color: 65535,
 							size: .01
 						});
-						let t = new e.Vector3().subVectors(N, P), n = new e.Vector3().subVectors(P, N), r = Infinity, i = Infinity, o = N.clone(), s = P.clone(), c = [], l = [], u = new e.Line3(j, M), d = new e.Vector3(), f = 999999;
+						let t = new e.Vector3().subVectors(M, P), n = new e.Vector3().subVectors(P, M), r = Infinity, i = Infinity, o = M.clone(), s = P.clone(), c = [], l = [], u = new e.Line3(k, A), d = new e.Vector3(), f = 999999;
 						if (a.originalPoints.forEach((r) => {
-							if (r.z - N.z < S / 2 + .1 && r.z - N.z > S / 2 - .1 && c.push(r), r.z > j.z) {
-								let i = u.closestPointToPoint(r, !0, d), a = new e.Vector3().subVectors(i, j), o = A(t, new e.Vector3().subVectors(i, M)), s = A(n, a);
+							if (r.z - M.z < x / 2 + .1 && r.z - M.z > x / 2 - .1 && c.push(r), r.z > k.z) {
+								let i = u.closestPointToPoint(r, !0, d), a = new e.Vector3().subVectors(i, k), o = j(t, new e.Vector3().subVectors(i, A)), s = j(n, a);
 								o && o.parallel && !o.sameDirection && s && s.parallel && !s.sameDirection && l.push(r);
 							}
 						}), c.length > 0) {
-							let { newProjectPoints: a } = ie(N, P, c);
-							for (let e of a) e.z = N.z;
+							let { newProjectPoints: a } = ie(M, P, c);
+							for (let e of a) e.z = M.z;
 							a.forEach((a) => {
-								let c = new e.Vector3(a.x, a.y, N.z), l = new e.Vector3().subVectors(c, P), u = A(t, new e.Vector3().subVectors(c, N)), d = A(n, l);
+								let c = new e.Vector3(a.x, a.y, M.z), l = new e.Vector3().subVectors(c, P), u = j(t, new e.Vector3().subVectors(c, M)), d = j(n, l);
 								if (u && u.parallel && u.sameDirection) {
-									let e = c.distanceTo(N);
+									let e = c.distanceTo(M);
 									e < r && (r = e, o = c);
 								} else if (d && d.parallel && d.sameDirection) {
 									let e = c.distanceTo(P);
@@ -1641,172 +1765,176 @@ var fe = class {
 								}
 							});
 						}
-						if (o.equals(N) || (N = o, M = new e.Vector3(N.x, N.y, M.z)), s.equals(P) || (P = s, j = new e.Vector3(P.x, P.y, j.z)), l.length > 10) {
-							let { newOnLinePoints: e } = ie(M, j, l);
+						if (o.equals(M) || (M = o, A = new e.Vector3(M.x, M.y, A.z)), s.equals(P) || (P = s, k = new e.Vector3(P.x, P.y, k.z)), l.length > 10) {
+							let { newOnLinePoints: e } = ie(A, k, l);
 							for (let t = 0; t < e.length; t++) {
 								let n = u.closestPointToPoint(e[t], !0, d).distanceTo(e[t]);
 								n > .02 && f > n && (f = n);
 							}
-							j.z += f, M.z += f, S += f;
+							k.z += f, A.z += f, x += f;
 						}
 					}
-					let s = P.distanceTo(N);
-					if (s < .4 && !E || s < .3 && E) continue;
-					d.includes(i) || d.push(i), a.checkResults[o.index].isDoor = !0;
+					let p = P.distanceTo(M);
+					if (p < .4 && !T || p < .3 && T) continue;
+					u.includes(i) || u.push(i), a.checkResults[o.index].isDoor = !0;
 					let m = "", h = {
-						id: l,
-						beamStart: j,
-						beamEnd: M,
-						beamHeight: a.rooftopPz - j.z,
-						doorStart: N,
+						id: c,
+						beamStart: k,
+						beamEnd: A,
+						beamHeight: a.rooftopPz - k.z,
+						doorStart: M,
 						doorEnd: P,
-						doorHeight: S,
+						doorHeight: x,
 						nearId: -1,
 						type: m,
-						isExtend: te,
-						isDoor: E,
-						isPullOutDoor: O,
-						pcbDoorIndexs: k
-					}, g = !1, _ = new e.Vector3(), v = new e.Vector3(), y = -1;
-					for (let n = 0; n < u.length; n++) {
-						let r = t[u[n].linesIndex].doorAndBeamData[u[n].doorIndex];
+						isExtend: F,
+						isDoor: T,
+						isPullOutDoor: E,
+						pcbDoorIndexs: D
+					}, g = !1, _ = new e.Vector3(), v = new e.Vector3(), y = -1, S = -1, C = -1;
+					for (let n = 0; n < l.length; n++) {
+						let r = t[l[n].linesIndex].doorAndBeamData[l[n].doorIndex];
 						if (r.nearId != -1) continue;
-						let i = F(j.clone(), M.clone(), r.beamStart.clone(), r.beamEnd.clone());
+						let i = I(k.clone(), A.clone(), r.beamStart.clone(), r.beamEnd.clone());
 						if (i && i.isParallel) {
-							let t = j.distanceTo(M), n = r.beamStart.distanceTo(r.beamEnd), i = new e.Line3(j.clone(), M.clone());
-							i.start.z = 0, i.end.z = 0;
-							let a = L(r.beamStart, r.beamEnd, !0);
-							n > t && (i.start = new e.Vector3(r.beamStart.x, r.beamStart.y, 0), i.end = new e.Vector3(r.beamEnd.x, r.beamEnd.y, 0), a = L(j, M, !0));
-							let o = new e.Vector3(), s = i.closestPointToPoint(a, !0, o), c = s.distanceTo(a), u = new e.Vector3().subVectors(a, s).normalize(), d = u.clone().negate(), f = a.clone().addScaledVector(d, c + .1), p = D(i.start, i.end, a, f), m = !E && !r.isDoor && (t > n * 2 || n > t * 2);
-							if (c < .4 && p != null && !m) {
-								r.nearId = l, h.nearId = r.id;
+							let t = k.distanceTo(A), i = r.beamStart.distanceTo(r.beamEnd), a = new e.Line3(k.clone(), A.clone());
+							a.start.z = 0, a.end.z = 0;
+							let o = R(r.beamStart, r.beamEnd, !0);
+							i > t && (a.start = new e.Vector3(r.beamStart.x, r.beamStart.y, 0), a.end = new e.Vector3(r.beamEnd.x, r.beamEnd.y, 0), o = R(k, A, !0));
+							let s = new e.Vector3(), u = a.closestPointToPoint(o, !0, s), d = u.distanceTo(o), f = new e.Vector3().subVectors(o, u).normalize(), p = f.clone().negate(), m = o.clone().addScaledVector(p, d + .1), b = O(a.start, a.end, o, m), x = !T && !r.isDoor && (t > i * 2 || i > t * 2);
+							if (d < .4 && b != null && !x) {
+								r.nearId = c, h.nearId = r.id;
 								let e = .8;
 								(r.isDoor || h.isDoor) && (r.isDoor = !0, h.isDoor = !0);
-								let i = k.some((e) => r.pcbDoorIndexs.includes(e));
-								t < n ? t > e && !r.isPullOutDoor ? (r.beamStart = j.clone().addScaledVector(d, c), r.beamEnd = M.clone().addScaledVector(d, c), r.doorStart = N.clone().addScaledVector(d, c), r.doorEnd = P.clone().addScaledVector(d, c), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : !O || O && r.isPullOutDoor && i ? (h.beamStart = r.beamStart.clone().addScaledVector(u, c), h.beamEnd = r.beamEnd.clone().addScaledVector(u, c), h.doorStart = r.doorStart.clone().addScaledVector(u, c), h.doorEnd = r.doorEnd.clone().addScaledVector(u, c), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight) : (r.beamStart = j.clone().addScaledVector(d, c), r.beamEnd = M.clone().addScaledVector(d, c), r.doorStart = N.clone().addScaledVector(d, c), r.doorEnd = P.clone().addScaledVector(d, c), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : t > n && (n > e && !O ? (h.beamStart = r.beamStart.clone().addScaledVector(d, c), h.beamEnd = r.beamEnd.clone().addScaledVector(d, c), h.doorStart = r.doorStart.clone().addScaledVector(d, c), h.doorEnd = r.doorEnd.clone().addScaledVector(d, c), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight) : !r.isPullOutDoor || O && r.isPullOutDoor && i ? (r.beamStart = j.clone().addScaledVector(u, c), r.beamEnd = M.clone().addScaledVector(u, c), r.doorStart = N.clone().addScaledVector(u, c), r.doorEnd = P.clone().addScaledVector(u, c), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : (h.beamStart = r.beamStart.clone().addScaledVector(d, c), h.beamEnd = r.beamEnd.clone().addScaledVector(d, c), h.doorStart = r.doorStart.clone().addScaledVector(d, c), h.doorEnd = r.doorEnd.clone().addScaledVector(d, c), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight)), y = h.nearId, _ = r.beamStart.clone(), v = r.beamEnd.clone(), g = !0;
+								let a = D.some((e) => r.pcbDoorIndexs.includes(e));
+								t < i ? t > e && !r.isPullOutDoor ? (r.beamStart = k.clone().addScaledVector(p, d), r.beamEnd = A.clone().addScaledVector(p, d), r.doorStart = M.clone().addScaledVector(p, d), r.doorEnd = P.clone().addScaledVector(p, d), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : !E || E && r.isPullOutDoor && a ? (h.beamStart = r.beamStart.clone().addScaledVector(f, d), h.beamEnd = r.beamEnd.clone().addScaledVector(f, d), h.doorStart = r.doorStart.clone().addScaledVector(f, d), h.doorEnd = r.doorEnd.clone().addScaledVector(f, d), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight) : (r.beamStart = k.clone().addScaledVector(p, d), r.beamEnd = A.clone().addScaledVector(p, d), r.doorStart = M.clone().addScaledVector(p, d), r.doorEnd = P.clone().addScaledVector(p, d), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : t > i && (i > e && !E ? (h.beamStart = r.beamStart.clone().addScaledVector(p, d), h.beamEnd = r.beamEnd.clone().addScaledVector(p, d), h.doorStart = r.doorStart.clone().addScaledVector(p, d), h.doorEnd = r.doorEnd.clone().addScaledVector(p, d), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight) : !r.isPullOutDoor || E && r.isPullOutDoor && a ? (r.beamStart = k.clone().addScaledVector(f, d), r.beamEnd = A.clone().addScaledVector(f, d), r.doorStart = M.clone().addScaledVector(f, d), r.doorEnd = P.clone().addScaledVector(f, d), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : (h.beamStart = r.beamStart.clone().addScaledVector(p, d), h.beamEnd = r.beamEnd.clone().addScaledVector(p, d), h.doorStart = r.doorStart.clone().addScaledVector(p, d), h.doorEnd = r.doorEnd.clone().addScaledVector(p, d), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight)), y = h.nearId, _ = r.beamStart.clone(), v = r.beamEnd.clone(), g = !0, S = l[n].linesIndex, C = l[n].doorIndex;
 								break;
 							}
 						}
 					}
-					let b = !1;
+					let w = !1;
 					if (!g) {
-						let a = new e.Line3(N.clone(), P.clone());
+						let a = new e.Line3(M.clone(), P.clone());
 						for (let o = 0; o < t.length; o++) {
 							if (t[o].length < .5 || o == i || !t[o].checkResults) continue;
-							let s = R(new e.Vector3(t[o].start.x, t[o].start.y, t[o].start.z), new e.Vector3(t[o].end.x, t[o].end.y, t[o].end.z), N, P);
-							if (s && s.maxPerpendicularDistance < .3) {
+							let c = z(new e.Vector3(t[o].start.x, t[o].start.y, t[o].start.z), new e.Vector3(t[o].end.x, t[o].end.y, t[o].end.z), M, P), l = re(t[o]);
+							if (c && c.maxPerpendicularDistance < .3) {
 								for (let i = 0; i < t[o].checkResults.length; i++) {
 									let i = [];
 									t[o].originalPoints.forEach((t) => {
-										t.z > N.z && t.z < N.z + S / 2 && i.push(new e.Vector3(t.x, t.y, N.z));
+										t.z > M.z && t.z < M.z + x / 2 && i.push(new e.Vector3(t.x, t.y, M.z));
 									});
-									let s = new e.Vector3(), l = [], u = [];
+									let c = new e.Vector3(), u = [], d = [];
 									for (let e = 0; e < i.length; e++) {
-										let t = a.closestPointToPoint(i[e], !0, s);
-										t.distanceTo(i[e]) < .15 && (l.push(i[e]), u.push(t.clone()));
+										let t = a.closestPointToPoint(i[e], !0, c);
+										t.distanceTo(i[e]) < .15 && (u.push(i[e]), d.push(t.clone()));
 									}
-									for (let e = 0; e < u.length; e++) oe(a, u[e]) && l.push(u[e]);
-									if (l = u, l.length < 500) continue;
-									let d = se(l);
-									if (d.length == 2) {
-										let e = d[0].distanceTo(d[1]);
+									for (let e = 0; e < d.length; e++) oe(a, d[e]) && u.push(d[e]);
+									if (u = d, u.length < 500) continue;
+									let f = se(u);
+									if (f.length == 2) {
+										let e = f[0].distanceTo(f[1]);
 										if (Math.abs(e - a.distance()) < .3) {
-											n = !0, z != -1 && (r[c[z].index].isFindBeam = !1, c[z].isFind = !1);
+											if (h.beamStart.z > l.maxZ - .03 && b > 1) w = !0;
+											else if (n = !0, B != -1 && (r[s[B].index].isFindBeam = !1, s[B].isFind = !1), S != -1 && C != -1) {
+												let e = t[S].doorAndBeamData[C];
+												e.nearId = -1;
+											}
 											break;
 										}
 									}
 								}
 								if (n) break;
-							} else s && s.type == "collinear_overlap" && s.maxPerpendicularDistance > .3 && s.maxPerpendicularDistance < .7 && (b = !0);
+							} else c && c.type == "collinear_overlap" && c.maxPerpendicularDistance > .3 && c.maxPerpendicularDistance < .7 && (w = !0);
 						}
 						if (n) continue;
 					}
-					let C = !1;
-					if (y != -1) for (let e = 0; e < p.length && !(p[e].length == 1 && (p[e][0].id == l ? (p[e].push({
+					let N = !1;
+					if (y != -1) for (let e = 0; e < f.length && !(f[e].length == 1 && (f[e][0].id == c ? (f[e].push({
 						id: y,
 						beamStart: _,
 						beamEnd: v
-					}), C = !0) : p[e][0].id == y && (p[e].push({
-						id: l,
-						beamStart: j,
-						beamEnd: M
-					}), C = !0), C)); e++);
-					C || p.push([{
-						id: l,
-						beamStart: j,
-						beamEnd: M
+					}), N = !0) : f[e][0].id == y && (f[e].push({
+						id: c,
+						beamStart: k,
+						beamEnd: A
+					}), N = !0), N)); e++);
+					N || f.push([{
+						id: c,
+						beamStart: k,
+						beamEnd: A
 					}]);
-					let w = h.doorStart.distanceTo(h.doorEnd);
-					if (m = E ? "door" : w > 1.8 || b && w > 1 ? "beam" : "hole", h.type = m, h.nearId != -1 && m == "hole") {
+					let L = h.doorStart.distanceTo(h.doorEnd);
+					if (m = T ? "door" : L > 1.8 || w && L > 1 ? "beam" : "hole", h.type = m, h.nearId != -1 && m == "hole") {
 						let e = !1;
 						for (let n = 0; n < t.length; n++) if (t[n].doorAndBeamData) {
-							for (let r = 0; r < t[n].doorAndBeamData.length; r++) if (t[n].doorAndBeamData[r].nearId == l && t[n].doorAndBeamData[r].type == "beam") {
+							for (let r = 0; r < t[n].doorAndBeamData.length; r++) if (t[n].doorAndBeamData[r].nearId == c && t[n].doorAndBeamData[r].type == "beam") {
 								t[n].doorAndBeamData[r].type = m, e = !0;
 								break;
 							}
 							if (e) break;
 						}
 					}
-					if (a.doorAndBeamData.push(h), u.push({
+					if (a.doorAndBeamData.push(h), l.push({
 						linesIndex: i,
 						doorIndex: a.doorAndBeamData.length - 1
-					}), l++, O && x < 2) break;
+					}), c++, E && b < 2) break;
 				}
 			}
 		}
-		let x = a.length * (a.rooftopPz - a.start.z);
-		a.completePointAreaPercentage = b / x * 100;
+		let y = a.length * (a.rooftopPz - a.start.z);
+		a.completePointAreaPercentage = v / y * 100;
 	}
-	if (d.length > 1) for (let n = 0; n < d.length; n++) {
+	if (u.length > 1) for (let n = 0; n < u.length; n++) {
 		let r = [];
-		for (let i = 0; i < t[d[n]].doorAndBeamData.length; i++) {
-			let a = t[d[n]].doorAndBeamData[i].doorStart.clone(), o = t[d[n]].doorAndBeamData[i].doorEnd.clone();
+		for (let i = 0; i < t[u[n]].doorAndBeamData.length; i++) {
+			let a = t[u[n]].doorAndBeamData[i].doorStart.clone(), o = t[u[n]].doorAndBeamData[i].doorEnd.clone();
 			a.z = o.z = 0;
 			let s = a.distanceTo(o), c = !1;
-			for (let r = 0; r < d.length; r++) if (n != r) for (let n = 0; n < t[d[r]].doorAndBeamData.length; n++) {
-				let i = t[d[r]].doorAndBeamData[n].doorStart.clone(), l = t[d[r]].doorAndBeamData[n].doorEnd.clone();
-				i.z = l.z = 0, i.distanceTo(l);
-				let u = R(a, o, i, l);
-				if (u.type == "collinear_overlap" && u.maxPerpendicularDistance < .2) {
-					let t = new e.Line3(i, l), n = L(a, o), r = t.closestPointToPoint(n, !0, new e.Vector3()), d = n.distanceTo(r);
-					if (Math.abs(s - u.overlap) < .1 && d < .04) {
-						c = !0;
+			for (let r = 0; r < u.length; r++) if (n != r) for (let l = 0; l < t[u[r]].doorAndBeamData.length; l++) {
+				let d = t[u[r]].doorAndBeamData[l].doorStart.clone(), f = t[u[r]].doorAndBeamData[l].doorEnd.clone();
+				d.z = f.z = 0, d.distanceTo(f);
+				let p = z(a, o, d, f);
+				if (p.type == "collinear_overlap" && p.maxPerpendicularDistance < .2) {
+					let m = new e.Line3(d, f), h = R(a, o), g = m.closestPointToPoint(h, !0, new e.Vector3()), _ = h.distanceTo(g);
+					if (Math.abs(s - p.overlap) < .1 && _ < .04) {
+						t[u[r]].doorAndBeamData[l].nearId == t[u[n]].doorAndBeamData[i].id && (t[u[r]].doorAndBeamData[l].nearId = -1), c = !0;
 						break;
 					}
 				}
 			}
-			c || r.push(t[d[n]].doorAndBeamData[i]);
+			c || r.push(t[u[n]].doorAndBeamData[i]);
 		}
-		r.length != t[d[n]].doorAndBeamData.length && (t[d[n]].doorAndBeamData = r);
-	}
-	let h = .65, g = [], _ = [];
-	for (let n = 0; n < c.length; n++) {
-		if (c[n].isFind || c[n].inWall) continue;
-		let i = new e.Vector3(c[n].doorStartPt.x, c[n].doorStartPt.y, 0), a = new e.Vector3(c[n].doorEndPt.x, c[n].doorEndPt.y, 0), o = new e.Vector3().subVectors(i, a).normalize();
-		for (let s = 0; s < t.length; s++) {
-			if (t[s].length < .7 || t[s].completePointAreaPercentage > 60) continue;
-			let u = new e.Vector3(t[s].start.x, t[s].start.y, 0), d = new e.Vector3(t[s].end.x, t[s].end.y, 0), f = new e.Vector3().subVectors(u, d).normalize(), v = .3, y = i.clone().addScaledVector(o, v), b = a.clone().addScaledVector(o.clone().negate(), v), x = u.clone().addScaledVector(f, v), S = d.clone().addScaledVector(f.clone().negate(), v);
-			D(y, b, x, S);
-			let C = F(y, b, x, S), w = i.distanceTo(u) > a.distanceTo(u) ? a : i, T = w.distanceTo(u), E = w.distanceTo(d);
-			if ((T < m || E < m) && C && !C.isParallel) {
-				let o = i.distanceTo(u) < i.distanceTo(d) ? u : d, f = !1;
+		r.length != t[u[n]].doorAndBeamData.length && (t[u[n]].doorAndBeamData = r);
+	}
+	let m = .65, h = [], g = [];
+	for (let n = 0; n < s.length; n++) {
+		if (s[n].isFind || s[n].inWall) continue;
+		let i = new e.Vector3(s[n].doorStartPt.x, s[n].doorStartPt.y, 0), a = new e.Vector3(s[n].doorEndPt.x, s[n].doorEndPt.y, 0), o = new e.Vector3().subVectors(i, a).normalize();
+		for (let l = 0; l < t.length; l++) {
+			if (t[l].length < .7 || t[l].completePointAreaPercentage > 60) continue;
+			let u = new e.Vector3(t[l].start.x, t[l].start.y, 0), d = new e.Vector3(t[l].end.x, t[l].end.y, 0), _ = new e.Vector3().subVectors(u, d).normalize(), v = .3, y = i.clone().addScaledVector(o, v), b = a.clone().addScaledVector(o.clone().negate(), v), x = u.clone().addScaledVector(_, v), S = d.clone().addScaledVector(_.clone().negate(), v);
+			O(y, b, x, S);
+			let C = I(y, b, x, S), w = i.distanceTo(u) > a.distanceTo(u) ? a : i, T = w.distanceTo(u), E = w.distanceTo(d);
+			if ((T < p || E < p) && C && !C.isParallel) {
+				let o = i.distanceTo(u) < i.distanceTo(d) ? u : d, _ = !1;
 				for (let v = 0; v < t.length; v++) {
-					if (v == s || g.includes(v) || t[v].length < .7) continue;
-					let y = new e.Vector3(t[v].start.x, t[v].start.y, 0), b = new e.Vector3(t[v].end.x, t[v].end.y, 0), x = new e.Vector3().subVectors(y, b).normalize(), S = x.clone().negate(), C = y.clone().addScaledVector(x, 5), w = b.clone().addScaledVector(S, 5), T = I(u, d, y, b), E = R(u, d, y, b), O = D(u, d, C, w), k = !0;
-					if (O != null && (k = O.point.distanceTo(u) < m || O.point.distanceTo(d) < m), (T && T.angle > 85 || E && E.type == "collinear_gap") && k) {
-						let m = new e.Line3(u, d), x = new e.Vector3(), S = m.closestPointToPoint(y, !0, x), C = m.closestPointToPoint(b, !0, x), w = S.distanceTo(y), T = C.distanceTo(b), E, D;
-						if (w > T && T > h) E = b, D = C;
-						else if (w < T && w > h) E = y, D = S;
+					if (v == l || h.includes(v) || t[v].length < .7) continue;
+					let y = new e.Vector3(t[v].start.x, t[v].start.y, 0), b = new e.Vector3(t[v].end.x, t[v].end.y, 0), x = new e.Vector3().subVectors(y, b).normalize(), S = x.clone().negate(), C = y.clone().addScaledVector(x, 5), w = b.clone().addScaledVector(S, 5), T = L(u, d, y, b), E = z(u, d, y, b), D = O(u, d, C, w), k = !0;
+					if (D != null && (k = D.point.distanceTo(u) < p || D.point.distanceTo(d) < p), (T && T.angle > 85 || E && E.type == "collinear_gap") && k) {
+						let p = new e.Line3(u, d), x = new e.Vector3(), S = p.closestPointToPoint(y, !0, x), C = p.closestPointToPoint(b, !0, x), w = S.distanceTo(y), T = C.distanceTo(b), E, D;
+						if (w > T && T > m) E = b, D = C;
+						else if (w < T && w > m) E = y, D = S;
 						else continue;
 						if (w = o.distanceTo(y), T = o.distanceTo(b), w > 2 && T > 2) continue;
-						let O = F(E, D, y, b);
+						let O = I(E, D, y, b);
 						if (!O || !O.isParallel) continue;
-						let k = R(i, a, E, D);
+						let k = z(i, a, E, D);
 						if (k && k.type == "collinear_overlap" && k.maxPerpendicularDistance < .2) continue;
 						E.z = D.z = t[v].start.z;
 						let A = !1;
-						for (let e = 0; e < _.length; e++) {
-							let t = R(_[e].start, _[e].end, E, D);
+						for (let e = 0; e < g.length; e++) {
+							let t = z(g[e].start, g[e].end, E, D);
 							if (t && t.type == "collinear_overlap" && t.maxPerpendicularDistance < .2) {
 								A = !0;
 								break;
@@ -1815,20 +1943,20 @@ var fe = class {
 						if (A) continue;
 						for (let n = 0; n < t.length; n++) {
 							if (t[n].length < .5) continue;
-							let r = R(new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), E, D);
+							let r = z(new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), E, D);
 							if (r && r.type == "collinear_overlap" && r.maxPerpendicularDistance < .1) {
 								A = !0;
 								break;
 							}
 						}
 						if (A) continue;
-						_.push({
+						g.push({
 							start: E,
 							end: D
-						}), g.push(v);
-						let j = t[v].rooftopPz - t[v].start.z, M = t[s].rooftopPz - t[s].start.z, N = j < M ? j : M;
+						}), h.push(v);
+						let j = t[v].rooftopPz - t[v].start.z, M = t[l].rooftopPz - t[l].start.z, N = j < M ? j : M;
 						t[v].doorAndBeamData || (t[v].doorAndBeamData = []), t[v].doorAndBeamData.push({
-							id: l,
+							id: c,
 							beamStart: E,
 							beamEnd: D,
 							beamHeight: N,
@@ -1838,23 +1966,23 @@ var fe = class {
 							nearId: -1,
 							type: "onlyDoor",
 							isDoor: !0
-						}), r[c[n].index].isFindBeam = !0, r[c[n].index].isFindOnlyDoor = !0, p.push([{
-							id: l,
+						}), r[s[n].index].isFindBeam = !0, r[s[n].index].isFindOnlyDoor = !0, f.push([{
+							id: c,
 							beamStart: E,
 							beamEnd: D
-						}]), l++, f = !0;
+						}]), c++, _ = !0;
 						break;
 					}
 				}
-				if (f) break;
+				if (_) break;
 			}
 		}
 	}
 	return {
 		lines: t,
-		beamGroup: p
+		beamGroup: f
 	};
-}, ve = (t, n) => {
+}, Oe = (t, n) => {
 	if (t.length <= 0) return t;
 	for (let n of t) {
 		let t = [];
@@ -1896,7 +2024,7 @@ var fe = class {
 				if (i.points.push(...a[t]), i.area += o.distanceTo(s) * o.distanceTo(p), i.originalVertices.push(a[t]), i.index = r, i.centerPts.push(m), u == -1 || d == -1) {
 					let t = new e.Vector3().subVectors(o, s).normalize();
 					d = o.distanceTo(p), u = o.distanceTo(s);
-					let n = A(t, new e.Vector3(0, 0, 1));
+					let n = j(t, new e.Vector3(0, 0, 1));
 					n && n.parallel && ([d, u] = [u, d]);
 				}
 				i.gridWidth = u, i.gridHeight = d;
@@ -1935,17 +2063,17 @@ var fe = class {
 		let l = new e.Vector3(i.start.x, i.start.y, 0), u = new e.Vector3(i.end.x, i.end.y, 0);
 		for (let i = 0; i < t.length; i++) {
 			if (i == r || t[i].length < 1) continue;
-			let a = t[i], o = new e.Vector3(a.start.x, a.start.y, 0), c = new e.Vector3(a.end.x, a.end.y, 0), d = F(l, u, o, c), f = L(l, u), p = new e.Line3(o, c).closestPointToPoint(f, !0, new e.Vector3()), m = f.distanceTo(p), h = re(a);
+			let a = t[i], o = new e.Vector3(a.start.x, a.start.y, 0), c = new e.Vector3(a.end.x, a.end.y, 0), d = I(l, u, o, c), f = R(l, u), p = new e.Line3(o, c).closestPointToPoint(f, !0, new e.Vector3()), m = f.distanceTo(p), h = re(a);
 			if (!(h.minZ === void 0 || h.maxZ === void 0) && !(h.maxZ - h.minZ > 1) && d && d.isParallel && m < .25 && Math.abs(s - h.minZ) < .1) {
-				let a = L(l, u), s = L(o, c);
+				let a = R(l, u), s = R(o, c);
 				a.z = s.z = 1, a.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), s.applyEuler(new e.Euler(-Math.PI / 2, 0, 0));
 				let d = `w:${t[r].originaIndex},b:${t[i].originaIndex}`, f = `b:${t[i].originaIndex},w:${t[r].originaIndex}`;
-				n.add(O(d, a, { textColor: "#fd0000" })), n.add(O(f, s, { textColor: "#fd0000" }));
+				n.add(k(d, a, { textColor: "#fd0000" })), n.add(k(f, s, { textColor: "#fd0000" }));
 			}
 		}
 	}
 	return t;
-}, ye = (t, n) => {
+}, ke = (t, n) => {
 	let r = {
 		rectangles: [],
 		threeEdgeRect: []
@@ -1958,34 +2086,34 @@ var fe = class {
 		for (let r = 0; r < t.length; r++) {
 			let i = t[r].length;
 			if (r == n || i < a || i > o) continue;
-			let g = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), _ = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), v = I(u, d, g, _);
+			let g = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), _ = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), v = L(u, d, g, _);
 			if (!v || v.angle < 85) continue;
-			let y = V(g, u), b = V(g, d), x = V(_, u), S = V(_, d);
+			let y = H(g, u), b = H(g, d), x = H(_, u), S = H(_, d);
 			if (!(!y && !b && !x && !S)) {
 				y || b ? (p = g.clone(), m = _.clone()) : (p = _.clone(), m = g.clone()), h = new e.Vector3().subVectors(m, p).normalize(), h.clone().negate();
 				for (let p = 0; p < t.length; p++) {
 					let h = t[p].length;
 					if (p == n || p == r || h < a || h > o) continue;
-					let v = new e.Vector3(t[p].start.x, t[p].start.y, t[p].start.z), y = new e.Vector3(t[p].end.x, t[p].end.y, t[p].end.z), b = I(g, _, v, y);
+					let v = new e.Vector3(t[p].start.x, t[p].start.y, t[p].start.z), y = new e.Vector3(t[p].end.x, t[p].end.y, t[p].end.z), b = L(g, _, v, y);
 					if (!b || b.angle < 85) continue;
-					let x = V(v, m), S = V(y, m);
+					let x = H(v, m), S = H(y, m);
 					if (!x && !S) continue;
 					new e.Vector3();
 					let C = new e.Vector3(), w = new e.Vector3();
 					x ? (w = new e.Vector3().subVectors(y, v).normalize(), v.clone(), C = y.clone()) : (w = new e.Vector3().subVectors(v, y).normalize(), y.clone(), C = v.clone());
-					let T = A(f, w, .1);
+					let T = j(f, w, .1);
 					if (!(!T || !T.parallel || !T.sameDirection)) {
 						for (let f = 0; f < t.length; f++) {
 							let m = t[f].length;
 							if (f == n || f == r || f == p || m < a || m > o) continue;
-							let h = new e.Vector3(t[f].start.x, t[f].start.y, t[f].start.z), g = new e.Vector3(t[f].end.x, t[f].end.y, t[f].end.z), _ = I(h, g, v, y);
+							let h = new e.Vector3(t[f].start.x, t[f].start.y, t[f].start.z), g = new e.Vector3(t[f].end.x, t[f].end.y, t[f].end.z), _ = L(h, g, v, y);
 							if (!_ || _.angle < 85) continue;
-							let b = V(h, C), x = V(g, C);
+							let b = H(h, C), x = H(g, C);
 							if (!b && !x) continue;
 							new e.Vector3();
 							let S = new e.Vector3();
 							b ? (h.clone(), S = g.clone()) : (g.clone(), S = h.clone());
-							let w = V(S, u), T = V(S, d);
+							let w = H(S, u), T = H(S, d);
 							if (!w && !T) continue;
 							let E = c * i;
 							if (!(E < s || E > 2)) {
@@ -2018,7 +2146,7 @@ var fe = class {
 		}, u = new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), d = new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), f = !0, p = !0;
 		for (let r = 0; r < t.length; r++) {
 			if (r == n) continue;
-			let i = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), a = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), o = V(i, u), s = V(a, u), c = V(i, d), l = V(a, d);
+			let i = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), a = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), o = H(i, u), s = H(a, u), c = H(i, d), l = H(a, d);
 			if (o || s ? f = !1 : (c || l) && (p = !1), !f && !p) break;
 		}
 		if (!f && !p) continue;
@@ -2028,9 +2156,9 @@ var fe = class {
 		for (let r = 0; r < t.length; r++) {
 			let f = t[r].length;
 			if (r == n || i.has(r) || f < a || f > o) continue;
-			let p = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), m = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), g = I(u, d, p, m);
+			let p = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), m = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), g = L(u, d, p, m);
 			if (!g || g.angle < 85) continue;
-			let _ = V(p, d), v = V(m, d);
+			let _ = H(p, d), v = H(m, d);
 			if (!_ && !v) continue;
 			new e.Vector3();
 			let y = new e.Vector3();
@@ -2038,18 +2166,18 @@ var fe = class {
 			for (let d = 0; d < t.length; d++) {
 				let g = t[d].length;
 				if (d == n || d == r || i.has(d) || g < a || g > o) continue;
-				let _ = new e.Vector3(t[d].start.x, t[d].start.y, t[d].start.z), v = new e.Vector3(t[d].end.x, t[d].end.y, t[d].end.z), b = I(p, m, _, v);
+				let _ = new e.Vector3(t[d].start.x, t[d].start.y, t[d].start.z), v = new e.Vector3(t[d].end.x, t[d].end.y, t[d].end.z), b = L(p, m, _, v);
 				if (!b || b.angle < 85) continue;
-				let x = V(_, y), S = V(v, y);
+				let x = H(_, y), S = H(v, y);
 				if (!x && !S) continue;
 				let C = new e.Vector3(), w = new e.Vector3();
 				x ? (C = _.clone(), w = v.clone()) : (C = v.clone(), w = _.clone());
-				let T = A(h, new e.Vector3().subVectors(w, C).normalize(), .1);
+				let T = j(h, new e.Vector3().subVectors(w, C).normalize(), .1);
 				if (!T || !T.parallel || !T.sameDirection) continue;
 				let E = !0, D = !0;
 				for (let n = 0; n < t.length; n++) {
 					if (n == d) continue;
-					let r = new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), i = new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), a = V(r, _), o = V(i, _), s = V(r, v), c = V(i, v);
+					let r = new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), i = new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), a = H(r, _), o = H(i, _), s = H(r, v), c = H(i, v);
 					if (a || o ? E = !1 : (s || c) && (D = !1), !E && !D) break;
 				}
 				if (!E && !D) continue;
@@ -2068,8 +2196,8 @@ var fe = class {
 		l.indexs.length == 3 && (l.indexs.forEach((e) => i.add(e)), r.threeEdgeRect.push(l));
 	}
 	return r;
-}, H = 11102230246251565e-32, U = 134217729, be = (3 + 8 * H) * H;
-function xe(e, t, n, r, i) {
+}, U = 11102230246251565e-32, W = 134217729, Ae = (3 + 8 * U) * U;
+function je(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;
@@ -2078,37 +2206,37 @@ function xe(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 Se(e, t) {
+function Me(e, t) {
 	let n = t[0];
 	for (let r = 1; r < e; r++) n += t[r];
 	return n;
 }
-function W(e) {
+function G(e) {
 	return new Float64Array(e);
 }
 //#endregion
 //#region node_modules/robust-predicates/esm/orient2d.js
-var Ce = (3 + 16 * H) * H, we = (2 + 12 * H) * H, Te = (9 + 64 * H) * H * H, Ee = W(4), De = W(8), Oe = W(12), ke = W(16), G = W(4);
-function Ae(e, t, n, r, i, a, o) {
+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) {
 	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 = U * T, p = f - (f - T), m = T - p, f = U * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = D * E, f = U * D, p = f - (f - D), m = D - p, f = U * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, Ee[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, Ee[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, Ee[2] = v - (w - d) + (_ - d), Ee[3] = w;
-	let k = Se(4, Ee), A = we * 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 = Te * o + be * Math.abs(k), k += T * u + O * s - (D * l + E * c), k >= A || -k >= A)) return k;
-	b = s * O, f = U * s, p = f - (f - s), m = s - p, f = U * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = c * E, f = U * c, p = f - (f - c), m = c - p, f = U * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, G[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, G[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, G[2] = v - (w - d) + (_ - d), G[3] = w;
-	let j = xe(4, Ee, 4, G, De);
-	b = T * u, f = U * T, p = f - (f - T), m = T - p, f = U * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = D * l, f = U * D, p = f - (f - D), m = D - p, f = U * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, G[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, G[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, G[2] = v - (w - d) + (_ - d), G[3] = w;
-	let M = xe(j, De, 4, G, Oe);
-	return b = s * u, f = U * s, p = f - (f - s), m = s - p, f = U * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = c * l, f = U * c, p = f - (f - c), m = c - p, f = U * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, G[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, G[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, G[2] = v - (w - d) + (_ - d), G[3] = w, ke[xe(M, Oe, 4, G, ke) - 1];
+	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 = 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);
+	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];
 }
-function je(e, t, n, r, i, a) {
+function Ve(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) >= Ce * l ? c : -Ae(e, t, n, r, i, a, l);
+	return Math.abs(c) >= Ne * l ? c : -Be(e, t, n, r, i, a, l);
 }
-(7 + 56 * H) * H, (3 + 28 * H) * H, (26 + 288 * H) * H * H, W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(8), W(8), W(8), W(4), W(8), W(8), W(16), W(12), W(192), W(192), (10 + 96 * H) * H, (4 + 48 * H) * H, (44 + 576 * H) * H * H, W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(8), W(8), W(8), W(8), W(8), W(8), W(8), W(8), W(8), W(4), W(4), W(4), W(8), W(16), W(16), W(16), W(32), W(32), W(48), W(64), W(1152), W(1152), (16 + 224 * H) * H, (5 + 72 * H) * H, (71 + 1408 * H) * H * H, W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(24), W(24), W(24), W(24), W(24), W(24), W(24), W(24), W(24), W(24), W(1152), W(1152), W(1152), W(1152), W(1152), W(2304), W(2304), W(3456), W(5760), W(8), W(8), W(8), W(16), W(24), W(48), W(48), W(96), W(192), W(384), W(384), W(384), W(768), W(96), W(96), W(96), W(1152);
+(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 Me = 2 ** -52, Ne = new Uint32Array(512), Pe = class e {
-	static from(t, n = He, r = Ue) {
+var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
+	static from(t, n = Qe, r = $e) {
 		let i = t.length, a = new Float64Array(i * 2);
 		for (let e = 0; e < i; e++) {
 			let i = t[e];
@@ -2131,25 +2259,25 @@ var Me = 2 ** -52, Ne = new Uint32Array(512), Pe = 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 = Ie(u, d, e[2 * t], e[2 * t + 1]);
+			let r = Ke(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 = Ie(h, g, e[2 * t], e[2 * t + 1]);
+			let r = Ke(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 = Re(h, g, _, v, e[2 * t], e[2 * t + 1]);
+			let n = Je(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];
-			Be(this._ids, this._dists, 0, a - 1);
+			Xe(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];
@@ -2158,24 +2286,24 @@ var Me = 2 ** -52, Ne = new Uint32Array(512), Pe = class e {
 			this.hull = t.subarray(0, n), this.triangles = new Uint32Array(), this.halfedges = new Int32Array();
 			return;
 		}
-		if (je(h, g, _, v, b, x) < 0) {
+		if (Ve(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 = ze(h, g, _, v, b, x);
+		let S = Ye(h, g, _, v, b, x);
 		this._cx = S.x, this._cy = S.y;
-		for (let t = 0; t < a; t++) this._dists[t] = Ie(e[2 * t], e[2 * t + 1], S.x, S.y);
-		Be(this._ids, this._dists, 0, a - 1), this._hullStart = f;
+		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;
 		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) <= Me && Math.abs(u - s) <= Me || (o = l, s = u, c === f || c === p || c === m)) continue;
+			if (a > 0 && Math.abs(l - o) <= He && Math.abs(u - s) <= He || (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], je(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], Ve(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;
 			}
@@ -2183,8 +2311,8 @@ var Me = 2 ** -52, Ne = new Uint32Array(512), Pe = 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], je(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], je(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], 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;
 			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);
@@ -2192,7 +2320,7 @@ var Me = 2 ** -52, Ne = new Uint32Array(512), Pe = class e {
 		this.triangles = this._triangles.subarray(0, this.trianglesLen), this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
 	}
 	_hashKey(e, t) {
-		return Math.floor(Fe(e - this._cx, t - this._cy) * this._hashSize) % this._hashSize;
+		return Math.floor(Ge(e - this._cx, t - this._cy) * this._hashSize) % this._hashSize;
 	}
 	_legalize(e) {
 		let { _triangles: t, _halfedges: n, coords: r } = this, i = 0, a = 0;
@@ -2200,11 +2328,11 @@ var Me = 2 ** -52, Ne = new Uint32Array(512), Pe = class e {
 			let o = n[e], s = e - e % 3;
 			if (a = s + (e + 2) % 3, o === -1) {
 				if (i === 0) break;
-				e = Ne[--i];
+				e = Ue[--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 (Le(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 (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])) {
 				t[e] = m, t[o] = d;
 				let r = n[u];
 				if (r === -1) {
@@ -2219,10 +2347,10 @@ var Me = 2 ** -52, Ne = new Uint32Array(512), Pe = class e {
 				}
 				this._link(e, r), this._link(o, n[a]), this._link(a, u);
 				let s = c + (o + 1) % 3;
-				i < Ne.length && (Ne[i++] = s);
+				i < Ue.length && (Ue[i++] = s);
 			} else {
 				if (i === 0) break;
-				e = Ne[--i];
+				e = Ue[--i];
 			}
 		}
 		return a;
@@ -2235,30 +2363,30 @@ var Me = 2 ** -52, Ne = new Uint32Array(512), Pe = 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 Fe(e, t) {
+function Ge(e, t) {
 	let n = e / (Math.abs(e) + Math.abs(t));
 	return (t > 0 ? 3 - n : 1 + n) / 4;
 }
-function Ie(e, t, n, r) {
+function Ke(e, t, n, r) {
 	let i = e - n, a = t - r;
 	return i * i + a * a;
 }
-function Le(e, t, n, r, i, a, o, s) {
+function qe(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 Re(e, t, n, r, i, a) {
+function Je(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 ze(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);
 	return {
 		x: e + (l * u - s * d) * f,
 		y: t + (o * d - c * u) * f
 	};
 }
-function Be(e, t, n, r) {
+function Xe(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--];
@@ -2266,7 +2394,7 @@ function Be(e, t, n, r) {
 	}
 	else {
 		let i = n + r >> 1, a = n + 1, o = r;
-		Ve(e, i, a), t[e[n]] > t[e[r]] && Ve(e, n, r), t[e[a]] > t[e[r]] && Ve(e, a, r), t[e[n]] > t[e[a]] && Ve(e, n, a);
+		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);
 		let s = e[a], c = t[s];
 		for (;;) {
 			do
@@ -2276,24 +2404,24 @@ function Be(e, t, n, r) {
 				o--;
 			while (t[e[o]] > c);
 			if (o < a) break;
-			Ve(e, a, o);
+			Ze(e, a, o);
 		}
-		e[n + 1] = e[o], e[o] = s, r - a + 1 >= o - n ? (Be(e, t, a, r), Be(e, t, n, o - 1)) : (Be(e, t, n, o - 1), Be(e, t, a, r));
+		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));
 	}
 }
-function Ve(e, t, n) {
+function Ze(e, t, n) {
 	let r = e[t];
 	e[t] = e[n], e[n] = r;
 }
-function He(e) {
+function Qe(e) {
 	return e[0];
 }
-function Ue(e) {
+function $e(e) {
 	return e[1];
 }
 //#endregion
 //#region node_modules/d3-delaunay/src/path.js
-var We = 1e-6, Ge = class {
+var et = 1e-6, tt = class {
 	constructor() {
 		this._x0 = this._y0 = this._x1 = this._y1 = null, this._ = "";
 	}
@@ -2310,7 +2438,7 @@ var We = 1e-6, Ge = 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) > We || Math.abs(this._y1 - i) > We) && (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) > 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}`);
 	}
 	rect(e, t, n, r) {
 		this._ += `M${this._x0 = this._x1 = +e},${this._y0 = this._y1 = +t}h${+n}v${+r}h${-n}Z`;
@@ -2318,7 +2446,7 @@ var We = 1e-6, Ge = class {
 	value() {
 		return this._ || null;
 	}
-}, Ke = class {
+}, nt = class {
 	constructor() {
 		this._ = [];
 	}
@@ -2334,7 +2462,7 @@ var We = 1e-6, Ge = class {
 	value() {
 		return this._.length ? this._ : null;
 	}
-}, qe = class {
+}, rt = class {
 	constructor(e, [t, n, r, i] = [
 		0,
 		0,
@@ -2370,7 +2498,7 @@ var We = 1e-6, Ge = 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 Ge() : void 0, { delaunay: { halfedges: n, inedges: r, hull: i }, circumcenters: a, vectors: o } = this;
+		let t = e == null ? e = new tt() : 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];
@@ -2387,11 +2515,11 @@ var We = 1e-6, Ge = class {
 		return t && t.value();
 	}
 	renderBounds(e) {
-		let t = e == null ? e = new Ge() : void 0;
+		let t = e == null ? e = new tt() : 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 Ge() : void 0, r = this._clip(e);
+		let n = t == null ? t = new tt() : void 0, r = this._clip(e);
 		if (r === null || !r.length) return;
 		t.moveTo(r[0], r[1]);
 		let i = r.length;
@@ -2407,7 +2535,7 @@ var We = 1e-6, Ge = class {
 		}
 	}
 	cellPolygon(e) {
-		let t = new Ke();
+		let t = new nt();
 		return this.renderCell(e, t), t.value();
 	}
 	_renderSegment(e, t, n, r, i) {
@@ -2591,14 +2719,14 @@ var We = 1e-6, Ge = class {
 		}
 		return e;
 	}
-}, Je = 2 * Math.PI, Ye = Math.pow;
-function Xe(e) {
+}, it = 2 * Math.PI, at = Math.pow;
+function ot(e) {
 	return e[0];
 }
-function Ze(e) {
+function st(e) {
 	return e[1];
 }
-function Qe(e) {
+function ct(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];
@@ -2606,22 +2734,22 @@ function Qe(e) {
 	}
 	return !0;
 }
-function $e(e, t, n) {
+function lt(e, t, n) {
 	return [e + Math.sin(e + t) * n, t + Math.cos(e - t) * n];
 }
-var et = class e {
-	static from(t, n = Xe, r = Ze, i) {
-		return new e("length" in t ? tt(t, n, r, i) : Float64Array.from(nt(t, n, r, i)));
+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)));
 	}
 	constructor(e) {
-		this._delaunator = new Pe(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 We(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 && Qe(e)) {
+		if (e.hull && e.hull.length > 2 && ct(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],
@@ -2630,10 +2758,10 @@ var et = 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 = $e(t[2 * e], t[2 * e + 1], i);
+				let n = lt(t[2 * e], t[2 * e + 1], i);
 				t[2 * e] = n[0], t[2 * e + 1] = n[1];
 			}
-			this._delaunator = new Pe(t);
+			this._delaunator = new We(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) {
@@ -2644,7 +2772,7 @@ var et = 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 qe(this, e);
+		return new rt(this, e);
 	}
 	*neighbors(e) {
 		let { inedges: t, hull: n, _hullIndex: r, halfedges: i, triangles: a, collinear: o } = this;
@@ -2674,19 +2802,19 @@ var et = 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 = Ye(t - c[e * 2], 2) + Ye(n - c[e * 2 + 1], 2), d = r[e], f = d;
+		let l = e, u = at(t - c[e * 2], 2) + at(n - c[e * 2 + 1], 2), d = r[e], f = d;
 		do {
-			let r = s[f], d = Ye(t - c[r * 2], 2) + Ye(n - c[r * 2 + 1], 2);
+			let r = s[f], d = at(t - c[r * 2], 2) + at(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 && Ye(t - c[f * 2], 2) + Ye(n - c[f * 2 + 1], 2) < u) return f;
+				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;
 				break;
 			}
 		} while (f !== d);
 		return l;
 	}
 	render(e) {
-		let t = e == null ? e = new Ge() : void 0, { points: n, halfedges: r, triangles: i } = this;
+		let t = e == null ? e = new tt() : 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;
@@ -2697,15 +2825,15 @@ var et = 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 Ge() : void 0, { points: r } = this;
+		let n = e == null ? e = new tt() : 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, Je);
+			e.moveTo(i + t, a), e.arc(i, a, t, 0, it);
 		}
 		return n && n.value();
 	}
 	renderHull(e) {
-		let t = e == null ? e = new Ge() : void 0, { hull: n, points: r } = this, i = n[0] * 2, a = n.length;
+		let t = e == null ? e = new tt() : 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];
@@ -2714,11 +2842,11 @@ var et = class e {
 		return e.closePath(), t && t.value();
 	}
 	hullPolygon() {
-		let e = new Ke();
+		let e = new nt();
 		return this.renderHull(e), e.value();
 	}
 	renderTriangle(e, t) {
-		let n = t == null ? t = new Ge() : 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 tt() : 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() {
@@ -2726,11 +2854,11 @@ var et = class e {
 		for (let t = 0, n = e.length / 3; t < n; ++t) yield this.trianglePolygon(t);
 	}
 	trianglePolygon(e) {
-		let t = new Ke();
+		let t = new nt();
 		return this.renderTriangle(e, t), t.value();
 	}
 };
-function tt(e, t, n, r) {
+function dt(e, t, n, r) {
 	let i = e.length, a = new Float64Array(i * 2);
 	for (let o = 0; o < i; ++o) {
 		let i = e[o];
@@ -2738,20 +2866,20 @@ function tt(e, t, n, r) {
 	}
 	return a;
 }
-function* nt(e, t, n, r) {
+function* ft(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 rt(e, t, n, r) {
+function pt(e, t, n, r) {
 	return 1 + (e[t][0] === 0 || e[n][0] === 0 || e[r][0] === 0 ? 1 : 0);
 }
-function it(e, t, n, r, i, a) {
+function mt(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 at(e) {
+function ht(e) {
 	if (!e || e.length < 3) return [];
 	let t = /* @__PURE__ */ new Set(), n = [];
 	for (let r of e) {
@@ -2759,12 +2887,12 @@ function at(e) {
 		t.has(e) || (t.add(e), n.push(r));
 	}
 	if (n.length < 3) return [];
-	let { triangles: r } = new et(Float64Array.from(n.flat()));
+	let { triangles: r } = new ut(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 (it(c, l, u, d, f, p) <= 1 / rt(n, t, o, s)) for (let [e, n] of [
+		if (mt(c, l, u, d, f, p) <= 1 / pt(n, t, o, s)) for (let [e, n] of [
 			[t, o],
 			[o, s],
 			[s, t]
@@ -2789,7 +2917,7 @@ function at(e) {
 }
 //#endregion
 //#region node_modules/three/examples/jsm/math/OBB.js
-var K = {
+var q = {
 	c: null,
 	u: [
 		new d(),
@@ -2797,7 +2925,7 @@ var K = {
 		new d()
 	],
 	e: []
-}, q = {
+}, J = {
 	c: null,
 	u: [
 		new d(),
@@ -2805,15 +2933,15 @@ var K = {
 		new d()
 	],
 	e: []
-}, J = [
+}, Y = [
 	[],
 	[],
 	[]
-], Y = [
+], X = [
 	[],
 	[],
 	[]
-], X = [], ot = new d(), st = new d(), ct = new d(), Z = new d(), lt = new d(), ut = new d(), Q = new a(), dt = new t(), ft = new o(), pt = new o(), mt = new l(), ht = class {
+], 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 {
 	constructor(e = new d(), t = new d(), n = new a()) {
 		this.center = e, this.halfSize = t, this.rotation = n;
 	}
@@ -2831,43 +2959,43 @@ var K = {
 	}
 	clampPoint(e, t) {
 		let n = this.halfSize;
-		Z.subVectors(e, this.center), this.rotation.extractBasis(ot, st, ct), t.copy(this.center);
-		let r = i.clamp(Z.dot(ot), -n.x, n.x);
-		t.add(ot.multiplyScalar(r));
-		let a = i.clamp(Z.dot(st), -n.y, n.y);
-		t.add(st.multiplyScalar(a));
-		let o = i.clamp(Z.dot(ct), -n.z, n.z);
-		return t.add(ct.multiplyScalar(o)), t;
+		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;
 	}
 	containsPoint(e) {
-		return Z.subVectors(e, this.center), this.rotation.extractBasis(ot, st, ct), Math.abs(Z.dot(ot)) <= this.halfSize.x && Math.abs(Z.dot(st)) <= this.halfSize.y && Math.abs(Z.dot(ct)) <= this.halfSize.z;
+		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;
 	}
 	intersectsBox3(e) {
-		return this.intersectsOBB(gt.fromBox3(e));
+		return this.intersectsOBB(Dt.fromBox3(e));
 	}
 	intersectsSphere(e) {
-		return this.clampPoint(e.center, ut), ut.distanceToSquared(e.center) <= e.radius * e.radius;
+		return this.clampPoint(e.center, bt), bt.distanceToSquared(e.center) <= e.radius * e.radius;
 	}
 	intersectsOBB(e, t = 2 ** -52) {
-		K.c = this.center, K.e[0] = this.halfSize.x, K.e[1] = this.halfSize.y, K.e[2] = this.halfSize.z, this.rotation.extractBasis(K.u[0], K.u[1], K.u[2]), q.c = e.center, q.e[0] = e.halfSize.x, q.e[1] = e.halfSize.y, q.e[2] = e.halfSize.z, e.rotation.extractBasis(q.u[0], q.u[1], q.u[2]);
-		for (let e = 0; e < 3; e++) for (let t = 0; t < 3; t++) J[e][t] = K.u[e].dot(q.u[t]);
-		Z.subVectors(q.c, K.c), X[0] = Z.dot(K.u[0]), X[1] = Z.dot(K.u[1]), X[2] = Z.dot(K.u[2]);
-		for (let e = 0; e < 3; e++) for (let n = 0; n < 3; n++) Y[e][n] = Math.abs(J[e][n]) + t;
+		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]);
+		for (let e = 0; e < 3; e++) for (let t = 0; t < 3; t++) Y[e][t] = q.u[e].dot(J.u[t]);
+		Q.subVectors(J.c, q.c), Z[0] = Q.dot(q.u[0]), Z[1] = Q.dot(q.u[1]), Z[2] = Q.dot(q.u[2]);
+		for (let e = 0; e < 3; e++) for (let n = 0; n < 3; n++) X[e][n] = Math.abs(Y[e][n]) + t;
 		let n, r;
-		for (let e = 0; e < 3; e++) if (n = K.e[e], r = q.e[0] * Y[e][0] + q.e[1] * Y[e][1] + q.e[2] * Y[e][2], Math.abs(X[e]) > n + r) return !1;
-		for (let e = 0; e < 3; e++) if (n = K.e[0] * Y[0][e] + K.e[1] * Y[1][e] + K.e[2] * Y[2][e], r = q.e[e], Math.abs(X[0] * J[0][e] + X[1] * J[1][e] + X[2] * J[2][e]) > n + r) return !1;
-		return n = K.e[1] * Y[2][0] + K.e[2] * Y[1][0], r = q.e[1] * Y[0][2] + q.e[2] * Y[0][1], !(Math.abs(X[2] * J[1][0] - X[1] * J[2][0]) > n + r || (n = K.e[1] * Y[2][1] + K.e[2] * Y[1][1], r = q.e[0] * Y[0][2] + q.e[2] * Y[0][0], Math.abs(X[2] * J[1][1] - X[1] * J[2][1]) > n + r) || (n = K.e[1] * Y[2][2] + K.e[2] * Y[1][2], r = q.e[0] * Y[0][1] + q.e[1] * Y[0][0], Math.abs(X[2] * J[1][2] - X[1] * J[2][2]) > n + r) || (n = K.e[0] * Y[2][0] + K.e[2] * Y[0][0], r = q.e[1] * Y[1][2] + q.e[2] * Y[1][1], Math.abs(X[0] * J[2][0] - X[2] * J[0][0]) > n + r) || (n = K.e[0] * Y[2][1] + K.e[2] * Y[0][1], r = q.e[0] * Y[1][2] + q.e[2] * Y[1][0], Math.abs(X[0] * J[2][1] - X[2] * J[0][1]) > n + r) || (n = K.e[0] * Y[2][2] + K.e[2] * Y[0][2], r = q.e[0] * Y[1][1] + q.e[1] * Y[1][0], Math.abs(X[0] * J[2][2] - X[2] * J[0][2]) > n + r) || (n = K.e[0] * Y[1][0] + K.e[1] * Y[0][0], r = q.e[1] * Y[2][2] + q.e[2] * Y[2][1], Math.abs(X[1] * J[0][0] - X[0] * J[1][0]) > n + r) || (n = K.e[0] * Y[1][1] + K.e[1] * Y[0][1], r = q.e[0] * Y[2][2] + q.e[2] * Y[2][0], Math.abs(X[1] * J[0][1] - X[0] * J[1][1]) > n + r) || (n = K.e[0] * Y[1][2] + K.e[1] * Y[0][2], r = q.e[0] * Y[2][1] + q.e[1] * Y[2][0], Math.abs(X[1] * J[0][2] - X[0] * J[1][2]) > n + r));
+		for (let e = 0; e < 3; e++) if (n = q.e[e], r = J.e[0] * X[e][0] + J.e[1] * X[e][1] + J.e[2] * X[e][2], Math.abs(Z[e]) > n + r) return !1;
+		for (let e = 0; e < 3; e++) if (n = q.e[0] * X[0][e] + q.e[1] * X[1][e] + q.e[2] * X[2][e], r = J.e[e], Math.abs(Z[0] * Y[0][e] + Z[1] * Y[1][e] + Z[2] * Y[2][e]) > n + r) return !1;
+		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(ot, st, ct);
-		let t = this.halfSize.x * Math.abs(e.normal.dot(ot)) + this.halfSize.y * Math.abs(e.normal.dot(st)) + this.halfSize.z * Math.abs(e.normal.dot(ct)), n = e.normal.dot(this.center) - e.constant;
+		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;
 		return Math.abs(n) <= t;
 	}
 	intersectRay(e, t) {
-		return this.getSize(lt), dt.setFromCenterAndSize(Z.set(0, 0, 0), lt), ft.setFromMatrix3(this.rotation), ft.setPosition(this.center), pt.copy(ft).invert(), mt.copy(e).applyMatrix4(pt), mt.intersectBox(dt, t) ? t.applyMatrix4(ft) : null;
+		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;
 	}
 	intersectsRay(e) {
-		return this.intersectRay(e, Z) !== null;
+		return this.intersectRay(e, Q) !== null;
 	}
 	fromBox3(e) {
 		return e.getCenter(this.center), e.getSize(this.halfSize).multiplyScalar(.5), this.rotation.identity(), this;
@@ -2876,12 +3004,12 @@ var K = {
 		return e.center.equals(this.center) && e.halfSize.equals(this.halfSize) && e.rotation.equals(this.rotation);
 	}
 	applyMatrix4(e) {
-		let t = e.elements, n = Z.set(t[0], t[1], t[2]).length(), r = Z.set(t[4], t[5], t[6]).length(), i = Z.set(t[8], t[9], t[10]).length();
-		e.determinant() < 0 && (n = -n), Q.setFromMatrix4(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);
 		let a = 1 / n, o = 1 / r, s = 1 / i;
-		return Q.elements[0] *= a, Q.elements[1] *= a, Q.elements[2] *= a, Q.elements[3] *= o, Q.elements[4] *= o, Q.elements[5] *= o, Q.elements[6] *= s, Q.elements[7] *= s, Q.elements[8] *= s, this.rotation.multiply(Q), this.halfSize.x *= n, this.halfSize.y *= r, this.halfSize.z *= i, Z.setFromMatrixPosition(e), this.center.add(Z), this;
+		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;
 	}
-}, gt = new ht(), $ = 6371008.8, _t = {
+}, Dt = new Et(), $ = 6371008.8, Ot = {
 	centimeters: $ * 100,
 	centimetres: $ * 100,
 	degrees: 360 / (2 * Math.PI),
@@ -2898,60 +3026,60 @@ var K = {
 	radians: 1,
 	yards: $ * 1.0936
 };
-function vt(e, t, n = {}) {
+function kt(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 yt(e, t, n = {}) {
+function At(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 (!Et(e[0]) || !Et(e[1])) throw Error("coordinates must contain numbers");
-	return vt({
+	if (!Lt(e[0]) || !Lt(e[1])) throw Error("coordinates must contain numbers");
+	return kt({
 		type: "Point",
 		coordinates: e
 	}, t, n);
 }
-function bt(e, t, n = {}) {
+function jt(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 vt({
+	return kt({
 		type: "Polygon",
 		coordinates: e
 	}, t, n);
 }
-function xt(e, t = "kilometers") {
-	let n = _t[t];
+function Mt(e, t = "kilometers") {
+	let n = Ot[t];
 	if (!n) throw Error(t + " units is invalid");
 	return e * n;
 }
-function St(e, t = "kilometers") {
-	let n = _t[t];
+function Nt(e, t = "kilometers") {
+	let n = Ot[t];
 	if (!n) throw Error(t + " units is invalid");
 	return e / n;
 }
-function Ct(e) {
+function Pt(e) {
 	return e % (2 * Math.PI) * 180 / Math.PI;
 }
-function wt(e) {
+function Ft(e) {
 	return e % 360 * Math.PI / 180;
 }
-function Tt(e, t = "kilometers", n = "kilometers") {
+function It(e, t = "kilometers", n = "kilometers") {
 	if (!(e >= 0)) throw Error("length must be a positive number");
-	return xt(St(e, t), n);
+	return Mt(Nt(e, t), n);
 }
-function Et(e) {
+function Lt(e) {
 	return !isNaN(e) && e !== null && !Array.isArray(e);
 }
-function Dt(e) {
+function Rt(e) {
 	return typeof e == "object" && !!e && !Array.isArray(e);
 }
 //#endregion
 //#region node_modules/@turf/meta/dist/esm/index.js
-function Ot(e, t, n) {
+function zt(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++) {
@@ -2997,7 +3125,7 @@ function Ot(e, t, n) {
 						}
 						break;
 					case "GeometryCollection":
-						for (r = 0; r < o.geometries.length; r++) if (Ot(o.geometries[r], t, n) === !1) return !1;
+						for (r = 0; r < o.geometries.length; r++) if (zt(o.geometries[r], t, n) === !1) return !1;
 						break;
 					default: throw Error("Unknown Geometry Type");
 				}
@@ -3005,13 +3133,13 @@ function Ot(e, t, n) {
 		}
 	}
 }
-function kt(e) {
+function Bt(e) {
 	var t = [];
-	return Ot(e, function(e) {
+	return zt(e, function(e) {
 		t.push(e);
 	}), t;
 }
-function At(e, t) {
+function Vt(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++) {
@@ -3037,15 +3165,15 @@ function At(e, t) {
 		f++;
 	}
 }
-function jt(e, t, n) {
+function Ht(e, t, n) {
 	var r = n;
-	return At(e, function(e, i, a, o, s) {
+	return Vt(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 Mt = /* @__PURE__ */ y(((e, t) => {
+var Ut = /* @__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() {
@@ -3262,13 +3390,13 @@ var Mt = /* @__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;
 	});
-})), Nt = /* @__PURE__ */ b({ default: () => Ft });
-function Pt(e, t) {
+})), Wt = /* @__PURE__ */ b({ default: () => Kt });
+function Gt(e, t) {
 	return e < t ? -1 : e > t ? 1 : 0;
 }
-var Ft, It = v((() => {
-	Ft = class {
-		constructor(e = [], t = Pt) {
+var Kt, qt = v((() => {
+	Kt = class {
+		constructor(e = [], t = Gt) {
 			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) {
@@ -3301,7 +3429,7 @@ var Ft, It = v((() => {
 			t[e] = i;
 		}
 	};
-})), Lt = /* @__PURE__ */ y(((e, t) => {
+})), Jt = /* @__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);
@@ -3311,7 +3439,7 @@ var Ft, It = v((() => {
 		}
 		return o;
 	};
-})), Rt = /* @__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);
@@ -3321,12 +3449,12 @@ var Ft, It = v((() => {
 		}
 		return o;
 	};
-})), zt = /* @__PURE__ */ y(((e, t) => {
-	var n = Lt(), r = Rt();
+})), Xt = /* @__PURE__ */ y(((e, t) => {
+	var n = Jt(), r = Yt();
 	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;
-})), Bt = /* @__PURE__ */ y(((e, t) => {
+})), Zt = /* @__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) {
@@ -3360,15 +3488,15 @@ var Ft, It = v((() => {
 				v = (O = (x = m - (b = (y = t * m) - (y - m))) * (C = F - (S = (y = t * F) - (y - F))) - ((D = m * F) - b * S - x * S - b * C)) - (w = O - (A = (x = h - (b = (y = t * h) - (y - h))) * (C = N - (S = (y = t * N) - (y - N))) - ((k = h * N) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j;
 				let R = n(4, i, 4, c, a);
 				v = (O = (x = M - (b = (y = t * M) - (y - M))) * (C = _ - (S = (y = t * _) - (y - _))) - ((D = M * _) - b * S - x * S - b * C)) - (w = O - (A = (x = P - (b = (y = t * P) - (y - P))) * (C = g - (S = (y = t * g) - (y - g))) - ((k = P * g) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j;
-				let ee = n(R, a, 4, c, o);
-				return v = (O = (x = m - (b = (y = t * m) - (y - m))) * (C = _ - (S = (y = t * _) - (y - _))) - ((D = m * _) - b * S - x * S - b * C)) - (w = O - (A = (x = h - (b = (y = t * h) - (y - h))) * (C = g - (S = (y = t * g) - (y - g))) - ((k = h * g) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j, s[n(ee, o, 4, c, s) - 1];
+				let z = n(R, a, 4, c, o);
+				return v = (O = (x = m - (b = (y = t * m) - (y - m))) * (C = _ - (S = (y = t * _) - (y - _))) - ((D = m * _) - b * S - x * S - b * C)) - (w = O - (A = (x = h - (b = (y = t * h) - (y - h))) * (C = g - (S = (y = t * g) - (y - g))) - ((k = h * g) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j, s[n(z, o, 4, c, s) - 1];
 			}(e, r, l, u, d, f, g);
 		}, e.orient2dfast = function(e, t, n, r, i, a) {
 			return (t - a) * (n - i) - (e - i) * (r - a);
 		}, Object.defineProperty(e, "__esModule", { value: !0 });
 	});
-})), Vt = /* @__PURE__ */ S((/* @__PURE__ */ y(((e, t) => {
-	var n = Mt(), r = (It(), C(Nt)), i = zt(), a = Bt().orient2d;
+})), Qt = /* @__PURE__ */ S((/* @__PURE__ */ y(((e, t) => {
+	var n = Ut(), r = (qt(), C(Wt)), i = Xt(), a = Zt().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;
@@ -3518,26 +3646,26 @@ var Ft, It = v((() => {
 		return r.pop(), t.pop(), t.concat(r);
 	}
 })))(), 1);
-function Ht(e, t = {}) {
+function $t(e, t = {}) {
 	t.concavity = t.concavity || Infinity;
 	let n = [];
-	if (Ot(e, (e) => {
+	if (zt(e, (e) => {
 		n.push([e[0], e[1]]);
 	}), !n.length) return null;
-	let r = (0, Vt.default)(n, t.concavity);
-	return r.length > 3 ? bt([r]) : null;
+	let r = (0, Qt.default)(n, t.concavity);
+	return r.length > 3 ? jt([r]) : null;
 }
 //#endregion
 //#region node_modules/@turf/centroid/dist/esm/index.js
-function Ut(e, t = {}) {
+function en(e, t = {}) {
 	let n = 0, r = 0, i = 0;
-	return Ot(e, function(e) {
+	return zt(e, function(e) {
 		n += e[0], r += e[1], i++;
-	}, !0), yt([n / i, r / i], t.properties);
+	}, !0), At([n / i, r / i], t.properties);
 }
 //#endregion
 //#region node_modules/@turf/invariant/dist/esm/index.js
-function Wt(e) {
+function tn(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];
@@ -3546,7 +3674,7 @@ function Wt(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 Gt(e) {
+function nn(e) {
 	if (Array.isArray(e)) return e;
 	if (e.type === "Feature") {
 		if (e.geometry !== null) return e.geometry.coordinates;
@@ -3555,23 +3683,23 @@ function Gt(e) {
 }
 //#endregion
 //#region node_modules/@turf/rhumb-bearing/dist/esm/index.js
-function Kt(e, t, n = {}) {
+function rn(e, t, n = {}) {
 	let r;
-	return r = n.final ? qt(Wt(t), Wt(e)) : qt(Wt(e), Wt(t)), r > 180 ? -(360 - r) : r;
+	return r = n.final ? an(tn(t), tn(e)) : an(tn(e), tn(t)), r > 180 ? -(360 - r) : r;
 }
-function qt(e, t) {
-	let n = wt(e[1]), r = wt(t[1]), i = wt(t[0] - e[0]);
+function an(e, t) {
+	let n = Ft(e[1]), r = Ft(t[1]), i = Ft(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 (Ct(Math.atan2(i, a)) + 360) % 360;
+	return (Pt(Math.atan2(i, a)) + 360) % 360;
 }
 //#endregion
 //#region node_modules/@turf/rhumb-distance/dist/esm/index.js
-function Jt(e, t, n = {}) {
-	let r = Wt(e), i = Wt(t);
-	return i[0] += i[0] - r[0] > 180 ? -360 : r[0] - i[0] > 180 ? 360 : 0, Tt(Yt(r, i), "meters", n.units);
+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 Yt(e, t, n) {
+function sn(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);
@@ -3580,37 +3708,37 @@ function Yt(e, t, n) {
 }
 //#endregion
 //#region node_modules/@turf/rhumb-destination/dist/esm/index.js
-function Xt(e, t, n, r = {}) {
-	let i = t < 0, a = Tt(Math.abs(t), r.units, "meters");
+function cn(e, t, n, r = {}) {
+	let i = t < 0, a = It(Math.abs(t), r.units, "meters");
 	i && (a = -Math.abs(a));
-	let o = Wt(e), s = Zt(o, a, n);
-	return s[0] += s[0] - o[0] > 180 ? -360 : o[0] - s[0] > 180 ? 360 : 0, yt(s, r.properties);
+	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);
 }
-function Zt(e, t, n, r) {
+function ln(e, t, n, r) {
 	r = r === void 0 ? $ : Number(r);
-	let i = t / r, a = e[0] * Math.PI / 180, o = wt(e[1]), s = wt(n), c = i * Math.cos(s), l = o + c;
+	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;
 	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 Qt(e) {
+function un(e) {
 	if (!e) throw Error("geojson is required");
 	switch (e.type) {
-		case "Feature": return $t(e);
-		case "FeatureCollection": return tn(e);
+		case "Feature": return dn(e);
+		case "FeatureCollection": return pn(e);
 		case "Point":
 		case "LineString":
 		case "Polygon":
 		case "MultiPoint":
 		case "MultiLineString":
 		case "MultiPolygon":
-		case "GeometryCollection": return nn(e);
+		case "GeometryCollection": return mn(e);
 		default: throw Error("unknown GeoJSON type");
 	}
 }
-function $t(e) {
+function dn(e) {
 	let t = { type: "Feature" };
 	return Object.keys(e).forEach((n) => {
 		switch (n) {
@@ -3619,16 +3747,16 @@ function $t(e) {
 			case "geometry": return;
 			default: t[n] = e[n];
 		}
-	}), t.properties = en(e.properties), e.geometry == null ? t.geometry = null : t.geometry = nn(e.geometry), t;
+	}), t.properties = fn(e.properties), e.geometry == null ? t.geometry = null : t.geometry = mn(e.geometry), t;
 }
-function en(e) {
+function fn(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] = en(r) : t[n] = r;
+		typeof r == "object" ? r === null ? t[n] = null : Array.isArray(r) ? t[n] = r.map((e) => e) : t[n] = fn(r) : t[n] = r;
 	}), t;
 }
-function tn(e) {
+function pn(e) {
 	let t = { type: "FeatureCollection" };
 	return Object.keys(e).forEach((n) => {
 		switch (n) {
@@ -3636,44 +3764,44 @@ function tn(e) {
 			case "features": return;
 			default: t[n] = e[n];
 		}
-	}), t.features = e.features.map((e) => $t(e)), t;
+	}), t.features = e.features.map((e) => dn(e)), t;
 }
-function nn(e) {
+function mn(e) {
 	let t = { type: e.type };
-	return e.bbox && (t.bbox = e.bbox), e.type === "GeometryCollection" ? (t.geometries = e.geometries.map((e) => nn(e)), t) : (t.coordinates = rn(e.coordinates), t);
+	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);
 }
-function rn(e) {
+function hn(e) {
 	let t = e;
-	return typeof t[0] == "object" ? t.map((e) => rn(e)) : t.slice();
+	return typeof t[0] == "object" ? t.map((e) => hn(e)) : t.slice();
 }
 //#endregion
 //#region node_modules/@turf/transform-rotate/dist/esm/index.js
-function an(e, t, n) {
-	if (n ||= {}, !Dt(n)) throw Error("options is invalid");
+function gn(e, t, n) {
+	if (n ||= {}, !Rt(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 ?? Ut(e);
-	return (i === !1 || i === void 0) && (e = Qt(e)), Ot(e, function(e) {
-		let n = Kt(a, e) + t, r = Gt(Xt(a, Jt(a, e), n));
+	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));
 		e[0] = r[0], e[1] = r[1];
 	}), e;
 }
 //#endregion
 //#region node_modules/@turf/bearing/dist/esm/index.js
-function on(e, t, n = {}) {
-	if (n.final === !0) return sn(e, t);
-	let r = Wt(e), i = Wt(t), a = wt(r[0]), o = wt(i[0]), s = wt(r[1]), c = wt(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 Ct(Math.atan2(l, u));
+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 sn(e, t) {
-	let n = on(t, e);
+function vn(e, t) {
+	let n = _n(t, e);
 	return n = (n + 180) % 360, n;
 }
 //#endregion
 //#region node_modules/@turf/bbox/dist/esm/index.js
-function cn(e, t = {}) {
+function yn(e, t = {}) {
 	if (e.bbox != null && !0 !== t.recompute) return e.bbox;
 	let n = [
 		Infinity,
@@ -3681,17 +3809,17 @@ function cn(e, t = {}) {
 		-Infinity,
 		-Infinity
 	];
-	return Ot(e, (e) => {
+	return zt(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 ln(e, t = {}) {
+function bn(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 bt([[
+	return jt([[
 		o,
 		[i, r],
 		[i, a],
@@ -3704,20 +3832,20 @@ function ln(e, t = {}) {
 }
 //#endregion
 //#region node_modules/@turf/envelope/dist/esm/index.js
-function un(e) {
-	return ln(cn(e));
+function xn(e) {
+	return bn(yn(e));
 }
 //#endregion
 //#region node_modules/@turf/area/dist/esm/index.js
-function dn(e) {
-	return jt(e, (e, t) => e + fn(t), 0);
+function Sn(e) {
+	return Ht(e, (e, t) => e + Cn(t), 0);
 }
-function fn(e) {
+function Cn(e) {
 	let t = 0, n;
 	switch (e.type) {
-		case "Polygon": return pn(e.coordinates);
+		case "Polygon": return wn(e.coordinates);
 		case "MultiPolygon":
-			for (n = 0; n < e.coordinates.length; n++) t += pn(e.coordinates[n]);
+			for (n = 0; n < e.coordinates.length; n++) t += wn(e.coordinates[n]);
 			return t;
 		case "Point":
 		case "MultiPoint":
@@ -3726,57 +3854,57 @@ function fn(e) {
 	}
 	return 0;
 }
-function pn(e) {
+function wn(e) {
 	let t = 0;
 	if (e && e.length > 0) {
-		t += Math.abs(gn(e[0]));
-		for (let n = 1; n < e.length; n++) t -= Math.abs(gn(e[n]));
+		t += Math.abs(Dn(e[0]));
+		for (let n = 1; n < e.length; n++) t -= Math.abs(Dn(e[n]));
 	}
 	return t;
 }
-var mn = $ * $ / 2, hn = Math.PI / 180;
-function gn(e) {
+var Tn = $ * $ / 2, En = Math.PI / 180;
+function Dn(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] * hn, c = a[1] * hn, l = o[0] * hn;
+		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;
 		n += (l - s) * Math.sin(c), r++;
 	}
-	return n * mn;
+	return n * Tn;
 }
 //#endregion
 //#region node_modules/geojson-minimum-bounding-rectangle/dist/index.js
-function _n(e) {
-	let t = Ht(e);
+function On(e) {
+	let t = $t(e);
 	if (!t) throw Error("Can't calculate smallestSurroundingRectangleByArea for given geometry");
-	let n = Ut(t), r = kt(t), i = 2 ** 53 - 1, a = null;
+	let n = en(t), r = Bt(t), i = 2 ** 53 - 1, a = null;
 	for (let e = 0; e < r.length - 1; e++) {
-		let o = on(r[e], r[e + 1]), s = un(an(t, -1 * o, { pivot: n })), c = dn(s);
-		c < i && (i = c, a = an(s, o, { pivot: n }));
+		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 }));
 	}
 	return a;
 }
 //#endregion
 //#region src/utils/OBB.mjs
-function vn(e, t) {
+function kn(e, t) {
 	let n = t[0] - e[0], r = t[1] - e[1];
 	return Math.sqrt(n * n + r * r);
 }
-function yn(e) {
+function An(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 bn = class t extends ht {
+var jn = class t extends Et {
 	getBoxMesh() {
-		xn.identity(), xn.setFromMatrix3(this.rotation), xn.decompose(Tn, Sn, new e.Vector3());
+		Mn.identity(), Mn.setFromMatrix3(this.rotation), Mn.decompose(In, Nn, 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(Sn), n;
+		return n.position.copy(this.center), n.rotation.setFromQuaternion(Nn), n;
 	}
 	getBoxEdge(t = 16776960) {
 		let n = this.getBoxMesh();
-		En.setFromObject(n);
+		Ln.setFromObject(n);
 		let r = new e.EdgesGeometry(n.geometry.clone().applyMatrix4(n.matrixWorld));
 		return new e.LineSegments(r, new e.LineBasicMaterial({
 			color: t,
@@ -3784,33 +3912,33 @@ var bn = class t extends ht {
 		}));
 	}
 	toJson() {
-		return xn.identity(), xn.setFromMatrix3(this.rotation), xn.decompose(Tn, Sn, new e.Vector3()), {
+		return Mn.identity(), Mn.setFromMatrix3(this.rotation), Mn.decompose(In, Nn, new e.Vector3()), {
 			size: this.halfSize.toArray(),
 			center: this.center.toArray(),
-			quaternion: Sn.toArray()
+			quaternion: Nn.toArray()
 		};
 	}
 	static from(n, r, i, a = new t()) {
-		if (i instanceof e.Euler) Sn.setFromEuler(i);
-		else if (i instanceof e.Quaternion) Sn.copy(i);
+		if (i instanceof e.Euler) Nn.setFromEuler(i);
+		else if (i instanceof e.Quaternion) Nn.copy(i);
 		else throw Error("传入的旋转不是欧拉角或者四元数");
-		return xn.compose(r, Sn, wn), a.center.copy(r), a.halfSize.copy(n.multiplyScalar(.5)), a.rotation.setFromMatrix4(xn), a;
+		return Mn.compose(r, Nn, Fn), a.center.copy(r), a.halfSize.copy(n.multiplyScalar(.5)), a.rotation.setFromMatrix4(Mn), a;
 	}
 	static fromByPath2D(e, n, r, i = new t()) {
-		let a = _n({
+		let a = On({
 			type: "Polygon",
 			coordinates: [e.map((e) => [e.x, e.y])]
 		});
 		if (!a) throw Error("2d obb 获取失败");
-		let o = a.geometry.coordinates[0], s = vn(o[0], o[1]), c = vn(o[1], o[2]), l = Math.atan2(o[1][1] - o[0][1], o[1][0] - o[0][0]);
-		Tn.set(s, c, r), Cn.set(0, 0, l);
-		let [u, d] = yn(o);
-		return n.x = u, n.y = d, this.from(Tn, n, Cn, i);
+		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);
 	}
-}, xn = new e.Matrix4(), Sn = new e.Quaternion(), Cn = new e.Euler(), wn = new e.Vector3(1, 1, 1), Tn = new e.Vector3(), En = new e.Box3();
+}, 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();
 //#endregion
 //#region src/pointCloudProcessing/mergeMeaning.mjs
-function Dn(e, t, n = .005, r = .2) {
+function Rn(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) {
@@ -3839,26 +3967,26 @@ function Dn(e, t, n = .005, r = .2) {
 	}
 	return c / e.length;
 }
-function On(e, t, n = .5) {
+function zn(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 kn(e, t, n, r) {
+function Bn(e, t, n, r) {
 	if (e.intersectsOBB(t)) return !0;
 	{
-		let i = jn(e, r), a = jn(t, n);
+		let i = Hn(e, r), a = Hn(t, n);
 		if (i || a) return !0;
 	}
 	return !1;
 }
-function An(t, n) {
+function Vn(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 jn(e, t) {
+function Hn(e, t) {
 	let n = !0;
 	for (let r = 0; r < t.length; r++) if (!e.containsPoint(t[r])) {
 		n = !1;
@@ -3866,7 +3994,7 @@ function jn(e, t) {
 	}
 	return n;
 }
-function Mn(e) {
+function Un(e) {
 	if (e.length === 0) return {
 		x: 0,
 		y: 0,
@@ -3884,52 +4012,85 @@ function Mn(e) {
 		h: r - i
 	};
 }
-function Nn(t, n, r, i) {
+function Wn(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 = bn.fromByPath2D(a, n, r);
+	let o = jn.fromByPath2D(a, n, r);
 	return o.center.z = i, o;
 }
-var Pn = (t) => {
+var Gn = (t) => {
 	if (t.length == 0) return [];
-	let n = [];
-	for (let r = 0; r < t.length; r++) {
-		let i = t[r].points.map((e) => [e.x, e.y]), a = Mn(t[r].points), o = t[r].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"), 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" || l === "floor" || l === "roof") continue;
-		let u = [];
-		for (let n = 0; n < t[r].points.length; n++) u.push(new e.Vector3(t[r].points[n].x, t[r].points[n].y, t[r].points[n].z));
-		let d = {
-			points: u,
-			path: at(i),
-			h: a.h,
-			minz: a.minz,
-			maxz: a.maxz,
+	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 n = /* @__PURE__ */ new Map();
+			for (let e = 0; e < t[i].points.length; e++) {
+				let r = t[i].points[e].z;
+				if (r = Math.floor(r * 10) / 10, n.has(r)) {
+					let a = n.get(r);
+					a.num += 1, a.points.push(t[i].points[e]), n.set(r, a);
+				} else n.set(r, {
+					num: 1,
+					points: [t[i].points[e]]
+				});
+			}
+			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];
+		}
+		let p = {
+			points: d,
+			path: ht(a),
+			h: o.h,
+			minz: o.minz,
+			maxz: o.maxz,
 			center: {
-				x: a.x,
-				y: a.y,
-				z: a.z
+				x: o.x,
+				y: o.y,
+				z: o.z
 			},
-			obj_id: t[r].obj_id,
-			type: l,
-			averagePz: t[r].averagePz,
+			obj_id: t[i].obj_id,
+			type: u,
+			averagePz: t[i].averagePz,
 			obb: null,
 			isDel: !1,
-			obj_id: o,
-			positionArr: [t[r].position]
+			obj_id: s,
+			positionArr: [t[i].position]
 		};
-		if (d.obb = Nn(d.path, d.center, d.h, (d.maxz + d.minz) / 2), d.obb == null) continue;
-		let f = -1;
-		for (let e = 0; e < n.length; e++) if (n[e].type == l) {
-			f = e;
+		if (p.obb = Wn(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) {
+			m = e;
+			break;
+		}
+		if (m == -1 ? n.push({
+			type: u,
+			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, {
+			num: p.points.length,
+			datas: [p]
+		});
+	}
+	if (r.size > 0) {
+		let e = [];
+		for (let [t, n] of r.entries()) {
+			let { num: t, datas: r } = n;
+			t > 3e3 && e.push(...r);
+		}
+		for (let t = 0; t < n.length; t++) if (n[t].type == "floor") {
+			n[t].array = e;
 			break;
 		}
-		f == -1 ? n.push({
-			type: l,
-			array: [d]
-		}) : n[f].array.push(d);
 	}
 	for (let e = 0; e < n.length; e++) {
 		let t = n[e].array, r = [], i = [];
@@ -3940,13 +4101,13 @@ var Pn = (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 = at(n.points.map((e) => [e.x, e.y]));
-				let a = Mn(n.points);
+				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);
 				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 = Nn(n.path, n.center, n.h, (n.maxz + n.minz) / 2), n.positionArr.push(...t[i].positionArr), i = e;
+				}, n.obb = Wn(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));
 		}
@@ -3955,7 +4116,9 @@ var Pn = (t) => {
 		a.push(...i), n[e].array = a;
 	}
 	for (let t = 0; t < n.length; t++) {
-		let r = n[t].type, i = n[t].array;
+		let r = n[t].type;
+		if (r === "people" || r === "floor") continue;
+		let i = n[t].array;
 		for (let a = 0; a < i.length; a++) {
 			let o = i[a].obb, s = i[a].minz;
 			i[a].maxz;
@@ -3974,74 +4137,61 @@ var Pn = (t) => {
 				}
 			}
 			if (!i[a].isDel) for (let e = t + 1; e < n.length; e++) {
-				let t = n[e].type, l = n[e].array;
+				let t = n[e].type;
+				if (t === "people" || t === "floor") continue;
+				let l = n[e].array;
 				for (let e = 0; e < l.length; e++) {
 					if (l[e].isDel) continue;
 					let n = l[e].obb, u = l[e].minz;
 					if (l[e].maxz, o.intersectsOBB(n)) {
-						On(l[e].points, o);
-						let d = On(i[a].points, n), f = An(o, n);
+						zn(l[e].points, o);
+						let d = zn(i[a].points, n), f = Vn(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" && containsObb(o, l[e].points)) {
+								if (t === "balcony railing" && Hn(o, l[e].points)) {
 									l[e].isDel = !0;
 									continue;
 								}
-								if (t === "balcony railing" && containsObb(n, i[a].points)) {
+								if (t === "balcony railing" && Hn(n, i[a].points)) {
 									i[a].isDel = !0;
 									break;
 								}
-								if (t === "balcony railing" && kn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(u - c) > .3)) {
+								if (t === "balcony railing" && Bn(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" && containsObb(o, l[e].points)) {
+								if (t === "window" && Hn(o, l[e].points)) {
 									l[e].isDel = !0;
 									continue;
 								}
-								if (t === "window" && containsObb(n, i[a].points)) {
+								if (t === "window" && Hn(n, i[a].points)) {
 									i[a].isDel = !0;
 									break;
 								}
-								if (t === "window" && kn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(s - c) > .3)) {
+								if (t === "window" && Bn(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), Dn(p, f, .03, .5) > .5) {
-								if (t === "people") {
-									l[e].isDel = !0;
-									continue;
-								} else if (r === "people") {
-									i[a].isDel = !0;
-									break;
-								}
-								if (d) l[e].isDel = !0;
-								else {
-									i[a].isDel = !0;
-									break;
-								}
-							} else if (kn(o, n)) {
-								if (t === "people") {
-									l[e].isDel = !0;
-									continue;
-								} else if (r === "people") {
-									i[a].isDel = !0;
-									break;
-								}
-								let s = An(o, n);
+							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;
+							else {
+								i[a].isDel = !0;
+								break;
+							}
+							else if (Bn(o, n)) {
+								let s = Vn(o, n);
 								if (s === 1 || s === 0) {
 									if (t === "switch") continue;
-									On(p, o) >= .5 && (l[e].isDel = !0);
+									zn(p, o) >= .5 && (l[e].isDel = !0);
 								} else {
 									if (r === "switch") continue;
-									if (On(p, n) >= .5) {
+									if (zn(p, n) >= .5) {
 										i[a].isDel = !0;
 										break;
 									}
@@ -4070,29 +4220,29 @@ var Pn = (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 === "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));
 		}
 	}
 	for (let e = 0; e < n.length; e++) n[e].array = n[e].array.filter((e) => !e.isDel);
-	let r = [];
+	let i = [];
 	for (let t = 0; t < n.length; t++) {
-		let i = n[t].array;
-		for (let t = 0; t < i.length; t++) r.push({
-			obbBox: i[t].obb,
-			box: new e.Box3().setFromPoints(i[t].points),
-			category: i[t].type,
+		let r = n[t].array;
+		for (let t = 0; t < r.length; t++) i.push({
+			obbBox: r[t].obb,
+			box: new e.Box3().setFromPoints(r[t].points),
+			category: r[t].type,
 			center: {
-				x: i[t].center.x,
-				y: i[t].center.y,
-				z: (i[t].minz + i[t].maxz) / 2
+				x: r[t].center.x,
+				y: r[t].center.y,
+				z: (r[t].minz + r[t].maxz) / 2
 			},
-			name: i[t].obj_id,
-			obj_id: i[t].obj_id,
-			pcdPoints: i[t].points,
-			positionArr: i[t].positionArr
+			name: r[t].obj_id,
+			obj_id: r[t].obj_id,
+			pcdPoints: r[t].points,
+			positionArr: r[t].positionArr
 		});
 	}
-	return r;
+	return i;
 };
 //#endregion
-export { R as classifySegments, he as getAllGeometry, _e as getBeamLine, ye as getColLine, ve as getMainBeamLine, Pn as getMergeMeaning, F as getParallelism, re as getPointCloudMinMax, z as getPointCoverageOnQuad, A as isParallel, I as perpendicularInfo, ae as removeNoisePoints, D as segmentsIntersect2D, ge as usegetBeamLine };
+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 };