rm-graphical-computing 1.0.52 → 1.0.54

package/dist/index.js

@@ -4279,4 +4279,503 @@ var Kn = (t) => {
 	return i;
 };
 //#endregion
-export { z as classifySegments, ge as getAllGeometry, Oe as getBeamLine, Ae as getColLine, ke as getMainBeamLine, Kn as getMergeMeaning, I as getParallelism, re as getPointCloudMinMax, te as getPointCoverageOnQuad, j as isParallel, L as perpendicularInfo, ae as removeNoisePoints, O as segmentsIntersect2D, _e as updateStEdPoint, De as usegetBeamLine };
+//#region src/wall-window-matcher/utils.ts
+function qn(e, t) {
+	let n = e.x - t.x, r = e.y - t.y;
+	return Math.sqrt(n * n + r * r);
+}
+function Jn(e) {
+	let t = 0, n = 0, r = 0;
+	for (let i = 0; i < 4; i++) {
+		let a = e[i], o = e[(i + 1) % 4], s = o.x - a.x, c = o.y - a.y, l = Math.sqrt(s * s + c * c);
+		l > t && (t = l, n = s / l, r = c / l);
+	}
+	return {
+		longSide: t,
+		dirX: n,
+		dirY: r
+	};
+}
+function Yn(e, t, n) {
+	let r = [];
+	for (let i of e) {
+		let e = (i.start.x + i.end.x) / 2, a = (i.start.y + i.end.y) / 2, o = e - t, s = a - n;
+		o * o + s * s <= 9 && r.push(i.start.z, i.end.z);
+	}
+	if (r.length === 0) {
+		let t = [];
+		for (let n of e) t.push(n.start.z, n.end.z);
+		return t.length ? (t.sort((e, t) => e - t), t[Math.floor(t.length / 2)]) : -Infinity;
+	}
+	return r.sort((e, t) => e - t), r[Math.floor(r.length / 2)];
+}
+function Xn(e, t, n, r, i, a) {
+	let o = i - n, s = a - r, c = o * o + s * s;
+	if (c < 1e-12) return {
+		dist: Math.sqrt((e - n) ** 2 + (t - r) ** 2),
+		t: 0
+	};
+	let l = e - n, u = t - r, d = (l * o + u * s) / c, f = n + d * o, p = r + d * s;
+	return {
+		dist: Math.sqrt((e - f) ** 2 + (t - p) ** 2),
+		t: d
+	};
+}
+//#endregion
+//#region src/wall-window-matcher/scoring.ts
+function Zn(e, t, n = .15) {
+	let r = 0, i = 0;
+	for (let a of t) a !== e && ((qn(e.start, a.start) <= n || qn(e.start, a.end) <= n) && r++, (qn(e.end, a.start) <= n || qn(e.end, a.end) <= n) && i++);
+	let a = 0;
+	return r >= 1 && i >= 1 ? a = 5 : (r >= 1 || i >= 1) && (a = 2), {
+		left: r,
+		right: i,
+		score: a
+	};
+}
+function Qn(e, t) {
+	let n = [], { start: r, end: i } = e;
+	for (let e of t) {
+		let { dist: t } = Xn(e.x, e.y, r.x, r.y, i.x, i.y);
+		n.push(t);
+	}
+	let a = n.reduce((e, t) => e + t, 0) / n.length, o = n.reduce((e, t) => e + (t - a) ** 2, 0) / n.length;
+	return o < .01 ? 3 : o < .05 ? 2 : o < .1 ? 1 : 0;
+}
+function $n(e, t, n = .15) {
+	let r = e.end.x - e.start.x, i = e.end.y - e.start.y, a = Math.sqrt(r * r + i * i);
+	if (a < 1e-12) return 0;
+	let o = -i / a, s = r / a, c = [[], []];
+	for (let l = 0; l < 2; l++) {
+		let u = l === 0 ? e.start : e.end;
+		for (let d of t) {
+			if (d === e) continue;
+			let t = qn(u, d.start), f = qn(u, d.end), p = null;
+			if (t <= n ? p = d.end : f <= n && (p = d.start), !p) continue;
+			let m = d.end.x - d.start.x, h = d.end.y - d.start.y, g = Math.sqrt(m * m + h * h);
+			if (g < 1e-12 || Math.abs(r * m + i * h) / (a * g) >= .342) continue;
+			let _ = (p.x - u.x) * o + (p.y - u.y) * s;
+			c[l].push(_ > 0 ? 1 : -1);
+		}
+	}
+	if (c[0].length === 0 || c[1].length === 0) return 0;
+	let l = [...c[0], ...c[1]];
+	return l.every((e) => e === l[0]) ? 2 : 1;
+}
+function er(e, t, n) {
+	let r = Zn(e, n), i = Qn(e, t), a = $n(e, n);
+	return {
+		score: r.score * 3 + i * 2 + a * 2,
+		details: {
+			conn: r.score,
+			variance: i,
+			sameSide: a
+		}
+	};
+}
+//#endregion
+//#region src/wall-window-matcher/merger.ts
+function tr(e) {
+	let t = e.end.x - e.start.x, n = e.end.y - e.start.y, r = 180 / Math.PI * Math.atan2(n, t);
+	return r < 0 && (r += 180), r;
+}
+function nr(e, t) {
+	let n = [];
+	for (let r of e) {
+		let e = !1;
+		for (let i of n) {
+			let n = Math.abs(r.angle - i[0].angle);
+			if (Math.min(n, 180 - n) <= t) {
+				i.push(r), e = !0;
+				break;
+			}
+		}
+		e || n.push([r]);
+	}
+	return n;
+}
+function rr(e, t = .05) {
+	let n = [];
+	for (let r of e) {
+		let e = !1;
+		for (let i of n) if (Math.abs(r.offset - i[0].offset) <= t) {
+			i.push(r), e = !0;
+			break;
+		}
+		e || n.push([r]);
+	}
+	return n;
+}
+function ir(e, t, n, r, i) {
+	let a = [];
+	for (let i of e) {
+		let e = i.seg, o = (e.start.x - t.start.x) * n + (e.start.y - t.start.y) * r, s = (e.end.x - t.start.x) * n + (e.end.y - t.start.y) * r;
+		a.push({
+			l: Math.min(o, s),
+			r: Math.max(o, s),
+			idx: i.idx
+		});
+	}
+	a.sort((e, t) => e.l - t.l);
+	let o = [];
+	for (let { l: e, r: t, idx: n } of a) {
+		if (o.length === 0) {
+			o.push({
+				l: e,
+				r: t,
+				srcIdxs: [n]
+			});
+			continue;
+		}
+		let r = o[o.length - 1];
+		e <= r.r + i ? (r.r = Math.max(r.r, t), r.srcIdxs.includes(n) || r.srcIdxs.push(n)) : o.push({
+			l: e,
+			r: t,
+			srcIdxs: [n]
+		});
+	}
+	return o;
+}
+function ar(e, t, n, r, i, a, o) {
+	let s = n - t, c = { ...e };
+	return c.start = {
+		x: e.start.x + t * r,
+		y: e.start.y + t * i,
+		z: e.start.z
+	}, c.end = {
+		x: e.start.x + n * r,
+		y: e.start.y + n * i,
+		z: e.start.z
+	}, c.length = s, c.direction = {
+		x: r,
+		y: i,
+		z: 0
+	}, c.rooftopPz = a, c.buildRosource = o, c.isRebuild = !1, c.doorAndBeamData ||= [], c.insetionArr ||= [], c;
+}
+function or(e, t) {
+	let n = !0;
+	for (; n;) {
+		n = !1;
+		for (let r = 0; r < e.length; r++) for (let i = r + 1; i < e.length; i++) {
+			let a = e[r], o = e[i];
+			if (a.rooftopPz !== void 0 && o.rooftopPz !== void 0 && Math.abs(a.rooftopPz - o.rooftopPz) > .05) continue;
+			let s = Math.abs(a.end.x - o.start.x) < .001 && Math.abs(a.end.y - o.start.y) < .001, c = Math.abs(a.start.x - o.end.x) < .001 && Math.abs(a.start.y - o.end.y) < .001, l = Math.abs(a.end.x - o.end.x) < .001 && Math.abs(a.end.y - o.end.y) < .001, u = Math.abs(a.start.x - o.start.x) < .001 && Math.abs(a.start.y - o.start.y) < .001;
+			if (!(s || c || l || u) || a.direction.x * o.direction.x + a.direction.y * o.direction.y < .98) continue;
+			let d = a.start, f = a.end;
+			s ? f = o.end : c ? d = o.start : l ? f = o.start : u && (d = o.end);
+			let p = Math.hypot(f.x - d.x, f.y - d.y), m = { ...a };
+			m.start = d, m.end = f, m.length = p, m.direction = {
+				x: (f.x - d.x) / p,
+				y: (f.y - d.y) / p,
+				z: 0
+			}, m.rooftopPz = a.rooftopPz === void 0 ? o.rooftopPz : a.rooftopPz, m.buildRosource = a.buildRosource || o.buildRosource, m.isRebuild = !1, m.doorAndBeamData ||= [], m.insetionArr ||= [], e[r] = m, t[r] = [...new Set([...t[r], ...t[i]])], e.splice(i, 1), t.splice(i, 1), i--, n = !0;
+		}
+	}
+	return {
+		segments: e,
+		sourceMap: t
+	};
+}
+function sr(e, t = 5, n = .05) {
+	if (e.length <= 1) return {
+		segments: e,
+		sourceMap: e.map((e, t) => [t])
+	};
+	let r = e.map((e, t) => ({
+		seg: e,
+		angle: tr(e),
+		idx: t
+	}));
+	r.sort((e, t) => e.angle - t.angle);
+	let i = nr(r, t), a = [], o = [], s = [];
+	for (let e of i) {
+		let t = e[0].seg;
+		for (let n of e) n.seg.length > t.length && (t = n.seg);
+		let r = t.end.x - t.start.x, i = t.end.y - t.start.y, c = Math.sqrt(r * r + i * i);
+		if (c < 1e-12) continue;
+		let l = -i / c, u = r / c, d = e.map((e) => {
+			let n = e.seg.start.x - t.start.x, r = e.seg.start.y - t.start.y;
+			return {
+				seg: e.seg,
+				offset: Math.abs(n * l + r * u),
+				idx: e.idx
+			};
+		});
+		d.sort((e, t) => e.offset - t.offset);
+		let f = rr(d);
+		for (let e of f) {
+			let t = e[0].seg;
+			for (let n of e) n.seg.length > t.length && (t = n.seg);
+			let r = t.end.x - t.start.x, i = t.end.y - t.start.y, c = Math.sqrt(r * r + i * i);
+			if (c < 1e-12) continue;
+			let l = r / c, u = i / c, d = e.map((e) => e.seg.rooftopPz ?? 0), f = Math.max(...d), p = [...new Set(d.map((e) => e.toFixed(3)))];
+			if (p.length > 1) {
+				console.warn(`[merge] inconsistent rooftopPz: ${p.join("/")} max=${f.toFixed(3)} count=${e.length}`);
+				let t = e.map((e) => ({
+					idx: e.idx,
+					start: {
+						x: e.seg.start.x,
+						y: e.seg.start.y,
+						z: e.seg.start.z
+					},
+					end: {
+						x: e.seg.end.x,
+						y: e.seg.end.y,
+						z: e.seg.end.z
+					},
+					length: e.seg.length,
+					rooftopPz: e.seg.rooftopPz ?? 0
+				}));
+				s.push({
+					values: [...p],
+					segments: t
+				});
+			}
+			let m = [...new Set(e.map((e) => String(e.seg.buildRosource)))];
+			m.length > 1 && e.length > 1 && console.warn(`[merge] buildRosource src: ${m.join("/")}`);
+			let h = ir(e, t, l, u, n);
+			for (let { l: e, r: n, srcIdxs: r } of h) {
+				if (n - e < .01) continue;
+				let i = ar(t, e, n, l, u, f, t.buildRosource);
+				a.push(i), o.push(r);
+			}
+		}
+	}
+	return {
+		...or(a, o),
+		debugRPZGroups: s
+	};
+}
+//#endregion
+//#region src/wall-window-matcher/matcher.ts
+function cr(e) {
+	return {
+		minLengthRatio: .95,
+		maxDistance: .5,
+		angleThreshold: 45,
+		projectionMargin: .1,
+		printOnly: !0,
+		...e
+	};
+}
+function lr(e, t, n) {
+	return [
+		{
+			x: t,
+			y: n,
+			z: 0
+		},
+		{
+			x: e[0].x,
+			y: e[0].y,
+			z: 0
+		},
+		{
+			x: e[1].x,
+			y: e[1].y,
+			z: 0
+		},
+		{
+			x: e[2].x,
+			y: e[2].y,
+			z: 0
+		},
+		{
+			x: e[3].x,
+			y: e[3].y,
+			z: 0
+		}
+	];
+}
+function ur(e, t, n, r, i, a, o, s, c) {
+	if (![
+		"_008",
+		"_002",
+		"_014",
+		"_015",
+		"_020"
+	].some((t) => e.includes(t))) return;
+	let l = t.map((e) => {
+		let { start: t, end: a } = e, c = Xn(n, r, t.x, t.y, a.x, a.y), l = i.map((e) => {
+			let n = Xn(e.x, e.y, t.x, t.y, a.x, a.y);
+			return `t=${n.t.toFixed(3)},d=${n.dist.toFixed(3)}`;
+		}), u = a.x - t.x, d = a.y - t.y, f = Math.sqrt(u * u + d * d) || 1, p = Math.abs(u / f * o + d / f * s), m = 180 / Math.PI * Math.acos(Math.min(p, 1));
+		return {
+			seg: e,
+			lineDist: c.dist,
+			t: c.t,
+			pts: l,
+			angle: m,
+			length: e.length
+		};
+	});
+	l.sort((e, t) => e.lineDist - t.lineDist), console.warn(`[${e}扫查] 按无限直线距离排序的前 15 条候选: (需长≥${(a * c.minLengthRatio).toFixed(2)})`);
+	for (let e = 0; e < Math.min(15, l.length); e++) {
+		let t = l[e], n = t.length >= a * c.minLengthRatio ? "✓" : `✗(需${(a * c.minLengthRatio).toFixed(2)})`, r = Math.abs(t.t) <= 1.4 ? "✓" : "✗", i = t.lineDist <= .65 ? "✓" : "✗", o = t.angle <= 45 ? "✓" : "✗";
+		console.warn(`  #${e} 距=${t.lineDist.toFixed(3)}m t=${t.t.toFixed(3)} 角=${t.angle.toFixed(1)}° 长=${t.length.toFixed(3)}m [长度${n} 投影${r} 距离${i} 角度${o}] 起点(${t.seg.start.x.toFixed(3)},${t.seg.start.y.toFixed(3)})→(${t.seg.end.x.toFixed(3)},${t.seg.end.y.toFixed(3)}) | 5点: ${t.pts.join(" | ")}`);
+	}
+}
+function dr(e, t, n, r, i, a) {
+	let o = [{
+		margin: a.projectionMargin,
+		maxDist: a.maxDistance,
+		label: "严格"
+	}, {
+		margin: .4,
+		maxDist: .65,
+		label: "宽松"
+	}], s = [];
+	for (let c of o) {
+		if (s.length > 0) break;
+		for (let o of e) {
+			if (o.length < t * a.minLengthRatio) continue;
+			let { start: e, end: l } = o, u = !1, d = Infinity;
+			for (let t of i) {
+				let { dist: n, t: r } = Xn(t.x, t.y, e.x, e.y, l.x, l.y);
+				r >= -c.margin && r <= 1 + c.margin && n <= c.maxDist && (u = !0, d = Math.min(d, n));
+			}
+			if (!u) continue;
+			let f = Math.sqrt((l.x - e.x) ** 2 + (l.y - e.y) ** 2);
+			if (f < 1e-12) continue;
+			let p = (l.x - e.x) / f, m = (l.y - e.y) / f, h = Math.abs(n * p + r * m);
+			180 / Math.PI * Math.acos(Math.min(h, 1)) > a.angleThreshold || s.push({
+				seg: o,
+				minDist: d,
+				ratio: o.length / t,
+				score: 0,
+				details: {
+					conn: 0,
+					variance: 0,
+					sameSide: 0
+				}
+			});
+		}
+		s.length > 0 && console.log(`[findWindowWall] 候选 ${c.label}模式: ${s.length} 条`);
+	}
+	return s;
+}
+function fr(e, t, n, r) {
+	if (e.length <= 1) return e.length === 1 && (e[0].score = -1), e;
+	for (let r of e) {
+		let { score: e, details: i } = er(r.seg, t, n);
+		r.score = e, r.details = i;
+	}
+	e.sort((e, t) => t.score - e.score || e.minDist - t.minDist);
+	let i = e.map((e) => `评分=${e.score}(conn=${e.details.conn}/var=${e.details.variance}/side=${e.details.sameSide}) dist=${e.minDist.toFixed(3)}`).join(" | ");
+	console.log(`[findWindowWall] ${r} 评分排序: ${i}`);
+	let a = e[0];
+	return console.log(`[findWindowWall] ${r} → 选中评分=${a.score}(conn=${a.details.conn}/var=${a.details.variance}/side=${a.details.sameSide}) dist=${a.minDist.toFixed(3)}m`), e;
+}
+function pr(e, t, n, r) {
+	let i = e.end.x - e.start.x, a = e.end.y - e.start.y, o = Math.sqrt(i * i + a * a), s = i / o, c = a / o, l = t.map((t) => {
+		let n = t.x - e.start.x, r = t.y - e.start.y;
+		return (n * s + r * c) / o;
+	}), u = Math.min(...l), d = Math.max(...l), f = (d - u) * o, p = (u + d) / 2, m = e.start.x + p * i, h = e.start.y + p * a, g = n.box.min.z, _ = n.box.max.z, v = Math.abs(_ - g), y = Yn(r, e.start.x, e.start.y), b = Math.max(0, g - y), x = u <= 0 && d >= 1;
+	return {
+		p: {
+			x: m,
+			y: h,
+			z: g + v / 2
+		},
+		width: f,
+		full: x,
+		height: v,
+		groundClearance: b
+	};
+}
+function mr(e, t, n) {
+	let r = t.map((e) => n[e]), i = [], a = [], o = [], s = [], c = [], l;
+	for (let e of r) {
+		if (e.points?.length) for (let t of e.points) i.push(t);
+		if (e.originalPoints?.length) for (let t of e.originalPoints) a.push(t);
+		if (e.doorAndBeamData?.length) for (let t of e.doorAndBeamData) o.push(t);
+		if (e.insetionArr?.length) for (let t of e.insetionArr) s.push(t);
+		if (e.drawWindow?.length) for (let t of e.drawWindow) c.push(t);
+		e.boxData && !l && (l = e.boxData);
+	}
+	i.length && (e.points = i), a.length && (e.originalPoints = a), o.length && (e.doorAndBeamData = o), s.length && (e.insetionArr = s), c.length && (e.drawWindow = c), l && (e.boxData = l), c.length > 0 && console.log(`[dataMerge] wall (${e.start.x.toFixed(3)},${e.start.y.toFixed(3)})->(${e.end.x.toFixed(3)},${e.end.y.toFixed(3)}) merged from ${t.length} segments drawWindow=${c.length} items`);
+}
+function hr(e) {
+	let t = e.filter((e) => e.drawWindow && e.drawWindow.length > 0);
+	if (t.length !== 0) {
+		console.log(`[findWindowWall] 合并后携带 drawWindow 的墙段数量=${t.length}`);
+		for (let e of t) {
+			console.log(`[findWindowWall] 墙段: (${e.start.x.toFixed(3)},${e.start.y.toFixed(3)})->(${e.end.x.toFixed(3)},${e.end.y.toFixed(3)}) len=${e.length.toFixed(3)}m rooftopPz=${e.rooftopPz === void 0 ? "N/A" : e.rooftopPz.toFixed(3)}`);
+			for (let t = 0; t < e.drawWindow.length; t++) {
+				let n = e.drawWindow[t];
+				console.log(`  [drawWindow #${t}] p=(${n.p.x.toFixed(3)},${n.p.y.toFixed(3)}) width=${n.width.toFixed(3)}m height=${n.height.toFixed(3)}m groundClearance=${n.groundClearance.toFixed(3)}m full=${n.full}`);
+			}
+		}
+	}
+}
+function gr(e, t, n) {
+	let r = cr(n), i = [], { segments: a, sourceMap: o } = sr(t);
+	console.log(`[findWindowWall] 墙线段共线合并: ${t.length} → ${a.length} 条`);
+	let s = [...a, ...t];
+	for (let n of e) {
+		let e = n.coordinatesByArea?.coordinates;
+		if (!e || e.length < 4) {
+			console.warn(`[findWindowWall] ${n.name} 缺少 coordinatesByArea.coordinates，跳过`);
+			continue;
+		}
+		let o = e.slice(0, 4), c = o.reduce((e, t) => e + t.x, 0) / 4, l = o.reduce((e, t) => e + t.y, 0) / 4, { longSide: u, dirX: d, dirY: f } = Jn(o);
+		if (u < .01) {
+			console.warn(`[findWindowWall] ${n.name} 四边形边长过短 (${u.toFixed(3)})，跳过`);
+			continue;
+		}
+		let p = o.reduce((e, t) => e + t.z, 0) / 4, m = Yn(t, c, l);
+		if (p < m - .3) {
+			console.warn(`[findWindowWall] ${n.name} 高度异常(z=${p.toFixed(3)}，附近地面=${m.toFixed(3)})，跳过`);
+			continue;
+		}
+		let h = lr(o, c, l);
+		ur(n.name, s, c, l, h, u, d, f, r);
+		let g = dr(s, u, d, f, h, r);
+		g = fr(g, h, t, n.name);
+		let _ = null, v = Infinity, y = 0;
+		if (g.length > 0) {
+			let e = g[0];
+			_ = e.seg, v = e.minDist, y = e.ratio;
+		}
+		let b;
+		if (_ && (b = pr(_, o, n, a), console.log("[drawWindow]", n.name, JSON.stringify(b)), !r.printOnly)) {
+			let e = _;
+			e.drawWindow ||= [], e.drawWindow.push(b);
+		}
+		_ ? i.push({
+			windowName: n.name,
+			windowCategory: n.category,
+			windowCenter: n.center,
+			wallSegment: _,
+			distance: v,
+			wallLengthRatio: y,
+			drawWindow: b
+		}) : console.warn(`[findWindowWall] ${n.name} 未找到匹配的墙线段`);
+	}
+	for (let e of i) {
+		let n = e.wallSegment, r = a.indexOf(n);
+		if (r === -1) continue;
+		let i = o[r];
+		!i || i.length <= 1 || mr(n, i, t);
+	}
+	return hr(a), i;
+}
+//#endregion
+//#region src/wall-window-matcher/entry.ts
+function _r(e, t, n) {
+	let r = {
+		printOnly: !1,
+		...n
+	}, i = gr(Array.isArray(t) ? t.filter((e) => e && e.category === "window") : [], e, r), { segments: a, sourceMap: o } = sr(e);
+	for (let e of i) if (e.drawWindow) {
+		let t = a.find((t) => Math.abs(t.start.x - e.wallSegment.start.x) < .01 && Math.abs(t.start.y - e.wallSegment.start.y) < .01 && Math.abs(t.end.x - e.wallSegment.end.x) < .01 && Math.abs(t.end.y - e.wallSegment.end.y) < .01);
+		t && (t.drawWindow ||= [], t.drawWindow.push(e.drawWindow));
+	}
+	return {
+		segments: a,
+		matches: i,
+		sourceMap: o
+	};
+}
+//#endregion
+export { z as classifySegments, Yn as computeLocalFloorZ, gr as findWindowWalls, ge as getAllGeometry, Oe as getBeamLine, Ae as getColLine, ke as getMainBeamLine, Kn as getMergeMeaning, I as getParallelism, re as getPointCloudMinMax, te as getPointCoverageOnQuad, j as isParallel, sr as mergeCollinearSegments, L as perpendicularInfo, _r as processData, ae as removeNoisePoints, O as segmentsIntersect2D, _e as updateStEdPoint, De as usegetBeamLine };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "rm-graphical-computing",
-  "version": "1.0.52",
+  "version": "1.0.54",
   "description": "Three.js wall segment processing utilities.",
   "main": "dist/index.cjs",
   "module": "dist/index.js",
@@ -11,7 +11,8 @@
     }
   },
   "files": [
-    "dist"
+    "dist",
+    "README.md"
   ],
   "scripts": {
     "dev": "vite",