rm-graphical-computing 1.0.38 → 1.0.40

package/dist/index.js

@@ -420,9 +420,9 @@ var N = 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,
@@ -431,17 +431,17 @@ var N = 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 ne = (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);
@@ -462,8 +462,8 @@ var ne = (t, n, r, i = .05, a = .02) => {
 		quadArea: O,
 		coveredArea: k
 	};
-}, re = (e, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(e)))), ie = (t) => {
-	let n = new e.Vector3(t.start.x, t.start.y, t.start.z), r = new e.Vector3(t.end.x, t.end.y, t.end.z), i = n.distanceTo(r), a = t.rooftopPz - t.start.z, o = re(i, 100), s = re(a, 70), c = a / s, l = /* @__PURE__ */ new Map();
+}, ne = (e, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(e)))), re = (t) => {
+	let n = new e.Vector3(t.start.x, t.start.y, t.start.z), r = new e.Vector3(t.end.x, t.end.y, t.end.z), i = n.distanceTo(r), a = t.rooftopPz - t.start.z, o = ne(i, 100), s = ne(a, 70), c = a / s, l = /* @__PURE__ */ new Map();
 	for (let e = 0; e < s; e++) l.set((e + 1) * c, {
 		count: 0,
 		minZ: Infinity,
@@ -490,7 +490,7 @@ var ne = (t, n, r, i = .05, a = .02) => {
 		minZ: p,
 		maxZ: m
 	};
-}, ae = (t, n, r) => {
+}, ie = (t, n, r) => {
 	let i = new e.Plane(), a = new e.Vector3(t.x, t.y, t.z), o = new e.Vector3(n.x, n.y, n.z), s = new e.Vector3(n.x, n.y, n.z + 5);
 	i.setFromCoplanarPoints(a, o, s);
 	let c = [], l = [];
@@ -508,7 +508,7 @@ var ne = (t, n, r, i = .05, a = .02) => {
 		newProjectPoints: h,
 		newOnLinePoints: m
 	};
-}, oe = (t) => {
+}, ae = (t) => {
 	function n(t, n, r, i, a, o, s, c, l) {
 		let u = new e.Line3(t, n), d = /* @__PURE__ */ new Map(), f = new e.Vector3(), p = t.clone(), m = n.clone(), h = 0;
 		for (;;) {
@@ -560,44 +560,49 @@ var ne = (t, n, r, i = .05, a = .02) => {
 		o / 2;
 		let b = l * u / (a * o);
 		n(p, g, _, a, y, f, d, b, i), n(m, h, v, a, y, f, d, b, i), i.start = p, i.end = m;
-		let { newOriginalPoints: x } = ae(p, m, i.originalPoints);
+		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)), se = (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;
-}, ce = (e) => {
+}, se = (e) => {
 	let t = 0, n = [];
 	for (let r = 0; r < e.length; r++) for (let i = r + 1; i < e.length; i++) {
 		let a = e[r].distanceTo(e[i]);
 		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, le = (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);
 	}), t.forEach((t) => {
-		e.remove(t), de(t);
+		e.remove(t), ue(t);
 	});
-}, ue = () => `#${Math.floor(Math.random() * 75 + 180).toString(16).padStart(2, "0")}${Math.floor(Math.random() * 75 + 180).toString(16).padStart(2, "0")}${Math.floor(Math.random() * 75 + 180).toString(16).padStart(2, "0")}`;
-function de(e) {
+}, le = () => `#${Math.floor(Math.random() * 75 + 180).toString(16).padStart(2, "0")}${Math.floor(Math.random() * 75 + 180).toString(16).padStart(2, "0")}${Math.floor(Math.random() * 75 + 180).toString(16).padStart(2, "0")}`;
+function ue(e) {
 	for (; e.children && e.children.length > 0;) {
 		let t = e.children[0];
-		e.remove(t), de(t);
+		e.remove(t), ue(t);
 	}
-	e.geometry && e.geometry.dispose(), e.material && (Array.isArray(e.material) ? e.material.forEach((e) => fe(e)) : fe(e.material));
+	e.geometry && e.geometry.dispose(), e.material && (Array.isArray(e.material) ? e.material.forEach((e) => de(e)) : de(e.material));
 }
-function fe(e) {
+function de(e) {
 	for (let t of Object.keys(e)) {
 		let n = e[t];
 		n && typeof n == "object" && typeof n.dispose == "function" && n.dispose();
 	}
 	e.dispose();
 }
-//#endregion
-//#region src/geometry/handleWallSegment.mjs
-var pe = class {
+var fe = (e, t = .001) => {
+	let n = /* @__PURE__ */ new Map(), r = [];
+	for (let i of e) {
+		let e = `${Math.round(i.x / t)},${Math.round(i.y / t)},${Math.round(i.z / t)}`;
+		n.has(e) || (n.set(e, !0), r.push(i));
+	}
+	return r;
+}, pe = class {
 	results;
 	clusterResults;
 	constructor() {
@@ -1087,7 +1092,7 @@ var pe = class {
 		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 (V(n, a[e], .01)) {
+			for (let e = 0; e < a.length; e++) if (H(n, a[e], .01)) {
 				r = !0;
 				break;
 			}
@@ -1108,7 +1113,7 @@ var pe = class {
 		});
 		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: ue(),
+			color: le(),
 			size: .02
 		})));
 		let [_, v] = Ee(p, {
@@ -1237,7 +1242,7 @@ function Ee(e, t = {}) {
 //#endregion
 //#region src/geometry/beamLine.mjs
 var De = async (t, n, r, i) => {
-	le(i);
+	ce(i);
 	let a = await fetch(t);
 	if (!a) return;
 	let o = await a.json(), s = new e.Group(), c = new e.Group(), l = new e.Group(), u = new e.Group(), d = new e.Group(), f = new e.Group(), p = new e.Group(), m = new e.Group();
@@ -1331,7 +1336,7 @@ var De = async (t, n, r, i) => {
 		});
 		let r = new e.BufferGeometry();
 		r.setAttribute("position", new e.BufferAttribute(n, 3)), r.rotateX(-Math.PI / 2), c.add(new e.Points(r, new e.PointsMaterial({
-			color: ue(),
+			color: le(),
 			size: .02
 		})));
 		let i = [];
@@ -1421,7 +1426,7 @@ var De = async (t, n, r, i) => {
 		lineIndexGroup: m
 	};
 }, Oe = async (t, n, r, i) => {
-	if (oe(t, i), t.length <= 0 || n.length <= 0) return t;
+	if (ae(t, i), t.length <= 0 || n.length <= 0) return t;
 	r ||= [];
 	for (let n of t) {
 		let t = [];
@@ -1559,170 +1564,137 @@ var De = async (t, n, r, i) => {
 		a.doorAndBeamData = [], a.completePointAreaPercentage = -1;
 		let o = new e.Box3();
 		o.setFromPoints(a.originalPoints);
-		let m = o.max.z, h = o.min.z, g = new e.Vector3(a.start.x, a.start.y, a.start.z), _ = new e.Vector3(a.end.x, a.end.y, a.end.z), v = a.rooftopPz - a.start.z, y = 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: b, boxArea: x, totalInPlaneNum: S } = F(o.points, o.gridWidth, o.gridHeight, o.centerPts);
-			if (!b || b.length <= 0) continue;
-			b[0].distanceTo(b[1]);
-			let C = b[0].distanceTo(b[3]), w = o.gridHeight * (C / o.gridHeight / 3 * 2) + o.gridHeight / 2, T = new e.Vector3(b[0].x, b[0].y, b[0].z + w), E = new e.Vector3(b[1].x, b[1].y, b[1].z + w), D = new e.Line3(T, E), k = [], A = 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) => {
-				D.closestPointToPoint(e, !0, A).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 P = [];
-			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 = ce(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, b[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, b[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, b[2].z)), n.facePoints.push(new e.Vector3(r[0].x, r[0].y, b[2].z)), P.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));
 			}
-			y += o.area;
-			let ee = 0;
-			if (S != 0 && (ee = o.gridHeight * o.gridWidth * S), (o.area - ee) / x * 100 > 70 && P.length == 1 || P.length > 1) for (let y = 0; y < P.length; y++) {
-				let b = P[y], 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 || m < b.facePoints[2].z || w > v / 3 * 2) continue;
-				let T = !1, E = !1, D = !1, k = [], A = b.facePoints[2].clone(), M = b.facePoints[3].clone(), N = b.facePoints[0].clone(), F = b.facePoints[1].clone(), ee = !1, te = -1;
-				if (Math.abs(b.facePoints[0].z - a.start.z) < .25) {
-					if (x > .17 && a.length > .5) {
-						let n = B(g, N), r = B(g, F), o = B(_, N), s = B(_, F), 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 } = ae(N, F, a.originalPoints), o = [], s = [];
+							let { newOriginalPoints: r } = ie(M, P, a.originalPoints), o = [], s = [];
 							if (r.forEach((e) => {
-								e.z >= A.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 = O(r, o, a, c), m = L(r, o, a, c);
-									if (p != null) {
-										if (m && m.angle > 85) {
-											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 > 85) {
+									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 = 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(F.x, F.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 && a.length - x > .5) t[d].length > .25 && x + u > .5 && (ee = !0, n < c ? (M = M.addScaledVector(s, u), N = N.addScaledVector(s, u)) : (A = A.addScaledVector(s, u), F = F.addScaledVector(s, u)));
-								else if (!f) {
-									let r = .05, a = g.clone().addScaledVector(s, r), o = g.clone().addScaledVector(s.clone().negate(), r);
-									a.z = o.z = 0;
-									let l = !1;
-									for (let n = 0; n < t.length; n++) {
-										if (n == i) continue;
-										let s = 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), d = new e.Vector3().subVectors(c, s).normalize();
-										s = s.clone().addScaledVector(d.clone().negate(), r), c = c.clone().addScaledVector(d, r);
-										let f = O(a, o, s, c);
-										if (f) {
-											f.point.z = g.z;
-											let e = f.point.distanceTo(g);
-											if (f.point.distanceTo(_) < e) continue;
-											u > e && (u = e), l = !0;
-										}
-									}
-									if (!l) continue;
-									u != Infinity && u < 2 && (n < c ? (M = M.addScaledVector(s.clone().negate(), u), N = N.addScaledVector(s.clone().negate(), u)) : (A = A.addScaledVector(s.clone().negate(), u), F = F.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, 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 } = ae(N, F, 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 >= A.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 = O(n, r, o, c), m = L(n, r, o, c);
-									if (p != null) {
-										if (m && m.angle > 85 && (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 > 85) {
+									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 = 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(F.x, F.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 && a.length - x > .5) t[d].length > .25 && x + u > .5 && (ee = !0, o < c ? (M = M.addScaledVector(s, u), N = N.addScaledVector(s, u)) : (A = A.addScaledVector(s, u), F = F.addScaledVector(s, u)));
-								else if (!f) {
-									let n = .05, r = _.clone().addScaledVector(s, n), a = g.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 = O(r, a, s, c);
-										if (f) {
-											f.point.z = _.z;
-											let e = f.point.distanceTo(_);
-											if (f.point.distanceTo(g) < 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)) : (A = A.addScaledVector(s.clone().negate(), u), F = F.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(A);
+						b = A.distanceTo(k);
 					}
-					if (C < 85 && x > .31 || x > .7 && S > v - v / 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 (O(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 < 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(b.facePoints[0].x, b.facePoints[0].y, 0), c = new e.Vector3(b.facePoints[1].x, b.facePoints[1].y, 0), l = b.facePoints[2].z < s[t].maxZ || Math.abs(b.facePoints[2].z - s[t].maxZ) < .3;
-							if (Math.abs(b.facePoints[2].z - s[t].maxZ), l) {
+							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 = 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);
@@ -1732,169 +1704,173 @@ var De = async (t, n, r, i) => {
 											let e = o.distanceTo(i), t = c.distanceTo(i);
 											if (e > .2 && t > .2) continue;
 										}
-										E = !0, D = !0, k.push(s[t].index), s[t].isFind = !0, te = t, r[s[t].index].isFindBeam = !0;
+										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 ? (A = b.facePoints[2].clone().addScaledVector(d, f), M = b.facePoints[3].clone(), N = M.clone(), F = A.clone(), N.z = F.z = b.facePoints[0].z) : (A = b.facePoints[2].clone(), M = b.facePoints[3].clone().addScaledVector(d, f), N = M.clone(), F = A.clone(), N.z = F.z = b.facePoints[0].z);
+										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(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 = 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(), A = b.facePoints[2].clone().addScaledVector(p, m), M = b.facePoints[3].clone(), N = M.clone(), F = A.clone(), N.z = F.z = b.facePoints[0].z) : (A = b.facePoints[2].clone(), M = b.facePoints[3].clone().addScaledVector(p, m), N = M.clone(), F = A.clone(), N.z = F.z = b.facePoints[0].z);
+											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, D = !0, k.push(s[t].index), s[t].isFind = !0, r[s[t].index].isFindBeam = !0, te = t;
+										T = !0, E = !0, D.push(s[t].index), s[t].isFind = !0, r[s[t].index].isFindBeam = !0, B = t;
 									}
 								}
 							}
 						}
-						if (!D) for (let t = 0; t < s.length; 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(b.facePoints[0].x, b.facePoints[0].y, 0), o = new e.Vector3(b.facePoints[1].x, b.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, E = !0, s[t].isFind = !0, te = 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), 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 - v) > .1 && S > v / 2 && x > .3 && Math.abs(h - 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 < d.length; e++) {
-						let t = z(d[e].start, d[e].end, N, F);
+						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) {
-						te != -1 && (r[s[te].index].isFindBeam = !1, s[te].isFind = !1);
+						B != -1 && (r[s[B].index].isFindBeam = !1, s[B].isFind = !1);
 						continue;
 					}
 					d.push({
-						start: N,
-						end: F
+						start: M,
+						end: P
 					});
 					{
 						new e.PointsMaterial({
 							color: 65535,
 							size: .01
 						});
-						let t = new e.Vector3().subVectors(N, F), n = new e.Vector3().subVectors(F, N), r = Infinity, i = Infinity, o = N.clone(), s = F.clone(), c = [], l = [], u = new e.Line3(A, 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 > A.z) {
-								let i = u.closestPointToPoint(r, !0, d), a = new e.Vector3().subVectors(i, A), o = j(t, new e.Vector3().subVectors(i, M)), s = j(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 } = ae(N, F, 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, F), u = j(t, new e.Vector3().subVectors(c, N)), d = j(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(F);
+									let e = c.distanceTo(P);
 									e < i && (i = e, s = c);
 								}
 							});
 						}
-						if (o.equals(N) || (N = o, M = new e.Vector3(N.x, N.y, M.z)), s.equals(F) || (F = s, A = new e.Vector3(F.x, F.y, A.z)), l.length > 10) {
-							let { newOnLinePoints: e } = ae(M, A, 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);
 							}
-							A.z += f, M.z += f, S += f;
+							k.z += f, A.z += f, x += f;
 						}
 					}
-					let p = F.distanceTo(N);
-					if (p < .4 && !E || p < .3 && E) continue;
+					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: c,
-						beamStart: A,
-						beamEnd: M,
-						beamHeight: a.rooftopPz - A.z,
-						doorStart: N,
-						doorEnd: F,
-						doorHeight: S,
+						beamStart: k,
+						beamEnd: A,
+						beamHeight: a.rooftopPz - k.z,
+						doorStart: M,
+						doorEnd: P,
+						doorHeight: x,
 						nearId: -1,
 						type: m,
-						isExtend: ee,
-						isDoor: E,
-						isPullOutDoor: D,
-						pcbDoorIndexs: k
-					}, g = !1, _ = new e.Vector3(), v = new e.Vector3(), y = -1;
+						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 = I(A.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 = A.distanceTo(M), n = r.beamStart.distanceTo(r.beamEnd), i = new e.Line3(A.clone(), M.clone());
-							i.start.z = 0, i.end.z = 0;
-							let a = R(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 = R(A, M, !0));
-							let o = new e.Vector3(), s = i.closestPointToPoint(a, !0, o), l = s.distanceTo(a), u = new e.Vector3().subVectors(a, s).normalize(), d = u.clone().negate(), f = a.clone().addScaledVector(d, l + .1), p = O(i.start, i.end, a, f), m = !E && !r.isDoor && (t > n * 2 || n > t * 2);
-							if (l < .4 && p != null && !m) {
+							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 = A.clone().addScaledVector(d, l), r.beamEnd = M.clone().addScaledVector(d, l), r.doorStart = N.clone().addScaledVector(d, l), r.doorEnd = F.clone().addScaledVector(d, l), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : !D || D && r.isPullOutDoor && i ? (h.beamStart = r.beamStart.clone().addScaledVector(u, l), h.beamEnd = r.beamEnd.clone().addScaledVector(u, l), h.doorStart = r.doorStart.clone().addScaledVector(u, l), h.doorEnd = r.doorEnd.clone().addScaledVector(u, l), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight) : (r.beamStart = A.clone().addScaledVector(d, l), r.beamEnd = M.clone().addScaledVector(d, l), r.doorStart = N.clone().addScaledVector(d, l), r.doorEnd = F.clone().addScaledVector(d, l), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : t > n && (n > e && !D ? (h.beamStart = r.beamStart.clone().addScaledVector(d, l), h.beamEnd = r.beamEnd.clone().addScaledVector(d, l), h.doorStart = r.doorStart.clone().addScaledVector(d, l), h.doorEnd = r.doorEnd.clone().addScaledVector(d, l), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight) : !r.isPullOutDoor || D && r.isPullOutDoor && i ? (r.beamStart = A.clone().addScaledVector(u, l), r.beamEnd = M.clone().addScaledVector(u, l), r.doorStart = N.clone().addScaledVector(u, l), r.doorEnd = F.clone().addScaledVector(u, l), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : (h.beamStart = r.beamStart.clone().addScaledVector(d, l), h.beamEnd = r.beamEnd.clone().addScaledVector(d, l), h.doorStart = r.doorStart.clone().addScaledVector(d, l), h.doorEnd = r.doorEnd.clone().addScaledVector(d, l), 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(), F.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 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), N, F);
+							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 + .2 && t.z < M.z + x / 2 && i.push(new e.Vector3(t.x, t.y, M.z));
 									});
-									let c = 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, c);
-										t.distanceTo(i[e]) < .15 && (l.push(i[e]), u.push(t.clone()));
+										t.distanceTo(i[e]) < .15 && (u.push(i[e]), d.push(t.clone()));
 									}
-									for (let e = 0; e < u.length; e++) se(a, u[e]) && l.push(u[e]);
-									if (l = u, l.length < 500) continue;
-									let d = ce(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 = fe(u), u.length < 150) 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, te != -1 && (r[s[te].index].isFindBeam = !1, s[te].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 c && c.type == "collinear_overlap" && c.maxPerpendicularDistance > .3 && c.maxPerpendicularDistance < .7 && (b = !0);
+							} else c && c.type == "collinear_overlap" && c.maxPerpendicularDistance > .3 && c.maxPerpendicularDistance < .7 && (w = !0);
 						}
 						if (n) continue;
 					}
-					let C = !1;
+					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) : f[e][0].id == y && (f[e].push({
+					}), N = !0) : f[e][0].id == y && (f[e].push({
 						id: c,
-						beamStart: A,
-						beamEnd: M
-					}), C = !0), C)); e++);
-					C || f.push([{
+						beamStart: k,
+						beamEnd: A
+					}), N = !0), N)); e++);
+					N || f.push([{
 						id: c,
-						beamStart: A,
-						beamEnd: M
+						beamStart: k,
+						beamEnd: A
 					}]);
-					let w = h.doorStart.distanceTo(h.doorEnd);
-					if (console.log("id:", c, i, w), 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 == c && t[n].doorAndBeamData[r].type == "beam") {
@@ -1907,12 +1883,12 @@ var De = async (t, n, r, i) => {
 					if (a.doorAndBeamData.push(h), l.push({
 						linesIndex: i,
 						doorIndex: a.doorAndBeamData.length - 1
-					}), c++, D && x < 2) break;
+					}), c++, E && b < 2) break;
 				}
 			}
 		}
-		let b = a.length * (a.rooftopPz - a.start.z);
-		a.completePointAreaPercentage = y / b * 100;
+		let y = a.length * (a.rooftopPz - a.start.z);
+		a.completePointAreaPercentage = v / y * 100;
 	}
 	if (u.length > 1) for (let n = 0; n < u.length; n++) {
 		let r = [];
@@ -1920,14 +1896,14 @@ var De = async (t, n, r, 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 < u.length; r++) if (n != r) for (let n = 0; n < t[u[r]].doorAndBeamData.length; n++) {
-				let i = t[u[r]].doorAndBeamData[n].doorStart.clone(), l = t[u[r]].doorAndBeamData[n].doorEnd.clone();
-				i.z = l.z = 0, i.distanceTo(l);
-				let d = z(a, o, i, l);
-				if (d.type == "collinear_overlap" && d.maxPerpendicularDistance < .2) {
-					let t = new e.Line3(i, l), n = R(a, o), r = t.closestPointToPoint(n, !0, new e.Vector3()), u = n.distanceTo(r);
-					if (Math.abs(s - d.overlap) < .1 && u < .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;
 					}
 				}
@@ -2084,7 +2060,7 @@ var De = async (t, n, r, i) => {
 		size: .01
 	});
 	for (let r = 0; r < t.length; r++) {
-		let i = t[r], { minZ: o, maxZ: s } = ie(i);
+		let i = t[r], { minZ: o, maxZ: s } = re(i);
 		if (o == null || s == null) continue;
 		i.doorAndBeamData = [], i.completePointAreaPercentage = -1, s - o;
 		let c = i.rooftopPz - i.start.z;
@@ -2092,7 +2068,7 @@ var De = async (t, n, r, i) => {
 		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 = 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 = ie(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 = 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));
@@ -2117,7 +2093,7 @@ var De = async (t, n, r, i) => {
 			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 = 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++) {
@@ -2125,7 +2101,7 @@ var De = async (t, n, r, i) => {
 					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 = 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();
@@ -2137,12 +2113,12 @@ var De = async (t, n, r, i) => {
 							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), _ = 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)) {
@@ -2175,7 +2151,7 @@ var De = async (t, n, r, i) => {
 		}, 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;
@@ -2187,7 +2163,7 @@ var De = async (t, n, r, i) => {
 			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 = 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();
@@ -2197,7 +2173,7 @@ var De = async (t, n, r, i) => {
 				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 = 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());
@@ -2206,7 +2182,7 @@ var De = async (t, n, r, i) => {
 				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;
@@ -2225,7 +2201,7 @@ var De = async (t, n, r, i) => {
 		l.indexs.length == 3 && (l.indexs.forEach((e) => i.add(e)), r.threeEdgeRect.push(l));
 	}
 	return r;
-}, H = 11102230246251565e-32, U = 134217729, je = (3 + 8 * H) * H;
+}, U = 11102230246251565e-32, W = 134217729, je = (3 + 8 * U) * U;
 function Me(e, t, n, r, i) {
 	let a, o, s, c, l = t[0], u = r[0], d = 0, f = 0;
 	u > l == u > -l ? (a = l, l = t[++d]) : (a = u, u = r[++f]);
@@ -2240,28 +2216,28 @@ function Ne(e, t) {
 	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 Pe = (3 + 16 * H) * H, Fe = (2 + 12 * H) * H, Ie = (9 + 64 * H) * H * H, Le = W(4), Re = W(8), ze = W(12), Be = W(16), G = W(4);
+var Pe = (3 + 16 * U) * U, Fe = (2 + 12 * U) * U, Ie = (9 + 64 * U) * U * U, Le = G(4), Re = G(8), ze = G(12), Be = G(16), K = G(4);
 function Ve(e, t, n, r, i, a, o) {
 	let s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T = e - i, E = n - i, D = t - a, O = r - a;
-	b = T * O, f = 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 - _, Le[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, Le[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, Le[2] = v - (w - d) + (_ - d), Le[3] = w;
+	b = T * O, f = W * T, p = f - (f - T), m = T - p, f = W * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = D * E, f = W * D, p = f - (f - D), m = D - p, f = W * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, Le[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, Le[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, Le[2] = v - (w - d) + (_ - d), Le[3] = w;
 	let k = Ne(4, Le), A = Fe * o;
 	if (k >= A || -k >= A || (d = e - T, s = e - (T + d) + (d - i), d = n - E, l = n - (E + d) + (d - i), d = t - D, c = t - (D + d) + (d - a), d = r - O, u = r - (O + d) + (d - a), s === 0 && c === 0 && l === 0 && u === 0) || (A = Ie * o + je * Math.abs(k), k += T * u + O * s - (D * l + E * c), k >= A || -k >= A)) return k;
-	b = s * O, f = 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 = Me(4, Le, 4, G, Re);
-	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 = Me(j, Re, 4, G, ze);
-	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, Be[Me(M, ze, 4, G, Be) - 1];
+	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 = Me(4, Le, 4, K, Re);
+	b = T * u, f = W * T, p = f - (f - T), m = T - p, f = W * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = D * l, f = W * D, p = f - (f - D), m = D - p, f = W * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w;
+	let M = Me(j, Re, 4, K, ze);
+	return b = s * u, f = W * s, p = f - (f - s), m = s - p, f = W * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = c * l, f = W * c, p = f - (f - c), m = c - p, f = W * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w, Be[Me(M, ze, 4, K, Be) - 1];
 }
 function He(e, t, n, r, i, a) {
 	let o = (t - a) * (n - i), s = (e - i) * (r - a), c = o - s, l = Math.abs(o + s);
 	return Math.abs(c) >= Pe * l ? c : -Ve(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 Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
@@ -2946,7 +2922,7 @@ function gt(e) {
 }
 //#endregion
 //#region node_modules/three/examples/jsm/math/OBB.js
-var K = {
+var q = {
 	c: null,
 	u: [
 		new d(),
@@ -2954,7 +2930,7 @@ var K = {
 		new d()
 	],
 	e: []
-}, q = {
+}, J = {
 	c: null,
 	u: [
 		new d(),
@@ -2962,15 +2938,15 @@ var K = {
 		new d()
 	],
 	e: []
-}, J = [
+}, Y = [
 	[],
 	[],
 	[]
-], Y = [
+], X = [
 	[],
 	[],
 	[]
-], X = [], _t = new d(), vt = new d(), yt = new d(), Z = new d(), bt = new d(), xt = new d(), Q = new a(), St = new t(), Ct = new o(), wt = new o(), Tt = new l(), Et = class {
+], Z = [], _t = new d(), vt = new d(), yt = new d(), Q = new d(), bt = new d(), xt = new d(), St = new a(), Ct = new t(), wt = new o(), Tt = new o(), Et = new l(), Dt = class {
 	constructor(e = new d(), t = new d(), n = new a()) {
 		this.center = e, this.halfSize = t, this.rotation = n;
 	}
@@ -2988,32 +2964,32 @@ var K = {
 	}
 	clampPoint(e, t) {
 		let n = this.halfSize;
-		Z.subVectors(e, this.center), this.rotation.extractBasis(_t, vt, yt), t.copy(this.center);
-		let r = i.clamp(Z.dot(_t), -n.x, n.x);
+		Q.subVectors(e, this.center), this.rotation.extractBasis(_t, vt, yt), t.copy(this.center);
+		let r = i.clamp(Q.dot(_t), -n.x, n.x);
 		t.add(_t.multiplyScalar(r));
-		let a = i.clamp(Z.dot(vt), -n.y, n.y);
+		let a = i.clamp(Q.dot(vt), -n.y, n.y);
 		t.add(vt.multiplyScalar(a));
-		let o = i.clamp(Z.dot(yt), -n.z, n.z);
+		let o = i.clamp(Q.dot(yt), -n.z, n.z);
 		return t.add(yt.multiplyScalar(o)), t;
 	}
 	containsPoint(e) {
-		return Z.subVectors(e, this.center), this.rotation.extractBasis(_t, vt, yt), Math.abs(Z.dot(_t)) <= this.halfSize.x && Math.abs(Z.dot(vt)) <= this.halfSize.y && Math.abs(Z.dot(yt)) <= this.halfSize.z;
+		return Q.subVectors(e, this.center), this.rotation.extractBasis(_t, vt, yt), Math.abs(Q.dot(_t)) <= this.halfSize.x && Math.abs(Q.dot(vt)) <= this.halfSize.y && Math.abs(Q.dot(yt)) <= this.halfSize.z;
 	}
 	intersectsBox3(e) {
-		return this.intersectsOBB(Dt.fromBox3(e));
+		return this.intersectsOBB(Ot.fromBox3(e));
 	}
 	intersectsSphere(e) {
 		return this.clampPoint(e.center, xt), xt.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(_t, vt, yt);
@@ -3021,10 +2997,10 @@ var K = {
 		return Math.abs(n) <= t;
 	}
 	intersectRay(e, t) {
-		return this.getSize(bt), St.setFromCenterAndSize(Z.set(0, 0, 0), bt), Ct.setFromMatrix3(this.rotation), Ct.setPosition(this.center), wt.copy(Ct).invert(), Tt.copy(e).applyMatrix4(wt), Tt.intersectBox(St, t) ? t.applyMatrix4(Ct) : null;
+		return this.getSize(bt), Ct.setFromCenterAndSize(Q.set(0, 0, 0), bt), wt.setFromMatrix3(this.rotation), wt.setPosition(this.center), Tt.copy(wt).invert(), Et.copy(e).applyMatrix4(Tt), Et.intersectBox(Ct, t) ? t.applyMatrix4(wt) : null;
 	}
 	intersectsRay(e) {
-		return this.intersectRay(e, 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;
@@ -3033,12 +3009,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), St.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 St.elements[0] *= a, St.elements[1] *= a, St.elements[2] *= a, St.elements[3] *= o, St.elements[4] *= o, St.elements[5] *= o, St.elements[6] *= s, St.elements[7] *= s, St.elements[8] *= s, this.rotation.multiply(St), this.halfSize.x *= n, this.halfSize.y *= r, this.halfSize.z *= i, Q.setFromMatrixPosition(e), this.center.add(Q), this;
 	}
-}, Dt = new Et(), $ = 6371008.8, Ot = {
+}, Ot = new Dt(), $ = 6371008.8, kt = {
 	centimeters: $ * 100,
 	centimetres: $ * 100,
 	degrees: 360 / (2 * Math.PI),
@@ -3055,60 +3031,60 @@ var K = {
 	radians: 1,
 	yards: $ * 1.0936
 };
-function kt(e, t, n = {}) {
+function At(e, t, n = {}) {
 	let r = { type: "Feature" };
 	return (n.id === 0 || n.id) && (r.id = n.id), n.bbox && (r.bbox = n.bbox), r.properties = t || {}, r.geometry = e, r;
 }
-function At(e, t, n = {}) {
+function jt(e, t, n = {}) {
 	if (!e) throw Error("coordinates is required");
 	if (!Array.isArray(e)) throw Error("coordinates must be an Array");
 	if (e.length < 2) throw Error("coordinates must be at least 2 numbers long");
-	if (!Lt(e[0]) || !Lt(e[1])) throw Error("coordinates must contain numbers");
-	return kt({
+	if (!Rt(e[0]) || !Rt(e[1])) throw Error("coordinates must contain numbers");
+	return At({
 		type: "Point",
 		coordinates: e
 	}, t, n);
 }
-function jt(e, t, n = {}) {
+function Mt(e, t, n = {}) {
 	for (let t of e) {
 		if (t.length < 4) throw Error("Each LinearRing of a Polygon must have 4 or more Positions.");
 		if (t[t.length - 1].length !== t[0].length) throw Error("First and last Position are not equivalent.");
 		for (let e = 0; e < t[t.length - 1].length; e++) if (t[t.length - 1][e] !== t[0][e]) throw Error("First and last Position are not equivalent.");
 	}
-	return kt({
+	return At({
 		type: "Polygon",
 		coordinates: e
 	}, t, n);
 }
-function Mt(e, t = "kilometers") {
-	let n = Ot[t];
+function Nt(e, t = "kilometers") {
+	let n = kt[t];
 	if (!n) throw Error(t + " units is invalid");
 	return e * n;
 }
-function Nt(e, t = "kilometers") {
-	let n = Ot[t];
+function Pt(e, t = "kilometers") {
+	let n = kt[t];
 	if (!n) throw Error(t + " units is invalid");
 	return e / n;
 }
-function Pt(e) {
+function Ft(e) {
 	return e % (2 * Math.PI) * 180 / Math.PI;
 }
-function Ft(e) {
+function It(e) {
 	return e % 360 * Math.PI / 180;
 }
-function It(e, t = "kilometers", n = "kilometers") {
+function Lt(e, t = "kilometers", n = "kilometers") {
 	if (!(e >= 0)) throw Error("length must be a positive number");
-	return Mt(Nt(e, t), n);
+	return Nt(Pt(e, t), n);
 }
-function Lt(e) {
+function Rt(e) {
 	return !isNaN(e) && e !== null && !Array.isArray(e);
 }
-function Rt(e) {
+function zt(e) {
 	return typeof e == "object" && !!e && !Array.isArray(e);
 }
 //#endregion
 //#region node_modules/@turf/meta/dist/esm/index.js
-function zt(e, t, n) {
+function Bt(e, t, n) {
 	if (e !== null) for (var r, i, a, o, s, c, l, u = 0, d = 0, f, p = e.type, m = p === "FeatureCollection", h = p === "Feature", g = m ? e.features.length : 1, _ = 0; _ < g; _++) {
 		l = m ? e.features[_].geometry : h ? e.geometry : e, f = l ? l.type === "GeometryCollection" : !1, s = f ? l.geometries.length : 1;
 		for (var v = 0; v < s; v++) {
@@ -3154,7 +3130,7 @@ function zt(e, t, n) {
 						}
 						break;
 					case "GeometryCollection":
-						for (r = 0; r < o.geometries.length; r++) if (zt(o.geometries[r], t, n) === !1) return !1;
+						for (r = 0; r < o.geometries.length; r++) if (Bt(o.geometries[r], t, n) === !1) return !1;
 						break;
 					default: throw Error("Unknown Geometry Type");
 				}
@@ -3162,13 +3138,13 @@ function zt(e, t, n) {
 		}
 	}
 }
-function Bt(e) {
+function Vt(e) {
 	var t = [];
-	return zt(e, function(e) {
+	return Bt(e, function(e) {
 		t.push(e);
 	}), t;
 }
-function Vt(e, t) {
+function Ht(e, t) {
 	var n, r, i, a, o, s, c, l, u, d, f = 0, p = e.type === "FeatureCollection", m = e.type === "Feature", h = p ? e.features.length : 1;
 	for (n = 0; n < h; n++) {
 		for (s = p ? e.features[n].geometry : m ? e.geometry : e, l = p ? e.features[n].properties : m ? e.properties : {}, u = p ? e.features[n].bbox : m ? e.bbox : void 0, d = p ? e.features[n].id : m ? e.id : void 0, c = s ? s.type === "GeometryCollection" : !1, o = c ? s.geometries.length : 1, i = 0; i < o; i++) {
@@ -3194,15 +3170,15 @@ function Vt(e, t) {
 		f++;
 	}
 }
-function Ht(e, t, n) {
+function Ut(e, t, n) {
 	var r = n;
-	return Vt(e, function(e, i, a, o, s) {
+	return Ht(e, function(e, i, a, o, s) {
 		r = i === 0 && n === void 0 ? e : t(r, e, i, a, o, s);
 	}), r;
 }
 //#endregion
 //#region node_modules/rbush/rbush.min.js
-var Ut = /* @__PURE__ */ y(((e, t) => {
+var Wt = /* @__PURE__ */ y(((e, t) => {
 	(function(n, r) {
 		typeof e == "object" && t !== void 0 ? t.exports = r() : typeof define == "function" && define.amd ? define(r) : (n ||= self).RBush = r();
 	})(e, function() {
@@ -3419,13 +3395,13 @@ var Ut = /* @__PURE__ */ y(((e, t) => {
 			for (var t = e.length - 1, n = void 0; t >= 0; t--) e[t].children.length === 0 ? t > 0 ? (n = e[t - 1].children).splice(n.indexOf(e[t]), 1) : this.clear() : a(e[t], this.toBBox);
 		}, r;
 	});
-})), Wt = /* @__PURE__ */ b({ default: () => Kt });
-function Gt(e, t) {
+})), Gt = /* @__PURE__ */ b({ default: () => qt });
+function Kt(e, t) {
 	return e < t ? -1 : e > t ? 1 : 0;
 }
-var Kt, qt = v((() => {
-	Kt = class {
-		constructor(e = [], t = Gt) {
+var qt, Jt = v((() => {
+	qt = class {
+		constructor(e = [], t = Kt) {
 			if (this.data = e, this.length = this.data.length, this.compare = t, this.length > 0) for (let e = (this.length >> 1) - 1; e >= 0; e--) this._down(e);
 		}
 		push(e) {
@@ -3458,7 +3434,7 @@ var Kt, qt = v((() => {
 			t[e] = i;
 		}
 	};
-})), Jt = /* @__PURE__ */ y(((e, t) => {
+})), Yt = /* @__PURE__ */ y(((e, t) => {
 	t.exports = function(e, t, n, r) {
 		var i = e[0], a = e[1], o = !1;
 		n === void 0 && (n = 0), r === void 0 && (r = t.length);
@@ -3468,7 +3444,7 @@ var Kt, qt = v((() => {
 		}
 		return o;
 	};
-})), Yt = /* @__PURE__ */ y(((e, t) => {
+})), Xt = /* @__PURE__ */ y(((e, t) => {
 	t.exports = function(e, t, n, r) {
 		var i = e[0], a = e[1], o = !1;
 		n === void 0 && (n = 0), r === void 0 && (r = t.length);
@@ -3478,12 +3454,12 @@ var Kt, qt = v((() => {
 		}
 		return o;
 	};
-})), Xt = /* @__PURE__ */ y(((e, t) => {
-	var n = Jt(), r = Yt();
+})), Zt = /* @__PURE__ */ y(((e, t) => {
+	var n = Yt(), r = Xt();
 	t.exports = function(e, t, i, a) {
 		return t.length > 0 && Array.isArray(t[0]) ? r(e, t, i, a) : n(e, t, i, a);
 	}, t.exports.nested = r, t.exports.flat = n;
-})), Zt = /* @__PURE__ */ y(((e, t) => {
+})), Qt = /* @__PURE__ */ y(((e, t) => {
 	(function(n, r) {
 		typeof e == "object" && t !== void 0 ? r(e) : typeof define == "function" && define.amd ? define(["exports"], r) : r((n ||= self).predicates = {});
 	})(e, function(e) {
@@ -3524,8 +3500,8 @@ var Kt, qt = v((() => {
 			return (t - a) * (n - i) - (e - i) * (r - a);
 		}, Object.defineProperty(e, "__esModule", { value: !0 });
 	});
-})), Qt = /* @__PURE__ */ S((/* @__PURE__ */ y(((e, t) => {
-	var n = Ut(), r = (qt(), C(Wt)), i = Xt(), a = Zt().orient2d;
+})), $t = /* @__PURE__ */ S((/* @__PURE__ */ y(((e, t) => {
+	var n = Wt(), r = (Jt(), C(Gt)), i = Zt(), a = Qt().orient2d;
 	r.default && (r = r.default), t.exports = o, t.exports.default = o;
 	function o(e, t, r) {
 		t = Math.max(0, t === void 0 ? 2 : t), r ||= 0;
@@ -3675,26 +3651,26 @@ var Kt, qt = v((() => {
 		return r.pop(), t.pop(), t.concat(r);
 	}
 })))(), 1);
-function $t(e, t = {}) {
+function en(e, t = {}) {
 	t.concavity = t.concavity || Infinity;
 	let n = [];
-	if (zt(e, (e) => {
+	if (Bt(e, (e) => {
 		n.push([e[0], e[1]]);
 	}), !n.length) return null;
-	let r = (0, Qt.default)(n, t.concavity);
-	return r.length > 3 ? jt([r]) : null;
+	let r = (0, $t.default)(n, t.concavity);
+	return r.length > 3 ? Mt([r]) : null;
 }
 //#endregion
 //#region node_modules/@turf/centroid/dist/esm/index.js
-function en(e, t = {}) {
+function tn(e, t = {}) {
 	let n = 0, r = 0, i = 0;
-	return zt(e, function(e) {
+	return Bt(e, function(e) {
 		n += e[0], r += e[1], i++;
-	}, !0), At([n / i, r / i], t.properties);
+	}, !0), jt([n / i, r / i], t.properties);
 }
 //#endregion
 //#region node_modules/@turf/invariant/dist/esm/index.js
-function tn(e) {
+function nn(e) {
 	if (!e) throw Error("coord is required");
 	if (!Array.isArray(e)) {
 		if (e.type === "Feature" && e.geometry !== null && e.geometry.type === "Point") return [...e.geometry.coordinates];
@@ -3703,7 +3679,7 @@ function tn(e) {
 	if (Array.isArray(e) && e.length >= 2 && !Array.isArray(e[0]) && !Array.isArray(e[1])) return [...e];
 	throw Error("coord must be GeoJSON Point or an Array of numbers");
 }
-function nn(e) {
+function rn(e) {
 	if (Array.isArray(e)) return e;
 	if (e.type === "Feature") {
 		if (e.geometry !== null) return e.geometry.coordinates;
@@ -3712,23 +3688,23 @@ function nn(e) {
 }
 //#endregion
 //#region node_modules/@turf/rhumb-bearing/dist/esm/index.js
-function rn(e, t, n = {}) {
+function an(e, t, n = {}) {
 	let r;
-	return r = n.final ? an(tn(t), tn(e)) : an(tn(e), tn(t)), r > 180 ? -(360 - r) : r;
+	return r = n.final ? on(nn(t), nn(e)) : on(nn(e), nn(t)), r > 180 ? -(360 - r) : r;
 }
-function an(e, t) {
-	let n = Ft(e[1]), r = Ft(t[1]), i = Ft(t[0] - e[0]);
+function on(e, t) {
+	let n = It(e[1]), r = It(t[1]), i = It(t[0] - e[0]);
 	i > Math.PI && (i -= 2 * Math.PI), i < -Math.PI && (i += 2 * Math.PI);
 	let a = Math.log(Math.tan(r / 2 + Math.PI / 4) / Math.tan(n / 2 + Math.PI / 4));
-	return (Pt(Math.atan2(i, a)) + 360) % 360;
+	return (Ft(Math.atan2(i, a)) + 360) % 360;
 }
 //#endregion
 //#region node_modules/@turf/rhumb-distance/dist/esm/index.js
-function on(e, t, n = {}) {
-	let r = tn(e), i = tn(t);
-	return i[0] += i[0] - r[0] > 180 ? -360 : r[0] - i[0] > 180 ? 360 : 0, It(sn(r, i), "meters", n.units);
+function sn(e, t, n = {}) {
+	let r = nn(e), i = nn(t);
+	return i[0] += i[0] - r[0] > 180 ? -360 : r[0] - i[0] > 180 ? 360 : 0, Lt(cn(r, i), "meters", n.units);
 }
-function sn(e, t, n) {
+function cn(e, t, n) {
 	n = n === void 0 ? $ : Number(n);
 	let r = n, i = e[1] * Math.PI / 180, a = t[1] * Math.PI / 180, o = a - i, s = Math.abs(t[0] - e[0]) * Math.PI / 180;
 	s > Math.PI && (s -= 2 * Math.PI);
@@ -3737,37 +3713,37 @@ function sn(e, t, n) {
 }
 //#endregion
 //#region node_modules/@turf/rhumb-destination/dist/esm/index.js
-function cn(e, t, n, r = {}) {
-	let i = t < 0, a = It(Math.abs(t), r.units, "meters");
+function ln(e, t, n, r = {}) {
+	let i = t < 0, a = Lt(Math.abs(t), r.units, "meters");
 	i && (a = -Math.abs(a));
-	let o = tn(e), s = ln(o, a, n);
-	return s[0] += s[0] - o[0] > 180 ? -360 : o[0] - s[0] > 180 ? 360 : 0, At(s, r.properties);
+	let o = nn(e), s = un(o, a, n);
+	return s[0] += s[0] - o[0] > 180 ? -360 : o[0] - s[0] > 180 ? 360 : 0, jt(s, r.properties);
 }
-function ln(e, t, n, r) {
+function un(e, t, n, r) {
 	r = r === void 0 ? $ : Number(r);
-	let i = t / r, a = e[0] * Math.PI / 180, o = Ft(e[1]), s = Ft(n), c = i * Math.cos(s), l = o + c;
+	let i = t / r, a = e[0] * Math.PI / 180, o = It(e[1]), s = It(n), c = i * Math.cos(s), l = o + c;
 	Math.abs(l) > Math.PI / 2 && (l = l > 0 ? Math.PI - l : -Math.PI - l);
 	let u = Math.log(Math.tan(l / 2 + Math.PI / 4) / Math.tan(o / 2 + Math.PI / 4)), d = Math.abs(u) > 1e-11 ? c / u : Math.cos(o);
 	return [((a + i * Math.sin(s) / d) * 180 / Math.PI + 540) % 360 - 180, l * 180 / Math.PI];
 }
 //#endregion
 //#region node_modules/@turf/clone/dist/esm/index.js
-function un(e) {
+function dn(e) {
 	if (!e) throw Error("geojson is required");
 	switch (e.type) {
-		case "Feature": return dn(e);
-		case "FeatureCollection": return pn(e);
+		case "Feature": return fn(e);
+		case "FeatureCollection": return mn(e);
 		case "Point":
 		case "LineString":
 		case "Polygon":
 		case "MultiPoint":
 		case "MultiLineString":
 		case "MultiPolygon":
-		case "GeometryCollection": return mn(e);
+		case "GeometryCollection": return hn(e);
 		default: throw Error("unknown GeoJSON type");
 	}
 }
-function dn(e) {
+function fn(e) {
 	let t = { type: "Feature" };
 	return Object.keys(e).forEach((n) => {
 		switch (n) {
@@ -3776,16 +3752,16 @@ function dn(e) {
 			case "geometry": return;
 			default: t[n] = e[n];
 		}
-	}), t.properties = fn(e.properties), e.geometry == null ? t.geometry = null : t.geometry = mn(e.geometry), t;
+	}), t.properties = pn(e.properties), e.geometry == null ? t.geometry = null : t.geometry = hn(e.geometry), t;
 }
-function fn(e) {
+function pn(e) {
 	let t = {};
 	return e && Object.keys(e).forEach((n) => {
 		let r = e[n];
-		typeof r == "object" ? r === null ? t[n] = null : Array.isArray(r) ? t[n] = r.map((e) => e) : t[n] = fn(r) : t[n] = r;
+		typeof r == "object" ? r === null ? t[n] = null : Array.isArray(r) ? t[n] = r.map((e) => e) : t[n] = pn(r) : t[n] = r;
 	}), t;
 }
-function pn(e) {
+function mn(e) {
 	let t = { type: "FeatureCollection" };
 	return Object.keys(e).forEach((n) => {
 		switch (n) {
@@ -3793,44 +3769,44 @@ function pn(e) {
 			case "features": return;
 			default: t[n] = e[n];
 		}
-	}), t.features = e.features.map((e) => dn(e)), t;
+	}), t.features = e.features.map((e) => fn(e)), t;
 }
-function mn(e) {
+function hn(e) {
 	let t = { type: e.type };
-	return e.bbox && (t.bbox = e.bbox), e.type === "GeometryCollection" ? (t.geometries = e.geometries.map((e) => mn(e)), t) : (t.coordinates = hn(e.coordinates), t);
+	return e.bbox && (t.bbox = e.bbox), e.type === "GeometryCollection" ? (t.geometries = e.geometries.map((e) => hn(e)), t) : (t.coordinates = gn(e.coordinates), t);
 }
-function hn(e) {
+function gn(e) {
 	let t = e;
-	return typeof t[0] == "object" ? t.map((e) => hn(e)) : t.slice();
+	return typeof t[0] == "object" ? t.map((e) => gn(e)) : t.slice();
 }
 //#endregion
 //#region node_modules/@turf/transform-rotate/dist/esm/index.js
-function gn(e, t, n) {
-	if (n ||= {}, !Rt(n)) throw Error("options is invalid");
+function _n(e, t, n) {
+	if (n ||= {}, !zt(n)) throw Error("options is invalid");
 	let r = n.pivot, i = n.mutate;
 	if (!e) throw Error("geojson is required");
 	if (t == null || isNaN(t)) throw Error("angle is required");
 	if (t === 0) return e;
-	let a = r ?? en(e);
-	return (i === !1 || i === void 0) && (e = un(e)), zt(e, function(e) {
-		let n = rn(a, e) + t, r = nn(cn(a, on(a, e), n));
+	let a = r ?? tn(e);
+	return (i === !1 || i === void 0) && (e = dn(e)), Bt(e, function(e) {
+		let n = an(a, e) + t, r = rn(ln(a, sn(a, e), n));
 		e[0] = r[0], e[1] = r[1];
 	}), e;
 }
 //#endregion
 //#region node_modules/@turf/bearing/dist/esm/index.js
-function _n(e, t, n = {}) {
-	if (n.final === !0) return vn(e, t);
-	let r = tn(e), i = tn(t), a = Ft(r[0]), o = Ft(i[0]), s = Ft(r[1]), c = Ft(i[1]), l = Math.sin(o - a) * Math.cos(c), u = Math.cos(s) * Math.sin(c) - Math.sin(s) * Math.cos(c) * Math.cos(o - a);
-	return Pt(Math.atan2(l, u));
+function vn(e, t, n = {}) {
+	if (n.final === !0) return yn(e, t);
+	let r = nn(e), i = nn(t), a = It(r[0]), o = It(i[0]), s = It(r[1]), c = It(i[1]), l = Math.sin(o - a) * Math.cos(c), u = Math.cos(s) * Math.sin(c) - Math.sin(s) * Math.cos(c) * Math.cos(o - a);
+	return Ft(Math.atan2(l, u));
 }
-function vn(e, t) {
-	let n = _n(t, e);
+function yn(e, t) {
+	let n = vn(t, e);
 	return n = (n + 180) % 360, n;
 }
 //#endregion
 //#region node_modules/@turf/bbox/dist/esm/index.js
-function yn(e, t = {}) {
+function bn(e, t = {}) {
 	if (e.bbox != null && !0 !== t.recompute) return e.bbox;
 	let n = [
 		Infinity,
@@ -3838,17 +3814,17 @@ function yn(e, t = {}) {
 		-Infinity,
 		-Infinity
 	];
-	return zt(e, (e) => {
+	return Bt(e, (e) => {
 		n[0] > e[0] && (n[0] = e[0]), n[1] > e[1] && (n[1] = e[1]), n[2] < e[0] && (n[2] = e[0]), n[3] < e[1] && (n[3] = e[1]);
 	}), n;
 }
 //#endregion
 //#region node_modules/@turf/bbox-polygon/dist/esm/index.js
-function bn(e, t = {}) {
+function xn(e, t = {}) {
 	let n = Number(e[0]), r = Number(e[1]), i = Number(e[2]), a = Number(e[3]);
 	if (e.length === 6) throw Error("@turf/bbox-polygon does not support BBox with 6 positions");
 	let o = [n, r];
-	return jt([[
+	return Mt([[
 		o,
 		[i, r],
 		[i, a],
@@ -3861,20 +3837,20 @@ function bn(e, t = {}) {
 }
 //#endregion
 //#region node_modules/@turf/envelope/dist/esm/index.js
-function xn(e) {
-	return bn(yn(e));
+function Sn(e) {
+	return xn(bn(e));
 }
 //#endregion
 //#region node_modules/@turf/area/dist/esm/index.js
-function Sn(e) {
-	return Ht(e, (e, t) => e + Cn(t), 0);
-}
 function Cn(e) {
+	return Ut(e, (e, t) => e + wn(t), 0);
+}
+function wn(e) {
 	let t = 0, n;
 	switch (e.type) {
-		case "Polygon": return wn(e.coordinates);
+		case "Polygon": return Tn(e.coordinates);
 		case "MultiPolygon":
-			for (n = 0; n < e.coordinates.length; n++) t += wn(e.coordinates[n]);
+			for (n = 0; n < e.coordinates.length; n++) t += Tn(e.coordinates[n]);
 			return t;
 		case "Point":
 		case "MultiPoint":
@@ -3883,57 +3859,57 @@ function Cn(e) {
 	}
 	return 0;
 }
-function wn(e) {
+function Tn(e) {
 	let t = 0;
 	if (e && e.length > 0) {
-		t += Math.abs(Dn(e[0]));
-		for (let n = 1; n < e.length; n++) t -= Math.abs(Dn(e[n]));
+		t += Math.abs(On(e[0]));
+		for (let n = 1; n < e.length; n++) t -= Math.abs(On(e[n]));
 	}
 	return t;
 }
-var Tn = $ * $ / 2, En = Math.PI / 180;
-function Dn(e) {
+var En = $ * $ / 2, Dn = Math.PI / 180;
+function On(e) {
 	let t = e.length - 1;
 	if (t <= 2) return 0;
 	let n = 0, r = 0;
 	for (; r < t;) {
-		let i = e[r], a = e[r + 1 === t ? 0 : r + 1], o = e[r + 2 >= t ? (r + 2) % t : r + 2], s = i[0] * En, c = a[1] * En, l = o[0] * En;
+		let i = e[r], a = e[r + 1 === t ? 0 : r + 1], o = e[r + 2 >= t ? (r + 2) % t : r + 2], s = i[0] * Dn, c = a[1] * Dn, l = o[0] * Dn;
 		n += (l - s) * Math.sin(c), r++;
 	}
-	return n * Tn;
+	return n * En;
 }
 //#endregion
 //#region node_modules/geojson-minimum-bounding-rectangle/dist/index.js
-function On(e) {
-	let t = $t(e);
+function kn(e) {
+	let t = en(e);
 	if (!t) throw Error("Can't calculate smallestSurroundingRectangleByArea for given geometry");
-	let n = en(t), r = Bt(t), i = 2 ** 53 - 1, a = null;
+	let n = tn(t), r = Vt(t), i = 2 ** 53 - 1, a = null;
 	for (let e = 0; e < r.length - 1; e++) {
-		let o = _n(r[e], r[e + 1]), s = xn(gn(t, -1 * o, { pivot: n })), c = Sn(s);
-		c < i && (i = c, a = gn(s, o, { pivot: n }));
+		let o = vn(r[e], r[e + 1]), s = Sn(_n(t, -1 * o, { pivot: n })), c = Cn(s);
+		c < i && (i = c, a = _n(s, o, { pivot: n }));
 	}
 	return a;
 }
 //#endregion
 //#region src/utils/OBB.mjs
-function kn(e, t) {
+function An(e, t) {
 	let n = t[0] - e[0], r = t[1] - e[1];
 	return Math.sqrt(n * n + r * r);
 }
-function An(e) {
+function jn(e) {
 	let t = Infinity, n = -Infinity, r = Infinity, i = -Infinity;
 	for (let [a, o] of e) a < t && (t = a), a > n && (n = a), o < r && (r = o), o > i && (i = o);
 	return [(n + t) * .5, (i + r) * .5];
 }
-var jn = class t extends Et {
+var Mn = class t extends Dt {
 	getBoxMesh() {
-		Mn.identity(), Mn.setFromMatrix3(this.rotation), Mn.decompose(In, Nn, new e.Vector3());
+		Nn.identity(), Nn.setFromMatrix3(this.rotation), Nn.decompose(Ln, Pn, new e.Vector3());
 		let t = this.halfSize.clone().multiplyScalar(2), n = new e.Mesh(new e.BoxGeometry(t.x, t.y, t.z));
-		return n.position.copy(this.center), n.rotation.setFromQuaternion(Nn), n;
+		return n.position.copy(this.center), n.rotation.setFromQuaternion(Pn), n;
 	}
 	getBoxEdge(t = 16776960) {
 		let n = this.getBoxMesh();
-		Ln.setFromObject(n);
+		Rn.setFromObject(n);
 		let r = new e.EdgesGeometry(n.geometry.clone().applyMatrix4(n.matrixWorld));
 		return new e.LineSegments(r, new e.LineBasicMaterial({
 			color: t,
@@ -3941,33 +3917,33 @@ var jn = class t extends Et {
 		}));
 	}
 	toJson() {
-		return Mn.identity(), Mn.setFromMatrix3(this.rotation), Mn.decompose(In, Nn, new e.Vector3()), {
+		return Nn.identity(), Nn.setFromMatrix3(this.rotation), Nn.decompose(Ln, Pn, new e.Vector3()), {
 			size: this.halfSize.toArray(),
 			center: this.center.toArray(),
-			quaternion: Nn.toArray()
+			quaternion: Pn.toArray()
 		};
 	}
 	static from(n, r, i, a = new t()) {
-		if (i instanceof e.Euler) Nn.setFromEuler(i);
-		else if (i instanceof e.Quaternion) Nn.copy(i);
+		if (i instanceof e.Euler) Pn.setFromEuler(i);
+		else if (i instanceof e.Quaternion) Pn.copy(i);
 		else throw Error("传入的旋转不是欧拉角或者四元数");
-		return Mn.compose(r, Nn, Fn), a.center.copy(r), a.halfSize.copy(n.multiplyScalar(.5)), a.rotation.setFromMatrix4(Mn), a;
+		return Nn.compose(r, Pn, In), a.center.copy(r), a.halfSize.copy(n.multiplyScalar(.5)), a.rotation.setFromMatrix4(Nn), a;
 	}
 	static fromByPath2D(e, n, r, i = new t()) {
-		let a = On({
+		let a = kn({
 			type: "Polygon",
 			coordinates: [e.map((e) => [e.x, e.y])]
 		});
 		if (!a) throw Error("2d obb 获取失败");
-		let o = a.geometry.coordinates[0], s = kn(o[0], o[1]), c = kn(o[1], o[2]), l = Math.atan2(o[1][1] - o[0][1], o[1][0] - o[0][0]);
-		In.set(s, c, r), Pn.set(0, 0, l);
-		let [u, d] = An(o);
-		return n.x = u, n.y = d, this.from(In, n, Pn, i);
+		let o = a.geometry.coordinates[0], s = An(o[0], o[1]), c = An(o[1], o[2]), l = Math.atan2(o[1][1] - o[0][1], o[1][0] - o[0][0]);
+		Ln.set(s, c, r), Fn.set(0, 0, l);
+		let [u, d] = jn(o);
+		return n.x = u, n.y = d, this.from(Ln, n, Fn, i);
 	}
-}, Mn = new e.Matrix4(), Nn = new e.Quaternion(), Pn = new e.Euler(), Fn = new e.Vector3(1, 1, 1), In = new e.Vector3(), Ln = new e.Box3();
+}, Nn = new e.Matrix4(), Pn = new e.Quaternion(), Fn = new e.Euler(), In = new e.Vector3(1, 1, 1), Ln = new e.Vector3(), Rn = new e.Box3();
 //#endregion
 //#region src/pointCloudProcessing/mergeMeaning.mjs
-function Rn(e, t, n = .005, r = .2) {
+function zn(e, t, n = .005, r = .2) {
 	if (!e.length || !t.length) return 0;
 	let i = Math.max(n * 3, .05), a = n * n, o = /* @__PURE__ */ new Map(), s = (e, t, n) => `${Math.floor(e / i)},${Math.floor(t / i)},${Math.floor(n / i)}`;
 	for (let e of t) {
@@ -3996,26 +3972,26 @@ function Rn(e, t, n = .005, r = .2) {
 	}
 	return c / e.length;
 }
-function zn(e, t, n = .5) {
+function Bn(e, t, n = .5) {
 	let r = 0, i = 0;
 	for (let a of e) if (t.containsPoint(a) && (r++, i = r / e.length, i > n)) break;
 	return i;
 }
-function Bn(e, t, n, r) {
+function Vn(e, t, n, r) {
 	if (e.intersectsOBB(t)) return !0;
 	{
-		let i = Hn(e, r), a = Hn(t, n);
+		let i = Un(e, r), a = Un(t, n);
 		if (i || a) return !0;
 	}
 	return !1;
 }
-function Vn(t, n) {
+function Hn(t, n) {
 	let r = new e.Vector3(), i = new e.Vector3();
 	t.getSize(r), n.getSize(i);
 	let a = r.x * r.y * r.z, o = i.x * i.y * i.z;
 	return a > o ? 1 : a < o ? -1 : 0;
 }
-function Hn(e, t) {
+function Un(e, t) {
 	let n = !0;
 	for (let r = 0; r < t.length; r++) if (!e.containsPoint(t[r])) {
 		n = !1;
@@ -4023,7 +3999,7 @@ function Hn(e, t) {
 	}
 	return n;
 }
-function Un(e) {
+function Wn(e) {
 	if (e.length === 0) return {
 		x: 0,
 		y: 0,
@@ -4041,25 +4017,25 @@ function Un(e) {
 		h: r - i
 	};
 }
-function Wn(t, n, r, i) {
+function Gn(t, n, r, i) {
 	let a = [];
 	for (let n = 0; n < t.length; n++) a.push(new e.Vector3(t[n][0], t[n][1], 0));
 	if (a.length == 0) return null;
-	let o = jn.fromByPath2D(a, n, r);
+	let o = Mn.fromByPath2D(a, n, r);
 	return o.center.z = i, o;
 }
-var Gn = (t) => {
+var Kn = (t) => {
 	if (t.length == 0) return [];
 	let n = [], r = /* @__PURE__ */ new Map();
 	for (let i = 0; i < t.length; i++) {
-		let a = t[i].points.map((e) => [e.x, e.y]), o = Un(t[i].points), s = t[i].obj_id;
-		s = s.replace(/calcony railing/g, "balcony railing").replace(/glass balcony railing/g, "balcony railing").replace(/metal balcony railing/g, "balcony railing").replace(/temporary construction guardrail/g, "balcony railing"), s.split("_").slice(1, 3).join("_").split(".")[0].split("_")[0];
-		let c = s.indexOf("_") + 1, l = s.lastIndexOf("_"), u = s.substring(c, l);
-		if (u !== "floor") continue;
-		let d = [];
-		for (let n = 0; n < t[i].points.length; n++) d.push(new e.Vector3(t[i].points[n].x, t[i].points[n].y, t[i].points[n].z));
-		let f = -99999;
-		if (u === "floor") {
+		let a = t[i].points.map((e) => [e.x, e.y]), o = t[i].obj_id;
+		o = o.replace(/calcony railing/g, "balcony railing").replace(/glass balcony railing/g, "balcony railing").replace(/metal balcony railing/g, "balcony railing").replace(/temporary construction guardrail/g, "balcony railing").replace(/the floor of the house/g, "floor").replace(/the outdoor floor/g, "floor"), o.split("_").slice(1, 3).join("_").split(".")[0].split("_")[0];
+		let s = o.indexOf("_") + 1, c = o.lastIndexOf("_"), l = o.substring(s, c);
+		if (l === "wall") continue;
+		let u = [];
+		for (let n = 0; n < t[i].points.length; n++) u.push(new e.Vector3(t[i].points[n].x, t[i].points[n].y, t[i].points[n].z));
+		let d = -99999;
+		if (l === "floor") {
 			let n = /* @__PURE__ */ new Map();
 			for (let e = 0; e < t[i].points.length; e++) {
 				let r = t[i].points[e].z;
@@ -4072,40 +4048,40 @@ var Gn = (t) => {
 				});
 			}
 			let r = [...n.entries()].reduce((e, t) => t[1].num > e[1].num ? t : e);
-			a = [], a = r[1].points.map((e) => [e.x, e.y]), d = [], d = r[1].points.map((t) => new e.Vector3(t.x, t.y, t.z)), f = r[0];
+			a = [], a = r[1].points.map((e) => [e.x, e.y]), u = [], u = r[1].points.map((t) => new e.Vector3(t.x, t.y, t.z)), d = r[0];
 		}
-		let p = {
-			points: d,
+		let f = Wn(u), p = {
+			points: u,
 			path: gt(a),
-			h: o.h,
-			minz: o.minz,
-			maxz: o.maxz,
+			h: f.h,
+			minz: f.minz,
+			maxz: f.maxz,
 			center: {
-				x: o.x,
-				y: o.y,
-				z: o.z
+				x: f.x,
+				y: f.y,
+				z: f.z
 			},
 			obj_id: t[i].obj_id,
-			type: u,
+			type: l,
 			averagePz: t[i].averagePz,
 			obb: null,
 			isDel: !1,
-			obj_id: s,
+			obj_id: o,
 			positionArr: [t[i].position]
 		};
-		if (p.obb = Wn(p.path, p.center, p.h, (p.maxz + p.minz) / 2), p.obb == null) continue;
+		if (p.obb = Gn(p.path, p.center, p.h, (p.maxz + p.minz) / 2), p.obb == null) continue;
 		let m = -1;
-		for (let e = 0; e < n.length; e++) if (n[e].type == u) {
+		for (let e = 0; e < n.length; e++) if (n[e].type == l) {
 			m = e;
 			break;
 		}
 		if (m == -1 ? n.push({
-			type: u,
+			type: l,
 			array: [p]
-		}) : n[m].array.push(p), u == "floor" && f != -99999) if (r.has(f)) {
-			let e = r.get(f);
-			e.num += p.points.length, e.datas.push(p), r.set(f, e);
-		} else r.set(f, {
+		}) : n[m].array.push(p), l == "floor" && d != -99999) if (r.has(d)) {
+			let e = r.get(d);
+			e.num += p.points.length, e.datas.push(p), r.set(d, e);
+		} else r.set(d, {
 			num: p.points.length,
 			datas: [p]
 		});
@@ -4131,12 +4107,12 @@ var Gn = (t) => {
 			};
 			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 = gt(n.points.map((e) => [e.x, e.y]));
-				let a = Un(n.points);
+				let a = Wn(n.points);
 				n.h = a.h, n.minz = a.minz, n.maxz = a.maxz, n.center = {
 					x: a.x,
 					y: a.y,
 					z: a.z
-				}, n.obb = Wn(n.path, n.center, n.h, (n.maxz + n.minz) / 2), n.positionArr.push(...t[i].positionArr), i = e;
+				}, n.obb = Gn(n.path, n.center, n.h, (n.maxz + n.minz) / 2), n.positionArr.push(...t[i].positionArr), i = e;
 			}
 			n.path.length > t[e].path.length && (r.push(e), i.push(n));
 		}
@@ -4173,54 +4149,54 @@ var Gn = (t) => {
 					if (l[e].isDel) continue;
 					let n = l[e].obb, u = l[e].minz;
 					if (l[e].maxz, o.intersectsOBB(n)) {
-						zn(l[e].points, o);
-						let d = zn(i[a].points, n), f = Vn(o, n);
+						Bn(l[e].points, o);
+						let d = Bn(i[a].points, n), f = Hn(o, n);
 						if (d >= .3 && f == -1) {
 							i[a].isDel = !0;
 							break;
 						}
 						if (r !== "wall" && r !== "floor" && r !== "roof") {
 							if (r === "window") {
-								if (t === "balcony railing" && Hn(o, l[e].points)) {
+								if (t === "balcony railing" && Un(o, l[e].points)) {
 									l[e].isDel = !0;
 									continue;
 								}
-								if (t === "balcony railing" && Hn(n, i[a].points)) {
+								if (t === "balcony railing" && Un(n, i[a].points)) {
 									i[a].isDel = !0;
 									break;
 								}
-								if (t === "balcony railing" && Bn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(u - c) > .3)) {
+								if (t === "balcony railing" && Vn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(u - c) > .3)) {
 									l[e].isDel = !0;
 									continue;
 								}
 							} else if (r === "balcony railing") {
-								if (t === "window" && Hn(o, l[e].points)) {
+								if (t === "window" && Un(o, l[e].points)) {
 									l[e].isDel = !0;
 									continue;
 								}
-								if (t === "window" && Hn(n, i[a].points)) {
+								if (t === "window" && Un(n, i[a].points)) {
 									i[a].isDel = !0;
 									break;
 								}
-								if (t === "window" && Bn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(s - c) > .3)) {
+								if (t === "window" && Vn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(s - c) > .3)) {
 									i[a].isDel = !0;
 									break;
 								}
 							}
 							let d = !1, f = [], p = [], m = i[a].points, h = l[e].points;
-							if (m.length > h.length ? (d = !0, f = m, p = h) : (f = h, p = m), Rn(p, f, .03, .5) > .5) if (d) l[e].isDel = !0;
+							if (m.length > h.length ? (d = !0, f = m, p = h) : (f = h, p = m), zn(p, f, .03, .5) > .5) if (d) l[e].isDel = !0;
 							else {
 								i[a].isDel = !0;
 								break;
 							}
-							else if (Bn(o, n)) {
-								let s = Vn(o, n);
+							else if (Vn(o, n)) {
+								let s = Hn(o, n);
 								if (s === 1 || s === 0) {
 									if (t === "switch") continue;
-									zn(p, o) >= .5 && (l[e].isDel = !0);
+									Bn(p, o) >= .5 && (l[e].isDel = !0);
 								} else {
 									if (r === "switch") continue;
-									if (zn(p, n) >= .5) {
+									if (Bn(p, n) >= .5) {
 										i[a].isDel = !0;
 										break;
 									}
@@ -4249,11 +4225,29 @@ var Gn = (t) => {
 				let n = new e.Vector3();
 				i[t].obb.getSize(n), (n.x < .1 || n.y < .1) && (i[t].isDel = !0);
 			}
-			r === "balcony railing" && (Math.abs(n - a) < .4 && (i[t].isDel = !0), (a < s && Math.abs(a - s) > 1 || a > s && Math.abs(a - s) > 1) && (i[t].isDel = !0), n < s && (i[t].isDel = !0));
+			r === "balcony railing" && (Math.abs(n - a) < .4 && (i[t].isDel = !0), (a < s && Math.abs(a - s) > 1 || a > s && Math.abs(a - s) > 1) && (i[t].isDel = !0), n < s && (i[t].isDel = !0)), r === "people" && (Math.abs(n - a) < 1 && (i[t].isDel = !0), a > s && a - s > .3 && (i[t].isDel = !0), n < s && (i[t].isDel = !0)), r === "floor" && i[t].points.length < 500 && (i[t].isDel = !0);
 		}
 	}
 	for (let e = 0; e < n.length; e++) n[e].array = n[e].array.filter((e) => !e.isDel);
-	return n;
+	let i = [];
+	for (let t = 0; t < n.length; t++) {
+		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: r[t].center.x,
+				y: r[t].center.y,
+				z: (r[t].minz + r[t].maxz) / 2
+			},
+			name: r[t].obj_id,
+			obj_id: r[t].obj_id,
+			pcdPoints: r[t].points,
+			positionArr: r[t].positionArr
+		});
+	}
+	return i;
 };
 //#endregion
-export { z as classifySegments, ge as getAllGeometry, Oe as getBeamLine, Ae as getColLine, ke as getMainBeamLine, Gn as getMergeMeaning, I as getParallelism, ie as getPointCloudMinMax, ne as getPointCoverageOnQuad, j as isParallel, L as perpendicularInfo, oe as removeNoisePoints, O as segmentsIntersect2D, _e as updateStEdPoint, De as usegetBeamLine };
+export { z as classifySegments, ge as getAllGeometry, Oe as getBeamLine, Ae as getColLine, ke as getMainBeamLine, Kn as getMergeMeaning, I as getParallelism, re as getPointCloudMinMax, te as getPointCoverageOnQuad, j as isParallel, L as perpendicularInfo, ae as removeNoisePoints, O as segmentsIntersect2D, _e as updateStEdPoint, De as usegetBeamLine };