@equinor/videx-3d 1.1.0 → 2.0.0

package/dist/{chunk-BolRQZt9.js → chunk-M-Pcc_Yg.js}

@@ -1,5 +1,5 @@
 import { lerp as Z } from "three/src/math/MathUtils.js";
-import { d as G, P as x, o as S, p as tt, a3 as N, E as st, F as et, aa as it, ag as nt, J as rt } from "./chunk-iY0wQ9Z6.js";
+import { d as U, P as x, p as S, q as tt, a8 as N, G as st, I as et, af as it, al as nt, M as rt } from "./chunk-61X6qE5N.js";
 import { BufferGeometry as K, BufferAttribute as L } from "three";
 function at(n, t) {
   switch (t) {
@@ -123,9 +123,9 @@ function D(n) {
     type: "Float32Array"
   }), t;
 }
-function U(n, t, s) {
+function G(n, t, s) {
   if (t[0] === s[0]) return s[1];
-  const e = s[0] - t[0], o = G((n - t[0]) / e, 0, 1);
+  const e = s[0] - t[0], o = U((n - t[0]) / e, 0, 1);
   return Z(t[1], s[1], o);
 }
 function H(n, t, s, e, o, l, r, i) {
@@ -136,7 +136,7 @@ function H(n, t, s, e, o, l, r, i) {
     let d = [0, o], g = [1, o];
     const b = l.findIndex((v) => v[0] > s);
     b === -1 ? d = l[l.length - 1] : (b > 0 && (d = l[b - 1]), g = l[b]);
-    const y = t === "linear" ? U(s, d, g) : d[1];
+    const y = t === "linear" ? G(s, d, g) : d[1];
     a.push([s, y]);
     for (let v = b; v >= 0 && v < l.length; v++) {
       const p = l[v];
@@ -145,14 +145,14 @@ function H(n, t, s, e, o, l, r, i) {
       else {
         t === "linear" ? a.push([
           e,
-          U(e, a[a.length - 1], p)
+          G(e, a[a.length - 1], p)
         ]) : a.push([e, a[a.length - 1][1]]);
         break;
       }
     }
     a[a.length - 1][0] < e && (t === "linear" ? a.push([
       e,
-      U(e, a[a.length - 1], [1, o])
+      G(e, a[a.length - 1], [1, o])
     ]) : a.push([e, a[a.length - 1][1]]));
   }
   const u = [], c = S(
@@ -172,7 +172,7 @@ function H(n, t, s, e, o, l, r, i) {
     ]); h <= b && f < c.length - 1; )
       h = c[++f];
     for (; h < v && f < c.length; ) {
-      const z = t === "linear" ? U(h, a[d], a[g]) : y;
+      const z = t === "linear" ? G(h, a[d], a[g]) : y;
       u.push([
         h,
         z,
@@ -279,7 +279,7 @@ function Y(n, t, s = !0, e, o, l) {
   }
   return r;
 }
-function J(n, t, s, e = !0, o, l, r) {
+function $(n, t, s, e = !0, o, l, r) {
   const i = D(r), a = e ? [
     -n.tangent[0],
     -n.tangent[1],
@@ -317,12 +317,12 @@ function J(n, t, s, e = !0, o, l, r) {
   return i;
 }
 function ht(n, t = {}) {
-  const s = G(t.from || 0, 0, 1), e = G(t.to || 1);
+  const s = U(t.from || 0, 0, 1), e = U(t.to || 1);
   if (e < s)
     throw Error('Value of "from" must be less than the value of "to"!');
   const o = [], l = t.radius || 1, r = t.radiusModifier?.steps || [], i = t.radialSegments || 8, a = t.startCap || !1, u = t.endCap || !1, c = n.closed, f = n.length;
   r.sort((p, m) => p[0] - m[0]);
-  const h = t.segmentsPerMeter || 0.1, _ = t.radiusModifier?.type || "none", d = G(
+  const h = t.segmentsPerMeter || 0.1, _ = t.radiusModifier?.type || "none", d = U(
     t.simplificationThreshold || 0,
     0,
     1
@@ -376,7 +376,7 @@ function ht(n, t = {}) {
       !1
     )
   )), a && (!c || s > 0 || e < 1) && (b ? o.push(
-    J(
+    $(
       g[0],
       b[0],
       i,
@@ -395,7 +395,7 @@ function ht(n, t = {}) {
       t
     )
   )), u && (!c || s > 0 || e < 1) && (b ? o.push(
-    J(
+    $(
       g[g.length - 1],
       b[b.length - 1],
       i,
@@ -419,7 +419,7 @@ function gt(n, t = {}) {
   const s = ht(n, t);
   return ut(s, t.addGroups);
 }
-const $ = -1e3;
+const J = -1e3;
 class lt {
   data;
   width;
@@ -477,7 +477,7 @@ class lt {
   // height value at a given position
   heightAt(t, s) {
     const e = this.data[this.width * s + t];
-    return e === this.nullValue ? $ : e;
+    return e === this.nullValue ? J : e;
   }
   // rasterize a triangle, find its max error, and queue it for processing
   _findCandidate(t, s, e, o, l, r, i) {
@@ -488,15 +488,15 @@ class lt {
     for (let T = u; T <= f; T++) {
       let w = 0;
       h < 0 && y !== 0 && (w = Math.max(w, Math.floor(-h / y))), _ < 0 && p !== 0 && (w = Math.max(w, Math.floor(-_ / p))), d < 0 && g !== 0 && (w = Math.max(w, Math.floor(-d / g)));
-      let E = h + y * w, V = _ + p * w, j = d + g * w, O = !1;
+      let V = h + y * w, j = _ + p * w, E = d + g * w, O = !1;
       for (let I = a + w; I <= c; I++) {
-        if (E >= 0 && V >= 0 && j >= 0) {
+        if (V >= 0 && j >= 0 && E >= 0) {
           O = !0;
-          const Q = q * E + C * V + z * j, W = this.heightAt(I, T), B = Math.abs(Q - W);
+          const Q = q * V + C * j + z * E, W = this.heightAt(I, T), B = Math.abs(Q - W);
           k += B * B, B > R && (R = B, M = I, F = T);
         } else if (O)
           break;
-        E += y, V += p, j += g;
+        V += y, j += p, E += g;
       }
       h += v, _ += m, d += b;
     }
@@ -518,7 +518,7 @@ class lt {
   }
   _addPoint(t, s) {
     const e = this.coords.length >> 1;
-    return this.coords.push(t, s), this.heightAt(t, s) === $ && this._invalidPoints.add(e), e;
+    return this.coords.push(t, s), this.heightAt(t, s) === J && this._invalidPoints.add(e), e;
   }
   _addTriangle(t, s, e, o, l, r, i = this.triangles.length) {
     const a = i / 3;
@@ -682,6 +682,8 @@ export {
   ht as b,
   pt as c,
   gt as d,
-  vt as e,
+  ut as e,
+  vt as f,
+  ot as m,
   yt as t
 };