rm-graphical-computing-node 1.0.60 → 1.0.61

package/dist/index.mjs

@@ -6014,7 +6014,7 @@ var getColLine = async (lines, runDataList, collectDataPath, pointCloudCluster =
       if (tmpLineData.checkResults.length != 1) continue;
       lines2.push(tmpLineData);
     }
-    await penetratingTask(lines2, trajectoryObj, collectDataPath);
+    await penetratingTask(lines2, trajectoryObj, collectDataPath, 0.5);
     for (let i = 0; i < lines2.length; i++) {
       let len = lines2[i].checkResults[0].allCenterPoints.length;
       const allCenterPoints = lines2[i].allCenterPoints;
@@ -6051,13 +6051,13 @@ var getColLine = async (lines, runDataList, collectDataPath, pointCloudCluster =
   }
   return colDatas;
 };
-var penetratingTask = async (finalLines, trajectoryObj, collectDataPath, type = "normal", diff = 0.01) => {
+var penetratingTask = async (finalLines, trajectoryObj, collectDataPath, offsetsNum = 0.5, type = "normal", diff = 0.01) => {
   if (!finalLines.length) return finalLines;
   for (let v2 = 0; v2 < finalLines.length; v2++) {
     for (let i = 0; i < finalLines[v2].checkResults.length; i++) {
       const offsets = [];
       for (let t2 = 0; t2 < finalLines[v2].checkResults[i].originalVertices.length; t2++)
-        offsets.push(0.5);
+        offsets.push(offsetsNum);
       finalLines[v2].checkResults[i].offsets = offsets;
     }
   }
@@ -8781,7 +8781,7 @@ var getMergeMeaning = (allProjectionResults, averagePz2, pointCloudCluster = nul
         }
       }
       let mostFrequentEntry = [...mapSortPoint.entries()].reduce(
-        (max, cur) => cur[1].num > max[1].num ? cur : max
+        (max2, cur) => cur[1].num > max2[1].num ? cur : max2
       );
       points = [];
       points = mostFrequentEntry[1].points.map((p) => [p.x, p.y]);
@@ -9370,7 +9370,7 @@ var getMergeFloorMeaning = (allProjectionResults) => {
         }
       }
       let mostFrequentEntry = [...mapSortPoint.entries()].reduce(
-        (max, cur) => cur[1].num > max[1].num ? cur : max
+        (max2, cur) => cur[1].num > max2[1].num ? cur : max2
       );
       points = [];
       points = mostFrequentEntry[1].points.map((p) => [p.x, p.y]);
@@ -10862,7 +10862,7 @@ function computeContour2(points) {
 
 // src/geometry/slabLine.mjs
 import * as THREE9 from "three";
-import { min } from "three/tsl";
+import { max, min } from "three/tsl";
 var getSlabData = (lines, runDataList, pointCloudCluster = null, getOblique = false) => {
   const flatSlabPoints = [];
   const obliqueSlabPoints = [];
@@ -10915,7 +10915,7 @@ var getFlatSlabData = (lines, runDataList, pointCloudCluster = null) => {
       }
     }
     let mostFrequentEntry = [...mapSortPoint.entries()].reduce(
-      (max, cur) => cur[1].num > max[1].num ? cur : max
+      (max2, cur) => cur[1].num > max2[1].num ? cur : max2
     );
     points = mostFrequentEntry[1].points.map((p) => new THREE9.Vector3(p.x, p.y, p.z));
     let newPoints = [];
@@ -11107,7 +11107,7 @@ var getObliqueSlabData = (lines, runDataList, pointCloudCluster = null) => {
       let mapSortPoint = /* @__PURE__ */ new Map();
       for (let c = 0; c < newPoints[x].length; c++) {
         let z = newPoints[x][c].z;
-        z = Math.floor(z * 10) / 10;
+        z = Math.floor(z * 1e3) / 1e3;
         if (mapSortPoint.has(z)) {
           const item = mapSortPoint.get(z);
           item.num += 1;
@@ -11124,9 +11124,8 @@ var getObliqueSlabData = (lines, runDataList, pointCloudCluster = null) => {
       let minZ = 0;
       let maxZ = 0;
       for (const [z, item] of mapSortPoint) {
-        if (item.num > numMax || item.num > 1800) {
-          const ret = getPointsMinAndMax(item.points);
-          minZ = ret.minZ;
+        if (item.num > numMax || item.num > 100) {
+          minZ = z;
           break;
         }
       }
@@ -11134,14 +11133,18 @@ var getObliqueSlabData = (lines, runDataList, pointCloudCluster = null) => {
         [...mapSortPoint].sort((a, b) => b[0] - a[0])
       );
       for (const [z, item] of mapSortPoint) {
-        if (item.num > numMax || item.num > 1800) {
-          const ret = getPointsMinAndMax(item.points);
-          maxZ = ret.maxZ;
+        if (item.num > numMax || item.num > 100) {
+          maxZ = z;
           break;
         }
       }
+      if (minZ == 0 || maxZ == 0) {
+        const ret = getPointsMinAndMax(newPoints[x]);
+        minZ = minZ == 0 ? ret.minZ : minZ;
+        maxZ = maxZ == 0 ? ret.maxZ : maxZ;
+      }
       slabDatas.push({
-        // points: newPoints[x],
+        points: newPoints[x],
         contour: path3,
         minZ,
         maxZ,

package/package.json

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