rm-graphical-computing-node 1.0.83 → 1.0.84

package/dist/index.mjs

@@ -12487,6 +12487,7 @@ import { randomUUID as randomUUID2 } from "crypto";
 var getDoorPcdData = (lines, pcdData) => {
   if (!lines || !lines.length || !pcdData || !pcdData.length)
     return lines;
+  const pcdToLineDist = 0.1;
   for (let i = 0; i < pcdData.length; i++) {
     const pcd = pcdData[i];
     if (pcd.category != "door" || pcd.isFindBeam)
@@ -12524,7 +12525,7 @@ var getDoorPcdData = (lines, pcdData) => {
       let ptEnd2 = getPt3(line3.end);
       ptStart2.z = ptEnd2.z = ptMid1.z;
       let classify = classifySegments(ptMid1, ptMid2, ptStart2, ptEnd2);
-      if (classify.type == "collinear_overlap" && classify.maxPerpendicularDistance < 0.3) {
+      if (classify.type == "collinear_overlap" && classify.maxPerpendicularDistance < pcdToLineDist) {
         eligibilityLines.push(line3);
         eligibilityLinesIndexs.push(j);
       }
@@ -12556,8 +12557,8 @@ var getDoorPcdData = (lines, pcdData) => {
     const line2 = tmpLines[maxIndex];
     let ptStart = getPt3(line2.start);
     let ptEnd = getPt3(line2.end);
-    let intersect1 = segmentsIntersect2D(ptStart, ptEnd, ptShortSt1, ptShortEd1, 0.3);
-    let intersect2 = segmentsIntersect2D(ptStart, ptEnd, ptShortSt2, ptShortEd2, 0.3);
+    let intersect1 = segmentsIntersect2D(ptStart, ptEnd, ptShortSt1, ptShortEd1, pcdToLineDist);
+    let intersect2 = segmentsIntersect2D(ptStart, ptEnd, ptShortSt2, ptShortEd2, pcdToLineDist);
     if (intersect1 != null && intersect2 != null) {
       if (line2.mergeIndexs) {
         let tmpIndex = [];

package/package.json

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