当前位置： 首页 > news >正文

正交视图三维重建2 笔记 2d线到3d线2 先生成3d线然后判断3d线在不在

news 2025/7/1 14:49:14

应该先连线再判断线在不在

       if(fx1==tx1&&tx1==tx2){
const A=[fx1, fy1, ty1];const Ahat=[fx1, fy1, ty2];drawlines(A[0], A[1], A[2], Ahat[0], Ahat[1], Ahat[2], lineId, type,2);}if(fx2==tx1&&tx1==tx2){ const B=[fx2, fy2, ty1];const Bhat=[fx2, fy2, ty2];drawlines(B[0], B[1], B[2], Bhat[0], Bhat[1], Bhat[2], lineId, type,3);}

还是得查存在

画线函数删前存档

for (const [fx1, fy1, fx2, fy2, lineId, type] of frontlinelist) {for (const [tx1, ty1, tx2, ty2, lineId2, type2] of toplinelist) {if (fx1==tx1&&fx2==tx2||fx1==tx2&&fx2==tx1||fx1==tx1&&tx1==tx2||fx2==tx1&&tx1==tx2){const A=[fx1, fy1, ty1];const Ahat=[fx1, fy1, ty2];const B=[fx2, fy2, ty1];const Bhat=[fx2, fy2, ty2];drawlines(A[0], A[1], A[2], Ahat[0], Ahat[1], Ahat[2], lineId, type,2);drawlines(B[0], B[1], B[2], Bhat[0], Bhat[1], Bhat[2], lineId, type,3);drawlines(A[0], A[1], A[2], B[0], B[1], B[2], lineId, type,4);drawlines(Ahat[0], Ahat[1], Ahat[2], Bhat[0], Bhat[1], Bhat[2], lineId, type,5);}}
}

先找点在线上，让后在线上的点全部连起来，跑起来贼快 

function isPointOnLineSegment(px: number,py: number,x1: number,y1: number,x2: number,y2: number
): boolean {const crossProduct = (py - y1) * (x2 - x1) - (px - x1) * (y2 - y1);if (Math.abs(crossProduct) > Number.EPSILON) return false;const dotProduct = (px - x1) * (x2 - x1) + (py - y1) * (y2 - y1);if (dotProduct < 0) return false;const squaredLength = (x2 - x1) ** 2 + (y2 - y1) ** 2;return dotProduct <= squaredLength;
}function makemap(lines: [number, number, number, number, number, number][],points: [number, number][],map: Map<string, boolean>
): void {for (const [x1, y1, x2, y2] of lines) {const relevantPoints: [number, number][] = [];for (const [px, py] of points) {if (isPointOnLineSegment(px, py, x1, y1, x2, y2)) {relevantPoints.push([px, py]);const key = `${px},${py},${px},${py}`;map.set(key, true);}}// 两两连接相关点for (let i = 0; i < relevantPoints.length; i++) {for (let j = i + 1; j < relevantPoints.length; j++) {const [p1x, p1y] = relevantPoints[i];const [p2x, p2y] = relevantPoints[j];const key1 = `${p1x},${p1y},${p2x},${p2y}`;const key2 = `${p2x},${p2y},${p1x},${p1y}`;map.set(key1, true);map.set(key2, true);}}}
}const frontmap=new Map<string,boolean>();
makemap(frontlinelist,frontpointlist,frontmap);
Logger.info(`frontmap completed with ${frontmap.size} pairs`);
const toppointmap=new Map<string,boolean>();
makemap(toplinelist,toppointlist,toppointmap);
Logger.info(`toppointmap completed with ${toppointmap.size} pairs`);for (const [x1, y1, z1] of point3dlist)
{
for (const [x2,y2 , z2] of point3dlist)
{ if( x1 === x2 && y1 === y2&&z1===z2)continue;if(frontmap.get(`${x1},${y1},${x2},${y2}`)){drawlines(x1, y1, z1, x2, y2, z2, 0, 0, 1);}}}

加入第二个视图判断 

 加入第3视图判断

.....................

rightpointmap 内容如下：
njsgcs_3drebuild2.ts:350
38.299999999999955,107.8,38.299999999999955,107.8: true
njsgcs_3drebuild2.ts:352
0,107.8,0,107.8: true
njsgcs_3drebuild2.ts:352
27.59999999999991,107.8,27.59999999999991,107.8: true
njsgcs_3drebuild2.ts:352
38.299999999999955,107.8,0,107.8: true
njsgcs_3drebuild2.ts:352
0,107.8,38.299999999999955,107.8: true
njsgcs_3drebuild2.ts:352
38.299999999999955,107.8,27.59999999999991,107.8: true
njsgcs_3drebuild2.ts:352
27.59999999999991,107.8,38.299999999999955,107.8: true
njsgcs_3drebuild2.ts:352
0,107.8,27.59999999999991,107.8: true
njsgcs_3drebuild2.ts:352
27.59999999999991,107.8,0,107.8: true
njsgcs_3drebuild2.ts:352
0,200,0,200: true
njsgcs_3drebuild2.ts:352
0,150,0,150: true
njsgcs_3drebuild2.ts:352
0,190,0,190: true
njsgcs_3drebuild2.ts:352
0,107.8,0,200: true
njsgcs_3drebuild2.ts:352
0,200,0,107.8: true
njsgcs_3drebuild2.ts:352
0,107.8,0,150: true
njsgcs_3drebuild2.ts:352
0,150,0,107.8: true
njsgcs_3drebuild2.ts:352
0,107.8,0,190: true
njsgcs_3drebuild2.ts:352

小数点问题

function makemap(lines: [number, number, number, number, number, number][],points: [number, number][],map: Map<string, boolean>
): void {for (const [x1, y1, x2, y2] of lines) {const relevantPoints: [number, number][] = [];for (const [px, py] of points) {if (isPointOnLineSegment(px, py, x1, y1, x2, y2)) {// 保留一位小数const pxFixed = parseFloat(px.toFixed(1));const pyFixed = parseFloat(py.toFixed(1));relevantPoints.push([pxFixed, pyFixed]);const key = `${pxFixed},${pyFixed},${pxFixed},${pyFixed}`;map.set(key, true);}}// 两两连接相关点for (let i = 0; i < relevantPoints.length; i++) {for (let j = i + 1; j < relevantPoints.length; j++) {const [p1x, p1y] = relevantPoints[i];const [p2x, p2y] = relevantPoints[j];// 保留一位小数const p1xFixed = parseFloat(p1x.toFixed(1));const p1yFixed = parseFloat(p1y.toFixed(1));const p2xFixed = parseFloat(p2x.toFixed(1));const p2yFixed = parseFloat(p2y.toFixed(1));const key1 = `${p1xFixed},${p1yFixed},${p2xFixed},${p2yFixed}`;const key2 = `${p2xFixed},${p2yFixed},${p1xFixed},${p1yFixed}`;map.set(key1, true);map.set(key2, true);}}}
}const frontmap=new Map<string,boolean>();
makemap(frontlinelist,frontpointlist,frontmap);
Logger.info(`frontmap completed with ${frontmap.size} pairs`);
const toppointmap=new Map<string,boolean>();
makemap(toplinelist,toppointlist,toppointmap);
Logger.info(`toppointmap completed with ${toppointmap.size} pairs`);
const rightpointmap=new Map<string,boolean>();
makemap(rightlinelist,rightpointlist,rightpointmap);
Logger.info(`rightpointmap completed with ${rightpointmap.size} pairs`);
Logger.info("rightpointmap 内容如下：");
for (const [key, value] of rightpointmap.entries()) {Logger.info(`${key}: ${value}`);
}
for (const [x1, y1, z1] of point3dlist) {for (const [x2, y2, z2] of point3dlist) {if (x1 === x2 && y1 === y2 && z1 === z2) continue;// 保留一位小数const x1f = parseFloat(x1.toFixed(1));const y1f = parseFloat(y1.toFixed(1));const z1f = parseFloat(z1.toFixed(1));const x2f = parseFloat(x2.toFixed(1));const y2f = parseFloat(y2.toFixed(1));const z2f = parseFloat(z2.toFixed(1));const frontKey = `${x1f},${y1f},${x2f},${y2f}`;const topKey = `${x1f},${z1f},${x2f},${z2f}`;const rightKey = `${z1f},${y1f},${z2f},${y2f}`;if (frontmap.get(frontKey) && toppointmap.get(topKey)&& rightpointmap.get(rightKey)) {drawlines(x1f, y1f, z1f, x2f, y2f, z2f, 0, 0, 1);}}
}

两种视图的投影效果都很好 

import { Logger, PubSub } from "chili-core";
import DxfParser, { IArcEntity, IEntity, ILineEntity } from 'dxf-parser';
class Cluster {lines: [number, number, number, number,number,number][];min_x: number;max_x: number;min_y: number;max_y: number;constructor(lines: [number, number, number, number,number,number][] = []) {this.lines = [...lines];this.min_x = Infinity;this.max_x = -Infinity;this.min_y = Infinity;this.max_y = -Infinity;if (lines.length > 0) {this.updateBounds();}}updateBounds(): void {this.min_x = Math.min(...this.lines.flatMap(line => [line[0], line[2]]));this.max_x = Math.max(...this.lines.flatMap(line => [line[0], line[2]]));this.min_y = Math.min(...this.lines.flatMap(line => [line[1], line[3]]));this.max_y = Math.max(...this.lines.flatMap(line => [line[1], line[3]]));}get lengthX(): number {return parseFloat((this.max_x - this.min_x).toFixed(1));}get lengthY(): number {return parseFloat((this.max_y - this.min_y).toFixed(1));}
}
function clusterLines(lines: [number, number, number, number,number,number][], expandDistance: number = 5): Cluster[] {const clusters: Cluster[] = [];const remainingLines = [...lines];while (remainingLines.length > 0) {const seed = remainingLines.shift()!;const currentCluster = new Cluster([seed]);currentCluster.updateBounds();let changed = true;while (changed) {changed = false;const expandedMinX = currentCluster.min_x - expandDistance;const expandedMaxX = currentCluster.max_x + expandDistance;const expandedMinY = currentCluster.min_y - expandDistance;const expandedMaxY = currentCluster.max_y + expandDistance;const toAdd: [number, number, number, number,number,number][] = [];for (const line of [...remainingLines]) {const [x1, y1, x2, y2,lineId,type] = line;const inBound =(x1 >= expandedMinX && x1 <= expandedMaxX && y1 >= expandedMinY && y1 <= expandedMaxY) ||(x2 >= expandedMinX && x2 <= expandedMaxX && y2 >= expandedMinY && y2 <= expandedMaxY);if (inBound) {toAdd.push(line);changed = true;}}for (const line of toAdd) {currentCluster.lines.push(line);remainingLines.splice(remainingLines.indexOf(line), 1);}currentCluster.updateBounds();}// 合并完全覆盖的聚类for (let i = 0; i < clusters.length; i++) {const cluster = clusters[i];if (currentCluster.min_x <= cluster.min_x &&currentCluster.min_y <= cluster.min_y &&currentCluster.max_x >= cluster.max_x &&currentCluster.max_y >= cluster.max_y) {currentCluster.lines.push(...cluster.lines);clusters.splice(i, 1);break;}}clusters.push(currentCluster);}return clusters;
}
export function rebuild3D2(document: Document) {const fileInput = document.createElement("input");fileInput.type = "file";fileInput.accept = ".dxf";fileInput.style.display = "none";fileInput.addEventListener("change", async (event) => {const target = event.target as HTMLInputElement;if (!target.files || target.files.length === 0) return;const file = target.files[0];Logger.info(`Selected file: ${file.name}`);try {const reader = new FileReader();reader.onload = () => {const dxfText = reader.result as string;const parser = new DxfParser();const dxf = parser.parseSync(dxfText);const inputlines: [number, number, number, number,number,number][] = [];
const lineMap = new Map<number, IEntity>(); 
let lineId = 0;if (dxf && dxf.entities) {dxf.entities.forEach(entity => {if (entity.type === 'LINE') {const lineEntity = entity as ILineEntity;const start = lineEntity.vertices[0];const end = lineEntity.vertices[1];if (start && end) {lineMap.set(lineId, entity);inputlines.push([start.x, start.y, end.x, end.y, lineId,0]);lineId++;}}else if (entity.type === 'Arc') {lineMap.set(lineId, entity);const arcEntity = entity as IArcEntity;const center = arcEntity.center;
const radius = arcEntity.radius;
const startAngle = arcEntity.startAngle;
const endAngle = arcEntity.endAngle;
// 计算起点坐标
const startX = center.x + radius * Math.cos(startAngle);
const startY = center.y + radius * Math.sin(startAngle);// 假设终点角度为 endAngle，则可以类似计算终点const endX = center.x + radius * Math.cos(endAngle);const endY = center.y + radius * Math.sin(endAngle);inputlines.push([startX, startY, endX, endY,lineId,1]);lineId++;}});}// 执行聚类const clusters = clusterLines(inputlines, 5);const { mostMinX, mostMinY } = getMostFrequentMinXY(clusters);const mostFrequentClusters = clusters.filter(cluster => {return cluster.min_x === mostMinX.value && cluster.min_y === mostMinY.value;
});
const topclusters = clusters.filter(cluster => {return cluster.min_x === mostMinX.value && cluster.min_y > mostMinY.value;
});
;
const rightclusters = clusters.filter(cluster => {return cluster.min_x > mostMinX.value && cluster.min_y === mostMinY.value;
});
const bottomclusters = clusters.filter(cluster => {return cluster.min_x === mostMinX.value && cluster.min_y < mostMinY.value;
});
const leftclusters = clusters.filter(cluster => {return cluster.min_x < mostMinX.value && cluster.min_y === mostMinY.value;
});const mostFrequentCluster= mostFrequentClusters[0];const topcluauster= topclusters[0];const rightcluster= rightclusters[0];const bottomcluster= bottomclusters[0];const leftcluster= leftclusters[0];const frontlinelist: [number, number, number,number, number, number][] = [];
const toplinelist: [number, number, number,number, number, number][] = [];
const rightlinelist: [number, number, number,number, number, number][] = [];const frontpointlist: [number, number][] = [];
const toppointlist: [number, number][] = [];
const rightpointlist: [number, number][] = [];
const clusterMinY = topcluauster.min_y;
const clusterMinx= rightcluster.min_x;const fseen = new Set<string>();
const tseen = new Set<string>();
const rseen = new Set<string>();
// 主处理逻辑
for (const [x1, y1, x2, y2,lineId,type] of mostFrequentCluster.lines) {frontlinelist.push([x1, y1, x2, y2,lineId,type]);addUniquePoint(x1, y1, frontpointlist, fseen);
addUniquePoint(x2, y2, frontpointlist, fseen);}
for (const [x1, y1, x2, y2,lineId,type] of topcluauster.lines) {toplinelist.push([x1, y1- clusterMinY, x2, y2- clusterMinY,lineId,type]);addUniquePoint(x1, y1- clusterMinY, toppointlist, tseen);
addUniquePoint(x2, y2- clusterMinY, toppointlist, tseen);}for (const [x1, y1, x2, y2,lineId,type] of rightcluster.lines) {rightlinelist.push([x1-clusterMinx, y1, x2-clusterMinx, y2,lineId,type]);addUniquePoint(x1-clusterMinx, y1, rightpointlist, rseen);addUniquePoint(x2-clusterMinx, y2, rightpointlist, rseen);}
Logger.info("2d线段和点收集完毕" )
Logger.info(frontlinelist)
Logger.info(`主视图有${frontlinelist.length}条线段`, `顶视图有${toplinelist.length}条线段`, `右视图有${rightlinelist.length}条线段`);
Logger.info(`主视图有${frontpointlist.length}个点`, `顶视图有${toppointlist.length}个点`, `右视图有${rightpointlist.length}个点`);function addUniquePoint(x: number,y: number,pointList: [number, number][],seen: Set<string>
): void {const key = `${x},${y}`;if (!seen.has(key)) {seen.add(key);pointList.push([x, y]);}
}const lines3d:[number,number,number,number,number,number,number,number,number][]=[]const seenLinePairs = new Set<string>(); // 用于记录已经添加过的 [lineId, lineId2] 对
function drawlines(x1:number, y1:number, z1:number , x2:number, y2:number, z2:number , lineId:number, type:number,color:number){if([x1, y1, z1].join(',') === [x2, y2, z2].join(','))return;const drawline2=[x1, y1, z1 , x2, y2,z2]const key2 = drawline2.map(v => v.toFixed(2)).join(',');if (!seenLinePairs.has(key2)) {seenLinePairs.add(key2);lines3d.push([x1, y1, z1, x2, y2, z2 , lineId, type,color]);}}
const point3dlist: [number, number, number][] = [];
const seen = new Set<string>(); // 用于去重for (const [fx1, fy1] of frontpointlist) {for (const [tx1, ty1] of toppointlist) {if (fx1 === tx1) {const key = `${fx1},${fy1},${ty1}`;if (!seen.has(key)) {seen.add(key);point3dlist.push([fx1, fy1, ty1]);}}}
}
Logger.info(`3d点生成完毕，个数${point3dlist.length}`)function isPointOnLineSegment(px: number,py: number,x1: number,y1: number,x2: number,y2: number
): boolean {const crossProduct = (py - y1) * (x2 - x1) - (px - x1) * (y2 - y1);if (Math.abs(crossProduct) > Number.EPSILON) return false;const dotProduct = (px - x1) * (x2 - x1) + (py - y1) * (y2 - y1);if (dotProduct < 0) return false;const squaredLength = (x2 - x1) ** 2 + (y2 - y1) ** 2;return dotProduct <= squaredLength;
}
function makemap(lines: [number, number, number, number, number, number][],points: [number, number][],map: Map<string, boolean>
): void {for (const [x1, y1, x2, y2] of lines) {const relevantPoints: [number, number][] = [];for (const [px, py] of points) {if (isPointOnLineSegment(px, py, x1, y1, x2, y2)) {// 保留一位小数const pxFixed = parseFloat(px.toFixed(1));const pyFixed = parseFloat(py.toFixed(1));relevantPoints.push([pxFixed, pyFixed]);const key = `${pxFixed},${pyFixed},${pxFixed},${pyFixed}`;map.set(key, true);}}// 两两连接相关点for (let i = 0; i < relevantPoints.length; i++) {for (let j = i + 1; j < relevantPoints.length; j++) {const [p1x, p1y] = relevantPoints[i];const [p2x, p2y] = relevantPoints[j];// 保留一位小数const p1xFixed = parseFloat(p1x.toFixed(1));const p1yFixed = parseFloat(p1y.toFixed(1));const p2xFixed = parseFloat(p2x.toFixed(1));const p2yFixed = parseFloat(p2y.toFixed(1));const key1 = `${p1xFixed},${p1yFixed},${p2xFixed},${p2yFixed}`;const key2 = `${p2xFixed},${p2yFixed},${p1xFixed},${p1yFixed}`;map.set(key1, true);map.set(key2, true);}}}
}const frontmap=new Map<string,boolean>();
makemap(frontlinelist,frontpointlist,frontmap);
Logger.info(`frontmap completed with ${frontmap.size} pairs`);
const toppointmap=new Map<string,boolean>();
makemap(toplinelist,toppointlist,toppointmap);
Logger.info(`toppointmap completed with ${toppointmap.size} pairs`);
const rightpointmap=new Map<string,boolean>();
makemap(rightlinelist,rightpointlist,rightpointmap);
Logger.info(`rightpointmap completed with ${rightpointmap.size} pairs`);
Logger.info("rightpointmap 内容如下：");
for (const [key, value] of rightpointmap.entries()) {Logger.info(`${key}: ${value}`);
}
for (const [x1, y1, z1] of point3dlist) {for (const [x2, y2, z2] of point3dlist) {if (x1 === x2 && y1 === y2 && z1 === z2) continue;// 保留一位小数const x1f = parseFloat(x1.toFixed(1));const y1f = parseFloat(y1.toFixed(1));const z1f = parseFloat(z1.toFixed(1));const x2f = parseFloat(x2.toFixed(1));const y2f = parseFloat(y2.toFixed(1));const z2f = parseFloat(z2.toFixed(1));const frontKey = `${x1f},${y1f},${x2f},${y2f}`;const topKey = `${x1f},${z1f},${x2f},${z2f}`;const rightKey = `${z1f},${y1f},${z2f},${y2f}`;if (frontmap.get(frontKey) && toppointmap.get(topKey)&& rightpointmap.get(rightKey)) {drawlines(x1f, y1f, z1f, x2f, y2f, z2f, 0, 0, 1);}}
}Logger.info(`lines3d completed with ${lines3d.length} lines3d`);lines3d.forEach(line => {PubSub.default.pub("njsgcs_makeline", line[0], line[1],  line[2], line[3], line[4], line[5], line[8]); })///// let i =0;// // 发送每个线段给 njsgcs_makeline// clusters.forEach(cluster => {//     i++;//     cluster.lines.forEach(line => {//         const [x1, y1, x2, y2] = line;//         PubSub.default.pub("njsgcs_makeline", x1, y1, 0, x2, y2, 0,i); // z=0 假设为俯视图//     });// });///Logger.info(`Clustering completed with ${clusters.length} clusters`);};reader.readAsText(file);} catch (error) {Logger.error("Error reading file:", error);}});fileInput.click();
}
function getMostFrequentMinXY(clusters: Cluster[]) {const minXCounts: Record<number, number> = {};const minYCounts: Record<number, number> = {};let maxXCount = 0, mostX = clusters[0]?.min_x;let maxYCount = 0, mostY = clusters[0]?.min_y;for (const cluster of clusters) {const x = cluster.min_x;const y = cluster.min_y;minXCounts[x] = (minXCounts[x] || 0) + 1;if (minXCounts[x] > maxXCount) {maxXCount = minXCounts[x];mostX = x;}minYCounts[y] = (minYCounts[y] || 0) + 1;if (minYCounts[y] > maxYCount) {maxYCount = minYCounts[y];mostY = y;}}return {mostMinX: { value: mostX, count: maxXCount },mostMinY: { value: mostY, count: maxYCount }};
}

接下来搞圆弧

当前效果

http://www.dtcms.com/a/263405.html

相关文章：

  • 推进自动驾驶车辆智能：基于深度学习和多模态LLM的交通标志识别与鲁棒车道检测
  • 告别复杂爬虫！Perplexity AI辅助Python网页抓取
  • 爬虫详解：Aipy打造自动抓取代理工具
  • Day113 切换Node.js版本、多数据源配置
  • RHCSA认证题目练习一（配置网络设置）
  • Centos7在yum当中遇到Could not resolve host: mirrorlist.centos.org解决方案
  • 高效读取文件中指定行段的两种方法
  • Golang 标准库errors用法
  • Golang快速开发框架——项目立项与系统配置读取组件viper（一）
  • 《如何在 Spring 中实现 MQ 消息的自动重连：监听与发送双通道策略》
  • Doc2X：破解RAG文档解析难题的核心引擎
  • 自由学习记录（65）
  • PO→DO→DTO→VO 和 DAO → DTO → VO
  • w-笔记：uni-app的H5平台和非H5平台的拍照识别功能：
  • 数据可视化：5 分钟读懂其核心价值与技术实践
  • PyTorch 中 nn.Linear() 参数详解与实战解析（gpt）
  • Python + Selenium 自动化爬取途牛动态网页
  • Qt Quick 与 QML（四）qml中的Delegate系列委托组件
  • 七天学会SpringCloud分布式微服务——05——OpenFeign
  • 基于时间策略+应用过滤的游戏防沉迷方案：技术实现与工具推荐
  • Python pandas-profiling 详解：一键生成数据分析报告的利器
  • 使用自定义注解完成redis缓存
  • Windows Excel文档办公工作数据整理小工具
  • SpringCloud系列（43）--搭建SpringCloud Config客户端
  • Install Ubuntu 24.04 System
  • SpringCloud系列（42）--搭建SpringCloud Config分布式配置总控中心（服务端）
  • ProPlus2024Retail 安装教程（详细步骤+激活方法）- 最新版安装包下载与使用指南
  • mysql运维语句
  • window显示驱动开发—在注册表中设置 DXGI 信息
  • SCAU期末笔记 - 操作系统 选填题