@math.gl/geometry 5.0.0-alpha.17 → 5.0.0-alpha.19

package/dist/polygon/cut-by-grid.js

@@ -0,0 +1,221 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+/* eslint-disable max-statements, max-depth, complexity, no-unused-expressions */
+import { bitCode, intersect } from "./lineclip.js";
+import { getPointAtIndex, copy, push } from "./utils.js";
+export function cutPolylineByGrid(positions, options) {
+    const { size = 2, broken = false, gridResolution = 10, gridOffset = [0, 0], startIndex = 0, endIndex = positions.length } = options || {};
+    const numPoints = (endIndex - startIndex) / size;
+    let part = [];
+    const result = [part];
+    const a = getPointAtIndex(positions, 0, size, startIndex);
+    let b;
+    let codeB;
+    const cell = getGridCell(a, gridResolution, gridOffset, []);
+    const scratchPoint = [];
+    push(part, a);
+    for (let i = 1; i < numPoints; i++) {
+        b = getPointAtIndex(positions, i, size, startIndex, b);
+        codeB = bitCode(b, cell);
+        while (codeB) {
+            // find the intersection with the current cell
+            intersect(a, b, codeB, cell, scratchPoint);
+            const codeAlt = bitCode(scratchPoint, cell);
+            if (codeAlt) {
+                intersect(a, scratchPoint, codeAlt, cell, scratchPoint);
+                codeB = codeAlt;
+            }
+            push(part, scratchPoint);
+            // move to the next cell
+            copy(a, scratchPoint);
+            moveToNeighborCell(cell, gridResolution, codeB);
+            if (broken && part.length > size) {
+                part = [];
+                result.push(part);
+                push(part, a);
+            }
+            codeB = bitCode(b, cell);
+        }
+        push(part, b);
+        copy(a, b);
+    }
+    return broken ? result : result[0];
+}
+const TYPE_INSIDE = 0;
+const TYPE_BORDER = 1;
+/**
+ * Cuts a polygon by a pre-defined grid
+ */
+export function cutPolygonByGrid(positions, holeIndices = null, options) {
+    if (!positions.length) {
+        // input is empty
+        return [];
+    }
+    const { size = 2, gridResolution = 10, gridOffset = [0, 0], edgeTypes = false } = options || {};
+    const result = [];
+    const queue = [
+        {
+            pos: positions,
+            types: edgeTypes ? new Array(positions.length / size).fill(TYPE_BORDER) : null,
+            holes: holeIndices || []
+        }
+    ];
+    const bbox = [[], []];
+    // @ts-ignore
+    let cell = [];
+    // Recursively bisect polygon until every part fit in a single grid cell
+    while (queue.length) {
+        const { pos, types, holes } = queue.shift();
+        // Get the bounding box of the outer polygon
+        getBoundingBox(pos, size, holes[0] || pos.length, bbox);
+        cell = getGridCell(bbox[0], gridResolution, gridOffset, cell);
+        const code = bitCode(bbox[1], cell);
+        if (code) {
+            // Split the outer ring at the boundary
+            let parts = bisectPolygon(pos, types, size, 0, holes[0] || pos.length, cell, code);
+            const polygonLow = { pos: parts[0].pos, types: parts[0].types, holes: [] };
+            const polygonHigh = { pos: parts[1].pos, types: parts[1].types, holes: [] };
+            queue.push(polygonLow, polygonHigh);
+            // Split each hole at the boundary
+            for (let i = 0; i < holes.length; i++) {
+                parts = bisectPolygon(pos, types, size, holes[i], holes[i + 1] || pos.length, cell, code);
+                if (parts[0]) {
+                    polygonLow.holes.push(polygonLow.pos.length);
+                    polygonLow.pos = concatInPlace(polygonLow.pos, parts[0].pos);
+                    if (edgeTypes) {
+                        polygonLow.types = concatInPlace(polygonLow.types, parts[0].types);
+                    }
+                }
+                if (parts[1]) {
+                    polygonHigh.holes.push(polygonHigh.pos.length);
+                    polygonHigh.pos = concatInPlace(polygonHigh.pos, parts[1].pos);
+                    if (edgeTypes) {
+                        polygonHigh.types = concatInPlace(polygonHigh.types, parts[1].types);
+                    }
+                }
+            }
+        }
+        else {
+            // Polygon fits in a single cell, no more processing required
+            const polygon = { positions: pos };
+            if (edgeTypes) {
+                polygon.edgeTypes = types;
+            }
+            if (holes.length) {
+                polygon.holeIndices = holes;
+            }
+            result.push(polygon);
+        }
+    }
+    return result;
+}
+// edgeTypes:
+// TYPE_BORDER - edge from the original polygon
+// TYPE_INSIDE - inside the original polygon
+// eslint-disable-next-line max-params
+function bisectPolygon(positions, edgeTypes, size, startIndex, endIndex, bbox, edge) {
+    const numPoints = (endIndex - startIndex) / size;
+    const resultLow = [];
+    const resultHigh = [];
+    const typesLow = [];
+    const typesHigh = [];
+    const scratchPoint = [];
+    let p;
+    let side;
+    let type;
+    const prev = getPointAtIndex(positions, numPoints - 1, size, startIndex);
+    let prevSide = Math.sign(edge & 8 ? prev[1] - bbox[3] : prev[0] - bbox[2]);
+    let prevType = edgeTypes && edgeTypes[numPoints - 1];
+    let lowPointCount = 0;
+    let highPointCount = 0;
+    for (let i = 0; i < numPoints; i++) {
+        p = getPointAtIndex(positions, i, size, startIndex, p);
+        side = Math.sign(edge & 8 ? p[1] - bbox[3] : p[0] - bbox[2]);
+        type = edgeTypes && edgeTypes[startIndex / size + i];
+        // if segment goes through the boundary, add an intersection
+        if (side && prevSide && prevSide !== side) {
+            intersect(prev, p, edge, bbox, scratchPoint);
+            push(resultLow, scratchPoint) && typesLow.push(prevType);
+            push(resultHigh, scratchPoint) && typesHigh.push(prevType);
+        }
+        if (side <= 0) {
+            push(resultLow, p) && typesLow.push(type);
+            lowPointCount -= side;
+        }
+        else if (typesLow.length) {
+            typesLow[typesLow.length - 1] = TYPE_INSIDE;
+        }
+        if (side >= 0) {
+            push(resultHigh, p) && typesHigh.push(type);
+            highPointCount += side;
+        }
+        else if (typesHigh.length) {
+            typesHigh[typesHigh.length - 1] = TYPE_INSIDE;
+        }
+        copy(prev, p);
+        prevSide = side;
+        prevType = type;
+    }
+    return [
+        lowPointCount ? { pos: resultLow, types: edgeTypes && typesLow } : null,
+        highPointCount ? { pos: resultHigh, types: edgeTypes && typesHigh } : null
+    ];
+}
+function getGridCell(p, gridResolution, gridOffset, out) {
+    const left = Math.floor((p[0] - gridOffset[0]) / gridResolution) * gridResolution + gridOffset[0];
+    const bottom = Math.floor((p[1] - gridOffset[1]) / gridResolution) * gridResolution + gridOffset[1];
+    out[0] = left;
+    out[1] = bottom;
+    out[2] = left + gridResolution;
+    out[3] = bottom + gridResolution;
+    return out;
+}
+function moveToNeighborCell(cell, gridResolution, edge) {
+    if (edge & 8) {
+        // top
+        cell[1] += gridResolution;
+        cell[3] += gridResolution;
+    }
+    else if (edge & 4) {
+        // bottom
+        cell[1] -= gridResolution;
+        cell[3] -= gridResolution;
+    }
+    else if (edge & 2) {
+        // right
+        cell[0] += gridResolution;
+        cell[2] += gridResolution;
+    }
+    else if (edge & 1) {
+        // left
+        cell[0] -= gridResolution;
+        cell[2] -= gridResolution;
+    }
+}
+function getBoundingBox(positions, size, endIndex, out) {
+    let minX = Infinity;
+    let maxX = -Infinity;
+    let minY = Infinity;
+    let maxY = -Infinity;
+    for (let i = 0; i < endIndex; i += size) {
+        const x = positions[i];
+        const y = positions[i + 1];
+        minX = x < minX ? x : minX;
+        maxX = x > maxX ? x : maxX;
+        minY = y < minY ? y : minY;
+        maxY = y > maxY ? y : maxY;
+    }
+    out[0][0] = minX;
+    out[0][1] = minY;
+    out[1][0] = maxX;
+    out[1][1] = maxY;
+    return out;
+}
+function concatInPlace(arr1, arr2) {
+    for (let i = 0; i < arr2.length; i++) {
+        arr1.push(arr2[i]);
+    }
+    return arr1;
+}
+//# sourceMappingURL=cut-by-grid.js.map

package/dist/polygon/cut-by-grid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cut-by-grid.js","sourceRoot":"","sources":["../../src/polygon/cut-by-grid.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAE5D,iFAAiF;AACjF,OAAO,EAAC,OAAO,EAAE,SAAS,EAAc,sBAAmB;AAC3D,OAAO,EAAC,eAAe,EAAE,IAAI,EAAE,IAAI,EAAC,mBAAgB;AAUpD,MAAM,UAAU,iBAAiB,CAC/B,SAAuB,EACvB,OAOC;IAED,MAAM,EACJ,IAAI,GAAG,CAAC,EACR,MAAM,GAAG,KAAK,EACd,cAAc,GAAG,EAAE,EACnB,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EACnB,UAAU,GAAG,CAAC,EACd,QAAQ,GAAG,SAAS,CAAC,MAAM,EAC5B,GAAG,OAAO,IAAI,EAAE,CAAC;IAClB,MAAM,SAAS,GAAG,CAAC,QAAQ,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC;IACjD,IAAI,IAAI,GAAa,EAAE,CAAC;IACxB,MAAM,MAAM,GAAe,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,CAAC,GAAa,eAAe,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IACpE,IAAI,CAAW,CAAC;IAChB,IAAI,KAAa,CAAC;IAClB,MAAM,IAAI,GAAgB,WAAW,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;IACzE,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,CAAC,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;QACvD,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAEzB,OAAO,KAAK,EAAE,CAAC;YACb,8CAA8C;YAC9C,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;YAC3C,MAAM,OAAO,GAAG,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;YAC5C,IAAI,OAAO,EAAE,CAAC;gBACZ,SAAS,CAAC,CAAC,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;gBACxD,KAAK,GAAG,OAAO,CAAC;YAClB,CAAC;YACD,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YACzB,wBAAwB;YACxB,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;YAEtB,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,KAAK,CAAC,CAAC;YAChD,IAAI,MAAM,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;gBACjC,IAAI,GAAG,EAAE,CAAC;gBACV,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAChB,CAAC;YAED,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACb,CAAC;IAED,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,MAAM,WAAW,GAAG,CAAC,CAAC;AACtB,MAAM,WAAW,GAAG,CAAC,CAAC;AAgBtB;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAiC,EACjC,cAA6C,IAAI,EACjD,OAKC;IAED,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QACtB,iBAAiB;QACjB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,EAAC,IAAI,GAAG,CAAC,EAAE,cAAc,GAAG,EAAE,EAAE,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,GAAG,KAAK,EAAC,GAAG,OAAO,IAAI,EAAE,CAAC;IAC9F,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAiB;QAC1B;YACE,GAAG,EAAE,SAAS;YACd,KAAK,EAAE,SAAS,CAAC,CAAC,CAAE,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAc,CAAC,CAAC,CAAC,IAAI;YAC5F,KAAK,EAAE,WAAW,IAAI,EAAE;SACzB;KACF,CAAC;IACF,MAAM,IAAI,GAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAClC,aAAa;IACb,IAAI,IAAI,GAAgB,EAAE,CAAC;IAE3B,wEAAwE;IACxE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,EAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAE1C,4CAA4C;QAC5C,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxD,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;QAC9D,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAEpC,IAAI,IAAI,EAAE,CAAC;YACT,uCAAuC;YACvC,IAAI,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACnF,MAAM,UAAU,GAAsB,EAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAC,CAAC;YAC5F,MAAM,WAAW,GAAsB,EAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAC,CAAC;YAC7F,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;YAEpC,kCAAkC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBAE1F,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBACb,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAC7C,UAAU,CAAC,GAAG,GAAG,aAAa,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC7D,IAAI,SAAS,EAAE,CAAC;wBACd,UAAU,CAAC,KAAK,GAAG,aAAa,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBACrE,CAAC;gBACH,CAAC;gBACD,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBACb,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAC/C,WAAW,CAAC,GAAG,GAAG,aAAa,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBAC/D,IAAI,SAAS,EAAE,CAAC;wBACd,WAAW,CAAC,KAAK,GAAG,aAAa,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBACvE,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,6DAA6D;YAC7D,MAAM,OAAO,GAAY,EAAC,SAAS,EAAE,GAAG,EAAC,CAAC;YAC1C,IAAI,SAAS,EAAE,CAAC;gBACd,OAAO,CAAC,SAAS,GAAG,KAAK,CAAC;YAC5B,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBACjB,OAAO,CAAC,WAAW,GAAG,KAAK,CAAC;YAC9B,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,aAAa;AACb,+CAA+C;AAC/C,4CAA4C;AAC5C,sCAAsC;AACtC,SAAS,aAAa,CACpB,SAAiC,EACjC,SAA+B,EAC/B,IAAY,EACZ,UAAkB,EAClB,QAAgB,EAChB,IAAiB,EACjB,IAAY;IAKZ,MAAM,SAAS,GAAG,CAAC,QAAQ,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC;IACjD,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,IAAI,CAAW,CAAC;IAChB,IAAI,IAAY,CAAC;IACjB,IAAI,IAAY,CAAC;IACjB,MAAM,IAAI,GAAG,eAAe,CAAC,SAAS,EAAE,SAAS,GAAG,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IACzE,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,IAAI,QAAQ,GAAG,SAAS,IAAI,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IACrD,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,CAAC,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;QACvD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,GAAG,SAAS,IAAI,SAAS,CAAC,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QAErD,4DAA4D;QAC5D,IAAI,IAAI,IAAI,QAAQ,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC1C,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC;YAC7C,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,CAAC,UAAU,EAAE,YAAY,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7D,CAAC;QAED,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACd,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,aAAa,IAAI,IAAI,CAAC;QACxB,CAAC;aAAM,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC3B,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC;QAC9C,CAAC;QACD,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACd,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,cAAc,IAAI,IAAI,CAAC;QACzB,CAAC;aAAM,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;YAC5B,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC;QAChD,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACd,QAAQ,GAAG,IAAI,CAAC;QAChB,QAAQ,GAAG,IAAI,CAAC;IAClB,CAAC;IAED,OAAO;QACL,aAAa,CAAC,CAAC,CAAC,EAAC,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,IAAI,QAAQ,EAAC,CAAC,CAAC,CAAC,IAAI;QACrE,cAAc,CAAC,CAAC,CAAC,EAAC,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,IAAI,SAAS,EAAC,CAAC,CAAC,CAAC,IAAI;KACzE,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAClB,CAAW,EACX,cAAsB,EACtB,UAA4B,EAC5B,GAAa;IAEb,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,GAAG,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAClG,MAAM,MAAM,GACV,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,GAAG,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACvF,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACd,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IAChB,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,cAAc,CAAC;IAC/B,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,cAAc,CAAC;IACjC,OAAO,GAAkB,CAAC;AAC5B,CAAC;AAED,SAAS,kBAAkB,CAAC,IAAc,EAAE,cAAsB,EAAE,IAAY;IAC9E,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,MAAM;QACN,IAAI,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC;QAC1B,IAAI,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC;IAC5B,CAAC;SAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACpB,SAAS;QACT,IAAI,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC;QAC1B,IAAI,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC;IAC5B,CAAC;SAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACpB,QAAQ;QACR,IAAI,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC;QAC1B,IAAI,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC;IAC5B,CAAC;SAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACpB,OAAO;QACP,IAAI,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC;QAC1B,IAAI,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC;IAC5B,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACrB,SAAiC,EACjC,IAAY,EACZ,QAAgB,EAChB,GAAe;IAEf,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3B,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3B,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3B,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACjB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACjB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACjB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACjB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,aAAa,CAAC,IAAc,EAAE,IAAc;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/polygon/cut-by-mercator-bounds.d.ts

@@ -0,0 +1,17 @@
+import type { Polygon } from "./cut-by-grid.js";
+import type { NumericArray } from '@math.gl/core';
+/** https://user-images.githubusercontent.com/2059298/78465769-938b7a00-76ae-11ea-9b95-1f4c26425ab9.png */
+export declare function cutPolylineByMercatorBounds(positions: Readonly<NumericArray>, options?: {
+    size?: number;
+    startIndex?: number;
+    endIndex?: number;
+    normalize?: boolean;
+}): number[][];
+/** https://user-images.githubusercontent.com/2059298/78465770-94241080-76ae-11ea-809a-6a8534dac1d9.png */
+export declare function cutPolygonByMercatorBounds(positions: Readonly<NumericArray>, holeIndices?: Readonly<NumericArray> | null, options?: {
+    size?: number;
+    normalize?: boolean;
+    maxLatitude?: number;
+    edgeTypes?: boolean;
+}): Polygon[];
+//# sourceMappingURL=cut-by-mercator-bounds.d.ts.map

package/dist/polygon/cut-by-mercator-bounds.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cut-by-mercator-bounds.d.ts","sourceRoot":"","sources":["../../src/polygon/cut-by-mercator-bounds.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAC,OAAO,EAAC,yBAAsB;AAC3C,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,eAAe,CAAC;AAKhD,0GAA0G;AAC1G,wBAAgB,2BAA2B,CACzC,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC,EACjC,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB,GACA,MAAM,EAAE,EAAE,CAsBZ;AAED,0GAA0G;AAC1G,wBAAgB,0BAA0B,CACxC,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC,EACjC,WAAW,GAAE,QAAQ,CAAC,YAAY,CAAC,GAAG,IAAW,EACjD,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB,GACA,OAAO,EAAE,CAoDX"}

package/dist/polygon/cut-by-mercator-bounds.js

@@ -0,0 +1,149 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+import { cutPolylineByGrid, cutPolygonByGrid } from "./cut-by-grid.js";
+import { getPointAtIndex, push } from "./utils.js";
+// https://en.wikipedia.org/wiki/Web_Mercator_projection
+const DEFAULT_MAX_LATITUDE = 85.051129;
+/** https://user-images.githubusercontent.com/2059298/78465769-938b7a00-76ae-11ea-9b95-1f4c26425ab9.png */
+export function cutPolylineByMercatorBounds(positions, options) {
+    const { size = 2, startIndex = 0, endIndex = positions.length, normalize = true } = options || {};
+    // Remap longitudes so that each segment takes the shorter path
+    const newPositions = positions.slice(startIndex, endIndex);
+    wrapLongitudesForShortestPath(newPositions, size, 0, endIndex - startIndex);
+    const parts = cutPolylineByGrid(newPositions, {
+        size,
+        broken: true,
+        gridResolution: 360,
+        gridOffset: [-180, -180]
+    });
+    if (normalize) {
+        // Each part is guaranteed to be in a single copy of the world
+        // Map longitudes back to [-180, 180]
+        for (const part of parts) {
+            shiftLongitudesIntoRange(part, size);
+        }
+    }
+    return parts;
+}
+/** https://user-images.githubusercontent.com/2059298/78465770-94241080-76ae-11ea-809a-6a8534dac1d9.png */
+export function cutPolygonByMercatorBounds(positions, holeIndices = null, options) {
+    const { size = 2, normalize = true, edgeTypes = false } = options || {};
+    holeIndices = holeIndices || [];
+    const newPositions = [];
+    const newHoleIndices = [];
+    let srcStartIndex = 0;
+    let targetIndex = 0;
+    for (let ringIndex = 0; ringIndex <= holeIndices.length; ringIndex++) {
+        // srcStartIndex/srcEndIndex define the ring in the original positions
+        const srcEndIndex = holeIndices[ringIndex] || positions.length;
+        // targetStartIndex/targetIndex define the ring in newPositions
+        const targetStartIndex = targetIndex;
+        // In case the ring contains a pole (e.g. Antarctica), we'll have to insert vertices
+        // The insertion point is defined by the vertex closest to the pole
+        // Split the the ring by the insertion point when copying to newPositions
+        const splitIndex = findSplitIndex(positions, size, srcStartIndex, srcEndIndex);
+        for (let i = splitIndex; i < srcEndIndex; i++) {
+            newPositions[targetIndex++] = positions[i];
+        }
+        for (let i = srcStartIndex; i < splitIndex; i++) {
+            newPositions[targetIndex++] = positions[i];
+        }
+        // Remap longitudes so that each segment takes the shorter path
+        wrapLongitudesForShortestPath(newPositions, size, targetStartIndex, targetIndex);
+        // Handle the case when the ring contains a pole
+        insertPoleVertices(newPositions, size, targetStartIndex, targetIndex, options?.maxLatitude);
+        srcStartIndex = srcEndIndex;
+        newHoleIndices[ringIndex] = targetIndex;
+    }
+    newHoleIndices.pop();
+    const parts = cutPolygonByGrid(newPositions, newHoleIndices, {
+        size,
+        gridResolution: 360,
+        gridOffset: [-180, -180],
+        edgeTypes
+    });
+    if (normalize) {
+        // Each part is guaranteed to be in a single copy of the world
+        // Map longitudes back to [-180, 180]
+        for (const part of parts) {
+            // May mutate newPositions, which is created by us.
+            shiftLongitudesIntoRange(part.positions, size);
+        }
+    }
+    return parts;
+}
+/* Helpers */
+// See comments for insertPoleVertices
+function findSplitIndex(positions, size, startIndex, endIndex) {
+    let maxLat = -1;
+    let pointIndex = -1;
+    for (let i = startIndex + 1; i < endIndex; i += size) {
+        const lat = Math.abs(positions[i]);
+        if (lat > maxLat) {
+            maxLat = lat;
+            pointIndex = i - 1;
+        }
+    }
+    return pointIndex;
+}
+// https://user-images.githubusercontent.com/2059298/78857483-5987e400-79de-11ea-98fc-0631287a8431.png
+//
+// If the polygon contains a pole, to tesselate it correctly, we need to insert the edge
+// of map into the polygon. This requires adding two vertices that represent the pole, by
+// drawing a perpendicular line to the Mercator map edge from a selected vertex on the ring.
+//
+// We select the insertion position carefully so that the inserted line segments do not
+// intersect with the ring itself. This is ensured by findSplitIndex, which returns the
+// vertex closest to the pole.
+function insertPoleVertices(positions, size, startIndex, endIndex, maxLatitude = DEFAULT_MAX_LATITUDE) {
+    // Check if the ring contains a pole
+    const firstLng = positions[startIndex];
+    const lastLng = positions[endIndex - size];
+    if (Math.abs(firstLng - lastLng) > 180) {
+        // The ring does not make a round trip
+        // Add the nearest pole to the vertices so that the polygon tesselates correctly
+        const p = getPointAtIndex(positions, 0, size, startIndex);
+        // Copy the first vertex to the world of the last vertex
+        p[0] += Math.round((lastLng - firstLng) / 360) * 360;
+        push(positions, p);
+        // Project the copied vertex to the edge of the map
+        p[1] = Math.sign(p[1]) * maxLatitude;
+        push(positions, p);
+        // Project the first vertex to the edge of the map
+        p[0] = firstLng;
+        push(positions, p);
+    }
+}
+function wrapLongitudesForShortestPath(positions, size, startIndex, endIndex) {
+    let prevLng = positions[0];
+    let lng;
+    for (let i = startIndex; i < endIndex; i += size) {
+        lng = positions[i];
+        const delta = lng - prevLng;
+        if (delta > 180 || delta < -180) {
+            lng -= Math.round(delta / 360) * 360;
+        }
+        positions[i] = prevLng = lng;
+    }
+}
+function shiftLongitudesIntoRange(positions, size) {
+    let refLng;
+    const pointCount = positions.length / size;
+    // Find a longitude that is not on the edge of a world
+    // Which we will use to determine which world copy it is
+    for (let i = 0; i < pointCount; i++) {
+        refLng = positions[i * size];
+        if ((refLng + 180) % 360 !== 0) {
+            break;
+        }
+    }
+    const delta = -Math.round(refLng / 360) * 360;
+    if (delta === 0) {
+        return;
+    }
+    for (let i = 0; i < pointCount; i++) {
+        positions[i * size] += delta;
+    }
+}
+//# sourceMappingURL=cut-by-mercator-bounds.js.map

package/dist/polygon/cut-by-mercator-bounds.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cut-by-mercator-bounds.js","sourceRoot":"","sources":["../../src/polygon/cut-by-mercator-bounds.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAE5D,OAAO,EAAC,iBAAiB,EAAE,gBAAgB,EAAC,yBAAsB;AAClE,OAAO,EAAC,eAAe,EAAE,IAAI,EAAC,mBAAgB;AAI9C,wDAAwD;AACxD,MAAM,oBAAoB,GAAG,SAAS,CAAC;AAEvC,0GAA0G;AAC1G,MAAM,UAAU,2BAA2B,CACzC,SAAiC,EACjC,OAKC;IAED,MAAM,EAAC,IAAI,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,EAAE,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,EAAC,GAAG,OAAO,IAAI,EAAE,CAAC;IAEhG,+DAA+D;IAC/D,MAAM,YAAY,GAAG,SAAS,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAC3D,6BAA6B,CAAC,YAAY,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;IAE5E,MAAM,KAAK,GAAG,iBAAiB,CAAC,YAAY,EAAE;QAC5C,IAAI;QACJ,MAAM,EAAE,IAAI;QACZ,cAAc,EAAE,GAAG;QACnB,UAAU,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;KACzB,CAAe,CAAC;IAEjB,IAAI,SAAS,EAAE,CAAC;QACd,8DAA8D;QAC9D,qCAAqC;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,wBAAwB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,0GAA0G;AAC1G,MAAM,UAAU,0BAA0B,CACxC,SAAiC,EACjC,cAA6C,IAAI,EACjD,OAKC;IAED,MAAM,EAAC,IAAI,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,EAAE,SAAS,GAAG,KAAK,EAAC,GAAG,OAAO,IAAI,EAAE,CAAC;IACtE,WAAW,GAAG,WAAW,IAAI,EAAE,CAAC;IAChC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,IAAI,WAAW,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC;QACrE,sEAAsE;QACtE,MAAM,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,MAAM,CAAC;QAC/D,+DAA+D;QAC/D,MAAM,gBAAgB,GAAG,WAAW,CAAC;QAErC,oFAAoF;QACpF,mEAAmE;QACnE,yEAAyE;QACzE,MAAM,UAAU,GAAG,cAAc,CAAC,SAAS,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;QAC/E,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,YAAY,CAAC,WAAW,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,YAAY,CAAC,WAAW,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;QAED,+DAA+D;QAC/D,6BAA6B,CAAC,YAAY,EAAE,IAAI,EAAE,gBAAgB,EAAE,WAAW,CAAC,CAAC;QAEjF,gDAAgD;QAChD,kBAAkB,CAAC,YAAY,EAAE,IAAI,EAAE,gBAAgB,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QAE5F,aAAa,GAAG,WAAW,CAAC;QAC5B,cAAc,CAAC,SAAS,CAAC,GAAG,WAAW,CAAC;IAC1C,CAAC;IACD,cAAc,CAAC,GAAG,EAAE,CAAC;IAErB,MAAM,KAAK,GAAG,gBAAgB,CAAC,YAAY,EAAE,cAAc,EAAE;QAC3D,IAAI;QACJ,cAAc,EAAE,GAAG;QACnB,UAAU,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;QACxB,SAAS;KACV,CAAC,CAAC;IAEH,IAAI,SAAS,EAAE,CAAC;QACd,8DAA8D;QAC9D,qCAAqC;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,mDAAmD;YACnD,wBAAwB,CAAC,IAAI,CAAC,SAAyB,EAAE,IAAI,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,aAAa;AAEb,sCAAsC;AACtC,SAAS,cAAc,CACrB,SAAiC,EACjC,IAAY,EACZ,UAAkB,EAClB,QAAgB;IAEhB,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;IAChB,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACrD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,CAAC;YACb,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,sGAAsG;AACtG,EAAE;AACF,wFAAwF;AACxF,yFAAyF;AACzF,4FAA4F;AAC5F,EAAE;AACF,uFAAuF;AACvF,uFAAuF;AACvF,8BAA8B;AAC9B,SAAS,kBAAkB,CACzB,SAAmB,EACnB,IAAY,EACZ,UAAkB,EAClB,QAAgB,EAChB,cAAsB,oBAAoB;IAE1C,oCAAoC;IACpC,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IACvC,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC;IAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;QACvC,sCAAsC;QACtC,gFAAgF;QAChF,MAAM,CAAC,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QAC1D,wDAAwD;QACxD,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QACrD,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACnB,mDAAmD;QACnD,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;QACrC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACnB,kDAAkD;QAClD,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QAChB,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC;AACH,CAAC;AAED,SAAS,6BAA6B,CACpC,SAAuB,EACvB,IAAY,EACZ,UAAkB,EAClB,QAAgB;IAEhB,IAAI,OAAO,GAAW,SAAS,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,GAAW,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACjD,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,KAAK,GAAG,GAAG,GAAG,OAAO,CAAC;QAC5B,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QACvC,CAAC;QACD,SAAS,CAAC,CAAC,CAAC,GAAG,OAAO,GAAG,GAAG,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,SAAS,wBAAwB,CAAC,SAAuB,EAAE,IAAY;IACrE,IAAI,MAAc,CAAC;IACnB,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC;IAE3C,sDAAsD;IACtD,wDAAwD;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,GAAG,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM;QACR,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;IAC9C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO;IACT,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,CAAC;IAC/B,CAAC;AACH,CAAC"}

package/dist/polygon/earcut.d.ts

@@ -0,0 +1,13 @@
+import type { NumericArray } from '@math.gl/core';
+import { Plane2D } from "./polygon-utils.js";
+/**
+ * Computes a triangulation of a polygon
+ * @param positions a flat array of the vertex positions that define the polygon.
+ * @param holeIndices an array of hole indices if any (e.g. [5, 8] for a 12-vertex input would mean one hole with vertices 5–7 and another with 8–11).
+ * @param dim the number of elements in each vertex. Size `2` will interpret `positions` as `[x0, y0, x1, y1, ...]` and size `3` will interpret `positions` as `[x0, y0, z0, x1, y1, z1, ...]`. Default `2`.
+ * @param areas areas of outer polygon and holes as computed by `getPolygonSignedArea()`. Can be optionally supplied to speed up triangulation
+ * @returns array of indices into the `positions` array that describes the triangulation of the polygon
+ * Adapted from https://github.com/mapbox/earcut
+ */
+export declare function earcut(positions: NumericArray, holeIndices?: NumericArray, dim?: number, areas?: NumericArray, plane?: Plane2D): number[];
+//# sourceMappingURL=earcut.d.ts.map

package/dist/polygon/earcut.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"earcut.d.ts","sourceRoot":"","sources":["../../src/polygon/earcut.ts"],"names":[],"mappings":"AAkCA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,eAAe,CAAC;AAChD,OAAO,EAAiC,OAAO,EAAC,2BAAwB;AAExE;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CACpB,SAAS,EAAE,YAAY,EACvB,WAAW,CAAC,EAAE,YAAY,EAC1B,GAAG,GAAE,MAAU,EACf,KAAK,CAAC,EAAE,YAAY,EACpB,KAAK,GAAE,OAAc,GACpB,MAAM,EAAE,CAwCV"}