rm-graphical-computing 1.0.38 → 1.0.39

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,35 +560,35 @@ 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();
@@ -597,7 +597,7 @@ function fe(e) {
 }
 //#endregion
 //#region src/geometry/handleWallSegment.mjs
-var pe = class {
+var fe = class {
 	results;
 	clusterResults;
 	constructor() {
@@ -1029,12 +1029,12 @@ var pe = class {
 			return console.error("合并网格时出错:", e), null;
 		}
 	}
-}, me = (e) => {
+}, pe = (e) => {
 	let t = {}, n = [], r = [], i = [];
 	return e[0].width, e[0].height, e.forEach((e) => {
 		r.push(...e.vertices), i.push(e.center), n.push(e.vertices);
 	}), t.originalVertices = n, t.allCenterPoints = i, t;
-}, he = (e) => {
+}, me = (e) => {
 	let t = new d().copy(e.start).add(e.end).multiplyScalar(.5), n = new d().subVectors(new d(t.x, t.y, t.z + 1), t).normalize(), r = new d(e.direction.x, e.direction.y, 0);
 	r.applyAxisAngle(n, Math.PI / 2);
 	let i = new d().copy(t).add(r.clone().multiplyScalar(e.length)), a = new d().copy(t).sub(r.clone().multiplyScalar(e.length));
@@ -1044,7 +1044,7 @@ var pe = class {
 		center: t,
 		direction: r
 	};
-}, ge = (t, n, r = !0) => {
+}, he = (t, n, r = !0) => {
 	let i = [];
 	if (!t) return [];
 	for (let a = 0; a < t.length; a++) {
@@ -1065,7 +1065,7 @@ var pe = class {
 			wireframe: !1,
 			transparent: !0,
 			opacity: .5
-		}), g = new e.Group(), _ = new pe(), { horizontalSubdivisions: v, verticalSubdivisions: y } = _.initLimits4(p, m), b = _.createSubdividedWallPlane(o, y, v, h, g);
+		}), g = new e.Group(), _ = new fe(), { horizontalSubdivisions: v, verticalSubdivisions: y } = _.initLimits4(p, m), b = _.createSubdividedWallPlane(o, y, v, h, g);
 		_.analyzePointDistribution(b, f, .01);
 		let x = new e.MeshBasicMaterial({
 			color: "black",
@@ -1074,20 +1074,20 @@ var pe = class {
 			side: e.DoubleSide
 		}), S = _.highlightEmptySegments(b, x, g), C = [];
 		for (let e of S.clusters) {
-			let t = me(e);
+			let t = pe(e);
 			t && C.push(t);
 		}
-		let w = he(o).direction;
+		let w = me(o).direction;
 		o.checkResults = C, o.verticalDirection = w, o.originaIndex = a, i.push(o);
 	}
 	return i;
-}, _e = (t, n) => {
+}, ge = (t, n) => {
 	console.log("lines", t);
 	for (let r = 0; r < t.length; r++) {
 		let i = t[r], a = [];
 		i.originalPoints.forEach((t) => {
 			let n = new e.Vector3(t.x, t.y, 0), r = !1;
-			for (let e = 0; e < a.length; e++) if (V(n, a[e], .01)) {
+			for (let e = 0; e < a.length; e++) if (H(n, a[e], .01)) {
 				r = !0;
 				break;
 			}
@@ -1099,8 +1099,8 @@ var pe = class {
 			let e = [];
 			e.push(s.clone().addScaledVector(u, 1)), e.push(e[0].clone().addScaledVector(l, m)), e.push(e[1].clone().addScaledVector(d, 2)), e.push(s.clone().addScaledVector(d, m));
 			let t = [];
-			for (let n = 0; n < a.length; n++) f.includes(n) || be(a[n], e) && (f.push(n), t.push(a[n]));
-			t.length > 0 && p.push(xe(t)), s = s.addScaledVector(l, m);
+			for (let n = 0; n < a.length; n++) f.includes(n) || ye(a[n], e) && (f.push(n), t.push(a[n]));
+			t.length > 0 && p.push(be(t)), s = s.addScaledVector(l, m);
 		}
 		let h = new Float32Array(a.length * 3);
 		a.forEach((e, t) => {
@@ -1108,17 +1108,17 @@ 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, {
+		let [_, v] = Te(p, {
 			plane: "xy",
 			trimRatio: 0
 		});
 		D(_, v, n);
 	}
 };
-function ve(e, t = "xy") {
+function _e(e, t = "xy") {
 	if (t === "xy") return {
 		x: e.x,
 		y: e.y
@@ -1133,30 +1133,30 @@ function ve(e, t = "xy") {
 	};
 	throw Error(`Unsupported plane: ${t}`);
 }
-function ye(e, t, n) {
+function ve(e, t, n) {
 	let r = t.x - e.x, i = t.y - e.y, a = n.x - e.x;
 	return r * (n.y - e.y) - i * a;
 }
-function be(e, t, n = "xy") {
+function ye(e, t, n = "xy") {
 	if (!t || t.length !== 4) throw Error("rectPoints must contain 4 points");
-	let r = ve(e, n), i = t.map((e) => ve(e, n)), a = !1, o = !1;
+	let r = _e(e, n), i = t.map((e) => _e(e, n)), a = !1, o = !1;
 	for (let e = 0; e < 4; e++) {
-		let t = i[e], n = i[(e + 1) % 4], s = ye(t, n, r);
+		let t = i[e], n = i[(e + 1) % 4], s = ve(t, n, r);
 		if (s > 1e-9 && (a = !0), s < -1e-9 && (o = !0), a && o) return !1;
 	}
 	return !0;
 }
-function xe(t) {
+function be(t) {
 	if (!t || t.length === 0) return null;
 	let n = new e.Vector3(0, 0, 0);
 	for (let e of t) Array.isArray(e) ? (n.x += e[0], n.y += e[1], n.z += e[2]) : (n.x += e.x, n.y += e.y, n.z += e.z);
 	return n.divideScalar(t.length), n;
 }
-function Se(t) {
+function xe(t) {
 	return t instanceof e.Vector3 ? t.clone() : Array.isArray(t) ? new e.Vector3(t[0], t[1], t[2]) : new e.Vector3(t.x, t.y, t.z);
 }
-function Ce(e, t = "xy") {
-	let n = Se(e);
+function Se(e, t = "xy") {
+	let n = xe(e);
 	if (t === "xy") return {
 		x: n.x,
 		y: n.y,
@@ -1174,13 +1174,13 @@ function Ce(e, t = "xy") {
 	};
 	throw Error(`Unsupported plane: ${t}`);
 }
-function we(t, n, r, i = "xy") {
+function Ce(t, n, r, i = "xy") {
 	if (i === "xy") return new e.Vector3(t, n, r);
 	if (i === "xz") return new e.Vector3(t, r, n);
 	if (i === "yz") return new e.Vector3(r, t, n);
 	throw Error(`Unsupported plane: ${i}`);
 }
-function Te(e, t, n) {
+function we(e, t, n) {
 	let r = 1e-12;
 	if (Math.abs(t) < r) return e >= n ? {
 		x: 1,
@@ -1198,10 +1198,10 @@ function Te(e, t, n) {
 		y: l / u
 	};
 }
-function Ee(e, t = {}) {
+function Te(e, t = {}) {
 	let { plane: n = "xy", trimRatio: r = 0 } = t;
 	if (!e || e.length < 2) return null;
-	let i = e.map((e) => Ce(e, n)), a = 0, o = 0, s = 0;
+	let i = e.map((e) => Se(e, n)), a = 0, o = 0, s = 0;
 	for (let e of i) a += e.x, o += e.y, s += e.up;
 	a /= i.length, o /= i.length, s /= i.length;
 	let c = 0, l = 0, u = 0;
@@ -1210,7 +1210,7 @@ function Ee(e, t = {}) {
 		c += t * t, l += t * n, u += n * n;
 	}
 	c /= i.length, l /= i.length, u /= i.length;
-	let d = Te(c, l, u), f = {
+	let d = we(c, l, u), f = {
 		x: -d.y,
 		y: d.x
 	}, p = [];
@@ -1232,12 +1232,12 @@ function Ee(e, t = {}) {
 		let e = p.map((e) => e.up).sort((e, t) => e - t), t = Math.floor(e.length / 2);
 		return e.length % 2 == 0 ? (e[t - 1] + e[t]) * .5 : e[t];
 	})(), x = _.s, S = v.s, C = y, w = y, T = b, E = b, D = a + d.x * x + f.x * C, O = o + d.y * x + f.y * C, k = a + d.x * S + f.x * w, A = o + d.y * S + f.y * w;
-	return [we(D, O, T, n), we(k, A, E, n)];
+	return [Ce(D, O, T, n), Ce(k, A, E, n)];
 }
 //#endregion
 //#region src/geometry/beamLine.mjs
-var De = async (t, n, r, i) => {
-	le(i);
+var Ee = async (t, n, r, 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();
@@ -1263,7 +1263,7 @@ var De = async (t, n, r, i) => {
 		}
 	}
 	i.add(m), console.time();
-	let { beamGroup: x } = await Oe(o, _, y, i);
+	let { beamGroup: x } = await De(o, _, y, i);
 	console.timeEnd(), console.log("beamGroup", x);
 	let S = new e.MeshBasicMaterial({
 		color: "#cffd00",
@@ -1331,7 +1331,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 = [];
@@ -1420,8 +1420,8 @@ var De = async (t, n, r, i) => {
 		beamDoorGroup: p,
 		lineIndexGroup: m
 	};
-}, Oe = async (t, n, r, i) => {
-	if (oe(t, i), t.length <= 0 || n.length <= 0) return t;
+}, De = async (t, n, r, i) => {
+	if (ae(t, i), t.length <= 0 || n.length <= 0) return t;
 	r ||= [];
 	for (let n of t) {
 		let t = [];
@@ -1559,170 +1559,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 +1699,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 && 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.length < 500) continue;
+									let f = se(u);
+									if (f.length == 2) {
+										let e = f[0].distanceTo(f[1]);
 										if (Math.abs(e - a.distance()) < .3) {
-											n = !0, 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 +1878,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 +1891,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;
 					}
 				}
@@ -2011,7 +1982,7 @@ var De = async (t, n, r, i) => {
 		lines: t,
 		beamGroup: f
 	};
-}, ke = (t, n) => {
+}, Oe = (t, n) => {
 	if (t.length <= 0) return t;
 	for (let n of t) {
 		let t = [];
@@ -2084,7 +2055,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 +2063,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));
@@ -2102,7 +2073,7 @@ var De = async (t, n, r, i) => {
 		}
 	}
 	return t;
-}, Ae = (t, n) => {
+}, ke = (t, n) => {
 	let r = {
 		rectangles: [],
 		threeEdgeRect: []
@@ -2117,7 +2088,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 +2096,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 +2108,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 +2146,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 +2158,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 +2168,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 +2177,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,8 +2196,8 @@ 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;
-function Me(e, t, n, r, i) {
+}, U = 11102230246251565e-32, W = 134217729, Ae = (3 + 8 * U) * U;
+function je(e, t, n, r, i) {
 	let a, o, s, c, l = t[0], u = r[0], d = 0, f = 0;
 	u > l == u > -l ? (a = l, l = t[++d]) : (a = u, u = r[++f]);
 	let p = 0;
@@ -2235,37 +2206,37 @@ function Me(e, t, n, r, i) {
 	for (; f < n;) o = a + u, c = o - a, s = a - (o - c) + (u - c), u = r[++f], a = o, s !== 0 && (i[p++] = s);
 	return (a !== 0 || p === 0) && (i[p++] = a), p;
 }
-function Ne(e, t) {
+function Me(e, t) {
 	let n = t[0];
 	for (let r = 1; r < e; r++) n += t[r];
 	return n;
 }
-function W(e) {
+function G(e) {
 	return new Float64Array(e);
 }
 //#endregion
 //#region node_modules/robust-predicates/esm/orient2d.js
-var 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);
-function Ve(e, t, n, r, i, a, o) {
+var Ne = (3 + 16 * U) * U, Pe = (2 + 12 * U) * U, Fe = (9 + 64 * U) * U * U, Ie = G(4), Le = G(8), Re = G(12), ze = G(16), K = G(4);
+function Be(e, t, n, r, i, a, o) {
 	let s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T = e - i, E = n - i, D = t - a, O = r - a;
-	b = T * O, f = U * T, p = f - (f - T), m = T - p, f = U * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = D * E, f = U * D, p = f - (f - D), m = D - p, f = U * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, 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 = T * O, f = W * T, p = f - (f - T), m = T - p, f = W * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = D * E, f = W * D, p = f - (f - D), m = D - p, f = W * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, Ie[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, Ie[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, Ie[2] = v - (w - d) + (_ - d), Ie[3] = w;
+	let k = Me(4, Ie), A = Pe * o;
+	if (k >= A || -k >= A || (d = e - T, s = e - (T + d) + (d - i), d = n - E, l = n - (E + d) + (d - i), d = t - D, c = t - (D + d) + (d - a), d = r - O, u = r - (O + d) + (d - a), s === 0 && c === 0 && l === 0 && u === 0) || (A = Fe * o + Ae * Math.abs(k), k += T * u + O * s - (D * l + E * c), k >= A || -k >= A)) return k;
+	b = s * O, f = W * s, p = f - (f - s), m = s - p, f = W * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = c * E, f = W * c, p = f - (f - c), m = c - p, f = W * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w;
+	let j = je(4, Ie, 4, K, Le);
+	b = T * u, f = W * T, p = f - (f - T), m = T - p, f = W * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = D * l, f = W * D, p = f - (f - D), m = D - p, f = W * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w;
+	let M = je(j, Le, 4, K, Re);
+	return b = s * u, f = W * s, p = f - (f - s), m = s - p, f = W * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = c * l, f = W * c, p = f - (f - c), m = c - p, f = W * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, K[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, K[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, K[2] = v - (w - d) + (_ - d), K[3] = w, ze[je(M, Re, 4, K, ze) - 1];
 }
-function He(e, t, n, r, i, a) {
+function Ve(e, t, n, r, i, a) {
 	let o = (t - a) * (n - i), s = (e - i) * (r - a), c = o - s, l = Math.abs(o + s);
-	return Math.abs(c) >= Pe * l ? c : -Ve(e, t, n, r, i, a, l);
+	return Math.abs(c) >= Ne * l ? c : -Be(e, t, n, r, i, a, l);
 }
-(7 + 56 * H) * H, (3 + 28 * H) * H, (26 + 288 * H) * H * H, W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(8), W(8), W(8), W(4), W(8), W(8), W(16), W(12), W(192), W(192), (10 + 96 * H) * H, (4 + 48 * H) * H, (44 + 576 * H) * H * H, W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(8), W(8), W(8), W(8), W(8), W(8), W(8), W(8), W(8), W(4), W(4), W(4), W(8), W(16), W(16), W(16), W(32), W(32), W(48), W(64), W(1152), W(1152), (16 + 224 * H) * H, (5 + 72 * H) * H, (71 + 1408 * H) * H * H, W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(4), W(24), W(24), W(24), W(24), W(24), W(24), W(24), W(24), W(24), W(24), W(1152), W(1152), W(1152), W(1152), W(1152), W(2304), W(2304), W(3456), W(5760), W(8), W(8), W(8), W(16), W(24), W(48), W(48), W(96), W(192), W(384), W(384), W(384), W(768), W(96), W(96), W(96), W(1152);
+(7 + 56 * U) * U, (3 + 28 * U) * U, (26 + 288 * U) * U * U, G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(8), G(8), G(8), G(4), G(8), G(8), G(16), G(12), G(192), G(192), (10 + 96 * U) * U, (4 + 48 * U) * U, (44 + 576 * U) * U * U, G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(8), G(8), G(8), G(8), G(8), G(8), G(8), G(8), G(8), G(4), G(4), G(4), G(8), G(16), G(16), G(16), G(32), G(32), G(48), G(64), G(1152), G(1152), (16 + 224 * U) * U, (5 + 72 * U) * U, (71 + 1408 * U) * U * U, G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(4), G(24), G(24), G(24), G(24), G(24), G(24), G(24), G(24), G(24), G(24), G(1152), G(1152), G(1152), G(1152), G(1152), G(2304), G(2304), G(3456), G(5760), G(8), G(8), G(8), G(16), G(24), G(48), G(48), G(96), G(192), G(384), G(384), G(384), G(768), G(96), G(96), G(96), G(1152);
 //#endregion
 //#region node_modules/delaunator/index.js
-var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
-	static from(t, n = $e, r = et) {
+var He = 2 ** -52, Ue = new Uint32Array(512), We = class e {
+	static from(t, n = Qe, r = $e) {
 		let i = t.length, a = new Float64Array(i * 2);
 		for (let e = 0; e < i; e++) {
 			let i = t[e];
@@ -2288,25 +2259,25 @@ var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
 		}
 		let u = (o + c) / 2, d = (s + l) / 2, f = 0, p = 0, m = 0;
 		for (let t = 0, n = Infinity; t < a; t++) {
-			let r = qe(u, d, e[2 * t], e[2 * t + 1]);
+			let r = Ke(u, d, e[2 * t], e[2 * t + 1]);
 			r < n && (f = t, n = r);
 		}
 		let h = e[2 * f], g = e[2 * f + 1];
 		for (let t = 0, n = Infinity; t < a; t++) {
 			if (t === f) continue;
-			let r = qe(h, g, e[2 * t], e[2 * t + 1]);
+			let r = Ke(h, g, e[2 * t], e[2 * t + 1]);
 			r < n && r > 0 && (p = t, n = r);
 		}
 		let _ = e[2 * p], v = e[2 * p + 1], y = Infinity;
 		for (let t = 0; t < a; t++) {
 			if (t === f || t === p) continue;
-			let n = Ye(h, g, _, v, e[2 * t], e[2 * t + 1]);
+			let n = Je(h, g, _, v, e[2 * t], e[2 * t + 1]);
 			n < y && (m = t, y = n);
 		}
 		let b = e[2 * m], x = e[2 * m + 1];
 		if (y === Infinity) {
 			for (let t = 0; t < a; t++) this._dists[t] = e[2 * t] - e[0] || e[2 * t + 1] - e[1];
-			Ze(this._ids, this._dists, 0, a - 1);
+			Xe(this._ids, this._dists, 0, a - 1);
 			let t = new Uint32Array(a), n = 0;
 			for (let e = 0, r = -Infinity; e < a; e++) {
 				let i = this._ids[e], a = this._dists[i];
@@ -2315,24 +2286,24 @@ var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
 			this.hull = t.subarray(0, n), this.triangles = new Uint32Array(), this.halfedges = new Int32Array();
 			return;
 		}
-		if (He(h, g, _, v, b, x) < 0) {
+		if (Ve(h, g, _, v, b, x) < 0) {
 			let e = p, t = _, n = v;
 			p = m, _ = b, v = x, m = e, b = t, x = n;
 		}
-		let S = Xe(h, g, _, v, b, x);
+		let S = Ye(h, g, _, v, b, x);
 		this._cx = S.x, this._cy = S.y;
-		for (let t = 0; t < a; t++) this._dists[t] = qe(e[2 * t], e[2 * t + 1], S.x, S.y);
-		Ze(this._ids, this._dists, 0, a - 1), this._hullStart = f;
+		for (let t = 0; t < a; t++) this._dists[t] = Ke(e[2 * t], e[2 * t + 1], S.x, S.y);
+		Xe(this._ids, this._dists, 0, a - 1), this._hullStart = f;
 		let C = 3;
 		n[f] = t[m] = p, n[p] = t[f] = m, n[m] = t[p] = f, r[f] = 0, r[p] = 1, r[m] = 2, i.fill(-1), i[this._hashKey(h, g)] = f, i[this._hashKey(_, v)] = p, i[this._hashKey(b, x)] = m, this.trianglesLen = 0, this._addTriangle(f, p, m, -1, -1, -1);
 		for (let a = 0, o = 0, s = 0; a < this._ids.length; a++) {
 			let c = this._ids[a], l = e[2 * c], u = e[2 * c + 1];
-			if (a > 0 && Math.abs(l - o) <= Ue && Math.abs(u - s) <= Ue || (o = l, s = u, c === f || c === p || c === m)) continue;
+			if (a > 0 && Math.abs(l - o) <= He && Math.abs(u - s) <= He || (o = l, s = u, c === f || c === p || c === m)) continue;
 			let d = 0;
 			for (let e = 0, t = this._hashKey(l, u); e < this._hashSize && (d = i[(t + e) % this._hashSize], !(d !== -1 && d !== n[d])); e++);
 			d = t[d];
 			let h = d, g;
-			for (; g = n[h], He(l, u, e[2 * h], e[2 * h + 1], e[2 * g], e[2 * g + 1]) >= 0;) if (h = g, h === d) {
+			for (; g = n[h], Ve(l, u, e[2 * h], e[2 * h + 1], e[2 * g], e[2 * g + 1]) >= 0;) if (h = g, h === d) {
 				h = -1;
 				break;
 			}
@@ -2340,8 +2311,8 @@ var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
 			let _ = this._addTriangle(h, c, n[h], -1, -1, r[h]);
 			r[c] = this._legalize(_ + 2), r[h] = _, C++;
 			let v = n[h];
-			for (; g = n[v], He(l, u, e[2 * v], e[2 * v + 1], e[2 * g], e[2 * g + 1]) < 0;) _ = this._addTriangle(v, c, g, r[c], -1, r[v]), r[c] = this._legalize(_ + 2), n[v] = v, C--, v = g;
-			if (h === d) for (; g = t[h], He(l, u, e[2 * g], e[2 * g + 1], e[2 * h], e[2 * h + 1]) < 0;) _ = this._addTriangle(g, c, h, -1, r[h], r[g]), this._legalize(_ + 2), r[g] = _, n[h] = h, C--, h = g;
+			for (; g = n[v], Ve(l, u, e[2 * v], e[2 * v + 1], e[2 * g], e[2 * g + 1]) < 0;) _ = this._addTriangle(v, c, g, r[c], -1, r[v]), r[c] = this._legalize(_ + 2), n[v] = v, C--, v = g;
+			if (h === d) for (; g = t[h], Ve(l, u, e[2 * g], e[2 * g + 1], e[2 * h], e[2 * h + 1]) < 0;) _ = this._addTriangle(g, c, h, -1, r[h], r[g]), this._legalize(_ + 2), r[g] = _, n[h] = h, C--, h = g;
 			this._hullStart = t[c] = h, n[h] = t[v] = c, n[c] = v, i[this._hashKey(l, u)] = c, i[this._hashKey(e[2 * h], e[2 * h + 1])] = h;
 		}
 		this.hull = new Uint32Array(C);
@@ -2349,7 +2320,7 @@ var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
 		this.triangles = this._triangles.subarray(0, this.trianglesLen), this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
 	}
 	_hashKey(e, t) {
-		return Math.floor(Ke(e - this._cx, t - this._cy) * this._hashSize) % this._hashSize;
+		return Math.floor(Ge(e - this._cx, t - this._cy) * this._hashSize) % this._hashSize;
 	}
 	_legalize(e) {
 		let { _triangles: t, _halfedges: n, coords: r } = this, i = 0, a = 0;
@@ -2357,11 +2328,11 @@ var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
 			let o = n[e], s = e - e % 3;
 			if (a = s + (e + 2) % 3, o === -1) {
 				if (i === 0) break;
-				e = We[--i];
+				e = Ue[--i];
 				continue;
 			}
 			let c = o - o % 3, l = s + (e + 1) % 3, u = c + (o + 2) % 3, d = t[a], f = t[e], p = t[l], m = t[u];
-			if (Je(r[2 * d], r[2 * d + 1], r[2 * f], r[2 * f + 1], r[2 * p], r[2 * p + 1], r[2 * m], r[2 * m + 1])) {
+			if (qe(r[2 * d], r[2 * d + 1], r[2 * f], r[2 * f + 1], r[2 * p], r[2 * p + 1], r[2 * m], r[2 * m + 1])) {
 				t[e] = m, t[o] = d;
 				let r = n[u];
 				if (r === -1) {
@@ -2376,10 +2347,10 @@ var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
 				}
 				this._link(e, r), this._link(o, n[a]), this._link(a, u);
 				let s = c + (o + 1) % 3;
-				i < We.length && (We[i++] = s);
+				i < Ue.length && (Ue[i++] = s);
 			} else {
 				if (i === 0) break;
-				e = We[--i];
+				e = Ue[--i];
 			}
 		}
 		return a;
@@ -2392,30 +2363,30 @@ var Ue = 2 ** -52, We = new Uint32Array(512), Ge = class e {
 		return this._triangles[o] = e, this._triangles[o + 1] = t, this._triangles[o + 2] = n, this._link(o, r), this._link(o + 1, i), this._link(o + 2, a), this.trianglesLen += 3, o;
 	}
 };
-function Ke(e, t) {
+function Ge(e, t) {
 	let n = e / (Math.abs(e) + Math.abs(t));
 	return (t > 0 ? 3 - n : 1 + n) / 4;
 }
-function qe(e, t, n, r) {
+function Ke(e, t, n, r) {
 	let i = e - n, a = t - r;
 	return i * i + a * a;
 }
-function Je(e, t, n, r, i, a, o, s) {
+function qe(e, t, n, r, i, a, o, s) {
 	let c = e - o, l = t - s, u = n - o, d = r - s, f = i - o, p = a - s, m = c * c + l * l, h = u * u + d * d, g = f * f + p * p;
 	return c * (d * g - h * p) - l * (u * g - h * f) + m * (u * p - d * f) < 0;
 }
-function Ye(e, t, n, r, i, a) {
+function Je(e, t, n, r, i, a) {
 	let o = n - e, s = r - t, c = i - e, l = a - t, u = o * o + s * s, d = c * c + l * l, f = .5 / (o * l - s * c), p = (l * u - s * d) * f, m = (o * d - c * u) * f;
 	return p * p + m * m;
 }
-function Xe(e, t, n, r, i, a) {
+function Ye(e, t, n, r, i, a) {
 	let o = n - e, s = r - t, c = i - e, l = a - t, u = o * o + s * s, d = c * c + l * l, f = .5 / (o * l - s * c);
 	return {
 		x: e + (l * u - s * d) * f,
 		y: t + (o * d - c * u) * f
 	};
 }
-function Ze(e, t, n, r) {
+function Xe(e, t, n, r) {
 	if (r - n <= 20) for (let i = n + 1; i <= r; i++) {
 		let r = e[i], a = t[r], o = i - 1;
 		for (; o >= n && t[e[o]] > a;) e[o + 1] = e[o--];
@@ -2423,7 +2394,7 @@ function Ze(e, t, n, r) {
 	}
 	else {
 		let i = n + r >> 1, a = n + 1, o = r;
-		Qe(e, i, a), t[e[n]] > t[e[r]] && Qe(e, n, r), t[e[a]] > t[e[r]] && Qe(e, a, r), t[e[n]] > t[e[a]] && Qe(e, n, a);
+		Ze(e, i, a), t[e[n]] > t[e[r]] && Ze(e, n, r), t[e[a]] > t[e[r]] && Ze(e, a, r), t[e[n]] > t[e[a]] && Ze(e, n, a);
 		let s = e[a], c = t[s];
 		for (;;) {
 			do
@@ -2433,24 +2404,24 @@ function Ze(e, t, n, r) {
 				o--;
 			while (t[e[o]] > c);
 			if (o < a) break;
-			Qe(e, a, o);
+			Ze(e, a, o);
 		}
-		e[n + 1] = e[o], e[o] = s, r - a + 1 >= o - n ? (Ze(e, t, a, r), Ze(e, t, n, o - 1)) : (Ze(e, t, n, o - 1), Ze(e, t, a, r));
+		e[n + 1] = e[o], e[o] = s, r - a + 1 >= o - n ? (Xe(e, t, a, r), Xe(e, t, n, o - 1)) : (Xe(e, t, n, o - 1), Xe(e, t, a, r));
 	}
 }
-function Qe(e, t, n) {
+function Ze(e, t, n) {
 	let r = e[t];
 	e[t] = e[n], e[n] = r;
 }
-function $e(e) {
+function Qe(e) {
 	return e[0];
 }
-function et(e) {
+function $e(e) {
 	return e[1];
 }
 //#endregion
 //#region node_modules/d3-delaunay/src/path.js
-var tt = 1e-6, nt = class {
+var et = 1e-6, tt = class {
 	constructor() {
 		this._x0 = this._y0 = this._x1 = this._y1 = null, this._ = "";
 	}
@@ -2467,7 +2438,7 @@ var tt = 1e-6, nt = class {
 		e = +e, t = +t, n = +n;
 		let r = e + n, i = t;
 		if (n < 0) throw Error("negative radius");
-		this._x1 === null ? this._ += `M${r},${i}` : (Math.abs(this._x1 - r) > tt || Math.abs(this._y1 - i) > tt) && (this._ += "L" + r + "," + i), n && (this._ += `A${n},${n},0,1,1,${e - n},${t}A${n},${n},0,1,1,${this._x1 = r},${this._y1 = i}`);
+		this._x1 === null ? this._ += `M${r},${i}` : (Math.abs(this._x1 - r) > et || Math.abs(this._y1 - i) > et) && (this._ += "L" + r + "," + i), n && (this._ += `A${n},${n},0,1,1,${e - n},${t}A${n},${n},0,1,1,${this._x1 = r},${this._y1 = i}`);
 	}
 	rect(e, t, n, r) {
 		this._ += `M${this._x0 = this._x1 = +e},${this._y0 = this._y1 = +t}h${+n}v${+r}h${-n}Z`;
@@ -2475,7 +2446,7 @@ var tt = 1e-6, nt = class {
 	value() {
 		return this._ || null;
 	}
-}, rt = class {
+}, nt = class {
 	constructor() {
 		this._ = [];
 	}
@@ -2491,7 +2462,7 @@ var tt = 1e-6, nt = class {
 	value() {
 		return this._.length ? this._ : null;
 	}
-}, it = class {
+}, rt = class {
 	constructor(e, [t, n, r, i] = [
 		0,
 		0,
@@ -2527,7 +2498,7 @@ var tt = 1e-6, nt = class {
 		for (let n = 0; n < t.length; ++n) s = t[n], c = l, u = d, f = p, l = s * 4, d = e[2 * s], p = e[2 * s + 1], r[c + 2] = r[l] = f - p, r[c + 3] = r[l + 1] = d - u;
 	}
 	render(e) {
-		let t = e == null ? e = new nt() : void 0, { delaunay: { halfedges: n, inedges: r, hull: i }, circumcenters: a, vectors: o } = this;
+		let t = e == null ? e = new tt() : void 0, { delaunay: { halfedges: n, inedges: r, hull: i }, circumcenters: a, vectors: o } = this;
 		if (i.length <= 1) return null;
 		for (let t = 0, r = n.length; t < r; ++t) {
 			let r = n[t];
@@ -2544,11 +2515,11 @@ var tt = 1e-6, nt = class {
 		return t && t.value();
 	}
 	renderBounds(e) {
-		let t = e == null ? e = new nt() : void 0;
+		let t = e == null ? e = new tt() : void 0;
 		return e.rect(this.xmin, this.ymin, this.xmax - this.xmin, this.ymax - this.ymin), t && t.value();
 	}
 	renderCell(e, t) {
-		let n = t == null ? t = new nt() : void 0, r = this._clip(e);
+		let n = t == null ? t = new tt() : void 0, r = this._clip(e);
 		if (r === null || !r.length) return;
 		t.moveTo(r[0], r[1]);
 		let i = r.length;
@@ -2564,7 +2535,7 @@ var tt = 1e-6, nt = class {
 		}
 	}
 	cellPolygon(e) {
-		let t = new rt();
+		let t = new nt();
 		return this.renderCell(e, t), t.value();
 	}
 	_renderSegment(e, t, n, r, i) {
@@ -2748,14 +2719,14 @@ var tt = 1e-6, nt = class {
 		}
 		return e;
 	}
-}, at = 2 * Math.PI, ot = Math.pow;
-function st(e) {
+}, it = 2 * Math.PI, at = Math.pow;
+function ot(e) {
 	return e[0];
 }
-function ct(e) {
+function st(e) {
 	return e[1];
 }
-function lt(e) {
+function ct(e) {
 	let { triangles: t, coords: n } = e;
 	for (let e = 0; e < t.length; e += 3) {
 		let r = 2 * t[e], i = 2 * t[e + 1], a = 2 * t[e + 2];
@@ -2763,22 +2734,22 @@ function lt(e) {
 	}
 	return !0;
 }
-function ut(e, t, n) {
+function lt(e, t, n) {
 	return [e + Math.sin(e + t) * n, t + Math.cos(e - t) * n];
 }
-var dt = class e {
-	static from(t, n = st, r = ct, i) {
-		return new e("length" in t ? ft(t, n, r, i) : Float64Array.from(pt(t, n, r, i)));
+var ut = class e {
+	static from(t, n = ot, r = st, i) {
+		return new e("length" in t ? dt(t, n, r, i) : Float64Array.from(ft(t, n, r, i)));
 	}
 	constructor(e) {
-		this._delaunator = new Ge(e), this.inedges = new Int32Array(e.length / 2), this._hullIndex = new Int32Array(e.length / 2), this.points = this._delaunator.coords, this._init();
+		this._delaunator = new We(e), this.inedges = new Int32Array(e.length / 2), this._hullIndex = new Int32Array(e.length / 2), this.points = this._delaunator.coords, this._init();
 	}
 	update() {
 		return this._delaunator.update(), this._init(), this;
 	}
 	_init() {
 		let e = this._delaunator, t = this.points;
-		if (e.hull && e.hull.length > 2 && lt(e)) {
+		if (e.hull && e.hull.length > 2 && ct(e)) {
 			this.collinear = Int32Array.from({ length: t.length / 2 }, (e, t) => t).sort((e, n) => t[2 * e] - t[2 * n] || t[2 * e + 1] - t[2 * n + 1]);
 			let e = this.collinear[0], n = this.collinear[this.collinear.length - 1], r = [
 				t[2 * e],
@@ -2787,10 +2758,10 @@ var dt = class e {
 				t[2 * n + 1]
 			], i = 1e-8 * Math.hypot(r[3] - r[1], r[2] - r[0]);
 			for (let e = 0, n = t.length / 2; e < n; ++e) {
-				let n = ut(t[2 * e], t[2 * e + 1], i);
+				let n = lt(t[2 * e], t[2 * e + 1], i);
 				t[2 * e] = n[0], t[2 * e + 1] = n[1];
 			}
-			this._delaunator = new Ge(t);
+			this._delaunator = new We(t);
 		} else delete this.collinear;
 		let n = this.halfedges = this._delaunator.halfedges, r = this.hull = this._delaunator.hull, i = this.triangles = this._delaunator.triangles, a = this.inedges.fill(-1), o = this._hullIndex.fill(-1);
 		for (let e = 0, t = n.length; e < t; ++e) {
@@ -2801,7 +2772,7 @@ var dt = class e {
 		r.length <= 2 && r.length > 0 && (this.triangles = new Int32Array(3).fill(-1), this.halfedges = new Int32Array(3).fill(-1), this.triangles[0] = r[0], a[r[0]] = 1, r.length === 2 && (a[r[1]] = 0, this.triangles[1] = r[1], this.triangles[2] = r[1]));
 	}
 	voronoi(e) {
-		return new it(this, e);
+		return new rt(this, e);
 	}
 	*neighbors(e) {
 		let { inedges: t, hull: n, _hullIndex: r, halfedges: i, triangles: a, collinear: o } = this;
@@ -2831,19 +2802,19 @@ var dt = class e {
 	_step(e, t, n) {
 		let { inedges: r, hull: i, _hullIndex: a, halfedges: o, triangles: s, points: c } = this;
 		if (r[e] === -1 || !c.length) return (e + 1) % (c.length >> 1);
-		let l = e, u = ot(t - c[e * 2], 2) + ot(n - c[e * 2 + 1], 2), d = r[e], f = d;
+		let l = e, u = at(t - c[e * 2], 2) + at(n - c[e * 2 + 1], 2), d = r[e], f = d;
 		do {
-			let r = s[f], d = ot(t - c[r * 2], 2) + ot(n - c[r * 2 + 1], 2);
+			let r = s[f], d = at(t - c[r * 2], 2) + at(n - c[r * 2 + 1], 2);
 			if (d < u && (u = d, l = r), f = f % 3 == 2 ? f - 2 : f + 1, s[f] !== e) break;
 			if (f = o[f], f === -1) {
-				if (f = i[(a[e] + 1) % i.length], f !== r && ot(t - c[f * 2], 2) + ot(n - c[f * 2 + 1], 2) < u) return f;
+				if (f = i[(a[e] + 1) % i.length], f !== r && at(t - c[f * 2], 2) + at(n - c[f * 2 + 1], 2) < u) return f;
 				break;
 			}
 		} while (f !== d);
 		return l;
 	}
 	render(e) {
-		let t = e == null ? e = new nt() : void 0, { points: n, halfedges: r, triangles: i } = this;
+		let t = e == null ? e = new tt() : void 0, { points: n, halfedges: r, triangles: i } = this;
 		for (let t = 0, a = r.length; t < a; ++t) {
 			let a = r[t];
 			if (a < t) continue;
@@ -2854,15 +2825,15 @@ var dt = class e {
 	}
 	renderPoints(e, t) {
 		t === void 0 && (!e || typeof e.moveTo != "function") && (t = e, e = null), t = t == null ? 2 : +t;
-		let n = e == null ? e = new nt() : void 0, { points: r } = this;
+		let n = e == null ? e = new tt() : void 0, { points: r } = this;
 		for (let n = 0, i = r.length; n < i; n += 2) {
 			let i = r[n], a = r[n + 1];
-			e.moveTo(i + t, a), e.arc(i, a, t, 0, at);
+			e.moveTo(i + t, a), e.arc(i, a, t, 0, it);
 		}
 		return n && n.value();
 	}
 	renderHull(e) {
-		let t = e == null ? e = new nt() : void 0, { hull: n, points: r } = this, i = n[0] * 2, a = n.length;
+		let t = e == null ? e = new tt() : void 0, { hull: n, points: r } = this, i = n[0] * 2, a = n.length;
 		e.moveTo(r[i], r[i + 1]);
 		for (let t = 1; t < a; ++t) {
 			let i = 2 * n[t];
@@ -2871,11 +2842,11 @@ var dt = class e {
 		return e.closePath(), t && t.value();
 	}
 	hullPolygon() {
-		let e = new rt();
+		let e = new nt();
 		return this.renderHull(e), e.value();
 	}
 	renderTriangle(e, t) {
-		let n = t == null ? t = new nt() : void 0, { points: r, triangles: i } = this, a = i[e *= 3] * 2, o = i[e + 1] * 2, s = i[e + 2] * 2;
+		let n = t == null ? t = new tt() : void 0, { points: r, triangles: i } = this, a = i[e *= 3] * 2, o = i[e + 1] * 2, s = i[e + 2] * 2;
 		return t.moveTo(r[a], r[a + 1]), t.lineTo(r[o], r[o + 1]), t.lineTo(r[s], r[s + 1]), t.closePath(), n && n.value();
 	}
 	*trianglePolygons() {
@@ -2883,11 +2854,11 @@ var dt = class e {
 		for (let t = 0, n = e.length / 3; t < n; ++t) yield this.trianglePolygon(t);
 	}
 	trianglePolygon(e) {
-		let t = new rt();
+		let t = new nt();
 		return this.renderTriangle(e, t), t.value();
 	}
 };
-function ft(e, t, n, r) {
+function dt(e, t, n, r) {
 	let i = e.length, a = new Float64Array(i * 2);
 	for (let o = 0; o < i; ++o) {
 		let i = e[o];
@@ -2895,20 +2866,20 @@ function ft(e, t, n, r) {
 	}
 	return a;
 }
-function* pt(e, t, n, r) {
+function* ft(e, t, n, r) {
 	let i = 0;
 	for (let a of e) yield t.call(r, a, i, e), yield n.call(r, a, i, e), ++i;
 }
 //#endregion
 //#region src/utils/clusert.mjs
-function mt(e, t, n, r) {
+function pt(e, t, n, r) {
 	return 1 + (e[t][0] === 0 || e[n][0] === 0 || e[r][0] === 0 ? 1 : 0);
 }
-function ht(e, t, n, r, i, a) {
+function mt(e, t, n, r, i, a) {
 	let o = Math.hypot(n - i, r - a), s = Math.hypot(e - i, t - a), c = Math.hypot(e - n, t - r), l = Math.abs((n - e) * (a - t) - (i - e) * (r - t)) / 2;
 	return l === 0 ? Infinity : o * s * c / (4 * l);
 }
-function gt(e) {
+function ht(e) {
 	if (!e || e.length < 3) return [];
 	let t = /* @__PURE__ */ new Set(), n = [];
 	for (let r of e) {
@@ -2916,12 +2887,12 @@ function gt(e) {
 		t.has(e) || (t.add(e), n.push(r));
 	}
 	if (n.length < 3) return [];
-	let { triangles: r } = new dt(Float64Array.from(n.flat()));
+	let { triangles: r } = new ut(Float64Array.from(n.flat()));
 	if (!r.length) return [];
 	let i = /* @__PURE__ */ new Map(), a = (e, t) => e < t ? `${e}_${t}` : `${t}_${e}`;
 	for (let e = 0; e < r.length; e += 3) {
 		let t = r[e], o = r[e + 1], s = r[e + 2], [c, l] = n[t], [u, d] = n[o], [f, p] = n[s];
-		if (ht(c, l, u, d, f, p) <= 1 / mt(n, t, o, s)) for (let [e, n] of [
+		if (mt(c, l, u, d, f, p) <= 1 / pt(n, t, o, s)) for (let [e, n] of [
 			[t, o],
 			[o, s],
 			[s, t]
@@ -2946,7 +2917,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 +2925,7 @@ var K = {
 		new d()
 	],
 	e: []
-}, q = {
+}, J = {
 	c: null,
 	u: [
 		new d(),
@@ -2962,15 +2933,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 = [], gt = new d(), _t = new d(), vt = new d(), Q = new d(), yt = new d(), bt = new d(), xt = new a(), St = new t(), Ct = new o(), wt = new o(), Tt = new l(), Et = class {
 	constructor(e = new d(), t = new d(), n = new a()) {
 		this.center = e, this.halfSize = t, this.rotation = n;
 	}
@@ -2988,43 +2959,43 @@ 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);
-		t.add(_t.multiplyScalar(r));
-		let a = i.clamp(Z.dot(vt), -n.y, n.y);
-		t.add(vt.multiplyScalar(a));
-		let o = i.clamp(Z.dot(yt), -n.z, n.z);
-		return t.add(yt.multiplyScalar(o)), t;
+		Q.subVectors(e, this.center), this.rotation.extractBasis(gt, _t, vt), t.copy(this.center);
+		let r = i.clamp(Q.dot(gt), -n.x, n.x);
+		t.add(gt.multiplyScalar(r));
+		let a = i.clamp(Q.dot(_t), -n.y, n.y);
+		t.add(_t.multiplyScalar(a));
+		let o = i.clamp(Q.dot(vt), -n.z, n.z);
+		return t.add(vt.multiplyScalar(o)), t;
 	}
 	containsPoint(e) {
-		return Z.subVectors(e, this.center), this.rotation.extractBasis(_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(gt, _t, vt), Math.abs(Q.dot(gt)) <= this.halfSize.x && Math.abs(Q.dot(_t)) <= this.halfSize.y && Math.abs(Q.dot(vt)) <= this.halfSize.z;
 	}
 	intersectsBox3(e) {
 		return this.intersectsOBB(Dt.fromBox3(e));
 	}
 	intersectsSphere(e) {
-		return this.clampPoint(e.center, xt), xt.distanceToSquared(e.center) <= e.radius * e.radius;
+		return this.clampPoint(e.center, bt), bt.distanceToSquared(e.center) <= e.radius * e.radius;
 	}
 	intersectsOBB(e, t = 2 ** -52) {
-		K.c = this.center, K.e[0] = this.halfSize.x, K.e[1] = this.halfSize.y, K.e[2] = this.halfSize.z, this.rotation.extractBasis(K.u[0], K.u[1], K.u[2]), q.c = e.center, q.e[0] = e.halfSize.x, q.e[1] = e.halfSize.y, q.e[2] = e.halfSize.z, e.rotation.extractBasis(q.u[0], q.u[1], q.u[2]);
-		for (let e = 0; e < 3; e++) for (let t = 0; t < 3; t++) J[e][t] = K.u[e].dot(q.u[t]);
-		Z.subVectors(q.c, K.c), X[0] = Z.dot(K.u[0]), X[1] = Z.dot(K.u[1]), X[2] = Z.dot(K.u[2]);
-		for (let e = 0; e < 3; e++) for (let n = 0; n < 3; n++) Y[e][n] = Math.abs(J[e][n]) + t;
+		q.c = this.center, q.e[0] = this.halfSize.x, q.e[1] = this.halfSize.y, q.e[2] = this.halfSize.z, this.rotation.extractBasis(q.u[0], q.u[1], q.u[2]), J.c = e.center, J.e[0] = e.halfSize.x, J.e[1] = e.halfSize.y, J.e[2] = e.halfSize.z, e.rotation.extractBasis(J.u[0], J.u[1], J.u[2]);
+		for (let e = 0; e < 3; e++) for (let t = 0; t < 3; t++) Y[e][t] = q.u[e].dot(J.u[t]);
+		Q.subVectors(J.c, q.c), Z[0] = Q.dot(q.u[0]), Z[1] = Q.dot(q.u[1]), Z[2] = Q.dot(q.u[2]);
+		for (let e = 0; e < 3; e++) for (let n = 0; n < 3; n++) X[e][n] = Math.abs(Y[e][n]) + t;
 		let n, r;
-		for (let e = 0; e < 3; e++) if (n = K.e[e], r = q.e[0] * Y[e][0] + q.e[1] * Y[e][1] + q.e[2] * Y[e][2], Math.abs(X[e]) > n + r) return !1;
-		for (let e = 0; e < 3; e++) if (n = K.e[0] * Y[0][e] + K.e[1] * Y[1][e] + K.e[2] * Y[2][e], r = q.e[e], Math.abs(X[0] * J[0][e] + X[1] * J[1][e] + X[2] * J[2][e]) > n + r) return !1;
-		return n = K.e[1] * Y[2][0] + K.e[2] * Y[1][0], r = q.e[1] * Y[0][2] + q.e[2] * Y[0][1], !(Math.abs(X[2] * J[1][0] - X[1] * J[2][0]) > n + r || (n = K.e[1] * Y[2][1] + K.e[2] * Y[1][1], r = q.e[0] * Y[0][2] + q.e[2] * Y[0][0], Math.abs(X[2] * J[1][1] - X[1] * J[2][1]) > n + r) || (n = K.e[1] * Y[2][2] + K.e[2] * Y[1][2], r = q.e[0] * Y[0][1] + q.e[1] * Y[0][0], Math.abs(X[2] * J[1][2] - X[1] * J[2][2]) > n + r) || (n = K.e[0] * Y[2][0] + K.e[2] * Y[0][0], r = q.e[1] * Y[1][2] + q.e[2] * Y[1][1], Math.abs(X[0] * J[2][0] - X[2] * J[0][0]) > n + r) || (n = K.e[0] * Y[2][1] + K.e[2] * Y[0][1], r = q.e[0] * Y[1][2] + q.e[2] * Y[1][0], Math.abs(X[0] * J[2][1] - X[2] * J[0][1]) > n + r) || (n = K.e[0] * Y[2][2] + K.e[2] * Y[0][2], r = q.e[0] * Y[1][1] + q.e[1] * Y[1][0], Math.abs(X[0] * J[2][2] - X[2] * J[0][2]) > n + r) || (n = K.e[0] * Y[1][0] + K.e[1] * Y[0][0], r = q.e[1] * Y[2][2] + q.e[2] * Y[2][1], Math.abs(X[1] * J[0][0] - X[0] * J[1][0]) > n + r) || (n = K.e[0] * Y[1][1] + K.e[1] * Y[0][1], r = q.e[0] * Y[2][2] + q.e[2] * Y[2][0], Math.abs(X[1] * J[0][1] - X[0] * J[1][1]) > n + r) || (n = K.e[0] * Y[1][2] + K.e[1] * Y[0][2], r = q.e[0] * Y[2][1] + q.e[1] * Y[2][0], Math.abs(X[1] * J[0][2] - X[0] * J[1][2]) > n + r));
+		for (let e = 0; e < 3; e++) if (n = q.e[e], r = J.e[0] * X[e][0] + J.e[1] * X[e][1] + J.e[2] * X[e][2], Math.abs(Z[e]) > n + r) return !1;
+		for (let e = 0; e < 3; e++) if (n = q.e[0] * X[0][e] + q.e[1] * X[1][e] + q.e[2] * X[2][e], r = J.e[e], Math.abs(Z[0] * Y[0][e] + Z[1] * Y[1][e] + Z[2] * Y[2][e]) > n + r) return !1;
+		return n = q.e[1] * X[2][0] + q.e[2] * X[1][0], r = J.e[1] * X[0][2] + J.e[2] * X[0][1], !(Math.abs(Z[2] * Y[1][0] - Z[1] * Y[2][0]) > n + r || (n = q.e[1] * X[2][1] + q.e[2] * X[1][1], r = J.e[0] * X[0][2] + J.e[2] * X[0][0], Math.abs(Z[2] * Y[1][1] - Z[1] * Y[2][1]) > n + r) || (n = q.e[1] * X[2][2] + q.e[2] * X[1][2], r = J.e[0] * X[0][1] + J.e[1] * X[0][0], Math.abs(Z[2] * Y[1][2] - Z[1] * Y[2][2]) > n + r) || (n = q.e[0] * X[2][0] + q.e[2] * X[0][0], r = J.e[1] * X[1][2] + J.e[2] * X[1][1], Math.abs(Z[0] * Y[2][0] - Z[2] * Y[0][0]) > n + r) || (n = q.e[0] * X[2][1] + q.e[2] * X[0][1], r = J.e[0] * X[1][2] + J.e[2] * X[1][0], Math.abs(Z[0] * Y[2][1] - Z[2] * Y[0][1]) > n + r) || (n = q.e[0] * X[2][2] + q.e[2] * X[0][2], r = J.e[0] * X[1][1] + J.e[1] * X[1][0], Math.abs(Z[0] * Y[2][2] - Z[2] * Y[0][2]) > n + r) || (n = q.e[0] * X[1][0] + q.e[1] * X[0][0], r = J.e[1] * X[2][2] + J.e[2] * X[2][1], Math.abs(Z[1] * Y[0][0] - Z[0] * Y[1][0]) > n + r) || (n = q.e[0] * X[1][1] + q.e[1] * X[0][1], r = J.e[0] * X[2][2] + J.e[2] * X[2][0], Math.abs(Z[1] * Y[0][1] - Z[0] * Y[1][1]) > n + r) || (n = q.e[0] * X[1][2] + q.e[1] * X[0][2], r = J.e[0] * X[2][1] + J.e[1] * X[2][0], Math.abs(Z[1] * Y[0][2] - Z[0] * Y[1][2]) > n + r));
 	}
 	intersectsPlane(e) {
-		this.rotation.extractBasis(_t, vt, yt);
-		let t = this.halfSize.x * Math.abs(e.normal.dot(_t)) + this.halfSize.y * Math.abs(e.normal.dot(vt)) + this.halfSize.z * Math.abs(e.normal.dot(yt)), n = e.normal.dot(this.center) - e.constant;
+		this.rotation.extractBasis(gt, _t, vt);
+		let t = this.halfSize.x * Math.abs(e.normal.dot(gt)) + this.halfSize.y * Math.abs(e.normal.dot(_t)) + this.halfSize.z * Math.abs(e.normal.dot(vt)), n = e.normal.dot(this.center) - e.constant;
 		return Math.abs(n) <= t;
 	}
 	intersectRay(e, t) {
-		return this.getSize(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(yt), St.setFromCenterAndSize(Q.set(0, 0, 0), yt), Ct.setFromMatrix3(this.rotation), Ct.setPosition(this.center), wt.copy(Ct).invert(), Tt.copy(e).applyMatrix4(wt), Tt.intersectBox(St, t) ? t.applyMatrix4(Ct) : null;
 	}
 	intersectsRay(e) {
-		return this.intersectRay(e, Z) !== null;
+		return this.intersectRay(e, Q) !== null;
 	}
 	fromBox3(e) {
 		return e.getCenter(this.center), e.getSize(this.halfSize).multiplyScalar(.5), this.rotation.identity(), this;
@@ -3033,10 +3004,10 @@ var K = {
 		return e.center.equals(this.center) && e.halfSize.equals(this.halfSize) && e.rotation.equals(this.rotation);
 	}
 	applyMatrix4(e) {
-		let t = e.elements, n = Z.set(t[0], t[1], t[2]).length(), r = Z.set(t[4], t[5], t[6]).length(), i = Z.set(t[8], t[9], t[10]).length();
-		e.determinant() < 0 && (n = -n), Q.setFromMatrix4(e);
+		let t = e.elements, n = Q.set(t[0], t[1], t[2]).length(), r = Q.set(t[4], t[5], t[6]).length(), i = Q.set(t[8], t[9], t[10]).length();
+		e.determinant() < 0 && (n = -n), xt.setFromMatrix4(e);
 		let a = 1 / n, o = 1 / r, s = 1 / i;
-		return Q.elements[0] *= a, Q.elements[1] *= a, Q.elements[2] *= a, Q.elements[3] *= o, Q.elements[4] *= o, Q.elements[5] *= o, Q.elements[6] *= s, Q.elements[7] *= s, Q.elements[8] *= s, this.rotation.multiply(Q), this.halfSize.x *= n, this.halfSize.y *= r, this.halfSize.z *= i, Z.setFromMatrixPosition(e), this.center.add(Z), this;
+		return xt.elements[0] *= a, xt.elements[1] *= a, xt.elements[2] *= a, xt.elements[3] *= o, xt.elements[4] *= o, xt.elements[5] *= o, xt.elements[6] *= s, xt.elements[7] *= s, xt.elements[8] *= s, this.rotation.multiply(xt), this.halfSize.x *= n, this.halfSize.y *= r, this.halfSize.z *= i, Q.setFromMatrixPosition(e), this.center.add(Q), this;
 	}
 }, Dt = new Et(), $ = 6371008.8, Ot = {
 	centimeters: $ * 100,
@@ -4055,7 +4026,7 @@ var Gn = (t) => {
 		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;
+		if (u === "wall") continue;
 		let d = [];
 		for (let n = 0; n < t[i].points.length; n++) d.push(new e.Vector3(t[i].points[n].x, t[i].points[n].y, t[i].points[n].z));
 		let f = -99999;
@@ -4076,7 +4047,7 @@ var Gn = (t) => {
 		}
 		let p = {
 			points: d,
-			path: gt(a),
+			path: ht(a),
 			h: o.h,
 			minz: o.minz,
 			maxz: o.maxz,
@@ -4130,7 +4101,7 @@ var Gn = (t) => {
 				obb: t[e].obb.clone()
 			};
 			for (let i = e + 1; i < t.length; i++) if (!(t[i].obb == null || r.includes(i)) && n.obb.intersectsOBB(t[i].obb)) {
-				r.push(i), n.points.push(...t[i].points), n.path = gt(n.points.map((e) => [e.x, e.y]));
+				r.push(i), n.points.push(...t[i].points), n.path = ht(n.points.map((e) => [e.x, e.y]));
 				let a = Un(n.points);
 				n.h = a.h, n.minz = a.minz, n.maxz = a.maxz, n.center = {
 					x: a.x,
@@ -4249,11 +4220,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));
 		}
 	}
 	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, he as getAllGeometry, De as getBeamLine, ke as getColLine, Oe as getMainBeamLine, Gn as getMergeMeaning, I as getParallelism, re as getPointCloudMinMax, te as getPointCoverageOnQuad, j as isParallel, L as perpendicularInfo, ae as removeNoisePoints, O as segmentsIntersect2D, ge as updateStEdPoint, Ee as usegetBeamLine };