rm-graphical-computing 1.0.34 → 1.0.36

package/dist/index.js

@@ -1,68 +1,87 @@
 import * as e from "three";
-import { BufferAttribute as t, BufferGeometry as n, Matrix4 as r, Object3D as i, Plane as a, Vector2 as o, Vector3 as s } from "three";
+import { Box3 as t, BufferAttribute as n, BufferGeometry as r, MathUtils as i, Matrix3 as a, Matrix4 as o, Object3D as s, Plane as c, Ray as l, Vector2 as u, Vector3 as d } from "three";
+//#region \0rolldown/runtime.js
+var f = Object.create, p = Object.defineProperty, m = Object.getOwnPropertyDescriptor, h = Object.getOwnPropertyNames, g = Object.getPrototypeOf, _ = Object.prototype.hasOwnProperty, v = (e, t) => () => (e && (t = e(e = 0)), t), y = (e, t) => () => (t || e((t = { exports: {} }).exports, t), t.exports), b = (e, t) => {
+	let n = {};
+	for (var r in e) p(n, r, {
+		get: e[r],
+		enumerable: !0
+	});
+	return t || p(n, Symbol.toStringTag, { value: "Module" }), n;
+}, x = (e, t, n, r) => {
+	if (t && typeof t == "object" || typeof t == "function") for (var i = h(t), a = 0, o = i.length, s; a < o; a++) s = i[a], !_.call(e, s) && s !== n && p(e, s, {
+		get: ((e) => t[e]).bind(null, s),
+		enumerable: !(r = m(t, s)) || r.enumerable
+	});
+	return e;
+}, S = (e, t, n) => (n = e == null ? {} : f(g(e)), x(t || !e || !e.__esModule ? p(n, "default", {
+	value: e,
+	enumerable: !0
+}) : n, e)), C = (e) => _.call(e, "module.exports") ? e["module.exports"] : x(p({}, "__esModule", { value: !0 }), e);
+//#endregion
 //#region node_modules/three/examples/jsm/utils/BufferGeometryUtils.js
-function c(e, t = !1) {
-	let r = e[0].index !== null, i = new Set(Object.keys(e[0].attributes)), a = new Set(Object.keys(e[0].morphAttributes)), o = {}, s = {}, c = e[0].morphTargetsRelative, u = new n(), d = 0;
-	for (let n = 0; n < e.length; ++n) {
-		let l = e[n], f = 0;
-		if (r !== (l.index !== null)) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + n + ". All geometries must have compatible attributes; make sure index attribute exists among all geometries, or in none of them."), null;
-		for (let e in l.attributes) {
-			if (!i.has(e)) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + n + ". All geometries must have compatible attributes; make sure \"" + e + "\" attribute exists among all geometries, or in none of them."), null;
-			o[e] === void 0 && (o[e] = []), o[e].push(l.attributes[e]), f++;
-		}
-		if (f !== i.size) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + n + ". Make sure all geometries have the same number of attributes."), null;
-		if (c !== l.morphTargetsRelative) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + n + ". .morphTargetsRelative must be consistent throughout all geometries."), null;
-		for (let e in l.morphAttributes) {
-			if (!a.has(e)) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + n + ".  .morphAttributes must be consistent throughout all geometries."), null;
-			s[e] === void 0 && (s[e] = []), s[e].push(l.morphAttributes[e]);
+function w(e, t = !1) {
+	let n = e[0].index !== null, i = new Set(Object.keys(e[0].attributes)), a = new Set(Object.keys(e[0].morphAttributes)), o = {}, s = {}, c = e[0].morphTargetsRelative, l = new r(), u = 0;
+	for (let r = 0; r < e.length; ++r) {
+		let d = e[r], f = 0;
+		if (n !== (d.index !== null)) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + r + ". All geometries must have compatible attributes; make sure index attribute exists among all geometries, or in none of them."), null;
+		for (let e in d.attributes) {
+			if (!i.has(e)) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + r + ". All geometries must have compatible attributes; make sure \"" + e + "\" attribute exists among all geometries, or in none of them."), null;
+			o[e] === void 0 && (o[e] = []), o[e].push(d.attributes[e]), f++;
+		}
+		if (f !== i.size) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + r + ". Make sure all geometries have the same number of attributes."), null;
+		if (c !== d.morphTargetsRelative) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + r + ". .morphTargetsRelative must be consistent throughout all geometries."), null;
+		for (let e in d.morphAttributes) {
+			if (!a.has(e)) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + r + ".  .morphAttributes must be consistent throughout all geometries."), null;
+			s[e] === void 0 && (s[e] = []), s[e].push(d.morphAttributes[e]);
 		}
 		if (t) {
 			let e;
-			if (r) e = l.index.count;
-			else if (l.attributes.position !== void 0) e = l.attributes.position.count;
-			else return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + n + ". The geometry must have either an index or a position attribute"), null;
-			u.addGroup(d, e, n), d += e;
+			if (n) e = d.index.count;
+			else if (d.attributes.position !== void 0) e = d.attributes.position.count;
+			else return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index " + r + ". The geometry must have either an index or a position attribute"), null;
+			l.addGroup(u, e, r), u += e;
 		}
 	}
-	if (r) {
+	if (n) {
 		let t = 0, n = [];
 		for (let r = 0; r < e.length; ++r) {
 			let i = e[r].index;
 			for (let e = 0; e < i.count; ++e) n.push(i.getX(e) + t);
 			t += e[r].attributes.position.count;
 		}
-		u.setIndex(n);
+		l.setIndex(n);
 	}
 	for (let e in o) {
-		let t = l(o[e]);
+		let t = T(o[e]);
 		if (!t) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + e + " attribute."), null;
-		u.setAttribute(e, t);
+		l.setAttribute(e, t);
 	}
 	for (let e in s) {
 		let t = s[e][0].length;
 		if (t === 0) break;
-		u.morphAttributes = u.morphAttributes || {}, u.morphAttributes[e] = [];
+		l.morphAttributes = l.morphAttributes || {}, l.morphAttributes[e] = [];
 		for (let n = 0; n < t; ++n) {
 			let t = [];
 			for (let r = 0; r < s[e].length; ++r) t.push(s[e][r][n]);
-			let r = l(t);
+			let r = T(t);
 			if (!r) return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + e + " morphAttribute."), null;
-			u.morphAttributes[e].push(r);
+			l.morphAttributes[e].push(r);
 		}
 	}
-	return u;
+	return l;
 }
-function l(e) {
-	let n, r, i, a = -1, o = 0;
-	for (let t = 0; t < e.length; ++t) {
-		let s = e[t];
-		if (n === void 0 && (n = s.array.constructor), n !== s.array.constructor) return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.array must be of consistent array types across matching attributes."), null;
+function T(e) {
+	let t, r, i, a = -1, o = 0;
+	for (let n = 0; n < e.length; ++n) {
+		let s = e[n];
+		if (t === void 0 && (t = s.array.constructor), t !== s.array.constructor) return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.array must be of consistent array types across matching attributes."), null;
 		if (r === void 0 && (r = s.itemSize), r !== s.itemSize) return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.itemSize must be consistent across matching attributes."), null;
 		if (i === void 0 && (i = s.normalized), i !== s.normalized) return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.normalized must be consistent across matching attributes."), null;
 		if (a === -1 && (a = s.gpuType), a !== s.gpuType) return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.gpuType must be consistent across matching attributes."), null;
 		o += s.count * r;
 	}
-	let s = new n(o), c = new t(s, r, i), l = 0;
+	let s = new t(o), c = new n(s, r, i), l = 0;
 	for (let t = 0; t < e.length; ++t) {
 		let n = e[t];
 		if (n.isInterleavedBufferAttribute) {
@@ -78,9 +97,9 @@ function l(e) {
 }
 //#endregion
 //#region node_modules/three/examples/jsm/renderers/CSS2DRenderer.js
-var u = class extends i {
+var E = class extends s {
 	constructor(e = document.createElement("div")) {
-		super(), this.isCSS2DObject = !0, this.element = e, this.element.style.position = "absolute", this.element.style.userSelect = "none", this.element.setAttribute("draggable", !1), this.center = new o(.5, .5), this.addEventListener("removed", function() {
+		super(), this.isCSS2DObject = !0, this.element = e, this.element.style.position = "absolute", this.element.style.userSelect = "none", this.element.setAttribute("draggable", !1), this.center = new u(.5, .5), this.addEventListener("removed", function() {
 			this.traverse(function(e) {
 				e.element && e.element instanceof e.element.ownerDocument.defaultView.Element && e.element.parentNode !== null && e.element.remove();
 			});
@@ -90,31 +109,31 @@ var u = class extends i {
 		return super.copy(e, t), this.element = e.element.cloneNode(!0), this.center = e.center, this;
 	}
 };
-new s(), new r(), new r(), new s(), new s();
+new d(), new o(), new o(), new d(), new d();
 //#endregion
 //#region src/utils/utils.mjs
-var d = (t, n, r, i, a = 1e-8) => {
+var D = (t, n, r, i, a = 1e-8) => {
 	let o = n.x - t.x, s = n.y - t.y, c = i.x - r.x, l = i.y - r.y, u = o * l - s * c;
 	if (Math.abs(u) < a) return null;
 	let d = ((r.x - t.x) * l - (r.y - t.y) * c) / u, f = ((r.x - t.x) * s - (r.y - t.y) * o) / u;
 	return d < -a || d > 1 + a || f < -a || f > 1 + a ? null : { point: new e.Vector3(t.x + d * o, t.y + d * s, t.z) };
-}, f = (t, n, r = {}) => {
+}, O = (t, n, r = {}) => {
 	let { fontSize: i = 36, fontFamily: a = "sans-serif", backgroundColor: o = "rgba(0,0,0,0)", textColor: s = "#ffffff", padding: c = 10, maxWidth: l = 256 } = r, u = document.createElement("canvas").getContext("2d");
 	u.font = `bold ${i}px ${a}`;
-	let d = u.measureText(t).width, f = Math.min(d + c * 2, l), m = i + c * 2, h = document.createElement("canvas");
-	h.width = f, h.height = m;
-	let g = h.getContext("2d");
-	g.fillStyle = o, g.fillRect(0, 0, f, m), g.fillStyle = s, g.font = `bold ${i}px ${a}`, g.textAlign = "center", g.textBaseline = "middle", d > l - c * 2 ? p(g, t, f / 2, m / 2, l, i) : g.fillText(t, f / 2, m / 2);
-	let _ = new e.CanvasTexture(h), v = new e.SpriteMaterial({
-		map: _,
+	let d = u.measureText(t).width, f = Math.min(d + c * 2, l), p = i + c * 2, m = document.createElement("canvas");
+	m.width = f, m.height = p;
+	let h = m.getContext("2d");
+	h.fillStyle = o, h.fillRect(0, 0, f, p), h.fillStyle = s, h.font = `bold ${i}px ${a}`, h.textAlign = "center", h.textBaseline = "middle", d > l - c * 2 ? k(h, t, f / 2, p / 2, l, i) : h.fillText(t, f / 2, p / 2);
+	let g = new e.CanvasTexture(m), _ = new e.SpriteMaterial({
+		map: g,
 		depthTest: !1,
 		transparent: !0
-	}), y = new e.Sprite(v);
-	y.position.set(n.x, n.y, n.z);
-	let b = .005;
-	return y.scale.set(f * b, m * b, 1), y;
+	}), v = new e.Sprite(_);
+	v.position.set(n.x, n.y, n.z);
+	let y = .005;
+	return v.scale.set(f * y, p * y, 1), v;
 };
-function p(e, t, n, r, i, a) {
+function k(e, t, n, r, i, a) {
 	let o = t.split(""), s = "", c = a * 1.2, l = r;
 	for (let t = 0; t < o.length; t++) {
 		let r = s + o[t];
@@ -122,7 +141,7 @@ function p(e, t, n, r, i, a) {
 	}
 	e.fillText(s, n, l);
 }
-var m = (e, t, n = .01) => {
+var A = (e, t, n = .01) => {
 	let r = Math.sqrt(e.x * e.x + e.y * e.y + e.z * e.z), i = Math.sqrt(t.x * t.x + t.y * t.y + t.z * t.z);
 	if (r < 1e-10 || i < 1e-10) return {
 		parallel: !1,
@@ -146,7 +165,7 @@ var m = (e, t, n = .01) => {
 		angle: c
 	};
 };
-function h(t, n, r) {
+function j(t, n, r) {
 	let i = new e.BufferGeometry(), a = [], o = [];
 	t.forEach((e) => a.push(e.x, e.y, e.z)), n.forEach((e) => a.push(e.x, e.y, e.z)), o.push(0, 2, 1, 0, 3, 2), o.push(4, 5, 6, 4, 6, 7), o.push(0, 1, 5, 0, 5, 4), o.push(1, 2, 6, 1, 6, 5), o.push(2, 3, 7, 2, 7, 6), o.push(3, 0, 4, 3, 4, 7), i.setAttribute("position", new e.Float32BufferAttribute(a, 3)), i.setIndex(o), i.computeVertexNormals();
 	let s = new e.MeshBasicMaterial({
@@ -157,7 +176,7 @@ function h(t, n, r) {
 	});
 	return new e.Mesh(i, s);
 }
-var g = class {
+var M = class {
 	constructor(t = {}) {
 		this.config = {
 			value: t.value || "0.0000m",
@@ -172,7 +191,7 @@ var g = class {
 		}, this.label = null, this.labelElement = null, this.createLabel();
 	}
 	createLabel() {
-		return this.labelElement = document.createElement("div"), this.labelElement.textContent = this.config.value, this.applyBlackWhiteStyle(), this.label = new u(this.labelElement), this.label.position.copy(this.config.position), this.label;
+		return this.labelElement = document.createElement("div"), this.labelElement.textContent = this.config.value, this.applyBlackWhiteStyle(), this.label = new E(this.labelElement), this.label.position.copy(this.config.position), this.label;
 	}
 	applyBlackWhiteStyle() {
 		let e = this.labelElement.style, t = this.config;
@@ -199,33 +218,33 @@ var g = class {
 	dispose() {
 		this.labelElement && this.labelElement.parentNode && this.labelElement.parentNode.removeChild(this.labelElement), this.label = null, this.labelElement = null;
 	}
-}, _ = (t) => {
+}, N = (t) => {
 	let n = new e.Group(), r = new e.Group();
 	if (t && t.length) {
 		let i = /* @__PURE__ */ "green.red.pink.white.azure.yellow.bisque.grey.blanchedalmond.blue.blueviolet.brown.burlywood.cadetblue.chartreuse.chocolate.coral.cornflowerblue.cornsilk.crimson.cyan.darkblue.darkcyan.darkgoldenrod.darkgray.darkgreen.darkgrey.darkkhaki.darkmagenta.darkolivegreen.darkorange.darkorchid.darkred.darksalmon.darkseagreen.darkslateblue.darkslategray.darkslategrey.darkturquoise.darkviolet.deeppink.deepskyblue.dimgray.dimgrey.dodgerblue.firebrick.floralwhite.forestgreen.fuchsia.gainsboro.ghostwhite.gold.goldenrod.gray.aliceblue.greenyellow.black.honeydew.hotpink.indianred.indigo.ivory.khaki.lavender.lavenderblush.lawngreen.lemonchiffon.lightblue.lightcoral.lightcyan.lightgoldenrodyellow.lightgray.lightgreen.lightgrey.lightpink.lightsalmon.lightseagreen.lightskyblue.lightslategray.lightslategrey.lightsteelblue.lightyellow.lime.limegreen.linen.magenta.maroon.mediumaquamarine.mediumblue.mediumorchid.mediumpurple.mediumseagreen.mediumslateblue.mediumspringgreen.mediumturquoise.mediumvioletred.midnightblue.mintcream.mistyrose.moccasin.navajowhite.navy.oldlace.olive.olivedrab.orange.orangered.orchid.palegoldenrod.palegreen.paleturquoise.palevioletred.papayawhip.peachpuff.peru.pink.plum.powderblue.purple.rebeccapurple.yellow.rosybrown.royalblue.saddlebrown.salmon.sandybrown.seagreen.seashell.sienna.silver.skyblue.slateblue.slategray.slategrey.snow.springgreen.steelblue.tan.teal.thistle.tomato.turquoise.violet.wheat.white.whitesmoke.yellow.yellowgreen".split(".");
 		t.forEach((t, a) => {
-			let o = i[a], s = new e.Group(), { pcdPoints: c, category: l, name: u, center: d, box: f, obbBox: p, contour: m, nline: _, coordinatesByWidth: v, coordinatesByArea: y } = t, b = c.length, x = new e.Box3(new e.Vector3(f.min.x, f.min.y, f.min.z), new e.Vector3(f.max.x, f.max.y, f.max.z)), S = new e.Box3Helper(x, o);
-			s.add(S);
-			let C = new g({
+			let o = i[a], s = new e.Group(), { pcdPoints: c, category: l, name: u, center: d, box: f, obbBox: p, contour: m, nline: h, coordinatesByWidth: g, coordinatesByArea: _ } = t, v = c.length, y = new e.Box3(new e.Vector3(f.min.x, f.min.y, f.min.z), new e.Vector3(f.max.x, f.max.y, f.max.z)), b = new e.Box3Helper(y, o);
+			s.add(b);
+			let x = new M({
 				value: u,
 				position: new e.Vector3(d.x, d.y, d.z)
 			}).getLabel();
-			s.add(C);
-			let w = new e.InstancedMesh(new e.SphereGeometry(.007, 8, 8), new e.MeshBasicMaterial({ color: o }), b);
-			s.add(w);
-			let T = new e.Matrix4(), E = 0;
+			s.add(x);
+			let S = new e.InstancedMesh(new e.SphereGeometry(.007, 8, 8), new e.MeshBasicMaterial({ color: o }), v);
+			s.add(S);
+			let C = new e.Matrix4(), w = 0;
 			if (c.forEach((e) => {
-				T.setPosition(e.x, e.y, e.z), w.setMatrixAt(E, T), E++;
-			}), w.instanceMatrix.needsUpdate = !0, _) {
+				C.setPosition(e.x, e.y, e.z), S.setMatrixAt(w, C), w++;
+			}), S.instanceMatrix.needsUpdate = !0, h) {
 				let t = new e.BufferGeometry();
-				t.setFromPoints([new e.Vector3(_.start.x, _.start.y, _.start.z), new e.Vector3(_.end.x, _.end.y, _.end.z)]);
+				t.setFromPoints([new e.Vector3(h.start.x, h.start.y, h.start.z), new e.Vector3(h.end.x, h.end.y, h.end.z)]);
 				let n = new e.LineBasicMaterial({
 					color: "red",
 					depthTest: !1,
 					depthWrite: !1
 				});
 				new e.Line(t, n);
-				let r = new e.Vector3().copy(new e.Vector3(_.start.x, _.start.y, _.start.z)).add(new e.Vector3(_.end.x, _.end.y, _.end.z)).multiplyScalar(.5), i = new e.Vector3(_.centerDir.x, _.centerDir.y, _.centerDir.z);
+				let r = new e.Vector3().copy(new e.Vector3(h.start.x, h.start.y, h.start.z)).add(new e.Vector3(h.end.x, h.end.y, h.end.z)).multiplyScalar(.5), i = new e.Vector3(h.centerDir.x, h.centerDir.y, h.centerDir.z);
 				new e.ArrowHelper(i, r, 1, "red");
 			}
 			if (m) {
@@ -242,9 +261,9 @@ var g = class {
 				}), o = new e.Line(i, a);
 				l == "door" ? n.add(o) : r.add(o);
 			}
-			if (y) {
+			if (_) {
 				let t = [], i = [];
-				y.coordinates.forEach((n, r) => {
+				_.coordinates.forEach((n, r) => {
 					t.push(new e.Vector3(n.x, n.y, n.z)), i.length < 4 && i.push(new e.Vector3(n.x, n.y, n.z));
 				});
 				let a = new e.BufferGeometry();
@@ -255,17 +274,17 @@ var g = class {
 					depthWrite: !1
 				}), s = new e.Line(a, o);
 				l == "door" ? n.add(s) : r.add(s);
-				let c = h(i.map((t) => new e.Vector3(t.x, t.y, y.heightData.minZ)), i.map((t) => new e.Vector3(t.x, t.y, t.z)), l);
+				let c = j(i.map((t) => new e.Vector3(t.x, t.y, _.heightData.minZ)), i.map((t) => new e.Vector3(t.x, t.y, t.z)), l);
 				l == "door" ? n.add(c) : r.add(c);
 				let [u, d, f] = t, p = u.distanceTo(d), m = new e.Vector3().copy(u).add(d).multiplyScalar(.5);
-				new g({
+				new M({
 					value: String(p.toFixed(3)),
 					position: m
 				}).getLabel();
-				let _ = d.distanceTo(f), v = new e.Vector3().copy(d).add(f).multiplyScalar(.5);
-				new g({
-					value: String(_.toFixed(3)),
-					position: v
+				let h = d.distanceTo(f), g = new e.Vector3().copy(d).add(f).multiplyScalar(.5);
+				new M({
+					value: String(h.toFixed(3)),
+					position: g
 				}).getLabel();
 			}
 			if (p) {
@@ -281,7 +300,7 @@ var g = class {
 		AiProjectionGroup: n,
 		AiProjectionGroup2: r
 	};
-}, v = (t, n, r, i) => {
+}, P = (t, n, r, i) => {
 	let a = t, o = [];
 	if (i && i.length && (o = i.map((e) => e.clone())), !a || a.length < 4) return {};
 	let s = new e.Vector3().subVectors(a[1], a[0]).normalize(), c = new e.Vector3().subVectors(a[3], a[0]).normalize(), l = s.clone().cross(c).normalize(), u = Infinity, d = -Infinity, f = Infinity, p = -Infinity;
@@ -289,23 +308,23 @@ var g = class {
 		let t = e.dot(s), n = e.dot(c);
 		t < u && (u = t), t > d && (d = t), n < f && (f = n), n > p && (p = n);
 	}
-	let h = a[0].dot(l), g = s.clone().multiplyScalar(u).add(c.clone().multiplyScalar(f)).add(l.clone().multiplyScalar(h)), _ = s.clone().multiplyScalar(d).add(c.clone().multiplyScalar(f)).add(l.clone().multiplyScalar(h)), v = s.clone().multiplyScalar(d).add(c.clone().multiplyScalar(p)).add(l.clone().multiplyScalar(h)), y = s.clone().multiplyScalar(u).add(c.clone().multiplyScalar(p)).add(l.clone().multiplyScalar(h)), b = [
+	let m = a[0].dot(l), h = s.clone().multiplyScalar(u).add(c.clone().multiplyScalar(f)).add(l.clone().multiplyScalar(m)), g = s.clone().multiplyScalar(d).add(c.clone().multiplyScalar(f)).add(l.clone().multiplyScalar(m)), _ = s.clone().multiplyScalar(d).add(c.clone().multiplyScalar(p)).add(l.clone().multiplyScalar(m)), v = s.clone().multiplyScalar(u).add(c.clone().multiplyScalar(p)).add(l.clone().multiplyScalar(m)), y = [
+		h,
 		g,
 		_,
+		v
+	], b = A(new e.Vector3().subVectors(h, g), new e.Vector3(0, 0, 1));
+	b && b.parallel && (y = [
+		h,
 		v,
-		y
-	], x = m(new e.Vector3().subVectors(g, _), new e.Vector3(0, 0, 1));
-	x && x.parallel && (b = [
-		g,
-		y,
-		v,
-		_
+		_,
+		g
 	]);
-	let S = 0;
+	let x = 0;
 	if (i.length > 0) {
-		let t = new e.Vector3().subVectors(b[1], b[0]).normalize(), i = t.clone().negate(), a = new e.Vector3().subVectors(b[3], b[0]).normalize(), s = a.clone().negate(), c = b[0].distanceTo(b[1]), l = b[0].distanceTo(b[3]), u = c / n, d = l / r, f = .001;
+		let t = new e.Vector3().subVectors(y[1], y[0]).normalize(), i = t.clone().negate(), a = new e.Vector3().subVectors(y[3], y[0]).normalize(), s = a.clone().negate(), c = y[0].distanceTo(y[1]), l = y[0].distanceTo(y[3]), u = c / n, d = l / r, f = .001;
 		for (let i = 0; i < u; i++) {
-			let i = b[0], s = 0;
+			let i = y[0], s = 0;
 			for (let c = 0; c < d; c++) {
 				let c = i.clone().addScaledVector(t, n), l = c.clone().addScaledVector(a, r), u = i.clone().addScaledVector(a, r), d = new e.Vector3().add(i).add(c).add(l).add(u).multiplyScalar(.25);
 				for (let e = 0; e < o.length; e++) if (o[e].distanceTo(d) < f) {
@@ -315,11 +334,11 @@ var g = class {
 				i = u;
 			}
 			if (s >= d / 2) break;
-			S += s, b[0] = b[0].addScaledVector(t, n), b[3] = b[3].addScaledVector(t, n);
+			x += s, y[0] = y[0].addScaledVector(t, n), y[3] = y[3].addScaledVector(t, n);
 		}
-		c = b[0].distanceTo(b[1]), u = c / n;
+		c = y[0].distanceTo(y[1]), u = c / n;
 		for (let t = 0; t < u; t++) {
-			let t = b[1], s = 0;
+			let t = y[1], s = 0;
 			for (let c = 0; c < d; c++) {
 				let c = t.clone().addScaledVector(i, n), l = c.clone().addScaledVector(a, r), u = t.clone().addScaledVector(a, r), d = new e.Vector3().add(t).add(c).add(l).add(u).multiplyScalar(.25);
 				for (let e = 0; e < o.length; e++) if (o[e].distanceTo(d) < f) {
@@ -329,11 +348,11 @@ var g = class {
 				t = u;
 			}
 			if (s >= d / 2) break;
-			S += s, b[1] = b[1].addScaledVector(i, n), b[2] = b[2].addScaledVector(i, n);
+			x += s, y[1] = y[1].addScaledVector(i, n), y[2] = y[2].addScaledVector(i, n);
 		}
-		c = b[0].distanceTo(b[1]), u = c / n;
+		c = y[0].distanceTo(y[1]), u = c / n;
 		for (let i = 0; i < d; i++) {
-			let i = b[3], a = 0;
+			let i = y[3], a = 0;
 			for (let c = 0; c < u; c++) {
 				let c = i.clone().addScaledVector(t, n), l = c.clone().addScaledVector(s, r), u = i.clone().addScaledVector(s, r), d = new e.Vector3().add(i).add(c).add(l).add(u).multiplyScalar(.25);
 				for (let e = 0; e < o.length; e++) if (o[e].distanceTo(d) < f) {
@@ -343,16 +362,16 @@ var g = class {
 				i = c;
 			}
 			if (a >= u / 2) break;
-			S += a, b[2] = b[2].addScaledVector(s, r), b[3] = b[3].addScaledVector(s, r);
+			x += a, y[2] = y[2].addScaledVector(s, r), y[3] = y[3].addScaledVector(s, r);
 		}
 	}
-	let C = b[0].distanceTo(b[1]) * b[0].distanceTo(b[3]);
+	let S = y[0].distanceTo(y[1]) * y[0].distanceTo(y[3]);
 	return {
-		facePoints: b,
-		boxArea: C,
-		totalInPlaneNum: S
+		facePoints: y,
+		boxArea: S,
+		totalInPlaneNum: x
 	};
-}, y = (t, n, r, i, a = e.MathUtils.degToRad(8)) => {
+}, F = (t, n, r, i, a = e.MathUtils.degToRad(8)) => {
 	let o = new e.Vector3(), s = new e.Vector3();
 	o.subVectors(new e.Vector3(n.x, n.y, 0), new e.Vector3(t.x, t.y, 0)).normalize(), s.subVectors(new e.Vector3(i.x, i.y, 0), new e.Vector3(r.x, r.y, 0)).normalize();
 	let c = o.dot(s), l = Math.acos(Math.min(Math.abs(c), 1)), u = 1 - Math.min(l / a, 1), d = c > 0 ? "same" : "opposite";
@@ -367,7 +386,7 @@ var g = class {
 			v2: s
 		}
 	};
-}, b = (t, n, r, i) => {
+}, I = (t, n, r, i) => {
 	let a = new e.Vector3().subVectors(n, t), o = new e.Vector3().subVectors(i, r), s = a.length(), c = o.length();
 	if (s === 0 || c === 0) return {
 		rate: NaN,
@@ -384,7 +403,7 @@ var g = class {
 		isPerpendicular: Math.abs(f - 90) < .01,
 		isParallel: f < .01
 	};
-}, x = (t, n, r = !1) => new e.Vector3((t.x + n.x) / 2, (t.y + n.y) / 2, r ? 0 : (t.z + n.z) / 2), S = (t, n, r, i, a = {}) => {
+}, L = (t, n, r = !1) => new e.Vector3((t.x + n.x) / 2, (t.y + n.y) / 2, r ? 0 : (t.z + n.z) / 2), R = (t, n, r, i, a = {}) => {
 	let { parallelAngleMax: o = e.MathUtils.degToRad(10), collinearAngleMax: s = e.MathUtils.degToRad(7), distanceThreshold: c = 2, overlapThreshold: l = .01 } = a, u = new e.Vector3().subVectors(n, t), d = new e.Vector3().subVectors(i, r), f = u.clone().normalize(), p = d.clone().normalize(), m = e.MathUtils.clamp(f.dot(p), -1, 1), h = Math.acos(Math.abs(m)), g = e.MathUtils.radToDeg(h);
 	if (h > o) return {
 		type: "not_parallel",
@@ -396,28 +415,28 @@ var g = 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 = C(r, v, f), b = C(i, v, f), x = (y + b) / 2, S = Math.max(y, b), T = t.dot(_), E = n.dot(_), D = r.dot(_), O = i.dot(_), k = Math.min(T, E), A = Math.max(T, E), j = Math.min(D, O), M = Math.max(D, O), N = A - k, P = M - j, F = Math.min(N, P), I = Math.min(A, M) - Math.max(k, j), L = I < 0 ? -I : 0, R = I > 0 ? I : 0, z = F > 0 ? R / F : 0, B = w(t, n, r, i), V = h <= s && x < c, H;
-	return V ? H = z > .5 ? "collinear_overlap" : "collinear_gap" : h <= o && (H = "parallel_offset"), {
-		type: H,
+	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,
 		angleDeg: g,
 		avgPerpendicularDistance: x,
 		maxPerpendicularDistance: S,
-		gap: L,
-		overlap: R,
-		closestDistance: B
+		gap: F,
+		overlap: I,
+		closestDistance: R
 	};
 };
-function C(t, n, r) {
+function ee(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 w(t, n, r, i) {
+function te(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 T = (t, n, r, i = .05, a = .02) => {
+var z = (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);
@@ -438,8 +457,8 @@ var T = (t, n, r, i = .05, a = .02) => {
 		quadArea: O,
 		coveredArea: k
 	};
-}, E = (e, t) => Math.round(Math.max(5, Math.min(350, t * Math.sqrt(e)))), D = (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 = E(i, 100), s = E(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,
@@ -466,7 +485,7 @@ var T = (t, n, r, i = .05, a = .02) => {
 		minZ: p,
 		maxZ: m
 	};
-}, O = (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 = [];
@@ -483,7 +502,7 @@ var T = (t, n, r, i = .05, a = .02) => {
 		newOriginalPoints: f,
 		newProjectPoints: p
 	};
-}, k = (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 (;;) {
@@ -525,45 +544,45 @@ var T = (t, n, r, i = .05, a = .02) => {
 		if (i.checkResults[0].originalVertices && i.checkResults[0].originalVertices.length > 0) {
 			let [t, n, r, s] = i.checkResults[0].originalVertices[0];
 			t = new e.Vector3(t.x, t.y, t.z), n = new e.Vector3(n.x, n.y, n.z), r = new e.Vector3(r.x, r.y, r.z), s = new e.Vector3(s.x, s.y, s.z), a = t.distanceTo(n), o = t.distanceTo(s);
-			let c = m(new e.Vector3().subVectors(t, n).normalize(), new e.Vector3(0, 0, 1));
+			let c = A(new e.Vector3().subVectors(t, n).normalize(), new e.Vector3(0, 0, 1));
 			c && c.parallel && ([o, a] = [a, o]);
 		}
 		if (a < 0 || o < 0) continue;
-		let s = new e.Vector3(i.start.x, i.start.y, i.start.z), c = new e.Vector3(i.end.x, i.end.y, i.end.z), l = s.distanceTo(c), u = i.rooftopPz - i.start.z, d = Math.ceil(l / a), f = Math.ceil(u / o), p = s.clone(), h = c.clone(), g = h.clone().add(new e.Vector3(0, 0, u)), _ = p.clone().add(new e.Vector3(0, 0, u)), v = new e.Vector3().subVectors(h, p).normalize(), y = v.clone().negate();
-		new e.Vector3().subVectors(g, p).normalize().clone().negate();
-		let b = a / 2;
+		let s = new e.Vector3(i.start.x, i.start.y, i.start.z), c = new e.Vector3(i.end.x, i.end.y, i.end.z), l = s.distanceTo(c), u = i.rooftopPz - i.start.z, d = Math.ceil(l / a), f = Math.ceil(u / o), p = s.clone(), m = c.clone(), h = m.clone().add(new e.Vector3(0, 0, u)), g = p.clone().add(new e.Vector3(0, 0, u)), _ = new e.Vector3().subVectors(m, p).normalize(), v = _.clone().negate();
+		new e.Vector3().subVectors(h, p).normalize().clone().negate();
+		let y = a / 2;
 		o / 2;
-		let x = l * u / (a * o);
-		n(p, _, v, a, b, f, d, x, i), n(h, g, y, a, b, f, d, x, i), i.start = p, i.end = h;
-		let { newOriginalPoints: S } = O(p, h, i.originalPoints);
-		i.originalPoints = S;
+		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 } = ie(p, m, i.originalPoints);
+		i.originalPoints = x;
 	}
-}, A = (t, n) => new e.Vector3(t.x, t.y, 0).distanceTo(new e.Vector3(n.x, n.y, 0)), j = (t, n, r = 1e-6) => {
+}, B = (t, n) => new e.Vector3(t.x, t.y, 0).distanceTo(new e.Vector3(n.x, n.y, 0)), oe = (t, n, r = 1e-6) => {
 	let i = new e.Vector3();
 	return t.closestPointToPoint(n, !0, i), i.distanceTo(n) < r;
-}, M = (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;
-}, N = (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, P = (e) => {
+}, V = (e, t, n = .03) => Math.abs(e.x - t.x) < n && Math.abs(e.y - t.y) < n && Math.abs(e.z - t.z) < n, ce = (e) => {
 	let t = [];
 	e.children.forEach((e) => {
 		e.type == "GridHelper" || e.type == "DirectionalLight" || e.type == "AmbientLight" || t.push(e);
 	}), t.forEach((t) => {
-		e.remove(t), I(t);
+		e.remove(t), ue(t);
 	});
-}, F = () => `#${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 I(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), I(t);
+		e.remove(t), ue(t);
 	}
-	e.geometry && e.geometry.dispose(), e.material && (Array.isArray(e.material) ? e.material.forEach((e) => L(e)) : L(e.material));
+	e.geometry && e.geometry.dispose(), e.material && (Array.isArray(e.material) ? e.material.forEach((e) => de(e)) : de(e.material));
 }
-function L(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();
@@ -572,7 +591,7 @@ function L(e) {
 }
 //#endregion
 //#region src/geometry/handleWallSegment.mjs
-var R = class {
+var fe = class {
 	results;
 	clusterResults;
 	constructor() {
@@ -998,114 +1017,114 @@ var R = class {
 			t.forEach((e, t) => {
 				e.applyMatrix4(n[t].matrixWorld);
 			});
-			let r = c(t), i = n[0].material.clone(), a = new e.Mesh(r, i);
+			let r = w(t), i = n[0].material.clone(), a = new e.Mesh(r, i);
 			return a.name = "mergedWalls", a;
 		} catch (e) {
 			return console.error("合并网格时出错:", e), null;
 		}
 	}
-}, z = (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;
-}, B = (e) => {
-	let t = new s().copy(e.start).add(e.end).multiplyScalar(.5), n = new s().subVectors(new s(t.x, t.y, t.z + 1), t).normalize(), r = new s(e.direction.x, e.direction.y, 0);
+}, 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 s().copy(t).add(r.clone().multiplyScalar(e.length)), a = new s().copy(t).sub(r.clone().multiplyScalar(e.length));
+	let i = new d().copy(t).add(r.clone().multiplyScalar(e.length)), a = new d().copy(t).sub(r.clone().multiplyScalar(e.length));
 	return t.z = e.start.z, i.z = e.start.z, a.z = e.start.z, {
 		start: i,
 		end: a,
 		center: t,
 		direction: r
 	};
-}, V = (t, n, r = !0) => {
+}, he = (t, n, r = !0) => {
 	let i = [];
 	if (!t) return [];
-	for (let o = 0; o < t.length; o++) {
-		let c = t[o];
-		if (!c) continue;
-		let l = new e.Vector3(c.start.x, c.start.y, c.start.z);
-		l.applyEuler(new e.Euler(-Math.PI / 2, 0, 0));
-		let u = new e.Vector3(c.end.x, c.end.y, c.end.z);
-		if (u.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), n.add(f(String(o), new e.Vector3((l.x + u.x) / 2, (l.y + u.y) / 2, (l.z + u.z) / 2))), (c.isBayWindow || c.isWindow) && r) continue;
-		let d = new a().setFromCoplanarPoints(new s(c.start.x, c.start.y, c.start.z), new s(c.end.x, c.end.y, c.end.z), new s(c.start.x, c.start.y, c.rooftopPz)), p = [];
-		c.originalPoints.forEach((e, t) => {
-			let n = new s();
-			d.projectPoint(e, n), p.push(n);
+	for (let a = 0; a < t.length; a++) {
+		let o = t[a];
+		if (!o) continue;
+		let s = new e.Vector3(o.start.x, o.start.y, o.start.z);
+		s.applyEuler(new e.Euler(-Math.PI / 2, 0, 0));
+		let l = new e.Vector3(o.end.x, o.end.y, o.end.z);
+		if (l.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), n.add(O(String(a), new e.Vector3((s.x + l.x) / 2, (s.y + l.y) / 2, (s.z + l.z) / 2))), (o.isBayWindow || o.isWindow) && r) continue;
+		let u = new c().setFromCoplanarPoints(new d(o.start.x, o.start.y, o.start.z), new d(o.end.x, o.end.y, o.end.z), new d(o.start.x, o.start.y, o.rooftopPz)), f = [];
+		o.originalPoints.forEach((e, t) => {
+			let n = new d();
+			u.projectPoint(e, n), f.push(n);
 		});
-		let m = new s(c.start.x, c.start.y, c.start.z).distanceTo(new s(c.end.x, c.end.y, c.end.z)), h = Math.abs(c.rooftopPz - c.start.z), g = new e.MeshBasicMaterial({
+		let p = new d(o.start.x, o.start.y, o.start.z).distanceTo(new d(o.end.x, o.end.y, o.end.z)), m = Math.abs(o.rooftopPz - o.start.z), h = new e.MeshBasicMaterial({
 			color: "red",
 			side: e.DoubleSide,
 			wireframe: !1,
 			transparent: !0,
 			opacity: .5
-		}), _ = new e.Group(), v = new R(), { horizontalSubdivisions: y, verticalSubdivisions: b } = v.initLimits4(m, h), x = v.createSubdividedWallPlane(c, b, y, g, _);
-		v.analyzePointDistribution(x, p, .01);
-		let S = new e.MeshBasicMaterial({
+		}), 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",
 			transparent: !0,
 			opacity: .8,
 			side: e.DoubleSide
-		}), C = v.highlightEmptySegments(x, S, _), w = [];
-		for (let e of C.clusters) {
-			let t = z(e);
-			t && w.push(t);
+		}), S = _.highlightEmptySegments(b, x, g), C = [];
+		for (let e of S.clusters) {
+			let t = pe(e);
+			t && C.push(t);
 		}
-		let T = B(c).direction;
-		c.checkResults = w, c.verticalDirection = T, c.originaIndex = o, i.push(c);
+		let w = me(o).direction;
+		o.checkResults = C, o.verticalDirection = w, o.originaIndex = a, i.push(o);
 	}
 	return i;
-}, H = async (t, n, r, i) => {
-	P(i);
+}, ge = async (t, n, r, i) => {
+	ce(i);
 	let a = await fetch(t);
 	if (!a) return;
-	let o = await a.json(), s = new e.Group(), l = new e.Group(), u = new e.Group(), d = new e.Group(), p = new e.Group(), m = new e.Group(), h = new e.Group(), g = new e.Group();
+	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();
 	for (let t = 0; t < o.length; t++) {
 		let n = o[t];
 		if (!n) continue;
 		let r = new e.Vector3(n.start.x, n.start.y, n.start.z);
 		r.applyEuler(new e.Euler(-Math.PI / 2, 0, 0));
 		let i = new e.Vector3(n.end.x, n.end.y, n.end.z);
-		i.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), g.add(f(String(t), new e.Vector3((r.x + i.x) / 2, (r.y + i.y) / 2, (r.z + i.z) / 2)));
+		i.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), m.add(O(String(t), new e.Vector3((r.x + i.x) / 2, (r.y + i.y) / 2, (r.z + i.z) / 2)));
 	}
 	o.sort((e, t) => e.originalIndex - t.originalIndex), console.log("lins", o);
-	let v = await fetch(n);
-	if (!v) return;
-	let y = await v.json(), b = Array.isArray(y) ? y : Object.values(y), x = await fetch(r);
-	if (console.log("respcd", x), !x) return;
-	let S = await x.json(), C = 0;
-	for (let t = 0; t < S.length; t++) {
-		let n = S[t];
+	let h = await fetch(n);
+	if (!h) return;
+	let g = await h.json(), _ = Array.isArray(g) ? g : Object.values(g), v = await fetch(r);
+	if (console.log("respcd", v), !v) return;
+	let y = await v.json(), b = 0;
+	for (let t = 0; t < y.length; t++) {
+		let n = y[t];
 		if (n.isFindBeam = !1, n.category == "door") {
 			let t = new e.Vector3(n.center.x, n.center.y, n.center.z);
-			t.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), g.add(f(`door:${C}`, t)), C++;
+			t.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), m.add(O(`door:${b}`, t)), b++;
 		}
 	}
-	i.add(g), console.time();
-	let { beamGroup: w } = await U(o, b, S, i);
-	console.timeEnd(), console.log("beamGroup", w);
-	let T = new e.MeshBasicMaterial({
+	i.add(m), console.time();
+	let { beamGroup: x } = await _e(o, _, y, i);
+	console.timeEnd(), console.log("beamGroup", x), new e.MeshBasicMaterial({
 		color: "#cffd00",
 		transparent: !0,
 		opacity: .4,
 		side: e.DoubleSide
-	}), E = new e.MeshBasicMaterial({
+	});
+	let S = new e.MeshBasicMaterial({
 		color: "#ff0000",
 		transparent: !0,
 		opacity: .4,
 		side: e.DoubleSide
-	}), D = new e.MeshBasicMaterial({
+	}), C = new e.MeshBasicMaterial({
 		color: "#e100ff",
 		transparent: !0,
 		opacity: .4,
 		side: e.DoubleSide
-	}), O = new e.MeshBasicMaterial({
+	}), T = new e.MeshBasicMaterial({
 		color: "#0400ff",
 		transparent: !0,
 		opacity: .4,
 		side: e.DoubleSide
-	}), k = new e.LineBasicMaterial({ color: "#cffd00" }), A = [];
+	}), E = new e.LineBasicMaterial({ color: "#cffd00" }), D = [];
 	for (let t = 0; t < o.length; t++) {
 		let n = o[t];
 		if (n.checkResults) for (let t of n.checkResults) for (let n of t.originalVertices) {
@@ -1132,12 +1151,12 @@ var R = class {
 				3
 			]), o.computeVertexNormals();
 			let c = new e.EdgesGeometry(o, 1);
-			A.push(c);
+			D.push(c);
 		}
 	}
-	if (A.length > 0) {
-		let t = c(A, !1);
-		t.rotateX(-Math.PI / 2), s.add(new e.LineSegments(t, k)), s.visible = !1, i.add(s), A.forEach((e) => e.dispose());
+	if (D.length > 0) {
+		let t = w(D, !1);
+		t.rotateX(-Math.PI / 2), s.add(new e.LineSegments(t, E)), s.visible = !1, i.add(s), D.forEach((e) => e.dispose());
 	}
 	new e.PointsMaterial({
 		color: 65535,
@@ -1150,36 +1169,36 @@ var R = class {
 			n[t * 3] = e.x, n[t * 3 + 1] = e.y, n[t * 3 + 2] = e.z;
 		});
 		let r = new e.BufferGeometry();
-		r.setAttribute("position", new e.BufferAttribute(n, 3)), r.rotateX(-Math.PI / 2), l.add(new e.Points(r, new e.PointsMaterial({
-			color: F(),
+		r.setAttribute("position", new e.BufferAttribute(n, 3)), r.rotateX(-Math.PI / 2), c.add(new e.Points(r, new e.PointsMaterial({
+			color: le(),
 			size: .02
 		})));
 		let i = [];
 		i.push(new e.Vector3(t.start.x, t.start.y, t.start.z)), i.push(new e.Vector3(t.end.x, t.end.y, t.end.z));
 		let a = new e.BufferGeometry();
-		a.setFromPoints(i), a.rotateX(-Math.PI / 2), m.add(new e.Line(a, k));
+		a.setFromPoints(i), a.rotateX(-Math.PI / 2), f.add(new e.Line(a, E));
 	}
-	m.visible = !1, i.add(l), i.add(m);
-	let j = [], M = [], N = new e.LineBasicMaterial({ color: "#f30606" }), I = new e.MeshBasicMaterial({ color: "#071ac4" });
-	for (let t = 0; t < b.length; t++) {
+	f.visible = !1, i.add(c), i.add(f);
+	let k = [], A = [], j = new e.LineBasicMaterial({ color: "#f30606" }), M = new e.MeshBasicMaterial({ color: "#071ac4" });
+	for (let t = 0; t < _.length; t++) {
 		let n = new e.SphereGeometry(.05);
-		n.translate(b[t].x, b[t].y, b[t].z);
-		let r = [], i = new e.Vector3(b[t].x, b[t].y, b[t].z), a = new e.Quaternion(b[t].qx, b[t].qy, b[t].qz, b[t].qw), o = new e.Vector3(0, 0, -1).applyQuaternion(a), s = i.clone().addScaledVector(o, .001);
+		n.translate(_[t].x, _[t].y, _[t].z);
+		let r = [], i = new e.Vector3(_[t].x, _[t].y, _[t].z), a = new e.Quaternion(_[t].qx, _[t].qy, _[t].qz, _[t].qw), o = new e.Vector3(0, 0, -1).applyQuaternion(a), s = i.clone().addScaledVector(o, .001);
 		r.push(i), r.push(s);
 		let c = new e.BufferGeometry();
-		c.setFromPoints(r), M.push(c), j.push(n);
+		c.setFromPoints(r), A.push(c), k.push(n);
 	}
-	if (j.length > 0) {
-		let t = c(j, !1);
-		t.rotateX(-Math.PI / 2), u.add(new e.Mesh(t, I)), j.forEach((e) => e.dispose());
+	if (k.length > 0) {
+		let t = w(k, !1);
+		t.rotateX(-Math.PI / 2), l.add(new e.Mesh(t, M)), k.forEach((e) => e.dispose());
 	}
-	if (M.length > 0) {
-		let t = c(M, !1);
-		t.rotateX(-Math.PI / 2), u.add(new e.Line(t, N)), M.forEach((e) => e.dispose());
+	if (A.length > 0) {
+		let t = w(A, !1);
+		t.rotateX(-Math.PI / 2), l.add(new e.Line(t, j)), A.forEach((e) => e.dispose());
 	}
-	i.add(u);
-	let { AiProjectionGroup: L, AiProjectionGroup2: R } = _(S);
-	return d.add(L), d.rotateX(-Math.PI / 2), i.add(d), p.add(R), p.visible = !1, p.rotateX(-Math.PI / 2), i.add(p), console.log("jsonpcdData", S), o.forEach((t) => {
+	i.add(l);
+	let { AiProjectionGroup: P, AiProjectionGroup2: F } = N(y);
+	return u.add(P), u.rotateX(-Math.PI / 2), i.add(u), d.add(F), d.visible = !1, d.rotateX(-Math.PI / 2), i.add(d), console.log("jsonpcdData", y), o.forEach((t) => {
 		t.doorAndBeamData && t.doorAndBeamData.length > 0 && (t.doorAndBeamData.forEach((t) => {
 			if (t.beamStart) {
 				let n = new e.BufferGeometry(), r = new Float32Array([
@@ -1203,7 +1222,7 @@ var R = class {
 					0,
 					2,
 					3
-				]), n.computeVertexNormals(), n.rotateX(-Math.PI / 2), h.add(new e.Mesh(n, T));
+				]), n.computeVertexNormals(), n.rotateX(-Math.PI / 2);
 			}
 			let n = new e.BufferGeometry(), r = new Float32Array([
 				t.doorStart.x,
@@ -1226,22 +1245,20 @@ var R = class {
 				0,
 				2,
 				3
-			]), n.computeVertexNormals(), n.rotateX(-Math.PI / 2), t.isDoor ? h.add(new e.Mesh(n, O)) : t.type == "beam" ? h.add(new e.Mesh(n, D)) : h.add(new e.Mesh(n, E));
-			let i = `id:${t.id},Nid:${t.nearId}`, a = new e.Vector3((t.doorStart.x + t.doorEnd.x) / 2, (t.doorStart.y + t.doorEnd.y) / 2, t.doorStart.z + t.doorHeight);
-			a.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), h.add(f(i, a));
-		}), i.add(h));
+			]), n.computeVertexNormals(), n.rotateX(-Math.PI / 2), t.isDoor ? p.add(new e.Mesh(n, T)) : t.type == "beam" ? p.add(new e.Mesh(n, C)) : p.add(new e.Mesh(n, S)), `${t.id}${t.nearId}`, new e.Vector3((t.doorStart.x + t.doorEnd.x) / 2, (t.doorStart.y + t.doorEnd.y) / 2, t.doorStart.z + t.doorHeight).applyEuler(new e.Euler(-Math.PI / 2, 0, 0));
+		}), i.add(p));
 	}), {
 		checkResultGroup: s,
-		pointCloudGroup: l,
-		runData: u,
-		pcdGroup: d,
-		pcdGroup2: p,
-		pointLineGroup: m,
-		beamDoorGroup: h,
-		lineIndexGroup: g
+		pointCloudGroup: c,
+		runData: l,
+		pcdGroup: u,
+		pcdGroup2: d,
+		pointLineGroup: f,
+		beamDoorGroup: p,
+		lineIndexGroup: m
 	};
-}, U = async (t, n, r, i) => {
-	if (k(t, i), t.length <= 0 || n.length <= 0) return t;
+}, _e = 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 = [];
@@ -1280,11 +1297,11 @@ var R = class {
 						gridHeight: -1,
 						centerPts: []
 					});
-					let i = l.get(n), [o, s, f, p] = a[t], h = new e.Vector3().add(o).add(s).add(f).add(p).multiplyScalar(.25);
-					if (i.points.push(...a[t]), i.area += o.distanceTo(s) * o.distanceTo(p), i.originalVertices.push(a[t]), i.index = r, i.centerPts.push(h), u == -1 || d == -1) {
+					let i = l.get(n), [o, s, f, p] = a[t], m = new e.Vector3().add(o).add(s).add(f).add(p).multiplyScalar(.25);
+					if (i.points.push(...a[t]), i.area += o.distanceTo(s) * o.distanceTo(p), i.originalVertices.push(a[t]), i.index = r, i.centerPts.push(m), u == -1 || d == -1) {
 						let t = new e.Vector3().subVectors(o, s).normalize();
 						d = o.distanceTo(p), u = o.distanceTo(s);
-						let n = m(t, new e.Vector3(0, 0, 1));
+						let n = A(t, new e.Vector3(0, 0, 1));
 						n && n.parallel && ([d, u] = [u, d]);
 					}
 					i.gridWidth = u, i.gridHeight = d;
@@ -1323,7 +1340,7 @@ var R = class {
 				r[2],
 				r[1]
 			]);
-			let o = x(r[0], r[3], !0), s = x(r[1], r[2], !0);
+			let o = L(r[0], r[3], !0), s = L(r[1], r[2], !0);
 			c.push({
 				doorStartPt: o,
 				doorEndPt: s,
@@ -1340,8 +1357,8 @@ var R = class {
 		let r = c[n];
 		for (let n = 0; n < t.length; n++) {
 			if (t[n].length < .5) continue;
-			let i = [], a = x(t[n].start, t[n].end, !0);
-			i.push(a), i.push(x(a, t[n].start, !0)), i.push(x(a, t[n].end, !0));
+			let i = [], a = L(t[n].start, t[n].end, !0);
+			i.push(a), i.push(L(a, t[n].start, !0)), i.push(L(a, t[n].end, !0));
 			let o = !1, s = r.boxPoints.length;
 			for (let e = 0; e < i.length; e++) {
 				let t = i[e].x, n = i[e].y;
@@ -1352,12 +1369,12 @@ var R = class {
 				if (o) break;
 			}
 			if (o) {
-				let i = new e.Vector3(t[n].start.x, t[n].start.y, 0), a = new e.Vector3(t[n].end.x, t[n].end.y, 0), o = r.doorStartPt.distanceTo(r.doorEndPt), s = i.distanceTo(a), c = y(r.doorStartPt, r.doorEndPt, i, a);
+				let i = new e.Vector3(t[n].start.x, t[n].start.y, 0), a = new e.Vector3(t[n].end.x, t[n].end.y, 0), o = r.doorStartPt.distanceTo(r.doorEndPt), s = i.distanceTo(a), c = F(r.doorStartPt, r.doorEndPt, i, a);
 				if (Math.abs(s - o) < .5 && c && c.isParallel) {
 					r.doorStartPt = new e.Vector3(t[n].start.x, t[n].start.y, 0), r.doorEndPt = new e.Vector3(t[n].end.x, t[n].end.y, 0);
 					break;
 				} else if (Math.abs(s - o) > 1.3 && c && c.isParallel) {
-					let e = S(r.doorStartPt, r.doorEndPt, i, a), t = r.doorStartPt.distanceTo(i), n = r.doorStartPt.distanceTo(a), o = r.doorEndPt.distanceTo(i), s = r.doorEndPt.distanceTo(a), c = t < .2 || n < .2 || o < .2 || s < .2;
+					let e = R(r.doorStartPt, r.doorEndPt, i, a), t = r.doorStartPt.distanceTo(i), n = r.doorStartPt.distanceTo(a), o = r.doorEndPt.distanceTo(i), s = r.doorEndPt.distanceTo(a), c = t < .2 || n < .2 || o < .2 || s < .2;
 					if (e && e.type == "collinear_overlap" && e.maxPerpendicularDistance < .1 && !c) {
 						r.inWall = !0;
 						break;
@@ -1366,455 +1383,458 @@ var R = class {
 			} else continue;
 		}
 	}
-	let l = 0, u = [], f = [], p = [], h = [], g = .2;
+	let l = 0, u = [], d = [], f = [], p = [], m = .2;
 	for (let i = 0; i < t.length; i++) {
 		let a = t[i];
 		if (!a.mergeCheckRegion || a.mergeCheckRegion.length == 0) continue;
 		a.doorAndBeamData = [], a.completePointAreaPercentage = -1;
 		let o = new e.Box3();
 		o.setFromPoints(a.originalPoints);
-		let _ = o.max.z, C = o.min.z, w = new e.Vector3(a.start.x, a.start.y, a.start.z), T = new e.Vector3(a.end.x, a.end.y, a.end.z), E = a.rooftopPz - a.start.z;
-		if (E < s - .5 || E > s + 2) continue;
-		let D = 0;
+		let h = o.max.z, g = o.min.z, _ = new e.Vector3(a.start.x, a.start.y, a.start.z), v = new e.Vector3(a.end.x, a.end.y, a.end.z), y = a.rooftopPz - a.start.z;
+		if (y < s - .5 || y > s + 2) continue;
+		let b = 0;
 		for (let o of a.mergeCheckRegion) {
-			let { facePoints: s, boxArea: k, totalInPlaneNum: N } = v(o.points, o.gridWidth, o.gridHeight, o.centerPts);
+			let { facePoints: s, boxArea: x, totalInPlaneNum: S } = P(o.points, o.gridWidth, o.gridHeight, o.centerPts);
 			if (!s || s.length <= 0) continue;
 			s[0].distanceTo(s[1]);
-			let P = s[0].distanceTo(s[3]), F = o.gridHeight * (P / o.gridHeight / 3 * 2) + o.gridHeight / 2, I = new e.Vector3(s[0].x, s[0].y, s[0].z + F), L = new e.Vector3(s[1].x, s[1].y, s[1].z + F), R = new e.Line3(I, L), z = [], B = new e.Vector3();
+			let C = s[0].distanceTo(s[3]), w = o.gridHeight * (C / o.gridHeight / 3 * 2) + o.gridHeight / 2, T = new e.Vector3(s[0].x, s[0].y, s[0].z + w), E = new e.Vector3(s[1].x, s[1].y, s[1].z + w), O = new e.Line3(T, E), k = [], j = new e.Vector3();
 			o.points.forEach((e) => {
-				R.closestPointToPoint(e, !0, B).distanceTo(e) < o.gridHeight + .01 && z.push(e);
+				O.closestPointToPoint(e, !0, j).distanceTo(e) < o.gridHeight + .01 && k.push(e);
 			});
-			let V = [], H = [];
+			let M = [], N = [];
 			for (;;) {
 				let e = [];
-				for (let t = 0; t < z.length; t++) H.includes(t) || e.length == 0 && (e.push(z[t]), H.push(t));
-				for (let t = 0; t < z.length; t++) if (!H.includes(t)) {
-					for (let n = 0; n < e.length; n++) if (z[t].distanceTo(e[n]) < o.gridWidth + .01) {
-						e.push(z[t]), H.push(t), t = -1;
+				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;
 						break;
 					}
 				}
 				if (e.length == 0) break;
-				V.push(e);
+				M.push(e);
 			}
-			let U = [];
-			for (let t = 0; t < V.length; t++) {
+			let ee = [];
+			for (let t = 0; t < M.length; t++) {
 				let n = {
 					lineSt: new e.Vector3(),
 					lineEd: new e.Vector3(),
 					facePoints: []
-				}, r = M(V[t]);
-				Array.isArray(r) && r.length == 2 && (n.lineSt = r[0], n.lineEd = r[1], n.facePoints.push(new e.Vector3(r[0].x, r[0].y, s[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, s[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, s[2].z)), n.facePoints.push(new e.Vector3(r[0].x, r[0].y, s[2].z)), U.push(n));
-			}
-			D += o.area;
-			let W = 0;
-			if (N != 0 && (W = o.gridHeight * o.gridWidth * N), (o.area - W) / k * 100 > 70 && U.length == 1 || U.length > 1) for (let s = 0; s < U.length; s++) {
-				let v = U[s], D = v.facePoints[0].distanceTo(v.facePoints[1]), k = v.facePoints[0].distanceTo(v.facePoints[3]), N = D / a.length * 100, P = a.rooftopPz - v.facePoints[2].z;
-				if (k < 1.5 || _ < v.facePoints[2].z || P > E / 3 * 2) continue;
-				let F = !1, I = !1, L = !1, R = [], z = v.facePoints[2].clone(), B = v.facePoints[3].clone(), V = v.facePoints[0].clone(), H = v.facePoints[1].clone(), W = !1, G = -1;
-				if (Math.abs(v.facePoints[0].z - a.start.z) < .25) {
-					if (D > .17 && a.length > .5) {
-						let n = A(w, V), r = A(w, H), o = A(T, V), s = A(T, H), c = .1;
+				}, r = se(M[t]);
+				Array.isArray(r) && r.length == 2 && (n.lineSt = r[0], n.lineEd = r[1], n.facePoints.push(new e.Vector3(r[0].x, r[0].y, s[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, s[0].z)), n.facePoints.push(new e.Vector3(r[1].x, r[1].y, s[2].z)), n.facePoints.push(new e.Vector3(r[0].x, r[0].y, s[2].z)), ee.push(n));
+			}
+			b += o.area;
+			let te = 0;
+			if (S != 0 && (te = o.gridHeight * o.gridWidth * S), (o.area - te) / x * 100 > 70 && ee.length == 1 || ee.length > 1) for (let s = 0; s < ee.length; s++) {
+				let b = ee[s], x = b.facePoints[0].distanceTo(b.facePoints[1]), S = b.facePoints[0].distanceTo(b.facePoints[3]), C = x / a.length * 100, w = a.rooftopPz - b.facePoints[2].z;
+				if (S < 1.5 || h < b.facePoints[2].z || w > y / 3 * 2) continue;
+				let T = !1, E = !1, O = !1, k = [], j = b.facePoints[2].clone(), M = b.facePoints[3].clone(), N = b.facePoints[0].clone(), P = b.facePoints[1].clone(), te = !1, z = -1;
+				if (Math.abs(b.facePoints[0].z - a.start.z) < .25) {
+					if (x > .17 && a.length > .5) {
+						let n = B(_, N), r = B(_, P), o = B(v, N), s = B(v, P), c = .1;
 						if (n < c || r < c) {
-							let { newOriginalPoints: r } = O(V, H, a.originalPoints), o = [], s = [];
+							let { newOriginalPoints: r } = ie(N, P, a.originalPoints), o = [], s = [];
 							if (r.forEach((e) => {
-								e.z >= z.z ? o.push(e) : e.z <= V.z && s.push(e);
+								e.z >= j.z ? o.push(e) : e.z <= N.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, f = -1, p = !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;
 								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), m = d(r, o, a, c), h = b(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) {
-												u = Infinity, f = -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), p = D(r, o, a, c), m = I(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;
 												break;
 											}
 										}
 										continue;
 									}
-									if (h && h.angle > 65) {
-										let t = y(r, o, new e.Line3(a, c).closestPointToPoint(r, !0, l), r);
+									if (m && m.angle > 65) {
+										let t = F(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), p = o.clone().addScaledVector(s.clone().negate(), 10), m = new e.Vector3().subVectors(c, a).normalize(), h = d(i, p, a.clone().addScaledVector(m.clone().negate(), .03), c.clone().addScaledVector(m, .03));
-										if (h == null) continue;
-										let g = r.distanceTo(h.point);
-										g < u && (u = g, f = n);
-									} else if (h && h.angle < 5) {
-										let t = new e.Vector3(V.x, V.y, 0), n = new e.Vector3(H.x, H.y, 0), r = A(t, a), i = A(t, c), o = A(n, a), s = A(n, c);
+										let i = r.clone().addScaledVector(s, 10), f = o.clone().addScaledVector(s.clone().negate(), 10), p = new e.Vector3().subVectors(c, a).normalize(), m = D(i, f, a.clone().addScaledVector(p.clone().negate(), .03), c.clone().addScaledVector(p, .03));
+										if (m == null) continue;
+										let h = r.distanceTo(m.point);
+										h < u && (u = h, d = n);
+									} else if (m && m.angle < 5) {
+										let t = new e.Vector3(N.x, N.y, 0), n = new e.Vector3(P.x, P.y, 0), r = B(t, a), i = B(t, c), o = B(n, a), s = B(n, c);
 										if (r < .08 || i < .08 || o < .08 || s < .08) {
-											p = !0, u = Infinity, f = -1;
+											f = !0, u = Infinity, d = -1;
 											break;
 										}
 									}
 								}
-								if (u != Infinity && u < 2) t[f].length > .25 && D + u > .5 && (W = !0, n < c ? (B = B.addScaledVector(s, u), V = V.addScaledVector(s, u)) : (z = z.addScaledVector(s, u), H = H.addScaledVector(s, u)));
-								else if (!p) {
-									let r = .05, a = w.clone().addScaledVector(s, r), o = w.clone().addScaledVector(s.clone().negate(), r);
+								if (u != Infinity && u < 2) t[d].length > .25 && x + u > .5 && (te = !0, n < c ? (M = M.addScaledVector(s, u), N = N.addScaledVector(s, u)) : (j = j.addScaledVector(s, u), P = P.addScaledVector(s, u)));
+								else if (!f) {
+									let r = .05, a = _.clone().addScaledVector(s, r), o = _.clone().addScaledVector(s.clone().negate(), r);
 									a.z = o.z = 0;
 									let l = !1;
-									for (let f = 0; f < t.length; f++) {
-										if (f == i) continue;
-										let p = new e.Vector3(t[f].start.x, t[f].start.y, 0), m = new e.Vector3(t[f].end.x, t[f].end.y, 0), h = new e.Vector3().subVectors(m, p).normalize();
-										p = p.clone().addScaledVector(h.clone().negate(), r), m = m.clone().addScaledVector(h, r);
-										let g = d(a, o, p, m);
-										if (g) {
-											g.point.z = w.z;
-											let e = g.point.distanceTo(w);
-											if (g.point.distanceTo(T) < e) continue;
+									for (let d = 0; d < t.length; d++) {
+										if (d == i) continue;
+										let f = new e.Vector3(t[d].start.x, t[d].start.y, 0), p = new e.Vector3(t[d].end.x, t[d].end.y, 0), m = new e.Vector3().subVectors(p, f).normalize();
+										f = f.clone().addScaledVector(m.clone().negate(), r), p = p.clone().addScaledVector(m, r);
+										let h = D(a, o, f, p);
+										if (h) {
+											h.point.z = _.z;
+											let e = h.point.distanceTo(_);
+											if (h.point.distanceTo(v) < e) continue;
 											u > e && (u = e), l = !0;
 										}
 										if (l) break;
-										u != Infinity && u < 2 && (n < c ? (B = B.addScaledVector(s.clone().negate(), u), V = V.addScaledVector(s.clone().negate(), u)) : (z = z.addScaledVector(s.clone().negate(), u), H = H.addScaledVector(s.clone().negate(), u)));
+										u != Infinity && u < 2 && (n < c ? (M = M.addScaledVector(s.clone().negate(), u), N = N.addScaledVector(s.clone().negate(), u)) : (j = j.addScaledVector(s.clone().negate(), u), P = P.addScaledVector(s.clone().negate(), u)));
 									}
 									if (!l) continue;
 								}
 							} else continue;
 						} else if (o < c || s < c) {
-							let { newOriginalPoints: n } = O(V, H, a.originalPoints), r = [], s = [];
+							let { newOriginalPoints: n } = ie(N, P, a.originalPoints), r = [], s = [];
 							if (n.forEach((e) => {
-								e.z >= z.z ? r.push(e) : e.z <= V.z && s.push(e);
+								e.z >= j.z ? r.push(e) : e.z <= N.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, f = -1, p = !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;
 								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), m = d(n, r, o, c), h = b(n, r, o, c);
-									if (m != null) {
-										if (h && h.angle > 85 && (m.point.distanceTo(n), m.point.distanceTo(r) < .3)) {
-											u = Infinity, f = -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), p = D(n, r, o, c), m = I(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;
 											break;
 										}
 										continue;
 									}
-									if (h && h.angle > 65) {
-										let t = y(r, n, new e.Line3(o, c).closestPointToPoint(r, !0, l), r);
+									if (m && m.angle > 65) {
+										let t = F(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), p = r.clone().addScaledVector(s, 10), m = new e.Vector3().subVectors(c, o).normalize(), h = d(i, p, o.clone().addScaledVector(m.clone().negate(), .03), c.clone().addScaledVector(m, .03));
-										if (h == null) continue;
-										let g = r.distanceTo(h.point);
-										g < u && (u = g, f = a);
-									} else if (h && h.angle < 5) {
-										let t = new e.Vector3(V.x, V.y, 0), n = new e.Vector3(H.x, H.y, 0), r = A(t, o), i = A(t, c), a = A(n, o), s = A(n, c);
+										let i = n.clone().addScaledVector(s.clone().negate(), 10), f = r.clone().addScaledVector(s, 10), p = new e.Vector3().subVectors(c, o).normalize(), m = D(i, f, o.clone().addScaledVector(p.clone().negate(), .03), c.clone().addScaledVector(p, .03));
+										if (m == null) continue;
+										let h = r.distanceTo(m.point);
+										h < u && (u = h, d = a);
+									} else if (m && m.angle < 5) {
+										let t = new e.Vector3(N.x, N.y, 0), n = new e.Vector3(P.x, P.y, 0), r = B(t, o), i = B(t, c), a = B(n, o), s = B(n, c);
 										if (r < .08 || i < .08 || a < .08 || s < .08) {
-											p = !0, u = Infinity, f = -1;
+											f = !0, u = Infinity, d = -1;
 											break;
 										}
 									}
 								}
-								if (u != Infinity && u < 2) t[f].length > .25 && D + u > .5 && (W = !0, o < c ? (B = B.addScaledVector(s, u), V = V.addScaledVector(s, u)) : (z = z.addScaledVector(s, u), H = H.addScaledVector(s, u)));
-								else if (!p) {
-									let n = .05, r = T.clone().addScaledVector(s, n), a = w.clone();
+								if (u != Infinity && u < 2) t[d].length > .25 && x + u > .5 && (te = !0, o < c ? (M = M.addScaledVector(s, u), N = N.addScaledVector(s, u)) : (j = j.addScaledVector(s, u), P = P.addScaledVector(s, u)));
+								else if (!f) {
+									let n = .05, r = v.clone().addScaledVector(s, n), a = _.clone();
 									r.z = a.z = 0;
 									let l = !1;
 									for (let o = 0; o < t.length; o++) {
 										if (o == i) continue;
-										let s = new e.Vector3(t[o].start.x, t[o].start.y, 0), c = new e.Vector3(t[o].end.x, t[o].end.y, 0), f = new e.Vector3().subVectors(c, s).normalize();
-										s = s.clone().addScaledVector(f.clone().negate(), n), c = c.clone().addScaledVector(f, n);
-										let p = d(r, a, s, c);
-										if (p) {
-											p.point.z = T.z;
-											let e = p.point.distanceTo(T);
-											if (p.point.distanceTo(w) < e) continue;
+										let s = new e.Vector3(t[o].start.x, t[o].start.y, 0), c = new e.Vector3(t[o].end.x, t[o].end.y, 0), d = new e.Vector3().subVectors(c, s).normalize();
+										s = s.clone().addScaledVector(d.clone().negate(), n), c = c.clone().addScaledVector(d, n);
+										let f = D(r, a, s, c);
+										if (f) {
+											f.point.z = v.z;
+											let e = f.point.distanceTo(v);
+											if (f.point.distanceTo(_) < e) continue;
 											u > e && (u = e), l = !0;
 										}
 									}
 									if (!l) continue;
-									u != Infinity && u < 2 && (o < c ? (B = B.addScaledVector(s.clone().negate(), u), V = V.addScaledVector(s.clone().negate(), u)) : (z = z.addScaledVector(s.clone().negate(), u), H = H.addScaledVector(s.clone().negate(), u)));
+									u != Infinity && u < 2 && (o < c ? (M = M.addScaledVector(s.clone().negate(), u), N = N.addScaledVector(s.clone().negate(), u)) : (j = j.addScaledVector(s.clone().negate(), u), P = P.addScaledVector(s.clone().negate(), u)));
 								}
 							} else continue;
 						}
-						D = B.distanceTo(z);
+						x = M.distanceTo(j);
 					}
-					if (N < 85 && D > .35 || D > .7 && k > E - E / 3) {
+					if (C < 85 && x > .35 || x > .7 && S > y - y / 3) {
 						let t = !1;
 						for (let r = 0; r < n.length; r++) {
 							let i = r + 1;
 							if (i >= n.length) continue;
 							let a = new e.Vector3(n[r].x, n[r].y, n[r].z), o = new e.Vector3(n[i].x, n[i].y, n[i].z);
-							if (d(new e.Vector3(a.x, a.y, 0), new e.Vector3(o.x, o.y, 0), new e.Vector3(v.facePoints[0].x, v.facePoints[0].y, 0), new e.Vector3(v.facePoints[1].x, v.facePoints[1].y, 0), .1) != null) {
+							if (D(new e.Vector3(a.x, a.y, 0), new e.Vector3(o.x, o.y, 0), new e.Vector3(b.facePoints[0].x, b.facePoints[0].y, 0), new e.Vector3(b.facePoints[1].x, b.facePoints[1].y, 0), .1) != null) {
 								t = !0;
 								break;
 							}
 						}
 						for (let t = 0; t < c.length; t++) {
-							let n = new e.Vector3(c[t].doorStartPt.x, c[t].doorStartPt.y, 0), i = new e.Vector3(c[t].doorEndPt.x, c[t].doorEndPt.y, 0), o = new e.Vector3(v.facePoints[0].x, v.facePoints[0].y, 0), s = new e.Vector3(v.facePoints[1].x, v.facePoints[1].y, 0), l = v.facePoints[2].z < c[t].maxZ || Math.abs(v.facePoints[2].z - c[t].maxZ) < .3;
-							if (Math.abs(v.facePoints[2].z - c[t].maxZ), l) {
-								let l = S(n.clone(), i.clone(), o.clone(), s.clone(), { distanceThreshold: 2 });
+							let n = new e.Vector3(c[t].doorStartPt.x, c[t].doorStartPt.y, 0), i = new e.Vector3(c[t].doorEndPt.x, c[t].doorEndPt.y, 0), o = new e.Vector3(b.facePoints[0].x, b.facePoints[0].y, 0), s = new e.Vector3(b.facePoints[1].x, b.facePoints[1].y, 0), l = b.facePoints[2].z < c[t].maxZ || Math.abs(b.facePoints[2].z - c[t].maxZ) < .3;
+							if (Math.abs(b.facePoints[2].z - c[t].maxZ), l) {
+								let l = R(n.clone(), i.clone(), o.clone(), s.clone(), { distanceThreshold: 2 });
 								if (l && l.type == "collinear_gap") {
-									let u = x(n, i), d = new e.Line3(new e.Vector3(a.start.x, a.start.y, 0), new e.Vector3(a.end.x, a.end.y, 0)), f = new e.Vector3(), p = d.closestPointToPoint(u, !0, f);
+									let u = L(n, i), d = new e.Line3(new e.Vector3(a.start.x, a.start.y, 0), new e.Vector3(a.end.x, a.end.y, 0)), f = new e.Vector3(), p = d.closestPointToPoint(u, !0, f);
 									if (u.distanceTo(p) < .15) {
 										let a = o.distanceTo(n), u = s.distanceTo(n);
 										if (a > .25 && u > .25) {
 											let e = o.distanceTo(i), t = s.distanceTo(i);
 											if (e > .2 && t > .2) continue;
 										}
-										I = !0, L = !0, R.push(c[t].index), c[t].isFind = !0, G = t, r[c[t].index].isFindBeam = !0;
+										E = !0, O = !0, k.push(c[t].index), c[t].isFind = !0, z = t, r[c[t].index].isFindBeam = !0;
 										let d = new e.Vector3().subVectors(o, s).normalize(), f = n.distanceTo(i) - l.overlap;
-										u < a && d.negate(), a > u ? (z = v.facePoints[2].clone().addScaledVector(d, f), B = v.facePoints[3].clone(), V = B.clone(), H = z.clone(), V.z = H.z = v.facePoints[0].z) : (z = v.facePoints[2].clone(), B = v.facePoints[3].clone().addScaledVector(d, f), V = B.clone(), H = z.clone(), V.z = H.z = v.facePoints[0].z);
+										u < a && d.negate(), a > u ? (j = b.facePoints[2].clone().addScaledVector(d, f), M = b.facePoints[3].clone(), N = M.clone(), P = j.clone(), N.z = P.z = b.facePoints[0].z) : (j = b.facePoints[2].clone(), M = b.facePoints[3].clone().addScaledVector(d, f), N = M.clone(), P = j.clone(), N.z = P.z = b.facePoints[0].z);
 									}
 								} else if (l && l.type == "collinear_overlap" && l.maxPerpendicularDistance < .35) {
 									let a = o.distanceTo(s), u = i.distanceTo(n);
 									if (Math.abs(a - l.overlap) < .25 || Math.abs(u - l.overlap) < .25) {
 										if (u > a && Math.abs(u - l.overlap) > 1) {
 											let t = o.distanceTo(n), r = o.distanceTo(i), a = s.distanceTo(n), c = s.distanceTo(i), d = t < r ? t : r, f = a < c ? a : c, p = new e.Vector3().subVectors(o, s).normalize(), m = u - l.overlap;
-											d < f ? (p.negate(), z = v.facePoints[2].clone().addScaledVector(p, m), B = v.facePoints[3].clone(), V = B.clone(), H = z.clone(), V.z = H.z = v.facePoints[0].z) : (z = v.facePoints[2].clone(), B = v.facePoints[3].clone().addScaledVector(p, m), V = B.clone(), H = z.clone(), V.z = H.z = v.facePoints[0].z);
+											d < f ? (p.negate(), j = b.facePoints[2].clone().addScaledVector(p, m), M = b.facePoints[3].clone(), N = M.clone(), P = j.clone(), N.z = P.z = b.facePoints[0].z) : (j = b.facePoints[2].clone(), M = b.facePoints[3].clone().addScaledVector(p, m), N = M.clone(), P = j.clone(), N.z = P.z = b.facePoints[0].z);
 										}
-										I = !0, L = !0, R.push(c[t].index), c[t].isFind = !0, r[c[t].index].isFindBeam = !0, G = t;
+										E = !0, O = !0, k.push(c[t].index), c[t].isFind = !0, r[c[t].index].isFindBeam = !0, z = t;
 									}
 								}
 							}
 						}
-						if (!L) for (let t = 0; t < c.length; t++) {
+						if (!O) for (let t = 0; t < c.length; t++) {
 							if (c[t].inWall) continue;
-							let n = new e.Vector3(c[t].doorStartPt.x, c[t].doorStartPt.y, 0), i = new e.Vector3(c[t].doorEndPt.x, c[t].doorEndPt.y, 0), a = new e.Vector3(v.facePoints[0].x, v.facePoints[0].y, 0), o = new e.Vector3(v.facePoints[1].x, v.facePoints[1].y, 0), s = new e.Vector3().subVectors(n, i).normalize(), l = new e.Vector3().subVectors(a, o).normalize(), u = .2, f = d(n.clone().addScaledVector(s, u), i.clone().addScaledVector(s.clone().negate(), u), a.clone().addScaledVector(l, u), o.clone().addScaledVector(l.clone().negate(), u)), p = v.facePoints[2].z < c[t].maxZ || Math.abs(v.facePoints[2].z - c[t].maxZ) < .3, m = n.distanceTo(a), h = n.distanceTo(o), _ = i.distanceTo(a), y = i.distanceTo(o);
-							(m < g || h < g || _ < g || y < g || f) && p && (r[c[t].index].isFindBeam = !0, I = !0, c[t].isFind = !0, G = t);
+							let n = new e.Vector3(c[t].doorStartPt.x, c[t].doorStartPt.y, 0), i = new e.Vector3(c[t].doorEndPt.x, c[t].doorEndPt.y, 0), a = new e.Vector3(b.facePoints[0].x, b.facePoints[0].y, 0), o = new e.Vector3(b.facePoints[1].x, b.facePoints[1].y, 0), s = new e.Vector3().subVectors(n, i).normalize(), l = new e.Vector3().subVectors(a, o).normalize(), u = .2, d = D(n.clone().addScaledVector(s, u), i.clone().addScaledVector(s.clone().negate(), u), a.clone().addScaledVector(l, u), o.clone().addScaledVector(l.clone().negate(), u)), f = b.facePoints[2].z < c[t].maxZ || Math.abs(b.facePoints[2].z - c[t].maxZ) < .3, p = n.distanceTo(a), h = n.distanceTo(o), g = i.distanceTo(a), _ = i.distanceTo(o);
+							(p < m || h < m || g < m || _ < m || d) && f && (r[c[t].index].isFindBeam = !0, E = !0, c[t].isFind = !0, z = t);
 						}
-						(I || t || Math.abs(k - E) > .1 && k > E / 2 && D > .3 && Math.abs(C - a.start.z) < .4) && (F = !0);
+						(E || t || Math.abs(S - y) > .1 && S > y / 2 && x > .3 && Math.abs(g - a.start.z) < .4) && (T = !0);
 					}
 				}
-				if (F) {
+				if (T) {
 					let n = !1;
-					for (let e = 0; e < p.length; e++) {
-						let t = S(p[e].start, p[e].end, V, H);
+					for (let e = 0; e < f.length; e++) {
+						let t = R(f[e].start, f[e].end, N, P);
 						if (t && t.type == "collinear_overlap" && t.maxPerpendicularDistance < .01) {
 							n = !0;
 							break;
 						}
 					}
 					if (n) {
-						G != -1 && (r[c[G].index].isFindBeam = !1, c[G].isFind = !1);
+						z != -1 && (r[c[z].index].isFindBeam = !1, c[z].isFind = !1);
 						continue;
 					}
-					p.push({
-						start: V,
-						end: H
+					f.push({
+						start: N,
+						end: P
 					});
 					{
-						let t = new e.Vector3().subVectors(V, H), n = new e.Vector3().subVectors(H, V), r = Infinity, i = Infinity, o = V.clone(), s = H.clone(), c = [];
-						if (a.originalPoints.forEach((e) => {
-							e.z - V.z < k / 2 + .1 && e.z - V.z > k / 2 - .1 && c.push(e);
+						let t = new e.Vector3().subVectors(N, P), n = new e.Vector3().subVectors(P, N), r = Infinity, i = Infinity, o = N.clone(), s = P.clone(), c = [], l = [], u = new e.Line3(j, M), d = new e.Vector3(), f = 999999;
+						if (a.originalPoints.forEach((r) => {
+							if (r.z - N.z < S / 2 + .1 && r.z - N.z > S / 2 - .1 && c.push(r), r.z > j.z) {
+								let i = u.closestPointToPoint(r, !0, d), a = i.distanceTo(r), o = new e.Vector3().subVectors(i, j), s = A(t, new e.Vector3().subVectors(i, M)), c = A(n, o);
+								s && s.parallel && !s.sameDirection && c && c.parallel && !c.sameDirection && a < .1 && a > .02 && (f > a && (f = a), l.push(r));
+							}
 						}), c.length > 0) {
-							let { newProjectPoints: a } = O(V, H, c);
-							for (let e of a) e.z = V.z;
+							let { newProjectPoints: a } = ie(N, P, c);
+							for (let e of a) e.z = N.z;
 							a.forEach((a) => {
-								let c = new e.Vector3(a.x, a.y, V.z), l = new e.Vector3().subVectors(c, H), u = m(t, new e.Vector3().subVectors(c, V)), d = m(n, l);
+								let c = new e.Vector3(a.x, a.y, N.z), l = new e.Vector3().subVectors(c, P), u = A(t, new e.Vector3().subVectors(c, N)), d = A(n, l);
 								if (u && u.parallel && u.sameDirection) {
-									let e = c.distanceTo(V);
+									let e = c.distanceTo(N);
 									e < r && (r = e, o = c);
 								} else if (d && d.parallel && d.sameDirection) {
-									let e = c.distanceTo(H);
+									let e = c.distanceTo(P);
 									e < i && (i = e, s = c);
 								}
 							});
 						}
-						o.equals(V) || (V = o, B = new e.Vector3(V.x, V.y, B.z)), s.equals(H) || (H = s, z = new e.Vector3(H.x, H.y, z.z));
+						o.equals(N) || (N = o, M = new e.Vector3(N.x, N.y, M.z)), s.equals(P) || (P = s, j = new e.Vector3(P.x, P.y, j.z)), l.length > 10 && (j.z = M.z + f, S += f);
 					}
-					let s = H.distanceTo(V);
-					if (s < .4 && !I || s < .3 && I) continue;
-					f.includes(i) || f.push(i), a.checkResults[o.index].isDoor = !0;
-					let g = "", _ = {
+					let s = P.distanceTo(N);
+					if (s < .4 && !E || s < .3 && E) continue;
+					d.includes(i) || d.push(i), a.checkResults[o.index].isDoor = !0;
+					let m = "", h = {
 						id: l,
-						beamStart: z,
-						beamEnd: B,
-						beamHeight: a.rooftopPz - v.facePoints[2].z,
-						doorStart: V,
-						doorEnd: H,
-						doorHeight: k,
+						beamStart: j,
+						beamEnd: M,
+						beamHeight: a.rooftopPz - j.z,
+						doorStart: N,
+						doorEnd: P,
+						doorHeight: S,
 						nearId: -1,
-						type: g,
-						isExtend: W,
-						isDoor: I,
-						isPullOutDoor: L,
-						pcbDoorIndexs: R
-					}, b = !1, C = new e.Vector3(), w = new e.Vector3(), T = -1;
+						type: m,
+						isExtend: te,
+						isDoor: E,
+						isPullOutDoor: O,
+						pcbDoorIndexs: k
+					}, g = !1, _ = new e.Vector3(), v = new e.Vector3(), y = -1;
 					for (let n = 0; n < u.length; n++) {
 						let r = t[u[n].linesIndex].doorAndBeamData[u[n].doorIndex];
 						if (r.nearId != -1) continue;
-						let i = y(z.clone(), B.clone(), r.beamStart.clone(), r.beamEnd.clone());
+						let i = F(j.clone(), M.clone(), r.beamStart.clone(), r.beamEnd.clone());
 						if (i && i.isParallel) {
-							let t = z.distanceTo(B), n = r.beamStart.distanceTo(r.beamEnd), i = new e.Line3(z.clone(), B.clone());
+							let t = j.distanceTo(M), n = r.beamStart.distanceTo(r.beamEnd), i = new e.Line3(j.clone(), M.clone());
 							i.start.z = 0, i.end.z = 0;
-							let a = x(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 = x(z, B, !0));
-							let o = new e.Vector3(), s = i.closestPointToPoint(a, !0, o), c = s.distanceTo(a), u = new e.Vector3().subVectors(a, s).normalize(), f = u.clone().negate(), p = a.clone().addScaledVector(f, c + .1), m = d(i.start, i.end, a, p), h = !I && !r.isDoor && (t > n * 2 || n > t * 2);
-							if (c < .4 && m != null && !h) {
-								r.nearId = l, _.nearId = r.id;
+							let a = L(r.beamStart, r.beamEnd, !0);
+							n > t && (i.start = new e.Vector3(r.beamStart.x, r.beamStart.y, 0), i.end = new e.Vector3(r.beamEnd.x, r.beamEnd.y, 0), a = L(j, M, !0));
+							let o = new e.Vector3(), s = i.closestPointToPoint(a, !0, o), c = s.distanceTo(a), u = new e.Vector3().subVectors(a, s).normalize(), d = u.clone().negate(), f = a.clone().addScaledVector(d, c + .1), p = D(i.start, i.end, a, f), m = !E && !r.isDoor && (t > n * 2 || n > t * 2);
+							if (c < .4 && p != null && !m) {
+								r.nearId = l, h.nearId = r.id;
 								let e = .8;
-								(r.isDoor || _.isDoor) && (r.isDoor = !0, _.isDoor = !0);
-								let i = R.some((e) => r.pcbDoorIndexs.includes(e));
-								t < n ? t > e && !r.isPullOutDoor ? (r.beamStart = z.clone().addScaledVector(f, c), r.beamEnd = B.clone().addScaledVector(f, c), r.doorStart = V.clone().addScaledVector(f, c), r.doorEnd = H.clone().addScaledVector(f, c), r.doorHeight = _.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : !L || L && r.isPullOutDoor && i ? (_.beamStart = r.beamStart.clone().addScaledVector(u, c), _.beamEnd = r.beamEnd.clone().addScaledVector(u, c), _.doorStart = r.doorStart.clone().addScaledVector(u, c), _.doorEnd = r.doorEnd.clone().addScaledVector(u, c), _.doorHeight = r.doorHeight, _.beamStart.z = _.beamEnd.z = _.doorStart.z + _.doorHeight) : (r.beamStart = z.clone().addScaledVector(f, c), r.beamEnd = B.clone().addScaledVector(f, c), r.doorStart = V.clone().addScaledVector(f, c), r.doorEnd = H.clone().addScaledVector(f, c), r.doorHeight = _.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : t > n && (n > e && !L ? (_.beamStart = r.beamStart.clone().addScaledVector(f, c), _.beamEnd = r.beamEnd.clone().addScaledVector(f, c), _.doorStart = r.doorStart.clone().addScaledVector(f, c), _.doorEnd = r.doorEnd.clone().addScaledVector(f, c), _.doorHeight = r.doorHeight, _.beamStart.z = _.beamEnd.z = _.doorStart.z + _.doorHeight) : !r.isPullOutDoor || L && r.isPullOutDoor && i ? (r.beamStart = z.clone().addScaledVector(u, c), r.beamEnd = B.clone().addScaledVector(u, c), r.doorStart = V.clone().addScaledVector(u, c), r.doorEnd = H.clone().addScaledVector(u, c), r.doorHeight = _.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : (_.beamStart = r.beamStart.clone().addScaledVector(f, c), _.beamEnd = r.beamEnd.clone().addScaledVector(f, c), _.doorStart = r.doorStart.clone().addScaledVector(f, c), _.doorEnd = r.doorEnd.clone().addScaledVector(f, c), _.doorHeight = r.doorHeight, _.beamStart.z = _.beamEnd.z = _.doorStart.z + _.doorHeight)), T = _.nearId, C = r.beamStart.clone(), w = r.beamEnd.clone(), b = !0;
+								(r.isDoor || h.isDoor) && (r.isDoor = !0, h.isDoor = !0);
+								let i = k.some((e) => r.pcbDoorIndexs.includes(e));
+								t < n ? t > e && !r.isPullOutDoor ? (r.beamStart = j.clone().addScaledVector(d, c), r.beamEnd = M.clone().addScaledVector(d, c), r.doorStart = N.clone().addScaledVector(d, c), r.doorEnd = P.clone().addScaledVector(d, c), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : !O || O && r.isPullOutDoor && i ? (h.beamStart = r.beamStart.clone().addScaledVector(u, c), h.beamEnd = r.beamEnd.clone().addScaledVector(u, c), h.doorStart = r.doorStart.clone().addScaledVector(u, c), h.doorEnd = r.doorEnd.clone().addScaledVector(u, c), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight) : (r.beamStart = j.clone().addScaledVector(d, c), r.beamEnd = M.clone().addScaledVector(d, c), r.doorStart = N.clone().addScaledVector(d, c), r.doorEnd = P.clone().addScaledVector(d, c), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : t > n && (n > e && !O ? (h.beamStart = r.beamStart.clone().addScaledVector(d, c), h.beamEnd = r.beamEnd.clone().addScaledVector(d, c), h.doorStart = r.doorStart.clone().addScaledVector(d, c), h.doorEnd = r.doorEnd.clone().addScaledVector(d, c), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight) : !r.isPullOutDoor || O && r.isPullOutDoor && i ? (r.beamStart = j.clone().addScaledVector(u, c), r.beamEnd = M.clone().addScaledVector(u, c), r.doorStart = N.clone().addScaledVector(u, c), r.doorEnd = P.clone().addScaledVector(u, c), r.doorHeight = h.doorHeight, r.beamStart.z = r.beamEnd.z = r.doorStart.z + r.doorHeight) : (h.beamStart = r.beamStart.clone().addScaledVector(d, c), h.beamEnd = r.beamEnd.clone().addScaledVector(d, c), h.doorStart = r.doorStart.clone().addScaledVector(d, c), h.doorEnd = r.doorEnd.clone().addScaledVector(d, c), h.doorHeight = r.doorHeight, h.beamStart.z = h.beamEnd.z = h.doorStart.z + h.doorHeight)), y = h.nearId, _ = r.beamStart.clone(), v = r.beamEnd.clone(), g = !0;
 								break;
 							}
 						}
 					}
-					let E = !1;
-					if (!b) {
-						let a = new e.Line3(V.clone(), H.clone());
+					let b = !1;
+					if (!g) {
+						let a = new e.Line3(N.clone(), P.clone());
 						for (let o = 0; o < t.length; o++) {
 							if (t[o].length < .5 || o == i || !t[o].checkResults) continue;
-							let s = S(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), V, H);
+							let s = R(new e.Vector3(t[o].start.x, t[o].start.y, t[o].start.z), new e.Vector3(t[o].end.x, t[o].end.y, t[o].end.z), N, P);
 							if (s && s.maxPerpendicularDistance < .3) {
 								for (let i = 0; i < t[o].checkResults.length; i++) {
 									let i = [];
 									t[o].originalPoints.forEach((t) => {
-										t.z > V.z && t.z < V.z + k / 2 && i.push(new e.Vector3(t.x, t.y, V.z));
+										t.z > N.z && t.z < N.z + S / 2 && i.push(new e.Vector3(t.x, t.y, N.z));
 									});
 									let s = new e.Vector3(), l = [], u = [];
 									for (let e = 0; e < i.length; e++) {
 										let t = a.closestPointToPoint(i[e], !0, s);
 										t.distanceTo(i[e]) < .15 && (l.push(i[e]), u.push(t.clone()));
 									}
-									for (let e = 0; e < u.length; e++) j(a, u[e]) && l.push(u[e]);
+									for (let e = 0; e < u.length; e++) oe(a, u[e]) && l.push(u[e]);
 									if (l = u, l.length < 500) continue;
-									let d = M(l);
+									let d = se(l);
 									if (d.length == 2) {
 										let e = d[0].distanceTo(d[1]);
 										if (Math.abs(e - a.distance()) < .3) {
-											n = !0, G != -1 && (r[c[G].index].isFindBeam = !1, c[G].isFind = !1);
+											n = !0, z != -1 && (r[c[z].index].isFindBeam = !1, c[z].isFind = !1);
 											break;
 										}
 									}
 								}
 								if (n) break;
-							} else s && s.type == "collinear_overlap" && s.maxPerpendicularDistance > .3 && s.maxPerpendicularDistance < .7 && (E = !0);
+							} else s && s.type == "collinear_overlap" && s.maxPerpendicularDistance > .3 && s.maxPerpendicularDistance < .7 && (b = !0);
 						}
 						if (n) continue;
 					}
-					let A = !1;
-					if (T != -1) for (let e = 0; e < h.length && !(h[e].length == 1 && (h[e][0].id == l ? (h[e].push({
-						id: T,
-						beamStart: C,
-						beamEnd: w
-					}), A = !0) : h[e][0].id == T && (h[e].push({
+					let C = !1;
+					if (y != -1) for (let e = 0; e < p.length && !(p[e].length == 1 && (p[e][0].id == l ? (p[e].push({
+						id: y,
+						beamStart: _,
+						beamEnd: v
+					}), C = !0) : p[e][0].id == y && (p[e].push({
 						id: l,
-						beamStart: z,
-						beamEnd: B
-					}), A = !0), A)); e++);
-					A || h.push([{
+						beamStart: j,
+						beamEnd: M
+					}), C = !0), C)); e++);
+					C || p.push([{
 						id: l,
-						beamStart: z,
-						beamEnd: B
+						beamStart: j,
+						beamEnd: M
 					}]);
-					let N = _.doorStart.distanceTo(_.doorEnd);
-					if (g = I ? "door" : N > 1.8 || E && N > 1 ? "beam" : "hole", _.type = g, _.nearId != -1 && g == "hole") {
+					let w = h.doorStart.distanceTo(h.doorEnd);
+					if (m = E ? "door" : w > 1.8 || b && w > 1 ? "beam" : "hole", h.type = m, h.nearId != -1 && m == "hole") {
 						let e = !1;
 						for (let n = 0; n < t.length; n++) if (t[n].doorAndBeamData) {
 							for (let r = 0; r < t[n].doorAndBeamData.length; r++) if (t[n].doorAndBeamData[r].nearId == l && t[n].doorAndBeamData[r].type == "beam") {
-								t[n].doorAndBeamData[r].type = g, e = !0;
+								t[n].doorAndBeamData[r].type = m, e = !0;
 								break;
 							}
 							if (e) break;
 						}
 					}
-					if (a.doorAndBeamData.push(_), u.push({
+					if (a.doorAndBeamData.push(h), u.push({
 						linesIndex: i,
 						doorIndex: a.doorAndBeamData.length - 1
-					}), l++, L && D < 2) break;
+					}), l++, O && x < 2) break;
 				}
 			}
 		}
-		let k = a.length * (a.rooftopPz - a.start.z);
-		a.completePointAreaPercentage = D / k * 100;
+		let x = a.length * (a.rooftopPz - a.start.z);
+		a.completePointAreaPercentage = b / x * 100;
 	}
-	if (f.length > 1) for (let n = 0; n < f.length; n++) {
+	if (d.length > 1) for (let n = 0; n < d.length; n++) {
 		let r = [];
-		for (let i = 0; i < t[f[n]].doorAndBeamData.length; i++) {
-			let a = t[f[n]].doorAndBeamData[i].doorStart.clone(), o = t[f[n]].doorAndBeamData[i].doorEnd.clone();
+		for (let i = 0; i < t[d[n]].doorAndBeamData.length; i++) {
+			let a = t[d[n]].doorAndBeamData[i].doorStart.clone(), o = t[d[n]].doorAndBeamData[i].doorEnd.clone();
 			a.z = o.z = 0;
 			let s = a.distanceTo(o), c = !1;
-			for (let r = 0; r < f.length; r++) if (n != r) for (let n = 0; n < t[f[r]].doorAndBeamData.length; n++) {
-				let i = t[f[r]].doorAndBeamData[n].doorStart.clone(), l = t[f[r]].doorAndBeamData[n].doorEnd.clone();
+			for (let r = 0; r < d.length; r++) if (n != r) for (let n = 0; n < t[d[r]].doorAndBeamData.length; n++) {
+				let i = t[d[r]].doorAndBeamData[n].doorStart.clone(), l = t[d[r]].doorAndBeamData[n].doorEnd.clone();
 				i.z = l.z = 0, i.distanceTo(l);
-				let u = S(a, o, i, l);
+				let u = R(a, o, i, l);
 				if (u.type == "collinear_overlap" && u.maxPerpendicularDistance < .2) {
-					let t = new e.Line3(i, l), n = x(a, o), r = t.closestPointToPoint(n, !0, new e.Vector3()), d = n.distanceTo(r);
+					let t = new e.Line3(i, l), n = L(a, o), r = t.closestPointToPoint(n, !0, new e.Vector3()), d = n.distanceTo(r);
 					if (Math.abs(s - u.overlap) < .1 && d < .04) {
 						c = !0;
 						break;
 					}
 				}
 			}
-			c || r.push(t[f[n]].doorAndBeamData[i]);
+			c || r.push(t[d[n]].doorAndBeamData[i]);
 		}
-		r.length != t[f[n]].doorAndBeamData.length && (t[f[n]].doorAndBeamData = r);
+		r.length != t[d[n]].doorAndBeamData.length && (t[d[n]].doorAndBeamData = r);
 	}
-	let _ = .65, C = [], w = [];
+	let h = .65, g = [], _ = [];
 	for (let n = 0; n < c.length; n++) {
 		if (c[n].isFind) continue;
 		let i = new e.Vector3(c[n].doorStartPt.x, c[n].doorStartPt.y, 0), a = new e.Vector3(c[n].doorEndPt.x, c[n].doorEndPt.y, 0), o = new e.Vector3().subVectors(i, a).normalize();
 		for (let s = 0; s < t.length; s++) {
 			if (t[s].length < .7 || t[s].completePointAreaPercentage > 60) continue;
-			let u = new e.Vector3(t[s].start.x, t[s].start.y, 0), f = new e.Vector3(t[s].end.x, t[s].end.y, 0), p = new e.Vector3().subVectors(u, f).normalize(), m = .3, v = i.clone().addScaledVector(o, m), x = a.clone().addScaledVector(o.clone().negate(), m), T = u.clone().addScaledVector(p, m), E = f.clone().addScaledVector(p.clone().negate(), m);
-			d(v, x, T, E);
-			let D = y(v, x, T, E), O = i.distanceTo(u) > a.distanceTo(u) ? a : i, k = O.distanceTo(u), A = O.distanceTo(f);
-			if ((k < g || A < g) && D && !D.isParallel) {
-				let o = i.distanceTo(u) < i.distanceTo(f) ? u : f, p = !1;
-				for (let m = 0; m < t.length; m++) {
-					if (m == s || C.includes(m) || t[m].length < .7) continue;
-					let v = new e.Vector3(t[m].start.x, t[m].start.y, 0), x = new e.Vector3(t[m].end.x, t[m].end.y, 0), T = new e.Vector3().subVectors(v, x).normalize(), E = T.clone().negate(), D = v.clone().addScaledVector(T, 5), O = x.clone().addScaledVector(E, 5), k = b(u, f, v, x), A = S(u, f, v, x), j = d(u, f, D, O), M = !0;
-					if (j != null && (M = j.point.distanceTo(u) < g || j.point.distanceTo(f) < g), (k && k.angle > 85 || A && A.type == "collinear_gap") && M) {
-						let d = new e.Line3(u, f), g = new e.Vector3(), b = d.closestPointToPoint(v, !0, g), T = d.closestPointToPoint(x, !0, g), E = b.distanceTo(v), D = T.distanceTo(x), O, k;
-						if (E > D && D > _) O = x, k = T;
-						else if (E < D && E > _) O = v, k = b;
+			let u = new e.Vector3(t[s].start.x, t[s].start.y, 0), d = new e.Vector3(t[s].end.x, t[s].end.y, 0), f = new e.Vector3().subVectors(u, d).normalize(), v = .3, y = i.clone().addScaledVector(o, v), b = a.clone().addScaledVector(o.clone().negate(), v), x = u.clone().addScaledVector(f, v), S = d.clone().addScaledVector(f.clone().negate(), v);
+			D(y, b, x, S);
+			let C = F(y, b, x, S), w = i.distanceTo(u) > a.distanceTo(u) ? a : i, T = w.distanceTo(u), E = w.distanceTo(d);
+			if ((T < m || E < m) && C && !C.isParallel) {
+				let o = i.distanceTo(u) < i.distanceTo(d) ? u : d, f = !1;
+				for (let v = 0; v < t.length; v++) {
+					if (v == s || g.includes(v) || t[v].length < .7) continue;
+					let y = new e.Vector3(t[v].start.x, t[v].start.y, 0), b = new e.Vector3(t[v].end.x, t[v].end.y, 0), x = new e.Vector3().subVectors(y, b).normalize(), S = x.clone().negate(), C = y.clone().addScaledVector(x, 5), w = b.clone().addScaledVector(S, 5), T = I(u, d, y, b), E = R(u, d, y, b), O = D(u, d, C, w), k = !0;
+					if (O != null && (k = O.point.distanceTo(u) < m || O.point.distanceTo(d) < m), (T && T.angle > 85 || E && E.type == "collinear_gap") && k) {
+						let m = new e.Line3(u, d), x = new e.Vector3(), S = m.closestPointToPoint(y, !0, x), C = m.closestPointToPoint(b, !0, x), w = S.distanceTo(y), T = C.distanceTo(b), E, D;
+						if (w > T && T > h) E = b, D = C;
+						else if (w < T && w > h) E = y, D = S;
 						else continue;
-						if (E = o.distanceTo(v), D = o.distanceTo(x), E > 2 && D > 2) continue;
-						let A = y(O, k, v, x);
-						if (!A || !A.isParallel) continue;
-						let j = S(i, a, O, k);
-						if (j && j.type == "collinear_overlap" && j.maxPerpendicularDistance < .2) continue;
-						O.z = k.z = t[m].start.z;
-						let M = !1;
-						for (let e = 0; e < w.length; e++) {
-							let t = S(w[e].start, w[e].end, O, k);
+						if (w = o.distanceTo(y), T = o.distanceTo(b), w > 2 && T > 2) continue;
+						let O = F(E, D, y, b);
+						if (!O || !O.isParallel) continue;
+						let k = R(i, a, E, D);
+						if (k && k.type == "collinear_overlap" && k.maxPerpendicularDistance < .2) continue;
+						E.z = D.z = t[v].start.z;
+						let A = !1;
+						for (let e = 0; e < _.length; e++) {
+							let t = R(_[e].start, _[e].end, E, D);
 							if (t && t.type == "collinear_overlap" && t.maxPerpendicularDistance < .2) {
-								M = !0;
+								A = !0;
 								break;
 							}
 						}
-						if (M) continue;
+						if (A) continue;
 						for (let n = 0; n < t.length; n++) {
 							if (t[n].length < .5) continue;
-							let r = S(new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), O, k);
+							let r = R(new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), E, D);
 							if (r && r.type == "collinear_overlap" && r.maxPerpendicularDistance < .1) {
-								M = !0;
+								A = !0;
 								break;
 							}
 						}
-						if (M) continue;
-						w.push({
-							start: O,
-							end: k
-						}), C.push(m);
-						let N = t[m].rooftopPz - t[m].start.z, P = t[s].rooftopPz - t[s].start.z, F = N < P ? N : P;
-						t[m].doorAndBeamData || (t[m].doorAndBeamData = []), t[m].doorAndBeamData.push({
+						if (A) continue;
+						_.push({
+							start: E,
+							end: D
+						}), g.push(v);
+						let j = t[v].rooftopPz - t[v].start.z, M = t[s].rooftopPz - t[s].start.z, N = j < M ? j : M;
+						t[v].doorAndBeamData || (t[v].doorAndBeamData = []), t[v].doorAndBeamData.push({
 							id: l,
-							beamStart: O,
-							beamEnd: k,
-							beamHeight: F,
-							doorStart: O,
-							doorEnd: k,
-							doorHeight: F,
+							beamStart: E,
+							beamEnd: D,
+							beamHeight: N,
+							doorStart: E,
+							doorEnd: D,
+							doorHeight: N,
 							nearId: -1,
 							type: "onlyDoor",
 							isDoor: !0
-						}), r[c[n].index].isFindBeam = !0, r[c[n].index].isFindOnlyDoor = !0, h.push([{
+						}), r[c[n].index].isFindBeam = !0, r[c[n].index].isFindOnlyDoor = !0, p.push([{
 							id: l,
-							beamStart: O,
-							beamEnd: k
-						}]), l++, p = !0;
+							beamStart: E,
+							beamEnd: D
+						}]), l++, f = !0;
 						break;
 					}
 				}
-				if (p) break;
+				if (f) break;
 			}
 		}
 	}
 	return {
 		lines: t,
-		beamGroup: h
+		beamGroup: p
 	};
-}, W = (t, n) => {
+}, ve = (t, n) => {
 	if (t.length <= 0) return t;
 	for (let n of t) {
 		let t = [];
@@ -1852,11 +1872,11 @@ var R = class {
 					gridHeight: -1,
 					centerPts: []
 				});
-				let i = l.get(n), [o, s, f, p] = a[t], h = new e.Vector3().add(o).add(s).add(f).add(p).multiplyScalar(.25);
-				if (i.points.push(...a[t]), i.area += o.distanceTo(s) * o.distanceTo(p), i.originalVertices.push(a[t]), i.index = r, i.centerPts.push(h), u == -1 || d == -1) {
+				let i = l.get(n), [o, s, f, p] = a[t], m = new e.Vector3().add(o).add(s).add(f).add(p).multiplyScalar(.25);
+				if (i.points.push(...a[t]), i.area += o.distanceTo(s) * o.distanceTo(p), i.originalVertices.push(a[t]), i.index = r, i.centerPts.push(m), u == -1 || d == -1) {
 					let t = new e.Vector3().subVectors(o, s).normalize();
 					d = o.distanceTo(p), u = o.distanceTo(s);
-					let n = m(t, new e.Vector3(0, 0, 1));
+					let n = A(t, new e.Vector3(0, 0, 1));
 					n && n.parallel && ([d, u] = [u, d]);
 				}
 				i.gridWidth = u, i.gridHeight = d;
@@ -1887,7 +1907,7 @@ var R = class {
 		size: .01
 	});
 	for (let r = 0; r < t.length; r++) {
-		let i = t[r], { minZ: o, maxZ: s } = D(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;
@@ -1895,17 +1915,17 @@ var R = class {
 		let l = new e.Vector3(i.start.x, i.start.y, 0), u = new e.Vector3(i.end.x, i.end.y, 0);
 		for (let i = 0; i < t.length; i++) {
 			if (i == r || t[i].length < 1) continue;
-			let a = t[i], o = new e.Vector3(a.start.x, a.start.y, 0), c = new e.Vector3(a.end.x, a.end.y, 0), d = y(l, u, o, c), p = x(l, u), m = new e.Line3(o, c).closestPointToPoint(p, !0, new e.Vector3()), h = p.distanceTo(m), g = D(a);
-			if (!(g.minZ === void 0 || g.maxZ === void 0) && !(g.maxZ - g.minZ > 1) && d && d.isParallel && h < .25 && Math.abs(s - g.minZ) < .1) {
-				let a = x(l, u), s = x(o, c);
+			let a = t[i], o = new e.Vector3(a.start.x, a.start.y, 0), c = new e.Vector3(a.end.x, a.end.y, 0), d = F(l, u, o, c), f = L(l, u), p = new e.Line3(o, c).closestPointToPoint(f, !0, new e.Vector3()), m = f.distanceTo(p), h = re(a);
+			if (!(h.minZ === void 0 || h.maxZ === void 0) && !(h.maxZ - h.minZ > 1) && d && d.isParallel && m < .25 && Math.abs(s - h.minZ) < .1) {
+				let a = L(l, u), s = L(o, c);
 				a.z = s.z = 1, a.applyEuler(new e.Euler(-Math.PI / 2, 0, 0)), s.applyEuler(new e.Euler(-Math.PI / 2, 0, 0));
-				let d = `w:${t[r].originaIndex},b:${t[i].originaIndex}`, p = `b:${t[i].originaIndex},w:${t[r].originaIndex}`;
-				n.add(f(d, a, { textColor: "#fd0000" })), n.add(f(p, s, { textColor: "#fd0000" }));
+				let d = `w:${t[r].originaIndex},b:${t[i].originaIndex}`, f = `b:${t[i].originaIndex},w:${t[r].originaIndex}`;
+				n.add(O(d, a, { textColor: "#fd0000" })), n.add(O(f, s, { textColor: "#fd0000" }));
 			}
 		}
 	}
 	return t;
-}, G = (t, n) => {
+}, ye = (t, n) => {
 	let r = {
 		rectangles: [],
 		threeEdgeRect: []
@@ -1913,42 +1933,42 @@ var R = class {
 	for (let n = 0; n < t.length; n++) {
 		let c = t[n].length;
 		if (i.has(n) || c < a || c > o) continue;
-		let l = [], 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 = new e.Vector3().subVectors(d, u).normalize().clone().negate(), p = new e.Vector3(), h = new e.Vector3(), g = new e.Vector3();
+		let l = [], 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 = new e.Vector3().subVectors(d, u).normalize().clone().negate(), p = new e.Vector3(), m = new e.Vector3(), h = new e.Vector3();
 		new e.Vector3();
 		for (let r = 0; r < t.length; r++) {
 			let i = t[r].length;
 			if (r == n || i < a || i > o) continue;
-			let _ = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), v = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), y = b(u, d, _, v);
-			if (!y || y.angle < 85) continue;
-			let x = N(_, u), S = N(_, d), C = N(v, u), w = N(v, d);
-			if (!(!x && !S && !C && !w)) {
-				x || S ? (p = _.clone(), h = v.clone()) : (p = v.clone(), h = _.clone()), g = new e.Vector3().subVectors(h, p).normalize(), g.clone().negate();
+			let g = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), _ = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), v = I(u, d, g, _);
+			if (!v || v.angle < 85) continue;
+			let y = V(g, u), b = V(g, d), x = V(_, u), S = V(_, d);
+			if (!(!y && !b && !x && !S)) {
+				y || b ? (p = g.clone(), m = _.clone()) : (p = _.clone(), m = g.clone()), h = new e.Vector3().subVectors(m, p).normalize(), h.clone().negate();
 				for (let p = 0; p < t.length; p++) {
-					let g = t[p].length;
-					if (p == n || p == r || g < a || g > o) continue;
-					let y = new e.Vector3(t[p].start.x, t[p].start.y, t[p].start.z), x = new e.Vector3(t[p].end.x, t[p].end.y, t[p].end.z), S = b(_, v, y, x);
-					if (!S || S.angle < 85) continue;
-					let C = N(y, h), w = N(x, h);
-					if (!C && !w) continue;
+					let h = t[p].length;
+					if (p == n || p == r || h < a || h > o) continue;
+					let v = new e.Vector3(t[p].start.x, t[p].start.y, t[p].start.z), y = new e.Vector3(t[p].end.x, t[p].end.y, t[p].end.z), b = I(g, _, v, y);
+					if (!b || b.angle < 85) continue;
+					let x = V(v, m), S = V(y, m);
+					if (!x && !S) continue;
 					new e.Vector3();
-					let T = new e.Vector3(), E = new e.Vector3();
-					C ? (E = new e.Vector3().subVectors(x, y).normalize(), y.clone(), T = x.clone()) : (E = new e.Vector3().subVectors(y, x).normalize(), x.clone(), T = y.clone());
-					let D = m(f, E, .1);
-					if (!(!D || !D.parallel || !D.sameDirection)) {
+					let C = new e.Vector3(), w = new e.Vector3();
+					x ? (w = new e.Vector3().subVectors(y, v).normalize(), v.clone(), C = y.clone()) : (w = new e.Vector3().subVectors(v, y).normalize(), y.clone(), C = v.clone());
+					let T = A(f, w, .1);
+					if (!(!T || !T.parallel || !T.sameDirection)) {
 						for (let f = 0; f < t.length; f++) {
 							let m = t[f].length;
 							if (f == n || f == r || f == p || m < a || m > o) continue;
-							let h = new e.Vector3(t[f].start.x, t[f].start.y, t[f].start.z), g = new e.Vector3(t[f].end.x, t[f].end.y, t[f].end.z), _ = b(h, g, y, x);
+							let h = new e.Vector3(t[f].start.x, t[f].start.y, t[f].start.z), g = new e.Vector3(t[f].end.x, t[f].end.y, t[f].end.z), _ = I(h, g, v, y);
 							if (!_ || _.angle < 85) continue;
-							let v = N(h, T), S = N(g, T);
-							if (!v && !S) continue;
+							let b = V(h, C), x = V(g, C);
+							if (!b && !x) continue;
 							new e.Vector3();
-							let C = new e.Vector3();
-							v ? (h.clone(), C = g.clone()) : (g.clone(), C = h.clone());
-							let w = N(C, u), E = N(C, d);
-							if (!w && !E) continue;
-							let D = c * i;
-							if (!(D < s || D > 2)) {
+							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);
+							if (!w && !T) continue;
+							let E = c * i;
+							if (!(E < s || E > 2)) {
 								l = [
 									n,
 									r,
@@ -1978,48 +1998,48 @@ var R = class {
 		}, u = new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), d = new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), f = !0, p = !0;
 		for (let r = 0; r < t.length; r++) {
 			if (r == n) continue;
-			let i = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), a = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), o = N(i, u), s = N(a, u), c = N(i, d), l = N(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 = V(i, u), s = V(a, u), c = V(i, d), l = V(a, d);
 			if (o || s ? f = !1 : (c || l) && (p = !1), !f && !p) break;
 		}
 		if (!f && !p) continue;
-		let h = new e.Vector3();
-		f || ([u, d] = [d, u]), h = new e.Vector3().subVectors(d, u).normalize();
-		let g = h.clone().negate();
+		let m = new e.Vector3();
+		f || ([u, d] = [d, u]), m = new e.Vector3().subVectors(d, u).normalize();
+		let h = m.clone().negate();
 		for (let r = 0; r < t.length; r++) {
 			let f = t[r].length;
 			if (r == n || i.has(r) || f < a || f > o) continue;
-			let p = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), h = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), _ = b(u, d, p, h);
-			if (!_ || _.angle < 85) continue;
-			let v = N(p, d), y = N(h, d);
-			if (!v && !y) continue;
+			let p = new e.Vector3(t[r].start.x, t[r].start.y, t[r].start.z), m = new e.Vector3(t[r].end.x, t[r].end.y, t[r].end.z), g = I(u, d, p, m);
+			if (!g || g.angle < 85) continue;
+			let _ = V(p, d), v = V(m, d);
+			if (!_ && !v) continue;
 			new e.Vector3();
-			let x = new e.Vector3();
-			v ? (p.clone(), x = h.clone()) : (h.clone(), x = p.clone());
+			let y = new e.Vector3();
+			_ ? (p.clone(), y = m.clone()) : (m.clone(), y = p.clone());
 			for (let d = 0; d < t.length; d++) {
-				let _ = t[d].length;
-				if (d == n || d == r || i.has(d) || _ < a || _ > o) continue;
-				let v = new e.Vector3(t[d].start.x, t[d].start.y, t[d].start.z), y = new e.Vector3(t[d].end.x, t[d].end.y, t[d].end.z), S = b(p, h, v, y);
-				if (!S || S.angle < 85) continue;
-				let C = N(v, x), w = N(y, x);
-				if (!C && !w) continue;
-				let T = new e.Vector3(), E = new e.Vector3();
-				C ? (T = v.clone(), E = y.clone()) : (T = y.clone(), E = v.clone());
-				let D = m(g, new e.Vector3().subVectors(E, T).normalize(), .1);
-				if (!D || !D.parallel || !D.sameDirection) continue;
-				let O = !0, k = !0;
+				let g = t[d].length;
+				if (d == n || d == r || i.has(d) || g < a || g > o) continue;
+				let _ = new e.Vector3(t[d].start.x, t[d].start.y, t[d].start.z), v = new e.Vector3(t[d].end.x, t[d].end.y, t[d].end.z), b = I(p, m, _, v);
+				if (!b || b.angle < 85) continue;
+				let x = V(_, y), S = V(v, y);
+				if (!x && !S) continue;
+				let C = new e.Vector3(), w = new e.Vector3();
+				x ? (C = _.clone(), w = v.clone()) : (C = v.clone(), w = _.clone());
+				let T = A(h, new e.Vector3().subVectors(w, C).normalize(), .1);
+				if (!T || !T.parallel || !T.sameDirection) continue;
+				let E = !0, D = !0;
 				for (let n = 0; n < t.length; n++) {
 					if (n == d) continue;
-					let r = new e.Vector3(t[n].start.x, t[n].start.y, t[n].start.z), i = new e.Vector3(t[n].end.x, t[n].end.y, t[n].end.z), a = N(r, v), o = N(i, v), s = N(r, y), c = N(i, y);
-					if (a || o ? O = !1 : (s || c) && (k = !1), !O && !k) break;
+					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);
+					if (a || o ? E = !1 : (s || c) && (D = !1), !E && !D) break;
 				}
-				if (!O && !k) continue;
-				let A = c * f;
-				if (!(A < s || A > 2)) {
+				if (!E && !D) continue;
+				let O = c * f;
+				if (!(O < s || O > 2)) {
 					l.indexs = [
 						n,
 						r,
 						d
-					], l.missingEdge.start = E, l.missingEdge.end = u;
+					], l.missingEdge.start = w, l.missingEdge.end = u;
 					break;
 				}
 			}
@@ -2028,6 +2048,2031 @@ var R = class {
 		l.indexs.length == 3 && (l.indexs.forEach((e) => i.add(e)), r.threeEdgeRect.push(l));
 	}
 	return r;
+}, H = 11102230246251565e-32, U = 134217729, be = (3 + 8 * H) * H;
+function xe(e, t, n, r, i) {
+	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;
+	if (d < e && f < n) for (u > l == u > -l ? (o = l + a, s = a - (o - l), l = t[++d]) : (o = u + a, s = a - (o - u), u = r[++f]), a = o, s !== 0 && (i[p++] = s); d < e && f < n;) u > l == u > -l ? (o = a + l, c = o - a, s = a - (o - c) + (l - c), l = t[++d]) : (o = a + u, c = o - a, s = a - (o - c) + (u - c), u = r[++f]), a = o, s !== 0 && (i[p++] = s);
+	for (; d < e;) o = a + l, c = o - a, s = a - (o - c) + (l - c), l = t[++d], a = o, s !== 0 && (i[p++] = s);
+	for (; f < n;) o = a + u, c = o - a, s = a - (o - c) + (u - c), u = r[++f], a = o, s !== 0 && (i[p++] = s);
+	return (a !== 0 || p === 0) && (i[p++] = a), p;
+}
+function Se(e, t) {
+	let n = t[0];
+	for (let r = 1; r < e; r++) n += t[r];
+	return n;
+}
+function W(e) {
+	return new Float64Array(e);
+}
+//#endregion
+//#region node_modules/robust-predicates/esm/orient2d.js
+var Ce = (3 + 16 * H) * H, we = (2 + 12 * H) * H, Te = (9 + 64 * H) * H * H, Ee = W(4), De = W(8), Oe = W(12), ke = W(16), G = W(4);
+function Ae(e, t, n, r, i, a, o) {
+	let s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T = e - i, E = n - i, D = t - a, O = r - a;
+	b = T * O, f = U * T, p = f - (f - T), m = T - p, f = U * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = D * E, f = U * D, p = f - (f - D), m = D - p, f = U * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, Ee[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, Ee[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, Ee[2] = v - (w - d) + (_ - d), Ee[3] = w;
+	let k = Se(4, Ee), A = we * o;
+	if (k >= A || -k >= A || (d = e - T, s = e - (T + d) + (d - i), d = n - E, l = n - (E + d) + (d - i), d = t - D, c = t - (D + d) + (d - a), d = r - O, u = r - (O + d) + (d - a), s === 0 && c === 0 && l === 0 && u === 0) || (A = Te * o + be * Math.abs(k), k += T * u + O * s - (D * l + E * c), k >= A || -k >= A)) return k;
+	b = s * O, f = U * s, p = f - (f - s), m = s - p, f = U * O, h = f - (f - O), g = O - h, x = m * g - (b - p * h - m * h - p * g), S = c * E, f = U * c, p = f - (f - c), m = c - p, f = U * E, h = f - (f - E), g = E - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, G[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, G[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, G[2] = v - (w - d) + (_ - d), G[3] = w;
+	let j = xe(4, Ee, 4, G, De);
+	b = T * u, f = U * T, p = f - (f - T), m = T - p, f = U * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = D * l, f = U * D, p = f - (f - D), m = D - p, f = U * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, G[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, G[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, G[2] = v - (w - d) + (_ - d), G[3] = w;
+	let M = xe(j, De, 4, G, Oe);
+	return b = s * u, f = U * s, p = f - (f - s), m = s - p, f = U * u, h = f - (f - u), g = u - h, x = m * g - (b - p * h - m * h - p * g), S = c * l, f = U * c, p = f - (f - c), m = c - p, f = U * l, h = f - (f - l), g = l - h, C = m * g - (S - p * h - m * h - p * g), _ = x - C, d = x - _, G[0] = x - (_ + d) + (d - C), v = b + _, d = v - b, y = b - (v - d) + (_ - d), _ = y - S, d = y - _, G[1] = y - (_ + d) + (d - S), w = v + _, d = w - v, G[2] = v - (w - d) + (_ - d), G[3] = w, ke[xe(M, Oe, 4, G, ke) - 1];
+}
+function je(e, t, n, r, i, a) {
+	let o = (t - a) * (n - i), s = (e - i) * (r - a), c = o - s, l = Math.abs(o + s);
+	return Math.abs(c) >= Ce * l ? c : -Ae(e, t, n, r, i, a, l);
+}
+(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);
+//#endregion
+//#region node_modules/delaunator/index.js
+var Me = 2 ** -52, Ne = new Uint32Array(512), Pe = class e {
+	static from(t, n = He, r = Ue) {
+		let i = t.length, a = new Float64Array(i * 2);
+		for (let e = 0; e < i; e++) {
+			let i = t[e];
+			a[2 * e] = n(i), a[2 * e + 1] = r(i);
+		}
+		return new e(a);
+	}
+	constructor(e) {
+		let t = e.length >> 1;
+		if (t > 0 && typeof e[0] != "number") throw Error("Expected coords to contain numbers.");
+		this.coords = e;
+		let n = Math.max(2 * t - 5, 0);
+		this._triangles = new Uint32Array(n * 3), this._halfedges = new Int32Array(n * 3), this._hashSize = Math.ceil(Math.sqrt(t)), this._hullPrev = new Uint32Array(t), this._hullNext = new Uint32Array(t), this._hullTri = new Uint32Array(t), this._hullHash = new Int32Array(this._hashSize), this._ids = new Uint32Array(t), this._dists = new Float64Array(t), this.trianglesLen = 0, this._cx = 0, this._cy = 0, this._hullStart = 0, this.hull = this._triangles, this.triangles = this._triangles, this.halfedges = this._halfedges, this.update();
+	}
+	update() {
+		let { coords: e, _hullPrev: t, _hullNext: n, _hullTri: r, _hullHash: i } = this, a = e.length >> 1, o = Infinity, s = Infinity, c = -Infinity, l = -Infinity;
+		for (let t = 0; t < a; t++) {
+			let n = e[2 * t], r = e[2 * t + 1];
+			n < o && (o = n), r < s && (s = r), n > c && (c = n), r > l && (l = r), this._ids[t] = t;
+		}
+		let u = (o + c) / 2, d = (s + l) / 2, f = 0, p = 0, m = 0;
+		for (let t = 0, n = Infinity; t < a; t++) {
+			let r = Ie(u, d, e[2 * t], e[2 * t + 1]);
+			r < n && (f = t, n = r);
+		}
+		let h = e[2 * f], g = e[2 * f + 1];
+		for (let t = 0, n = Infinity; t < a; t++) {
+			if (t === f) continue;
+			let r = Ie(h, g, e[2 * t], e[2 * t + 1]);
+			r < n && r > 0 && (p = t, n = r);
+		}
+		let _ = e[2 * p], v = e[2 * p + 1], y = Infinity;
+		for (let t = 0; t < a; t++) {
+			if (t === f || t === p) continue;
+			let n = Re(h, g, _, v, e[2 * t], e[2 * t + 1]);
+			n < y && (m = t, y = n);
+		}
+		let b = e[2 * m], x = e[2 * m + 1];
+		if (y === Infinity) {
+			for (let t = 0; t < a; t++) this._dists[t] = e[2 * t] - e[0] || e[2 * t + 1] - e[1];
+			Be(this._ids, this._dists, 0, a - 1);
+			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];
+				a > r && (t[n++] = i, r = a);
+			}
+			this.hull = t.subarray(0, n), this.triangles = new Uint32Array(), this.halfedges = new Int32Array();
+			return;
+		}
+		if (je(h, g, _, v, b, x) < 0) {
+			let e = p, t = _, n = v;
+			p = m, _ = b, v = x, m = e, b = t, x = n;
+		}
+		let S = ze(h, g, _, v, b, x);
+		this._cx = S.x, this._cy = S.y;
+		for (let t = 0; t < a; t++) this._dists[t] = Ie(e[2 * t], e[2 * t + 1], S.x, S.y);
+		Be(this._ids, this._dists, 0, a - 1), this._hullStart = f;
+		let C = 3;
+		n[f] = t[m] = p, n[p] = t[f] = m, n[m] = t[p] = f, r[f] = 0, r[p] = 1, r[m] = 2, i.fill(-1), i[this._hashKey(h, g)] = f, i[this._hashKey(_, v)] = p, i[this._hashKey(b, x)] = m, this.trianglesLen = 0, this._addTriangle(f, p, m, -1, -1, -1);
+		for (let a = 0, o = 0, s = 0; a < this._ids.length; a++) {
+			let c = this._ids[a], l = e[2 * c], u = e[2 * c + 1];
+			if (a > 0 && Math.abs(l - o) <= Me && Math.abs(u - s) <= Me || (o = l, s = u, c === f || c === p || c === m)) continue;
+			let d = 0;
+			for (let e = 0, t = this._hashKey(l, u); e < this._hashSize && (d = i[(t + e) % this._hashSize], !(d !== -1 && d !== n[d])); e++);
+			d = t[d];
+			let h = d, g;
+			for (; g = n[h], je(l, u, e[2 * h], e[2 * h + 1], e[2 * g], e[2 * g + 1]) >= 0;) if (h = g, h === d) {
+				h = -1;
+				break;
+			}
+			if (h === -1) continue;
+			let _ = this._addTriangle(h, c, n[h], -1, -1, r[h]);
+			r[c] = this._legalize(_ + 2), r[h] = _, C++;
+			let v = n[h];
+			for (; g = n[v], je(l, u, e[2 * v], e[2 * v + 1], e[2 * g], e[2 * g + 1]) < 0;) _ = this._addTriangle(v, c, g, r[c], -1, r[v]), r[c] = this._legalize(_ + 2), n[v] = v, C--, v = g;
+			if (h === d) for (; g = t[h], je(l, u, e[2 * g], e[2 * g + 1], e[2 * h], e[2 * h + 1]) < 0;) _ = this._addTriangle(g, c, h, -1, r[h], r[g]), this._legalize(_ + 2), r[g] = _, n[h] = h, C--, h = g;
+			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);
+		for (let e = 0, t = this._hullStart; e < C; e++) this.hull[e] = t, t = n[t];
+		this.triangles = this._triangles.subarray(0, this.trianglesLen), this.halfedges = this._halfedges.subarray(0, this.trianglesLen);
+	}
+	_hashKey(e, t) {
+		return Math.floor(Fe(e - this._cx, t - this._cy) * this._hashSize) % this._hashSize;
+	}
+	_legalize(e) {
+		let { _triangles: t, _halfedges: n, coords: r } = this, i = 0, a = 0;
+		for (;;) {
+			let o = n[e], s = e - e % 3;
+			if (a = s + (e + 2) % 3, o === -1) {
+				if (i === 0) break;
+				e = Ne[--i];
+				continue;
+			}
+			let c = o - o % 3, l = s + (e + 1) % 3, u = c + (o + 2) % 3, d = t[a], f = t[e], p = t[l], m = t[u];
+			if (Le(r[2 * d], r[2 * d + 1], r[2 * f], r[2 * f + 1], r[2 * p], r[2 * p + 1], r[2 * m], r[2 * m + 1])) {
+				t[e] = m, t[o] = d;
+				let r = n[u];
+				if (r === -1) {
+					let t = this._hullStart;
+					do {
+						if (this._hullTri[t] === u) {
+							this._hullTri[t] = e;
+							break;
+						}
+						t = this._hullPrev[t];
+					} while (t !== this._hullStart);
+				}
+				this._link(e, r), this._link(o, n[a]), this._link(a, u);
+				let s = c + (o + 1) % 3;
+				i < Ne.length && (Ne[i++] = s);
+			} else {
+				if (i === 0) break;
+				e = Ne[--i];
+			}
+		}
+		return a;
+	}
+	_link(e, t) {
+		this._halfedges[e] = t, t !== -1 && (this._halfedges[t] = e);
+	}
+	_addTriangle(e, t, n, r, i, a) {
+		let o = this.trianglesLen;
+		return this._triangles[o] = e, this._triangles[o + 1] = t, this._triangles[o + 2] = n, this._link(o, r), this._link(o + 1, i), this._link(o + 2, a), this.trianglesLen += 3, o;
+	}
+};
+function Fe(e, t) {
+	let n = e / (Math.abs(e) + Math.abs(t));
+	return (t > 0 ? 3 - n : 1 + n) / 4;
+}
+function Ie(e, t, n, r) {
+	let i = e - n, a = t - r;
+	return i * i + a * a;
+}
+function Le(e, t, n, r, i, a, o, s) {
+	let c = e - o, l = t - s, u = n - o, d = r - s, f = i - o, p = a - s, m = c * c + l * l, h = u * u + d * d, g = f * f + p * p;
+	return c * (d * g - h * p) - l * (u * g - h * f) + m * (u * p - d * f) < 0;
+}
+function Re(e, t, n, r, i, a) {
+	let o = n - e, s = r - t, c = i - e, l = a - t, u = o * o + s * s, d = c * c + l * l, f = .5 / (o * l - s * c), p = (l * u - s * d) * f, m = (o * d - c * u) * f;
+	return p * p + m * m;
+}
+function ze(e, t, n, r, i, a) {
+	let o = n - e, s = r - t, c = i - e, l = a - t, u = o * o + s * s, d = c * c + l * l, f = .5 / (o * l - s * c);
+	return {
+		x: e + (l * u - s * d) * f,
+		y: t + (o * d - c * u) * f
+	};
+}
+function Be(e, t, n, r) {
+	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--];
+		e[o + 1] = r;
+	}
+	else {
+		let i = n + r >> 1, a = n + 1, o = r;
+		Ve(e, i, a), t[e[n]] > t[e[r]] && Ve(e, n, r), t[e[a]] > t[e[r]] && Ve(e, a, r), t[e[n]] > t[e[a]] && Ve(e, n, a);
+		let s = e[a], c = t[s];
+		for (;;) {
+			do
+				a++;
+			while (t[e[a]] < c);
+			do
+				o--;
+			while (t[e[o]] > c);
+			if (o < a) break;
+			Ve(e, a, o);
+		}
+		e[n + 1] = e[o], e[o] = s, r - a + 1 >= o - n ? (Be(e, t, a, r), Be(e, t, n, o - 1)) : (Be(e, t, n, o - 1), Be(e, t, a, r));
+	}
+}
+function Ve(e, t, n) {
+	let r = e[t];
+	e[t] = e[n], e[n] = r;
+}
+function He(e) {
+	return e[0];
+}
+function Ue(e) {
+	return e[1];
+}
+//#endregion
+//#region node_modules/d3-delaunay/src/path.js
+var We = 1e-6, Ge = class {
+	constructor() {
+		this._x0 = this._y0 = this._x1 = this._y1 = null, this._ = "";
+	}
+	moveTo(e, t) {
+		this._ += `M${this._x0 = this._x1 = +e},${this._y0 = this._y1 = +t}`;
+	}
+	closePath() {
+		this._x1 !== null && (this._x1 = this._x0, this._y1 = this._y0, this._ += "Z");
+	}
+	lineTo(e, t) {
+		this._ += `L${this._x1 = +e},${this._y1 = +t}`;
+	}
+	arc(e, t, n) {
+		e = +e, t = +t, n = +n;
+		let r = e + n, i = t;
+		if (n < 0) throw Error("negative radius");
+		this._x1 === null ? this._ += `M${r},${i}` : (Math.abs(this._x1 - r) > We || Math.abs(this._y1 - i) > We) && (this._ += "L" + r + "," + i), n && (this._ += `A${n},${n},0,1,1,${e - n},${t}A${n},${n},0,1,1,${this._x1 = r},${this._y1 = i}`);
+	}
+	rect(e, t, n, r) {
+		this._ += `M${this._x0 = this._x1 = +e},${this._y0 = this._y1 = +t}h${+n}v${+r}h${-n}Z`;
+	}
+	value() {
+		return this._ || null;
+	}
+}, Ke = class {
+	constructor() {
+		this._ = [];
+	}
+	moveTo(e, t) {
+		this._.push([e, t]);
+	}
+	closePath() {
+		this._.push(this._[0].slice());
+	}
+	lineTo(e, t) {
+		this._.push([e, t]);
+	}
+	value() {
+		return this._.length ? this._ : null;
+	}
+}, qe = class {
+	constructor(e, [t, n, r, i] = [
+		0,
+		0,
+		960,
+		500
+	]) {
+		if (!((r = +r) >= (t = +t)) || !((i = +i) >= (n = +n))) throw Error("invalid bounds");
+		this.delaunay = e, this._circumcenters = new Float64Array(e.points.length * 2), this.vectors = new Float64Array(e.points.length * 2), this.xmax = r, this.xmin = t, this.ymax = i, this.ymin = n, this._init();
+	}
+	update() {
+		return this.delaunay.update(), this._init(), this;
+	}
+	_init() {
+		let { delaunay: { points: e, hull: t, triangles: n }, vectors: r } = this, i, a, o = this.circumcenters = this._circumcenters.subarray(0, n.length / 3 * 2);
+		for (let r = 0, s = 0, c = n.length, l, u; r < c; r += 3, s += 2) {
+			let c = n[r] * 2, d = n[r + 1] * 2, f = n[r + 2] * 2, p = e[c], m = e[c + 1], h = e[d], g = e[d + 1], _ = e[f], v = e[f + 1], y = h - p, b = g - m, x = _ - p, S = v - m, C = (y * S - b * x) * 2;
+			if (Math.abs(C) < 1e-9) {
+				if (i === void 0) {
+					i = a = 0;
+					for (let n of t) i += e[n * 2], a += e[n * 2 + 1];
+					i /= t.length, a /= t.length;
+				}
+				let n = 1e9 * Math.sign((i - p) * S - (a - m) * x);
+				l = (p + _) / 2 - n * S, u = (m + v) / 2 + n * x;
+			} else {
+				let e = 1 / C, t = y * y + b * b, n = x * x + S * S;
+				l = p + (S * t - b * n) * e, u = m + (y * n - x * t) * e;
+			}
+			o[s] = l, o[s + 1] = u;
+		}
+		let s = t[t.length - 1], c, l = s * 4, u, d = e[2 * s], f, p = e[2 * s + 1];
+		r.fill(0);
+		for (let n = 0; n < t.length; ++n) s = t[n], c = l, u = d, f = p, l = s * 4, d = e[2 * s], p = e[2 * s + 1], r[c + 2] = r[l] = f - p, r[c + 3] = r[l + 1] = d - u;
+	}
+	render(e) {
+		let t = e == null ? e = new Ge() : void 0, { delaunay: { halfedges: n, inedges: r, hull: i }, circumcenters: a, vectors: o } = this;
+		if (i.length <= 1) return null;
+		for (let t = 0, r = n.length; t < r; ++t) {
+			let r = n[t];
+			if (r < t) continue;
+			let i = Math.floor(t / 3) * 2, o = Math.floor(r / 3) * 2, s = a[i], c = a[i + 1], l = a[o], u = a[o + 1];
+			this._renderSegment(s, c, l, u, e);
+		}
+		let s, c = i[i.length - 1];
+		for (let t = 0; t < i.length; ++t) {
+			s = c, c = i[t];
+			let n = Math.floor(r[c] / 3) * 2, l = a[n], u = a[n + 1], d = s * 4, f = this._project(l, u, o[d + 2], o[d + 3]);
+			f && this._renderSegment(l, u, f[0], f[1], e);
+		}
+		return t && t.value();
+	}
+	renderBounds(e) {
+		let t = e == null ? e = new Ge() : void 0;
+		return e.rect(this.xmin, this.ymin, this.xmax - this.xmin, this.ymax - this.ymin), t && t.value();
+	}
+	renderCell(e, t) {
+		let n = t == null ? t = new Ge() : void 0, r = this._clip(e);
+		if (r === null || !r.length) return;
+		t.moveTo(r[0], r[1]);
+		let i = r.length;
+		for (; r[0] === r[i - 2] && r[1] === r[i - 1] && i > 1;) i -= 2;
+		for (let e = 2; e < i; e += 2) (r[e] !== r[e - 2] || r[e + 1] !== r[e - 1]) && t.lineTo(r[e], r[e + 1]);
+		return t.closePath(), n && n.value();
+	}
+	*cellPolygons() {
+		let { delaunay: { points: e } } = this;
+		for (let t = 0, n = e.length / 2; t < n; ++t) {
+			let e = this.cellPolygon(t);
+			e && (e.index = t, yield e);
+		}
+	}
+	cellPolygon(e) {
+		let t = new Ke();
+		return this.renderCell(e, t), t.value();
+	}
+	_renderSegment(e, t, n, r, i) {
+		let a, o = this._regioncode(e, t), s = this._regioncode(n, r);
+		o === 0 && s === 0 ? (i.moveTo(e, t), i.lineTo(n, r)) : (a = this._clipSegment(e, t, n, r, o, s)) && (i.moveTo(a[0], a[1]), i.lineTo(a[2], a[3]));
+	}
+	contains(e, t, n) {
+		return (t = +t, t !== t) || (n = +n, n !== n) ? !1 : this.delaunay._step(e, t, n) === e;
+	}
+	*neighbors(e) {
+		let t = this._clip(e);
+		if (t) for (let n of this.delaunay.neighbors(e)) {
+			let e = this._clip(n);
+			if (e) {
+				loop: for (let r = 0, i = t.length; r < i; r += 2) for (let a = 0, o = e.length; a < o; a += 2) if (t[r] === e[a] && t[r + 1] === e[a + 1] && t[(r + 2) % i] === e[(a + o - 2) % o] && t[(r + 3) % i] === e[(a + o - 1) % o]) {
+					yield n;
+					break loop;
+				}
+			}
+		}
+	}
+	_cell(e) {
+		let { circumcenters: t, delaunay: { inedges: n, halfedges: r, triangles: i } } = this, a = n[e];
+		if (a === -1) return null;
+		let o = [], s = a;
+		do {
+			let n = Math.floor(s / 3);
+			if (o.push(t[n * 2], t[n * 2 + 1]), s = s % 3 == 2 ? s - 2 : s + 1, i[s] !== e) break;
+			s = r[s];
+		} while (s !== a && s !== -1);
+		return o;
+	}
+	_clip(e) {
+		if (e === 0 && this.delaunay.hull.length === 1) return [
+			this.xmax,
+			this.ymin,
+			this.xmax,
+			this.ymax,
+			this.xmin,
+			this.ymax,
+			this.xmin,
+			this.ymin
+		];
+		let t = this._cell(e);
+		if (t === null) return null;
+		let { vectors: n } = this, r = e * 4;
+		return this._simplify(n[r] || n[r + 1] ? this._clipInfinite(e, t, n[r], n[r + 1], n[r + 2], n[r + 3]) : this._clipFinite(e, t));
+	}
+	_clipFinite(e, t) {
+		let n = t.length, r = null, i, a, o = t[n - 2], s = t[n - 1], c, l = this._regioncode(o, s), u, d = 0;
+		for (let f = 0; f < n; f += 2) if (i = o, a = s, o = t[f], s = t[f + 1], c = l, l = this._regioncode(o, s), c === 0 && l === 0) u = d, d = 0, r ? r.push(o, s) : r = [o, s];
+		else {
+			let t, n, f, p, m;
+			if (c === 0) {
+				if ((t = this._clipSegment(i, a, o, s, c, l)) === null) continue;
+				[n, f, p, m] = t;
+			} else {
+				if ((t = this._clipSegment(o, s, i, a, l, c)) === null) continue;
+				[p, m, n, f] = t, u = d, d = this._edgecode(n, f), u && d && this._edge(e, u, d, r, r.length), r ? r.push(n, f) : r = [n, f];
+			}
+			u = d, d = this._edgecode(p, m), u && d && this._edge(e, u, d, r, r.length), r ? r.push(p, m) : r = [p, m];
+		}
+		if (r) u = d, d = this._edgecode(r[0], r[1]), u && d && this._edge(e, u, d, r, r.length);
+		else if (this.contains(e, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2)) return [
+			this.xmax,
+			this.ymin,
+			this.xmax,
+			this.ymax,
+			this.xmin,
+			this.ymax,
+			this.xmin,
+			this.ymin
+		];
+		return r;
+	}
+	_clipSegment(e, t, n, r, i, a) {
+		let o = i < a;
+		for (o && ([e, t, n, r, i, a] = [
+			n,
+			r,
+			e,
+			t,
+			a,
+			i
+		]);;) {
+			if (i === 0 && a === 0) return o ? [
+				n,
+				r,
+				e,
+				t
+			] : [
+				e,
+				t,
+				n,
+				r
+			];
+			if (i & a) return null;
+			let s, c, l = i || a;
+			l & 8 ? (s = e + (n - e) * (this.ymax - t) / (r - t), c = this.ymax) : l & 4 ? (s = e + (n - e) * (this.ymin - t) / (r - t), c = this.ymin) : l & 2 ? (c = t + (r - t) * (this.xmax - e) / (n - e), s = this.xmax) : (c = t + (r - t) * (this.xmin - e) / (n - e), s = this.xmin), i ? (e = s, t = c, i = this._regioncode(e, t)) : (n = s, r = c, a = this._regioncode(n, r));
+		}
+	}
+	_clipInfinite(e, t, n, r, i, a) {
+		let o = Array.from(t), s;
+		if ((s = this._project(o[0], o[1], n, r)) && o.unshift(s[0], s[1]), (s = this._project(o[o.length - 2], o[o.length - 1], i, a)) && o.push(s[0], s[1]), o = this._clipFinite(e, o)) for (let t = 0, n = o.length, r, i = this._edgecode(o[n - 2], o[n - 1]); t < n; t += 2) r = i, i = this._edgecode(o[t], o[t + 1]), r && i && (t = this._edge(e, r, i, o, t), n = o.length);
+		else this.contains(e, (this.xmin + this.xmax) / 2, (this.ymin + this.ymax) / 2) && (o = [
+			this.xmin,
+			this.ymin,
+			this.xmax,
+			this.ymin,
+			this.xmax,
+			this.ymax,
+			this.xmin,
+			this.ymax
+		]);
+		return o;
+	}
+	_edge(e, t, n, r, i) {
+		for (; t !== n;) {
+			let n, a;
+			switch (t) {
+				case 5:
+					t = 4;
+					continue;
+				case 4:
+					t = 6, n = this.xmax, a = this.ymin;
+					break;
+				case 6:
+					t = 2;
+					continue;
+				case 2:
+					t = 10, n = this.xmax, a = this.ymax;
+					break;
+				case 10:
+					t = 8;
+					continue;
+				case 8:
+					t = 9, n = this.xmin, a = this.ymax;
+					break;
+				case 9:
+					t = 1;
+					continue;
+				case 1:
+					t = 5, n = this.xmin, a = this.ymin;
+					break;
+			}
+			(r[i] !== n || r[i + 1] !== a) && this.contains(e, n, a) && (r.splice(i, 0, n, a), i += 2);
+		}
+		return i;
+	}
+	_project(e, t, n, r) {
+		let i = Infinity, a, o, s;
+		if (r < 0) {
+			if (t <= this.ymin) return null;
+			(a = (this.ymin - t) / r) < i && (s = this.ymin, o = e + (i = a) * n);
+		} else if (r > 0) {
+			if (t >= this.ymax) return null;
+			(a = (this.ymax - t) / r) < i && (s = this.ymax, o = e + (i = a) * n);
+		}
+		if (n > 0) {
+			if (e >= this.xmax) return null;
+			(a = (this.xmax - e) / n) < i && (o = this.xmax, s = t + (i = a) * r);
+		} else if (n < 0) {
+			if (e <= this.xmin) return null;
+			(a = (this.xmin - e) / n) < i && (o = this.xmin, s = t + (i = a) * r);
+		}
+		return [o, s];
+	}
+	_edgecode(e, t) {
+		return (e === this.xmin ? 1 : e === this.xmax ? 2 : 0) | (t === this.ymin ? 4 : t === this.ymax ? 8 : 0);
+	}
+	_regioncode(e, t) {
+		return (e < this.xmin ? 1 : e > this.xmax ? 2 : 0) | (t < this.ymin ? 4 : t > this.ymax ? 8 : 0);
+	}
+	_simplify(e) {
+		if (e && e.length > 4) {
+			for (let t = 0; t < e.length; t += 2) {
+				let n = (t + 2) % e.length, r = (t + 4) % e.length;
+				(e[t] === e[n] && e[n] === e[r] || e[t + 1] === e[n + 1] && e[n + 1] === e[r + 1]) && (e.splice(n, 2), t -= 2);
+			}
+			e.length || (e = null);
+		}
+		return e;
+	}
+}, Je = 2 * Math.PI, Ye = Math.pow;
+function Xe(e) {
+	return e[0];
+}
+function Ze(e) {
+	return e[1];
+}
+function Qe(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];
+		if ((n[a] - n[r]) * (n[i + 1] - n[r + 1]) - (n[i] - n[r]) * (n[a + 1] - n[r + 1]) > 1e-10) return !1;
+	}
+	return !0;
+}
+function $e(e, t, n) {
+	return [e + Math.sin(e + t) * n, t + Math.cos(e - t) * n];
+}
+var et = class e {
+	static from(t, n = Xe, r = Ze, i) {
+		return new e("length" in t ? tt(t, n, r, i) : Float64Array.from(nt(t, n, r, i)));
+	}
+	constructor(e) {
+		this._delaunator = new Pe(e), this.inedges = new Int32Array(e.length / 2), this._hullIndex = new Int32Array(e.length / 2), this.points = this._delaunator.coords, this._init();
+	}
+	update() {
+		return this._delaunator.update(), this._init(), this;
+	}
+	_init() {
+		let e = this._delaunator, t = this.points;
+		if (e.hull && e.hull.length > 2 && Qe(e)) {
+			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],
+				t[2 * e + 1],
+				t[2 * n],
+				t[2 * n + 1]
+			], i = 1e-8 * Math.hypot(r[3] - r[1], r[2] - r[0]);
+			for (let e = 0, n = t.length / 2; e < n; ++e) {
+				let n = $e(t[2 * e], t[2 * e + 1], i);
+				t[2 * e] = n[0], t[2 * e + 1] = n[1];
+			}
+			this._delaunator = new Pe(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) {
+			let t = i[e % 3 == 2 ? e - 2 : e + 1];
+			(n[e] === -1 || a[t] === -1) && (a[t] = e);
+		}
+		for (let e = 0, t = r.length; e < t; ++e) o[r[e]] = e;
+		r.length <= 2 && r.length > 0 && (this.triangles = new Int32Array(3).fill(-1), this.halfedges = new Int32Array(3).fill(-1), this.triangles[0] = r[0], a[r[0]] = 1, r.length === 2 && (a[r[1]] = 0, this.triangles[1] = r[1], this.triangles[2] = r[1]));
+	}
+	voronoi(e) {
+		return new qe(this, e);
+	}
+	*neighbors(e) {
+		let { inedges: t, hull: n, _hullIndex: r, halfedges: i, triangles: a, collinear: o } = this;
+		if (o) {
+			let t = o.indexOf(e);
+			t > 0 && (yield o[t - 1]), t < o.length - 1 && (yield o[t + 1]);
+			return;
+		}
+		let s = t[e];
+		if (s === -1) return;
+		let c = s, l = -1;
+		do {
+			if (yield l = a[c], c = c % 3 == 2 ? c - 2 : c + 1, a[c] !== e) return;
+			if (c = i[c], c === -1) {
+				let t = n[(r[e] + 1) % n.length];
+				t !== l && (yield t);
+				return;
+			}
+		} while (c !== s);
+	}
+	find(e, t, n = 0) {
+		if ((e = +e, e !== e) || (t = +t, t !== t)) return -1;
+		let r = n, i;
+		for (; (i = this._step(n, e, t)) >= 0 && i !== n && i !== r;) n = i;
+		return i;
+	}
+	_step(e, t, n) {
+		let { inedges: r, hull: i, _hullIndex: a, halfedges: o, triangles: s, points: c } = this;
+		if (r[e] === -1 || !c.length) return (e + 1) % (c.length >> 1);
+		let l = e, u = Ye(t - c[e * 2], 2) + Ye(n - c[e * 2 + 1], 2), d = r[e], f = d;
+		do {
+			let r = s[f], d = Ye(t - c[r * 2], 2) + Ye(n - c[r * 2 + 1], 2);
+			if (d < u && (u = d, l = r), f = f % 3 == 2 ? f - 2 : f + 1, s[f] !== e) break;
+			if (f = o[f], f === -1) {
+				if (f = i[(a[e] + 1) % i.length], f !== r && Ye(t - c[f * 2], 2) + Ye(n - c[f * 2 + 1], 2) < u) return f;
+				break;
+			}
+		} while (f !== d);
+		return l;
+	}
+	render(e) {
+		let t = e == null ? e = new Ge() : 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;
+			let o = i[t] * 2, s = i[a] * 2;
+			e.moveTo(n[o], n[o + 1]), e.lineTo(n[s], n[s + 1]);
+		}
+		return this.renderHull(e), t && t.value();
+	}
+	renderPoints(e, t) {
+		t === void 0 && (!e || typeof e.moveTo != "function") && (t = e, e = null), t = t == null ? 2 : +t;
+		let n = e == null ? e = new Ge() : void 0, { points: r } = this;
+		for (let n = 0, i = r.length; n < i; n += 2) {
+			let i = r[n], a = r[n + 1];
+			e.moveTo(i + t, a), e.arc(i, a, t, 0, Je);
+		}
+		return n && n.value();
+	}
+	renderHull(e) {
+		let t = e == null ? e = new Ge() : void 0, { hull: n, points: r } = this, i = n[0] * 2, a = n.length;
+		e.moveTo(r[i], r[i + 1]);
+		for (let t = 1; t < a; ++t) {
+			let i = 2 * n[t];
+			e.lineTo(r[i], r[i + 1]);
+		}
+		return e.closePath(), t && t.value();
+	}
+	hullPolygon() {
+		let e = new Ke();
+		return this.renderHull(e), e.value();
+	}
+	renderTriangle(e, t) {
+		let n = t == null ? t = new Ge() : void 0, { points: r, triangles: i } = this, a = i[e *= 3] * 2, o = i[e + 1] * 2, s = i[e + 2] * 2;
+		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() {
+		let { triangles: e } = this;
+		for (let t = 0, n = e.length / 3; t < n; ++t) yield this.trianglePolygon(t);
+	}
+	trianglePolygon(e) {
+		let t = new Ke();
+		return this.renderTriangle(e, t), t.value();
+	}
+};
+function tt(e, t, n, r) {
+	let i = e.length, a = new Float64Array(i * 2);
+	for (let o = 0; o < i; ++o) {
+		let i = e[o];
+		a[o * 2] = t.call(r, i, o, e), a[o * 2 + 1] = n.call(r, i, o, e);
+	}
+	return a;
+}
+function* nt(e, t, n, r) {
+	let i = 0;
+	for (let a of e) yield t.call(r, a, i, e), yield n.call(r, a, i, e), ++i;
+}
+//#endregion
+//#region src/utils/clusert.mjs
+function rt(e, t, n, r) {
+	return 1 + (e[t][0] === 0 || e[n][0] === 0 || e[r][0] === 0 ? 1 : 0);
+}
+function it(e, t, n, r, i, a) {
+	let o = Math.hypot(n - i, r - a), s = Math.hypot(e - i, t - a), c = Math.hypot(e - n, t - r), l = Math.abs((n - e) * (a - t) - (i - e) * (r - t)) / 2;
+	return l === 0 ? Infinity : o * s * c / (4 * l);
+}
+function at(e) {
+	if (!e || e.length < 3) return [];
+	let t = /* @__PURE__ */ new Set(), n = [];
+	for (let r of e) {
+		let e = `${r[0]}_${r[1]}`;
+		t.has(e) || (t.add(e), n.push(r));
+	}
+	if (n.length < 3) return [];
+	let { triangles: r } = new et(Float64Array.from(n.flat()));
+	if (!r.length) return [];
+	let i = /* @__PURE__ */ new Map(), a = (e, t) => e < t ? `${e}_${t}` : `${t}_${e}`;
+	for (let e = 0; e < r.length; e += 3) {
+		let t = r[e], o = r[e + 1], s = r[e + 2], [c, l] = n[t], [u, d] = n[o], [f, p] = n[s];
+		if (it(c, l, u, d, f, p) <= 1 / rt(n, t, o, s)) for (let [e, n] of [
+			[t, o],
+			[o, s],
+			[s, t]
+		]) {
+			let t = a(e, n);
+			i.set(t, (i.get(t) || 0) + 1);
+		}
+	}
+	let o = [];
+	for (let [e, t] of i) t === 1 && o.push(e.split("_").map(Number));
+	if (!o.length) return [];
+	let s = /* @__PURE__ */ new Map();
+	for (let [e, t] of o) (s.get(e) || s.set(e, []).get(e)).push(t), (s.get(t) || s.set(t, []).get(t)).push(e);
+	let c = o[0][0], l = [], u = /* @__PURE__ */ new Set(), d = c, f = -1;
+	do {
+		l.push(n[d]), u.add(d);
+		let e = s.get(d) || [], t = e.find((e) => e !== f && !u.has(e));
+		if (t === void 0 && (t = e.find((e) => e !== f)), t === void 0) break;
+		f = d, d = t;
+	} while (d !== c && l.length <= o.length + 1);
+	return l;
+}
+//#endregion
+//#region node_modules/three/examples/jsm/math/OBB.js
+var K = {
+	c: null,
+	u: [
+		new d(),
+		new d(),
+		new d()
+	],
+	e: []
+}, q = {
+	c: null,
+	u: [
+		new d(),
+		new d(),
+		new d()
+	],
+	e: []
+}, J = [
+	[],
+	[],
+	[]
+], Y = [
+	[],
+	[],
+	[]
+], X = [], ot = new d(), st = new d(), ct = new d(), Z = new d(), lt = new d(), ut = new d(), Q = new a(), dt = new t(), ft = new o(), pt = new o(), mt = new l(), ht = class {
+	constructor(e = new d(), t = new d(), n = new a()) {
+		this.center = e, this.halfSize = t, this.rotation = n;
+	}
+	set(e, t, n) {
+		return this.center = e, this.halfSize = t, this.rotation = n, this;
+	}
+	copy(e) {
+		return this.center.copy(e.center), this.halfSize.copy(e.halfSize), this.rotation.copy(e.rotation), this;
+	}
+	clone() {
+		return new this.constructor().copy(this);
+	}
+	getSize(e) {
+		return e.copy(this.halfSize).multiplyScalar(2);
+	}
+	clampPoint(e, t) {
+		let n = this.halfSize;
+		Z.subVectors(e, this.center), this.rotation.extractBasis(ot, st, ct), t.copy(this.center);
+		let r = i.clamp(Z.dot(ot), -n.x, n.x);
+		t.add(ot.multiplyScalar(r));
+		let a = i.clamp(Z.dot(st), -n.y, n.y);
+		t.add(st.multiplyScalar(a));
+		let o = i.clamp(Z.dot(ct), -n.z, n.z);
+		return t.add(ct.multiplyScalar(o)), t;
+	}
+	containsPoint(e) {
+		return Z.subVectors(e, this.center), this.rotation.extractBasis(ot, st, ct), Math.abs(Z.dot(ot)) <= this.halfSize.x && Math.abs(Z.dot(st)) <= this.halfSize.y && Math.abs(Z.dot(ct)) <= this.halfSize.z;
+	}
+	intersectsBox3(e) {
+		return this.intersectsOBB(gt.fromBox3(e));
+	}
+	intersectsSphere(e) {
+		return this.clampPoint(e.center, ut), ut.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;
+		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));
+	}
+	intersectsPlane(e) {
+		this.rotation.extractBasis(ot, st, ct);
+		let t = this.halfSize.x * Math.abs(e.normal.dot(ot)) + this.halfSize.y * Math.abs(e.normal.dot(st)) + this.halfSize.z * Math.abs(e.normal.dot(ct)), n = e.normal.dot(this.center) - e.constant;
+		return Math.abs(n) <= t;
+	}
+	intersectRay(e, t) {
+		return this.getSize(lt), dt.setFromCenterAndSize(Z.set(0, 0, 0), lt), ft.setFromMatrix3(this.rotation), ft.setPosition(this.center), pt.copy(ft).invert(), mt.copy(e).applyMatrix4(pt), mt.intersectBox(dt, t) ? t.applyMatrix4(ft) : null;
+	}
+	intersectsRay(e) {
+		return this.intersectRay(e, Z) !== null;
+	}
+	fromBox3(e) {
+		return e.getCenter(this.center), e.getSize(this.halfSize).multiplyScalar(.5), this.rotation.identity(), this;
+	}
+	equals(e) {
+		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 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;
+	}
+}, gt = new ht(), $ = 6371008.8, _t = {
+	centimeters: $ * 100,
+	centimetres: $ * 100,
+	degrees: 360 / (2 * Math.PI),
+	feet: $ * 3.28084,
+	inches: $ * 39.37,
+	kilometers: $ / 1e3,
+	kilometres: $ / 1e3,
+	meters: $,
+	metres: $,
+	miles: $ / 1609.344,
+	millimeters: $ * 1e3,
+	millimetres: $ * 1e3,
+	nauticalmiles: $ / 1852,
+	radians: 1,
+	yards: $ * 1.0936
+};
+function vt(e, t, n = {}) {
+	let r = { type: "Feature" };
+	return (n.id === 0 || n.id) && (r.id = n.id), n.bbox && (r.bbox = n.bbox), r.properties = t || {}, r.geometry = e, r;
+}
+function yt(e, t, n = {}) {
+	if (!e) throw Error("coordinates is required");
+	if (!Array.isArray(e)) throw Error("coordinates must be an Array");
+	if (e.length < 2) throw Error("coordinates must be at least 2 numbers long");
+	if (!Et(e[0]) || !Et(e[1])) throw Error("coordinates must contain numbers");
+	return vt({
+		type: "Point",
+		coordinates: e
+	}, t, n);
+}
+function bt(e, t, n = {}) {
+	for (let t of e) {
+		if (t.length < 4) throw Error("Each LinearRing of a Polygon must have 4 or more Positions.");
+		if (t[t.length - 1].length !== t[0].length) throw Error("First and last Position are not equivalent.");
+		for (let e = 0; e < t[t.length - 1].length; e++) if (t[t.length - 1][e] !== t[0][e]) throw Error("First and last Position are not equivalent.");
+	}
+	return vt({
+		type: "Polygon",
+		coordinates: e
+	}, t, n);
+}
+function xt(e, t = "kilometers") {
+	let n = _t[t];
+	if (!n) throw Error(t + " units is invalid");
+	return e * n;
+}
+function St(e, t = "kilometers") {
+	let n = _t[t];
+	if (!n) throw Error(t + " units is invalid");
+	return e / n;
+}
+function Ct(e) {
+	return e % (2 * Math.PI) * 180 / Math.PI;
+}
+function wt(e) {
+	return e % 360 * Math.PI / 180;
+}
+function Tt(e, t = "kilometers", n = "kilometers") {
+	if (!(e >= 0)) throw Error("length must be a positive number");
+	return xt(St(e, t), n);
+}
+function Et(e) {
+	return !isNaN(e) && e !== null && !Array.isArray(e);
+}
+function Dt(e) {
+	return typeof e == "object" && !!e && !Array.isArray(e);
+}
+//#endregion
+//#region node_modules/@turf/meta/dist/esm/index.js
+function Ot(e, t, n) {
+	if (e !== null) for (var r, i, a, o, s, c, l, u = 0, d = 0, f, p = e.type, m = p === "FeatureCollection", h = p === "Feature", g = m ? e.features.length : 1, _ = 0; _ < g; _++) {
+		l = m ? e.features[_].geometry : h ? e.geometry : e, f = l ? l.type === "GeometryCollection" : !1, s = f ? l.geometries.length : 1;
+		for (var v = 0; v < s; v++) {
+			var y = 0, b = 0;
+			if (o = f ? l.geometries[v] : l, o !== null) {
+				c = o.coordinates;
+				var x = o.type;
+				switch (u = n && (x === "Polygon" || x === "MultiPolygon") ? 1 : 0, x) {
+					case null: break;
+					case "Point":
+						if (t(c, d, _, y, b) === !1) return !1;
+						d++, y++;
+						break;
+					case "LineString":
+					case "MultiPoint":
+						for (r = 0; r < c.length; r++) {
+							if (t(c[r], d, _, y, b) === !1) return !1;
+							d++, x === "MultiPoint" && y++;
+						}
+						x === "LineString" && y++;
+						break;
+					case "Polygon":
+					case "MultiLineString":
+						for (r = 0; r < c.length; r++) {
+							for (i = 0; i < c[r].length - u; i++) {
+								if (t(c[r][i], d, _, y, b) === !1) return !1;
+								d++;
+							}
+							x === "MultiLineString" && y++, x === "Polygon" && b++;
+						}
+						x === "Polygon" && y++;
+						break;
+					case "MultiPolygon":
+						for (r = 0; r < c.length; r++) {
+							for (b = 0, i = 0; i < c[r].length; i++) {
+								for (a = 0; a < c[r][i].length - u; a++) {
+									if (t(c[r][i][a], d, _, y, b) === !1) return !1;
+									d++;
+								}
+								b++;
+							}
+							y++;
+						}
+						break;
+					case "GeometryCollection":
+						for (r = 0; r < o.geometries.length; r++) if (Ot(o.geometries[r], t, n) === !1) return !1;
+						break;
+					default: throw Error("Unknown Geometry Type");
+				}
+			}
+		}
+	}
+}
+function kt(e) {
+	var t = [];
+	return Ot(e, function(e) {
+		t.push(e);
+	}), t;
+}
+function At(e, t) {
+	var n, r, i, a, o, s, c, l, u, d, f = 0, p = e.type === "FeatureCollection", m = e.type === "Feature", h = p ? e.features.length : 1;
+	for (n = 0; n < h; n++) {
+		for (s = p ? e.features[n].geometry : m ? e.geometry : e, l = p ? e.features[n].properties : m ? e.properties : {}, u = p ? e.features[n].bbox : m ? e.bbox : void 0, d = p ? e.features[n].id : m ? e.id : void 0, c = s ? s.type === "GeometryCollection" : !1, o = c ? s.geometries.length : 1, i = 0; i < o; i++) {
+			if (a = c ? s.geometries[i] : s, a === null) {
+				if (t(null, f, l, u, d) === !1) return !1;
+				continue;
+			}
+			switch (a.type) {
+				case "Point":
+				case "LineString":
+				case "MultiPoint":
+				case "Polygon":
+				case "MultiLineString":
+				case "MultiPolygon":
+					if (t(a, f, l, u, d) === !1) return !1;
+					break;
+				case "GeometryCollection":
+					for (r = 0; r < a.geometries.length; r++) if (t(a.geometries[r], f, l, u, d) === !1) return !1;
+					break;
+				default: throw Error("Unknown Geometry Type");
+			}
+		}
+		f++;
+	}
+}
+function jt(e, t, n) {
+	var r = n;
+	return At(e, function(e, i, a, o, s) {
+		r = i === 0 && n === void 0 ? e : t(r, e, i, a, o, s);
+	}), r;
+}
+//#endregion
+//#region node_modules/rbush/rbush.min.js
+var Mt = /* @__PURE__ */ y(((e, t) => {
+	(function(n, r) {
+		typeof e == "object" && t !== void 0 ? t.exports = r() : typeof define == "function" && define.amd ? define(r) : (n ||= self).RBush = r();
+	})(e, function() {
+		function e(e, r, i, a, o) {
+			(function e(n, r, i, a, o) {
+				for (; a > i;) {
+					if (a - i > 600) {
+						var s = a - i + 1, c = r - i + 1, l = Math.log(s), u = .5 * Math.exp(2 * l / 3), d = .5 * Math.sqrt(l * u * (s - u) / s) * (c - s / 2 < 0 ? -1 : 1);
+						e(n, r, Math.max(i, Math.floor(r - c * u / s + d)), Math.min(a, Math.floor(r + (s - c) * u / s + d)), o);
+					}
+					var f = n[r], p = i, m = a;
+					for (t(n, i, r), o(n[a], f) > 0 && t(n, i, a); p < m;) {
+						for (t(n, p, m), p++, m--; o(n[p], f) < 0;) p++;
+						for (; o(n[m], f) > 0;) m--;
+					}
+					o(n[i], f) === 0 ? t(n, i, m) : t(n, ++m, a), m <= r && (i = m + 1), r <= m && (a = m - 1);
+				}
+			})(e, r, i || 0, a || e.length - 1, o || n);
+		}
+		function t(e, t, n) {
+			var r = e[t];
+			e[t] = e[n], e[n] = r;
+		}
+		function n(e, t) {
+			return e < t ? -1 : e > t ? 1 : 0;
+		}
+		var r = function(e) {
+			e === void 0 && (e = 9), this._maxEntries = Math.max(4, e), this._minEntries = Math.max(2, Math.ceil(.4 * this._maxEntries)), this.clear();
+		};
+		function i(e, t, n) {
+			if (!n) return t.indexOf(e);
+			for (var r = 0; r < t.length; r++) if (n(e, t[r])) return r;
+			return -1;
+		}
+		function a(e, t) {
+			o(e, 0, e.children.length, t, e);
+		}
+		function o(e, t, n, r, i) {
+			i ||= m(null), i.minX = Infinity, i.minY = Infinity, i.maxX = -Infinity, i.maxY = -Infinity;
+			for (var a = t; a < n; a++) {
+				var o = e.children[a];
+				s(i, e.leaf ? r(o) : o);
+			}
+			return i;
+		}
+		function s(e, t) {
+			return e.minX = Math.min(e.minX, t.minX), e.minY = Math.min(e.minY, t.minY), e.maxX = Math.max(e.maxX, t.maxX), e.maxY = Math.max(e.maxY, t.maxY), e;
+		}
+		function c(e, t) {
+			return e.minX - t.minX;
+		}
+		function l(e, t) {
+			return e.minY - t.minY;
+		}
+		function u(e) {
+			return (e.maxX - e.minX) * (e.maxY - e.minY);
+		}
+		function d(e) {
+			return e.maxX - e.minX + (e.maxY - e.minY);
+		}
+		function f(e, t) {
+			return e.minX <= t.minX && e.minY <= t.minY && t.maxX <= e.maxX && t.maxY <= e.maxY;
+		}
+		function p(e, t) {
+			return t.minX <= e.maxX && t.minY <= e.maxY && t.maxX >= e.minX && t.maxY >= e.minY;
+		}
+		function m(e) {
+			return {
+				children: e,
+				height: 1,
+				leaf: !0,
+				minX: Infinity,
+				minY: Infinity,
+				maxX: -Infinity,
+				maxY: -Infinity
+			};
+		}
+		function h(t, n, r, i, a) {
+			for (var o = [n, r]; o.length;) if (!((r = o.pop()) - (n = o.pop()) <= i)) {
+				var s = n + Math.ceil((r - n) / i / 2) * i;
+				e(t, s, n, r, a), o.push(n, s, s, r);
+			}
+		}
+		return r.prototype.all = function() {
+			return this._all(this.data, []);
+		}, r.prototype.search = function(e) {
+			var t = this.data, n = [];
+			if (!p(e, t)) return n;
+			for (var r = this.toBBox, i = []; t;) {
+				for (var a = 0; a < t.children.length; a++) {
+					var o = t.children[a], s = t.leaf ? r(o) : o;
+					p(e, s) && (t.leaf ? n.push(o) : f(e, s) ? this._all(o, n) : i.push(o));
+				}
+				t = i.pop();
+			}
+			return n;
+		}, r.prototype.collides = function(e) {
+			var t = this.data;
+			if (!p(e, t)) return !1;
+			for (var n = []; t;) {
+				for (var r = 0; r < t.children.length; r++) {
+					var i = t.children[r], a = t.leaf ? this.toBBox(i) : i;
+					if (p(e, a)) {
+						if (t.leaf || f(e, a)) return !0;
+						n.push(i);
+					}
+				}
+				t = n.pop();
+			}
+			return !1;
+		}, r.prototype.load = function(e) {
+			if (!e || !e.length) return this;
+			if (e.length < this._minEntries) {
+				for (var t = 0; t < e.length; t++) this.insert(e[t]);
+				return this;
+			}
+			var n = this._build(e.slice(), 0, e.length - 1, 0);
+			if (this.data.children.length) if (this.data.height === n.height) this._splitRoot(this.data, n);
+			else {
+				if (this.data.height < n.height) {
+					var r = this.data;
+					this.data = n, n = r;
+				}
+				this._insert(n, this.data.height - n.height - 1, !0);
+			}
+			else this.data = n;
+			return this;
+		}, r.prototype.insert = function(e) {
+			return e && this._insert(e, this.data.height - 1), this;
+		}, r.prototype.clear = function() {
+			return this.data = m([]), this;
+		}, r.prototype.remove = function(e, t) {
+			if (!e) return this;
+			for (var n, r, a, o = this.data, s = this.toBBox(e), c = [], l = []; o || c.length;) {
+				if (o || (o = c.pop(), r = c[c.length - 1], n = l.pop(), a = !0), o.leaf) {
+					var u = i(e, o.children, t);
+					if (u !== -1) return o.children.splice(u, 1), c.push(o), this._condense(c), this;
+				}
+				a || o.leaf || !f(o, s) ? r ? (n++, o = r.children[n], a = !1) : o = null : (c.push(o), l.push(n), n = 0, r = o, o = o.children[0]);
+			}
+			return this;
+		}, r.prototype.toBBox = function(e) {
+			return e;
+		}, r.prototype.compareMinX = function(e, t) {
+			return e.minX - t.minX;
+		}, r.prototype.compareMinY = function(e, t) {
+			return e.minY - t.minY;
+		}, r.prototype.toJSON = function() {
+			return this.data;
+		}, r.prototype.fromJSON = function(e) {
+			return this.data = e, this;
+		}, r.prototype._all = function(e, t) {
+			for (var n = []; e;) e.leaf ? t.push.apply(t, e.children) : n.push.apply(n, e.children), e = n.pop();
+			return t;
+		}, r.prototype._build = function(e, t, n, r) {
+			var i, o = n - t + 1, s = this._maxEntries;
+			if (o <= s) return a(i = m(e.slice(t, n + 1)), this.toBBox), i;
+			r || (r = Math.ceil(Math.log(o) / Math.log(s)), s = Math.ceil(o / s ** (r - 1))), (i = m([])).leaf = !1, i.height = r;
+			var c = Math.ceil(o / s), l = c * Math.ceil(Math.sqrt(s));
+			h(e, t, n, l, this.compareMinX);
+			for (var u = t; u <= n; u += l) {
+				var d = Math.min(u + l - 1, n);
+				h(e, u, d, c, this.compareMinY);
+				for (var f = u; f <= d; f += c) {
+					var p = Math.min(f + c - 1, d);
+					i.children.push(this._build(e, f, p, r - 1));
+				}
+			}
+			return a(i, this.toBBox), i;
+		}, r.prototype._chooseSubtree = function(e, t, n, r) {
+			for (; r.push(t), !t.leaf && r.length - 1 !== n;) {
+				for (var i = Infinity, a = Infinity, o = void 0, s = 0; s < t.children.length; s++) {
+					var c = t.children[s], l = u(c), d = (f = e, p = c, (Math.max(p.maxX, f.maxX) - Math.min(p.minX, f.minX)) * (Math.max(p.maxY, f.maxY) - Math.min(p.minY, f.minY)) - l);
+					d < a ? (a = d, i = l < i ? l : i, o = c) : d === a && l < i && (i = l, o = c);
+				}
+				t = o || t.children[0];
+			}
+			var f, p;
+			return t;
+		}, r.prototype._insert = function(e, t, n) {
+			var r = n ? e : this.toBBox(e), i = [], a = this._chooseSubtree(r, this.data, t, i);
+			for (a.children.push(e), s(a, r); t >= 0 && i[t].children.length > this._maxEntries;) this._split(i, t), t--;
+			this._adjustParentBBoxes(r, i, t);
+		}, r.prototype._split = function(e, t) {
+			var n = e[t], r = n.children.length, i = this._minEntries;
+			this._chooseSplitAxis(n, i, r);
+			var o = this._chooseSplitIndex(n, i, r), s = m(n.children.splice(o, n.children.length - o));
+			s.height = n.height, s.leaf = n.leaf, a(n, this.toBBox), a(s, this.toBBox), t ? e[t - 1].children.push(s) : this._splitRoot(n, s);
+		}, r.prototype._splitRoot = function(e, t) {
+			this.data = m([e, t]), this.data.height = e.height + 1, this.data.leaf = !1, a(this.data, this.toBBox);
+		}, r.prototype._chooseSplitIndex = function(e, t, n) {
+			for (var r, i, a, s, c, l, d, f = Infinity, p = Infinity, m = t; m <= n - t; m++) {
+				var h = o(e, 0, m, this.toBBox), g = o(e, m, n, this.toBBox), _ = (i = h, a = g, s = void 0, c = void 0, l = void 0, d = void 0, s = Math.max(i.minX, a.minX), c = Math.max(i.minY, a.minY), l = Math.min(i.maxX, a.maxX), d = Math.min(i.maxY, a.maxY), Math.max(0, l - s) * Math.max(0, d - c)), v = u(h) + u(g);
+				_ < f ? (f = _, r = m, p = v < p ? v : p) : _ === f && v < p && (p = v, r = m);
+			}
+			return r || n - t;
+		}, r.prototype._chooseSplitAxis = function(e, t, n) {
+			var r = e.leaf ? this.compareMinX : c, i = e.leaf ? this.compareMinY : l;
+			this._allDistMargin(e, t, n, r) < this._allDistMargin(e, t, n, i) && e.children.sort(r);
+		}, r.prototype._allDistMargin = function(e, t, n, r) {
+			e.children.sort(r);
+			for (var i = this.toBBox, a = o(e, 0, t, i), c = o(e, n - t, n, i), l = d(a) + d(c), u = t; u < n - t; u++) {
+				var f = e.children[u];
+				s(a, e.leaf ? i(f) : f), l += d(a);
+			}
+			for (var p = n - t - 1; p >= t; p--) {
+				var m = e.children[p];
+				s(c, e.leaf ? i(m) : m), l += d(c);
+			}
+			return l;
+		}, r.prototype._adjustParentBBoxes = function(e, t, n) {
+			for (var r = n; r >= 0; r--) s(t[r], e);
+		}, r.prototype._condense = function(e) {
+			for (var t = e.length - 1, n = void 0; t >= 0; t--) e[t].children.length === 0 ? t > 0 ? (n = e[t - 1].children).splice(n.indexOf(e[t]), 1) : this.clear() : a(e[t], this.toBBox);
+		}, r;
+	});
+})), Nt = /* @__PURE__ */ b({ default: () => Ft });
+function Pt(e, t) {
+	return e < t ? -1 : e > t ? 1 : 0;
+}
+var Ft, It = v((() => {
+	Ft = class {
+		constructor(e = [], t = Pt) {
+			if (this.data = e, this.length = this.data.length, this.compare = t, this.length > 0) for (let e = (this.length >> 1) - 1; e >= 0; e--) this._down(e);
+		}
+		push(e) {
+			this.data.push(e), this.length++, this._up(this.length - 1);
+		}
+		pop() {
+			if (this.length === 0) return;
+			let e = this.data[0], t = this.data.pop();
+			return this.length--, this.length > 0 && (this.data[0] = t, this._down(0)), e;
+		}
+		peek() {
+			return this.data[0];
+		}
+		_up(e) {
+			let { data: t, compare: n } = this, r = t[e];
+			for (; e > 0;) {
+				let i = e - 1 >> 1, a = t[i];
+				if (n(r, a) >= 0) break;
+				t[e] = a, e = i;
+			}
+			t[e] = r;
+		}
+		_down(e) {
+			let { data: t, compare: n } = this, r = this.length >> 1, i = t[e];
+			for (; e < r;) {
+				let r = (e << 1) + 1, a = t[r], o = r + 1;
+				if (o < this.length && n(t[o], a) < 0 && (r = o, a = t[o]), n(a, i) >= 0) break;
+				t[e] = a, e = r;
+			}
+			t[e] = i;
+		}
+	};
+})), Lt = /* @__PURE__ */ y(((e, t) => {
+	t.exports = function(e, t, n, r) {
+		var i = e[0], a = e[1], o = !1;
+		n === void 0 && (n = 0), r === void 0 && (r = t.length);
+		for (var s = (r - n) / 2, c = 0, l = s - 1; c < s; l = c++) {
+			var u = t[n + c * 2 + 0], d = t[n + c * 2 + 1], f = t[n + l * 2 + 0], p = t[n + l * 2 + 1];
+			d > a != p > a && i < (f - u) * (a - d) / (p - d) + u && (o = !o);
+		}
+		return o;
+	};
+})), Rt = /* @__PURE__ */ y(((e, t) => {
+	t.exports = function(e, t, n, r) {
+		var i = e[0], a = e[1], o = !1;
+		n === void 0 && (n = 0), r === void 0 && (r = t.length);
+		for (var s = r - n, c = 0, l = s - 1; c < s; l = c++) {
+			var u = t[c + n][0], d = t[c + n][1], f = t[l + n][0], p = t[l + n][1];
+			d > a != p > a && i < (f - u) * (a - d) / (p - d) + u && (o = !o);
+		}
+		return o;
+	};
+})), zt = /* @__PURE__ */ y(((e, t) => {
+	var n = Lt(), r = Rt();
+	t.exports = function(e, t, i, a) {
+		return t.length > 0 && Array.isArray(t[0]) ? r(e, t, i, a) : n(e, t, i, a);
+	}, t.exports.nested = r, t.exports.flat = n;
+})), Bt = /* @__PURE__ */ y(((e, t) => {
+	(function(n, r) {
+		typeof e == "object" && t !== void 0 ? r(e) : typeof define == "function" && define.amd ? define(["exports"], r) : r((n ||= self).predicates = {});
+	})(e, function(e) {
+		let t = 134217729;
+		function n(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;
+			if (d < e && f < n) for (u > l == u > -l ? (s = a - ((o = l + a) - l), l = t[++d]) : (s = a - ((o = u + a) - u), u = r[++f]), a = o, s !== 0 && (i[p++] = s); d < e && f < n;) u > l == u > -l ? (s = a - ((o = a + l) - (c = o - a)) + (l - c), l = t[++d]) : (s = a - ((o = a + u) - (c = o - a)) + (u - c), u = r[++f]), a = o, s !== 0 && (i[p++] = s);
+			for (; d < e;) s = a - ((o = a + l) - (c = o - a)) + (l - c), l = t[++d], a = o, s !== 0 && (i[p++] = s);
+			for (; f < n;) s = a - ((o = a + u) - (c = o - a)) + (u - c), u = r[++f], a = o, s !== 0 && (i[p++] = s);
+			return a === 0 && p !== 0 || (i[p++] = a), p;
+		}
+		function r(e) {
+			return new Float64Array(e);
+		}
+		let i = r(4), a = r(8), o = r(12), s = r(16), c = r(4);
+		e.orient2d = function(e, r, l, u, d, f) {
+			let p = (r - f) * (l - d), m = (e - d) * (u - f), h = p - m;
+			if (p === 0 || m === 0 || p > 0 != m > 0) return h;
+			let g = Math.abs(p + m);
+			return Math.abs(h) >= 33306690738754716e-32 * g ? h : -function(e, r, l, u, d, f, p) {
+				let m, h, g, _, v, y, b, x, S, C, w, T, E, D, O, k, A, j, M = e - d, N = l - d, P = r - f, F = u - f;
+				v = (O = (x = M - (b = (y = t * M) - (y - M))) * (C = F - (S = (y = t * F) - (y - F))) - ((D = M * F) - b * S - x * S - b * C)) - (w = O - (A = (x = P - (b = (y = t * P) - (y - P))) * (C = N - (S = (y = t * N) - (y - N))) - ((k = P * N) - b * S - x * S - b * C))), i[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), i[1] = E - (w + v) + (v - k), v = (j = T + w) - T, i[2] = T - (j - v) + (w - v), i[3] = j;
+				let I = function(e, t) {
+					let n = t[0];
+					for (let r = 1; r < e; r++) n += t[r];
+					return n;
+				}(4, i), L = 22204460492503146e-32 * p;
+				if (I >= L || -I >= L || (m = e - (M + (v = e - M)) + (v - d), g = l - (N + (v = l - N)) + (v - d), h = r - (P + (v = r - P)) + (v - f), _ = u - (F + (v = u - F)) + (v - f), m === 0 && h === 0 && g === 0 && _ === 0) || (L = 11093356479670487e-47 * p + 33306690738754706e-32 * Math.abs(I), (I += M * _ + F * m - (P * g + N * h)) >= L || -I >= L)) return I;
+				v = (O = (x = m - (b = (y = t * m) - (y - m))) * (C = F - (S = (y = t * F) - (y - F))) - ((D = m * F) - b * S - x * S - b * C)) - (w = O - (A = (x = h - (b = (y = t * h) - (y - h))) * (C = N - (S = (y = t * N) - (y - N))) - ((k = h * N) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j;
+				let R = n(4, i, 4, c, a);
+				v = (O = (x = M - (b = (y = t * M) - (y - M))) * (C = _ - (S = (y = t * _) - (y - _))) - ((D = M * _) - b * S - x * S - b * C)) - (w = O - (A = (x = P - (b = (y = t * P) - (y - P))) * (C = g - (S = (y = t * g) - (y - g))) - ((k = P * g) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j;
+				let ee = n(R, a, 4, c, o);
+				return v = (O = (x = m - (b = (y = t * m) - (y - m))) * (C = _ - (S = (y = t * _) - (y - _))) - ((D = m * _) - b * S - x * S - b * C)) - (w = O - (A = (x = h - (b = (y = t * h) - (y - h))) * (C = g - (S = (y = t * g) - (y - g))) - ((k = h * g) - b * S - x * S - b * C))), c[0] = O - (w + v) + (v - A), v = (E = D - ((T = D + w) - (v = T - D)) + (w - v)) - (w = E - k), c[1] = E - (w + v) + (v - k), v = (j = T + w) - T, c[2] = T - (j - v) + (w - v), c[3] = j, s[n(ee, o, 4, c, s) - 1];
+			}(e, r, l, u, d, f, g);
+		}, e.orient2dfast = function(e, t, n, r, i, a) {
+			return (t - a) * (n - i) - (e - i) * (r - a);
+		}, Object.defineProperty(e, "__esModule", { value: !0 });
+	});
+})), Vt = /* @__PURE__ */ S((/* @__PURE__ */ y(((e, t) => {
+	var n = Mt(), r = (It(), C(Nt)), i = zt(), a = Bt().orient2d;
+	r.default && (r = r.default), t.exports = o, t.exports.default = o;
+	function o(e, t, r) {
+		t = Math.max(0, t === void 0 ? 2 : t), r ||= 0;
+		var i = h(e), a = new n(16);
+		a.toBBox = function(e) {
+			return {
+				minX: e[0],
+				minY: e[1],
+				maxX: e[0],
+				maxY: e[1]
+			};
+		}, a.compareMinX = function(e, t) {
+			return e[0] - t[0];
+		}, a.compareMinY = function(e, t) {
+			return e[1] - t[1];
+		}, a.load(e);
+		for (var o = [], c = 0, l; c < i.length; c++) {
+			var u = i[c];
+			a.remove(u), l = g(u, l), o.push(l);
+		}
+		var d = new n(16);
+		for (c = 0; c < o.length; c++) d.insert(m(o[c]));
+		for (var f = t * t, p = r * r; o.length;) {
+			var v = o.shift(), y = v.p, b = v.next.p, x = _(y, b);
+			if (!(x < p)) {
+				var S = x / f;
+				u = s(a, v.prev.p, y, b, v.next.next.p, S, d), u && Math.min(_(u, y), _(u, b)) <= S && (o.push(v), o.push(g(u, v)), a.remove(u), d.remove(v), d.insert(m(v)), d.insert(m(v.next)));
+			}
+		}
+		v = l;
+		var C = [];
+		do
+			C.push(v.p), v = v.next;
+		while (v !== l);
+		return C.push(v.p), C;
+	}
+	function s(e, t, n, i, a, o, s) {
+		for (var u = new r([], c), f = e.data; f;) {
+			for (var p = 0; p < f.children.length; p++) {
+				var m = f.children[p], h = f.leaf ? v(m, n, i) : l(n, i, m);
+				h > o || u.push({
+					node: m,
+					dist: h
+				});
+			}
+			for (; u.length && !u.peek().node.children;) {
+				var g = u.pop(), _ = g.node, y = v(_, t, n), b = v(_, i, a);
+				if (g.dist < y && g.dist < b && d(n, _, s) && d(i, _, s)) return _;
+			}
+			f = u.pop(), f &&= f.node;
+		}
+		return null;
+	}
+	function c(e, t) {
+		return e.dist - t.dist;
+	}
+	function l(e, t, n) {
+		if (u(e, n) || u(t, n)) return 0;
+		var r = y(e[0], e[1], t[0], t[1], n.minX, n.minY, n.maxX, n.minY);
+		if (r === 0) return 0;
+		var i = y(e[0], e[1], t[0], t[1], n.minX, n.minY, n.minX, n.maxY);
+		if (i === 0) return 0;
+		var a = y(e[0], e[1], t[0], t[1], n.maxX, n.minY, n.maxX, n.maxY);
+		if (a === 0) return 0;
+		var o = y(e[0], e[1], t[0], t[1], n.minX, n.maxY, n.maxX, n.maxY);
+		return o === 0 ? 0 : Math.min(r, i, a, o);
+	}
+	function u(e, t) {
+		return e[0] >= t.minX && e[0] <= t.maxX && e[1] >= t.minY && e[1] <= t.maxY;
+	}
+	function d(e, t, n) {
+		for (var r = Math.min(e[0], t[0]), i = Math.min(e[1], t[1]), a = Math.max(e[0], t[0]), o = Math.max(e[1], t[1]), s = n.search({
+			minX: r,
+			minY: i,
+			maxX: a,
+			maxY: o
+		}), c = 0; c < s.length; c++) if (p(s[c].p, s[c].next.p, e, t)) return !1;
+		return !0;
+	}
+	function f(e, t, n) {
+		return a(e[0], e[1], t[0], t[1], n[0], n[1]);
+	}
+	function p(e, t, n, r) {
+		return e !== r && t !== n && f(e, t, n) > 0 != f(e, t, r) > 0 && f(n, r, e) > 0 != f(n, r, t) > 0;
+	}
+	function m(e) {
+		var t = e.p, n = e.next.p;
+		return e.minX = Math.min(t[0], n[0]), e.minY = Math.min(t[1], n[1]), e.maxX = Math.max(t[0], n[0]), e.maxY = Math.max(t[1], n[1]), e;
+	}
+	function h(e) {
+		for (var t = e[0], n = e[0], r = e[0], a = e[0], o = 0; o < e.length; o++) {
+			var s = e[o];
+			s[0] < t[0] && (t = s), s[0] > r[0] && (r = s), s[1] < n[1] && (n = s), s[1] > a[1] && (a = s);
+		}
+		var c = [
+			t,
+			n,
+			r,
+			a
+		], l = c.slice();
+		for (o = 0; o < e.length; o++) i(e[o], c) || l.push(e[o]);
+		return x(l);
+	}
+	function g(e, t) {
+		var n = {
+			p: e,
+			prev: null,
+			next: null,
+			minX: 0,
+			minY: 0,
+			maxX: 0,
+			maxY: 0
+		};
+		return t ? (n.next = t.next, n.prev = t, t.next.prev = n, t.next = n) : (n.prev = n, n.next = n), n;
+	}
+	function _(e, t) {
+		var n = e[0] - t[0], r = e[1] - t[1];
+		return n * n + r * r;
+	}
+	function v(e, t, n) {
+		var r = t[0], i = t[1], a = n[0] - r, o = n[1] - i;
+		if (a !== 0 || o !== 0) {
+			var s = ((e[0] - r) * a + (e[1] - i) * o) / (a * a + o * o);
+			s > 1 ? (r = n[0], i = n[1]) : s > 0 && (r += a * s, i += o * s);
+		}
+		return a = e[0] - r, o = e[1] - i, a * a + o * o;
+	}
+	function y(e, t, n, r, i, a, o, s) {
+		var c = n - e, l = r - t, u = o - i, d = s - a, f = e - i, p = t - a, m = c * c + l * l, h = c * u + l * d, g = u * u + d * d, _ = c * f + l * p, v = u * f + d * p, y = m * g - h * h, b, x, S, C, w = y, T = y;
+		y === 0 ? (x = 0, w = 1, C = v, T = g) : (x = h * v - g * _, C = m * v - h * _, x < 0 ? (x = 0, C = v, T = g) : x > w && (x = w, C = v + h, T = g)), C < 0 ? (C = 0, -_ < 0 ? x = 0 : -_ > m ? x = w : (x = -_, w = m)) : C > T && (C = T, -_ + h < 0 ? x = 0 : -_ + h > m ? x = w : (x = -_ + h, w = m)), b = x === 0 ? 0 : x / w, S = C === 0 ? 0 : C / T;
+		var E = (1 - b) * e + b * n, D = (1 - b) * t + b * r, O = (1 - S) * i + S * o, k = (1 - S) * a + S * s, A = O - E, j = k - D;
+		return A * A + j * j;
+	}
+	function b(e, t) {
+		return e[0] === t[0] ? e[1] - t[1] : e[0] - t[0];
+	}
+	function x(e) {
+		e.sort(b);
+		for (var t = [], n = 0; n < e.length; n++) {
+			for (; t.length >= 2 && f(t[t.length - 2], t[t.length - 1], e[n]) <= 0;) t.pop();
+			t.push(e[n]);
+		}
+		for (var r = [], i = e.length - 1; i >= 0; i--) {
+			for (; r.length >= 2 && f(r[r.length - 2], r[r.length - 1], e[i]) <= 0;) r.pop();
+			r.push(e[i]);
+		}
+		return r.pop(), t.pop(), t.concat(r);
+	}
+})))(), 1);
+function Ht(e, t = {}) {
+	t.concavity = t.concavity || Infinity;
+	let n = [];
+	if (Ot(e, (e) => {
+		n.push([e[0], e[1]]);
+	}), !n.length) return null;
+	let r = (0, Vt.default)(n, t.concavity);
+	return r.length > 3 ? bt([r]) : null;
+}
+//#endregion
+//#region node_modules/@turf/centroid/dist/esm/index.js
+function Ut(e, t = {}) {
+	let n = 0, r = 0, i = 0;
+	return Ot(e, function(e) {
+		n += e[0], r += e[1], i++;
+	}, !0), yt([n / i, r / i], t.properties);
+}
+//#endregion
+//#region node_modules/@turf/invariant/dist/esm/index.js
+function Wt(e) {
+	if (!e) throw Error("coord is required");
+	if (!Array.isArray(e)) {
+		if (e.type === "Feature" && e.geometry !== null && e.geometry.type === "Point") return [...e.geometry.coordinates];
+		if (e.type === "Point") return [...e.coordinates];
+	}
+	if (Array.isArray(e) && e.length >= 2 && !Array.isArray(e[0]) && !Array.isArray(e[1])) return [...e];
+	throw Error("coord must be GeoJSON Point or an Array of numbers");
+}
+function Gt(e) {
+	if (Array.isArray(e)) return e;
+	if (e.type === "Feature") {
+		if (e.geometry !== null) return e.geometry.coordinates;
+	} else if (e.coordinates) return e.coordinates;
+	throw Error("coords must be GeoJSON Feature, Geometry Object or an Array");
+}
+//#endregion
+//#region node_modules/@turf/rhumb-bearing/dist/esm/index.js
+function Kt(e, t, n = {}) {
+	let r;
+	return r = n.final ? qt(Wt(t), Wt(e)) : qt(Wt(e), Wt(t)), r > 180 ? -(360 - r) : r;
+}
+function qt(e, t) {
+	let n = wt(e[1]), r = wt(t[1]), i = wt(t[0] - e[0]);
+	i > Math.PI && (i -= 2 * Math.PI), i < -Math.PI && (i += 2 * Math.PI);
+	let a = Math.log(Math.tan(r / 2 + Math.PI / 4) / Math.tan(n / 2 + Math.PI / 4));
+	return (Ct(Math.atan2(i, a)) + 360) % 360;
+}
+//#endregion
+//#region node_modules/@turf/rhumb-distance/dist/esm/index.js
+function Jt(e, t, n = {}) {
+	let r = Wt(e), i = Wt(t);
+	return i[0] += i[0] - r[0] > 180 ? -360 : r[0] - i[0] > 180 ? 360 : 0, Tt(Yt(r, i), "meters", n.units);
+}
+function Yt(e, t, n) {
+	n = n === void 0 ? $ : Number(n);
+	let r = n, i = e[1] * Math.PI / 180, a = t[1] * Math.PI / 180, o = a - i, s = Math.abs(t[0] - e[0]) * Math.PI / 180;
+	s > Math.PI && (s -= 2 * Math.PI);
+	let c = Math.log(Math.tan(a / 2 + Math.PI / 4) / Math.tan(i / 2 + Math.PI / 4)), l = Math.abs(c) > 1e-11 ? o / c : Math.cos(i);
+	return Math.sqrt(o * o + l * l * s * s) * r;
+}
+//#endregion
+//#region node_modules/@turf/rhumb-destination/dist/esm/index.js
+function Xt(e, t, n, r = {}) {
+	let i = t < 0, a = Tt(Math.abs(t), r.units, "meters");
+	i && (a = -Math.abs(a));
+	let o = Wt(e), s = Zt(o, a, n);
+	return s[0] += s[0] - o[0] > 180 ? -360 : o[0] - s[0] > 180 ? 360 : 0, yt(s, r.properties);
+}
+function Zt(e, t, n, r) {
+	r = r === void 0 ? $ : Number(r);
+	let i = t / r, a = e[0] * Math.PI / 180, o = wt(e[1]), s = wt(n), c = i * Math.cos(s), l = o + c;
+	Math.abs(l) > Math.PI / 2 && (l = l > 0 ? Math.PI - l : -Math.PI - l);
+	let u = Math.log(Math.tan(l / 2 + Math.PI / 4) / Math.tan(o / 2 + Math.PI / 4)), d = Math.abs(u) > 1e-11 ? c / u : Math.cos(o);
+	return [((a + i * Math.sin(s) / d) * 180 / Math.PI + 540) % 360 - 180, l * 180 / Math.PI];
+}
+//#endregion
+//#region node_modules/@turf/clone/dist/esm/index.js
+function Qt(e) {
+	if (!e) throw Error("geojson is required");
+	switch (e.type) {
+		case "Feature": return $t(e);
+		case "FeatureCollection": return tn(e);
+		case "Point":
+		case "LineString":
+		case "Polygon":
+		case "MultiPoint":
+		case "MultiLineString":
+		case "MultiPolygon":
+		case "GeometryCollection": return nn(e);
+		default: throw Error("unknown GeoJSON type");
+	}
+}
+function $t(e) {
+	let t = { type: "Feature" };
+	return Object.keys(e).forEach((n) => {
+		switch (n) {
+			case "type":
+			case "properties":
+			case "geometry": return;
+			default: t[n] = e[n];
+		}
+	}), t.properties = en(e.properties), e.geometry == null ? t.geometry = null : t.geometry = nn(e.geometry), t;
+}
+function en(e) {
+	let t = {};
+	return e && Object.keys(e).forEach((n) => {
+		let r = e[n];
+		typeof r == "object" ? r === null ? t[n] = null : Array.isArray(r) ? t[n] = r.map((e) => e) : t[n] = en(r) : t[n] = r;
+	}), t;
+}
+function tn(e) {
+	let t = { type: "FeatureCollection" };
+	return Object.keys(e).forEach((n) => {
+		switch (n) {
+			case "type":
+			case "features": return;
+			default: t[n] = e[n];
+		}
+	}), t.features = e.features.map((e) => $t(e)), t;
+}
+function nn(e) {
+	let t = { type: e.type };
+	return e.bbox && (t.bbox = e.bbox), e.type === "GeometryCollection" ? (t.geometries = e.geometries.map((e) => nn(e)), t) : (t.coordinates = rn(e.coordinates), t);
+}
+function rn(e) {
+	let t = e;
+	return typeof t[0] == "object" ? t.map((e) => rn(e)) : t.slice();
+}
+//#endregion
+//#region node_modules/@turf/transform-rotate/dist/esm/index.js
+function an(e, t, n) {
+	if (n ||= {}, !Dt(n)) throw Error("options is invalid");
+	let r = n.pivot, i = n.mutate;
+	if (!e) throw Error("geojson is required");
+	if (t == null || isNaN(t)) throw Error("angle is required");
+	if (t === 0) return e;
+	let a = r ?? Ut(e);
+	return (i === !1 || i === void 0) && (e = Qt(e)), Ot(e, function(e) {
+		let n = Kt(a, e) + t, r = Gt(Xt(a, Jt(a, e), n));
+		e[0] = r[0], e[1] = r[1];
+	}), e;
+}
+//#endregion
+//#region node_modules/@turf/bearing/dist/esm/index.js
+function on(e, t, n = {}) {
+	if (n.final === !0) return sn(e, t);
+	let r = Wt(e), i = Wt(t), a = wt(r[0]), o = wt(i[0]), s = wt(r[1]), c = wt(i[1]), l = Math.sin(o - a) * Math.cos(c), u = Math.cos(s) * Math.sin(c) - Math.sin(s) * Math.cos(c) * Math.cos(o - a);
+	return Ct(Math.atan2(l, u));
+}
+function sn(e, t) {
+	let n = on(t, e);
+	return n = (n + 180) % 360, n;
+}
+//#endregion
+//#region node_modules/@turf/bbox/dist/esm/index.js
+function cn(e, t = {}) {
+	if (e.bbox != null && !0 !== t.recompute) return e.bbox;
+	let n = [
+		Infinity,
+		Infinity,
+		-Infinity,
+		-Infinity
+	];
+	return Ot(e, (e) => {
+		n[0] > e[0] && (n[0] = e[0]), n[1] > e[1] && (n[1] = e[1]), n[2] < e[0] && (n[2] = e[0]), n[3] < e[1] && (n[3] = e[1]);
+	}), n;
+}
+//#endregion
+//#region node_modules/@turf/bbox-polygon/dist/esm/index.js
+function ln(e, t = {}) {
+	let n = Number(e[0]), r = Number(e[1]), i = Number(e[2]), a = Number(e[3]);
+	if (e.length === 6) throw Error("@turf/bbox-polygon does not support BBox with 6 positions");
+	let o = [n, r];
+	return bt([[
+		o,
+		[i, r],
+		[i, a],
+		[n, a],
+		o
+	]], t.properties, {
+		bbox: e,
+		id: t.id
+	});
+}
+//#endregion
+//#region node_modules/@turf/envelope/dist/esm/index.js
+function un(e) {
+	return ln(cn(e));
+}
+//#endregion
+//#region node_modules/@turf/area/dist/esm/index.js
+function dn(e) {
+	return jt(e, (e, t) => e + fn(t), 0);
+}
+function fn(e) {
+	let t = 0, n;
+	switch (e.type) {
+		case "Polygon": return pn(e.coordinates);
+		case "MultiPolygon":
+			for (n = 0; n < e.coordinates.length; n++) t += pn(e.coordinates[n]);
+			return t;
+		case "Point":
+		case "MultiPoint":
+		case "LineString":
+		case "MultiLineString": return 0;
+	}
+	return 0;
+}
+function pn(e) {
+	let t = 0;
+	if (e && e.length > 0) {
+		t += Math.abs(gn(e[0]));
+		for (let n = 1; n < e.length; n++) t -= Math.abs(gn(e[n]));
+	}
+	return t;
+}
+var mn = $ * $ / 2, hn = Math.PI / 180;
+function gn(e) {
+	let t = e.length - 1;
+	if (t <= 2) return 0;
+	let n = 0, r = 0;
+	for (; r < t;) {
+		let i = e[r], a = e[r + 1 === t ? 0 : r + 1], o = e[r + 2 >= t ? (r + 2) % t : r + 2], s = i[0] * hn, c = a[1] * hn, l = o[0] * hn;
+		n += (l - s) * Math.sin(c), r++;
+	}
+	return n * mn;
+}
+//#endregion
+//#region node_modules/geojson-minimum-bounding-rectangle/dist/index.js
+function _n(e) {
+	let t = Ht(e);
+	if (!t) throw Error("Can't calculate smallestSurroundingRectangleByArea for given geometry");
+	let n = Ut(t), r = kt(t), i = 2 ** 53 - 1, a = null;
+	for (let e = 0; e < r.length - 1; e++) {
+		let o = on(r[e], r[e + 1]), s = un(an(t, -1 * o, { pivot: n })), c = dn(s);
+		c < i && (i = c, a = an(s, o, { pivot: n }));
+	}
+	return a;
+}
+//#endregion
+//#region src/utils/OBB.mjs
+function vn(e, t) {
+	let n = t[0] - e[0], r = t[1] - e[1];
+	return Math.sqrt(n * n + r * r);
+}
+function yn(e) {
+	let t = Infinity, n = -Infinity, r = Infinity, i = -Infinity;
+	for (let [a, o] of e) a < t && (t = a), a > n && (n = a), o < r && (r = o), o > i && (i = o);
+	return [(n + t) * .5, (i + r) * .5];
+}
+var bn = class t extends ht {
+	getBoxMesh() {
+		xn.identity(), xn.setFromMatrix3(this.rotation), xn.decompose(Tn, Sn, new e.Vector3());
+		let t = this.halfSize.clone().multiplyScalar(2), n = new e.Mesh(new e.BoxGeometry(t.x, t.y, t.z));
+		return n.position.copy(this.center), n.rotation.setFromQuaternion(Sn), n;
+	}
+	getBoxEdge(t = 16776960) {
+		let n = this.getBoxMesh();
+		En.setFromObject(n);
+		let r = new e.EdgesGeometry(n.geometry.clone().applyMatrix4(n.matrixWorld));
+		return new e.LineSegments(r, new e.LineBasicMaterial({
+			color: t,
+			toneMapped: !1
+		}));
+	}
+	toJson() {
+		return xn.identity(), xn.setFromMatrix3(this.rotation), xn.decompose(Tn, Sn, new e.Vector3()), {
+			size: this.halfSize.toArray(),
+			center: this.center.toArray(),
+			quaternion: Sn.toArray()
+		};
+	}
+	static from(n, r, i, a = new t()) {
+		if (i instanceof e.Euler) Sn.setFromEuler(i);
+		else if (i instanceof e.Quaternion) Sn.copy(i);
+		else throw Error("传入的旋转不是欧拉角或者四元数");
+		return xn.compose(r, Sn, wn), a.center.copy(r), a.halfSize.copy(n.multiplyScalar(.5)), a.rotation.setFromMatrix4(xn), a;
+	}
+	static fromByPath2D(e, n, r, i = new t()) {
+		let a = _n({
+			type: "Polygon",
+			coordinates: [e.map((e) => [e.x, e.y])]
+		});
+		if (!a) throw Error("2d obb 获取失败");
+		let o = a.geometry.coordinates[0], s = vn(o[0], o[1]), c = vn(o[1], o[2]), l = Math.atan2(o[1][1] - o[0][1], o[1][0] - o[0][0]);
+		Tn.set(s, c, r), Cn.set(0, 0, l);
+		let [u, d] = yn(o);
+		return n.x = u, n.y = d, this.from(Tn, n, Cn, i);
+	}
+}, xn = new e.Matrix4(), Sn = new e.Quaternion(), Cn = new e.Euler(), wn = new e.Vector3(1, 1, 1), Tn = new e.Vector3(), En = new e.Box3();
+//#endregion
+//#region src/pointCloudProcessing/mergeMeaning.mjs
+function Dn(e, t, n = .005, r = .2) {
+	if (!e.length || !t.length) return 0;
+	let i = Math.max(n * 3, .05), a = n * n, o = /* @__PURE__ */ new Map(), s = (e, t, n) => `${Math.floor(e / i)},${Math.floor(t / i)},${Math.floor(n / i)}`;
+	for (let e of t) {
+		let t = s(e.x, e.y, e.z);
+		o.has(t) || o.set(t, []), o.get(t).push(e);
+	}
+	let c = 0, l = Math.ceil(n / i) + 1, u = [];
+	for (let e = -l; e <= l; e++) for (let t = -l; t <= l; t++) for (let n = -l; n <= l; n++) e * e + t * t + n * n <= l * l && u.push([
+		e,
+		t,
+		n
+	]);
+	for (let t of e) {
+		let n = Math.floor(t.x / i), s = Math.floor(t.y / i), l = Math.floor(t.z / i), d = !1;
+		for (let [e, r, i] of u) {
+			let c = `${n + e},${s + r},${l + i}`;
+			if (o.has(c)) {
+				for (let e of o.get(c)) if (t.distanceToSquared(e) < a) {
+					d = !0;
+					break;
+				}
+				if (d) break;
+			}
+		}
+		if (d && (c++, c / e.length > r)) return c / e.length;
+	}
+	return c / e.length;
+}
+function On(e, t, n = .5) {
+	let r = 0, i = 0;
+	for (let a of e) if (t.containsPoint(a) && (r++, i = r / e.length, i > n)) break;
+	return i;
+}
+function kn(e, t, n, r) {
+	if (e.intersectsOBB(t)) return !0;
+	{
+		let i = jn(e, r), a = jn(t, n);
+		if (i || a) return !0;
+	}
+	return !1;
+}
+function An(t, n) {
+	let r = new e.Vector3(), i = new e.Vector3();
+	t.getSize(r), n.getSize(i);
+	let a = r.x * r.y * r.z, o = i.x * i.y * i.z;
+	return a > o ? 1 : a < o ? -1 : 0;
+}
+function jn(e, t) {
+	let n = !0;
+	for (let r = 0; r < t.length; r++) if (!e.containsPoint(t[r])) {
+		n = !1;
+		break;
+	}
+	return n;
+}
+function Mn(e) {
+	if (e.length === 0) return {
+		x: 0,
+		y: 0,
+		z: 0,
+		h: 0
+	};
+	let t = 0, n = 0, r = -Infinity, i = Infinity;
+	for (let a of e) t += a.x, n += a.y, r = Math.max(r, a.z), i = Math.min(i, a.z);
+	return {
+		x: t / e.length,
+		y: n / e.length,
+		z: 0,
+		maxz: r,
+		minz: i,
+		h: r - i
+	};
+}
+function Nn(t, n, r, i) {
+	let a = [];
+	for (let n = 0; n < t.length; n++) a.push(new e.Vector3(t[n][0], t[n][1], 0));
+	if (a.length == 0) return null;
+	let o = bn.fromByPath2D(a, n, r);
+	return o.center.z = i, o;
+}
+var Pn = (t) => {
+	if (t.length == 0) return [];
+	let n = [];
+	for (let r = 0; r < t.length; r++) {
+		let i = t[r].points.map((e) => [e.x, e.y]), a = Mn(t[r].points), o = t[r].obj_id;
+		o = o.replace(/calcony railing/g, "balcony railing").replace(/glass balcony railing/g, "balcony railing").replace(/metal balcony railing/g, "balcony railing").replace(/temporary construction guardrail/g, "balcony railing"), o.split("_").slice(1, 3).join("_").split(".")[0].split("_")[0];
+		let s = o.indexOf("_") + 1, c = o.lastIndexOf("_"), l = o.substring(s, c);
+		if (l === "wall" || l === "floor" || l === "roof") continue;
+		let u = [];
+		for (let n = 0; n < t[r].points.length; n++) u.push(new e.Vector3(t[r].points[n].x, t[r].points[n].y, t[r].points[n].z));
+		let d = {
+			points: u,
+			path: at(i),
+			h: a.h,
+			minz: a.minz,
+			maxz: a.maxz,
+			center: {
+				x: a.x,
+				y: a.y,
+				z: a.z
+			},
+			obj_id: t[r].obj_id,
+			type: l,
+			averagePz: t[r].averagePz,
+			obb: null,
+			isDel: !1,
+			obj_id: o,
+			positionArr: [t[r].position]
+		};
+		if (d.obb = Nn(d.path, d.center, d.h, (d.maxz + d.minz) / 2), d.obb == null) continue;
+		let f = -1;
+		for (let e = 0; e < n.length; e++) if (n[e].type == l) {
+			f = e;
+			break;
+		}
+		f == -1 ? n.push({
+			type: l,
+			array: [d]
+		}) : n[f].array.push(d);
+	}
+	for (let e = 0; e < n.length; e++) {
+		let t = n[e].array, r = [], i = [];
+		for (let e = 0; e < t.length; e++) {
+			if (t[e].obb == null || r.includes(e)) continue;
+			let n = {
+				...t[e],
+				obb: t[e].obb.clone()
+			};
+			for (let i = e + 1; i < t.length; i++) if (!(t[i].obb == null || r.includes(i)) && n.obb.intersectsOBB(t[i].obb)) {
+				r.push(i), n.points.push(...t[i].points), n.path = at(n.points.map((e) => [e.x, e.y]));
+				let a = Mn(n.points);
+				n.h = a.h, n.minz = a.minz, n.maxz = a.maxz, n.center = {
+					x: a.x,
+					y: a.y,
+					z: a.z
+				}, n.obb = Nn(n.path, n.center, n.h, (n.maxz + n.minz) / 2), n.positionArr.push(...t[i].positionArr), i = e;
+			}
+			n.path.length > t[e].path.length && (r.push(e), i.push(n));
+		}
+		let a = [];
+		for (let e = 0; e < t.length; e++) r.includes(e) || a.push(t[e]);
+		a.push(...i), n[e].array = a;
+	}
+	for (let t = 0; t < n.length; t++) {
+		let r = n[t].type, i = n[t].array;
+		for (let a = 0; a < i.length; a++) {
+			let o = i[a].obb, s = i[a].minz;
+			i[a].maxz;
+			let c = i[a].averagePz;
+			if (r === "window" || r === "door" || r === "tv" || r === "chair" || r === "cabinet" || r === "table") {
+				let t = new e.Vector3();
+				o.getSize(t);
+				let n = [
+					t.x,
+					t.y,
+					t.z
+				], r = 0;
+				for (let e of n) if (e < .2 && (r++, r === 2)) {
+					i[a].isDel = !0;
+					break;
+				}
+			}
+			if (!i[a].isDel) for (let e = t + 1; e < n.length; e++) {
+				let t = n[e].type, l = n[e].array;
+				for (let e = 0; e < l.length; e++) {
+					if (l[e].isDel) continue;
+					let n = l[e].obb, u = l[e].minz;
+					if (l[e].maxz, o.intersectsOBB(n)) {
+						On(l[e].points, o);
+						let d = On(i[a].points, n), f = An(o, n);
+						if (d >= .3 && f == -1) {
+							i[a].isDel = !0;
+							break;
+						}
+						if (r !== "wall" && r !== "floor" && r !== "roof") {
+							if (r === "window") {
+								if (t === "balcony railing" && containsObb(o, l[e].points)) {
+									l[e].isDel = !0;
+									continue;
+								}
+								if (t === "balcony railing" && containsObb(n, i[a].points)) {
+									i[a].isDel = !0;
+									break;
+								}
+								if (t === "balcony railing" && kn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(u - c) > .3)) {
+									l[e].isDel = !0;
+									continue;
+								}
+							} else if (r === "balcony railing") {
+								if (t === "window" && containsObb(o, l[e].points)) {
+									l[e].isDel = !0;
+									continue;
+								}
+								if (t === "window" && containsObb(n, i[a].points)) {
+									i[a].isDel = !0;
+									break;
+								}
+								if (t === "window" && kn(o, n, i[a].points, l[e].points) && (Math.abs(s - u) < .1 || Math.abs(s - c) > .3)) {
+									i[a].isDel = !0;
+									break;
+								}
+							}
+							let d = !1, f = [], p = [], m = i[a].points, h = l[e].points;
+							if (m.length > h.length ? (d = !0, f = m, p = h) : (f = h, p = m), Dn(p, f, .03, .5) > .5) {
+								if (t === "people") {
+									l[e].isDel = !0;
+									continue;
+								} else if (r === "people") {
+									i[a].isDel = !0;
+									break;
+								}
+								if (d) l[e].isDel = !0;
+								else {
+									i[a].isDel = !0;
+									break;
+								}
+							} else if (kn(o, n)) {
+								if (t === "people") {
+									l[e].isDel = !0;
+									continue;
+								} else if (r === "people") {
+									i[a].isDel = !0;
+									break;
+								}
+								let s = An(o, n);
+								if (s === 1 || s === 0) {
+									if (t === "switch") continue;
+									On(p, o) >= .5 && (l[e].isDel = !0);
+								} else {
+									if (r === "switch") continue;
+									if (On(p, n) >= .5) {
+										i[a].isDel = !0;
+										break;
+									}
+								}
+							}
+						}
+					}
+				}
+				if (i[a].isDel) break;
+			}
+		}
+	}
+	for (let t = 0; t < n.length; t++) {
+		let r = n[t].type, i = n[t].array;
+		for (let t = 0; t < i.length; t++) {
+			let n = i[t].maxz, a = i[t].minz, o = r === "switch" ? .1 : .3, s = i[t].averagePz;
+			if (Math.abs(n - s) < o) {
+				i[t].isDel = !0;
+				continue;
+			}
+			if (r === "window" || r === "door" || r === "tv") {
+				let e = Math.abs(n - s);
+				r !== "window" && e < 1.6 && (i[t].isDel = !0), r === "window" && e < 1 && (i[t].isDel = !0);
+			}
+			if (r === "chair") {
+				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));
+		}
+	}
+	for (let e = 0; e < n.length; e++) n[e].array = n[e].array.filter((e) => !e.isDel);
+	let r = [];
+	for (let t = 0; t < n.length; t++) {
+		let i = n[t].array;
+		for (let t = 0; t < i.length; t++) r.push({
+			obbBox: i[t].obb,
+			box: new e.Box3().setFromPoints(i[t].points),
+			category: i[t].type,
+			center: {
+				x: i[t].center.x,
+				y: i[t].center.y,
+				z: (i[t].minz + i[t].maxz) / 2
+			},
+			name: i[t].obj_id,
+			obj_id: i[t].obj_id,
+			pcdPoints: i[t].points,
+			positionArr: i[t].positionArr
+		});
+	}
+	return r;
 };
 //#endregion
-export { S as classifySegments, V as getAllGeometry, U as getBeamLine, G as getColLine, W as getMainBeamLine, y as getParallelism, D as getPointCloudMinMax, T as getPointCoverageOnQuad, m as isParallel, b as perpendicularInfo, k as removeNoisePoints, d as segmentsIntersect2D, H as usegetBeamLine };
+export { R as classifySegments, he as getAllGeometry, _e as getBeamLine, ye as getColLine, ve as getMainBeamLine, Pn as getMergeMeaning, F as getParallelism, re as getPointCloudMinMax, z as getPointCoverageOnQuad, A as isParallel, I as perpendicularInfo, ae as removeNoisePoints, D as segmentsIntersect2D, ge as usegetBeamLine };