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

package/dist/polygon/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/polygon/index.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAE5D,OAAO,EAAC,OAAO,EAAC,qBAAkB;AAElC,OAAO,EACL,oBAAoB,EACpB,0BAA0B,EAC1B,uBAAuB,EACvB,6BAA6B,EAC9B,2BAAwB;AAGzB,OAAO,EAAC,MAAM,EAAC,oBAAiB;AAEhC,OAAO,EAAC,WAAW,EAAE,YAAY,EAAC,sBAAmB;AAErD,OAAO,EAAC,gBAAgB,EAAE,iBAAiB,EAAC,yBAAsB;AAElE,OAAO,EAAC,2BAA2B,EAAE,0BAA0B,EAAC,oCAAiC;AAEjG,OAAO,EAAC,iBAAiB,EAAC,gCAA6B;AAGvD,OAAO,EAAC,qBAAqB,EAAC,qCAAkC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/polygon/index.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAE5D,OAAO,EAAC,OAAO,EAAC,qBAAkB;AAElC,OAAO,EACL,oBAAoB,EACpB,0BAA0B,EAC1B,uBAAuB,EACvB,6BAA6B,EAC9B,2BAAwB;AAGzB,OAAO,EAAC,MAAM,EAAC,oBAAiB;AAEhC,OAAO,EAAC,WAAW,EAAE,YAAY,EAAC,sBAAmB;AAErD,OAAO,EAAC,gBAAgB,EAAE,iBAAiB,EAAC,yBAAsB;AAElE,OAAO,EAAC,2BAA2B,EAAE,0BAA0B,EAAC,oCAAiC;AAEjG,OAAO,EAAC,iBAAiB,EAAC,gCAA6B;AAOvD,OAAO,EAAC,qBAAqB,EAAC,qCAAkC"}

package/dist/polygon/subdivide-polyline.d.ts

@@ -1,4 +1,11 @@
-/** Configuration for sampling straight source edges through a nonlinear transform. */
+/** A constant-speed source edge, sampled at fractions of its declared length.
+ * Endpoints must match the factory inputs exactly. Samples are copied before use.
+ */
+export type PolylineEdgeSampler = {
+    readonly length: number;
+    sample: (fraction: number) => ArrayLike<number>;
+};
+/** Configuration for sampling source edges through a nonlinear transform. */
 export type SubdividePolylineOptions = {
     /** Maps a source position to target coordinates; null or nonfinite output rejects the geometry.
      * Must be deterministic. A fresh array is passed on every invocation.
@@ -6,11 +13,17 @@ export type SubdividePolylineOptions = {
     transform: (position: readonly number[]) => ArrayLike<number> | null;
     /** Positive error tolerance in target-coordinate units, measured across all output components. */
     tolerance: number;
+    /** Optional factory, called once per original edge with independent endpoint copies.
+     * Without it, source coordinates interpolate linearly. Must be deterministic.
+     */
+    createEdgeSampler?: (start: readonly number[], end: readonly number[], segmentIndex: number) => PolylineEdgeSampler;
     /** Number of source components per vertex. Default 2. */
     size?: 2 | 3;
     /** Number of target components per vertex. Defaults to size. */
     targetSize?: 2 | 3;
-    /** Optional positive maximum Euclidean edge length in source-coordinate units. */
+    /** Positive maximum leaf length: Euclidean source distance by default, or the
+     * custom sampler's declared length multiplied by its fraction interval.
+     */
     maxSegmentLength?: number;
     /** Maximum bisection depth per input edge. Default 16; maximum 30. */
     maxDepth?: number;
@@ -33,7 +46,8 @@ export type SubdividedPolyline = {
 /** Adaptively subdivides a flat polyline by sampling a supplied coordinate transform.
  * Each leaf edge checks its quarter, midpoint and three-quarter positions against linear
  * interpolation of its target endpoints. This is a sampled criterion, not a guaranteed
- * bound for arbitrary transforms. Source edges and extra source components interpolate linearly.
+ * bound for arbitrary transforms. Source components interpolate linearly unless a custom
+ * constant-speed source-edge sampler is supplied.
  * Explicitly closed rings stay closed. Split seams and clip invalid domains before calling.
  * @throws RangeError For invalid options/coordinates, rejected transform samples, or exhausted limits.
  * Exceptions thrown by the transform itself propagate unchanged.

package/dist/polygon/subdivide-polyline.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"subdivide-polyline.d.ts","sourceRoot":"","sources":["../../src/polygon/subdivide-polyline.ts"],"names":[],"mappings":"AAIA,sFAAsF;AACtF,MAAM,MAAM,wBAAwB,GAAG;IACrC;;OAEG;IACH,SAAS,EAAE,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,KAAK,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IACrE,kGAAkG;IAClG,SAAS,EAAE,MAAM,CAAC;IAClB,yDAAyD;IACzD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACb,gEAAgE;IAChE,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACnB,kFAAkF;IAClF,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,sEAAsE;IACtE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,0EAA0E;IAC1E,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB,CAAC;AAEF,8FAA8F;AAC9F,MAAM,MAAM,kBAAkB,GAAG;IAC/B,2FAA2F;IAC3F,eAAe,EAAE,YAAY,CAAC;IAC9B,mEAAmE;IACnE,SAAS,EAAE,YAAY,CAAC;IACxB;;OAEG;IACH,cAAc,EAAE,WAAW,CAAC;IAC5B,0FAA0F;IAC1F,gBAAgB,EAAE,YAAY,CAAC;CAChC,CAAC;AAIF;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,EACxB,OAAO,EAAE,wBAAwB,GAChC,kBAAkB,CA4GpB"}
+{"version":3,"file":"subdivide-polyline.d.ts","sourceRoot":"","sources":["../../src/polygon/subdivide-polyline.ts"],"names":[],"mappings":"AAIA;;GAEG;AACH,MAAM,MAAM,mBAAmB,GAAG;IAChC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,SAAS,CAAC,MAAM,CAAC,CAAC;CACjD,CAAC;AAEF,6EAA6E;AAC7E,MAAM,MAAM,wBAAwB,GAAG;IACrC;;OAEG;IACH,SAAS,EAAE,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,KAAK,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IACrE,kGAAkG;IAClG,SAAS,EAAE,MAAM,CAAC;IAClB;;OAEG;IACH,iBAAiB,CAAC,EAAE,CAClB,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,GAAG,EAAE,SAAS,MAAM,EAAE,EACtB,YAAY,EAAE,MAAM,KACjB,mBAAmB,CAAC;IACzB,yDAAyD;IACzD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACb,gEAAgE;IAChE,UAAU,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACnB;;OAEG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,sEAAsE;IACtE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,0EAA0E;IAC1E,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB,CAAC;AAEF,8FAA8F;AAC9F,MAAM,MAAM,kBAAkB,GAAG;IAC/B,2FAA2F;IAC3F,eAAe,EAAE,YAAY,CAAC;IAC9B,mEAAmE;IACnE,SAAS,EAAE,YAAY,CAAC;IACxB;;OAEG;IACH,cAAc,EAAE,WAAW,CAAC;IAC5B,0FAA0F;IAC1F,gBAAgB,EAAE,YAAY,CAAC;CAChC,CAAC;AAIF;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,EACxB,OAAO,EAAE,wBAAwB,GAChC,kBAAkB,CAwJpB"}

package/dist/polygon/subdivide-polyline.js

@@ -4,14 +4,16 @@
 /** Adaptively subdivides a flat polyline by sampling a supplied coordinate transform.
  * Each leaf edge checks its quarter, midpoint and three-quarter positions against linear
  * interpolation of its target endpoints. This is a sampled criterion, not a guaranteed
- * bound for arbitrary transforms. Source edges and extra source components interpolate linearly.
+ * bound for arbitrary transforms. Source components interpolate linearly unless a custom
+ * constant-speed source-edge sampler is supplied.
  * Explicitly closed rings stay closed. Split seams and clip invalid domains before calling.
  * @throws RangeError For invalid options/coordinates, rejected transform samples, or exhausted limits.
  * Exceptions thrown by the transform itself propagate unchanged.
  */
 export function subdividePolyline(input, options) {
-    const { transform, tolerance, size = 2, targetSize = size, maxSegmentLength = Infinity, maxDepth = 16, maxVertices = 65536 } = options;
+    const { transform, tolerance, createEdgeSampler, size = 2, targetSize = size, maxSegmentLength = Infinity, maxDepth = 16, maxVertices = 65536 } = options;
     if (typeof transform !== 'function' ||
+        (createEdgeSampler !== undefined && typeof createEdgeSampler !== 'function') ||
         !Number.isFinite(tolerance) ||
         tolerance <= 0 ||
         (size !== 2 && size !== 3) ||
@@ -64,22 +66,36 @@ export function subdividePolyline(input, options) {
         segmentIndices.push(segment);
         segmentFractions.push(point.fraction);
     }
-    function interpolate(a, b, fraction) {
-        // Weighted sum avoids overflow from subtracting opposite large finite values.
-        const source = a.source.map((value, i) => value * (1 - fraction) + b.source[i] * fraction);
-        return sample(source, a.fraction * (1 - fraction) + b.fraction * fraction);
+    function sampledSource(sampler, fraction) {
+        const value = sampler.sample(fraction);
+        if (!value || value.length !== size)
+            throw new RangeError('Invalid source-edge sample size');
+        const source = Array.from(value);
+        if (!source.every(Number.isFinite))
+            throw new RangeError('Nonfinite source-edge sample');
+        return source;
     }
-    function subdivide(a, b, segment, depth) {
+    function interpolate(a, b, fraction, sampler) {
+        const originalFraction = a.fraction * (1 - fraction) + b.fraction * fraction;
+        // Always sample the original edge, never a new curve fitted to recursive endpoints.
+        const source = sampler
+            ? sampledSource(sampler, originalFraction)
+            : a.source.map((value, i) => value * (1 - fraction) + b.source[i] * fraction);
+        return sample(source, originalFraction);
+    }
+    function subdivide(a, b, segment, depth, sampler) {
         let error = 0;
         let midpoint;
         for (const fraction of [0.25, 0.5, 0.75]) {
-            const point = interpolate(a, b, fraction);
+            const point = interpolate(a, b, fraction, sampler);
             if (fraction === 0.5)
                 midpoint = point;
             const delta = point.target.map((value, i) => value - (a.target[i] * (1 - fraction) + b.target[i] * fraction));
             error = Math.max(error, Math.hypot(...delta));
         }
-        const sourceLength = Math.hypot(...a.source.map((value, i) => value - b.source[i]));
+        const sourceLength = sampler
+            ? sampler.length * (b.fraction - a.fraction)
+            : Math.hypot(...a.source.map((value, i) => value - b.source[i]));
         if (error <= tolerance && sourceLength <= maxSegmentLength) {
             append(b, segment);
             return;
@@ -87,15 +103,31 @@ export function subdividePolyline(input, options) {
         if (depth >= maxDepth) {
             throw new RangeError(`Polyline subdivision exceeded maxDepth on input edge ${segment}`);
         }
-        subdivide(a, midpoint, segment, depth + 1);
-        subdivide(midpoint, b, segment, depth + 1);
+        subdivide(a, midpoint, segment, depth + 1, sampler);
+        subdivide(midpoint, b, segment, depth + 1, sampler);
     }
     if (vertexCount) {
         let previous = sample(sources.slice(0, size), 0);
         append(previous, 0);
         for (let i = 1; i < vertexCount; i++) {
             const next = sample(sources.slice(i * size, (i + 1) * size), 1);
-            subdivide({ ...previous, fraction: 0 }, next, i - 1, 0);
+            const start = { ...previous, fraction: 0 };
+            const sampler = createEdgeSampler?.(start.source.slice(), next.source.slice(), i - 1);
+            if (createEdgeSampler) {
+                if (!sampler ||
+                    typeof sampler.sample !== 'function' ||
+                    !Number.isFinite(sampler.length) ||
+                    sampler.length < 0) {
+                    throw new RangeError('Invalid source-edge sampler');
+                }
+                for (const endpoint of [start, next]) {
+                    const sampled = sampledSource(sampler, endpoint.fraction);
+                    if (sampled.some((value, component) => value !== endpoint.source[component])) {
+                        throw new RangeError('Source-edge sampler endpoints must match input');
+                    }
+                }
+            }
+            subdivide(start, next, i - 1, 0, sampler);
             previous = next;
         }
     }

package/dist/polygon/subdivide-polyline.js.map

@@ -1 +1 @@
-{"version":3,"file":"subdivide-polyline.js","sourceRoot":"","sources":["../../src/polygon/subdivide-polyline.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAsC5D;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAwB,EACxB,OAAiC;IAEjC,MAAM,EACJ,SAAS,EACT,SAAS,EACT,IAAI,GAAG,CAAC,EACR,UAAU,GAAG,IAAI,EACjB,gBAAgB,GAAG,QAAQ,EAC3B,QAAQ,GAAG,EAAE,EACb,WAAW,GAAG,KAAK,EACpB,GAAG,OAAO,CAAC;IACZ,IACE,OAAO,SAAS,KAAK,UAAU;QAC/B,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC;QAC3B,SAAS,IAAI,CAAC;QACd,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC;QAC1B,CAAC,UAAU,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC,CAAC;QACtC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC;QACvB,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,gBAAgB,KAAK,QAAQ,CAAC;QACrE,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC;QAC3B,QAAQ,GAAG,CAAC;QACZ,QAAQ,GAAG,EAAE;QACb,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC;QAClC,WAAW,GAAG,CAAC;QACf,WAAW,GAAG,UAAU;QACxB,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC;QACnC,KAAK,CAAC,MAAM,GAAG,CAAC;QAChB,KAAK,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,EACzB,CAAC;QACD,MAAM,IAAI,UAAU,CAAC,sDAAsD,CAAC,CAAC;IAC/E,CAAC;IACD,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;IACxC,IAAI,WAAW,GAAG,WAAW;QAAE,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;IACpF,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,CAAC;QACrF,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,gBAAgB,GAAa,EAAE,CAAC;IAEtC,SAAS,MAAM,CAAC,MAAgB,EAAE,QAAgB;QAChD,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAClD,MAAM,IAAI,UAAU,CAAC,6DAA6D,CAAC,CAAC;QACtF,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;YAChC,MAAM,IAAI,UAAU,CAAC,0CAA0C,CAAC,CAAC;QACnE,OAAO,EAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAC,CAAC;IACpC,CAAC;IAED,SAAS,MAAM,CAAC,KAAa,EAAE,OAAe;QAC5C,IAAI,cAAc,CAAC,MAAM,IAAI,WAAW,EAAE,CAAC;YACzC,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,CAAC;QACpE,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM;YAAE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM;YAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7B,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,QAAgB;QACzD,8EAA8E;QAC9E,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC3F,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;IAC7E,CAAC;IAED,SAAS,SAAS,CAAC,CAAS,EAAE,CAAS,EAAE,OAAe,EAAE,KAAa;QACrE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,QAAgB,CAAC;QACrB,KAAK,MAAM,QAAQ,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC1C,IAAI,QAAQ,KAAK,GAAG;gBAAE,QAAQ,GAAG,KAAK,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAC5B,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAC9E,CAAC;YACF,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,IAAI,KAAK,IAAI,SAAS,IAAI,YAAY,IAAI,gBAAgB,EAAE,CAAC;YAC3D,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACnB,OAAO;QACT,CAAC;QACD,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;YACtB,MAAM,IAAI,UAAU,CAAC,wDAAwD,OAAO,EAAE,CAAC,CAAC;QAC1F,CAAC;QACD,SAAS,CAAC,CAAC,EAAE,QAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC5C,SAAS,CAAC,QAAS,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,WAAW,EAAE,CAAC;QAChB,IAAI,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAChE,SAAS,CAAC,EAAC,GAAG,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACtD,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO;QACL,eAAe,EAAE,IAAI,YAAY,CAAC,eAAe,CAAC;QAClD,SAAS,EAAE,IAAI,YAAY,CAAC,SAAS,CAAC;QACtC,cAAc,EAAE,IAAI,WAAW,CAAC,cAAc,CAAC;QAC/C,gBAAgB,EAAE,IAAI,YAAY,CAAC,gBAAgB,CAAC;KACrD,CAAC;AACJ,CAAC"}
+{"version":3,"file":"subdivide-polyline.js","sourceRoot":"","sources":["../../src/polygon/subdivide-polyline.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAwD5D;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAwB,EACxB,OAAiC;IAEjC,MAAM,EACJ,SAAS,EACT,SAAS,EACT,iBAAiB,EACjB,IAAI,GAAG,CAAC,EACR,UAAU,GAAG,IAAI,EACjB,gBAAgB,GAAG,QAAQ,EAC3B,QAAQ,GAAG,EAAE,EACb,WAAW,GAAG,KAAK,EACpB,GAAG,OAAO,CAAC;IACZ,IACE,OAAO,SAAS,KAAK,UAAU;QAC/B,CAAC,iBAAiB,KAAK,SAAS,IAAI,OAAO,iBAAiB,KAAK,UAAU,CAAC;QAC5E,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC;QAC3B,SAAS,IAAI,CAAC;QACd,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC;QAC1B,CAAC,UAAU,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC,CAAC;QACtC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC;QACvB,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,gBAAgB,KAAK,QAAQ,CAAC;QACrE,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC;QAC3B,QAAQ,GAAG,CAAC;QACZ,QAAQ,GAAG,EAAE;QACb,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC;QAClC,WAAW,GAAG,CAAC;QACf,WAAW,GAAG,UAAU;QACxB,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC;QACnC,KAAK,CAAC,MAAM,GAAG,CAAC;QAChB,KAAK,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,EACzB,CAAC;QACD,MAAM,IAAI,UAAU,CAAC,sDAAsD,CAAC,CAAC;IAC/E,CAAC;IACD,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;IACxC,IAAI,WAAW,GAAG,WAAW;QAAE,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;IACpF,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,CAAC;QACrF,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,gBAAgB,GAAa,EAAE,CAAC;IAEtC,SAAS,MAAM,CAAC,MAAgB,EAAE,QAAgB;QAChD,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YAClD,MAAM,IAAI,UAAU,CAAC,6DAA6D,CAAC,CAAC;QACtF,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;YAChC,MAAM,IAAI,UAAU,CAAC,0CAA0C,CAAC,CAAC;QACnE,OAAO,EAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAC,CAAC;IACpC,CAAC;IAED,SAAS,MAAM,CAAC,KAAa,EAAE,OAAe;QAC5C,IAAI,cAAc,CAAC,MAAM,IAAI,WAAW,EAAE,CAAC;YACzC,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,CAAC;QACpE,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM;YAAE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM;YAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7B,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,SAAS,aAAa,CAAC,OAA4B,EAAE,QAAgB;QACnE,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI;YAAE,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,CAAC;QAC7F,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;QACzF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS,WAAW,CAClB,CAAS,EACT,CAAS,EACT,QAAgB,EAChB,OAA6B;QAE7B,MAAM,gBAAgB,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAC7E,oFAAoF;QACpF,MAAM,MAAM,GAAG,OAAO;YACpB,CAAC,CAAC,aAAa,CAAC,OAAO,EAAE,gBAAgB,CAAC;YAC1C,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;QAChF,OAAO,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAC1C,CAAC;IAED,SAAS,SAAS,CAChB,CAAS,EACT,CAAS,EACT,OAAe,EACf,KAAa,EACb,OAA6B;QAE7B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,QAAgB,CAAC;QACrB,KAAK,MAAM,QAAQ,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YACnD,IAAI,QAAQ,KAAK,GAAG;gBAAE,QAAQ,GAAG,KAAK,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAC5B,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAC9E,CAAC;YACF,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,MAAM,YAAY,GAAG,OAAO;YAC1B,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;YAC5C,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,KAAK,IAAI,SAAS,IAAI,YAAY,IAAI,gBAAgB,EAAE,CAAC;YAC3D,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACnB,OAAO;QACT,CAAC;QACD,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;YACtB,MAAM,IAAI,UAAU,CAAC,wDAAwD,OAAO,EAAE,CAAC,CAAC;QAC1F,CAAC;QACD,SAAS,CAAC,CAAC,EAAE,QAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;QACrD,SAAS,CAAC,QAAS,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,WAAW,EAAE,CAAC;QAChB,IAAI,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAChE,MAAM,KAAK,GAAG,EAAC,GAAG,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAC,CAAC;YACzC,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACtF,IAAI,iBAAiB,EAAE,CAAC;gBACtB,IACE,CAAC,OAAO;oBACR,OAAO,OAAO,CAAC,MAAM,KAAK,UAAU;oBACpC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC;oBAChC,OAAO,CAAC,MAAM,GAAG,CAAC,EAClB,CAAC;oBACD,MAAM,IAAI,UAAU,CAAC,6BAA6B,CAAC,CAAC;gBACtD,CAAC;gBACD,KAAK,MAAM,QAAQ,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;oBACrC,MAAM,OAAO,GAAG,aAAa,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;oBAC1D,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC,KAAK,KAAK,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;wBAC7E,MAAM,IAAI,UAAU,CAAC,gDAAgD,CAAC,CAAC;oBACzE,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YAC1C,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;IACH,CAAC;IACD,OAAO;QACL,eAAe,EAAE,IAAI,YAAY,CAAC,eAAe,CAAC;QAClD,SAAS,EAAE,IAAI,YAAY,CAAC,SAAS,CAAC;QACtC,cAAc,EAAE,IAAI,WAAW,CAAC,cAAc,CAAC;QAC/C,gBAAgB,EAAE,IAAI,YAAY,CAAC,gBAAgB,CAAC;KACrD,CAAC;AACJ,CAAC"}

package/package.json

@@ -6,7 +6,7 @@
   "publishConfig": {
     "access": "public"
   },
-  "version": "5.0.0-alpha.19",
+  "version": "5.0.0-alpha.20",
   "keywords": [
     "geometry",
     "gltf",
@@ -81,11 +81,13 @@
   },
   "files": [
     "dist",
-    "src"
+    "src",
+    "LICENSE",
+    "THIRD-PARTY-NOTICES.md"
   ],
   "dependencies": {
-    "@math.gl/core": "5.0.0-alpha.19"
+    "@math.gl/core": "5.0.0-alpha.20"
   },
   "sideEffects": false,
-  "gitHead": "f5700027934faf25c37230905c7ffa14d7f677a7"
+  "gitHead": "ad8c205a98e5e057d9055300b1a71f422b275c73"
 }

package/src/culling/index.ts

@@ -38,3 +38,8 @@ export type {QueryPoint, TriangleRayHit} from './queries';
 
 export {intersectOrientedBoxes2D} from './oriented-box-2d';
 export type {OrientedBox2D} from './oriented-box-2d';
+
+export {
+  getOrientedBoundingBoxQuaternion,
+  makeOrientedBoundingBoxFromQuaternion
+} from './lib/algorithms/oriented-bounding-box-quaternion';

package/src/culling/lib/algorithms/bounding-box-from-points.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 import {Vector3, Matrix3} from '@math.gl/core';
 import {computeEigenDecomposition} from './compute-eigen-decomposition';

package/src/culling/lib/algorithms/bounding-sphere-from-points.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 import {Vector3} from '@math.gl/core';
 import {BoundingSphere} from '../bounding-volumes/bounding-sphere';

package/src/culling/lib/algorithms/compute-eigen-decomposition.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 import {Matrix3, _MathUtils} from '@math.gl/core';
 

package/src/culling/lib/algorithms/oriented-bounding-box-quaternion.ts

@@ -0,0 +1,32 @@
+// math.gl
+// SPDX-License-Identifier: MIT AND Apache-2.0
+// SPDX-FileCopyrightText: Copyright 2011-2018 CesiumJS Contributors
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+// SPDX-FileComment: Extracted Cesium-derived OBB quaternion operations; see ../../../../LICENSE for attribution.
+
+import {Matrix3, Quaternion, Vector3} from '@math.gl/core';
+import {OrientedBoundingBox} from '../bounding-volumes/oriented-bounding-box';
+
+/** Return the orientation of a box, excluding the scale of its half axes. */
+export function getOrientedBoundingBoxQuaternion(box: OrientedBoundingBox): Quaternion {
+  const x = new Vector3(box.halfAxes.getColumn(0)).normalize();
+  const y = new Vector3(box.halfAxes.getColumn(1)).normalize();
+  const z = new Vector3(box.halfAxes.getColumn(2)).normalize();
+  return new Quaternion().fromMatrix3(new Matrix3([...x, ...y, ...z]));
+}
+
+/** Construct a box from its center, half sizes and quaternion, optionally reusing a box. */
+export function makeOrientedBoundingBoxFromQuaternion(
+  center: readonly number[],
+  halfSize: readonly number[],
+  quaternion: readonly number[],
+  result = new OrientedBoundingBox()
+): OrientedBoundingBox {
+  const halfAxes = new Matrix3().fromQuaternion(quaternion);
+  for (let column = 0; column < 3; column++) {
+    for (let row = 0; row < 3; row++) halfAxes[column * 3 + row] *= halfSize[column];
+  }
+  result.center = new Vector3(center);
+  result.halfAxes = halfAxes;
+  return result;
+}

package/src/culling/lib/bounding-volumes/bounding-sphere.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 import {NumericArray, Vector3} from '@math.gl/core';
 import * as mat4 from '@math.gl/core/mat4';

package/src/culling/lib/bounding-volumes/oriented-bounding-box.ts

@@ -5,10 +5,10 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 import {NumericArray} from '@math.gl/core/types';
-import {Vector3, Matrix3, Matrix4, Quaternion} from '@math.gl/core';
+import {Vector3, Matrix3, Matrix4} from '@math.gl/core';
 
 import type {BoundingVolume} from './bounding-volume';
 import {BoundingSphere} from './bounding-sphere';
@@ -66,41 +66,6 @@ export class OrientedBoundingBox implements BoundingVolume {
     return [new Vector3(xAxis).len(), new Vector3(yAxis).len(), new Vector3(zAxis).len()];
   }
 
-  /** Returns a quaternion describing the orientation of the bounding box */
-  get quaternion(): Quaternion {
-    const xAxis = this.halfAxes.getColumn(0);
-    const yAxis = this.halfAxes.getColumn(1);
-    const zAxis = this.halfAxes.getColumn(2);
-    const normXAxis = new Vector3(xAxis).normalize();
-    const normYAxis = new Vector3(yAxis).normalize();
-    const normZAxis = new Vector3(zAxis).normalize();
-    return new Quaternion().fromMatrix3(new Matrix3([...normXAxis, ...normYAxis, ...normZAxis]));
-  }
-
-  /**
-   * Create OrientedBoundingBox from quaternion based OBB,
-   */
-  fromCenterHalfSizeQuaternion(
-    center: number[],
-    halfSize: number[],
-    quaternion: number[]
-  ): OrientedBoundingBox {
-    const quaternionObject = new Quaternion(quaternion);
-    const directionsMatrix = new Matrix3().fromQuaternion(quaternionObject);
-    directionsMatrix[0] = directionsMatrix[0] * halfSize[0];
-    directionsMatrix[1] = directionsMatrix[1] * halfSize[0];
-    directionsMatrix[2] = directionsMatrix[2] * halfSize[0];
-    directionsMatrix[3] = directionsMatrix[3] * halfSize[1];
-    directionsMatrix[4] = directionsMatrix[4] * halfSize[1];
-    directionsMatrix[5] = directionsMatrix[5] * halfSize[1];
-    directionsMatrix[6] = directionsMatrix[6] * halfSize[2];
-    directionsMatrix[7] = directionsMatrix[7] * halfSize[2];
-    directionsMatrix[8] = directionsMatrix[8] * halfSize[2];
-    this.center = new Vector3().from(center);
-    this.halfAxes = directionsMatrix;
-    return this;
-  }
-
   /** Duplicates a OrientedBoundingBox instance. */
   clone(): OrientedBoundingBox {
     return new OrientedBoundingBox(this.center, this.halfAxes);

package/src/culling/lib/culling-volume.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 /* eslint-disable */
 import {Vector3, assert} from '@math.gl/core';

package/src/culling/lib/perspective-frustum.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 // Note: This class is still an experimental export, mainly used by other test cases
 // - It has not been fully adapted to math.gl conventions

package/src/culling/lib/perspective-off-center-frustum.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 // Note: This class is still an experimental export, mainly used by other test cases
 // - It has not been fully adapted to math.gl conventions

package/src/culling/lib/plane.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium math library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 /* eslint-disable */
 import {Vector3, equals, assert, NumericArray, _MathUtils} from '@math.gl/core';

package/src/culling/lib/ray.ts

@@ -5,7 +5,7 @@
 // SPDX-FileComment: Derived from Cesium. See the repository LICENSE for upstream attribution and Apache-2.0 terms.
 
 // This file is derived from the Cesium library under Apache 2 license
-// See LICENSE.md and https://github.com/AnalyticalGraphicsInc/cesium/blob/master/LICENSE.md
+// See ../../../LICENSE for the retained Cesium notice and Apache-2.0 terms.
 
 import {Vector3} from '@math.gl/core';
 

package/src/index.ts

@@ -10,6 +10,9 @@ export type {
   GeometryAttributes,
   PrimitiveTopology
 } from './lib/geometry';
+export {HingeTree} from './lib/hinge-tree';
+export type {HingePanel} from './lib/hinge-tree';
+
 export {unpackIndexedGeometry} from './lib/geometry-utils';
 
 export {BoxGeometry, CubeGeometry} from './geometries/box-geometry';

package/src/lib/hinge-tree.ts

@@ -0,0 +1,170 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+
+import {Matrix4} from '@math.gl/core';
+import type {NumericArray} from '@math.gl/core';
+
+/** A rigid panel attached to its parent by a revolute joint. */
+export type HingePanel = {
+  /** Parent index in the input array; -1 for a root. Input order is arbitrary. */
+  parent: number;
+  /** Child-local to parent-local transform at zero angle; defaults to identity. */
+  restTransform?: Readonly<NumericArray>;
+  /** Hinge pivot in parent-local coordinates. Required for nonroots. */
+  pivot?: readonly [number, number, number];
+  /** Right-handed rotation axis in parent-local coordinates; normalized internally. */
+  axis?: readonly [number, number, number];
+};
+
+type Joint = {
+  parent: number;
+  rest: Matrix4;
+  pivot: number[];
+  negativePivot: number[];
+  axis: number[];
+};
+
+/** Experimental rigid-panel kinematics, independent of mesh topology and rendering.
+ * Snapshots its inputs. Does not infer shared edges, solve closed loops or detect collisions.
+ */
+export class HingeTree {
+  readonly panelCount: number;
+  private readonly joints: Joint[];
+  private readonly order: number[];
+  private readonly angles: Float64Array;
+  private readonly local = new Matrix4();
+  private readonly world = new Matrix4();
+  private readonly root = new Matrix4();
+
+  constructor(panels: readonly HingePanel[]) {
+    this.panelCount = panels.length;
+    const children: number[][] = panels.map(() => []);
+    const order: number[] = [];
+    this.joints = panels.map((panel, index) => {
+      const {parent} = panel;
+      if (!Number.isInteger(parent) || parent < -1 || parent >= panels.length || parent === index) {
+        throw new RangeError('Invalid hinge parent index');
+      }
+      if (parent === -1) order.push(index);
+      else children[parent].push(index);
+      const rest = new Matrix4();
+      if (panel.restTransform !== undefined) {
+        validateRigidTransform(panel.restTransform);
+        rest.copy(panel.restTransform);
+      }
+      const pivot = parent === -1 ? [0, 0, 0] : copyVector(panel.pivot);
+      const axis = parent === -1 ? [1, 0, 0] : copyVector(panel.axis);
+      const length = Math.hypot(...axis);
+      if (!Number.isFinite(length) || length === 0) throw new RangeError('Invalid hinge axis');
+      for (let i = 0; i < 3; i++) axis[i] /= length;
+      return {
+        parent,
+        rest,
+        pivot,
+        negativePivot: pivot.map(value => -value),
+        axis
+      };
+    });
+    // Iterative traversal supports deep trees without consuming the call stack.
+    for (let i = 0; i < order.length; i++) {
+      for (const child of children[order[i]]) order.push(child);
+    }
+    if (order.length !== panels.length) throw new RangeError('Hinge parents contain a cycle');
+    this.order = order;
+    this.angles = new Float64Array(panels.length);
+  }
+
+  /** Evaluate one angle per panel in radians (root angles must be zero).
+   * Returns column-major matrices in input-panel order, 16 doubles per panel.
+   * rootTransform places the whole forest; omitted means identity.
+   * Output may alias the inputs: angles and root transform are snapshotted first.
+   * Finite inputs that overflow during composition throw; output may then be partial.
+   */
+  evaluate(
+    angles: Readonly<NumericArray>,
+    output = new Float64Array(this.panelCount * 16),
+    rootTransform?: Readonly<NumericArray>
+  ): Float64Array {
+    if (angles.length !== this.panelCount) throw new RangeError('Expected one angle per panel');
+    if (!(output instanceof Float64Array) || output.length !== this.panelCount * 16) {
+      throw new RangeError('Expected 16 Float64 values per panel');
+    }
+    for (let i = 0; i < angles.length; i++) {
+      if (!Number.isFinite(angles[i]) || (this.joints[i].parent === -1 && angles[i] !== 0)) {
+        throw new RangeError('Expected finite angles and zero root angles');
+      }
+      this.angles[i] = angles[i];
+    }
+    this.root.identity();
+    if (rootTransform !== undefined) {
+      validateRigidTransform(rootTransform);
+      this.root.copy(rootTransform);
+    }
+    for (const index of this.order) {
+      const joint = this.joints[index];
+      this.local.identity();
+      if (joint.parent !== -1) {
+        this.local
+          .translate(joint.pivot)
+          .rotateAxis(this.angles[index], joint.axis)
+          .translate(joint.negativePivot);
+      }
+      this.local.multiplyRight(joint.rest);
+      if (joint.parent === -1) this.world.copy(this.root);
+      else {
+        for (let i = 0; i < 16; i++) this.world[i] = output[joint.parent * 16 + i];
+      }
+      this.world.multiplyRight(this.local);
+      for (let i = 0; i < 16; i++) {
+        if (!Number.isFinite(this.world[i])) throw new RangeError('Hinge transform overflow');
+        output[index * 16 + i] = this.world[i];
+      }
+    }
+    return output;
+  }
+}
+
+function copyVector(vector?: readonly number[]): number[] {
+  if (
+    !vector ||
+    vector.length !== 3 ||
+    !Number.isFinite(vector[0]) ||
+    !Number.isFinite(vector[1]) ||
+    !Number.isFinite(vector[2])
+  ) {
+    throw new RangeError('Expected a finite hinge pivot and axis');
+  }
+  return [...vector];
+}
+
+/** Accept proper rigid affine transforms, allowing numerical roundoff. */
+function validateRigidTransform(matrix: Readonly<NumericArray>): void {
+  if (matrix.length !== 16) throw new RangeError('Expected a 4x4 rigid transform');
+  for (let i = 0; i < 16; i++) {
+    if (!Number.isFinite(matrix[i])) throw new RangeError('Expected a finite rigid transform');
+  }
+  const tolerance = 1e-6;
+  if (
+    Math.abs(matrix[3]) > tolerance ||
+    Math.abs(matrix[7]) > tolerance ||
+    Math.abs(matrix[11]) > tolerance ||
+    Math.abs(matrix[15] - 1) > tolerance
+  )
+    throw new RangeError('Expected an affine rigid transform');
+  for (let a = 0; a < 3; a++) {
+    for (let b = a; b < 3; b++) {
+      let dot = 0;
+      for (let row = 0; row < 3; row++) dot += matrix[a * 4 + row] * matrix[b * 4 + row];
+      if (Math.abs(dot - (a === b ? 1 : 0)) > tolerance) {
+        throw new RangeError('Rigid transforms cannot scale or shear');
+      }
+    }
+  }
+  const determinant =
+    matrix[0] * (matrix[5] * matrix[10] - matrix[6] * matrix[9]) -
+    matrix[4] * (matrix[1] * matrix[10] - matrix[2] * matrix[9]) +
+    matrix[8] * (matrix[1] * matrix[6] - matrix[2] * matrix[5]);
+  if (Math.abs(determinant - 1) > tolerance)
+    throw new RangeError('Rigid transforms cannot reflect');
+}

package/src/polygon/index.ts

@@ -21,7 +21,11 @@ export {cutPolygonByGrid, cutPolylineByGrid} from './cut-by-grid';
 export {cutPolylineByMercatorBounds, cutPolygonByMercatorBounds} from './cut-by-mercator-bounds';
 
 export {subdividePolyline} from './subdivide-polyline';
-export type {SubdividePolylineOptions, SubdividedPolyline} from './subdivide-polyline';
+export type {
+  SubdividePolylineOptions,
+  SubdividedPolyline,
+  PolylineEdgeSampler
+} from './subdivide-polyline';
 
 export {subdivideTriangleMesh} from './subdivide-triangle-mesh';
 export type {