@loaders.gl/kml 3.1.0-beta.3 → 3.1.1

package/dist/bundle.js

@@ -29,105 +29,577 @@
     return __reExport(__markAsModule(__defProp(module != null ? __create(__getProtoOf(module)) : {}, "default", module && module.__esModule && "default" in module ? { get: () => module.default, enumerable: true } : { value: module, enumerable: true })), module);
   };
 
-  // ../gis/src/lib/geojson-to-binary.ts
-  function geojsonToBinary(features, options = {}) {
-    const firstPassData = firstPass(features);
-    return secondPass(features, firstPassData, {
-      coordLength: options.coordLength || firstPassData.coordLength,
-      numericPropKeys: options.numericPropKeys || firstPassData.numericPropKeys,
-      PositionDataType: options.PositionDataType || Float32Array
-    });
+  // ../../node_modules/@math.gl/polygon/dist/esm/polygon-utils.js
+  function getPolygonSignedArea(points, options = {}) {
+    const {
+      start = 0,
+      end = points.length
+    } = options;
+    const dim = options.size || 2;
+    let area2 = 0;
+    for (let i = start, j = end - dim; i < end; i += dim) {
+      area2 += (points[i] - points[j]) * (points[i + 1] + points[j + 1]);
+      j = i;
+    }
+    return area2 / 2;
   }
-  function firstPass(features) {
-    let pointPositionsCount = 0;
-    let pointFeaturesCount = 0;
-    let linePositionsCount = 0;
-    let linePathsCount = 0;
-    let lineFeaturesCount = 0;
-    let polygonPositionsCount = 0;
-    let polygonObjectsCount = 0;
-    let polygonRingsCount = 0;
-    let polygonFeaturesCount = 0;
-    const coordLengths = new Set();
-    const numericPropKeys = {};
-    for (const feature of features) {
-      const geometry = feature.geometry;
-      switch (geometry.type) {
-        case "Point":
-          pointFeaturesCount++;
-          pointPositionsCount++;
-          coordLengths.add(geometry.coordinates.length);
-          break;
-        case "MultiPoint":
-          pointFeaturesCount++;
-          pointPositionsCount += geometry.coordinates.length;
-          for (const point of geometry.coordinates) {
-            coordLengths.add(point.length);
-          }
-          break;
-        case "LineString":
-          lineFeaturesCount++;
-          linePositionsCount += geometry.coordinates.length;
-          linePathsCount++;
-          for (const coord of geometry.coordinates) {
-            coordLengths.add(coord.length);
-          }
-          break;
-        case "MultiLineString":
-          lineFeaturesCount++;
-          for (const line of geometry.coordinates) {
-            linePositionsCount += line.length;
-            linePathsCount++;
-            for (const coord of line) {
-              coordLengths.add(coord.length);
-            }
-          }
+  var init_polygon_utils = __esm({
+    "../../node_modules/@math.gl/polygon/dist/esm/polygon-utils.js"() {
+    }
+  });
+
+  // ../../node_modules/@math.gl/polygon/dist/esm/polygon.js
+  var init_polygon = __esm({
+    "../../node_modules/@math.gl/polygon/dist/esm/polygon.js"() {
+      init_polygon_utils();
+    }
+  });
+
+  // ../../node_modules/@math.gl/polygon/dist/esm/earcut.js
+  function earcut(data, holeIndices, dim, areas) {
+    dim = dim || 2;
+    const hasHoles = holeIndices && holeIndices.length;
+    const outerLen = hasHoles ? holeIndices[0] * dim : data.length;
+    let outerNode = linkedList(data, 0, outerLen, dim, true, areas && areas[0]);
+    const triangles = [];
+    if (!outerNode || outerNode.next === outerNode.prev)
+      return triangles;
+    let invSize;
+    let maxX;
+    let maxY;
+    let minX;
+    let minY;
+    let x;
+    let y;
+    if (hasHoles)
+      outerNode = eliminateHoles(data, holeIndices, outerNode, dim, areas);
+    if (data.length > 80 * dim) {
+      minX = maxX = data[0];
+      minY = maxY = data[1];
+      for (let i = dim; i < outerLen; i += dim) {
+        x = data[i];
+        y = data[i + 1];
+        if (x < minX)
+          minX = x;
+        if (y < minY)
+          minY = y;
+        if (x > maxX)
+          maxX = x;
+        if (y > maxY)
+          maxY = y;
+      }
+      invSize = Math.max(maxX - minX, maxY - minY);
+      invSize = invSize !== 0 ? 1 / invSize : 0;
+    }
+    earcutLinked(outerNode, triangles, dim, minX, minY, invSize);
+    return triangles;
+  }
+  function linkedList(data, start, end, dim, clockwise, area2) {
+    let i;
+    let last;
+    if (area2 === void 0) {
+      area2 = getPolygonSignedArea(data, {
+        start,
+        end,
+        size: dim
+      });
+    }
+    if (clockwise === area2 < 0) {
+      for (i = start; i < end; i += dim)
+        last = insertNode(i, data[i], data[i + 1], last);
+    } else {
+      for (i = end - dim; i >= start; i -= dim)
+        last = insertNode(i, data[i], data[i + 1], last);
+    }
+    if (last && equals(last, last.next)) {
+      removeNode(last);
+      last = last.next;
+    }
+    return last;
+  }
+  function filterPoints(start, end) {
+    if (!start)
+      return start;
+    if (!end)
+      end = start;
+    let p = start;
+    let again;
+    do {
+      again = false;
+      if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
+        removeNode(p);
+        p = end = p.prev;
+        if (p === p.next)
           break;
-        case "Polygon":
-          polygonFeaturesCount++;
-          polygonObjectsCount++;
-          polygonRingsCount += geometry.coordinates.length;
-          polygonPositionsCount += flatten(geometry.coordinates).length;
-          for (const coord of flatten(geometry.coordinates)) {
-            coordLengths.add(coord.length);
+        again = true;
+      } else {
+        p = p.next;
+      }
+    } while (again || p !== end);
+    return end;
+  }
+  function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
+    if (!ear)
+      return;
+    if (!pass && invSize)
+      indexCurve(ear, minX, minY, invSize);
+    let stop = ear;
+    let prev;
+    let next;
+    while (ear.prev !== ear.next) {
+      prev = ear.prev;
+      next = ear.next;
+      if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
+        triangles.push(prev.i / dim);
+        triangles.push(ear.i / dim);
+        triangles.push(next.i / dim);
+        removeNode(ear);
+        ear = next.next;
+        stop = next.next;
+        continue;
+      }
+      ear = next;
+      if (ear === stop) {
+        if (!pass) {
+          earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
+        } else if (pass === 1) {
+          ear = cureLocalIntersections(filterPoints(ear), triangles, dim);
+          earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
+        } else if (pass === 2) {
+          splitEarcut(ear, triangles, dim, minX, minY, invSize);
+        }
+        break;
+      }
+    }
+  }
+  function isEar(ear) {
+    const a = ear.prev;
+    const b = ear;
+    const c = ear.next;
+    if (area(a, b, c) >= 0)
+      return false;
+    let p = ear.next.next;
+    while (p !== ear.prev) {
+      if (pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0)
+        return false;
+      p = p.next;
+    }
+    return true;
+  }
+  function isEarHashed(ear, minX, minY, invSize) {
+    const a = ear.prev;
+    const b = ear;
+    const c = ear.next;
+    if (area(a, b, c) >= 0)
+      return false;
+    const minTX = a.x < b.x ? a.x < c.x ? a.x : c.x : b.x < c.x ? b.x : c.x;
+    const minTY = a.y < b.y ? a.y < c.y ? a.y : c.y : b.y < c.y ? b.y : c.y;
+    const maxTX = a.x > b.x ? a.x > c.x ? a.x : c.x : b.x > c.x ? b.x : c.x;
+    const maxTY = a.y > b.y ? a.y > c.y ? a.y : c.y : b.y > c.y ? b.y : c.y;
+    const minZ = zOrder(minTX, minTY, minX, minY, invSize);
+    const maxZ = zOrder(maxTX, maxTY, minX, minY, invSize);
+    let p = ear.prevZ;
+    let n = ear.nextZ;
+    while (p && p.z >= minZ && n && n.z <= maxZ) {
+      if (p !== ear.prev && p !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0)
+        return false;
+      p = p.prevZ;
+      if (n !== ear.prev && n !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, n.x, n.y) && area(n.prev, n, n.next) >= 0)
+        return false;
+      n = n.nextZ;
+    }
+    while (p && p.z >= minZ) {
+      if (p !== ear.prev && p !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0)
+        return false;
+      p = p.prevZ;
+    }
+    while (n && n.z <= maxZ) {
+      if (n !== ear.prev && n !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, n.x, n.y) && area(n.prev, n, n.next) >= 0)
+        return false;
+      n = n.nextZ;
+    }
+    return true;
+  }
+  function cureLocalIntersections(start, triangles, dim) {
+    let p = start;
+    do {
+      const a = p.prev;
+      const b = p.next.next;
+      if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
+        triangles.push(a.i / dim);
+        triangles.push(p.i / dim);
+        triangles.push(b.i / dim);
+        removeNode(p);
+        removeNode(p.next);
+        p = start = b;
+      }
+      p = p.next;
+    } while (p !== start);
+    return filterPoints(p);
+  }
+  function splitEarcut(start, triangles, dim, minX, minY, invSize) {
+    let a = start;
+    do {
+      let b = a.next.next;
+      while (b !== a.prev) {
+        if (a.i !== b.i && isValidDiagonal(a, b)) {
+          let c = splitPolygon(a, b);
+          a = filterPoints(a, a.next);
+          c = filterPoints(c, c.next);
+          earcutLinked(a, triangles, dim, minX, minY, invSize);
+          earcutLinked(c, triangles, dim, minX, minY, invSize);
+          return;
+        }
+        b = b.next;
+      }
+      a = a.next;
+    } while (a !== start);
+  }
+  function eliminateHoles(data, holeIndices, outerNode, dim, areas) {
+    const queue = [];
+    let i;
+    let len;
+    let start;
+    let end;
+    let list;
+    for (i = 0, len = holeIndices.length; i < len; i++) {
+      start = holeIndices[i] * dim;
+      end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
+      list = linkedList(data, start, end, dim, false, areas && areas[i + 1]);
+      if (list === list.next)
+        list.steiner = true;
+      queue.push(getLeftmost(list));
+    }
+    queue.sort(compareX);
+    for (i = 0; i < queue.length; i++) {
+      eliminateHole(queue[i], outerNode);
+      outerNode = filterPoints(outerNode, outerNode.next);
+    }
+    return outerNode;
+  }
+  function compareX(a, b) {
+    return a.x - b.x;
+  }
+  function eliminateHole(hole, outerNode) {
+    outerNode = findHoleBridge(hole, outerNode);
+    if (outerNode) {
+      const b = splitPolygon(outerNode, hole);
+      filterPoints(outerNode, outerNode.next);
+      filterPoints(b, b.next);
+    }
+  }
+  function findHoleBridge(hole, outerNode) {
+    let p = outerNode;
+    const hx = hole.x;
+    const hy = hole.y;
+    let qx = -Infinity;
+    let m;
+    do {
+      if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
+        const x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
+        if (x <= hx && x > qx) {
+          qx = x;
+          if (x === hx) {
+            if (hy === p.y)
+              return p;
+            if (hy === p.next.y)
+              return p.next;
           }
-          break;
-        case "MultiPolygon":
-          polygonFeaturesCount++;
-          for (const polygon of geometry.coordinates) {
-            polygonObjectsCount++;
-            polygonRingsCount += polygon.length;
-            polygonPositionsCount += flatten(polygon).length;
-            for (const coord of flatten(polygon)) {
-              coordLengths.add(coord.length);
-            }
+          m = p.x < p.next.x ? p : p.next;
+        }
+      }
+      p = p.next;
+    } while (p !== outerNode);
+    if (!m)
+      return null;
+    if (hx === qx)
+      return m;
+    const stop = m;
+    const mx = m.x;
+    const my = m.y;
+    let tanMin = Infinity;
+    let tan;
+    p = m;
+    do {
+      if (hx >= p.x && p.x >= mx && hx !== p.x && pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)) {
+        tan = Math.abs(hy - p.y) / (hx - p.x);
+        if (locallyInside(p, hole) && (tan < tanMin || tan === tanMin && (p.x > m.x || p.x === m.x && sectorContainsSector(m, p)))) {
+          m = p;
+          tanMin = tan;
+        }
+      }
+      p = p.next;
+    } while (p !== stop);
+    return m;
+  }
+  function sectorContainsSector(m, p) {
+    return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;
+  }
+  function indexCurve(start, minX, minY, invSize) {
+    let p = start;
+    do {
+      if (p.z === null)
+        p.z = zOrder(p.x, p.y, minX, minY, invSize);
+      p.prevZ = p.prev;
+      p.nextZ = p.next;
+      p = p.next;
+    } while (p !== start);
+    p.prevZ.nextZ = null;
+    p.prevZ = null;
+    sortLinked(p);
+  }
+  function sortLinked(list) {
+    let e;
+    let i;
+    let inSize = 1;
+    let numMerges;
+    let p;
+    let pSize;
+    let q;
+    let qSize;
+    let tail;
+    do {
+      p = list;
+      list = null;
+      tail = null;
+      numMerges = 0;
+      while (p) {
+        numMerges++;
+        q = p;
+        pSize = 0;
+        for (i = 0; i < inSize; i++) {
+          pSize++;
+          q = q.nextZ;
+          if (!q)
+            break;
+        }
+        qSize = inSize;
+        while (pSize > 0 || qSize > 0 && q) {
+          if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {
+            e = p;
+            p = p.nextZ;
+            pSize--;
+          } else {
+            e = q;
+            q = q.nextZ;
+            qSize--;
           }
-          break;
-        default:
-          throw new Error(`Unsupported geometry type: ${geometry.type}`);
+          if (tail)
+            tail.nextZ = e;
+          else
+            list = e;
+          e.prevZ = tail;
+          tail = e;
+        }
+        p = q;
       }
+      tail.nextZ = null;
+      inSize *= 2;
+    } while (numMerges > 1);
+    return list;
+  }
+  function zOrder(x, y, minX, minY, invSize) {
+    x = 32767 * (x - minX) * invSize;
+    y = 32767 * (y - minY) * invSize;
+    x = (x | x << 8) & 16711935;
+    x = (x | x << 4) & 252645135;
+    x = (x | x << 2) & 858993459;
+    x = (x | x << 1) & 1431655765;
+    y = (y | y << 8) & 16711935;
+    y = (y | y << 4) & 252645135;
+    y = (y | y << 2) & 858993459;
+    y = (y | y << 1) & 1431655765;
+    return x | y << 1;
+  }
+  function getLeftmost(start) {
+    let p = start;
+    let leftmost = start;
+    do {
+      if (p.x < leftmost.x || p.x === leftmost.x && p.y < leftmost.y)
+        leftmost = p;
+      p = p.next;
+    } while (p !== start);
+    return leftmost;
+  }
+  function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
+    return (cx - px) * (ay - py) - (ax - px) * (cy - py) >= 0 && (ax - px) * (by - py) - (bx - px) * (ay - py) >= 0 && (bx - px) * (cy - py) - (cx - px) * (by - py) >= 0;
+  }
+  function isValidDiagonal(a, b) {
+    return a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && (locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && (area(a.prev, a, b.prev) || area(a, b.prev, b)) || equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0);
+  }
+  function area(p, q, r) {
+    return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
+  }
+  function equals(p1, p2) {
+    return p1.x === p2.x && p1.y === p2.y;
+  }
+  function intersects(p1, q1, p2, q2) {
+    const o1 = sign(area(p1, q1, p2));
+    const o2 = sign(area(p1, q1, q2));
+    const o3 = sign(area(p2, q2, p1));
+    const o4 = sign(area(p2, q2, q1));
+    if (o1 !== o2 && o3 !== o4)
+      return true;
+    if (o1 === 0 && onSegment(p1, p2, q1))
+      return true;
+    if (o2 === 0 && onSegment(p1, q2, q1))
+      return true;
+    if (o3 === 0 && onSegment(p2, p1, q2))
+      return true;
+    if (o4 === 0 && onSegment(p2, q1, q2))
+      return true;
+    return false;
+  }
+  function onSegment(p, q, r) {
+    return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);
+  }
+  function sign(num) {
+    return num > 0 ? 1 : num < 0 ? -1 : 0;
+  }
+  function intersectsPolygon(a, b) {
+    let p = a;
+    do {
+      if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i && intersects(p, p.next, a, b))
+        return true;
+      p = p.next;
+    } while (p !== a);
+    return false;
+  }
+  function locallyInside(a, b) {
+    return area(a.prev, a, a.next) < 0 ? area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 : area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
+  }
+  function middleInside(a, b) {
+    let p = a;
+    let inside = false;
+    const px = (a.x + b.x) / 2;
+    const py = (a.y + b.y) / 2;
+    do {
+      if (p.y > py !== p.next.y > py && p.next.y !== p.y && px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x)
+        inside = !inside;
+      p = p.next;
+    } while (p !== a);
+    return inside;
+  }
+  function splitPolygon(a, b) {
+    const a2 = new Node(a.i, a.x, a.y);
+    const b2 = new Node(b.i, b.x, b.y);
+    const an = a.next;
+    const bp = b.prev;
+    a.next = b;
+    b.prev = a;
+    a2.next = an;
+    an.prev = a2;
+    b2.next = a2;
+    a2.prev = b2;
+    bp.next = b2;
+    b2.prev = bp;
+    return b2;
+  }
+  function insertNode(i, x, y, last) {
+    const p = new Node(i, x, y);
+    if (!last) {
+      p.prev = p;
+      p.next = p;
+    } else {
+      p.next = last.next;
+      p.prev = last;
+      last.next.prev = p;
+      last.next = p;
+    }
+    return p;
+  }
+  function removeNode(p) {
+    p.next.prev = p.prev;
+    p.prev.next = p.next;
+    if (p.prevZ)
+      p.prevZ.nextZ = p.nextZ;
+    if (p.nextZ)
+      p.nextZ.prevZ = p.prevZ;
+  }
+  function Node(i, x, y) {
+    this.i = i;
+    this.x = x;
+    this.y = y;
+    this.prev = null;
+    this.next = null;
+    this.z = null;
+    this.prevZ = null;
+    this.nextZ = null;
+    this.steiner = false;
+  }
+  var init_earcut = __esm({
+    "../../node_modules/@math.gl/polygon/dist/esm/earcut.js"() {
+      init_polygon_utils();
+    }
+  });
+
+  // ../../node_modules/@math.gl/polygon/dist/esm/utils.js
+  var init_utils = __esm({
+    "../../node_modules/@math.gl/polygon/dist/esm/utils.js"() {
+    }
+  });
+
+  // ../../node_modules/@math.gl/polygon/dist/esm/lineclip.js
+  var init_lineclip = __esm({
+    "../../node_modules/@math.gl/polygon/dist/esm/lineclip.js"() {
+      init_utils();
+    }
+  });
+
+  // ../../node_modules/@math.gl/polygon/dist/esm/cut-by-grid.js
+  var init_cut_by_grid = __esm({
+    "../../node_modules/@math.gl/polygon/dist/esm/cut-by-grid.js"() {
+      init_lineclip();
+      init_utils();
+    }
+  });
+
+  // ../../node_modules/@math.gl/polygon/dist/esm/cut-by-mercator-bounds.js
+  var init_cut_by_mercator_bounds = __esm({
+    "../../node_modules/@math.gl/polygon/dist/esm/cut-by-mercator-bounds.js"() {
+      init_cut_by_grid();
+      init_utils();
+    }
+  });
+
+  // ../../node_modules/@math.gl/polygon/dist/esm/index.js
+  var init_esm = __esm({
+    "../../node_modules/@math.gl/polygon/dist/esm/index.js"() {
+      init_polygon();
+      init_polygon_utils();
+      init_earcut();
+      init_lineclip();
+      init_cut_by_grid();
+      init_cut_by_mercator_bounds();
+      init_polygon();
+    }
+  });
+
+  // ../gis/src/lib/flat-geojson-to-binary.ts
+  function flatGeojsonToBinary(features, geometryInfo, options) {
+    const propArrayTypes = extractNumericPropTypes(features);
+    const numericPropKeys = Object.keys(propArrayTypes).filter((k) => propArrayTypes[k] !== Array);
+    return fillArrays(features, {
+      propArrayTypes,
+      ...geometryInfo
+    }, {
+      numericPropKeys: options && options.numericPropKeys || numericPropKeys,
+      PositionDataType: options ? options.PositionDataType : Float32Array
+    });
+  }
+  function extractNumericPropTypes(features) {
+    const propArrayTypes = {};
+    for (const feature of features) {
       if (feature.properties) {
         for (const key in feature.properties) {
           const val = feature.properties[key];
-          numericPropKeys[key] = numericPropKeys[key] || numericPropKeys[key] === void 0 ? isNumeric(val) : numericPropKeys[key];
+          propArrayTypes[key] = deduceArrayType(val, propArrayTypes[key]);
         }
       }
     }
-    return {
-      coordLength: coordLengths.size > 0 ? Math.max(...coordLengths) : 2,
-      pointPositionsCount,
-      pointFeaturesCount,
-      linePositionsCount,
-      linePathsCount,
-      lineFeaturesCount,
-      polygonPositionsCount,
-      polygonObjectsCount,
-      polygonRingsCount,
-      polygonFeaturesCount,
-      numericPropKeys: Object.keys(numericPropKeys).filter((k) => numericPropKeys[k])
-    };
+    return propArrayTypes;
   }
-  function secondPass(features, firstPassData, options) {
+  function fillArrays(features, geometryInfo, options) {
     const {
       pointPositionsCount,
       pointFeaturesCount,
@@ -137,40 +609,48 @@
       polygonPositionsCount,
       polygonObjectsCount,
       polygonRingsCount,
-      polygonFeaturesCount
-    } = firstPassData;
-    const { coordLength, numericPropKeys, PositionDataType = Float32Array } = options;
+      polygonFeaturesCount,
+      propArrayTypes,
+      coordLength
+    } = geometryInfo;
+    const { numericPropKeys = [], PositionDataType = Float32Array } = options;
+    const hasGlobalId = features[0] && "id" in features[0];
     const GlobalFeatureIdsDataType = features.length > 65535 ? Uint32Array : Uint16Array;
     const points = {
+      type: "Point",
       positions: new PositionDataType(pointPositionsCount * coordLength),
       globalFeatureIds: new GlobalFeatureIdsDataType(pointPositionsCount),
       featureIds: pointFeaturesCount > 65535 ? new Uint32Array(pointPositionsCount) : new Uint16Array(pointPositionsCount),
       numericProps: {},
-      properties: Array(),
-      fields: Array()
+      properties: [],
+      fields: []
     };
     const lines = {
-      positions: new PositionDataType(linePositionsCount * coordLength),
+      type: "LineString",
       pathIndices: linePositionsCount > 65535 ? new Uint32Array(linePathsCount + 1) : new Uint16Array(linePathsCount + 1),
+      positions: new PositionDataType(linePositionsCount * coordLength),
       globalFeatureIds: new GlobalFeatureIdsDataType(linePositionsCount),
       featureIds: lineFeaturesCount > 65535 ? new Uint32Array(linePositionsCount) : new Uint16Array(linePositionsCount),
       numericProps: {},
-      properties: Array(),
-      fields: Array()
+      properties: [],
+      fields: []
     };
     const polygons = {
-      positions: new PositionDataType(polygonPositionsCount * coordLength),
+      type: "Polygon",
       polygonIndices: polygonPositionsCount > 65535 ? new Uint32Array(polygonObjectsCount + 1) : new Uint16Array(polygonObjectsCount + 1),
       primitivePolygonIndices: polygonPositionsCount > 65535 ? new Uint32Array(polygonRingsCount + 1) : new Uint16Array(polygonRingsCount + 1),
+      positions: new PositionDataType(polygonPositionsCount * coordLength),
+      triangles: [],
       globalFeatureIds: new GlobalFeatureIdsDataType(polygonPositionsCount),
       featureIds: polygonFeaturesCount > 65535 ? new Uint32Array(polygonPositionsCount) : new Uint16Array(polygonPositionsCount),
       numericProps: {},
-      properties: Array(),
-      fields: Array()
+      properties: [],
+      fields: []
     };
     for (const object of [points, lines, polygons]) {
-      for (const propName of numericPropKeys || []) {
-        object.numericProps[propName] = new Float32Array(object.positions.length / coordLength);
+      for (const propName of numericPropKeys) {
+        const T = propArrayTypes[propName];
+        object.numericProps[propName] = new T(object.positions.length / coordLength);
       }
     }
     lines.pathIndices[linePathsCount] = linePositionsCount;
@@ -193,33 +673,27 @@
       const properties = feature.properties || {};
       switch (geometry.type) {
         case "Point":
-          handlePoint(geometry.coordinates, points, indexMap, coordLength, properties);
-          points.properties.push(keepStringProperties(properties, numericPropKeys));
-          indexMap.pointFeature++;
-          break;
-        case "MultiPoint":
-          handleMultiPoint(geometry.coordinates, points, indexMap, coordLength, properties);
+          handlePoint(geometry, points, indexMap, coordLength, properties);
           points.properties.push(keepStringProperties(properties, numericPropKeys));
+          if (hasGlobalId) {
+            points.fields.push({ id: feature.id });
+          }
           indexMap.pointFeature++;
           break;
         case "LineString":
-          handleLineString(geometry.coordinates, lines, indexMap, coordLength, properties);
-          lines.properties.push(keepStringProperties(properties, numericPropKeys));
-          indexMap.lineFeature++;
-          break;
-        case "MultiLineString":
-          handleMultiLineString(geometry.coordinates, lines, indexMap, coordLength, properties);
+          handleLineString(geometry, lines, indexMap, coordLength, properties);
           lines.properties.push(keepStringProperties(properties, numericPropKeys));
+          if (hasGlobalId) {
+            lines.fields.push({ id: feature.id });
+          }
           indexMap.lineFeature++;
           break;
         case "Polygon":
-          handlePolygon(geometry.coordinates, polygons, indexMap, coordLength, properties);
-          polygons.properties.push(keepStringProperties(properties, numericPropKeys));
-          indexMap.polygonFeature++;
-          break;
-        case "MultiPolygon":
-          handleMultiPolygon(geometry.coordinates, polygons, indexMap, coordLength, properties);
+          handlePolygon(geometry, polygons, indexMap, coordLength, properties);
           polygons.properties.push(keepStringProperties(properties, numericPropKeys));
+          if (hasGlobalId) {
+            polygons.fields.push({ id: feature.id });
+          }
           indexMap.polygonFeature++;
           break;
         default:
@@ -229,93 +703,105 @@
     }
     return makeAccessorObjects(points, lines, polygons, coordLength);
   }
-  function handlePoint(coords, points, indexMap, coordLength, properties) {
-    points.positions.set(coords, indexMap.pointPosition * coordLength);
-    points.globalFeatureIds[indexMap.pointPosition] = indexMap.feature;
-    points.featureIds[indexMap.pointPosition] = indexMap.pointFeature;
-    fillNumericProperties(points, properties, indexMap.pointPosition, 1);
-    indexMap.pointPosition++;
-  }
-  function handleMultiPoint(coords, points, indexMap, coordLength, properties) {
-    for (const point of coords) {
-      handlePoint(point, points, indexMap, coordLength, properties);
-    }
+  function handlePoint(geometry, points, indexMap, coordLength, properties) {
+    points.positions.set(geometry.data, indexMap.pointPosition * coordLength);
+    const nPositions = geometry.data.length / coordLength;
+    fillNumericProperties(points, properties, indexMap.pointPosition, nPositions);
+    points.globalFeatureIds.fill(indexMap.feature, indexMap.pointPosition, indexMap.pointPosition + nPositions);
+    points.featureIds.fill(indexMap.pointFeature, indexMap.pointPosition, indexMap.pointPosition + nPositions);
+    indexMap.pointPosition += nPositions;
   }
-  function handleLineString(coords, lines, indexMap, coordLength, properties) {
-    lines.pathIndices[indexMap.linePath] = indexMap.linePosition;
-    indexMap.linePath++;
-    fillCoords(lines.positions, coords, indexMap.linePosition, coordLength);
-    const nPositions = coords.length;
+  function handleLineString(geometry, lines, indexMap, coordLength, properties) {
+    lines.positions.set(geometry.data, indexMap.linePosition * coordLength);
+    const nPositions = geometry.data.length / coordLength;
     fillNumericProperties(lines, properties, indexMap.linePosition, nPositions);
-    lines.globalFeatureIds.set(new Uint32Array(nPositions).fill(indexMap.feature), indexMap.linePosition);
-    lines.featureIds.set(new Uint32Array(nPositions).fill(indexMap.lineFeature), indexMap.linePosition);
-    indexMap.linePosition += nPositions;
+    lines.globalFeatureIds.fill(indexMap.feature, indexMap.linePosition, indexMap.linePosition + nPositions);
+    lines.featureIds.fill(indexMap.lineFeature, indexMap.linePosition, indexMap.linePosition + nPositions);
+    for (let i = 0, il = geometry.indices.length; i < il; ++i) {
+      const start = geometry.indices[i];
+      const end = i === il - 1 ? geometry.data.length : geometry.indices[i + 1];
+      lines.pathIndices[indexMap.linePath++] = indexMap.linePosition;
+      indexMap.linePosition += (end - start) / coordLength;
+    }
   }
-  function handleMultiLineString(coords, lines, indexMap, coordLength, properties) {
-    for (const line of coords) {
-      handleLineString(line, lines, indexMap, coordLength, properties);
+  function handlePolygon(geometry, polygons, indexMap, coordLength, properties) {
+    polygons.positions.set(geometry.data, indexMap.polygonPosition * coordLength);
+    const nPositions = geometry.data.length / coordLength;
+    fillNumericProperties(polygons, properties, indexMap.polygonPosition, nPositions);
+    polygons.globalFeatureIds.fill(indexMap.feature, indexMap.polygonPosition, indexMap.polygonPosition + nPositions);
+    polygons.featureIds.fill(indexMap.polygonFeature, indexMap.polygonPosition, indexMap.polygonPosition + nPositions);
+    for (let l = 0, ll = geometry.indices.length; l < ll; ++l) {
+      const startPosition = indexMap.polygonPosition;
+      polygons.polygonIndices[indexMap.polygonObject++] = startPosition;
+      const areas = geometry.areas[l];
+      const indices = geometry.indices[l];
+      const nextIndices = geometry.indices[l + 1];
+      for (let i = 0, il = indices.length; i < il; ++i) {
+        const start = indices[i];
+        const end = i === il - 1 ? nextIndices === void 0 ? geometry.data.length : nextIndices[0] : indices[i + 1];
+        polygons.primitivePolygonIndices[indexMap.polygonRing++] = indexMap.polygonPosition;
+        indexMap.polygonPosition += (end - start) / coordLength;
+      }
+      const endPosition = indexMap.polygonPosition;
+      triangulatePolygon(polygons, areas, indices, { startPosition, endPosition, coordLength });
     }
   }
-  function handlePolygon(coords, polygons, indexMap, coordLength, properties) {
-    polygons.polygonIndices[indexMap.polygonObject] = indexMap.polygonPosition;
-    indexMap.polygonObject++;
-    for (const ring of coords) {
-      polygons.primitivePolygonIndices[indexMap.polygonRing] = indexMap.polygonPosition;
-      indexMap.polygonRing++;
-      fillCoords(polygons.positions, ring, indexMap.polygonPosition, coordLength);
-      const nPositions = ring.length;
-      fillNumericProperties(polygons, properties, indexMap.polygonPosition, nPositions);
-      polygons.globalFeatureIds.set(new Uint32Array(nPositions).fill(indexMap.feature), indexMap.polygonPosition);
-      polygons.featureIds.set(new Uint32Array(nPositions).fill(indexMap.polygonFeature), indexMap.polygonPosition);
-      indexMap.polygonPosition += nPositions;
+  function triangulatePolygon(polygons, areas, indices, {
+    startPosition,
+    endPosition,
+    coordLength
+  }) {
+    const start = startPosition * coordLength;
+    const end = endPosition * coordLength;
+    const polygonPositions = polygons.positions.subarray(start, end);
+    const offset = indices[0];
+    const holes = indices.slice(1).map((n) => (n - offset) / coordLength);
+    const triangles = earcut(polygonPositions, holes, coordLength, areas);
+    for (let t = 0, tl = triangles.length; t < tl; ++t) {
+      polygons.triangles.push(startPosition + triangles[t]);
     }
   }
-  function handleMultiPolygon(coords, polygons, indexMap, coordLength, properties) {
-    for (const polygon of coords) {
-      handlePolygon(polygon, polygons, indexMap, coordLength, properties);
+  function wrapProps(obj, size) {
+    const returnObj = {};
+    for (const key in obj) {
+      returnObj[key] = { value: obj[key], size };
     }
+    return returnObj;
   }
   function makeAccessorObjects(points, lines, polygons, coordLength) {
-    const returnObj = {
+    return {
       points: {
         ...points,
         positions: { value: points.positions, size: coordLength },
         globalFeatureIds: { value: points.globalFeatureIds, size: 1 },
         featureIds: { value: points.featureIds, size: 1 },
-        type: "Point"
+        numericProps: wrapProps(points.numericProps, 1)
       },
       lines: {
         ...lines,
-        pathIndices: { value: lines.pathIndices, size: 1 },
         positions: { value: lines.positions, size: coordLength },
+        pathIndices: { value: lines.pathIndices, size: 1 },
         globalFeatureIds: { value: lines.globalFeatureIds, size: 1 },
         featureIds: { value: lines.featureIds, size: 1 },
-        type: "LineString"
+        numericProps: wrapProps(lines.numericProps, 1)
       },
       polygons: {
         ...polygons,
+        positions: { value: polygons.positions, size: coordLength },
         polygonIndices: { value: polygons.polygonIndices, size: 1 },
         primitivePolygonIndices: { value: polygons.primitivePolygonIndices, size: 1 },
-        positions: { value: polygons.positions, size: coordLength },
+        triangles: { value: new Uint32Array(polygons.triangles), size: 1 },
         globalFeatureIds: { value: polygons.globalFeatureIds, size: 1 },
         featureIds: { value: polygons.featureIds, size: 1 },
-        type: "Polygon"
+        numericProps: wrapProps(polygons.numericProps, 1)
       }
     };
-    for (const geomType in returnObj) {
-      for (const numericProp in returnObj[geomType].numericProps) {
-        returnObj[geomType].numericProps[numericProp] = {
-          value: returnObj[geomType].numericProps[numericProp],
-          size: 1
-        };
-      }
-    }
-    return returnObj;
   }
   function fillNumericProperties(object, properties, index, length) {
     for (const numericPropName in object.numericProps) {
       if (numericPropName in properties) {
-        object.numericProps[numericPropName].set(new Array(length).fill(properties[numericPropName]), index);
+        const value = properties[numericPropName];
+        object.numericProps[numericPropName].fill(value, index, index + length);
       }
     }
   }
@@ -328,21 +814,211 @@
     }
     return props;
   }
-  function fillCoords(array, coords, startVertex, coordLength) {
-    let index = startVertex * coordLength;
-    for (const coord of coords) {
-      array.set(coord, index);
-      index += coordLength;
+  function deduceArrayType(x, constructor) {
+    if (constructor === Array || !Number.isFinite(x)) {
+      return Array;
+    }
+    return constructor === Float64Array || Math.fround(x) !== x ? Float64Array : Float32Array;
+  }
+  var init_flat_geojson_to_binary = __esm({
+    "../gis/src/lib/flat-geojson-to-binary.ts"() {
+      init_esm();
+    }
+  });
+
+  // ../gis/src/lib/extract-geometry-info.ts
+  function extractGeometryInfo(features) {
+    let pointPositionsCount = 0;
+    let pointFeaturesCount = 0;
+    let linePositionsCount = 0;
+    let linePathsCount = 0;
+    let lineFeaturesCount = 0;
+    let polygonPositionsCount = 0;
+    let polygonObjectsCount = 0;
+    let polygonRingsCount = 0;
+    let polygonFeaturesCount = 0;
+    const coordLengths = new Set();
+    for (const feature of features) {
+      const geometry = feature.geometry;
+      switch (geometry.type) {
+        case "Point":
+          pointFeaturesCount++;
+          pointPositionsCount++;
+          coordLengths.add(geometry.coordinates.length);
+          break;
+        case "MultiPoint":
+          pointFeaturesCount++;
+          pointPositionsCount += geometry.coordinates.length;
+          for (const point of geometry.coordinates) {
+            coordLengths.add(point.length);
+          }
+          break;
+        case "LineString":
+          lineFeaturesCount++;
+          linePositionsCount += geometry.coordinates.length;
+          linePathsCount++;
+          for (const coord of geometry.coordinates) {
+            coordLengths.add(coord.length);
+          }
+          break;
+        case "MultiLineString":
+          lineFeaturesCount++;
+          for (const line of geometry.coordinates) {
+            linePositionsCount += line.length;
+            linePathsCount++;
+            for (const coord of line) {
+              coordLengths.add(coord.length);
+            }
+          }
+          break;
+        case "Polygon":
+          polygonFeaturesCount++;
+          polygonObjectsCount++;
+          polygonRingsCount += geometry.coordinates.length;
+          const flattened = geometry.coordinates.flat();
+          polygonPositionsCount += flattened.length;
+          for (const coord of flattened) {
+            coordLengths.add(coord.length);
+          }
+          break;
+        case "MultiPolygon":
+          polygonFeaturesCount++;
+          for (const polygon of geometry.coordinates) {
+            polygonObjectsCount++;
+            polygonRingsCount += polygon.length;
+            const flattened2 = polygon.flat();
+            polygonPositionsCount += flattened2.length;
+            for (const coord of flattened2) {
+              coordLengths.add(coord.length);
+            }
+          }
+          break;
+        default:
+          throw new Error(`Unsupported geometry type: ${geometry.type}`);
+      }
+    }
+    return {
+      coordLength: coordLengths.size > 0 ? Math.max(...coordLengths) : 2,
+      pointPositionsCount,
+      pointFeaturesCount,
+      linePositionsCount,
+      linePathsCount,
+      lineFeaturesCount,
+      polygonPositionsCount,
+      polygonObjectsCount,
+      polygonRingsCount,
+      polygonFeaturesCount
+    };
+  }
+  var init_extract_geometry_info = __esm({
+    "../gis/src/lib/extract-geometry-info.ts"() {
     }
+  });
+
+  // ../gis/src/lib/geojson-to-flat-geojson.ts
+  function geojsonToFlatGeojson(features, options = { coordLength: 2, fixRingWinding: true }) {
+    return features.map((feature) => flattenFeature(feature, options));
   }
-  function flatten(arrays) {
-    return [].concat(...arrays);
+  function flattenPoint(coordinates, data, indices, options) {
+    indices.push(data.length);
+    data.push(...coordinates);
+    for (let i = coordinates.length; i < options.coordLength; i++) {
+      data.push(0);
+    }
+  }
+  function flattenLineString(coordinates, data, indices, options) {
+    indices.push(data.length);
+    for (const c of coordinates) {
+      data.push(...c);
+      for (let i = c.length; i < options.coordLength; i++) {
+        data.push(0);
+      }
+    }
+  }
+  function flattenPolygon(coordinates, data, indices, areas, options) {
+    let count = 0;
+    const ringAreas = [];
+    const polygons = [];
+    for (const lineString of coordinates) {
+      const lineString2d = lineString.map((p) => p.slice(0, 2));
+      let area2 = getPolygonSignedArea(lineString2d.flat());
+      const ccw = area2 < 0;
+      if (options.fixRingWinding && (count === 0 && !ccw || count > 0 && ccw)) {
+        lineString.reverse();
+        area2 = -area2;
+      }
+      ringAreas.push(area2);
+      flattenLineString(lineString, data, polygons, options);
+      count++;
+    }
+    if (count > 0) {
+      areas.push(ringAreas);
+      indices.push(polygons);
+    }
+  }
+  function flattenFeature(feature, options) {
+    const { geometry } = feature;
+    if (geometry.type === "GeometryCollection") {
+      throw new Error("GeometryCollection type not supported");
+    }
+    const data = [];
+    const indices = [];
+    let areas;
+    let type;
+    switch (geometry.type) {
+      case "Point":
+        type = "Point";
+        flattenPoint(geometry.coordinates, data, indices, options);
+        break;
+      case "MultiPoint":
+        type = "Point";
+        geometry.coordinates.map((c) => flattenPoint(c, data, indices, options));
+        break;
+      case "LineString":
+        type = "LineString";
+        flattenLineString(geometry.coordinates, data, indices, options);
+        break;
+      case "MultiLineString":
+        type = "LineString";
+        geometry.coordinates.map((c) => flattenLineString(c, data, indices, options));
+        break;
+      case "Polygon":
+        type = "Polygon";
+        areas = [];
+        flattenPolygon(geometry.coordinates, data, indices, areas, options);
+        break;
+      case "MultiPolygon":
+        type = "Polygon";
+        areas = [];
+        geometry.coordinates.map((c) => flattenPolygon(c, data, indices, areas, options));
+        break;
+      default:
+        throw new Error(`Unknown type: ${type}`);
+    }
+    return { ...feature, geometry: { type, indices, data, areas } };
   }
-  function isNumeric(x) {
-    return Number.isFinite(x);
+  var init_geojson_to_flat_geojson = __esm({
+    "../gis/src/lib/geojson-to-flat-geojson.ts"() {
+      init_esm();
+    }
+  });
+
+  // ../gis/src/lib/geojson-to-binary.ts
+  function geojsonToBinary(features, options = { fixRingWinding: true }) {
+    const geometryInfo = extractGeometryInfo(features);
+    const coordLength = geometryInfo.coordLength;
+    const { fixRingWinding } = options;
+    const flatFeatures = geojsonToFlatGeojson(features, { coordLength, fixRingWinding });
+    return flatGeojsonToBinary(flatFeatures, geometryInfo, {
+      numericPropKeys: options.numericPropKeys,
+      PositionDataType: options.PositionDataType || Float32Array
+    });
   }
   var init_geojson_to_binary = __esm({
     "../gis/src/lib/geojson-to-binary.ts"() {
+      init_extract_geometry_info();
+      init_geojson_to_flat_geojson();
+      init_flat_geojson_to_binary();
     }
   });