@ifc-lite/drawing-2d 1.4.0

package/dist/line-merger.js

@@ -0,0 +1,265 @@
+/* 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 { EPSILON, point2DDistance, point2DSub, point2DDot, point2DCross, lineDirection, } from './math';
+const DEFAULT_OPTIONS = {
+    angleTolerance: 0.01, // ~0.5 degrees
+    distanceTolerance: 0.001,
+    gapTolerance: 0.01,
+};
+/**
+ * Merge collinear line segments within the same entity
+ */
+export function mergeDrawingLines(lines, options = {}) {
+    const opts = { ...DEFAULT_OPTIONS, ...options };
+    // Group lines by entity and category
+    const groups = new Map();
+    for (const line of lines) {
+        const key = `${line.modelIndex}:${line.entityId}:${line.category}:${line.visibility}`;
+        if (!groups.has(key)) {
+            groups.set(key, []);
+        }
+        groups.get(key).push(line);
+    }
+    // Merge within each group
+    const result = [];
+    for (const groupLines of groups.values()) {
+        const merged = mergeLineGroup(groupLines, opts);
+        result.push(...merged);
+    }
+    return result;
+}
+/**
+ * Merge lines within a single group (same entity, category, visibility)
+ */
+function mergeLineGroup(lines, opts) {
+    if (lines.length <= 1)
+        return lines;
+    // Extract just the Line2D parts for merging
+    const line2Ds = lines.map((l) => l.line);
+    const mergedLine2Ds = mergeCollinearLines(line2Ds, opts);
+    // Map merged lines back to DrawingLines
+    // Use properties from first line in group (they're all the same)
+    const template = lines[0];
+    return mergedLine2Ds.map((line) => ({
+        ...template,
+        line,
+    }));
+}
+/**
+ * Core algorithm: merge collinear Line2D segments
+ */
+export function mergeCollinearLines(lines, options = {}) {
+    const opts = { ...DEFAULT_OPTIONS, ...options };
+    if (lines.length <= 1)
+        return lines;
+    // Group lines by direction (using angle buckets)
+    const buckets = groupByDirection(lines, opts.angleTolerance);
+    const result = [];
+    // Process each direction bucket
+    for (const bucket of buckets.values()) {
+        // Further group by actual line (same direction, same line equation)
+        const lineGroups = groupByLine(bucket, opts.distanceTolerance);
+        for (const group of lineGroups) {
+            // Merge segments on the same line
+            const merged = mergeSegmentsOnLine(group, opts.gapTolerance);
+            result.push(...merged);
+        }
+    }
+    return result;
+}
+/**
+ * Group lines by their direction (angle bucket)
+ */
+function groupByDirection(lines, angleTolerance) {
+    const buckets = new Map();
+    const bucketSize = angleTolerance * 2;
+    for (const line of lines) {
+        const dir = lineDirection(line);
+        // Normalize angle to [0, π) since direction is symmetric
+        let angle = Math.atan2(dir.y, dir.x);
+        if (angle < 0)
+            angle += Math.PI;
+        if (angle >= Math.PI)
+            angle -= Math.PI;
+        // Find bucket
+        const bucketIdx = Math.floor(angle / bucketSize);
+        if (!buckets.has(bucketIdx)) {
+            buckets.set(bucketIdx, []);
+        }
+        buckets.get(bucketIdx).push(line);
+    }
+    return buckets;
+}
+/**
+ * Group lines that lie on the same infinite line
+ */
+function groupByLine(lines, distanceTolerance) {
+    const groups = [];
+    const assigned = new Set();
+    for (let i = 0; i < lines.length; i++) {
+        if (assigned.has(i))
+            continue;
+        const group = [lines[i]];
+        assigned.add(i);
+        // Find all other lines on the same line
+        for (let j = i + 1; j < lines.length; j++) {
+            if (assigned.has(j))
+                continue;
+            if (linesOnSameLine(lines[i], lines[j], distanceTolerance)) {
+                group.push(lines[j]);
+                assigned.add(j);
+            }
+        }
+        groups.push(group);
+    }
+    return groups;
+}
+/**
+ * Check if two lines lie on the same infinite line
+ */
+function linesOnSameLine(a, b, tolerance) {
+    const dirA = lineDirection(a);
+    // Distance from b.start to line a
+    const toB = point2DSub(b.start, a.start);
+    const distStart = Math.abs(point2DCross(dirA, toB));
+    if (distStart > tolerance)
+        return false;
+    // Distance from b.end to line a
+    const toBEnd = point2DSub(b.end, a.start);
+    const distEnd = Math.abs(point2DCross(dirA, toBEnd));
+    return distEnd <= tolerance;
+}
+/**
+ * Merge segments that lie on the same line
+ * Uses 1D projection along the line
+ */
+function mergeSegmentsOnLine(lines, gapTolerance) {
+    if (lines.length <= 1)
+        return lines;
+    // Project all segments to 1D parameter space along the line
+    const baseLine = lines[0];
+    const dir = lineDirection(baseLine);
+    const origin = baseLine.start;
+    const intervals = lines.map((line) => {
+        const t0 = projectPoint1D(line.start, origin, dir);
+        const t1 = projectPoint1D(line.end, origin, dir);
+        return { t0: Math.min(t0, t1), t1: Math.max(t0, t1) };
+    });
+    // Sort by start parameter
+    intervals.sort((a, b) => a.t0 - b.t0);
+    // Merge overlapping/adjacent intervals
+    const merged = [];
+    let current = intervals[0];
+    for (let i = 1; i < intervals.length; i++) {
+        const next = intervals[i];
+        // Check if intervals overlap or are adjacent (within gap tolerance)
+        if (next.t0 <= current.t1 + gapTolerance) {
+            // Merge
+            current = {
+                t0: current.t0,
+                t1: Math.max(current.t1, next.t1),
+            };
+        }
+        else {
+            // Gap too large, start new interval
+            merged.push(current);
+            current = next;
+        }
+    }
+    merged.push(current);
+    // Convert back to Line2D
+    return merged.map((interval) => ({
+        start: {
+            x: origin.x + dir.x * interval.t0,
+            y: origin.y + dir.y * interval.t0,
+        },
+        end: {
+            x: origin.x + dir.x * interval.t1,
+            y: origin.y + dir.y * interval.t1,
+        },
+    }));
+}
+/**
+ * Project point to 1D parameter along direction from origin
+ */
+function projectPoint1D(point, origin, dir) {
+    const toPoint = point2DSub(point, origin);
+    return point2DDot(toPoint, dir);
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// SEGMENT DEDUPLICATION
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * Remove duplicate line segments
+ */
+export function deduplicateLines(lines, tolerance = 0.001) {
+    const result = [];
+    for (const line of lines) {
+        let isDuplicate = false;
+        for (const existing of result) {
+            if (linesEqual(line, existing, tolerance)) {
+                isDuplicate = true;
+                break;
+            }
+        }
+        if (!isDuplicate) {
+            result.push(line);
+        }
+    }
+    return result;
+}
+/**
+ * Check if two lines are equal (considering both directions)
+ */
+function linesEqual(a, b, tolerance) {
+    // Forward match
+    if (point2DDistance(a.start, b.start) < tolerance &&
+        point2DDistance(a.end, b.end) < tolerance) {
+        return true;
+    }
+    // Reverse match
+    if (point2DDistance(a.start, b.end) < tolerance &&
+        point2DDistance(a.end, b.start) < tolerance) {
+        return true;
+    }
+    return false;
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// LINE SPLITTING (for hidden line removal)
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * Split a line at given parameters
+ * @param line The line to split
+ * @param params Array of t values (0-1) where to split
+ * @returns Array of line segments
+ */
+export function splitLineAtParams(line, params) {
+    // Add endpoints and sort
+    const allParams = [0, ...params.filter((t) => t > 0 && t < 1), 1].sort((a, b) => a - b);
+    // Remove duplicates
+    const uniqueParams = [];
+    for (const p of allParams) {
+        if (uniqueParams.length === 0 || p - uniqueParams[uniqueParams.length - 1] > EPSILON) {
+            uniqueParams.push(p);
+        }
+    }
+    // Create segments
+    const segments = [];
+    for (let i = 0; i < uniqueParams.length - 1; i++) {
+        const t0 = uniqueParams[i];
+        const t1 = uniqueParams[i + 1];
+        segments.push({
+            start: {
+                x: line.start.x + t0 * (line.end.x - line.start.x),
+                y: line.start.y + t0 * (line.end.y - line.start.y),
+            },
+            end: {
+                x: line.start.x + t1 * (line.end.x - line.start.x),
+                y: line.start.y + t1 * (line.end.y - line.start.y),
+            },
+        });
+    }
+    return segments;
+}
+//# sourceMappingURL=line-merger.js.map

package/dist/line-merger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"line-merger.js","sourceRoot":"","sources":["../src/line-merger.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAW/D,OAAO,EACL,OAAO,EACP,eAAe,EACf,UAAU,EACV,UAAU,EACV,YAAY,EAEZ,aAAa,GAEd,MAAM,QAAQ,CAAC;AAehB,MAAM,eAAe,GAAsB;IACzC,cAAc,EAAE,IAAI,EAAE,eAAe;IACrC,iBAAiB,EAAE,KAAK;IACxB,YAAY,EAAE,IAAI;CACnB,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAoB,EACpB,UAAsC,EAAE;IAExC,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;IAEhD,qCAAqC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEhD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACtF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,0BAA0B;IAC1B,MAAM,MAAM,GAAkB,EAAE,CAAC;IAEjC,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,cAAc,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAChD,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,KAAoB,EAAE,IAAuB;IACnE,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAEpC,4CAA4C;IAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,aAAa,GAAG,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAEzD,wCAAwC;IACxC,iEAAiE;IACjE,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAE1B,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAClC,GAAG,QAAQ;QACX,IAAI;KACL,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAe,EACf,UAAsC,EAAE;IAExC,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;IAEhD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAEpC,iDAAiD;IACjD,MAAM,OAAO,GAAG,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;IAE7D,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,gCAAgC;IAChC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACtC,oEAAoE;QACpE,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAE/D,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,kCAAkC;YAClC,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7D,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CACvB,KAAe,EACf,cAAsB;IAEtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,UAAU,GAAG,cAAc,GAAG,CAAC,CAAC;IAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QAChC,yDAAyD;QACzD,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC;YAAE,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC;QAChC,IAAI,KAAK,IAAI,IAAI,CAAC,EAAE;YAAE,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC;QAEvC,cAAc;QACd,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QAEjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,KAAe,EAAE,iBAAyB;IAC7D,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAE9B,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEhB,wCAAwC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAE9B,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,EAAE,CAAC;gBAC3D,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,SAAiB;IAC9D,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAE9B,kCAAkC;IAClC,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAEpD,IAAI,SAAS,GAAG,SAAS;QAAE,OAAO,KAAK,CAAC;IAExC,gCAAgC;IAChC,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IAErD,OAAO,OAAO,IAAI,SAAS,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,KAAe,EAAE,YAAoB;IAChE,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAEpC,4DAA4D;IAC5D,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,GAAG,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC;IAQ9B,MAAM,SAAS,GAAe,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QAC/C,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACnD,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACjD,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,0BAA0B;IAC1B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAEtC,uCAAuC;IACvC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAE1B,oEAAoE;QACpE,IAAI,IAAI,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,GAAG,YAAY,EAAE,CAAC;YACzC,QAAQ;YACR,OAAO,GAAG;gBACR,EAAE,EAAE,OAAO,CAAC,EAAE;gBACd,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;aAClC,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,oCAAoC;YACpC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;IACH,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAErB,yBAAyB;IACzB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC/B,KAAK,EAAE;YACL,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE;YACjC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE;SAClC;QACD,GAAG,EAAE;YACH,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE;YACjC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE;SAClC;KACF,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,KAAc,EAAE,MAAe,EAAE,GAAY;IACnE,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC1C,OAAO,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;AAClC,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAe,EACf,YAAoB,KAAK;IAEzB,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;YAC9B,IAAI,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,CAAC;gBAC1C,WAAW,GAAG,IAAI,CAAC;gBACnB,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,SAAiB;IACzD,gBAAgB;IAChB,IACE,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS;QAC7C,eAAe,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,EACzC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gBAAgB;IAChB,IACE,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS;QAC3C,eAAe,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,EAC3C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,2CAA2C;AAC3C,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY,EAAE,MAAgB;IAC9D,yBAAyB;IACzB,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CACpE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAChB,CAAC;IAEF,oBAAoB;IACpB,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC;YACrF,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACjD,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAE/B,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE;gBACL,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAClD,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;aACnD;YACD,GAAG,EAAE;gBACH,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAClD,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;aACnD;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/math.d.ts

@@ -0,0 +1,90 @@
+/**
+ * Vector math utilities for 2D drawing generation
+ */
+import type { Vec3, Point2D, Line2D, Bounds2D } from './types';
+export declare const EPSILON = 1e-7;
+export declare function vec3(x: number, y: number, z: number): Vec3;
+export declare function vec3Add(a: Vec3, b: Vec3): Vec3;
+export declare function vec3Sub(a: Vec3, b: Vec3): Vec3;
+export declare function vec3Scale(v: Vec3, s: number): Vec3;
+export declare function vec3Dot(a: Vec3, b: Vec3): number;
+export declare function vec3Cross(a: Vec3, b: Vec3): Vec3;
+export declare function vec3Length(v: Vec3): number;
+export declare function vec3Normalize(v: Vec3): Vec3;
+export declare function vec3Lerp(a: Vec3, b: Vec3, t: number): Vec3;
+export declare function vec3Equals(a: Vec3, b: Vec3, tolerance?: number): boolean;
+export declare function vec3Distance(a: Vec3, b: Vec3): number;
+export declare function point2D(x: number, y: number): Point2D;
+export declare function point2DAdd(a: Point2D, b: Point2D): Point2D;
+export declare function point2DSub(a: Point2D, b: Point2D): Point2D;
+export declare function point2DScale(p: Point2D, s: number): Point2D;
+export declare function point2DDot(a: Point2D, b: Point2D): number;
+export declare function point2DLength(p: Point2D): number;
+export declare function point2DDistance(a: Point2D, b: Point2D): number;
+export declare function point2DLerp(a: Point2D, b: Point2D, t: number): Point2D;
+export declare function point2DEquals(a: Point2D, b: Point2D, tolerance?: number): boolean;
+export declare function point2DNormalize(p: Point2D): Point2D;
+/**
+ * 2D cross product (returns scalar z-component)
+ */
+export declare function point2DCross(a: Point2D, b: Point2D): number;
+export declare function lineLength(line: Line2D): number;
+export declare function lineMidpoint(line: Line2D): Point2D;
+export declare function lineDirection(line: Line2D): Point2D;
+/**
+ * Check if two lines are collinear (same direction and overlapping)
+ */
+export declare function linesCollinear(a: Line2D, b: Line2D, angleTolerance?: number, distanceTolerance?: number): boolean;
+/**
+ * Project a point onto a line, returning the parameter t
+ * t=0 at start, t=1 at end
+ */
+export declare function projectPointOnLine(point: Point2D, line: Line2D): number;
+export declare function boundsEmpty(): Bounds2D;
+export declare function boundsExtendPoint(bounds: Bounds2D, point: Point2D): Bounds2D;
+export declare function boundsExtendLine(bounds: Bounds2D, line: Line2D): Bounds2D;
+export declare function boundsCenter(bounds: Bounds2D): Point2D;
+export declare function boundsSize(bounds: Bounds2D): Point2D;
+export declare function boundsValid(bounds: Bounds2D): boolean;
+/**
+ * Compute signed distance from point to plane
+ * Positive = in front of plane (in normal direction)
+ * Negative = behind plane
+ */
+export declare function signedDistanceToPlane(point: Vec3, normal: Vec3, distance: number): number;
+/**
+ * Get the normal vector for a section axis
+ */
+export declare function getAxisNormal(axis: 'x' | 'y' | 'z', flipped: boolean): Vec3;
+/**
+ * Get the two axes perpendicular to the section axis (for 2D projection)
+ */
+export declare function getProjectionAxes(axis: 'x' | 'y' | 'z'): {
+    u: 'x' | 'y' | 'z';
+    v: 'x' | 'y' | 'z';
+};
+/**
+ * Project a 3D point to 2D based on section axis
+ */
+export declare function projectTo2D(point: Vec3, axis: 'x' | 'y' | 'z', flipped: boolean): Point2D;
+/**
+ * Compute signed area of polygon (positive = CCW, negative = CW)
+ */
+export declare function polygonSignedArea(points: Point2D[]): number;
+/**
+ * Check if polygon winding is counter-clockwise
+ */
+export declare function isCounterClockwise(points: Point2D[]): boolean;
+/**
+ * Reverse polygon winding
+ */
+export declare function reversePolygon(points: Point2D[]): Point2D[];
+/**
+ * Ensure polygon has counter-clockwise winding
+ */
+export declare function ensureCCW(points: Point2D[]): Point2D[];
+/**
+ * Ensure polygon has clockwise winding
+ */
+export declare function ensureCW(points: Point2D[]): Point2D[];
+//# sourceMappingURL=math.d.ts.map

package/dist/math.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../src/math.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,KAAK,EAAQ,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAMrE,eAAO,MAAM,OAAO,OAAO,CAAC;AAM5B,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAE1D;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAE9C;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAE9C;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAElD;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAEhD;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,IAAI,CAMhD;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAE1C;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAI3C;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAM1D;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,GAAE,MAAgB,GAAG,OAAO,CAMjF;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,MAAM,CAKrD;AAMD,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAErD;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAE1D;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAE1D;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAE3D;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAEzD;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,GAAG,MAAM,CAEhD;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAI9D;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAKtE;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,SAAS,GAAE,MAAgB,GAAG,OAAO,CAE1F;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAIpD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,MAAM,CAE3D;AAMD,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAE/C;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAKlD;AAED,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEnD;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,cAAc,GAAE,MAAa,EAC7B,iBAAiB,GAAE,MAAc,GAChC,OAAO,CAYT;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAMvE;AAMD,wBAAgB,WAAW,IAAI,QAAQ,CAKtC;AAED,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,GAAG,QAAQ,CAW5E;AAED,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,CAIzE;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,QAAQ,GAAG,OAAO,CAKtD;AAED,wBAAgB,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,OAAO,CAKpD;AAED,wBAAgB,WAAW,CAAC,MAAM,EAAE,QAAQ,GAAG,OAAO,CASrD;AAMD;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAEzF;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAU3E;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;IAAE,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAAC,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;CAAE,CASnG;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAMzF;AAMD;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,CAS3D;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAE7D;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,CAE3D;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,CAEtD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,CAErD"}

package/dist/math.js

@@ -0,0 +1,284 @@
+/* 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/. */
+// ═══════════════════════════════════════════════════════════════════════════
+// CONSTANTS
+// ═══════════════════════════════════════════════════════════════════════════
+export const EPSILON = 1e-7;
+// ═══════════════════════════════════════════════════════════════════════════
+// VEC3 OPERATIONS
+// ═══════════════════════════════════════════════════════════════════════════
+export function vec3(x, y, z) {
+    return { x, y, z };
+}
+export function vec3Add(a, b) {
+    return { x: a.x + b.x, y: a.y + b.y, z: a.z + b.z };
+}
+export function vec3Sub(a, b) {
+    return { x: a.x - b.x, y: a.y - b.y, z: a.z - b.z };
+}
+export function vec3Scale(v, s) {
+    return { x: v.x * s, y: v.y * s, z: v.z * s };
+}
+export function vec3Dot(a, b) {
+    return a.x * b.x + a.y * b.y + a.z * b.z;
+}
+export function vec3Cross(a, b) {
+    return {
+        x: a.y * b.z - a.z * b.y,
+        y: a.z * b.x - a.x * b.z,
+        z: a.x * b.y - a.y * b.x,
+    };
+}
+export function vec3Length(v) {
+    return Math.sqrt(v.x * v.x + v.y * v.y + v.z * v.z);
+}
+export function vec3Normalize(v) {
+    const len = vec3Length(v);
+    if (len < EPSILON)
+        return { x: 0, y: 0, z: 0 };
+    return { x: v.x / len, y: v.y / len, z: v.z / len };
+}
+export function vec3Lerp(a, b, t) {
+    return {
+        x: a.x + t * (b.x - a.x),
+        y: a.y + t * (b.y - a.y),
+        z: a.z + t * (b.z - a.z),
+    };
+}
+export function vec3Equals(a, b, tolerance = EPSILON) {
+    return (Math.abs(a.x - b.x) < tolerance &&
+        Math.abs(a.y - b.y) < tolerance &&
+        Math.abs(a.z - b.z) < tolerance);
+}
+export function vec3Distance(a, b) {
+    const dx = b.x - a.x;
+    const dy = b.y - a.y;
+    const dz = b.z - a.z;
+    return Math.sqrt(dx * dx + dy * dy + dz * dz);
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// VEC2 / POINT2D OPERATIONS
+// ═══════════════════════════════════════════════════════════════════════════
+export function point2D(x, y) {
+    return { x, y };
+}
+export function point2DAdd(a, b) {
+    return { x: a.x + b.x, y: a.y + b.y };
+}
+export function point2DSub(a, b) {
+    return { x: a.x - b.x, y: a.y - b.y };
+}
+export function point2DScale(p, s) {
+    return { x: p.x * s, y: p.y * s };
+}
+export function point2DDot(a, b) {
+    return a.x * b.x + a.y * b.y;
+}
+export function point2DLength(p) {
+    return Math.sqrt(p.x * p.x + p.y * p.y);
+}
+export function point2DDistance(a, b) {
+    const dx = b.x - a.x;
+    const dy = b.y - a.y;
+    return Math.sqrt(dx * dx + dy * dy);
+}
+export function point2DLerp(a, b, t) {
+    return {
+        x: a.x + t * (b.x - a.x),
+        y: a.y + t * (b.y - a.y),
+    };
+}
+export function point2DEquals(a, b, tolerance = EPSILON) {
+    return Math.abs(a.x - b.x) < tolerance && Math.abs(a.y - b.y) < tolerance;
+}
+export function point2DNormalize(p) {
+    const len = point2DLength(p);
+    if (len < EPSILON)
+        return { x: 0, y: 0 };
+    return { x: p.x / len, y: p.y / len };
+}
+/**
+ * 2D cross product (returns scalar z-component)
+ */
+export function point2DCross(a, b) {
+    return a.x * b.y - a.y * b.x;
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// LINE OPERATIONS
+// ═══════════════════════════════════════════════════════════════════════════
+export function lineLength(line) {
+    return point2DDistance(line.start, line.end);
+}
+export function lineMidpoint(line) {
+    return {
+        x: (line.start.x + line.end.x) / 2,
+        y: (line.start.y + line.end.y) / 2,
+    };
+}
+export function lineDirection(line) {
+    return point2DNormalize(point2DSub(line.end, line.start));
+}
+/**
+ * Check if two lines are collinear (same direction and overlapping)
+ */
+export function linesCollinear(a, b, angleTolerance = 0.01, distanceTolerance = 0.001) {
+    const dirA = lineDirection(a);
+    const dirB = lineDirection(b);
+    // Check if directions are parallel (or anti-parallel)
+    const cross = Math.abs(point2DCross(dirA, dirB));
+    if (cross > angleTolerance)
+        return false;
+    // Check if lines are on the same line (distance from point to line)
+    const toB = point2DSub(b.start, a.start);
+    const dist = Math.abs(point2DCross(dirA, toB));
+    return dist < distanceTolerance;
+}
+/**
+ * Project a point onto a line, returning the parameter t
+ * t=0 at start, t=1 at end
+ */
+export function projectPointOnLine(point, line) {
+    const lineVec = point2DSub(line.end, line.start);
+    const pointVec = point2DSub(point, line.start);
+    const lenSq = point2DDot(lineVec, lineVec);
+    if (lenSq < EPSILON)
+        return 0;
+    return point2DDot(pointVec, lineVec) / lenSq;
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// BOUNDS OPERATIONS
+// ═══════════════════════════════════════════════════════════════════════════
+export function boundsEmpty() {
+    return {
+        min: { x: Infinity, y: Infinity },
+        max: { x: -Infinity, y: -Infinity },
+    };
+}
+export function boundsExtendPoint(bounds, point) {
+    return {
+        min: {
+            x: Math.min(bounds.min.x, point.x),
+            y: Math.min(bounds.min.y, point.y),
+        },
+        max: {
+            x: Math.max(bounds.max.x, point.x),
+            y: Math.max(bounds.max.y, point.y),
+        },
+    };
+}
+export function boundsExtendLine(bounds, line) {
+    let result = boundsExtendPoint(bounds, line.start);
+    result = boundsExtendPoint(result, line.end);
+    return result;
+}
+export function boundsCenter(bounds) {
+    return {
+        x: (bounds.min.x + bounds.max.x) / 2,
+        y: (bounds.min.y + bounds.max.y) / 2,
+    };
+}
+export function boundsSize(bounds) {
+    return {
+        x: bounds.max.x - bounds.min.x,
+        y: bounds.max.y - bounds.min.y,
+    };
+}
+export function boundsValid(bounds) {
+    return (bounds.min.x <= bounds.max.x &&
+        bounds.min.y <= bounds.max.y &&
+        isFinite(bounds.min.x) &&
+        isFinite(bounds.max.x) &&
+        isFinite(bounds.min.y) &&
+        isFinite(bounds.max.y));
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// PLANE OPERATIONS
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * Compute signed distance from point to plane
+ * Positive = in front of plane (in normal direction)
+ * Negative = behind plane
+ */
+export function signedDistanceToPlane(point, normal, distance) {
+    return vec3Dot(point, normal) - distance;
+}
+/**
+ * Get the normal vector for a section axis
+ */
+export function getAxisNormal(axis, flipped) {
+    const sign = flipped ? -1 : 1;
+    switch (axis) {
+        case 'x':
+            return { x: sign, y: 0, z: 0 };
+        case 'y':
+            return { x: 0, y: sign, z: 0 };
+        case 'z':
+            return { x: 0, y: 0, z: sign };
+    }
+}
+/**
+ * Get the two axes perpendicular to the section axis (for 2D projection)
+ */
+export function getProjectionAxes(axis) {
+    switch (axis) {
+        case 'x':
+            return { u: 'z', v: 'y' }; // Looking along X, project to ZY
+        case 'y':
+            return { u: 'x', v: 'z' }; // Looking along Y (down), project to XZ
+        case 'z':
+            return { u: 'x', v: 'y' }; // Looking along Z, project to XY
+    }
+}
+/**
+ * Project a 3D point to 2D based on section axis
+ */
+export function projectTo2D(point, axis, flipped) {
+    const axes = getProjectionAxes(axis);
+    const u = point[axes.u];
+    const v = point[axes.v];
+    // Flip U axis when section is flipped to maintain consistent orientation
+    return { x: flipped ? -u : u, y: v };
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// POLYGON OPERATIONS
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * Compute signed area of polygon (positive = CCW, negative = CW)
+ */
+export function polygonSignedArea(points) {
+    if (points.length < 3)
+        return 0;
+    let area = 0;
+    for (let i = 0; i < points.length; i++) {
+        const j = (i + 1) % points.length;
+        area += points[i].x * points[j].y;
+        area -= points[j].x * points[i].y;
+    }
+    return area / 2;
+}
+/**
+ * Check if polygon winding is counter-clockwise
+ */
+export function isCounterClockwise(points) {
+    return polygonSignedArea(points) > 0;
+}
+/**
+ * Reverse polygon winding
+ */
+export function reversePolygon(points) {
+    return [...points].reverse();
+}
+/**
+ * Ensure polygon has counter-clockwise winding
+ */
+export function ensureCCW(points) {
+    return isCounterClockwise(points) ? points : reversePolygon(points);
+}
+/**
+ * Ensure polygon has clockwise winding
+ */
+export function ensureCW(points) {
+    return isCounterClockwise(points) ? reversePolygon(points) : points;
+}
+//# sourceMappingURL=math.js.map