@math.gl/geometry 5.0.0-alpha.2 → 5.0.0-alpha.20

package/dist/parametric.cjs

@@ -0,0 +1,328 @@
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// dist/parametric.js
+var parametric_exports = {};
+__export(parametric_exports, {
+  LatheGeometry: () => LatheGeometry,
+  ParametricGeometry: () => ParametricGeometry,
+  TorusGeometry: () => TorusGeometry
+});
+module.exports = __toCommonJS(parametric_exports);
+
+// dist/lib/geometry.js
+var geometryId = 0;
+var Geometry = class {
+  constructor(props) {
+    this.userData = {};
+    this.id = props.id || `geometry-${++geometryId}`;
+    this.topology = props.topology;
+    this.attributes = {};
+    let indices = props.indices ? normalizeAttribute(props.indices) : void 0;
+    for (const [name, input] of Object.entries(props.attributes || {})) {
+      const attribute = normalizeAttribute(input);
+      if (name === "POSITION" || name === "positions") {
+        attribute.size || (attribute.size = 3);
+      }
+      if (name === "indices") {
+        if (indices)
+          throw new Error("Geometry has multiple index attributes");
+        indices = attribute;
+      } else {
+        this.attributes[name] = attribute;
+      }
+    }
+    if (indices) {
+      if (!(indices.value instanceof Uint16Array || indices.value instanceof Uint32Array)) {
+        throw new Error("Geometry indices must be a Uint16Array or Uint32Array");
+      }
+      indices.size = 1;
+      this.indices = indices;
+      validateIndices(indices, this.attributes);
+    }
+    this.vertexCount = props.vertexCount ?? calculateVertexCount(this.attributes, this.indices);
+    if (!Number.isInteger(this.vertexCount) || this.vertexCount < 0) {
+      throw new Error("Geometry vertexCount must be a non-negative integer");
+    }
+  }
+  getVertexCount() {
+    return this.vertexCount;
+  }
+  getAttributes() {
+    return this.indices ? { indices: this.indices, ...this.attributes } : this.attributes;
+  }
+};
+function normalizeAttribute(input) {
+  const attribute = isTypedArray(input) ? { value: input } : { ...input };
+  if (!isTypedArray(attribute.value)) {
+    throw new Error("Geometry attributes must contain a typed-array value");
+  }
+  if (attribute.size !== void 0 && (!Number.isInteger(attribute.size) || attribute.size < 1)) {
+    throw new Error("Geometry attribute size must be a positive integer");
+  }
+  if (attribute.size && attribute.value.length % attribute.size !== 0) {
+    throw new Error("Geometry attribute length must be divisible by its size");
+  }
+  return attribute;
+}
+function isTypedArray(value) {
+  return ArrayBuffer.isView(value) && !(value instanceof DataView);
+}
+function validateIndices(indices, attributes) {
+  let maximumIndex = -1;
+  for (const index of indices.value)
+    maximumIndex = Math.max(maximumIndex, Number(index));
+  for (const [name, attribute] of Object.entries(attributes)) {
+    if (!attribute.constant && attribute.size) {
+      const attributeVertexCount = attribute.value.length / attribute.size;
+      if (maximumIndex >= attributeVertexCount) {
+        throw new Error(`Geometry index ${maximumIndex} exceeds ${name} vertex count ${attributeVertexCount}`);
+      }
+    }
+  }
+}
+function calculateVertexCount(attributes, indices) {
+  if (indices)
+    return indices.value.length;
+  let count = Infinity;
+  for (const attribute of Object.values(attributes)) {
+    if (!attribute.constant && attribute.size) {
+      count = Math.min(count, attribute.value.length / attribute.size);
+    }
+  }
+  if (!Number.isFinite(count))
+    throw new Error("Geometry has no countable attributes");
+  return count;
+}
+
+// dist/geometries/geometry-helpers.js
+function assertPositive(value, name) {
+  if (!Number.isFinite(value) || value <= 0)
+    throw new Error(`${name} must be greater than zero`);
+}
+function assertSegments(value, name, minimum = 1) {
+  if (!Number.isInteger(value) || value < minimum)
+    throw new Error(`${name} must be an integer >= ${minimum}`);
+}
+function makeIndices(vertexCount, values) {
+  return vertexCount > 65535 ? new Uint32Array(values) : new Uint16Array(values);
+}
+
+// dist/parametric/parametric-geometry.js
+var ParametricGeometry = class extends Geometry {
+  constructor(props) {
+    const { sample, normal, uSegments = 32, vSegments = 32, periodicU = false, periodicV = false } = props;
+    assertSegments(uSegments, "uSegments");
+    assertSegments(vSegments, "vSegments");
+    const count = (uSegments + 1) * (vSegments + 1);
+    const indexCount = uSegments * vSegments * 6;
+    if (!Number.isSafeInteger(indexCount) || indexCount > 4294967295)
+      throw new RangeError("Surface exceeds 32-bit index-buffer length");
+    if (!Number.isSafeInteger(count) || count > 4294967295)
+      throw new RangeError("Surface exceeds 32-bit indexing");
+    const positions = new Float32Array(count * 3), normals = new Float32Array(count * 3), uvs = new Float32Array(count * 2);
+    const canonical = (value, periodic) => periodic ? (value % 1 + 1) % 1 : Math.max(0, Math.min(1, value));
+    const evaluate = (u, v) => readVector(sample(canonical(u, periodicU), canonical(v, periodicV)));
+    const step = 1e-5;
+    let row = 0;
+    for (let j = 0; j <= vSegments; j++)
+      for (let i = 0; i <= uSegments; i++, row++) {
+        const u = i / uSegments, v = j / vSegments;
+        const sampleU = canonical(u, periodicU), sampleV = canonical(v, periodicV);
+        positions.set(evaluate(sampleU, sampleV), row * 3);
+        let n;
+        if (normal)
+          n = readVector(normal(sampleU, sampleV));
+        else {
+          const left = evaluate(sampleU - step, sampleV), right = evaluate(sampleU + step, sampleV);
+          const below = evaluate(sampleU, sampleV - step), above = evaluate(sampleU, sampleV + step);
+          const du = normalized(right.map((value, axis) => value - left[axis]));
+          const dv = normalized(above.map((value, axis) => value - below[axis]));
+          n = [
+            du[1] * dv[2] - du[2] * dv[1],
+            du[2] * dv[0] - du[0] * dv[2],
+            du[0] * dv[1] - du[1] * dv[0]
+          ];
+        }
+        normals.set(normalized(n), row * 3);
+        uvs.set([u, v], row * 2);
+      }
+    for (const value of positions)
+      if (!Number.isFinite(value))
+        throw new RangeError("Positions must be representable as Float32");
+    const indices = count > 65535 ? new Uint32Array(indexCount) : new Uint16Array(indexCount);
+    const stride = uSegments + 1;
+    let cursor = 0;
+    for (let j = 0; j < vSegments; j++)
+      for (let i = 0; i < uSegments; i++) {
+        const a = j * stride + i, b = a + 1, c = a + stride, d = c + 1;
+        indices[cursor++] = a;
+        indices[cursor++] = b;
+        indices[cursor++] = d;
+        indices[cursor++] = a;
+        indices[cursor++] = d;
+        indices[cursor++] = c;
+      }
+    super({
+      id: props.id,
+      topology: "triangle-list",
+      indices,
+      attributes: {
+        POSITION: { size: 3, value: positions },
+        NORMAL: { size: 3, value: normals },
+        TEXCOORD_0: { size: 2, value: uvs },
+        ...props.attributes
+      }
+    });
+  }
+};
+function readVector(value) {
+  if (!value || value.length !== 3 || !Array.from(value).every(Number.isFinite))
+    throw new RangeError("Surface samples and normals must be finite triples");
+  return Array.from(value);
+}
+function normalized(vector) {
+  const scale = Math.max(...vector.map(Math.abs));
+  if (!scale)
+    return [0, 0, 0];
+  const scaled = vector.map((value) => value / scale), length = Math.hypot(...scaled);
+  return scaled.map((value) => value === 0 ? 0 : value / length);
+}
+
+// dist/parametric/torus-geometry.js
+var TorusGeometry = class extends ParametricGeometry {
+  constructor(props = {}) {
+    const { majorRadius = 1, minorRadius = 0.3, majorSegments = 48, minorSegments = 24, arc = Math.PI * 2, startAngle = 0, cap = false } = props;
+    assertPositive(majorRadius, "majorRadius");
+    assertPositive(minorRadius, "minorRadius");
+    if (minorRadius >= majorRadius)
+      throw new RangeError("Ring torus requires minorRadius < majorRadius");
+    if (!Number.isFinite(arc) || arc <= 0 || arc > Math.PI * 2)
+      throw new RangeError("arc must be in (0, 2\u03C0]");
+    assertSegments(majorSegments, "majorSegments", 3);
+    assertSegments(minorSegments, "minorSegments", 3);
+    if (!Number.isFinite(startAngle))
+      throw new RangeError("startAngle must be finite");
+    const hasCaps = cap && arc < Math.PI * 2;
+    super({
+      ...props,
+      attributes: hasCaps ? void 0 : props.attributes,
+      uSegments: majorSegments,
+      vSegments: minorSegments,
+      periodicU: arc === Math.PI * 2,
+      periodicV: true,
+      sample: (u, v) => {
+        const theta = startAngle + u * arc, phi = v * Math.PI * 2, radius = majorRadius + minorRadius * Math.cos(phi);
+        return [radius * Math.cos(theta), minorRadius * Math.sin(phi), -radius * Math.sin(theta)];
+      },
+      normal: (u, v) => [
+        Math.cos(v * Math.PI * 2) * Math.cos(startAngle + u * arc),
+        Math.sin(v * Math.PI * 2),
+        -Math.cos(v * Math.PI * 2) * Math.sin(startAngle + u * arc)
+      ]
+    });
+    if (hasCaps) {
+      const surfacePositions = this.attributes["POSITION"].value;
+      const positions = Array.from(surfacePositions);
+      const normals = Array.from(this.attributes["NORMAL"].value);
+      const textureCoordinates = Array.from(this.attributes["TEXCOORD_0"].value);
+      const indices = Array.from(this.indices.value);
+      for (const [angle, direction] of [
+        [startAngle, -1],
+        [startAngle + arc, 1]
+      ]) {
+        const normal = [-Math.sin(angle) * direction, 0, -Math.cos(angle) * direction];
+        const centerIndex = positions.length / 3;
+        positions.push(majorRadius * Math.cos(angle), 0, -majorRadius * Math.sin(angle));
+        normals.push(...normal);
+        textureCoordinates.push(0.5, 0.5);
+        for (let minorSegment = 0; minorSegment <= minorSegments; minorSegment++) {
+          const tubeAngle = minorSegment % minorSegments * Math.PI * 2 / minorSegments;
+          const boundaryOffset = (minorSegment * (majorSegments + 1) + (direction < 0 ? 0 : majorSegments)) * 3;
+          positions.push(...surfacePositions.slice(boundaryOffset, boundaryOffset + 3));
+          normals.push(...normal);
+          textureCoordinates.push((Math.cos(tubeAngle) + 1) / 2, (Math.sin(tubeAngle) + 1) / 2);
+          if (minorSegment < minorSegments) {
+            const firstIndex = centerIndex + minorSegment + 1;
+            const secondIndex = firstIndex + 1;
+            indices.push(centerIndex, ...direction > 0 ? [secondIndex, firstIndex] : [firstIndex, secondIndex]);
+          }
+        }
+      }
+      const cappedGeometry = new Geometry({
+        id: this.id,
+        topology: this.topology,
+        indices: makeIndices(positions.length / 3, indices),
+        attributes: {
+          POSITION: { size: 3, value: new Float32Array(positions) },
+          NORMAL: { size: 3, value: new Float32Array(normals) },
+          TEXCOORD_0: { size: 2, value: new Float32Array(textureCoordinates) },
+          ...props.attributes
+        }
+      });
+      Object.assign(this, {
+        attributes: cappedGeometry.attributes,
+        indices: cappedGeometry.indices,
+        vertexCount: cappedGeometry.vertexCount
+      });
+    }
+  }
+};
+
+// dist/parametric/lathe-geometry.js
+var LatheGeometry = class extends ParametricGeometry {
+  constructor(props) {
+    const { points, segments = 48, phiStart = 0, phiLength = Math.PI * 2 } = props;
+    if (!points || points.length < 2 || points.some((p) => p.length !== 2 || !p.every(Number.isFinite) || p[0] < 0))
+      throw new RangeError("Lathe needs at least two finite [nonnegative radius, height] points");
+    if (!Number.isFinite(phiStart) || !Number.isFinite(phiLength) || phiLength <= 0 || phiLength > Math.PI * 2)
+      throw new RangeError("Invalid lathe angular sweep");
+    if (segments < 3)
+      throw new RangeError("Lathe requires at least three angular segments");
+    const profile = points.map((p) => [...p]);
+    const edgeNormals = profile.slice(1).map((p, i) => {
+      const dr = p[0] - profile[i][0], dy = p[1] - profile[i][1];
+      if (dr === 0 && dy === 0)
+        throw new RangeError("Consecutive profile points must differ");
+      return normalized([dy, -dr, 0]);
+    });
+    const profileNormals = profile.map((_, i) => {
+      const before = edgeNormals[Math.max(0, i - 1)], after = edgeNormals[Math.min(i, edgeNormals.length - 1)];
+      return normalized(before.map((value, axis) => value + after[axis]));
+    });
+    const section = (v) => {
+      const coordinate = v * (profile.length - 1), i = Math.min(profile.length - 2, Math.floor(coordinate));
+      return { i, t: coordinate - i };
+    };
+    super({
+      ...props,
+      uSegments: segments,
+      vSegments: profile.length - 1,
+      periodicU: phiLength === Math.PI * 2,
+      sample: (u, v) => {
+        const { i, t } = section(v), radius = profile[i][0] * (1 - t) + profile[i + 1][0] * t, height = profile[i][1] * (1 - t) + profile[i + 1][1] * t, theta = phiStart + u * phiLength;
+        return [radius * Math.cos(theta), height, -radius * Math.sin(theta)];
+      },
+      normal: (u, v) => {
+        const { i, t } = section(v), n = profileNormals[i].map((value, axis) => value * (1 - t) + profileNormals[i + 1][axis] * t), theta = phiStart + u * phiLength;
+        return [n[0] * Math.cos(theta), n[1], -n[0] * Math.sin(theta)];
+      }
+    });
+  }
+};
+//# sourceMappingURL=parametric.cjs.map

package/dist/parametric.cjs.map

@@ -0,0 +1,6 @@
+{
+  "version": 3,
+  "sources": ["../src/parametric.ts", "../src/lib/geometry.ts", "../src/geometries/geometry-helpers.ts", "../src/parametric/parametric-geometry.ts", "../src/parametric/torus-geometry.ts", "../src/parametric/lathe-geometry.ts"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;;ACkCA,IAAI,aAAa;AAGX,IAAO,WAAP,MAAe;EAQnB,YAAY,OAAoB;AAFhC,SAAA,WAAoC,CAAA;AAGlC,SAAK,KAAK,MAAM,MAAM,YAAY,EAAE,UAAU;AAC9C,SAAK,WAAW,MAAM;AACtB,SAAK,aAAa,CAAA;AAElB,QAAI,UAAU,MAAM,UAAU,mBAAmB,MAAM,OAAO,IAAI;AAClE,eAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,MAAM,cAAc,CAAA,CAAE,GAAG;AAClE,YAAM,YAAY,mBAAmB,KAAK;AAC1C,UAAI,SAAS,cAAc,SAAS,aAAa;AAC/C,kBAAU,SAAV,UAAU,OAAS;MACrB;AACA,UAAI,SAAS,WAAW;AACtB,YAAI;AAAS,gBAAM,IAAI,MAAM,wCAAwC;AACrE,kBAAU;MACZ,OAAO;AACL,aAAK,WAAW,IAAI,IAAI;MAC1B;IACF;AAEA,QAAI,SAAS;AACX,UAAI,EAAE,QAAQ,iBAAiB,eAAe,QAAQ,iBAAiB,cAAc;AACnF,cAAM,IAAI,MAAM,uDAAuD;MACzE;AACA,cAAQ,OAAO;AACf,WAAK,UAAU;AACf,sBAAgB,SAAS,KAAK,UAAU;IAC1C;AAEA,SAAK,cAAc,MAAM,eAAe,qBAAqB,KAAK,YAAY,KAAK,OAAO;AAC1F,QAAI,CAAC,OAAO,UAAU,KAAK,WAAW,KAAK,KAAK,cAAc,GAAG;AAC/D,YAAM,IAAI,MAAM,qDAAqD;IACvE;EACF;EAEA,iBAAc;AACZ,WAAO,KAAK;EACd;EAEA,gBAAa;AACX,WACE,KAAK,UAAU,EAAC,SAAS,KAAK,SAAS,GAAG,KAAK,WAAU,IAAI,KAAK;EAEtE;;AAGF,SAAS,mBAAmB,OAA6B;AACvD,QAAM,YAAY,aAAa,KAAK,IAAI,EAAC,OAAO,MAAK,IAAI,EAAC,GAAG,MAAK;AAClE,MAAI,CAAC,aAAa,UAAU,KAAK,GAAG;AAClC,UAAM,IAAI,MAAM,sDAAsD;EACxE;AACA,MAAI,UAAU,SAAS,WAAc,CAAC,OAAO,UAAU,UAAU,IAAI,KAAK,UAAU,OAAO,IAAI;AAC7F,UAAM,IAAI,MAAM,oDAAoD;EACtE;AACA,MAAI,UAAU,QAAQ,UAAU,MAAM,SAAS,UAAU,SAAS,GAAG;AACnE,UAAM,IAAI,MAAM,yDAAyD;EAC3E;AACA,SAAO;AACT;AAEA,SAAS,aAAa,OAAc;AAClC,SAAO,YAAY,OAAO,KAAK,KAAK,EAAE,iBAAiB;AACzD;AAEA,SAAS,gBACP,SACA,YAA6C;AAE7C,MAAI,eAAe;AACnB,aAAW,SAAS,QAAQ;AAAO,mBAAe,KAAK,IAAI,cAAc,OAAO,KAAK,CAAC;AACtF,aAAW,CAAC,MAAM,SAAS,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC1D,QAAI,CAAC,UAAU,YAAY,UAAU,MAAM;AACzC,YAAM,uBAAuB,UAAU,MAAM,SAAS,UAAU;AAChE,UAAI,gBAAgB,sBAAsB;AACxC,cAAM,IAAI,MACR,kBAAkB,YAAY,YAAY,IAAI,iBAAiB,oBAAoB,EAAE;MAEzF;IACF;EACF;AACF;AAEA,SAAS,qBACP,YACA,SAA2B;AAE3B,MAAI;AAAS,WAAO,QAAQ,MAAM;AAClC,MAAI,QAAQ;AACZ,aAAW,aAAa,OAAO,OAAO,UAAU,GAAG;AACjD,QAAI,CAAC,UAAU,YAAY,UAAU,MAAM;AACzC,cAAQ,KAAK,IAAI,OAAO,UAAU,MAAM,SAAS,UAAU,IAAI;IACjE;EACF;AACA,MAAI,CAAC,OAAO,SAAS,KAAK;AAAG,UAAM,IAAI,MAAM,sCAAsC;AACnF,SAAO;AACT;;;AChIM,SAAU,eAAe,OAAe,MAAY;AACxD,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS;AAAG,UAAM,IAAI,MAAM,GAAG,IAAI,4BAA4B;AAChG;AAMM,SAAU,eAAe,OAAe,MAAc,UAAU,GAAC;AACrE,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ;AACtC,UAAM,IAAI,MAAM,GAAG,IAAI,0BAA0B,OAAO,EAAE;AAC9D;AAEM,SAAU,YAAY,aAAqB,QAAgB;AAC/D,SAAO,cAAc,QAAS,IAAI,YAAY,MAAM,IAAI,IAAI,YAAY,MAAM;AAChF;;;ACNM,IAAO,qBAAP,cAAkC,SAAQ;EAC9C,YAAY,OAA8B;AACxC,UAAM,EACJ,QACA,QACA,YAAY,IACZ,YAAY,IACZ,YAAY,OACZ,YAAY,MAAK,IACf;AACJ,mBAAe,WAAW,WAAW;AACrC,mBAAe,WAAW,WAAW;AACrC,UAAM,SAAS,YAAY,MAAM,YAAY;AAC7C,UAAM,aAAa,YAAY,YAAY;AAC3C,QAAI,CAAC,OAAO,cAAc,UAAU,KAAK,aAAa;AACpD,YAAM,IAAI,WAAW,4CAA4C;AACnE,QAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ;AAC1C,YAAM,IAAI,WAAW,iCAAiC;AACxD,UAAM,YAAY,IAAI,aAAa,QAAQ,CAAC,GAC1C,UAAU,IAAI,aAAa,QAAQ,CAAC,GACpC,MAAM,IAAI,aAAa,QAAQ,CAAC;AAClC,UAAM,YAAY,CAAC,OAAe,aAChC,YAAa,QAAQ,IAAK,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACnE,UAAM,WAAW,CAAC,GAAW,MAC3B,WAAW,OAAO,UAAU,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,CAAC,CAAC;AAGrE,UAAM,OAAO;AACb,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,KAAK,WAAW;AAC9B,eAAS,IAAI,GAAG,KAAK,WAAW,KAAK,OAAO;AAC1C,cAAM,IAAI,IAAI,WACZ,IAAI,IAAI;AACV,cAAM,UAAU,UAAU,GAAG,SAAS,GACpC,UAAU,UAAU,GAAG,SAAS;AAClC,kBAAU,IAAI,SAAS,SAAS,OAAO,GAAG,MAAM,CAAC;AACjD,YAAI;AACJ,YAAI;AAAQ,cAAI,WAAW,OAAO,SAAS,OAAO,CAAC;aAC9C;AACH,gBAAM,OAAO,SAAS,UAAU,MAAM,OAAO,GAC3C,QAAQ,SAAS,UAAU,MAAM,OAAO;AAC1C,gBAAM,QAAQ,SAAS,SAAS,UAAU,IAAI,GAC5C,QAAQ,SAAS,SAAS,UAAU,IAAI;AAC1C,gBAAM,KAAK,WAAW,MAAM,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,IAAI,CAAC,CAAC;AACpE,gBAAM,KAAK,WAAW,MAAM,IAAI,CAAC,OAAO,SAAS,QAAQ,MAAM,IAAI,CAAC,CAAC;AACrE,cAAI;YACF,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC;YAC5B,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC;YAC5B,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC;;QAEhC;AACA,gBAAQ,IAAI,WAAW,CAAC,GAAG,MAAM,CAAC;AAClC,YAAI,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;MACzB;AACF,eAAW,SAAS;AAClB,UAAI,CAAC,OAAO,SAAS,KAAK;AACxB,cAAM,IAAI,WAAW,4CAA4C;AACrE,UAAM,UAAU,QAAQ,QAAS,IAAI,YAAY,UAAU,IAAI,IAAI,YAAY,UAAU;AACzF,UAAM,SAAS,YAAY;AAC3B,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,IAAI,WAAW;AAC7B,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,cAAM,IAAI,IAAI,SAAS,GACrB,IAAI,IAAI,GACR,IAAI,IAAI,QACR,IAAI,IAAI;AACV,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,QAAQ,IAAI;AACpB,gBAAQ,QAAQ,IAAI;MACtB;AACF,UAAM;MACJ,IAAI,MAAM;MACV,UAAU;MACV;MACA,YAAY;QACV,UAAU,EAAC,MAAM,GAAG,OAAO,UAAS;QACpC,QAAQ,EAAC,MAAM,GAAG,OAAO,QAAO;QAChC,YAAY,EAAC,MAAM,GAAG,OAAO,IAAG;QAChC,GAAG,MAAM;;KAEZ;EACH;;AAEF,SAAS,WAAW,OAAkC;AACpD,MAAI,CAAC,SAAS,MAAM,WAAW,KAAK,CAAC,MAAM,KAAK,KAAK,EAAE,MAAM,OAAO,QAAQ;AAC1E,UAAM,IAAI,WAAW,oDAAoD;AAC3E,SAAO,MAAM,KAAK,KAAK;AACzB;AACM,SAAU,WAAW,QAAgB;AACzC,QAAM,QAAQ,KAAK,IAAI,GAAG,OAAO,IAAI,KAAK,GAAG,CAAC;AAC9C,MAAI,CAAC;AAAO,WAAO,CAAC,GAAG,GAAG,CAAC;AAC3B,QAAM,SAAS,OAAO,IAAI,WAAS,QAAQ,KAAK,GAC9C,SAAS,KAAK,MAAM,GAAG,MAAM;AAC/B,SAAO,OAAO,IAAI,WAAU,UAAU,IAAI,IAAI,QAAQ,MAAO;AAC/D;;;AC7FM,IAAO,gBAAP,cAA6B,mBAAkB;EACnD,YAAY,QAA4B,CAAA,GAAE;AACxC,UAAM,EACJ,cAAc,GACd,cAAc,KACd,gBAAgB,IAChB,gBAAgB,IAChB,MAAM,KAAK,KAAK,GAChB,aAAa,GACb,MAAM,MAAK,IACT;AACJ,mBAAe,aAAa,aAAa;AACzC,mBAAe,aAAa,aAAa;AACzC,QAAI,eAAe;AACjB,YAAM,IAAI,WAAW,+CAA+C;AACtE,QAAI,CAAC,OAAO,SAAS,GAAG,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK;AACvD,YAAM,IAAI,WAAW,6BAAwB;AAC/C,mBAAe,eAAe,iBAAiB,CAAC;AAChD,mBAAe,eAAe,iBAAiB,CAAC;AAChD,QAAI,CAAC,OAAO,SAAS,UAAU;AAAG,YAAM,IAAI,WAAW,2BAA2B;AAClF,UAAM,UAAU,OAAO,MAAM,KAAK,KAAK;AACvC,UAAM;MACJ,GAAG;MACH,YAAY,UAAU,SAAY,MAAM;MACxC,WAAW;MACX,WAAW;MACX,WAAW,QAAQ,KAAK,KAAK;MAC7B,WAAW;MACX,QAAQ,CAAC,GAAG,MAAK;AACf,cAAM,QAAQ,aAAa,IAAI,KAC7B,MAAM,IAAI,KAAK,KAAK,GACpB,SAAS,cAAc,cAAc,KAAK,IAAI,GAAG;AACnD,eAAO,CAAC,SAAS,KAAK,IAAI,KAAK,GAAG,cAAc,KAAK,IAAI,GAAG,GAAG,CAAC,SAAS,KAAK,IAAI,KAAK,CAAC;MAC1F;MACA,QAAQ,CAAC,GAAG,MAAM;QAChB,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,IAAI,aAAa,IAAI,GAAG;QACzD,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;QACxB,CAAC,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,IAAI,aAAa,IAAI,GAAG;;KAE7D;AACD,QAAI,SAAS;AACX,YAAM,mBAAmB,KAAK,WAAW,UAAU,EAAE;AACrD,YAAM,YAAY,MAAM,KAAK,gBAAgB;AAC7C,YAAM,UAAU,MAAM,KAAK,KAAK,WAAW,QAAQ,EAAE,KAAK;AAC1D,YAAM,qBAAqB,MAAM,KAAK,KAAK,WAAW,YAAY,EAAE,KAAK;AACzE,YAAM,UAAU,MAAM,KAAK,KAAK,QAAS,KAAK;AAC9C,iBAAW,CAAC,OAAO,SAAS,KAAK;QAC/B,CAAC,YAAY,EAAE;QACf,CAAC,aAAa,KAAK,CAAC;SACnB;AACD,cAAM,SAAS,CAAC,CAAC,KAAK,IAAI,KAAK,IAAI,WAAW,GAAG,CAAC,KAAK,IAAI,KAAK,IAAI,SAAS;AAC7E,cAAM,cAAc,UAAU,SAAS;AACvC,kBAAU,KAAK,cAAc,KAAK,IAAI,KAAK,GAAG,GAAG,CAAC,cAAc,KAAK,IAAI,KAAK,CAAC;AAC/E,gBAAQ,KAAK,GAAG,MAAM;AACtB,2BAAmB,KAAK,KAAK,GAAG;AAChC,iBAAS,eAAe,GAAG,gBAAgB,eAAe,gBAAgB;AAExE,gBAAM,YAAc,eAAe,gBAAiB,KAAK,KAAK,IAAK;AAEnE,gBAAM,kBACH,gBAAgB,gBAAgB,MAAM,YAAY,IAAI,IAAI,kBAAkB;AAC/E,oBAAU,KAAK,GAAG,iBAAiB,MAAM,gBAAgB,iBAAiB,CAAC,CAAC;AAC5E,kBAAQ,KAAK,GAAG,MAAM;AACtB,6BAAmB,MAAM,KAAK,IAAI,SAAS,IAAI,KAAK,IAAI,KAAK,IAAI,SAAS,IAAI,KAAK,CAAC;AACpF,cAAI,eAAe,eAAe;AAChC,kBAAM,aAAa,cAAc,eAAe;AAChD,kBAAM,cAAc,aAAa;AACjC,oBAAQ,KACN,aACA,GAAI,YAAY,IAAI,CAAC,aAAa,UAAU,IAAI,CAAC,YAAY,WAAW,CAAE;UAE9E;QACF;MACF;AACA,YAAM,iBAAiB,IAAI,SAAS;QAClC,IAAI,KAAK;QACT,UAAU,KAAK;QACf,SAAS,YAAY,UAAU,SAAS,GAAG,OAAO;QAClD,YAAY;UACV,UAAU,EAAC,MAAM,GAAG,OAAO,IAAI,aAAa,SAAS,EAAC;UACtD,QAAQ,EAAC,MAAM,GAAG,OAAO,IAAI,aAAa,OAAO,EAAC;UAClD,YAAY,EAAC,MAAM,GAAG,OAAO,IAAI,aAAa,kBAAkB,EAAC;UACjE,GAAG,MAAM;;OAEZ;AAED,aAAO,OAAO,MAAM;QAClB,YAAY,eAAe;QAC3B,SAAS,eAAe;QACxB,aAAa,eAAe;OAC7B;IACH;EACF;;;;ACvGI,IAAO,gBAAP,cAA6B,mBAAkB;EACnD,YAAY,OAAyB;AACnC,UAAM,EAAC,QAAQ,WAAW,IAAI,WAAW,GAAG,YAAY,KAAK,KAAK,EAAC,IAAI;AACvE,QACE,CAAC,UACD,OAAO,SAAS,KAChB,OAAO,KAAK,OAAK,EAAE,WAAW,KAAK,CAAC,EAAE,MAAM,OAAO,QAAQ,KAAK,EAAE,CAAC,IAAI,CAAC;AAExE,YAAM,IAAI,WAAW,qEAAqE;AAC5F,QACE,CAAC,OAAO,SAAS,QAAQ,KACzB,CAAC,OAAO,SAAS,SAAS,KAC1B,aAAa,KACb,YAAY,KAAK,KAAK;AAEtB,YAAM,IAAI,WAAW,6BAA6B;AACpD,QAAI,WAAW;AAAG,YAAM,IAAI,WAAW,gDAAgD;AACvF,UAAM,UAAU,OAAO,IAAI,OAAK,CAAC,GAAG,CAAC,CAAC;AACtC,UAAM,cAAc,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,GAAG,MAAK;AAChD,YAAM,KAAK,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,GAC5B,KAAK,EAAE,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC;AAC1B,UAAI,OAAO,KAAK,OAAO;AAAG,cAAM,IAAI,WAAW,wCAAwC;AACvF,aAAO,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;AACD,UAAM,iBAAiB,QAAQ,IAAI,CAAC,GAAG,MAAK;AAC1C,YAAM,SAAS,YAAY,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC,GAC3C,QAAQ,YAAY,KAAK,IAAI,GAAG,YAAY,SAAS,CAAC,CAAC;AACzD,aAAO,WAAW,OAAO,IAAI,CAAC,OAAO,SAAS,QAAQ,MAAM,IAAI,CAAC,CAAC;IACpE,CAAC;AACD,UAAM,UAAU,CAAC,MAAa;AAC5B,YAAM,aAAa,KAAK,QAAQ,SAAS,IACvC,IAAI,KAAK,IAAI,QAAQ,SAAS,GAAG,KAAK,MAAM,UAAU,CAAC;AACzD,aAAO,EAAC,GAAG,GAAG,aAAa,EAAC;IAC9B;AACA,UAAM;MACJ,GAAG;MACH,WAAW;MACX,WAAW,QAAQ,SAAS;MAC5B,WAAW,cAAc,KAAK,KAAK;MACnC,QAAQ,CAAC,GAAG,MAAK;AACf,cAAM,EAAC,GAAG,EAAC,IAAI,QAAQ,CAAC,GACtB,SAAS,QAAQ,CAAC,EAAE,CAAC,KAAK,IAAI,KAAK,QAAQ,IAAI,CAAC,EAAE,CAAC,IAAI,GACvD,SAAS,QAAQ,CAAC,EAAE,CAAC,KAAK,IAAI,KAAK,QAAQ,IAAI,CAAC,EAAE,CAAC,IAAI,GACvD,QAAQ,WAAW,IAAI;AACzB,eAAO,CAAC,SAAS,KAAK,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,KAAK,IAAI,KAAK,CAAC;MACrE;MACA,QAAQ,CAAC,GAAG,MAAK;AACf,cAAM,EAAC,GAAG,EAAC,IAAI,QAAQ,CAAC,GACtB,IAAI,eAAe,CAAC,EAAE,IACpB,CAAC,OAAO,SAAS,SAAS,IAAI,KAAK,eAAe,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,GAEpE,QAAQ,WAAW,IAAI;AACzB,eAAO,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC;MAC/D;KACD;EACH;;",
+  "names": []
+}

package/dist/parametric.d.ts

@@ -0,0 +1,7 @@
+export { ParametricGeometry } from "./parametric/parametric-geometry.js";
+export type { ParametricGeometryProps, SurfaceSampler } from "./parametric/parametric-geometry.js";
+export { TorusGeometry } from "./parametric/torus-geometry.js";
+export type { TorusGeometryProps } from "./parametric/torus-geometry.js";
+export { LatheGeometry } from "./parametric/lathe-geometry.js";
+export type { LatheGeometryProps } from "./parametric/lathe-geometry.js";
+//# sourceMappingURL=parametric.d.ts.map

package/dist/parametric.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parametric.d.ts","sourceRoot":"","sources":["../src/parametric.ts"],"names":[],"mappings":"AAGA,OAAO,EAAC,kBAAkB,EAAC,4CAAyC;AACpE,YAAY,EAAC,uBAAuB,EAAE,cAAc,EAAC,4CAAyC;AAC9F,OAAO,EAAC,aAAa,EAAC,uCAAoC;AAC1D,YAAY,EAAC,kBAAkB,EAAC,uCAAoC;AACpE,OAAO,EAAC,aAAa,EAAC,uCAAoC;AAC1D,YAAY,EAAC,kBAAkB,EAAC,uCAAoC"}

package/dist/parametric.js

@@ -0,0 +1,7 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+export { ParametricGeometry } from "./parametric/parametric-geometry.js";
+export { TorusGeometry } from "./parametric/torus-geometry.js";
+export { LatheGeometry } from "./parametric/lathe-geometry.js";
+//# sourceMappingURL=parametric.js.map

package/dist/parametric.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parametric.js","sourceRoot":"","sources":["../src/parametric.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAC5D,OAAO,EAAC,kBAAkB,EAAC,4CAAyC;AAEpE,OAAO,EAAC,aAAa,EAAC,uCAAoC;AAE1D,OAAO,EAAC,aAAa,EAAC,uCAAoC"}

package/dist/polygon/cut-by-grid.d.ts

@@ -0,0 +1,24 @@
+import type { NumericArray } from '@math.gl/core';
+export type Polygon = {
+    positions: Readonly<NumericArray>;
+    holeIndices?: Readonly<NumericArray>;
+    edgeTypes?: Readonly<NumericArray>;
+};
+export declare function cutPolylineByGrid(positions: NumericArray, options?: {
+    size?: number;
+    broken?: boolean;
+    gridResolution?: number;
+    gridOffset?: [number, number];
+    startIndex?: number;
+    endIndex?: number;
+}): number[] | number[][];
+/**
+ * Cuts a polygon by a pre-defined grid
+ */
+export declare function cutPolygonByGrid(positions: Readonly<NumericArray>, holeIndices?: Readonly<NumericArray> | null, options?: {
+    size?: number;
+    gridResolution?: number;
+    gridOffset?: [number, number];
+    edgeTypes?: boolean;
+}): Polygon[];
+//# sourceMappingURL=cut-by-grid.d.ts.map

package/dist/polygon/cut-by-grid.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cut-by-grid.d.ts","sourceRoot":"","sources":["../../src/polygon/cut-by-grid.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,eAAe,CAAC;AAEhD,MAAM,MAAM,OAAO,GAAG;IACpB,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IAClC,WAAW,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IACrC,SAAS,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;CACpC,CAAC;AAEF,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,YAAY,EACvB,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,GACA,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAkDvB;AAmBD;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,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,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB,GACA,OAAO,EAAE,CAmEX"}

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