rm-graphical-computing-node 1.0.63 → 1.0.65

package/dist/index.mjs

@@ -11120,7 +11120,7 @@ var getObliqueSlabData = (lines, runDataList, pointCloudCluster = null) => {
       mapSortPoint = new Map(
         [...mapSortPoint.entries()].sort((a, b) => a[0] - b[0])
       );
-      let numMax = newPoints[x].length / 10;
+      let numMax = newPoints[x].length / 1e3;
       let minZ = 0;
       let maxZ = 0;
       for (const [z, item] of mapSortPoint) {
@@ -11844,6 +11844,59 @@ var getWindowData = (lines, pcdData, lineReader) => {
   lines.push(...tmpLines);
   return { lines, pcdData };
 };
+var checkWindowAndDoorIsTrue = async (lines, runDataList, collectDataPath, pointCloudCluster = null) => {
+  if (!lines.length)
+    return;
+  const windowLines = [];
+  for (let i = 0; i < lines.length; i++) {
+    const line2 = lines[i];
+    if (line2.drawWindow && line2.drawWindow.length || line2.drawDoorData && line2.drawDoorData.start) {
+      line2.saveExistSegments = true;
+      getOneLineCheckResults(line2, false);
+      line2.checkResults = line2.existSegments;
+      windowLines.push(line2);
+    }
+  }
+  let trajectoryObj = {};
+  for (let r = 0; r < runDataList.length; r++) {
+    trajectoryObj[r] = runDataList[r];
+  }
+  await penetratingTask(windowLines, trajectoryObj, collectDataPath, 1);
+  for (let i = 0; i < windowLines.length; i++) {
+    let len = 0;
+    for (let u4 = 0; u4 < windowLines[i].checkResults.length; u4++)
+      len = windowLines[i].checkResults[u4].allCenterPoints.length;
+    const allCenterPoints = windowLines[i].allCenterPoints;
+    let newPoints = [];
+    if (pointCloudCluster != null) {
+      let clusterResult = pointCloudCluster([allCenterPoints], {
+        tolerance: 0.2,
+        minClusterSize: 30,
+        maxClusterSize: 1e7,
+        threadCount: 1
+      });
+      if (clusterResult.length > 0) {
+        let maxNum = 0;
+        for (const cluster of clusterResult[0]) {
+          if (cluster.length < 50) continue;
+          const newOriginalPoints = cluster.map((i2) => allCenterPoints[i2]);
+          if (maxNum < newOriginalPoints.length) {
+            maxNum = newOriginalPoints.length;
+            newPoints = newOriginalPoints;
+          }
+        }
+      } else
+        newPoints = allCenterPoints;
+    } else
+      newPoints = allCenterPoints;
+    let retNum = newPoints.length;
+    let ps = retNum / len * 100;
+    if (ps < 60) {
+      windowLines[i].isRebuild = true;
+    }
+  }
+  return lines;
+};
 
 // src/wall-window-matcher/utils.ts
 function dist2D(a, b) {
@@ -18026,6 +18079,7 @@ export {
   attachWindows,
   calcAngle3 as calcAngle,
   checkBeamIsReasonable,
+  checkWindowAndDoorIsTrue,
   classifyWallByPointCloudPCA,
   processPipeline2 as classifyWallShapes,
   computeContour2 as computeContour,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "rm-graphical-computing-node",
-  "version": "1.0.63",
+  "version": "1.0.65",
   "description": "墙体/梁线/点云语义计算库（依赖 Python 与 three.js）",
   "type": "module",
   "main": "dist/index.mjs",