@ifc-lite/drawing-2d 1.4.0

package/dist/openings/opening-utils.js

@@ -0,0 +1,128 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { OpeningRelationshipBuilder } from './opening-relationship-builder';
+/**
+ * Build opening relationships from void and fill relationship arrays
+ */
+export function buildOpeningRelationships(voids, fills, entityMetadata, modelIndex = 0) {
+    return new OpeningRelationshipBuilder(entityMetadata)
+        .addVoidRelationships(voids)
+        .addFillRelationships(fills)
+        .build(modelIndex);
+}
+/**
+ * Get all opening IDs for a host element (wall, slab, etc.)
+ */
+export function getOpeningsForHost(relationships, hostId) {
+    return relationships.voidedBy.get(hostId) ?? [];
+}
+/**
+ * Get the filling element (door/window) for an opening
+ */
+export function getFillingElement(relationships, openingId) {
+    return relationships.filledBy.get(openingId);
+}
+/**
+ * Get opening info by entity ID (works for both opening and filling elements)
+ */
+export function getOpeningInfo(relationships, entityId) {
+    return relationships.openingInfo.get(entityId);
+}
+/**
+ * Check if an IFC type represents an opening element
+ */
+export function isOpeningElement(ifcType) {
+    const upper = ifcType.toUpperCase();
+    return (upper === 'IFCOPENINGELEMENT' ||
+        upper === 'IFCOPENINGSTANDARDCASE' ||
+        upper === 'IFCVOIDINGELEMENT');
+}
+/**
+ * Check if an IFC type represents a door or window
+ */
+export function isDoorOrWindow(ifcType) {
+    const upper = ifcType.toUpperCase();
+    return (upper.includes('DOOR') ||
+        upper.includes('WINDOW'));
+}
+/**
+ * Check if an IFC type is a host element that can have openings
+ */
+export function isHostElement(ifcType) {
+    const upper = ifcType.toUpperCase();
+    return (upper.includes('WALL') ||
+        upper.includes('SLAB') ||
+        upper.includes('ROOF') ||
+        upper.includes('FLOOR'));
+}
+/**
+ * Get all host element IDs that have openings
+ */
+export function getHostsWithOpenings(relationships) {
+    return Array.from(relationships.voidedBy.keys());
+}
+/**
+ * Get all door opening infos
+ */
+export function getDoorOpenings(relationships) {
+    const result = [];
+    const seen = new Set();
+    for (const [, info] of relationships.openingInfo) {
+        if (info.type === 'door' && !seen.has(info.openingId)) {
+            result.push(info);
+            seen.add(info.openingId);
+        }
+    }
+    return result;
+}
+/**
+ * Get all window opening infos
+ */
+export function getWindowOpenings(relationships) {
+    const result = [];
+    const seen = new Set();
+    for (const [, info] of relationships.openingInfo) {
+        if (info.type === 'window' && !seen.has(info.openingId)) {
+            result.push(info);
+            seen.add(info.openingId);
+        }
+    }
+    return result;
+}
+/**
+ * Filter entity IDs to exclude opening elements
+ * Useful for filtering meshes before section cutting
+ */
+export function filterOutOpeningElements(entityIds, relationships) {
+    const openingIds = new Set();
+    // Collect all opening and filling element IDs
+    for (const openingIdList of relationships.voidedBy.values()) {
+        for (const id of openingIdList) {
+            openingIds.add(id);
+        }
+    }
+    for (const fillingId of relationships.filledBy.values()) {
+        openingIds.add(fillingId);
+    }
+    return entityIds.filter((id) => !openingIds.has(id));
+}
+/**
+ * Get the entity IDs that should be included in cut lines (hosts only)
+ * Excludes opening elements and their filling elements
+ */
+export function getHostEntityIds(allEntityIds, relationships, ifcTypes) {
+    const result = [];
+    for (const id of allEntityIds) {
+        const ifcType = ifcTypes.get(id);
+        if (!ifcType)
+            continue;
+        // Skip opening elements and doors/windows
+        if (isOpeningElement(ifcType) || isDoorOrWindow(ifcType)) {
+            continue;
+        }
+        result.push(id);
+    }
+    return result;
+}
+//# sourceMappingURL=opening-utils.js.map

package/dist/openings/opening-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"opening-utils.js","sourceRoot":"","sources":["../../src/openings/opening-utils.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAa/D,OAAO,EAAE,0BAA0B,EAAE,MAAM,gCAAgC,CAAC;AAE5E;;GAEG;AACH,MAAM,UAAU,yBAAyB,CACvC,KAAyB,EACzB,KAAyB,EACzB,cAA4C,EAC5C,aAAqB,CAAC;IAEtB,OAAO,IAAI,0BAA0B,CAAC,cAAc,CAAC;SAClD,oBAAoB,CAAC,KAAK,CAAC;SAC3B,oBAAoB,CAAC,KAAK,CAAC;SAC3B,KAAK,CAAC,UAAU,CAAC,CAAC;AACvB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,aAAmC,EACnC,MAAc;IAEd,OAAO,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,aAAmC,EACnC,SAAiB;IAEjB,OAAO,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,aAAmC,EACnC,QAAgB;IAEhB,OAAO,aAAa,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACpC,OAAO,CACL,KAAK,KAAK,mBAAmB;QAC7B,KAAK,KAAK,wBAAwB;QAClC,KAAK,KAAK,mBAAmB,CAC9B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe;IAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACpC,OAAO,CACL,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QACtB,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CACzB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe;IAC3C,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACpC,OAAO,CACL,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QACtB,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QACtB,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QACtB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CACxB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,aAAmC;IAEnC,OAAO,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,aAAmC;IAEnC,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,WAAW,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACtD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,aAAmC;IAEnC,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,WAAW,EAAE,CAAC;QACjD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACxD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CACtC,SAAmB,EACnB,aAAmC;IAEnC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,8CAA8C;IAC9C,KAAK,MAAM,aAAa,IAAI,aAAa,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAC5D,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;YAC/B,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,SAAS,IAAI,aAAa,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QACxD,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,YAAsB,EACtB,aAAmC,EACnC,QAA6B;IAE7B,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,0CAA0C;QAC1C,IAAI,gBAAgB,CAAC,OAAO,CAAC,IAAI,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;YACzD,SAAS;QACX,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/polygon-builder.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Polygon Builder - Reconstructs closed polygons from cut line segments
+ *
+ * Takes the line segments from section cutting and connects them into
+ * closed polygon rings, handling:
+ * - Multiple disconnected polygons per entity
+ * - Holes (inner boundaries)
+ * - Floating point tolerance for vertex matching
+ */
+import type { Point2D, CutSegment, DrawingPolygon } from './types';
+export declare class PolygonBuilder {
+    /** Tolerance for vertex matching */
+    private tolerance;
+    constructor(tolerance?: number);
+    /**
+     * Build polygons from cut segments
+     * Groups segments by entity and reconstructs closed loops
+     */
+    buildPolygons(segments: CutSegment[]): DrawingPolygon[];
+    /**
+     * Build polygons for a single entity
+     */
+    private buildEntityPolygons;
+    /**
+     * Build closed loops from segments using a greedy chain-building algorithm
+     */
+    private buildLoops;
+    /**
+     * Build a single closed loop starting from a segment
+     */
+    private buildSingleLoop;
+    /**
+     * Find an unused segment that connects to the given point
+     */
+    private findConnectingSegment;
+    /**
+     * Classify loops as outer boundaries or holes
+     * Uses containment testing and area sign
+     */
+    private classifyLoops;
+    /**
+     * Check if a loop is contained within another loop
+     * Uses point-in-polygon test on the first point
+     */
+    private isLoopContainedIn;
+    /**
+     * Ray casting point-in-polygon test
+     */
+    private pointInPolygon;
+}
+/**
+ * Simplify polygon by removing collinear points
+ */
+export declare function simplifyPolygon(points: Point2D[], tolerance?: number): Point2D[];
+/**
+ * Compute polygon bounds
+ */
+export declare function polygonBounds(points: Point2D[]): {
+    min: Point2D;
+    max: Point2D;
+};
+//# sourceMappingURL=polygon-builder.d.ts.map

package/dist/polygon-builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"polygon-builder.d.ts","sourceRoot":"","sources":["../src/polygon-builder.ts"],"names":[],"mappings":"AAIA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAa,UAAU,EAAE,cAAc,EAAa,MAAM,SAAS,CAAC;AA8BzF,qBAAa,cAAc;IACzB,oCAAoC;IACpC,OAAO,CAAC,SAAS,CAAS;gBAEd,SAAS,GAAE,MAAe;IAItC;;;OAGG;IACH,aAAa,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,cAAc,EAAE;IAuBvD;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAkC3B;;OAEG;IACH,OAAO,CAAC,UAAU;IAmBlB;;OAEG;IACH,OAAO,CAAC,eAAe;IA8CvB;;OAEG;IACH,OAAO,CAAC,qBAAqB;IA2B7B;;;OAGG;IACH,OAAO,CAAC,aAAa;IAwCrB;;;OAGG;IACH,OAAO,CAAC,iBAAiB;IAMzB;;OAEG;IACH,OAAO,CAAC,cAAc;CAkBvB;AAMD;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,SAAS,GAAE,MAAc,GAAG,OAAO,EAAE,CAiBvF;AAWD;;GAEG;AACH,wBAAgB,aAAa,CAC3B,MAAM,EAAE,OAAO,EAAE,GAChB;IAAE,GAAG,EAAE,OAAO,CAAC;IAAC,GAAG,EAAE,OAAO,CAAA;CAAE,CAiBhC"}

package/dist/polygon-builder.js

@@ -0,0 +1,261 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { makeEntityKey } from './types';
+import { point2DDistance, polygonSignedArea, ensureCCW, ensureCW, } from './math';
+// ═══════════════════════════════════════════════════════════════════════════
+// POLYGON BUILDER CLASS
+// ═══════════════════════════════════════════════════════════════════════════
+export class PolygonBuilder {
+    /** Tolerance for vertex matching */
+    tolerance;
+    constructor(tolerance = 0.0001) {
+        this.tolerance = tolerance;
+    }
+    /**
+     * Build polygons from cut segments
+     * Groups segments by entity and reconstructs closed loops
+     */
+    buildPolygons(segments) {
+        // Group segments by entity
+        const byEntity = new Map();
+        for (const seg of segments) {
+            const key = makeEntityKey(seg.modelIndex, seg.entityId);
+            if (!byEntity.has(key)) {
+                byEntity.set(key, []);
+            }
+            byEntity.get(key).push(seg);
+        }
+        // Build polygons for each entity - collect arrays for efficient flattening
+        const polygonArrays = [];
+        for (const [key, entitySegments] of byEntity) {
+            const entityPolygons = this.buildEntityPolygons(entitySegments);
+            polygonArrays.push(entityPolygons);
+        }
+        return polygonArrays.flat();
+    }
+    /**
+     * Build polygons for a single entity
+     */
+    buildEntityPolygons(segments) {
+        if (segments.length === 0)
+            return [];
+        const first = segments[0];
+        const { entityId, ifcType, modelIndex } = first;
+        // Convert to 2D segments
+        const segments2D = segments.map((seg) => ({
+            start: seg.p0_2d,
+            end: seg.p1_2d,
+            used: false,
+        }));
+        // Build closed loops
+        const loops = this.buildLoops(segments2D);
+        if (loops.length === 0)
+            return [];
+        // Classify loops as outer boundaries or holes
+        const classified = this.classifyLoops(loops);
+        // Build final polygons
+        return classified.map((c) => ({
+            polygon: {
+                outer: c.outer,
+                holes: c.holes,
+            },
+            entityId,
+            ifcType,
+            modelIndex,
+            isCut: true,
+        }));
+    }
+    /**
+     * Build closed loops from segments using a greedy chain-building algorithm
+     */
+    buildLoops(segments) {
+        const loops = [];
+        // Keep building loops until no more unused segments
+        while (true) {
+            // Find first unused segment
+            const startIdx = segments.findIndex((s) => !s.used);
+            if (startIdx === -1)
+                break;
+            const loop = this.buildSingleLoop(segments, startIdx);
+            if (loop && loop.length >= 3) {
+                const area = polygonSignedArea(loop);
+                loops.push({ points: loop, area });
+            }
+        }
+        return loops;
+    }
+    /**
+     * Build a single closed loop starting from a segment
+     */
+    buildSingleLoop(segments, startIdx) {
+        const points = [];
+        const startSeg = segments[startIdx];
+        startSeg.used = true;
+        points.push(startSeg.start);
+        let currentEnd = startSeg.end;
+        const loopStart = startSeg.start;
+        const maxIterations = segments.length;
+        let iterations = 0;
+        while (iterations < maxIterations) {
+            iterations++;
+            // Check if we've closed the loop
+            if (point2DDistance(currentEnd, loopStart) < this.tolerance) {
+                return points;
+            }
+            // Find next connecting segment
+            const nextIdx = this.findConnectingSegment(segments, currentEnd);
+            if (nextIdx === -1) {
+                // Can't close loop - mark remaining as unused and return partial
+                // This can happen with open geometry or numerical issues
+                break;
+            }
+            const nextSeg = segments[nextIdx];
+            nextSeg.used = true;
+            // Determine which end connects
+            if (point2DDistance(nextSeg.start, currentEnd) < this.tolerance) {
+                points.push(nextSeg.start);
+                currentEnd = nextSeg.end;
+            }
+            else {
+                points.push(nextSeg.end);
+                currentEnd = nextSeg.start;
+            }
+        }
+        // Loop didn't close - return points anyway for potential use
+        // Some entities may have open cross-sections
+        return points.length >= 3 ? points : null;
+    }
+    /**
+     * Find an unused segment that connects to the given point
+     */
+    findConnectingSegment(segments, point) {
+        let bestIdx = -1;
+        let bestDist = this.tolerance;
+        for (let i = 0; i < segments.length; i++) {
+            if (segments[i].used)
+                continue;
+            const seg = segments[i];
+            // Check start point
+            const distStart = point2DDistance(seg.start, point);
+            if (distStart < bestDist) {
+                bestDist = distStart;
+                bestIdx = i;
+            }
+            // Check end point
+            const distEnd = point2DDistance(seg.end, point);
+            if (distEnd < bestDist) {
+                bestDist = distEnd;
+                bestIdx = i;
+            }
+        }
+        return bestIdx;
+    }
+    /**
+     * Classify loops as outer boundaries or holes
+     * Uses containment testing and area sign
+     */
+    classifyLoops(loops) {
+        if (loops.length === 0)
+            return [];
+        // Sort by absolute area (largest first)
+        const sorted = [...loops].sort((a, b) => Math.abs(b.area) - Math.abs(a.area));
+        const result = [];
+        const assigned = new Set();
+        for (let i = 0; i < sorted.length; i++) {
+            if (assigned.has(i))
+                continue;
+            const outer = sorted[i];
+            // Ensure outer boundary is CCW
+            const outerPoints = ensureCCW(outer.points);
+            // Find holes (smaller loops contained within this one)
+            const holes = [];
+            for (let j = i + 1; j < sorted.length; j++) {
+                if (assigned.has(j))
+                    continue;
+                const inner = sorted[j];
+                // Check if inner is contained in outer
+                if (this.isLoopContainedIn(inner.points, outerPoints)) {
+                    // Ensure hole is CW (opposite winding)
+                    holes.push(ensureCW(inner.points));
+                    assigned.add(j);
+                }
+            }
+            assigned.add(i);
+            result.push({ outer: outerPoints, holes });
+        }
+        return result;
+    }
+    /**
+     * Check if a loop is contained within another loop
+     * Uses point-in-polygon test on the first point
+     */
+    isLoopContainedIn(inner, outer) {
+        // Test the first point of inner against outer
+        const testPoint = inner[0];
+        return this.pointInPolygon(testPoint, outer);
+    }
+    /**
+     * Ray casting point-in-polygon test
+     */
+    pointInPolygon(point, polygon) {
+        let inside = false;
+        const n = polygon.length;
+        for (let i = 0, j = n - 1; i < n; j = i++) {
+            const pi = polygon[i];
+            const pj = polygon[j];
+            if (pi.y > point.y !== pj.y > point.y &&
+                point.x < ((pj.x - pi.x) * (point.y - pi.y)) / (pj.y - pi.y) + pi.x) {
+                inside = !inside;
+            }
+        }
+        return inside;
+    }
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// HELPER FUNCTIONS
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * Simplify polygon by removing collinear points
+ */
+export function simplifyPolygon(points, tolerance = 0.001) {
+    if (points.length < 3)
+        return points;
+    const result = [];
+    for (let i = 0; i < points.length; i++) {
+        const prev = points[(i - 1 + points.length) % points.length];
+        const curr = points[i];
+        const next = points[(i + 1) % points.length];
+        // Check if current point is on the line between prev and next
+        if (!isCollinear(prev, curr, next, tolerance)) {
+            result.push(curr);
+        }
+    }
+    return result.length >= 3 ? result : points;
+}
+/**
+ * Check if three points are collinear
+ */
+function isCollinear(a, b, c, tolerance) {
+    // Area of triangle formed by the three points
+    const area = Math.abs((b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y));
+    return area < tolerance;
+}
+/**
+ * Compute polygon bounds
+ */
+export function polygonBounds(points) {
+    let minX = Infinity, minY = Infinity;
+    let maxX = -Infinity, maxY = -Infinity;
+    for (const p of points) {
+        minX = Math.min(minX, p.x);
+        minY = Math.min(minY, p.y);
+        maxX = Math.max(maxX, p.x);
+        maxY = Math.max(maxY, p.y);
+    }
+    return {
+        min: { x: minX, y: minY },
+        max: { x: maxX, y: maxY },
+    };
+}
+//# sourceMappingURL=polygon-builder.js.map

package/dist/polygon-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polygon-builder.js","sourceRoot":"","sources":["../src/polygon-builder.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAa/D,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AACxC,OAAO,EAEL,eAAe,EAEf,iBAAiB,EACjB,SAAS,EACT,QAAQ,GACT,MAAM,QAAQ,CAAC;AAiBhB,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E,MAAM,OAAO,cAAc;IACzB,oCAAoC;IAC5B,SAAS,CAAS;IAE1B,YAAY,YAAoB,MAAM;QACpC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,QAAsB;QAClC,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2B,CAAC;QAEpD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;YACxD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACxB,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;QAED,2EAA2E;QAC3E,MAAM,aAAa,GAAuB,EAAE,CAAC;QAE7C,KAAK,MAAM,CAAC,GAAG,EAAE,cAAc,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC7C,MAAM,cAAc,GAAG,IAAI,CAAC,mBAAmB,CAAC,cAAc,CAAC,CAAC;YAChE,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACrC,CAAC;QAED,OAAO,aAAa,CAAC,IAAI,EAAE,CAAC;IAC9B,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,QAAsB;QAChD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC;QAEhD,yBAAyB;QACzB,MAAM,UAAU,GAAgB,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACrD,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,GAAG,EAAE,GAAG,CAAC,KAAK;YACd,IAAI,EAAE,KAAK;SACZ,CAAC,CAAC,CAAC;QAEJ,qBAAqB;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAE1C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,8CAA8C;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAE7C,uBAAuB;QACvB,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5B,OAAO,EAAE;gBACP,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,KAAK,EAAE,CAAC,CAAC,KAAK;aACf;YACD,QAAQ;YACR,OAAO;YACP,UAAU;YACV,KAAK,EAAE,IAAI;SACZ,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,QAAqB;QACtC,MAAM,KAAK,GAAW,EAAE,CAAC;QAEzB,oDAAoD;QACpD,OAAO,IAAI,EAAE,CAAC;YACZ,4BAA4B;YAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpD,IAAI,QAAQ,KAAK,CAAC,CAAC;gBAAE,MAAM;YAE3B,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACtD,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBACrC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,QAAqB,EAAE,QAAgB;QAC7D,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACpC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;QAErB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC;QAC9B,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC;QAEjC,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC;QACtC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,OAAO,UAAU,GAAG,aAAa,EAAE,CAAC;YAClC,UAAU,EAAE,CAAC;YAEb,iCAAiC;YACjC,IAAI,eAAe,CAAC,UAAU,EAAE,SAAS,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC5D,OAAO,MAAM,CAAC;YAChB,CAAC;YAED,+BAA+B;YAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;YACjE,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;gBACnB,iEAAiE;gBACjE,yDAAyD;gBACzD,MAAM;YACR,CAAC;YAED,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;YAClC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;YAEpB,+BAA+B;YAC/B,IAAI,eAAe,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAChE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC3B,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACzB,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,6CAA6C;QAC7C,OAAO,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5C,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,QAAqB,EAAE,KAAc;QACjE,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI;gBAAE,SAAS;YAE/B,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAExB,oBAAoB;YACpB,MAAM,SAAS,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACpD,IAAI,SAAS,GAAG,QAAQ,EAAE,CAAC;gBACzB,QAAQ,GAAG,SAAS,CAAC;gBACrB,OAAO,GAAG,CAAC,CAAC;YACd,CAAC;YAED,kBAAkB;YAClB,MAAM,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAChD,IAAI,OAAO,GAAG,QAAQ,EAAE,CAAC;gBACvB,QAAQ,GAAG,OAAO,CAAC;gBACnB,OAAO,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACK,aAAa,CAAC,KAAa;QACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,wCAAwC;QACxC,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAE9E,MAAM,MAAM,GAAoD,EAAE,CAAC;QACnE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAE9B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAExB,+BAA+B;YAC/B,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAE5C,uDAAuD;YACvD,MAAM,KAAK,GAAgB,EAAE,CAAC;YAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAE9B,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAExB,uCAAuC;gBACvC,IAAI,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC;oBACtD,uCAAuC;oBACvC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;oBACnC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;YAED,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,KAAgB,EAAE,KAAgB;QAC1D,8CAA8C;QAC9C,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAc,EAAE,OAAkB;QACvD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAEtB,IACE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;gBACjC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EACnE,CAAC;gBACD,MAAM,GAAG,CAAC,MAAM,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAiB,EAAE,YAAoB,KAAK;IAC1E,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,MAAM,CAAC;IAErC,MAAM,MAAM,GAAc,EAAE,CAAC;IAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAE7C,8DAA8D;QAC9D,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;YAC9C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;AAC9C,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,CAAU,EAAE,CAAU,EAAE,CAAU,EAAE,SAAiB;IACxE,8CAA8C;IAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,OAAO,IAAI,GAAG,SAAS,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAiB;IAEjB,IAAI,IAAI,GAAG,QAAQ,EACjB,IAAI,GAAG,QAAQ,CAAC;IAClB,IAAI,IAAI,GAAG,CAAC,QAAQ,EAClB,IAAI,GAAG,CAAC,QAAQ,CAAC;IAEnB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO;QACL,GAAG,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE;QACzB,GAAG,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE;KAC1B,CAAC;AACJ,CAAC"}

package/dist/section-cutter.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Section Cutter - Core algorithm for cutting 3D triangle meshes with a plane
+ *
+ * Generates 2D line segments and reconstructed polygons for architectural drawings.
+ */
+import type { MeshData } from '@ifc-lite/geometry';
+import type { SectionPlaneConfig, CutSegment, MeshCutResult, SectionCutResult } from './types';
+export declare class SectionCutter {
+    private planeNormal;
+    private planeDistance;
+    private axis;
+    private flipped;
+    constructor(config: SectionPlaneConfig);
+    /**
+     * Cut all meshes with the section plane
+     */
+    cutMeshes(meshes: MeshData[]): SectionCutResult;
+    /**
+     * Cut a single mesh with the section plane
+     */
+    cutSingleMesh(mesh: MeshData): MeshCutResult;
+    /**
+     * Get vertex from positions array
+     */
+    private getVertex;
+    /**
+     * Intersect a triangle with the section plane
+     * Returns the two intersection points, or null if no intersection
+     */
+    private intersectTrianglePlane;
+    /**
+     * Find intersection point of an edge with the plane
+     */
+    private edgePlaneIntersection;
+}
+export interface StreamingSectionCutterOptions {
+    /** Callback when a batch of segments is ready */
+    onSegments?: (segments: CutSegment[], progress: number) => void;
+    /** Batch size for streaming (number of meshes per batch) */
+    batchSize?: number;
+    /** Yield to event loop every N milliseconds */
+    yieldIntervalMs?: number;
+}
+/**
+ * Streaming section cutter for large models
+ * Processes meshes in batches to avoid blocking the main thread
+ */
+export declare function cutMeshesStreaming(meshes: MeshData[], config: SectionPlaneConfig, options?: StreamingSectionCutterOptions): Promise<SectionCutResult>;
+//# sourceMappingURL=section-cutter.d.ts.map

package/dist/section-cutter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"section-cutter.d.ts","sourceRoot":"","sources":["../src/section-cutter.ts"],"names":[],"mappings":"AAIA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EAGV,kBAAkB,EAClB,UAAU,EACV,aAAa,EACb,gBAAgB,EAGjB,MAAM,SAAS,CAAC;AAgBjB,qBAAa,aAAa;IACxB,OAAO,CAAC,WAAW,CAAO;IAC1B,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,IAAI,CAAkB;IAC9B,OAAO,CAAC,OAAO,CAAU;gBAEb,MAAM,EAAE,kBAAkB;IAOtC;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB;IAqC/C;;OAEG;IACH,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,aAAa;IA0D5C;;OAEG;IACH,OAAO,CAAC,SAAS;IAKjB;;;OAGG;IACH,OAAO,CAAC,sBAAsB;IA6C9B;;OAEG;IACH,OAAO,CAAC,qBAAqB;CAwB9B;AAMD,MAAM,WAAW,6BAA6B;IAC5C,iDAAiD;IACjD,UAAU,CAAC,EAAE,CAAC,QAAQ,EAAE,UAAU,EAAE,EAAE,QAAQ,EAAE,MAAM,KAAK,IAAI,CAAC;IAChE,4DAA4D;IAC5D,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,+CAA+C;IAC/C,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;GAGG;AACH,wBAAsB,kBAAkB,CACtC,MAAM,EAAE,QAAQ,EAAE,EAClB,MAAM,EAAE,kBAAkB,EAC1B,OAAO,GAAE,6BAAkC,GAC1C,OAAO,CAAC,gBAAgB,CAAC,CA0D3B"}