build-dxf 0.0.8 → 0.0.10

package/src/{plugins/ModelDataPlugin/index.js → build.js}

@@ -2,6 +2,7 @@ import * as THREE from "three";
 import { EventDispatcher as EventDispatcher$1 } from "three";
 import ClipperLib from "clipper-lib";
 import Drawing from "dxf-writer";
+import { OBJExporter } from "three/examples/jsm/exporters/OBJExporter.js";
 function uuid() {
   return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(c) {
     var r = Math.random() * 16 | 0, v = c == "x" ? r : r & 3 | 8;
@@ -31,6 +32,83 @@ class Component extends EventDispatcher {
   destroy() {
   }
 }
+class ComponentManager extends EventDispatcher {
+  static EventType = {
+    ADD_COMPONENT: "addComponent"
+  };
+  components = [];
+  /**
+   * 添加组件
+   * @param component 
+   */
+  addComponent(component) {
+    if (component) {
+      this.components.push(component);
+      this.dispatchEvent({
+        type: "addComponent",
+        component
+      });
+      component.dispatchEvent({
+        type: "addFromParent",
+        parent: this
+      });
+    }
+    return this;
+  }
+  /**
+   * 移除组件
+   * @param component 
+   */
+  removeComponent(component) {
+    if (component instanceof Component) {
+      const index2 = this.components.indexOf(component);
+      if (index2 > -1) {
+        this.components.splice(index2, 1);
+        this.dispatchEvent({
+          type: "removeComponent",
+          component
+        });
+        component.dispatchEvent({
+          type: "removeFromParent",
+          parent: this
+        });
+      }
+    }
+  }
+  /**
+   * 查找符合条件的第一个组件
+   * @param callBack 
+   */
+  findComponent(predicate) {
+    for (let i = 0; i < this.components.length; i++) {
+      const component = this.components[i];
+      if (predicate(component, i)) return component;
+    }
+  }
+  /**
+   * 查找所有符合条件的组件
+   * @param callBack 
+   */
+  findComponents(predicate) {
+    return this.components.find(predicate);
+  }
+  /**
+   * 
+   * @param type 
+   */
+  findComponentByType(type) {
+    const component = this.findComponent((c) => c instanceof type);
+    return component ? component : null;
+  }
+  /**
+   * 
+   * @param type 
+   */
+  findComponentByName(name) {
+    const component = this.findComponent((c) => c.constructor.name === name);
+    return component ? component : null;
+  }
+}
 class Point {
   x;
   y;
@@ -981,6 +1059,704 @@ class Variable extends Component {
     if (key in this) return this[key];
   }
 }
+class Rectangle {
+  points;
+  get path() {
+    return this.points.flatMap((p, i) => {
+      const np = this.points[(i + 1) % this.points.length];
+      return [p.x, p.y, 0, np.x, np.y, 0];
+    });
+  }
+  constructor(points) {
+    if (points.length !== 4) {
+      throw new Error("Rectangle must be defined by exactly 4 points");
+    }
+    this.points = points;
+  }
+  /**
+   * 判断线段是否与矩形相交
+   * @param line 线段
+   * @returns 是否与矩形相交
+   */
+  intersectLineSegment(line) {
+    if (line.points.length !== 2) {
+      throw new Error("LineSegment must have exactly 2 points");
+    }
+    const [p1, p2] = line.points;
+    const doIntersect = (l1p1, l1p2, l2p1, l2p2) => {
+      const orientation = (p, q, r) => {
+        const val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
+        if (val === 0) return 0;
+        return val > 0 ? 1 : 2;
+      };
+      const onSegment = (p, q, r) => {
+        return Math.min(p.x, r.x) <= q.x && q.x <= Math.max(p.x, r.x) && Math.min(p.y, r.y) <= q.y && q.y <= Math.max(p.y, r.y);
+      };
+      const o1 = orientation(l1p1, l1p2, l2p1);
+      const o2 = orientation(l1p1, l1p2, l2p2);
+      const o3 = orientation(l2p1, l2p2, l1p1);
+      const o4 = orientation(l2p1, l2p2, l1p2);
+      if (o1 !== o2 && o3 !== o4) return true;
+      if (o1 === 0 && onSegment(l1p1, l2p1, l1p2)) return true;
+      if (o2 === 0 && onSegment(l1p1, l2p2, l1p2)) return true;
+      if (o3 === 0 && onSegment(l2p1, l1p1, l2p2)) return true;
+      if (o4 === 0 && onSegment(l2p1, l1p2, l2p2)) return true;
+      return false;
+    };
+    for (let i = 0; i < 4; i++) {
+      const rectP1 = this.points[i];
+      const rectP2 = this.points[(i + 1) % 4];
+      if (doIntersect(p1, p2, rectP1, rectP2)) {
+        return true;
+      }
+    }
+    if (this.containsLineSegment(line)) {
+      return true;
+    }
+    return false;
+  }
+  /**
+   * 判断线段是否完全位于矩形内部
+   * @param line 线段
+   * @returns 是否完全在矩形内部
+   */
+  containsLineSegment(line) {
+    if (line.points.length !== 2) {
+      throw new Error("LineSegment must have exactly 2 points");
+    }
+    const isPointInRectangle = (point) => {
+      let sign = 0;
+      for (let i = 0; i < 4; i++) {
+        const p1 = this.points[i];
+        const p2 = this.points[(i + 1) % 4];
+        const edge = { x: p2.x - p1.x, y: p2.y - p1.y };
+        const toPoint = { x: point.x - p1.x, y: point.y - p1.y };
+        const cross = edge.x * toPoint.y - edge.y * toPoint.x;
+        if (cross === 0) {
+          const t = edge.x !== 0 ? (point.x - p1.x) / edge.x : (point.y - p1.y) / edge.y;
+          if (t >= 0 && t <= 1) return true;
+        } else {
+          const currentSign = cross > 0 ? 1 : -1;
+          if (sign === 0) sign = currentSign;
+          if (sign !== currentSign) return false;
+        }
+      }
+      return true;
+    };
+    return isPointInRectangle(line.points[0]) && isPointInRectangle(line.points[1]);
+  }
+  /**
+   * 判断点是否完全位于矩形内部
+   * @param point 
+   */
+  containsPoint(point) {
+    let positiveCount = 0;
+    let negativeCount = 0;
+    for (let i = 0; i < 4; i++) {
+      const p1 = this.points[i];
+      const p2 = this.points[(i + 1) % 4];
+      const cross = (p2.x - p1.x) * (point.y - p1.y) - (p2.y - p1.y) * (point.x - p1.x);
+      if (cross > 0) positiveCount++;
+      else if (cross < 0) negativeCount++;
+      else return false;
+    }
+    return positiveCount === 4 || negativeCount === 4;
+  }
+  /**
+   * 
+   * @returns 
+   */
+  toBox() {
+    let minX = Infinity, maxX = -Infinity, minY = Infinity, maxY = -Infinity;
+    this.points.forEach((p) => {
+      maxX = Math.max(p.x, maxX);
+      minX = Math.min(p.x, minX);
+      maxY = Math.max(p.x, maxY);
+      minY = Math.min(p.x, minY);
+    });
+    return new Box2(minX, maxX, minY, maxY);
+  }
+  /**
+   * 
+   * @param line 
+   * @param width 
+   * @returns 
+   */
+  static fromByLineSegment(line, width = 0.1, horizontal = false, hScale = 0.5) {
+    const p1 = line.points[0], p2 = line.points[1], normal = p2.normal(p1), pDirect = horizontal ? p2.direction(p1).mutiplyScalar(width * hScale) : Point.zero(), nDirect = horizontal ? p1.direction(p2).mutiplyScalar(width * hScale) : Point.zero();
+    const offsetX = normal.x * width * 0.5;
+    const offsetY = normal.y * width * 0.5;
+    return new Rectangle([
+      new Point(p1.x + offsetX, p1.y + offsetY).add(nDirect),
+      new Point(p2.x + offsetX, p2.y + offsetY).add(pDirect),
+      new Point(p2.x - offsetX, p2.y - offsetY).add(pDirect),
+      new Point(p1.x - offsetX, p1.y - offsetY).add(nDirect)
+    ]);
+  }
+}
+class Quadtree {
+  bounds;
+  // 包围盒
+  capacity;
+  // 节点容量
+  maxDepth;
+  // 最大深度
+  depth;
+  // 当前深度
+  isLeaf = true;
+  // 是否为叶子节点
+  children = null;
+  // 子节点数组
+  nodes = [];
+  // 存储的节点
+  color = [Math.random(), Math.random(), Math.random()];
+  // 颜色
+  constructor(bounds, capacity = 8, maxDepth = 10, depth = 1) {
+    this.bounds = bounds;
+    this.capacity = capacity;
+    this.depth = depth;
+    this.maxDepth = maxDepth;
+  }
+  /**
+   * 插入线段节点
+   * @param node 线段节点
+   */
+  insert(node) {
+    if (!this.isLeaf) {
+      const quadrant = this.getQuadrant(node.line);
+      if (quadrant !== -1) {
+        this.children[quadrant].insert(node);
+        return;
+      }
+    }
+    this.nodes.push(node);
+    if (this.isLeaf && this.nodes.length > this.capacity && this.depth < this.maxDepth) {
+      this.subdivide();
+      const nodes = this.nodes;
+      this.nodes = [];
+      for (const n of nodes) {
+        const quadrant = this.getQuadrant(n.line);
+        if (quadrant !== -1) {
+          this.children[quadrant].insert(n);
+        } else {
+          this.nodes.push(n);
+        }
+      }
+    }
+  }
+  /**
+   * 获取线段所属的象限
+   * @param line 线段
+   * @returns 象限索引（0:西北,1:东北,2:西南,3:东南）或-1（跨多个象限）
+   */
+  getQuadrant(line) {
+    const intersectsNW = this.children[0].bounds.intersectLineSegment(line);
+    const intersectsNE = this.children[1].bounds.intersectLineSegment(line);
+    const intersectsSW = this.children[2].bounds.intersectLineSegment(line);
+    const intersectsSE = this.children[3].bounds.intersectLineSegment(line);
+    let count = 0;
+    let quadrant = -1;
+    if (intersectsNW) {
+      count++;
+      quadrant = 0;
+    }
+    if (intersectsNE) {
+      count++;
+      quadrant = 1;
+    }
+    if (intersectsSW) {
+      count++;
+      quadrant = 2;
+    }
+    if (intersectsSE) {
+      count++;
+      quadrant = 3;
+    }
+    if (count === 1) return quadrant;
+    return -1;
+  }
+  /**
+   * 细分当前节点为四个子节点
+   */
+  subdivide() {
+    if (!this.isLeaf) return;
+    this.isLeaf = false;
+    this.children = [];
+    const midX = (this.bounds.minX + this.bounds.maxX) / 2;
+    const midY = (this.bounds.minY + this.bounds.maxY) / 2;
+    this.children[0] = new Quadtree(
+      new Box2(this.bounds.minX, midX, this.bounds.minY, midY),
+      this.capacity,
+      this.maxDepth,
+      this.depth + 1
+    );
+    this.children[1] = new Quadtree(
+      new Box2(midX, this.bounds.maxX, this.bounds.minY, midY),
+      this.capacity,
+      this.maxDepth,
+      this.depth + 1
+    );
+    this.children[2] = new Quadtree(
+      new Box2(this.bounds.minX, midX, midY, this.bounds.maxY),
+      this.capacity,
+      this.maxDepth,
+      this.depth + 1
+    );
+    this.children[3] = new Quadtree(
+      new Box2(midX, this.bounds.maxX, midY, this.bounds.maxY),
+      this.capacity,
+      this.maxDepth,
+      this.depth + 1
+    );
+  }
+  /**
+   * 查询与包围盒相交的线段节点
+   * @param box2 包围盒
+   * @returns 相交的节点数组
+   */
+  queryBox(box2) {
+    const result = [];
+    if (!this.bounds.intersectBox(box2)) {
+      return result;
+    }
+    for (const node of this.nodes) {
+      if (box2.intersectLineSegment(node.line)) {
+        result.push(node);
+      }
+    }
+    if (!this.isLeaf) {
+      for (const child of this.children) {
+        result.push(...child.queryBox(box2));
+      }
+    }
+    return result;
+  }
+  /**
+   * 查询与圆形区域相交的线段节点
+   * @param pos 圆心
+   * @param radius 半径
+   * @returns 相交的节点数组
+   */
+  queryCircle(pos, radius) {
+    const result = [];
+    const circleBox = new Box2(
+      pos.x - radius,
+      pos.x + radius,
+      pos.y - radius,
+      pos.y + radius
+    );
+    if (!this.bounds.intersectBox(circleBox)) {
+      return result;
+    }
+    for (const node of this.nodes) {
+      const [p1, p2] = node.line.points;
+      const dx = p2.x - p1.x;
+      const dy = p2.y - p1.y;
+      const l2 = dx * dx + dy * dy;
+      let t = ((pos.x - p1.x) * dx + (pos.y - p1.y) * dy) / l2;
+      t = Math.max(0, Math.min(1, t));
+      const closestX = p1.x + t * dx;
+      const closestY = p1.y + t * dy;
+      const distance = pos.distance(new Point(closestX, closestY));
+      if (distance <= radius) {
+        result.push(node);
+      }
+    }
+    if (!this.isLeaf) {
+      for (const child of this.children) {
+        result.push(...child.queryCircle(pos, radius));
+      }
+    }
+    return result;
+  }
+  /**
+   * 查询与矩形相交的线段节点
+   * @param rectangle 矩形
+   * @returns 相交的节点数组
+   */
+  queryRect(rectangle) {
+    const result = [];
+    if (!this.bounds.intersectRectangle(rectangle)) {
+      return result;
+    }
+    for (const node of this.nodes) {
+      if (rectangle.intersectLineSegment(node.line)) {
+        result.push(node);
+      }
+    }
+    if (!this.isLeaf) {
+      for (const child of this.children) {
+        result.push(...child.queryRect(rectangle));
+      }
+    }
+    return result;
+  }
+  /**
+   * 包围盒转换为数组
+   * @param array 
+   * @param colors 
+   * @returns 
+   */
+  boundsToArray(array = [], colors, recursion = true) {
+    if (!this.isLeaf && recursion) {
+      this.children?.forEach((child) => child.boundsToArray(array, colors));
+    }
+    array.push(...this.bounds.points.flatMap((p, i, array2) => {
+      const np = array2[(i + 1) % array2.length];
+      colors?.push(...this.color);
+      colors?.push(...this.color);
+      return [p.x, p.y, 0, np.x, np.y, 0];
+    }));
+    return array;
+  }
+}
+class PointVirtualGrid {
+  map = /* @__PURE__ */ new Map();
+  gridSize;
+  constructor(gridSize = 2) {
+    this.gridSize = gridSize;
+  }
+  /**
+   * 插入
+   * @param point 
+   * @param userData 
+   */
+  insert(point, userData) {
+    if (!point || isNaN(point.x) || isNaN(point.y)) {
+      throw new Error("无效的点坐标");
+    }
+    const id = this.getGridId(point);
+    if (!this.map.has(id)) this.map.set(id, /* @__PURE__ */ new Set());
+    const set = this.map.get(id);
+    set?.add({ point, userData });
+  }
+  /**
+   * 批量加入
+   * @param points 
+   */
+  insertBatch(points) {
+    for (const { point, userData } of points) {
+      this.insert(point, userData);
+    }
+  }
+  /**
+   * 获取通过坐标，获取唯一网格索引
+   * @param point 
+   * @returns 
+   */
+  getGridId(point) {
+    const i = Math.ceil(point.x / this.gridSize), j = Math.ceil(point.y / this.gridSize);
+    return `${i}.${j}`;
+  }
+  /**
+   * 
+   * @param gridId 
+   * @returns 
+   */
+  decodeGridId(gridId) {
+    const [i, j] = gridId.split(".").map(Number);
+    return new Point(i, j);
+  }
+  /**
+   * 查询与矩形相交的点
+   * @param rectangle 矩形
+   * @returns 相交的节点数组
+   */
+  queryRect(rectangle) {
+    const box2 = rectangle.toBox();
+    const minI = Math.ceil(box2.minX / this.gridSize), maxI = Math.ceil(box2.maxX / this.gridSize), minJ = Math.ceil(box2.minY / this.gridSize), maxJ = Math.ceil(box2.maxY / this.gridSize);
+    for (let i = minI; i <= maxI; i++) {
+      for (let j = minJ; j <= maxJ; j++) {
+        const id = `${i}.${j}`;
+        if (!this.map.has(id)) continue;
+        const set = this.map.get(id);
+        set?.forEach((item) => {
+          if (rectangle.containsPoint(item.point)) ;
+        });
+      }
+    }
+  }
+  /**
+   * 查询与圆形区域相交的点
+   * @param pos 圆心
+   * @param radius 半径
+   * @returns 相交的节点数组
+   */
+  queryCircle(pos, radius) {
+    const box2 = new Box2(pos.x - radius, pos.x + radius, pos.y - radius, pos.y + radius);
+    const minI = Math.ceil(box2.minX / this.gridSize), maxI = Math.ceil(box2.maxX / this.gridSize), minJ = Math.ceil(box2.minY / this.gridSize), maxJ = Math.ceil(box2.maxY / this.gridSize), list = [];
+    for (let i = minI; i <= maxI; i++) {
+      for (let j = minJ; j <= maxJ; j++) {
+        const id = `${i}.${j}`;
+        if (!this.map.has(id)) continue;
+        const set = this.map.get(id);
+        set?.forEach((item) => {
+          if (pos.distance(item.point) <= radius) list.push(item);
+        });
+      }
+    }
+    return list;
+  }
+  /**
+   * 查询与包围盒相交的点
+   * @param box2 包围盒
+   * @returns 相交的节点数组
+   */
+  queryBox(box2) {
+    const minI = Math.ceil(box2.minX / this.gridSize), maxI = Math.ceil(box2.maxX / this.gridSize), minJ = Math.ceil(box2.minY / this.gridSize), maxJ = Math.ceil(box2.maxY / this.gridSize), list = [];
+    for (let i = minI; i <= maxI; i++) {
+      for (let j = minJ; j <= maxJ; j++) {
+        const id = `${i}.${j}`;
+        if (!this.map.has(id)) continue;
+        const set = this.map.get(id);
+        set?.forEach((item) => {
+          if (box2.containsPoint(item.point)) list.push(item);
+        });
+      }
+    }
+    return list;
+  }
+  /**
+   * 查找相同点
+   * @param point 
+   */
+  queryPoint(point) {
+    const id = this.getGridId(point), list = [];
+    if (this.map.has(id)) {
+      const set = this.map.get(id);
+      set?.forEach((item) => {
+        if (point.equal(item.point)) list.push(item);
+      });
+    }
+    return list;
+  }
+}
+class LineAnalysis extends Component {
+  Dxf = null;
+  Variable = null;
+  lineSegmentList = [];
+  container = new THREE.Group();
+  // 误差角度
+  errorAngle = 4;
+  width = 0.4;
+  /**
+   * 
+   * @param parent 
+   */
+  onAddFromParent(parent) {
+    this.Dxf = parent.findComponentByName("Dxf");
+    this.Variable = this.parent?.findComponentByName("Variable");
+    this.Dxf.addEventListener("setDta", this.lineAnalysis.bind(this));
+    this.Dxf.addEventListener("lineOffset", this.duplicatePointFiltering.bind(this));
+  }
+  /**
+   * 去除路径上重复的点
+   * @description 判断方向向量，一个连续的方向上，只应该出现两个点
+   */
+  duplicatePointFiltering() {
+    const dxf = this.Dxf;
+    dxf.wallsGroup = dxf.wallsGroup.map((points) => {
+      const filterPoints = [];
+      points.forEach((point, index2) => {
+        if (index2 < 1 || points.length - 1 === index2) return filterPoints.push(point);
+        const preP = points[index2 - 1], nextP = points[index2 + 1], direct1 = point.direction(preP), direct2 = nextP.direction(point), angle = direct1.angleBetween(direct2) / (Math.PI / 180);
+        if (angle > 0.02 && angle < 180 - 0.02) filterPoints.push(point);
+      });
+      points = [filterPoints[0]];
+      for (let i = 1; i < filterPoints.length; i++) {
+        const point = filterPoints[i];
+        const nextP = filterPoints[i - 1];
+        if (nextP.distance(point) < dxf.width * 0.5) ;
+        points.push(point);
+      }
+      return points;
+    });
+    dxf.wallsGroup = dxf.wallsGroup.filter((i) => i.length >= 4);
+  }
+  /**
+   * 
+   * @param p1 
+   * @param p2 
+   * @param width 
+   * @returns 
+   */
+  expandLineSegment(p1, p2, width = 0.1) {
+    const normal = p2.normal(p1);
+    const pDirect = p2.direction(p1).mutiplyScalar(width * 0.5);
+    const nDirect = p1.direction(p2).mutiplyScalar(width * 0.5);
+    const offsetX = normal.x * width * 0.5;
+    const offsetY = normal.y * width * 0.5;
+    return {
+      points: [
+        // 第一条线
+        new Point(p1.x + offsetX, p1.y + offsetY).add(nDirect),
+        new Point(p2.x + offsetX, p2.y + offsetY).add(pDirect),
+        // 第二条线
+        new Point(p1.x - offsetX, p1.y - offsetY).add(nDirect),
+        new Point(p2.x - offsetX, p2.y - offsetY).add(pDirect)
+      ],
+      indices: [0, 1, 1, 3, 3, 2, 2, 0],
+      rectIndices: [0, 1, 3, 2, 0]
+    };
+  }
+  appendLineSegmentList = [];
+  /**
+   * 追加数据
+   * @param p1 
+   * @param p2 
+   */
+  addData(p1, p2) {
+    const dxf = this.Dxf;
+    dxf.data.push([p1.clone(), p2.clone(), [], false, dxf.data.length]);
+    this.appendLineSegmentList.push(new LineSegment(p1.clone(), p2.clone()));
+  }
+  /** 结果分析创建矩形
+   * @param result 
+   */
+  createRectangle(result) {
+    const dxf = this.Dxf;
+    const project0 = result.project, project1 = result.project2;
+    this.addData(project0.points[0], project1.points[0]);
+    this.addData(project0.points[1], project1.points[1]);
+    const leftHeight = project0.points[0].distance(project1.points[0]), rightHeight = project0.points[1].distance(project1.points[1]), count = Math.ceil(Math.max(leftHeight, rightHeight) / dxf.width), leftFragment = leftHeight / count, rightFragment = rightHeight / count, leftDirection = project1.points[0].direction(project0.points[0]), rightDirection = project1.points[1].direction(project0.points[1]), leftP = project0.points[0].clone(), rightP = project0.points[1].clone(), direction = rightP.direction(leftP);
+    direction.multiplyScalar(dxf.width * 0.5);
+    const _leftP = leftP.clone().add(direction), _rightP = rightP.clone().add(direction.multiplyScalar(-1)), d1 = leftP.direction(rightP), d2 = _leftP.direction(_rightP);
+    if (d1.x > 0 && d2.x < 0 || d1.x < 0 && d2.x > 0 || d1.y > 0 && d2.y < 0 || d1.y < 0 && d2.y > 0) return;
+    leftP.set(_leftP.x, _leftP.y);
+    rightP.set(_rightP.x, _rightP.y);
+    for (let i = 1; i < count; i++) {
+      const left = leftDirection.clone().multiplyScalar(leftFragment * i), right = rightDirection.clone().multiplyScalar(rightFragment * i), p1 = leftP.clone().add(left), p2 = rightP.clone().add(right);
+      this.addData(p1, p2);
+    }
+  }
+  pointVirtualGrid = new PointVirtualGrid();
+  /**
+   * 构建点的虚拟网格索引
+   */
+  buildVirtualGrid() {
+    const dxf = this.Dxf;
+    const pointVirtualGrid = new PointVirtualGrid();
+    dxf.originalData.forEach((d, index2) => {
+      const [p1, p2] = [Point.from(d.start), Point.from(d.end)];
+      pointVirtualGrid.insert(p1, { index: index2, type: "start" });
+      pointVirtualGrid.insert(p2, { index: index2, type: "end" });
+    });
+    this.pointVirtualGrid = pointVirtualGrid;
+  }
+  quadtree;
+  /**
+   * 构建线段四叉树，快速查找，
+   */
+  buildQuadtree() {
+    const dxf = this.Dxf;
+    const lineSegmentList = [];
+    this.quadtree = new Quadtree(dxf.originalBox, 2);
+    dxf.lineSegments.forEach((lineSegment) => {
+      if (lineSegment.userData?.isDoor) return;
+      this.quadtree?.insert({
+        line: lineSegment,
+        userData: lineSegmentList.length
+      });
+      lineSegmentList.push(lineSegment);
+    });
+    this.lineSegmentList = lineSegmentList;
+  }
+  resultList = [];
+  /** 线段分析
+   * @description 判断两条线段距离是否较短且趋近平行，然后查找两条线段的重合部分的投影线，以此判断两根线是否需要合并
+   * @param data 
+   */
+  lineAnalysis() {
+    this.buildQuadtree();
+    this.buildVirtualGrid();
+    const quadtree = this.quadtree;
+    const lineSegmentList = this.lineSegmentList;
+    const visited = /* @__PURE__ */ new Set(), resultList = [];
+    lineSegmentList.forEach((_0, i) => {
+      const sourceLineSegment = lineSegmentList[i], rectangle = Rectangle.fromByLineSegment(sourceLineSegment, this.width * 2, false, -0.01), ids = quadtree.queryRect(rectangle).map((i2) => i2.userData).filter((index2) => index2 !== i);
+      ids.forEach((id) => {
+        try {
+          if (visited.has(`${i}-${id}`) || visited.has(`${id}-${i}`)) return;
+          const res = this.projectionAnalysis(id, i, sourceLineSegment, lineSegmentList);
+          if (res) resultList.push(res);
+          visited.add(`${i}-${id}`);
+        } catch (error) {
+        }
+      });
+    });
+    this.appendLineSegmentList.length = 0;
+    resultList.forEach(this.createRectangle.bind(this));
+    this.resultList = [];
+  }
+  /** 线段投影分析
+   * @param index 
+   * @param sourceLineSegment 
+   * @param lineSegmentList 
+   * @returns 
+   */
+  projectionAnalysis(index2, sourceIndex, sourceLineSegment, lineSegmentList) {
+    const temLineSegment = lineSegmentList[index2], direct = sourceLineSegment.direction(), temDirect = temLineSegment.direction(), angle = direct.angleBetween(temDirect) / (Math.PI / 180);
+    if (angle < this.errorAngle || angle > 180 - this.errorAngle) {
+      let data;
+      const p1 = temLineSegment.projectLineSegment(sourceLineSegment), p2 = sourceLineSegment.projectLineSegment(temLineSegment), d1 = p1.direction(), d2 = p2.direction();
+      if (d1.x > 0 && d2.x < 0 || d1.x < 0 && d2.x > 0 || d1.y > 0 && d2.y < 0 || d1.y < 0 && d2.y > 0) {
+        p1.points = [p1.points[1], p1.points[0]];
+      }
+      if (p1.getLength() > p2.getLength()) {
+        data = {
+          target: temLineSegment,
+          targetIndex: index2,
+          source: sourceLineSegment,
+          sourceIndex,
+          project: p1,
+          project2: p2
+        };
+      } else {
+        data = {
+          target: sourceLineSegment,
+          targetIndex: sourceIndex,
+          source: temLineSegment,
+          sourceIndex: index2,
+          project: p2,
+          project2: p1
+        };
+      }
+      if (!data || data.project.getLength() < 0.01) return;
+      return data;
+    }
+  }
+}
+class DxfSystem extends ComponentManager {
+  Dxf;
+  Variable;
+  wallWidth;
+  environment;
+  /** 构造函数
+   * @param wallWidth 输出墙壁厚度，该墙壁厚度不受缩放影响
+   * @param scale 原始数据缩放比例
+   */
+  constructor(wallWidth = 0.1, scale = 1) {
+    super();
+    this.environment = typeof window !== "undefined" ? "browser" : typeof global !== "undefined" ? "node" : "unknown";
+    this.wallWidth = wallWidth;
+    this.Dxf = new Dxf(this.wallWidth, scale);
+    this.Variable = new Variable();
+    this.addComponent(this.Variable);
+    this.addComponent(this.Dxf);
+    this.addComponent(new LineAnalysis());
+  }
+  usePlugin(plugin) {
+    if (typeof plugin === "function") plugin.call(this, this);
+    return this;
+  }
+  destroy() {
+    this.components.forEach((com) => {
+      this.removeComponent(com);
+      com.destroy();
+    });
+  }
+}
+const exporter = new OBJExporter();
 function lineSqueezing(p1, p2, width = 0.1) {
   const normal = p2.normal(p1);
   const pDirect = p2.direction(p1).mutiplyScalar(width * 0.5);
@@ -1008,8 +1784,8 @@ class WhiteModel extends Component {
   // 原始数据白模
   originalWhiteMode = new THREE.Group();
   onAddFromParent(parent) {
-    this.Dxf = parent.findComponentByType(Dxf);
-    this.Variable = parent.findComponentByType(Variable);
+    this.Dxf = parent.findComponentByName("Dxf");
+    this.Variable = parent.findComponentByName("Variable");
     this.originalWhiteMode.visible = false;
     this.Dxf?.addEventListener("lineOffset", () => {
       this.updateModel();
@@ -1030,7 +1806,7 @@ class WhiteModel extends Component {
         bevelSize: 0
       });
       const mesh = new THREE.Mesh(geometry);
-      mesh.material = new THREE.MeshPhongMaterial({ color: 16777215, transparent: true, opacity: 0.8 });
+      mesh.material = new THREE.MeshStandardMaterial({ color: 16777215, transparent: true, opacity: 0.8 });
       this.whiteModelGroup.add(mesh);
       this.whiteModelGroup.add(
         new THREE.LineSegments(new THREE.EdgesGeometry(geometry), new THREE.LineBasicMaterial({ color: 6710886 }))
@@ -1066,6 +1842,37 @@ class WhiteModel extends Component {
       whiteModelGroup: this.whiteModelGroup
     });
   }
+  toOBJ() {
+    return new Promise((resolve) => {
+      resolve(exporter.parse(this.whiteModelGroup));
+    });
+  }
+  async toBlob() {
+    const buffer = await this.toOBJ();
+    if (buffer) {
+      return new Blob([buffer], { type: "application/octet-stream" });
+    }
+  }
+  async download(filename) {
+    if (typeof window !== "undefined") {
+      const blob = await this.toBlob();
+      if (!blob) return;
+      const a = document.createElement("a");
+      a.href = URL.createObjectURL(blob);
+      a.download = filename;
+      a.click();
+    } else if (typeof global !== "undefined") {
+      const buffer = await this.toOBJ();
+      if (buffer) {
+        const packageName = "fs";
+        const { default: fs } = await import(
+          /* @vite-ignore */
+          packageName
+        );
+        fs.writeFileSync(filename, buffer);
+      }
+    }
+  }
 }
 class DetailsPoint extends Component {
   Dxf = null;
@@ -1075,8 +1882,8 @@ class DetailsPoint extends Component {
   raylines = [];
   data = [];
   onAddFromParent(parent) {
-    this.Dxf = parent.findComponentByType(Dxf);
-    this.Variable = parent.findComponentByType(Variable);
+    this.Dxf = parent.findComponentByName("Dxf");
+    this.Variable = parent.findComponentByName("Variable");
     this.Dxf?.addEventListener("setDta", () => {
       this.updateModel();
     });
@@ -1085,7 +1892,22 @@ class DetailsPoint extends Component {
    * 设置值
    * @param data 
    */
-  set(data) {
+  async set(data) {
+    if (typeof data === "string") {
+      if (typeof global !== "undefined") {
+        const packageName = "fs";
+        const { default: fs } = await import(
+          /* @vite-ignore */
+          packageName
+        );
+        const buffer = fs.readFileSync(data);
+        const json = JSON.parse(buffer.toString("utf-8"));
+        this.set(json);
+        return;
+      } else {
+        throw new Error("非node环境不允许使用路径");
+      }
+    }
     this.data = data;
     this.updateModel();
   }
@@ -1111,7 +1933,7 @@ class DetailsPoint extends Component {
     if (this._timer) clearTimeout(this._timer);
     this._timer = setTimeout(() => {
       this._timer = null;
-      const whiteModel = this.parent?.findComponentByType(WhiteModel);
+      const whiteModel = this.parent?.findComponentByName("WhiteModel");
       this.raylines.length = 0;
       this.desPoints.length = 0;
       this.data.forEach((item) => {
@@ -1151,14 +1973,14 @@ class DxfLineModel extends Component {
   dxfDoorsLineModel = new THREE.LineSegments();
   dxfModelGroup = new THREE.Group();
   onAddFromParent(parent) {
-    const dxf = parent.findComponentByType(Dxf);
+    const dxf = parent.findComponentByName("Dxf");
     this.dxfModelGroup.add(this.dxfLineModel);
     this.dxfModelGroup.add(this.dxfDoorsLineModel);
     this.dxfDoorsLineModel.material = new THREE.LineBasicMaterial({ color: 16776960, vertexColors: true });
     dxf?.addEventListener("lineOffset", () => this.updateMode());
   }
   updateMode() {
-    const dxf = this.parent?.findComponentByType(Dxf);
+    const dxf = this.parent?.findComponentByName("Dxf");
     this.dxfLineModel.clear();
     const dxfArray = dxf.to3DArray(1 / dxf.scale);
     this.dxfLineModel.geometry = new THREE.BufferGeometry().setAttribute("position", new THREE.BufferAttribute(dxfArray, 3, true));
@@ -1167,18 +1989,33 @@ class DxfLineModel extends Component {
     this.dxfDoorsLineModel.geometry = new THREE.BufferGeometry().setAttribute("position", new THREE.BufferAttribute(doorsArray, 3, true)).setAttribute("color", new THREE.BufferAttribute(doorsColorArray, 3));
   }
 }
-const index = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const index$1 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   DetailsPoint,
   DxfLineModel,
   WhiteModel
 }, Symbol.toStringTag, { value: "Module" }));
-function ModeDataPlugin(dxfSystem) {
+function ModelDataPlugin(dxfSystem) {
   dxfSystem.addComponent(new DxfLineModel());
   dxfSystem.addComponent(new WhiteModel());
   dxfSystem.addComponent(new DetailsPoint());
 }
+const index = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  ModelDataPlugin,
+  components: index$1
+}, Symbol.toStringTag, { value: "Module" }));
+function loadRenderPlugin() {
+  return import("./index2.js");
+}
 export {
-  ModeDataPlugin,
-  index as components
+  Box2 as B,
+  Component as C,
+  DxfSystem as D,
+  ModelDataPlugin as M,
+  Point as P,
+  Variable as V,
+  DetailsPoint as a,
+  index as i,
+  loadRenderPlugin as l
 };