@math.gl/geospatial 5.0.0-alpha.9 → 5.0.0-beta.2

package/dist/terrain/mesh-error.js

@@ -0,0 +1,114 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+import { validateTerrainGridMesh } from "./mesh-data.js";
+/** Measure vertical error at valid source-grid nodes. This is not a continuous-surface certificate.
+ * Overlapping triangles contribute the worst error per node. Uncovered samples remain explicit.
+ */
+export function measureTerrainMeshError(field, mesh, options = {}) {
+    validateTerrainGridMesh(mesh);
+    if (mesh.width !== field.width ||
+        mesh.height !== field.height ||
+        mesh.heightReference !== field.heightReference)
+        throw new Error('Terrain mesh and field metadata differ');
+    const limit = options.maxSampleTests ?? 10000000;
+    if (!Number.isSafeInteger(limit) || limit < 0)
+        throw new Error('Invalid terrain mesh sample-test limit');
+    // Verify that grid coordinates describe the actual XY geometry, not a stale/forged index grid.
+    const shift = field.registration === 'cell' ? 0.5 : 0;
+    for (let i = 0; i < mesh.positions.length / 3; i++) {
+        const x = mesh.gridCoordinates[i * 2] + shift, y = mesh.gridCoordinates[i * 2 + 1] + shift;
+        for (let axis = 0; axis < 2; axis++) {
+            const expected = field.origin[axis] -
+                mesh.origin[axis] +
+                x * field.columnStep[axis] +
+                y * field.rowStep[axis];
+            if (!Number.isFinite(expected) || mesh.positions[i * 3 + axis] !== expected)
+                throw new Error('Terrain mesh XY does not match the source grid frame');
+        }
+    }
+    const baseX = field.origin[0] - mesh.origin[0], baseY = field.origin[1] - mesh.origin[1];
+    const [columnX, columnY] = field.columnStep, [rowX, rowY] = field.rowStep;
+    const frameArea = Math.abs(columnX * rowY - columnY * rowX);
+    // Bound coordinate construction roundoff in grid units. Below 1/8 of a cell,
+    // expanding each integer bounding box by one includes all possibly shifted nodes.
+    // Reject distant origins / ill-conditioned frames rather than certify aliased XY.
+    const roundX = 16 *
+        Number.EPSILON *
+        (Math.abs(baseX) + (field.width + 1) * Math.abs(columnX) + (field.height + 1) * Math.abs(rowX));
+    const roundY = 16 *
+        Number.EPSILON *
+        (Math.abs(baseY) + (field.width + 1) * Math.abs(columnY) + (field.height + 1) * Math.abs(rowY));
+    const gridRoundoff = Math.max((Math.abs(rowY) * roundX + Math.abs(rowX) * roundY) / frameArea, (Math.abs(columnY) * roundX + Math.abs(columnX) * roundY) / frameArea);
+    if (!Number.isFinite(gridRoundoff) || gridRoundoff >= 0.125)
+        throw new Error('Terrain mesh XY precision is insufficient; use a local origin and a well-conditioned frame');
+    const errors = new Float64Array(field.width * field.height);
+    const covered = new Uint8Array(errors.length);
+    let sampleTests = 0, coveredSampleCount = 0, maxSampleError = 0;
+    for (let t = 0; t < mesh.indices.length; t += 3) {
+        const a = mesh.indices[t], b = mesh.indices[t + 1], c = mesh.indices[t + 2];
+        const ax = mesh.gridCoordinates[a * 2], ay = mesh.gridCoordinates[a * 2 + 1];
+        const bx = mesh.gridCoordinates[b * 2], by = mesh.gridCoordinates[b * 2 + 1];
+        const cx = mesh.gridCoordinates[c * 2], cy = mesh.gridCoordinates[c * 2 + 1];
+        const determinant = (bx - ax) * (cy - ay) - (by - ay) * (cx - ax);
+        if (!Number.isFinite(determinant) || determinant === 0)
+            throw new Error('Degenerate terrain mesh grid triangle');
+        const px = mesh.positions[a * 3], py = mesh.positions[a * 3 + 1];
+        const ux = mesh.positions[b * 3] - px, uy = mesh.positions[b * 3 + 1] - py;
+        const vx = mesh.positions[c * 3] - px, vy = mesh.positions[c * 3 + 1] - py;
+        const xyArea = ux * vy - uy * vx;
+        if (!Number.isFinite(xyArea) || xyArea === 0)
+            throw new Error('Degenerate terrain mesh XY triangle');
+        for (let row = Math.max(0, Math.min(ay, by, cy) - 1); row <= Math.min(field.height - 1, Math.max(ay, by, cy) + 1); row++)
+            for (let column = Math.max(0, Math.min(ax, bx, cx) - 1); column <= Math.min(field.width - 1, Math.max(ax, bx, cx) + 1); column++) {
+                if (sampleTests++ === limit)
+                    throw new Error('Terrain mesh sample-test budget exceeded');
+                const dx = baseX + (column + shift) * columnX + (row + shift) * rowX - px;
+                const dy = baseY + (column + shift) * columnY + (row + shift) * rowY - py;
+                const sign = Math.sign(xyArea), area = Math.abs(xyArea);
+                const nu = (dx * vy - dy * vx) * sign;
+                const nv = (ux * dy - uy * dx) * sign;
+                const tolerance = 16 *
+                    Number.EPSILON *
+                    (Math.abs(dx * vy) + Math.abs(dy * vx) + Math.abs(ux * dy) + Math.abs(uy * dx) + area);
+                if (nu < -tolerance || nv < -tolerance || nu + nv > area + tolerance)
+                    continue;
+                const u = nu / area, v = nv / area, w = (area - nu - nv) / area;
+                const height = field.getHeight(column, row);
+                if (height === undefined)
+                    continue;
+                const predicted = w * mesh.positions[a * 3 + 2] +
+                    u * mesh.positions[b * 3 + 2] +
+                    v * mesh.positions[c * 3 + 2];
+                // Error-free TwoDiff retains the low part lost when rebasing source Z.
+                // Comparing only with the rounded local height would certify that loss as zero.
+                const localHeight = height - mesh.origin[2];
+                const virtualOrigin = height - localHeight;
+                const remainder = height - (localHeight + virtualOrigin) + (virtualOrigin - mesh.origin[2]);
+                const error = Math.abs(predicted - localHeight - remainder);
+                if (!Number.isFinite(error))
+                    throw new Error('Terrain mesh error arithmetic overflow');
+                const index = row * field.width + column;
+                if (!covered[index]) {
+                    covered[index] = 1;
+                    coveredSampleCount++;
+                }
+                errors[index] = Math.max(errors[index], error);
+                maxSampleError = Math.max(maxSampleError, error);
+            }
+    }
+    let squares = 0;
+    if (maxSampleError)
+        for (const error of errors)
+            squares += (error / maxSampleError) ** 2;
+    return {
+        maxSampleError,
+        rmsSampleError: coveredSampleCount
+            ? maxSampleError * Math.sqrt(squares / coveredSampleCount)
+            : 0,
+        coveredSampleCount,
+        uncoveredSampleCount: field.validCount - coveredSampleCount,
+        sampleTests
+    };
+}
+//# sourceMappingURL=mesh-error.js.map

package/dist/terrain/mesh-error.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh-error.js","sourceRoot":"","sources":["../../src/terrain/mesh-error.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAG5D,OAAO,EAAC,uBAAuB,EAAuB,uBAAoB;AAU1E;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAkB,EAClB,IAAqB,EACrB,UAAqC,EAAE;IAEvC,uBAAuB,CAAC,IAAI,CAAC,CAAC;IAC9B,IACE,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK;QAC1B,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;QAC5B,IAAI,CAAC,eAAe,KAAK,KAAK,CAAC,eAAe;QAE9C,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,OAAO,CAAC,cAAc,IAAI,QAAU,CAAC;IACnD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC;QAC3C,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,+FAA+F;IAC/F,MAAM,KAAK,GAAG,KAAK,CAAC,YAAY,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAC3C,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC9C,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;YACpC,MAAM,QAAQ,GACZ,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC;gBAClB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;gBACjB,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC;gBAC1B,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,QAAQ;gBACzE,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAC5C,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3C,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,UAAU,EACzC,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;IAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI,CAAC,CAAC;IAC5D,6EAA6E;IAC7E,kFAAkF;IAClF,kFAAkF;IAClF,MAAM,MAAM,GACV,EAAE;QACF,MAAM,CAAC,OAAO;QACd,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAClG,MAAM,MAAM,GACV,EAAE;QACF,MAAM,CAAC,OAAO;QACd,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAClG,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,SAAS,EAC/D,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,GAAG,SAAS,CACtE,CAAC;IACF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,YAAY,IAAI,KAAK;QACzD,MAAM,IAAI,KAAK,CACb,4FAA4F,CAC7F,CAAC;IACJ,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5D,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC9C,IAAI,WAAW,GAAG,CAAC,EACjB,kBAAkB,GAAG,CAAC,EACtB,cAAc,GAAG,CAAC,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAChD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EACvB,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EACvB,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,EACpC,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,EACpC,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,EACpC,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,WAAW,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QAClE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,WAAW,KAAK,CAAC;YACpD,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAC9B,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EACnC,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EACnC,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,KAAK,CAAC;YAC1C,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACzD,KACE,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAC/C,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAC3D,GAAG,EAAE;YAEL,KACE,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAClD,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAC7D,MAAM,EAAE,EACR,CAAC;gBACD,IAAI,WAAW,EAAE,KAAK,KAAK;oBAAE,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;gBACzF,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,OAAO,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;gBAC1E,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,OAAO,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;gBAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAC5B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;gBACtC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;gBACtC,MAAM,SAAS,GACb,EAAE;oBACF,MAAM,CAAC,OAAO;oBACd,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;gBACzF,IAAI,EAAE,GAAG,CAAC,SAAS,IAAI,EAAE,GAAG,CAAC,SAAS,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,GAAG,SAAS;oBAAE,SAAS;gBAC/E,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,EACjB,CAAC,GAAG,EAAE,GAAG,IAAI,EACb,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;gBAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBAC5C,IAAI,MAAM,KAAK,SAAS;oBAAE,SAAS;gBACnC,MAAM,SAAS,GACb,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC7B,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC7B,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChC,uEAAuE;gBACvE,gFAAgF;gBAChF,MAAM,WAAW,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5C,MAAM,aAAa,GAAG,MAAM,GAAG,WAAW,CAAC;gBAC3C,MAAM,SAAS,GAAG,MAAM,GAAG,CAAC,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5F,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,WAAW,GAAG,SAAS,CAAC,CAAC;gBAC5D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;oBAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;gBACvF,MAAM,KAAK,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC;gBACzC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;oBACpB,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBACnB,kBAAkB,EAAE,CAAC;gBACvB,CAAC;gBACD,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC/C,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;YACnD,CAAC;IACL,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,cAAc;QAAE,KAAK,MAAM,KAAK,IAAI,MAAM;YAAE,OAAO,IAAI,CAAC,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IACzF,OAAO;QACL,cAAc;QACd,cAAc,EAAE,kBAAkB;YAChC,CAAC,CAAC,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,kBAAkB,CAAC;YAC1D,CAAC,CAAC,CAAC;QACL,kBAAkB;QAClB,oBAAoB,EAAE,KAAK,CAAC,UAAU,GAAG,kBAAkB;QAC3D,WAAW;KACZ,CAAC;AACJ,CAAC"}

package/dist/terrain/mesh-skirts.d.ts

@@ -0,0 +1,29 @@
+export type TerrainSkirtOptions = {
+    /** Positive downward distance in the same units as positions. */
+    height: number;
+    /** Optional unordered pairs of boundary vertex IDs. Omit to skirt every boundary, including holes. */
+    edges?: Uint16Array | Uint32Array;
+    maxVertices?: number;
+    maxTriangles?: number;
+};
+export type TerrainSkirtMesh = {
+    positions: Float32Array | Float64Array;
+    indices: Uint16Array | Uint32Array;
+    /** Each appended vertex maps to its source vertex; original vertices are unchanged. */
+    sourceVertexIndices: Uint32Array;
+    skirtVertexOffset: number;
+    skirtTriangleOffset: number;
+    /** One for original triangles, zero for visual skirt triangles. */
+    triangleValidity: Uint8Array;
+    /** Local XYZ bounds including the skirt. */
+    bounds: readonly [readonly [number, number, number], readonly [number, number, number]];
+};
+/** Build detached visual skirts from the directed boundary of an upward-facing terrain mesh.
+ * Supplied edge pairs select boundaries but do not determine winding. Shared edges must have
+ * opposite directions; nonmanifold, degenerate, and downward-facing source triangles are rejected.
+ */
+export declare function createTerrainSkirt(mesh: {
+    positions: Float32Array | Float64Array;
+    indices: Uint16Array | Uint32Array;
+}, options: TerrainSkirtOptions): TerrainSkirtMesh;
+//# sourceMappingURL=mesh-skirts.d.ts.map

package/dist/terrain/mesh-skirts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh-skirts.d.ts","sourceRoot":"","sources":["../../src/terrain/mesh-skirts.ts"],"names":[],"mappings":"AAIA,MAAM,MAAM,mBAAmB,GAAG;IAChC,iEAAiE;IACjE,MAAM,EAAE,MAAM,CAAC;IACf,sGAAsG;IACtG,KAAK,CAAC,EAAE,WAAW,GAAG,WAAW,CAAC;IAClC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG;IAC7B,SAAS,EAAE,YAAY,GAAG,YAAY,CAAC;IACvC,OAAO,EAAE,WAAW,GAAG,WAAW,CAAC;IACnC,uFAAuF;IACvF,mBAAmB,EAAE,WAAW,CAAC;IACjC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,mEAAmE;IACnE,gBAAgB,EAAE,UAAU,CAAC;IAC7B,4CAA4C;IAC5C,MAAM,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CACzF,CAAC;AAEF;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE;IAAC,SAAS,EAAE,YAAY,GAAG,YAAY,CAAC;IAAC,OAAO,EAAE,WAAW,GAAG,WAAW,CAAA;CAAC,EAClF,OAAO,EAAE,mBAAmB,GAC3B,gBAAgB,CAgIlB"}

package/dist/terrain/mesh-skirts.js

@@ -0,0 +1,119 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+/** Build detached visual skirts from the directed boundary of an upward-facing terrain mesh.
+ * Supplied edge pairs select boundaries but do not determine winding. Shared edges must have
+ * opposite directions; nonmanifold, degenerate, and downward-facing source triangles are rejected.
+ */
+export function createTerrainSkirt(mesh, options) {
+    const { positions, indices } = mesh, { height, edges } = options;
+    const maxVertices = options.maxVertices ?? 2000000, maxTriangles = options.maxTriangles ?? 4000000;
+    if (!Number.isFinite(height) ||
+        height <= 0 ||
+        !Number.isSafeInteger(maxVertices) ||
+        maxVertices < 0 ||
+        maxVertices > 0xffffffff ||
+        !Number.isSafeInteger(maxTriangles) ||
+        maxTriangles < 0 ||
+        maxTriangles > 0xffffffff)
+        throw new Error('Invalid terrain skirt height or capacity');
+    if (!(positions instanceof Float32Array || positions instanceof Float64Array) ||
+        positions.length < 3 ||
+        positions.length % 3 ||
+        !positions.every(Number.isFinite) ||
+        !(indices instanceof Uint16Array || indices instanceof Uint32Array) ||
+        indices.length % 3 ||
+        positions.length / 3 > maxVertices ||
+        indices.length / 3 > maxTriangles)
+        throw new Error('Invalid terrain skirt mesh or capacity');
+    if (edges !== undefined &&
+        (!(edges instanceof Uint16Array || edges instanceof Uint32Array) || edges.length % 2))
+        throw new Error('Invalid terrain skirt edge pairs');
+    const vertexCount = positions.length / 3, triangleCount = indices.length / 3;
+    const boundary = new Map();
+    for (let i = 0; i < indices.length; i += 3) {
+        const ids = [indices[i], indices[i + 1], indices[i + 2]];
+        if (ids.some(id => id >= vertexCount))
+            throw new Error('Terrain skirt index out of range');
+        const [a, b, c] = ids.map(id => id * 3);
+        const area = (positions[b] - positions[a]) * (positions[c + 1] - positions[a + 1]) -
+            (positions[b + 1] - positions[a + 1]) * (positions[c] - positions[a]);
+        if (!Number.isFinite(area) || area <= 0)
+            throw new Error('Terrain skirt requires upward nondegenerate XY triangles');
+        for (let j = 0; j < 3; j++) {
+            const u = ids[j], v = ids[(j + 1) % 3], key = edgeKey(u, v), prior = boundary.get(key);
+            if (!prior)
+                boundary.set(key, { a: u, b: v, count: 1 });
+            else {
+                if (prior.count !== 1 || prior.a !== v || prior.b !== u)
+                    throw new Error('Terrain skirt mesh has nonmanifold or inconsistent edges');
+                prior.count++;
+            }
+        }
+    }
+    let selected;
+    if (edges) {
+        selected = [];
+        const used = new Set();
+        for (let i = 0; i < edges.length; i += 2) {
+            const key = edgeKey(edges[i], edges[i + 1]), edge = boundary.get(key);
+            if (!edge || edge.count !== 1 || used.has(key))
+                throw new Error('Terrain skirt selection must contain unique boundary edges');
+            used.add(key);
+            selected.push(edge);
+        }
+    }
+    else
+        selected = [...boundary.values()].filter(edge => edge.count === 1);
+    const outputVertices = vertexCount + selected.length * 2, outputTriangles = triangleCount + selected.length * 2;
+    if (!Number.isSafeInteger(outputVertices) ||
+        outputVertices > maxVertices ||
+        outputVertices > 0xffffffff ||
+        !Number.isSafeInteger(outputTriangles) ||
+        outputTriangles > maxTriangles)
+        throw new Error('Terrain skirt output capacity exceeded');
+    const resultPositions = positions instanceof Float32Array
+        ? new Float32Array(outputVertices * 3)
+        : new Float64Array(outputVertices * 3);
+    resultPositions.set(positions);
+    const resultIndices = indices instanceof Uint16Array && outputVertices <= 65536
+        ? new Uint16Array(outputTriangles * 3)
+        : new Uint32Array(outputTriangles * 3);
+    resultIndices.set(indices);
+    const sourceVertexIndices = new Uint32Array(selected.length * 2), triangleValidity = new Uint8Array(outputTriangles);
+    triangleValidity.fill(1, 0, triangleCount);
+    for (let i = 0; i < selected.length; i++) {
+        const { a, b } = selected[i], lowerA = vertexCount + 2 * i, lowerB = lowerA + 1;
+        for (const [source, target] of [
+            [a, lowerA],
+            [b, lowerB]
+        ]) {
+            resultPositions.set(positions.subarray(3 * source, 3 * source + 3), 3 * target);
+            resultPositions[3 * target + 2] = positions[3 * source + 2] - height;
+            if (!Number.isFinite(resultPositions[3 * target + 2]) ||
+                resultPositions[3 * target + 2] >= positions[3 * source + 2])
+                throw new Error('Terrain skirt height cannot be represented in position precision');
+            sourceVertexIndices[target - vertexCount] = source;
+        }
+        resultIndices.set([a, lowerB, b, lowerB, a, lowerA], indices.length + i * 6);
+    }
+    const min = [Infinity, Infinity, Infinity], max = [-Infinity, -Infinity, -Infinity];
+    for (let i = 0; i < resultPositions.length; i++) {
+        const axis = i % 3;
+        min[axis] = Math.min(min[axis], resultPositions[i]);
+        max[axis] = Math.max(max[axis], resultPositions[i]);
+    }
+    return {
+        positions: resultPositions,
+        indices: resultIndices,
+        sourceVertexIndices,
+        skirtVertexOffset: vertexCount,
+        skirtTriangleOffset: triangleCount,
+        triangleValidity,
+        bounds: [min, max]
+    };
+}
+function edgeKey(a, b) {
+    return a < b ? `${a},${b}` : `${b},${a}`;
+}
+//# sourceMappingURL=mesh-skirts.js.map

package/dist/terrain/mesh-skirts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh-skirts.js","sourceRoot":"","sources":["../../src/terrain/mesh-skirts.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAwB5D;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAkF,EAClF,OAA4B;IAE5B,MAAM,EAAC,SAAS,EAAE,OAAO,EAAC,GAAG,IAAI,EAC/B,EAAC,MAAM,EAAE,KAAK,EAAC,GAAG,OAAO,CAAC;IAC5B,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,OAAS,EAClD,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,OAAS,CAAC;IACnD,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;QACxB,MAAM,IAAI,CAAC;QACX,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC;QAClC,WAAW,GAAG,CAAC;QACf,WAAW,GAAG,UAAU;QACxB,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC;QACnC,YAAY,GAAG,CAAC;QAChB,YAAY,GAAG,UAAU;QAEzB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,IACE,CAAC,CAAC,SAAS,YAAY,YAAY,IAAI,SAAS,YAAY,YAAY,CAAC;QACzE,SAAS,CAAC,MAAM,GAAG,CAAC;QACpB,SAAS,CAAC,MAAM,GAAG,CAAC;QACpB,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;QACjC,CAAC,CAAC,OAAO,YAAY,WAAW,IAAI,OAAO,YAAY,WAAW,CAAC;QACnE,OAAO,CAAC,MAAM,GAAG,CAAC;QAClB,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,WAAW;QAClC,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,YAAY;QAEjC,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,IACE,KAAK,KAAK,SAAS;QACnB,CAAC,CAAC,CAAC,KAAK,YAAY,WAAW,IAAI,KAAK,YAAY,WAAW,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAErF,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACtD,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EACtC,aAAa,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiD,CAAC;IAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,WAAW,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QAC3F,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,IAAI,GACR,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrE,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;QAC9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EACd,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EACpB,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EACnB,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK;gBAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;iBACjD,CAAC;gBACJ,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC;oBACrD,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;gBAC9E,KAAK,CAAC,KAAK,EAAE,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,QAAkC,CAAC;IACvC,IAAI,KAAK,EAAE,CAAC;QACV,QAAQ,GAAG,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EACzC,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAC5C,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;YAChF,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;;QAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;IAC1E,MAAM,cAAc,GAAG,WAAW,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EACtD,eAAe,GAAG,aAAa,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACxD,IACE,CAAC,MAAM,CAAC,aAAa,CAAC,cAAc,CAAC;QACrC,cAAc,GAAG,WAAW;QAC5B,cAAc,GAAG,UAAU;QAC3B,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC;QACtC,eAAe,GAAG,YAAY;QAE9B,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,MAAM,eAAe,GACnB,SAAS,YAAY,YAAY;QAC/B,CAAC,CAAC,IAAI,YAAY,CAAC,cAAc,GAAG,CAAC,CAAC;QACtC,CAAC,CAAC,IAAI,YAAY,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;IAC3C,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC/B,MAAM,aAAa,GACjB,OAAO,YAAY,WAAW,IAAI,cAAc,IAAI,KAAK;QACvD,CAAC,CAAC,IAAI,WAAW,CAAC,eAAe,GAAG,CAAC,CAAC;QACtC,CAAC,CAAC,IAAI,WAAW,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;IAC3C,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC3B,MAAM,mBAAmB,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,EAC9D,gBAAgB,GAAG,IAAI,UAAU,CAAC,eAAe,CAAC,CAAC;IACrD,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,EAAC,CAAC,EAAE,CAAC,EAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,EACxB,MAAM,GAAG,WAAW,GAAG,CAAC,GAAG,CAAC,EAC5B,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI;YAC7B,CAAC,CAAC,EAAE,MAAM,CAAC;YACX,CAAC,CAAC,EAAE,MAAM,CAAC;SACZ,EAAE,CAAC;YACF,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;YAChF,eAAe,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;YACrE,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;gBACjD,eAAe,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;gBAE5D,MAAM,IAAI,KAAK,CAAC,kEAAkE,CAAC,CAAC;YACtF,mBAAmB,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,MAAM,CAAC;QACrD,CAAC;QACD,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/E,CAAC;IACD,MAAM,GAAG,GAA6B,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAClE,GAAG,GAA6B,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC;IACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,OAAO;QACL,SAAS,EAAE,eAAe;QAC1B,OAAO,EAAE,aAAa;QACtB,mBAAmB;QACnB,iBAAiB,EAAE,WAAW;QAC9B,mBAAmB,EAAE,aAAa;QAClC,gBAAgB;QAChB,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;KACnB,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC3C,CAAC"}

package/dist/terrain/mesh-stitch.d.ts

@@ -0,0 +1,35 @@
+import type { TerrainMeshEdge } from "./mesh-data.js";
+/** Fractional grid coordinates permit edge insertion across arbitrary resolution ratios. */
+export type TerrainSeamMesh = {
+    positions: Float64Array;
+    indices: Uint32Array;
+    gridCoordinates: Float64Array | Uint32Array;
+    width: number;
+    height: number;
+    origin: readonly [number, number, number];
+    heightReference: string;
+};
+export type TerrainMeshStitchOptions = {
+    /** Increasing normalized ranges along each grid side. Default [0,1]. */
+    rangeA?: readonly [number, number];
+    rangeB?: readonly [number, number];
+    /** Absolute XY alignment tolerance; input A owns the seam profile. */
+    coordinateTolerance?: number;
+    maxHeightAdjustment?: number;
+    maxVertices?: number;
+    maxTriangles?: number;
+    maxBoundaryVertices?: number;
+};
+/** Conform ranges of two straight grid sides. Split boundary triangles at the union
+ * of edge vertices and move B's edge onto A's profile. Returns detached meshes in
+ * A's origin plus identical ordered seam positions. Input sides must be complete; ranges may cover partial sides.
+ * This changes the displayed surface; it does not change source DEMs or certify error.
+ */
+export declare function stitchTerrainMeshEdges(a: TerrainSeamMesh, edgeA: TerrainMeshEdge, b: TerrainSeamMesh, edgeB: TerrainMeshEdge, options?: TerrainMeshStitchOptions): {
+    a: TerrainSeamMesh;
+    b: TerrainSeamMesh;
+    seamA: Uint32Array;
+    seamB: Uint32Array;
+    maxHeightAdjustment: number;
+};
+//# sourceMappingURL=mesh-stitch.d.ts.map

package/dist/terrain/mesh-stitch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh-stitch.d.ts","sourceRoot":"","sources":["../../src/terrain/mesh-stitch.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,eAAe,EAAC,uBAAoB;AAEjD,4FAA4F;AAC5F,MAAM,MAAM,eAAe,GAAG;IAC5B,SAAS,EAAE,YAAY,CAAC;IACxB,OAAO,EAAE,WAAW,CAAC;IACrB,eAAe,EAAE,YAAY,GAAG,WAAW,CAAC;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1C,eAAe,EAAE,MAAM,CAAC;CACzB,CAAC;AACF,MAAM,MAAM,wBAAwB,GAAG;IACrC,wEAAwE;IACxE,MAAM,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,sEAAsE;IACtE,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,CAAC,EAAE,eAAe,EAClB,KAAK,EAAE,eAAe,EACtB,CAAC,EAAE,eAAe,EAClB,KAAK,EAAE,eAAe,EACtB,OAAO,GAAE,wBAA6B,GACrC;IACD,CAAC,EAAE,eAAe,CAAC;IACnB,CAAC,EAAE,eAAe,CAAC;IACnB,KAAK,EAAE,WAAW,CAAC;IACnB,KAAK,EAAE,WAAW,CAAC;IACnB,mBAAmB,EAAE,MAAM,CAAC;CAC7B,CAuSA"}

package/dist/terrain/mesh-stitch.js

@@ -0,0 +1,267 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+/** Conform ranges of two straight grid sides. Split boundary triangles at the union
+ * of edge vertices and move B's edge onto A's profile. Returns detached meshes in
+ * A's origin plus identical ordered seam positions. Input sides must be complete; ranges may cover partial sides.
+ * This changes the displayed surface; it does not change source DEMs or certify error.
+ */
+export function stitchTerrainMeshEdges(a, edgeA, b, edgeB, options = {}) {
+    const maxVertices = options.maxVertices ?? 2000000, maxTriangles = options.maxTriangles ?? 4000000, maxBoundary = options.maxBoundaryVertices ?? 100000;
+    const tolerance = options.coordinateTolerance ?? 1e-8, heightLimit = options.maxHeightAdjustment ?? 0;
+    if (![maxVertices, maxTriangles, maxBoundary].every(n => Number.isSafeInteger(n) && n >= 0 && n <= 0xfffffffe) ||
+        !Number.isFinite(tolerance) ||
+        tolerance < 0 ||
+        !Number.isFinite(heightLimit) ||
+        heightLimit < 0)
+        throw new Error('Invalid terrain stitching limits');
+    const prepare = (mesh, side, range) => {
+        if (range.length !== 2 ||
+            !range.every(Number.isFinite) ||
+            range[0] < 0 ||
+            range[1] > 1 ||
+            range[1] <= range[0])
+            throw new Error('Invalid stitching side range');
+        if (!['minColumn', 'maxColumn', 'minRow', 'maxRow'].includes(side) ||
+            !Number.isSafeInteger(mesh.width) ||
+            !Number.isSafeInteger(mesh.height) ||
+            mesh.width < 2 ||
+            mesh.height < 2 ||
+            !(mesh.positions instanceof Float64Array) ||
+            mesh.positions.length % 3 ||
+            mesh.positions.length / 3 > maxVertices ||
+            !(mesh.indices instanceof Uint32Array) ||
+            mesh.indices.length % 3 ||
+            mesh.indices.length / 3 > maxTriangles ||
+            !(mesh.gridCoordinates instanceof Float64Array || mesh.gridCoordinates instanceof Uint32Array) ||
+            mesh.gridCoordinates.length !== (mesh.positions.length / 3) * 2 ||
+            mesh.origin.length !== 3 ||
+            !mesh.origin.every(Number.isFinite) ||
+            !mesh.positions.every(Number.isFinite) ||
+            typeof mesh.heightReference !== 'string')
+            throw new Error('Invalid terrain stitching mesh');
+        const positions = mesh.positions.slice();
+        for (let i = 0; i < positions.length; i++)
+            positions[i] += mesh.origin[i % 3] - a.origin[i % 3];
+        if (!positions.every(Number.isFinite))
+            throw new Error('Terrain stitching coordinate overflow');
+        const axis = side.endsWith('Column') ? 0 : 1, extent = axis ? mesh.height - 1 : mesh.width - 1, along = axis ? mesh.width - 1 : mesh.height - 1;
+        const value = side.startsWith('min') ? 0 : extent;
+        const used = new Set();
+        for (let i = 0; i < mesh.gridCoordinates.length; i += 2)
+            if (!Number.isFinite(mesh.gridCoordinates[i]) ||
+                !Number.isFinite(mesh.gridCoordinates[i + 1]) ||
+                mesh.gridCoordinates[i] < 0 ||
+                mesh.gridCoordinates[i] > mesh.width - 1 ||
+                mesh.gridCoordinates[i + 1] < 0 ||
+                mesh.gridCoordinates[i + 1] > mesh.height - 1)
+                throw new Error('Invalid stitching grid coordinates');
+        for (let i = 0; i < mesh.indices.length; i += 3) {
+            const ids = [mesh.indices[i], mesh.indices[i + 1], mesh.indices[i + 2]];
+            for (const id of ids) {
+                if (id >= positions.length / 3)
+                    throw new Error('Stitching index out of range');
+                if (mesh.gridCoordinates[2 * id + axis] === value)
+                    used.add(id);
+            }
+            const [p, q, r] = ids.map(id => id * 3);
+            const area = (positions[q] - positions[p]) * (positions[r + 1] - positions[p + 1]) -
+                (positions[q + 1] - positions[p + 1]) * (positions[r] - positions[p]);
+            if (!Number.isFinite(area) || area <= 0)
+                throw new Error('Stitching requires positive nondegenerate XY triangles');
+        }
+        if (used.size < 2 || used.size > maxBoundary)
+            throw new Error('Invalid stitching boundary capacity');
+        const ids = [...used].sort((u, v) => mesh.gridCoordinates[2 * u + 1 - axis] - mesh.gridCoordinates[2 * v + 1 - axis]);
+        const ts = ids.map(id => mesh.gridCoordinates[2 * id + 1 - axis] / along);
+        if (ts[0] !== 0 || ts[ts.length - 1] !== 1 || ts.some((t, i) => i > 0 && t <= ts[i - 1]))
+            throw new Error('Stitching requires a complete unique side');
+        const pairs = new Map();
+        for (let i = 1; i < ids.length; i++)
+            pairs.set(pair(ids[i - 1], ids[i]), 0);
+        let direction = 0;
+        for (let i = 0; i < mesh.indices.length; i += 3)
+            for (let j = 0; j < 3; j++) {
+                const u = mesh.indices[i + j], v = mesh.indices[i + ((j + 1) % 3)], key = pair(u, v);
+                if (pairs.has(key)) {
+                    pairs.set(key, pairs.get(key) + 1);
+                    const nextDirection = Math.sign(mesh.gridCoordinates[2 * v + 1 - axis] - mesh.gridCoordinates[2 * u + 1 - axis]);
+                    if (direction && direction !== nextDirection)
+                        throw new Error('Inconsistent stitching boundary orientation');
+                    direction = nextDirection;
+                }
+                else if (used.has(u) && used.has(v))
+                    throw new Error('Nonconforming input boundary');
+            }
+        if ([...pairs.values()].some(count => count !== 1))
+            throw new Error('Stitching boundary has holes or nonmanifold edges');
+        return {
+            mesh,
+            positions,
+            ids,
+            ts: ts.map(t => (t - range[0]) / (range[1] - range[0])),
+            axis,
+            along,
+            value,
+            direction,
+            range
+        };
+    };
+    const pa = prepare(a, edgeA, options.rangeA ?? [0, 1]), pb = prepare(b, edgeB, options.rangeB ?? [0, 1]);
+    if (a.heightReference !== b.heightReference)
+        throw new Error('Stitching height references differ');
+    const endpoint = (p, t) => {
+        let i = 0;
+        while (i + 1 < p.ts.length - 1 && t > p.ts[i + 1])
+            i++;
+        const f = (t - p.ts[i]) / (p.ts[i + 1] - p.ts[i]);
+        return [0, 1, 2].map(k => {
+            const z0 = p.positions[3 * p.ids[i] + k], z1 = p.positions[3 * p.ids[i + 1] + k];
+            return f === 0 ? z0 : f === 1 ? z1 : z0 + (z1 - z0) * f;
+        });
+    };
+    const first = endpoint(pa, 0), last = endpoint(pa, 1);
+    const xyDistance = (p, q) => Math.hypot(p[0] - q[0], p[1] - q[1]);
+    const reversed = xyDistance(first, endpoint(pb, 0)) > tolerance;
+    if (reversed) {
+        pb.ids.reverse();
+        pb.ts = pb.ts.reverse().map(t => 1 - t);
+        pb.direction *= -1;
+    }
+    // Range normalization and reversal can put equivalent rational knots a few
+    // ulps apart. Match B to A, retaining existing vertex IDs on each side. Never
+    // merge two distinct vertices from the same boundary.
+    const canonicalize = (values, anchors) => {
+        let cursor = 0;
+        const result = values.map(t => {
+            while (cursor + 1 < anchors.length && anchors[cursor + 1] <= t)
+                cursor++;
+            let nearest = anchors[cursor];
+            if (cursor + 1 < anchors.length && Math.abs(anchors[cursor + 1] - t) < Math.abs(nearest - t))
+                nearest = anchors[cursor + 1];
+            return Math.abs(t - nearest) <= 8 * Number.EPSILON * Math.max(1, Math.abs(t)) ? nearest : t;
+        });
+        if (result.some((t, i) => i > 0 && t <= result[i - 1]))
+            throw new Error('Stitching knots are numerically indistinguishable');
+        return result;
+    };
+    pa.ts = canonicalize(pa.ts, [0, 1]);
+    pb.ts = canonicalize(pb.ts, [...new Set([0, 1, ...pa.ts])].sort((x, y) => x - y));
+    if (xyDistance(first, endpoint(pb, 0)) > tolerance ||
+        xyDistance(last, endpoint(pb, 1)) > tolerance ||
+        pa.direction === pb.direction)
+        throw new Error('Stitching sides must coincide and have opposite interiors');
+    const startX = first[0], startY = first[1], dx = last[0] - startX, dy = last[1] - startY;
+    if (!Number.isFinite(Math.hypot(dx, dy)) || Math.hypot(dx, dy) === 0)
+        throw new Error('Invalid stitching side length');
+    for (const p of [pa, pb])
+        for (let i = 0; i < p.ids.length; i++)
+            if (Math.hypot(p.positions[3 * p.ids[i]] - (startX + dx * p.ts[i]), p.positions[3 * p.ids[i] + 1] - (startY + dy * p.ts[i])) > tolerance)
+                throw new Error('Stitching requires straight affine sides');
+    const ts = [...new Set([0, 1, ...pa.ts, ...pb.ts].filter(t => t >= 0 && t <= 1))].sort((u, v) => u - v);
+    if (ts.length > maxBoundary)
+        throw new Error('Stitching boundary capacity exceeded');
+    const xyz = new Float64Array(ts.length * 3);
+    let segment = 0, maxHeightAdjustment = 0;
+    for (let i = 0; i < ts.length; i++) {
+        while (segment + 1 < pa.ts.length - 1 && ts[i] > pa.ts[segment + 1])
+            segment++;
+        const fraction = (ts[i] - pa.ts[segment]) / (pa.ts[segment + 1] - pa.ts[segment]);
+        for (let k = 0; k < 3; k++) {
+            const v0 = pa.positions[3 * pa.ids[segment] + k], v1 = pa.positions[3 * pa.ids[segment + 1] + k];
+            xyz[3 * i + k] = fraction === 0 ? v0 : fraction === 1 ? v1 : v0 + (v1 - v0) * fraction;
+        }
+    }
+    if (!xyz.every(Number.isFinite))
+        throw new Error('Stitching interpolation overflow');
+    // The difference of two linear profiles reaches its maximum at their union of knots.
+    segment = 0;
+    for (let i = 0; i < ts.length; i++) {
+        while (segment + 1 < pb.ts.length - 1 && ts[i] > pb.ts[segment + 1])
+            segment++;
+        const t = (ts[i] - pb.ts[segment]) / (pb.ts[segment + 1] - pb.ts[segment]);
+        const z0 = pb.positions[3 * pb.ids[segment] + 2], z1 = pb.positions[3 * pb.ids[segment + 1] + 2];
+        const z = t === 0 ? z0 : t === 1 ? z1 : z0 + (z1 - z0) * t;
+        const adjustment = Math.abs(z - xyz[3 * i + 2]);
+        if (!Number.isFinite(adjustment) || adjustment > heightLimit)
+            throw new Error('Stitching height adjustment exceeds limit');
+        maxHeightAdjustment = Math.max(maxHeightAdjustment, adjustment);
+    }
+    const rebuild = (p, reverse) => {
+        const lookup = new Map(p.ts.map((t, i) => [t, p.ids[i]]));
+        const added = ts.filter(t => !lookup.has(t)).length;
+        if (p.ids.length + added > maxBoundary)
+            throw new Error('Stitching output boundary capacity exceeded');
+        if (p.positions.length / 3 + added > maxVertices ||
+            p.mesh.indices.length / 3 + added > maxTriangles)
+            throw new Error('Stitching output capacity exceeded');
+        const positions = new Float64Array(p.positions.length + 3 * added), gridCoordinates = new Float64Array(p.mesh.gridCoordinates.length + 2 * added);
+        positions.set(p.positions);
+        gridCoordinates.set(p.mesh.gridCoordinates);
+        const seam = new Uint32Array(ts.length);
+        let next = p.positions.length / 3;
+        for (let i = 0; i < ts.length; i++) {
+            const existing = lookup.get(ts[i]), id = existing ?? next++;
+            positions.set(xyz.subarray(3 * i, 3 * i + 3), 3 * id);
+            if (existing === undefined) {
+                gridCoordinates[2 * id + p.axis] = p.value;
+                gridCoordinates[2 * id + 1 - p.axis] =
+                    (p.range[0] + (reverse ? 1 - ts[i] : ts[i]) * (p.range[1] - p.range[0])) * p.along;
+            }
+            seam[i] = id;
+            lookup.set(ts[i], id);
+        }
+        const splits = new Map();
+        const allTs = [...lookup.keys()].sort((x, y) => x - y);
+        let cursor = 0;
+        for (let i = 1; i < p.ids.length; i++) {
+            const list = [lookup.get(allTs[cursor++])];
+            while (cursor < allTs.length && allTs[cursor] <= p.ts[i])
+                list.push(lookup.get(allTs[cursor++]));
+            cursor--;
+            splits.set(pair(p.ids[i - 1], p.ids[i]), list);
+        }
+        const indices = [];
+        for (let i = 0; i < p.mesh.indices.length; i += 3) {
+            let split = false;
+            for (let j = 0; j < 3; j++) {
+                const u = p.mesh.indices[i + j], v = p.mesh.indices[i + ((j + 1) % 3)], w = p.mesh.indices[i + ((j + 2) % 3)];
+                const list = splits.get(pair(u, v));
+                if (!list || list.length === 2)
+                    continue;
+                const ordered = list[0] === u ? list : [...list].reverse();
+                for (let k = 1; k < ordered.length; k++)
+                    indices.push(ordered[k - 1], ordered[k], w);
+                split = true;
+                break;
+            }
+            if (!split)
+                indices.push(p.mesh.indices[i], p.mesh.indices[i + 1], p.mesh.indices[i + 2]);
+        }
+        for (let i = 0; i < indices.length; i += 3) {
+            const [u, v, w] = indices.slice(i, i + 3).map(id => id * 3);
+            const area = (positions[v] - positions[u]) * (positions[w + 1] - positions[u + 1]) -
+                (positions[v + 1] - positions[u + 1]) * (positions[w] - positions[u]);
+            if (!Number.isFinite(area) || area <= 0)
+                throw new Error('Stitching produced a degenerate or inverted triangle');
+        }
+        return {
+            mesh: {
+                positions,
+                gridCoordinates,
+                indices: Uint32Array.from(indices),
+                width: p.mesh.width,
+                height: p.mesh.height,
+                origin: Object.freeze([...a.origin]),
+                heightReference: a.heightReference
+            },
+            seam
+        };
+    };
+    const ra = rebuild(pa, false), rb = rebuild(pb, reversed);
+    return { a: ra.mesh, b: rb.mesh, seamA: ra.seam, seamB: rb.seam, maxHeightAdjustment };
+}
+function pair(a, b) {
+    return a < b ? `${a},${b}` : `${b},${a}`;
+}
+//# sourceMappingURL=mesh-stitch.js.map