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

package/dist/culling/queries.cjs

@@ -0,0 +1,161 @@
+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/culling/queries.js
+var queries_exports = {};
+__export(queries_exports, {
+  getClosestPointOnTriangle: () => getClosestPointOnTriangle,
+  intersectRayBounds: () => intersectRayBounds,
+  intersectRayTriangle: () => intersectRayTriangle,
+  normalizeQueryDirection: () => normalizeQueryDirection,
+  validateQueryDistance: () => validateQueryDistance,
+  validateQueryPoint: () => validateQueryPoint
+});
+module.exports = __toCommonJS(queries_exports);
+function validateQueryPoint(point, dimension) {
+  if (point.length !== dimension)
+    throw new RangeError("Query dimension must match the index");
+  for (let i = 0; i < dimension; i++) {
+    if (!Number.isFinite(point[i]))
+      throw new RangeError("Coordinates must be finite");
+  }
+}
+function validateQueryDistance(distance) {
+  if (Number.isNaN(distance) || distance < 0)
+    throw new RangeError("Distance must be nonnegative");
+}
+function normalizeQueryDirection(direction, dimension) {
+  validateQueryPoint(direction, dimension);
+  const scale = Math.max(...Array.from(direction, Math.abs));
+  if (scale === 0)
+    throw new RangeError("Ray direction must be nonzero");
+  const scaled = Array.from(direction, (x) => x / scale);
+  const length = Math.hypot(...scaled);
+  return scaled.map((x) => x / length);
+}
+function intersectRayBounds(origin, direction, minimum, maximum, maxT = Infinity) {
+  const dimension = origin.length;
+  if (dimension !== 2 && dimension !== 3)
+    throw new RangeError("Bounds must be 2D or 3D");
+  validateQueryPoint(origin, dimension);
+  validateQueryPoint(direction, dimension);
+  validateQueryPoint(minimum, dimension);
+  validateQueryPoint(maximum, dimension);
+  validateQueryDistance(maxT);
+  let near = 0, far = maxT, nonzero = false;
+  for (let i = 0; i < dimension; i++) {
+    if (minimum[i] > maximum[i])
+      throw new RangeError("Bounds must be ordered");
+    nonzero || (nonzero = direction[i] !== 0);
+  }
+  if (!nonzero)
+    throw new RangeError("Ray direction must be nonzero");
+  for (let i = 0; i < dimension; i++) {
+    if (direction[i] === 0) {
+      if (origin[i] < minimum[i] || origin[i] > maximum[i])
+        return null;
+      continue;
+    }
+    let a = (minimum[i] - origin[i]) / direction[i];
+    let b = (maximum[i] - origin[i]) / direction[i];
+    if (a > b)
+      [a, b] = [b, a];
+    near = Math.max(near, a);
+    far = Math.min(far, b);
+    if (near > far)
+      return null;
+  }
+  return Number.isFinite(near) ? near : null;
+}
+function intersectRayTriangle(origin, direction, a, b, c, options = {}) {
+  for (const point of [origin, direction, a, b, c])
+    validateQueryPoint(point, 3);
+  if (direction[0] === 0 && direction[1] === 0 && direction[2] === 0) {
+    throw new RangeError("Ray direction must be nonzero");
+  }
+  const maxT = options.maxT ?? Infinity;
+  validateQueryDistance(maxT);
+  const e1 = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
+  const e2 = [c[0] - a[0], c[1] - a[1], c[2] - a[2]];
+  const p = cross(direction, e2);
+  const determinant = dot(e1, p);
+  if (determinant === 0 || options.backfaceCulling && determinant < 0)
+    return null;
+  const offset = [origin[0] - a[0], origin[1] - a[1], origin[2] - a[2]];
+  const u = dot(offset, p) / determinant;
+  if (u < 0 || u > 1)
+    return null;
+  const q = cross(offset, e1);
+  const v = dot(direction, q) / determinant;
+  if (v < 0 || u + v > 1)
+    return null;
+  const t = dot(e2, q) / determinant;
+  if (!Number.isFinite(t) || t < 0 || t > maxT)
+    return null;
+  return { t: Math.max(0, t), barycentric: [1 - u - v, u, v] };
+}
+function getClosestPointOnTriangle(point, a, b, c) {
+  for (const value of [point, a, b, c])
+    validateQueryPoint(value, 3);
+  const ab = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
+  const ac = [c[0] - a[0], c[1] - a[1], c[2] - a[2]];
+  const ap = [point[0] - a[0], point[1] - a[1], point[2] - a[2]];
+  const aa = dot(ab, ab), bb = dot(ac, ac), cc = dot(ab, ac);
+  const denominator = aa * bb - cc * cc;
+  if (denominator > 0 && Number.isFinite(denominator)) {
+    const u = (bb * dot(ap, ab) - cc * dot(ap, ac)) / denominator;
+    const v = (aa * dot(ap, ac) - cc * dot(ap, ab)) / denominator;
+    if (u >= 0 && v >= 0 && u + v <= 1) {
+      return [
+        a[0] + u * ab[0] + v * ac[0],
+        a[1] + u * ab[1] + v * ac[1],
+        a[2] + u * ab[2] + v * ac[2]
+      ];
+    }
+  }
+  let best = [a[0], a[1], a[2]];
+  let distance = Infinity;
+  for (const [start, end] of [
+    [a, b],
+    [b, c],
+    [c, a]
+  ]) {
+    const edge = [end[0] - start[0], end[1] - start[1], end[2] - start[2]];
+    const offset = [point[0] - start[0], point[1] - start[1], point[2] - start[2]];
+    const squared = dot(edge, edge);
+    const t = squared > 0 ? Math.max(0, Math.min(1, dot(offset, edge) / squared)) : 0;
+    const candidate = [
+      start[0] + t * edge[0],
+      start[1] + t * edge[1],
+      start[2] + t * edge[2]
+    ];
+    const d = Math.hypot(point[0] - candidate[0], point[1] - candidate[1], point[2] - candidate[2]);
+    if (d < distance) {
+      distance = d;
+      best = candidate;
+    }
+  }
+  return best;
+}
+function dot(a, b) {
+  return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
+}
+function cross(a, b) {
+  return [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];
+}
+//# sourceMappingURL=queries.cjs.map

package/dist/culling/queries.cjs.map

@@ -0,0 +1,6 @@
+{
+  "version": 3,
+  "sources": ["../../src/culling/queries.ts"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;;;AAQM,SAAU,mBAAmB,OAAmB,WAAiB;AACrE,MAAI,MAAM,WAAW;AAAW,UAAM,IAAI,WAAW,sCAAsC;AAC3F,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,CAAC,OAAO,SAAS,MAAM,CAAC,CAAC;AAAG,YAAM,IAAI,WAAW,4BAA4B;EACnF;AACF;AAEM,SAAU,sBAAsB,UAAgB;AACpD,MAAI,OAAO,MAAM,QAAQ,KAAK,WAAW;AAAG,UAAM,IAAI,WAAW,8BAA8B;AACjG;AAGM,SAAU,wBAAwB,WAAuB,WAAiB;AAC9E,qBAAmB,WAAW,SAAS;AACvC,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,KAAK,WAAW,KAAK,GAAG,CAAC;AACzD,MAAI,UAAU;AAAG,UAAM,IAAI,WAAW,+BAA+B;AACrE,QAAM,SAAS,MAAM,KAAK,WAAW,OAAK,IAAI,KAAK;AACnD,QAAM,SAAS,KAAK,MAAM,GAAG,MAAM;AACnC,SAAO,OAAO,IAAI,OAAK,IAAI,MAAM;AACnC;AAGM,SAAU,mBACd,QACA,WACA,SACA,SACA,OAAO,UAAQ;AAEf,QAAM,YAAY,OAAO;AACzB,MAAI,cAAc,KAAK,cAAc;AAAG,UAAM,IAAI,WAAW,yBAAyB;AACtF,qBAAmB,QAAQ,SAAS;AACpC,qBAAmB,WAAW,SAAS;AACvC,qBAAmB,SAAS,SAAS;AACrC,qBAAmB,SAAS,SAAS;AACrC,wBAAsB,IAAI;AAC1B,MAAI,OAAO,GACT,MAAM,MACN,UAAU;AACZ,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,QAAQ,CAAC,IAAI,QAAQ,CAAC;AAAG,YAAM,IAAI,WAAW,wBAAwB;AAC1E,gBAAA,UAAY,UAAU,CAAC,MAAM;EAC/B;AACA,MAAI,CAAC;AAAS,UAAM,IAAI,WAAW,+BAA+B;AAClE,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,UAAU,CAAC,MAAM,GAAG;AACtB,UAAI,OAAO,CAAC,IAAI,QAAQ,CAAC,KAAK,OAAO,CAAC,IAAI,QAAQ,CAAC;AAAG,eAAO;AAC7D;IACF;AACA,QAAI,KAAK,QAAQ,CAAC,IAAI,OAAO,CAAC,KAAK,UAAU,CAAC;AAC9C,QAAI,KAAK,QAAQ,CAAC,IAAI,OAAO,CAAC,KAAK,UAAU,CAAC;AAC9C,QAAI,IAAI;AAAG,OAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AACzB,WAAO,KAAK,IAAI,MAAM,CAAC;AACvB,UAAM,KAAK,IAAI,KAAK,CAAC;AACrB,QAAI,OAAO;AAAK,aAAO;EACzB;AACA,SAAO,OAAO,SAAS,IAAI,IAAI,OAAO;AACxC;AAGM,SAAU,qBACd,QACA,WACA,GACA,GACA,GACA,UAAsD,CAAA,GAAE;AAExD,aAAW,SAAS,CAAC,QAAQ,WAAW,GAAG,GAAG,CAAC;AAAG,uBAAmB,OAAO,CAAC;AAC7E,MAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG;AAClE,UAAM,IAAI,WAAW,+BAA+B;EACtD;AACA,QAAM,OAAO,QAAQ,QAAQ;AAC7B,wBAAsB,IAAI;AAC1B,QAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjD,QAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjD,QAAM,IAAI,MAAM,WAAW,EAAE;AAC7B,QAAM,cAAc,IAAI,IAAI,CAAC;AAC7B,MAAI,gBAAgB,KAAM,QAAQ,mBAAmB,cAAc;AAAI,WAAO;AAC9E,QAAM,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;AACpE,QAAM,IAAI,IAAI,QAAQ,CAAC,IAAI;AAC3B,MAAI,IAAI,KAAK,IAAI;AAAG,WAAO;AAC3B,QAAM,IAAI,MAAM,QAAQ,EAAE;AAC1B,QAAM,IAAI,IAAI,WAAW,CAAC,IAAI;AAC9B,MAAI,IAAI,KAAK,IAAI,IAAI;AAAG,WAAO;AAC/B,QAAM,IAAI,IAAI,IAAI,CAAC,IAAI;AACvB,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI;AAAM,WAAO;AACrD,SAAO,EAAC,GAAG,KAAK,IAAI,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC,EAAC;AAC3D;AAGM,SAAU,0BACd,OACA,GACA,GACA,GAAa;AAEb,aAAW,SAAS,CAAC,OAAO,GAAG,GAAG,CAAC;AAAG,uBAAmB,OAAO,CAAC;AACjE,QAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjD,QAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjD,QAAM,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;AAC7D,QAAM,KAAK,IAAI,IAAI,EAAE,GACnB,KAAK,IAAI,IAAI,EAAE,GACf,KAAK,IAAI,IAAI,EAAE;AACjB,QAAM,cAAc,KAAK,KAAK,KAAK;AACnC,MAAI,cAAc,KAAK,OAAO,SAAS,WAAW,GAAG;AACnD,UAAM,KAAK,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE,KAAK;AAClD,UAAM,KAAK,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE,KAAK;AAClD,QAAI,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,GAAG;AAClC,aAAO;QACL,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC;QAC3B,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC;QAC3B,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC;;IAE/B;EACF;AACA,MAAI,OAAiC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACtD,MAAI,WAAW;AACf,aAAW,CAAC,OAAO,GAAG,KAAK;IACzB,CAAC,GAAG,CAAC;IACL,CAAC,GAAG,CAAC;IACL,CAAC,GAAG,CAAC;KACJ;AACD,UAAM,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC;AACrE,UAAM,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC;AAC7E,UAAM,UAAU,IAAI,MAAM,IAAI;AAC9B,UAAM,IAAI,UAAU,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,IAAI,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;AAChF,UAAM,YAAsC;MAC1C,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC;MACrB,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC;MACrB,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC;;AAEvB,UAAM,IAAI,KAAK,MAAM,MAAM,CAAC,IAAI,UAAU,CAAC,GAAG,MAAM,CAAC,IAAI,UAAU,CAAC,GAAG,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC;AAC9F,QAAI,IAAI,UAAU;AAChB,iBAAW;AACX,aAAO;IACT;EACF;AACA,SAAO;AACT;AAEA,SAAS,IAAI,GAAe,GAAa;AACvC,SAAO,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAC/C;AACA,SAAS,MAAM,GAAe,GAAa;AACzC,SAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACzF;",
+  "names": []
+}

package/dist/culling/queries.d.ts

@@ -0,0 +1,20 @@
+/** Low-level Euclidean query kernels shared with spatial indexes. */
+export type QueryPoint = Readonly<ArrayLike<number>>;
+export type TriangleRayHit = {
+    t: number;
+    barycentric: [number, number, number];
+};
+export declare function validateQueryPoint(point: QueryPoint, dimension: number): void;
+export declare function validateQueryDistance(distance: number): void;
+/** Returns a unit direction; ray distances in indexes are always coordinate units. */
+export declare function normalizeQueryDirection(direction: QueryPoint, dimension: number): number[];
+/** Closed bounds; returns zero for an origin inside. t uses the supplied direction scale. */
+export declare function intersectRayBounds(origin: QueryPoint, direction: QueryPoint, minimum: QueryPoint, maximum: QueryPoint, maxT?: number): number | null;
+/** Two-sided Möller–Trumbore test; degenerates and coplanar rays have no hit. */
+export declare function intersectRayTriangle(origin: QueryPoint, direction: QueryPoint, a: QueryPoint, b: QueryPoint, c: QueryPoint, options?: {
+    backfaceCulling?: boolean;
+    maxT?: number;
+}): TriangleRayHit | null;
+/** Closest point on a filled triangle; degenerate triangles reduce to segments/points. */
+export declare function getClosestPointOnTriangle(point: QueryPoint, a: QueryPoint, b: QueryPoint, c: QueryPoint): [number, number, number];
+//# sourceMappingURL=queries.d.ts.map

package/dist/culling/queries.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queries.d.ts","sourceRoot":"","sources":["../../src/culling/queries.ts"],"names":[],"mappings":"AAIA,qEAAqE;AACrE,MAAM,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;AACrD,MAAM,MAAM,cAAc,GAAG;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;CAAC,CAAC;AAEhF,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAK7E;AAED,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAE5D;AAED,sFAAsF;AACtF,wBAAgB,uBAAuB,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAO1F;AAED,6FAA6F;AAC7F,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,UAAU,EACrB,OAAO,EAAE,UAAU,EACnB,OAAO,EAAE,UAAU,EACnB,IAAI,SAAW,GACd,MAAM,GAAG,IAAI,CA6Bf;AAED,iFAAiF;AACjF,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,UAAU,EACrB,CAAC,EAAE,UAAU,EACb,CAAC,EAAE,UAAU,EACb,CAAC,EAAE,UAAU,EACb,OAAO,GAAE;IAAC,eAAe,CAAC,EAAE,OAAO,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAM,GACvD,cAAc,GAAG,IAAI,CAqBvB;AAED,0FAA0F;AAC1F,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,UAAU,EACjB,CAAC,EAAE,UAAU,EACb,CAAC,EAAE,UAAU,EACb,CAAC,EAAE,UAAU,GACZ,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CA2C1B"}

package/dist/culling/queries.js

@@ -0,0 +1,139 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+export function validateQueryPoint(point, dimension) {
+    if (point.length !== dimension)
+        throw new RangeError('Query dimension must match the index');
+    for (let i = 0; i < dimension; i++) {
+        if (!Number.isFinite(point[i]))
+            throw new RangeError('Coordinates must be finite');
+    }
+}
+export function validateQueryDistance(distance) {
+    if (Number.isNaN(distance) || distance < 0)
+        throw new RangeError('Distance must be nonnegative');
+}
+/** Returns a unit direction; ray distances in indexes are always coordinate units. */
+export function normalizeQueryDirection(direction, dimension) {
+    validateQueryPoint(direction, dimension);
+    const scale = Math.max(...Array.from(direction, Math.abs));
+    if (scale === 0)
+        throw new RangeError('Ray direction must be nonzero');
+    const scaled = Array.from(direction, x => x / scale);
+    const length = Math.hypot(...scaled);
+    return scaled.map(x => x / length);
+}
+/** Closed bounds; returns zero for an origin inside. t uses the supplied direction scale. */
+export function intersectRayBounds(origin, direction, minimum, maximum, maxT = Infinity) {
+    const dimension = origin.length;
+    if (dimension !== 2 && dimension !== 3)
+        throw new RangeError('Bounds must be 2D or 3D');
+    validateQueryPoint(origin, dimension);
+    validateQueryPoint(direction, dimension);
+    validateQueryPoint(minimum, dimension);
+    validateQueryPoint(maximum, dimension);
+    validateQueryDistance(maxT);
+    let near = 0, far = maxT, nonzero = false;
+    for (let i = 0; i < dimension; i++) {
+        if (minimum[i] > maximum[i])
+            throw new RangeError('Bounds must be ordered');
+        nonzero || (nonzero = direction[i] !== 0);
+    }
+    if (!nonzero)
+        throw new RangeError('Ray direction must be nonzero');
+    for (let i = 0; i < dimension; i++) {
+        if (direction[i] === 0) {
+            if (origin[i] < minimum[i] || origin[i] > maximum[i])
+                return null;
+            continue;
+        }
+        let a = (minimum[i] - origin[i]) / direction[i];
+        let b = (maximum[i] - origin[i]) / direction[i];
+        if (a > b)
+            [a, b] = [b, a];
+        near = Math.max(near, a);
+        far = Math.min(far, b);
+        if (near > far)
+            return null;
+    }
+    return Number.isFinite(near) ? near : null;
+}
+/** Two-sided Möller–Trumbore test; degenerates and coplanar rays have no hit. */
+export function intersectRayTriangle(origin, direction, a, b, c, options = {}) {
+    for (const point of [origin, direction, a, b, c])
+        validateQueryPoint(point, 3);
+    if (direction[0] === 0 && direction[1] === 0 && direction[2] === 0) {
+        throw new RangeError('Ray direction must be nonzero');
+    }
+    const maxT = options.maxT ?? Infinity;
+    validateQueryDistance(maxT);
+    const e1 = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
+    const e2 = [c[0] - a[0], c[1] - a[1], c[2] - a[2]];
+    const p = cross(direction, e2);
+    const determinant = dot(e1, p);
+    if (determinant === 0 || (options.backfaceCulling && determinant < 0))
+        return null;
+    const offset = [origin[0] - a[0], origin[1] - a[1], origin[2] - a[2]];
+    const u = dot(offset, p) / determinant;
+    if (u < 0 || u > 1)
+        return null;
+    const q = cross(offset, e1);
+    const v = dot(direction, q) / determinant;
+    if (v < 0 || u + v > 1)
+        return null;
+    const t = dot(e2, q) / determinant;
+    if (!Number.isFinite(t) || t < 0 || t > maxT)
+        return null;
+    return { t: Math.max(0, t), barycentric: [1 - u - v, u, v] };
+}
+/** Closest point on a filled triangle; degenerate triangles reduce to segments/points. */
+export function getClosestPointOnTriangle(point, a, b, c) {
+    for (const value of [point, a, b, c])
+        validateQueryPoint(value, 3);
+    const ab = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
+    const ac = [c[0] - a[0], c[1] - a[1], c[2] - a[2]];
+    const ap = [point[0] - a[0], point[1] - a[1], point[2] - a[2]];
+    const aa = dot(ab, ab), bb = dot(ac, ac), cc = dot(ab, ac);
+    const denominator = aa * bb - cc * cc;
+    if (denominator > 0 && Number.isFinite(denominator)) {
+        const u = (bb * dot(ap, ab) - cc * dot(ap, ac)) / denominator;
+        const v = (aa * dot(ap, ac) - cc * dot(ap, ab)) / denominator;
+        if (u >= 0 && v >= 0 && u + v <= 1) {
+            return [
+                a[0] + u * ab[0] + v * ac[0],
+                a[1] + u * ab[1] + v * ac[1],
+                a[2] + u * ab[2] + v * ac[2]
+            ];
+        }
+    }
+    let best = [a[0], a[1], a[2]];
+    let distance = Infinity;
+    for (const [start, end] of [
+        [a, b],
+        [b, c],
+        [c, a]
+    ]) {
+        const edge = [end[0] - start[0], end[1] - start[1], end[2] - start[2]];
+        const offset = [point[0] - start[0], point[1] - start[1], point[2] - start[2]];
+        const squared = dot(edge, edge);
+        const t = squared > 0 ? Math.max(0, Math.min(1, dot(offset, edge) / squared)) : 0;
+        const candidate = [
+            start[0] + t * edge[0],
+            start[1] + t * edge[1],
+            start[2] + t * edge[2]
+        ];
+        const d = Math.hypot(point[0] - candidate[0], point[1] - candidate[1], point[2] - candidate[2]);
+        if (d < distance) {
+            distance = d;
+            best = candidate;
+        }
+    }
+    return best;
+}
+function dot(a, b) {
+    return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
+}
+function cross(a, b) {
+    return [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];
+}
+//# sourceMappingURL=queries.js.map

package/dist/culling/queries.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queries.js","sourceRoot":"","sources":["../../src/culling/queries.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAM5D,MAAM,UAAU,kBAAkB,CAAC,KAAiB,EAAE,SAAiB;IACrE,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS;QAAE,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;IAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,4BAA4B,CAAC,CAAC;IACrF,CAAC;AACH,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,QAAgB;IACpD,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;AACnG,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,uBAAuB,CAAC,SAAqB,EAAE,SAAiB;IAC9E,kBAAkB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3D,IAAI,KAAK,KAAK,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,CAAC;IACvE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC;IACrC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AACrC,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,kBAAkB,CAChC,MAAkB,EAClB,SAAqB,EACrB,OAAmB,EACnB,OAAmB,EACnB,IAAI,GAAG,QAAQ;IAEf,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;IAChC,IAAI,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,yBAAyB,CAAC,CAAC;IACxF,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACtC,kBAAkB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IACzC,kBAAkB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IACvC,kBAAkB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IACvC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC5B,IAAI,IAAI,GAAG,CAAC,EACV,GAAG,GAAG,IAAI,EACV,OAAO,GAAG,KAAK,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC,CAAC;QAC5E,OAAO,KAAP,OAAO,GAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EAAC;IACjC,CAAC;IACD,IAAI,CAAC,OAAO;QAAE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,CAAC;IACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YAClE,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,CAAC;YAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACzB,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,GAAG,GAAG;YAAE,OAAO,IAAI,CAAC;IAC9B,CAAC;IACD,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC7C,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,oBAAoB,CAClC,MAAkB,EAClB,SAAqB,EACrB,CAAa,EACb,CAAa,EACb,CAAa,EACb,UAAsD,EAAE;IAExD,KAAK,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAAE,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC/E,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,CAAC;IACxD,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC;IACtC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAC/B,MAAM,WAAW,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC/B,IAAI,WAAW,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,IAAI,WAAW,GAAG,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACnF,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC;IACvC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAC5B,MAAM,CAAC,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC;IAC1C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC;IACnC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI;QAAE,OAAO,IAAI,CAAC;IAC1D,OAAO,EAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAC,CAAC;AAC7D,CAAC;AAED,0FAA0F;AAC1F,MAAM,UAAU,yBAAyB,CACvC,KAAiB,EACjB,CAAa,EACb,CAAa,EACb,CAAa;IAEb,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAAE,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACnE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EACpB,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAChB,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACnB,MAAM,WAAW,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACtC,IAAI,WAAW,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACpD,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC;QAC9D,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC;QAC9D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,OAAO;gBACL,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC5B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC5B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;aAC7B,CAAC;QACJ,CAAC;IACH,CAAC;IACD,IAAI,IAAI,GAA6B,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,QAAQ,GAAG,QAAQ,CAAC;IACxB,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI;QACzB,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;KACP,EAAE,CAAC;QACF,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,SAAS,GAA6B;YAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;SACvB,CAAC;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC;YACjB,QAAQ,GAAG,CAAC,CAAC;YACb,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,GAAG,CAAC,CAAa,EAAE,CAAa;IACvC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC;AACD,SAAS,KAAK,CAAC,CAAa,EAAE,CAAa;IACzC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3F,CAAC"}

package/dist/curves/bezier-curves.d.ts

@@ -0,0 +1,18 @@
+import type { NumericArray } from '@math.gl/core/types';
+import { Curve, type CurvePoint } from "./curve.js";
+declare abstract class BezierCurve extends Curve {
+    private readonly points;
+    protected constructor(points: readonly CurvePoint[]);
+    protected evaluate(t: number, result: NumericArray, derivative: boolean): void;
+}
+export declare class LineCurve extends BezierCurve {
+    constructor(start: CurvePoint, end: CurvePoint);
+}
+export declare class QuadraticBezierCurve extends BezierCurve {
+    constructor(start: CurvePoint, control: CurvePoint, end: CurvePoint);
+}
+export declare class CubicBezierCurve extends BezierCurve {
+    constructor(start: CurvePoint, control1: CurvePoint, control2: CurvePoint, end: CurvePoint);
+}
+export {};
+//# sourceMappingURL=bezier-curves.d.ts.map

package/dist/curves/bezier-curves.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bezier-curves.d.ts","sourceRoot":"","sources":["../../src/curves/bezier-curves.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAC,KAAK,EAAc,KAAK,UAAU,EAAC,mBAAgB;AAE3D,uBAAe,WAAY,SAAQ,KAAK;IACtC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAa;IAEpC,SAAS,aAAa,MAAM,EAAE,SAAS,UAAU,EAAE;IAMnD,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,OAAO,GAAG,IAAI;CA2B/E;AAED,qBAAa,SAAU,SAAQ,WAAW;gBAC5B,KAAK,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU;CAG/C;AAED,qBAAa,oBAAqB,SAAQ,WAAW;gBACvC,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU;CAGpE;AAED,qBAAa,gBAAiB,SAAQ,WAAW;gBACnC,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU;CAG3F"}

package/dist/curves/bezier-curves.js

@@ -0,0 +1,54 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+import { Curve, copyPoints } from "./curve.js";
+class BezierCurve extends Curve {
+    constructor(points) {
+        const copied = copyPoints(points);
+        super(copied[0].length);
+        this.points = copied;
+    }
+    evaluate(t, result, derivative) {
+        const degree = this.points.length - 1;
+        // Scalar de Casteljau evaluation avoids temporary vectors and preserves endpoints.
+        for (let i = 0; i < this.dimension; i++) {
+            let a = this.points[0][i];
+            let b = this.points[1][i];
+            let c = degree >= 2 ? this.points[2][i] : 0;
+            const d = degree === 3 ? this.points[3][i] : 0;
+            let order = degree;
+            if (derivative) {
+                a = degree * (b - a);
+                b = degree * (c - b);
+                c = degree * (d - c);
+                order--;
+            }
+            if (order === 3) {
+                a = (1 - t) * a + t * b;
+                b = (1 - t) * b + t * c;
+                c = (1 - t) * c + t * d;
+            }
+            if (order >= 2) {
+                a = (1 - t) * a + t * b;
+                b = (1 - t) * b + t * c;
+            }
+            result[i] = order >= 1 ? (1 - t) * a + t * b : a;
+        }
+    }
+}
+export class LineCurve extends BezierCurve {
+    constructor(start, end) {
+        super([start, end]);
+    }
+}
+export class QuadraticBezierCurve extends BezierCurve {
+    constructor(start, control, end) {
+        super([start, control, end]);
+    }
+}
+export class CubicBezierCurve extends BezierCurve {
+    constructor(start, control1, control2, end) {
+        super([start, control1, control2, end]);
+    }
+}
+//# sourceMappingURL=bezier-curves.js.map

package/dist/curves/bezier-curves.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bezier-curves.js","sourceRoot":"","sources":["../../src/curves/bezier-curves.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAG5D,OAAO,EAAC,KAAK,EAAE,UAAU,EAAkB,mBAAgB;AAE3D,MAAe,WAAY,SAAQ,KAAK;IAGtC,YAAsB,MAA6B;QACjD,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAClC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAES,QAAQ,CAAC,CAAS,EAAE,MAAoB,EAAE,UAAmB;QACrE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,mFAAmF;QACnF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,IAAI,KAAK,GAAG,MAAM,CAAC;YACnB,IAAI,UAAU,EAAE,CAAC;gBACf,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,KAAK,EAAE,CAAC;YACV,CAAC;YACD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC;YACD,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;gBACf,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC1B,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;CACF;AAED,MAAM,OAAO,SAAU,SAAQ,WAAW;IACxC,YAAY,KAAiB,EAAE,GAAe;QAC5C,KAAK,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;CACF;AAED,MAAM,OAAO,oBAAqB,SAAQ,WAAW;IACnD,YAAY,KAAiB,EAAE,OAAmB,EAAE,GAAe;QACjE,KAAK,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/B,CAAC;CACF;AAED,MAAM,OAAO,gBAAiB,SAAQ,WAAW;IAC/C,YAAY,KAAiB,EAAE,QAAoB,EAAE,QAAoB,EAAE,GAAe;QACxF,KAAK,CAAC,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;CACF"}

package/dist/curves/catmull-rom-curve.d.ts

@@ -0,0 +1,15 @@
+import type { NumericArray } from '@math.gl/core/types';
+import { Curve, type CurvePoint } from "./curve.js";
+export type CatmullRomCurveOptions = {
+    closed?: boolean;
+    parameterization?: 'centripetal' | 'chordal' | 'uniform';
+    /** Uniform splines only. Default 0.5; zero gives stationary knot tangents. */
+    tension?: number;
+};
+export declare class CatmullRomCurve extends Curve {
+    readonly closed: boolean;
+    private readonly segments;
+    constructor(points: readonly CurvePoint[], options?: CatmullRomCurveOptions);
+    protected evaluate(t: number, result: NumericArray, derivative: boolean): void;
+}
+//# sourceMappingURL=catmull-rom-curve.d.ts.map

package/dist/curves/catmull-rom-curve.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"catmull-rom-curve.d.ts","sourceRoot":"","sources":["../../src/curves/catmull-rom-curve.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAC,KAAK,EAAc,KAAK,UAAU,EAAC,mBAAgB;AAG3D,MAAM,MAAM,sBAAsB,GAAG;IACnC,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,gBAAgB,CAAC,EAAE,aAAa,GAAG,SAAS,GAAG,SAAS,CAAC;IACzD,8EAA8E;IAC9E,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,qBAAa,eAAgB,SAAQ,KAAK;IACxC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAiB;gBAE9B,MAAM,EAAE,SAAS,UAAU,EAAE,EAAE,OAAO,GAAE,sBAA2B;IA0D/E,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,OAAO,GAAG,IAAI;CAW/E"}

package/dist/curves/catmull-rom-curve.js

@@ -0,0 +1,77 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+import { Curve, copyPoints } from "./curve.js";
+import { HermiteCurve } from "./hermite-curve.js";
+export class CatmullRomCurve extends Curve {
+    constructor(points, options = {}) {
+        const data = copyPoints(points);
+        super(data[0].length);
+        this.closed = options.closed ?? false;
+        if (data.length < (this.closed ? 3 : 2))
+            throw new RangeError('Not enough spline points');
+        const mode = options.parameterization ?? 'centripetal';
+        if (!['centripetal', 'chordal', 'uniform'].includes(mode)) {
+            throw new RangeError('Unknown Catmull-Rom parameterization');
+        }
+        const tension = options.tension ?? 0.5;
+        if (!Number.isFinite(tension) || tension < 0 || tension > 1) {
+            throw new RangeError('tension must be in [0, 1]');
+        }
+        if (options.tension !== undefined && mode !== 'uniform') {
+            throw new RangeError('tension is only supported for uniform splines');
+        }
+        const point = (index) => {
+            if (this.closed)
+                return data[(index + data.length) % data.length];
+            if (index < 0)
+                return data[0].map((x, i) => 2 * x - data[1][i]);
+            if (index >= data.length) {
+                return data[data.length - 1].map((x, i) => 2 * x - data[data.length - 2][i]);
+            }
+            return data[index];
+        };
+        this.segments = [];
+        for (let s = 0; s < data.length - (this.closed ? 0 : 1); s++) {
+            const p0 = point(s - 1);
+            const p1 = point(s);
+            const p2 = point(s + 1);
+            const p3 = point(s + 2);
+            const interval = (a, b) => {
+                const distance = Math.hypot(...a.map((x, i) => b[i] - x));
+                return distance ** (mode === 'chordal' ? 1 : 0.5);
+            };
+            const d1 = interval(p1, p2);
+            if (mode !== 'uniform' && d1 === 0) {
+                // A repeated knot is a stationary segment, rather than a spurious loop.
+                const zero = new Array(this.dimension).fill(0);
+                this.segments.push(new HermiteCurve(p1, p2, zero, zero));
+                continue;
+            }
+            // Reuse the current interval for coincident neighbors. This is scale invariant.
+            const d0 = interval(p0, p1) || d1;
+            const d2 = interval(p2, p3) || d1;
+            const m1 = p1.map((x, i) => mode === 'uniform'
+                ? tension * (p2[i] - p0[i])
+                : d1 * ((x - p0[i]) / d0 - (p2[i] - p0[i]) / (d0 + d1) + (p2[i] - x) / d1));
+            const m2 = p2.map((x, i) => mode === 'uniform'
+                ? tension * (p3[i] - p1[i])
+                : d1 * ((x - p1[i]) / d1 - (p3[i] - p1[i]) / (d1 + d2) + (p3[i] - x) / d2));
+            this.segments.push(new HermiteCurve(p1, p2, m1, m2));
+        }
+    }
+    evaluate(t, result, derivative) {
+        const scaled = t * this.segments.length;
+        const index = Math.min(Math.floor(scaled), this.segments.length - 1);
+        const local = scaled - index;
+        if (derivative) {
+            this.segments[index].getDerivative(local, result);
+            for (let i = 0; i < this.dimension; i++)
+                result[i] *= this.segments.length;
+        }
+        else {
+            this.segments[index].getPoint(local, result);
+        }
+    }
+}
+//# sourceMappingURL=catmull-rom-curve.js.map

package/dist/curves/catmull-rom-curve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"catmull-rom-curve.js","sourceRoot":"","sources":["../../src/curves/catmull-rom-curve.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAG5D,OAAO,EAAC,KAAK,EAAE,UAAU,EAAkB,mBAAgB;AAC3D,OAAO,EAAC,YAAY,EAAC,2BAAwB;AAS7C,MAAM,OAAO,eAAgB,SAAQ,KAAK;IAIxC,YAAY,MAA6B,EAAE,UAAkC,EAAE;QAC7E,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAChC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC;QACtC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,CAAC;QAC1F,MAAM,IAAI,GAAG,OAAO,CAAC,gBAAgB,IAAI,aAAa,CAAC;QACvD,IAAI,CAAC,CAAC,aAAa,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1D,MAAM,IAAI,UAAU,CAAC,sCAAsC,CAAC,CAAC;QAC/D,CAAC;QACD,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,GAAG,CAAC;QACvC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YAC5D,MAAM,IAAI,UAAU,CAAC,2BAA2B,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxD,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,CAAC;QACxE,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,KAAa,EAAY,EAAE;YACxC,IAAI,IAAI,CAAC,MAAM;gBAAE,OAAO,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YAClE,IAAI,KAAK,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChE,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBACzB,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/E,CAAC;YACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7D,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxB,MAAM,QAAQ,GAAG,CAAC,CAAW,EAAE,CAAW,EAAU,EAAE;gBACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC1D,OAAO,QAAQ,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACpD,CAAC,CAAC;YACF,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5B,IAAI,IAAI,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBACnC,wEAAwE;gBACxE,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACvD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACzD,SAAS;YACX,CAAC;YACD,gFAAgF;YAChF,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACzB,IAAI,KAAK,SAAS;gBAChB,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAC7E,CAAC;YACF,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACzB,IAAI,KAAK,SAAS;gBAChB,CAAC,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAC7E,CAAC;YACF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IAES,QAAQ,CAAC,CAAS,EAAE,MAAoB,EAAE,UAAmB;QACrE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrE,MAAM,KAAK,GAAG,MAAM,GAAG,KAAK,CAAC;QAC7B,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE;gBAAE,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC7E,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;CACF"}

package/dist/curves/curve-arc-length.d.ts

@@ -0,0 +1,17 @@
+import type { NumericArray } from '@math.gl/core/types';
+import { Curve } from "./curve.js";
+/** Reusable polyline approximation to a curve's cumulative arc length. */
+export declare class CurveArcLength {
+    readonly curve: Curve;
+    readonly divisions: number;
+    readonly length: number;
+    private readonly cumulativeLengths;
+    constructor(curve: Curve, divisions?: number);
+    /** Map a fraction of total length to t, preserving endpoints and zero-length curves. */
+    getParameterAt(u: number): number;
+    getPointAt(u: number): number[];
+    getPointAt<T extends NumericArray>(u: number, result: T): T;
+    /** Flat samples at approximately equal distances along the curve. */
+    getSpacedPoints(divisions?: number): Float64Array;
+}
+//# sourceMappingURL=curve-arc-length.d.ts.map

package/dist/curves/curve-arc-length.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"curve-arc-length.d.ts","sourceRoot":"","sources":["../../src/curves/curve-arc-length.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAC,KAAK,EAAuC,mBAAgB;AAEpE,0EAA0E;AAC1E,qBAAa,cAAc;IACzB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAe;gBAErC,KAAK,EAAE,KAAK,EAAE,SAAS,SAAO;IAsB1C,wFAAwF;IACxF,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAejC,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE;IAC/B,UAAU,CAAC,CAAC,SAAS,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC;IAK3D,qEAAqE;IACrE,eAAe,CAAC,SAAS,SAAK,GAAG,YAAY;CAU9C"}

package/dist/curves/curve-arc-length.js

@@ -0,0 +1,58 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+import { validateDivisions, validateParameter } from "./curve.js";
+/** Reusable polyline approximation to a curve's cumulative arc length. */
+export class CurveArcLength {
+    constructor(curve, divisions = 1024) {
+        validateDivisions(divisions);
+        this.curve = curve;
+        this.divisions = divisions;
+        this.cumulativeLengths = new Float64Array(divisions + 1);
+        let previous = curve.getPoint(0);
+        let current = new Array(curve.dimension);
+        let length = 0;
+        for (let i = 1; i <= divisions; i++) {
+            curve.getPoint(i / divisions, current);
+            length += Math.hypot(current[0] - previous[0], current[1] - previous[1], curve.dimension === 3 ? current[2] - previous[2] : 0);
+            if (!Number.isFinite(length))
+                throw new RangeError('Curve arc length must be finite');
+            this.cumulativeLengths[i] = length;
+            [previous, current] = [current, previous];
+        }
+        this.length = length;
+    }
+    /** Map a fraction of total length to t, preserving endpoints and zero-length curves. */
+    getParameterAt(u) {
+        validateParameter(u);
+        if (u === 0 || u === 1 || this.length === 0)
+            return u;
+        const target = u * this.length;
+        let low = 0;
+        let high = this.divisions;
+        while (low + 1 < high) {
+            const middle = Math.floor((low + high) / 2);
+            if (this.cumulativeLengths[middle] <= target)
+                low = middle;
+            else
+                high = middle;
+        }
+        const span = this.cumulativeLengths[high] - this.cumulativeLengths[low];
+        return (low + (span > 0 ? (target - this.cumulativeLengths[low]) / span : 0)) / this.divisions;
+    }
+    getPointAt(u, result = new Array(this.curve.dimension)) {
+        return this.curve.getPoint(this.getParameterAt(u), result);
+    }
+    /** Flat samples at approximately equal distances along the curve. */
+    getSpacedPoints(divisions = 64) {
+        validateDivisions(divisions);
+        const points = new Float64Array((divisions + 1) * this.curve.dimension);
+        const point = new Array(this.curve.dimension);
+        for (let i = 0; i <= divisions; i++) {
+            this.getPointAt(i / divisions, point);
+            points.set(point, i * this.curve.dimension);
+        }
+        return points;
+    }
+}
+//# sourceMappingURL=curve-arc-length.js.map

package/dist/curves/curve-arc-length.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"curve-arc-length.js","sourceRoot":"","sources":["../../src/curves/curve-arc-length.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAG5D,OAAO,EAAQ,iBAAiB,EAAE,iBAAiB,EAAC,mBAAgB;AAEpE,0EAA0E;AAC1E,MAAM,OAAO,cAAc;IAMzB,YAAY,KAAY,EAAE,SAAS,GAAG,IAAI;QACxC,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,iBAAiB,GAAG,IAAI,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,OAAO,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,SAAS,CAAC,CAAC;QACjD,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,KAAK,CAAC,QAAQ,CAAC,CAAC,GAAG,SAAS,EAAE,OAAO,CAAC,CAAC;YACvC,MAAM,IAAI,IAAI,CAAC,KAAK,CAClB,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,EACxB,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,EACxB,KAAK,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACrD,CAAC;YACF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAAE,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,CAAC;YACtF,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YACnC,CAAC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,wFAAwF;IACxF,cAAc,CAAC,CAAS;QACtB,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAC/B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAC1B,OAAO,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;YACtB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,MAAM;gBAAE,GAAG,GAAG,MAAM,CAAC;;gBACtD,IAAI,GAAG,MAAM,CAAC;QACrB,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACxE,OAAO,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;IACjG,CAAC;IAID,UAAU,CAAC,CAAS,EAAE,SAAuB,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;QAC1E,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC;IAED,qEAAqE;IACrE,eAAe,CAAC,SAAS,GAAG,EAAE;QAC5B,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACxE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,CAAC;YACtC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}