three-stdlib 2.22.5 → 2.22.7

package/math/SimplexNoise.d.ts

@@ -1,17 +0,0 @@
-export interface NumberGenerator {
-    random: () => number;
-}
-export declare class SimplexNoise {
-    private grad3;
-    private grad4;
-    private p;
-    private perm;
-    private simplex;
-    constructor(r?: NumberGenerator);
-    dot: (g: number[], x: number, y: number) => number;
-    dot3: (g: number[], x: number, y: number, z: number) => number;
-    dot4: (g: number[], x: number, y: number, z: number, w: number) => number;
-    noise: (xin: number, yin: number) => number;
-    private noise3d;
-    noise4d: (x: number, y: number, z: number, w: number) => number;
-}

package/math/SimplexNoise.js

@@ -1,446 +0,0 @@
-import _defineProperty from '@babel/runtime/helpers/esm/defineProperty';
-
-// Ported from Stefan Gustavson's java implementation
-// http://staffwww.itn.liu.se/~stegu/simplexnoise/simplexnoise.pdf
-// Read Stefan's excellent paper for details on how this code works.
-//
-// Sean McCullough banksean@gmail.com
-//
-// Added 4D noise
-class SimplexNoise {
-  // To remove the need for index wrapping, double the permutation table length
-  // A lookup table to traverse the simplex around a given point in 4D.
-  // Details can be found where this table is used, in the 4D noise method.
-
-  /**
-   * You can pass in a random number generator object if you like.
-   * It is assumed to have a random() method.
-   */
-  constructor(r = Math) {
-    _defineProperty(this, "grad3", [[1, 1, 0], [-1, 1, 0], [1, -1, 0], [-1, -1, 0], [1, 0, 1], [-1, 0, 1], [1, 0, -1], [-1, 0, -1], [0, 1, 1], [0, -1, 1], [0, 1, -1], [0, -1, -1]]);
-
-    _defineProperty(this, "grad4", [[0, 1, 1, 1], [0, 1, 1, -1], [0, 1, -1, 1], [0, 1, -1, -1], [0, -1, 1, 1], [0, -1, 1, -1], [0, -1, -1, 1], [0, -1, -1, -1], [1, 0, 1, 1], [1, 0, 1, -1], [1, 0, -1, 1], [1, 0, -1, -1], [-1, 0, 1, 1], [-1, 0, 1, -1], [-1, 0, -1, 1], [-1, 0, -1, -1], [1, 1, 0, 1], [1, 1, 0, -1], [1, -1, 0, 1], [1, -1, 0, -1], [-1, 1, 0, 1], [-1, 1, 0, -1], [-1, -1, 0, 1], [-1, -1, 0, -1], [1, 1, 1, 0], [1, 1, -1, 0], [1, -1, 1, 0], [1, -1, -1, 0], [-1, 1, 1, 0], [-1, 1, -1, 0], [-1, -1, 1, 0], [-1, -1, -1, 0]]);
-
-    _defineProperty(this, "p", []);
-
-    _defineProperty(this, "perm", []);
-
-    _defineProperty(this, "simplex", [[0, 1, 2, 3], [0, 1, 3, 2], [0, 0, 0, 0], [0, 2, 3, 1], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [1, 2, 3, 0], [0, 2, 1, 3], [0, 0, 0, 0], [0, 3, 1, 2], [0, 3, 2, 1], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [1, 3, 2, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [1, 2, 0, 3], [0, 0, 0, 0], [1, 3, 0, 2], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [2, 3, 0, 1], [2, 3, 1, 0], [1, 0, 2, 3], [1, 0, 3, 2], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [2, 0, 3, 1], [0, 0, 0, 0], [2, 1, 3, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [2, 0, 1, 3], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [3, 0, 1, 2], [3, 0, 2, 1], [0, 0, 0, 0], [3, 1, 2, 0], [2, 1, 0, 3], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [3, 1, 0, 2], [0, 0, 0, 0], [3, 2, 0, 1], [3, 2, 1, 0]]);
-
-    _defineProperty(this, "dot", (g, x, y) => {
-      return g[0] * x + g[1] * y;
-    });
-
-    _defineProperty(this, "dot3", (g, x, y, z) => {
-      return g[0] * x + g[1] * y + g[2] * z;
-    });
-
-    _defineProperty(this, "dot4", (g, x, y, z, w) => {
-      return g[0] * x + g[1] * y + g[2] * z + g[3] * w;
-    });
-
-    _defineProperty(this, "noise", (xin, yin) => {
-      let n0;
-      let n1;
-      let n2; // Noise contributions from the three corners
-      // Skew the input space to determine which simplex cell we're in
-
-      const F2 = 0.5 * (Math.sqrt(3.0) - 1.0);
-      const s = (xin + yin) * F2; // Hairy factor for 2D
-
-      const i = Math.floor(xin + s);
-      const j = Math.floor(yin + s);
-      const G2 = (3.0 - Math.sqrt(3.0)) / 6.0;
-      const t = (i + j) * G2;
-      const X0 = i - t; // Unskew the cell origin back to (x,y) space
-
-      const Y0 = j - t;
-      const x0 = xin - X0; // The x,y distances from the cell origin
-
-      const y0 = yin - Y0; // For the 2D case, the simplex shape is an equilateral triangle.
-      // Determine which simplex we are in.
-      // upper triangle, YX order: (0,0)->(0,1)->(1,1)
-
-      let i1 = 0; // Offsets for second (middle) corner of simplex in (i,j) coords
-
-      let j1 = 1;
-
-      if (x0 > y0) {
-        i1 = 1;
-        j1 = 0;
-      } // A step of (1,0) in (i,j) means a step of (1-c,-c) in (x,y), and
-      // a step of (0,1) in (i,j) means a step of (-c,1-c) in (x,y), where
-      // c = (3-sqrt(3))/6
-
-
-      const x1 = x0 - i1 + G2; // Offsets for middle corner in (x,y) unskewed coords
-
-      const y1 = y0 - j1 + G2;
-      const x2 = x0 - 1.0 + 2.0 * G2; // Offsets for last corner in (x,y) unskewed coords
-
-      const y2 = y0 - 1.0 + 2.0 * G2; // Work out the hashed gradient indices of the three simplex corners
-
-      const ii = i & 255;
-      const jj = j & 255;
-      const gi0 = this.perm[ii + this.perm[jj]] % 12;
-      const gi1 = this.perm[ii + i1 + this.perm[jj + j1]] % 12;
-      const gi2 = this.perm[ii + 1 + this.perm[jj + 1]] % 12; // Calculate the contribution from the three corners
-
-      let t0 = 0.5 - x0 * x0 - y0 * y0;
-
-      if (t0 < 0) {
-        n0 = 0.0;
-      } else {
-        t0 *= t0;
-        n0 = t0 * t0 * this.dot(this.grad3[gi0], x0, y0); // (x,y) of grad3 used for 2D gradient
-      }
-
-      let t1 = 0.5 - x1 * x1 - y1 * y1;
-
-      if (t1 < 0) {
-        n1 = 0.0;
-      } else {
-        t1 *= t1;
-        n1 = t1 * t1 * this.dot(this.grad3[gi1], x1, y1);
-      }
-
-      let t2 = 0.5 - x2 * x2 - y2 * y2;
-
-      if (t2 < 0) {
-        n2 = 0.0;
-      } else {
-        t2 *= t2;
-        n2 = t2 * t2 * this.dot(this.grad3[gi2], x2, y2);
-      } // Add contributions from each corner to get the final noise value.
-      // The result is scaled to return values in the interval [-1,1].
-
-
-      return 70.0 * (n0 + n1 + n2);
-    });
-
-    _defineProperty(this, "noise3d", (xin, yin, zin) => {
-      // Noise contributions from the four corners
-      let n0;
-      let n1;
-      let n2;
-      let n3; // Skew the input space to determine which simplex cell we're in
-
-      const F3 = 1.0 / 3.0;
-      const s = (xin + yin + zin) * F3; // Very nice and simple skew factor for 3D
-
-      const i = Math.floor(xin + s);
-      const j = Math.floor(yin + s);
-      const k = Math.floor(zin + s);
-      const G3 = 1.0 / 6.0; // Very nice and simple unskew factor, too
-
-      const t = (i + j + k) * G3;
-      const X0 = i - t; // Unskew the cell origin back to (x,y,z) space
-
-      const Y0 = j - t;
-      const Z0 = k - t;
-      const x0 = xin - X0; // The x,y,z distances from the cell origin
-
-      const y0 = yin - Y0;
-      const z0 = zin - Z0; // For the 3D case, the simplex shape is a slightly irregular tetrahedron.
-      // Determine which simplex we are in.
-
-      let i1;
-      let j1;
-      let k1; // Offsets for second corner of simplex in (i,j,k) coords
-
-      let i2;
-      let j2;
-      let k2; // Offsets for third corner of simplex in (i,j,k) coords
-
-      if (x0 >= y0) {
-        if (y0 >= z0) {
-          i1 = 1;
-          j1 = 0;
-          k1 = 0;
-          i2 = 1;
-          j2 = 1;
-          k2 = 0; // X Y Z order
-        } else if (x0 >= z0) {
-          i1 = 1;
-          j1 = 0;
-          k1 = 0;
-          i2 = 1;
-          j2 = 0;
-          k2 = 1; // X Z Y order
-        } else {
-          i1 = 0;
-          j1 = 0;
-          k1 = 1;
-          i2 = 1;
-          j2 = 0;
-          k2 = 1;
-        } // Z X Y order
-
-      } else {
-        // x0<y0
-        if (y0 < z0) {
-          i1 = 0;
-          j1 = 0;
-          k1 = 1;
-          i2 = 0;
-          j2 = 1;
-          k2 = 1; // Z Y X order
-        } else if (x0 < z0) {
-          i1 = 0;
-          j1 = 1;
-          k1 = 0;
-          i2 = 0;
-          j2 = 1;
-          k2 = 1; // Y Z X order
-        } else {
-          i1 = 0;
-          j1 = 1;
-          k1 = 0;
-          i2 = 1;
-          j2 = 1;
-          k2 = 0;
-        } // Y X Z order
-
-      } // A step of (1,0,0) in (i,j,k) means a step of (1-c,-c,-c) in (x,y,z),
-      // a step of (0,1,0) in (i,j,k) means a step of (-c,1-c,-c) in (x,y,z), and
-      // a step of (0,0,1) in (i,j,k) means a step of (-c,-c,1-c) in (x,y,z), where
-      // c = 1/6.
-
-
-      const x1 = x0 - i1 + G3; // Offsets for second corner in (x,y,z) coords
-
-      const y1 = y0 - j1 + G3;
-      const z1 = z0 - k1 + G3;
-      const x2 = x0 - i2 + 2.0 * G3; // Offsets for third corner in (x,y,z) coords
-
-      const y2 = y0 - j2 + 2.0 * G3;
-      const z2 = z0 - k2 + 2.0 * G3;
-      const x3 = x0 - 1.0 + 3.0 * G3; // Offsets for last corner in (x,y,z) coords
-
-      const y3 = y0 - 1.0 + 3.0 * G3;
-      const z3 = z0 - 1.0 + 3.0 * G3; // Work out the hashed gradient indices of the four simplex corners
-
-      const ii = i & 255;
-      const jj = j & 255;
-      const kk = k & 255;
-      const gi0 = this.perm[ii + this.perm[jj + this.perm[kk]]] % 12;
-      const gi1 = this.perm[ii + i1 + this.perm[jj + j1 + this.perm[kk + k1]]] % 12;
-      const gi2 = this.perm[ii + i2 + this.perm[jj + j2 + this.perm[kk + k2]]] % 12;
-      const gi3 = this.perm[ii + 1 + this.perm[jj + 1 + this.perm[kk + 1]]] % 12; // Calculate the contribution from the four corners
-
-      let t0 = 0.6 - x0 * x0 - y0 * y0 - z0 * z0;
-
-      if (t0 < 0) {
-        n0 = 0.0;
-      } else {
-        t0 *= t0;
-        n0 = t0 * t0 * this.dot3(this.grad3[gi0], x0, y0, z0);
-      }
-
-      let t1 = 0.6 - x1 * x1 - y1 * y1 - z1 * z1;
-
-      if (t1 < 0) {
-        n1 = 0.0;
-      } else {
-        t1 *= t1;
-        n1 = t1 * t1 * this.dot3(this.grad3[gi1], x1, y1, z1);
-      }
-
-      let t2 = 0.6 - x2 * x2 - y2 * y2 - z2 * z2;
-
-      if (t2 < 0) {
-        n2 = 0.0;
-      } else {
-        t2 *= t2;
-        n2 = t2 * t2 * this.dot3(this.grad3[gi2], x2, y2, z2);
-      }
-
-      let t3 = 0.6 - x3 * x3 - y3 * y3 - z3 * z3;
-
-      if (t3 < 0) {
-        n3 = 0.0;
-      } else {
-        t3 *= t3;
-        n3 = t3 * t3 * this.dot3(this.grad3[gi3], x3, y3, z3);
-      } // Add contributions from each corner to get the final noise value.
-      // The result is scaled to stay just inside [-1,1]
-
-
-      return 32.0 * (n0 + n1 + n2 + n3);
-    });
-
-    _defineProperty(this, "noise4d", (x, y, z, w) => {
-      // For faster and easier lookups
-      const grad4 = this.grad4;
-      const simplex = this.simplex;
-      const perm = this.perm; // The skewing and unskewing factors are hairy again for the 4D case
-
-      const F4 = (Math.sqrt(5.0) - 1.0) / 4.0;
-      const G4 = (5.0 - Math.sqrt(5.0)) / 20.0;
-      let n0;
-      let n1;
-      let n2;
-      let n3;
-      let n4; // Noise contributions from the five corners
-      // Skew the (x,y,z,w) space to determine which cell of 24 simplices we're in
-
-      const s = (x + y + z + w) * F4; // Factor for 4D skewing
-
-      const i = Math.floor(x + s);
-      const j = Math.floor(y + s);
-      const k = Math.floor(z + s);
-      const l = Math.floor(w + s);
-      const t = (i + j + k + l) * G4; // Factor for 4D unskewing
-
-      const X0 = i - t; // Unskew the cell origin back to (x,y,z,w) space
-
-      const Y0 = j - t;
-      const Z0 = k - t;
-      const W0 = l - t;
-      const x0 = x - X0; // The x,y,z,w distances from the cell origin
-
-      const y0 = y - Y0;
-      const z0 = z - Z0;
-      const w0 = w - W0; // For the 4D case, the simplex is a 4D shape I won't even try to describe.
-      // To find out which of the 24 possible simplices we're in, we need to
-      // determine the magnitude ordering of x0, y0, z0 and w0.
-      // The method below is a good way of finding the ordering of x,y,z,w and
-      // then find the correct traversal order for the simplex we’re in.
-      // First, six pair-wise comparisons are performed between each possible pair
-      // of the four coordinates, and the results are used to add up binary bits
-      // for an integer index.
-
-      const c1 = x0 > y0 ? 32 : 0;
-      const c2 = x0 > z0 ? 16 : 0;
-      const c3 = y0 > z0 ? 8 : 0;
-      const c4 = x0 > w0 ? 4 : 0;
-      const c5 = y0 > w0 ? 2 : 0;
-      const c6 = z0 > w0 ? 1 : 0;
-      const c = c1 + c2 + c3 + c4 + c5 + c6; // The integer offsets for the second simplex corner
-
-      let i1;
-      let j1;
-      let k1;
-      let l1; // The integer offsets for the third simplex corner
-
-      let i2;
-      let j2;
-      let k2;
-      let l2; // The integer offsets for the fourth simplex corner
-
-      let i3;
-      let j3;
-      let k3;
-      let l3; // simplex[c] is a 4-vector with the numbers 0, 1, 2 and 3 in some order.
-      // Many values of c will never occur, since e.g. x>y>z>w makes x<z, y<w and x<w
-      // impossible. Only the 24 indices which have non-zero entries make any sense.
-      // We use a thresholding to set the coordinates in turn from the largest magnitude.
-      // The number 3 in the "simplex" array is at the position of the largest coordinate.
-
-      i1 = simplex[c][0] >= 3 ? 1 : 0;
-      j1 = simplex[c][1] >= 3 ? 1 : 0;
-      k1 = simplex[c][2] >= 3 ? 1 : 0;
-      l1 = simplex[c][3] >= 3 ? 1 : 0; // The number 2 in the "simplex" array is at the second largest coordinate.
-
-      i2 = simplex[c][0] >= 2 ? 1 : 0;
-      j2 = simplex[c][1] >= 2 ? 1 : 0;
-      k2 = simplex[c][2] >= 2 ? 1 : 0;
-      l2 = simplex[c][3] >= 2 ? 1 : 0; // The number 1 in the "simplex" array is at the second smallest coordinate.
-
-      i3 = simplex[c][0] >= 1 ? 1 : 0;
-      j3 = simplex[c][1] >= 1 ? 1 : 0;
-      k3 = simplex[c][2] >= 1 ? 1 : 0;
-      l3 = simplex[c][3] >= 1 ? 1 : 0; // The fifth corner has all coordinate offsets = 1, so no need to look that up.
-
-      const x1 = x0 - i1 + G4; // Offsets for second corner in (x,y,z,w) coords
-
-      const y1 = y0 - j1 + G4;
-      const z1 = z0 - k1 + G4;
-      const w1 = w0 - l1 + G4;
-      const x2 = x0 - i2 + 2.0 * G4; // Offsets for third corner in (x,y,z,w) coords
-
-      const y2 = y0 - j2 + 2.0 * G4;
-      const z2 = z0 - k2 + 2.0 * G4;
-      const w2 = w0 - l2 + 2.0 * G4;
-      const x3 = x0 - i3 + 3.0 * G4; // Offsets for fourth corner in (x,y,z,w) coords
-
-      const y3 = y0 - j3 + 3.0 * G4;
-      const z3 = z0 - k3 + 3.0 * G4;
-      const w3 = w0 - l3 + 3.0 * G4;
-      const x4 = x0 - 1.0 + 4.0 * G4; // Offsets for last corner in (x,y,z,w) coords
-
-      const y4 = y0 - 1.0 + 4.0 * G4;
-      const z4 = z0 - 1.0 + 4.0 * G4;
-      const w4 = w0 - 1.0 + 4.0 * G4; // Work out the hashed gradient indices of the five simplex corners
-
-      const ii = i & 255;
-      const jj = j & 255;
-      const kk = k & 255;
-      const ll = l & 255;
-      const gi0 = perm[ii + perm[jj + perm[kk + perm[ll]]]] % 32;
-      const gi1 = perm[ii + i1 + perm[jj + j1 + perm[kk + k1 + perm[ll + l1]]]] % 32;
-      const gi2 = perm[ii + i2 + perm[jj + j2 + perm[kk + k2 + perm[ll + l2]]]] % 32;
-      const gi3 = perm[ii + i3 + perm[jj + j3 + perm[kk + k3 + perm[ll + l3]]]] % 32;
-      const gi4 = perm[ii + 1 + perm[jj + 1 + perm[kk + 1 + perm[ll + 1]]]] % 32; // Calculate the contribution from the five corners
-
-      let t0 = 0.6 - x0 * x0 - y0 * y0 - z0 * z0 - w0 * w0;
-
-      if (t0 < 0) {
-        n0 = 0.0;
-      } else {
-        t0 *= t0;
-        n0 = t0 * t0 * this.dot4(grad4[gi0], x0, y0, z0, w0);
-      }
-
-      let t1 = 0.6 - x1 * x1 - y1 * y1 - z1 * z1 - w1 * w1;
-
-      if (t1 < 0) {
-        n1 = 0.0;
-      } else {
-        t1 *= t1;
-        n1 = t1 * t1 * this.dot4(grad4[gi1], x1, y1, z1, w1);
-      }
-
-      let t2 = 0.6 - x2 * x2 - y2 * y2 - z2 * z2 - w2 * w2;
-
-      if (t2 < 0) {
-        n2 = 0.0;
-      } else {
-        t2 *= t2;
-        n2 = t2 * t2 * this.dot4(grad4[gi2], x2, y2, z2, w2);
-      }
-
-      let t3 = 0.6 - x3 * x3 - y3 * y3 - z3 * z3 - w3 * w3;
-
-      if (t3 < 0) {
-        n3 = 0.0;
-      } else {
-        t3 *= t3;
-        n3 = t3 * t3 * this.dot4(grad4[gi3], x3, y3, z3, w3);
-      }
-
-      let t4 = 0.6 - x4 * x4 - y4 * y4 - z4 * z4 - w4 * w4;
-
-      if (t4 < 0) {
-        n4 = 0.0;
-      } else {
-        t4 *= t4;
-        n4 = t4 * t4 * this.dot4(grad4[gi4], x4, y4, z4, w4);
-      } // Sum up and scale the result to cover the range [-1,1]
-
-
-      return 27.0 * (n0 + n1 + n2 + n3 + n4);
-    });
-
-    for (let i = 0; i < 256; i++) {
-      this.p[i] = Math.floor(r.random() * 256);
-    }
-
-    for (let i = 0; i < 512; i++) {
-      this.perm[i] = this.p[i & 255];
-    }
-  }
-
-}
-
-export { SimplexNoise };

package/misc/ConvexObjectBreaker.cjs.js

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var e=require("three"),t=require("../geometries/ConvexGeometry.cjs.js");require("../math/ConvexHull.cjs.js");var r,o=function(t,r){this.minSizeForBreak=t||1.4,this.smallDelta=r||1e-4,this.tempLine1=new e.Line3,this.tempPlane1=new e.Plane,this.tempPlane2=new e.Plane,this.tempPlane_Cut=new e.Plane,this.tempCM1=new e.Vector3,this.tempCM2=new e.Vector3,this.tempVector3=new e.Vector3,this.tempVector3_2=new e.Vector3,this.tempVector3_3=new e.Vector3,this.tempVector3_P0=new e.Vector3,this.tempVector3_P1=new e.Vector3,this.tempVector3_P2=new e.Vector3,this.tempVector3_N0=new e.Vector3,this.tempVector3_N1=new e.Vector3,this.tempVector3_AB=new e.Vector3,this.tempVector3_CB=new e.Vector3,this.tempResultObjects={object1:null,object2:null},this.segments=[];for(let e=0;e<900;e++)this.segments[e]=!1};o.prototype={constructor:o,prepareBreakableObject:function(e,t,r,o,n){e.geometry.isBufferGeometry||console.error("THREE.ConvexObjectBreaker.prepareBreakableObject(): Parameter object must have a BufferGeometry.");var s=e.userData;s.mass=t,s.velocity=r.clone(),s.angularVelocity=o.clone(),s.breakable=n},subdivideByImpact:function(e,t,r,o,n){var s=[],a=this.tempPlane1,i=this.tempPlane2;this.tempVector3.addVectors(t,r),a.setFromCoplanarPoints(t,e.position,this.tempVector3);var c=n+o,m=this;return function n(p,l,h,u){if(Math.random()<.05*u||u>c)s.push(p);else{var v=Math.PI;0===u?(i.normal.copy(a.normal),i.constant=a.constant):u<=o?(v=(h-l)*(.2+.6*Math.random())+l,m.tempVector3_2.copy(e.position).sub(t).applyAxisAngle(r,v).add(t),i.setFromCoplanarPoints(t,m.tempVector3,m.tempVector3_2)):(v=(.5*(1&u)+.2*(2-Math.random()))*Math.PI,m.tempVector3_2.copy(t).sub(p.position).applyAxisAngle(r,v).add(p.position),m.tempVector3_3.copy(r).add(p.position),i.setFromCoplanarPoints(p.position,m.tempVector3_3,m.tempVector3_2)),m.cutByPlane(p,i,m.tempResultObjects);var V=m.tempResultObjects.object1,y=m.tempResultObjects.object2;V&&n(V,l,v,u+1),y&&n(y,v,h,u+1)}}(e,0,2*Math.PI,0),s},cutByPlane:function(r,n,s){var a=r.geometry,i=a.attributes.position.array,c=a.attributes.normal.array,m=i.length/3,p=m/3,l=a.getIndex();function h(e,t){var r=3*e+t;return l?l[r]:r}l&&(p=(l=l.array).length/3);var u=[],v=[],V=this.smallDelta,y=m*m;for(let e=0;e<y;e++)this.segments[e]=!1;var d=this.tempVector3_P0,f=this.tempVector3_P1,b=this.tempVector3_N0,P=this.tempVector3_N1;for(let e=0;e<p-1;e++){var g=h(e,0),C=h(e,1),M=h(e,2);b.set(c[g],c[g]+1,c[g]+2);for(let t=e+1;t<p;t++){var j=h(t,0),x=h(t,1),_=h(t,2);P.set(c[j],c[j]+1,c[j]+2),1-b.dot(P)<V&&(g===j||g===x||g===_?C===j||C===x||C===_?(this.segments[g*m+C]=!0,this.segments[C*m+g]=!0):(this.segments[M*m+g]=!0,this.segments[g*m+M]=!0):C!==j&&C!==x&&C!==_||(this.segments[M*m+C]=!0,this.segments[C*m+M]=!0))}}var w=this.tempPlane_Cut;r.updateMatrix(),o.transformPlaneToLocalSpace(n,r.matrix,w);for(let t=0;t<p;t++){var B=h(t,0),O=h(t,1),z=h(t,2);for(let t=0;t<3;t++){var k=0===t?B:1===t?O:z,I=0===t?O:1===t?z:B;if(!this.segments[k*m+I]){this.segments[k*m+I]=!0,this.segments[I*m+k]=!0,d.set(i[3*k],i[3*k+1],i[3*k+2]),f.set(i[3*I],i[3*I+1],i[3*I+2]);var F=0;(D=w.distanceToPoint(d))>V?(F=2,v.push(d.clone())):D<-V?(F=1,u.push(d.clone())):(F=3,u.push(d.clone()),v.push(d.clone()));var D,L=0;if((D=w.distanceToPoint(f))>V?(L=2,v.push(f.clone())):D<-V?(L=1,u.push(f.clone())):(L=3,u.push(f.clone()),v.push(f.clone())),1===F&&2===L||2===F&&1===L){this.tempLine1.start.copy(d),this.tempLine1.end.copy(f);var q=new e.Vector3;if(void 0===(q=w.intersectLine(this.tempLine1,q)))return console.error("Internal error: segment does not intersect plane."),s.segmentedObject1=null,s.segmentedObject2=null,0;u.push(q),v.push(q.clone())}}}}var S=.5*r.userData.mass;this.tempCM1.set(0,0,0);var T=0,A=u.length;if(A>0){for(let e=0;e<A;e++)this.tempCM1.add(u[e]);this.tempCM1.divideScalar(A);for(let e=0;e<A;e++){(N=u[e]).sub(this.tempCM1),T=Math.max(T,N.x,N.y,N.z)}this.tempCM1.add(r.position)}this.tempCM2.set(0,0,0);var G=0,R=v.length;if(R>0){for(let e=0;e<R;e++)this.tempCM2.add(v[e]);this.tempCM2.divideScalar(R);for(let e=0;e<R;e++){var N;(N=v[e]).sub(this.tempCM2),G=Math.max(G,N.x,N.y,N.z)}this.tempCM2.add(r.position)}var E=null,H=null,J=0;return A>4&&((E=new e.Mesh(new t.ConvexGeometry(u),r.material)).position.copy(this.tempCM1),E.quaternion.copy(r.quaternion),this.prepareBreakableObject(E,S,r.userData.velocity,r.userData.angularVelocity,2*T>this.minSizeForBreak),J++),R>4&&((H=new e.Mesh(new t.ConvexGeometry(v),r.material)).position.copy(this.tempCM2),H.quaternion.copy(r.quaternion),this.prepareBreakableObject(H,S,r.userData.velocity,r.userData.angularVelocity,2*G>this.minSizeForBreak),J++),s.object1=E,s.object2=H,J}},o.transformFreeVector=function(e,t){var r=e.x,o=e.y,n=e.z,s=t.elements;return e.x=s[0]*r+s[4]*o+s[8]*n,e.y=s[1]*r+s[5]*o+s[9]*n,e.z=s[2]*r+s[6]*o+s[10]*n,e},o.transformFreeVectorInverse=function(e,t){var r=e.x,o=e.y,n=e.z,s=t.elements;return e.x=s[0]*r+s[1]*o+s[2]*n,e.y=s[4]*r+s[5]*o+s[6]*n,e.z=s[8]*r+s[9]*o+s[10]*n,e},o.transformTiedVectorInverse=function(e,t){var r=e.x,o=e.y,n=e.z,s=t.elements;return e.x=s[0]*r+s[1]*o+s[2]*n-s[12],e.y=s[4]*r+s[5]*o+s[6]*n-s[13],e.z=s[8]*r+s[9]*o+s[10]*n-s[14],e},o.transformPlaneToLocalSpace=(r=new e.Vector3,function(e,t,n){n.normal.copy(e.normal),n.constant=e.constant;var s=o.transformTiedVectorInverse(e.coplanarPoint(r),t);o.transformFreeVectorInverse(n.normal,t),n.constant=-s.dot(n.normal)}),exports.ConvexObjectBreaker=o;

package/misc/ConvexObjectBreaker.d.ts

@@ -1,25 +0,0 @@
-import { Object3D, Plane, Vector3 } from 'three';
-
-export interface CutByPlaneOutput {
-    object1: Object3D;
-    object2: Object3D;
-}
-
-export class ConvexObjectBreaker {
-    constructor(minSizeForBreak?: number, smallDelta?: number);
-    prepareBreakableObject(
-        object: Object3D,
-        mass: number,
-        velocity: Vector3,
-        angularVelocity: Vector3,
-        breakable: boolean,
-    ): void;
-    subdivideByImpact(
-        object: Object3D,
-        pointOfImpact: Vector3,
-        normal: Vector3,
-        maxRadialIterations: number,
-        maxRandomIterations: number,
-    ): Object3D[];
-    cutByPlane(object: Object3D, plane: Plane, output: CutByPlaneOutput): number;
-}