three-stdlib 2.22.5 → 2.22.7

package/math/OBB.js

@@ -1,296 +0,0 @@
-import { Vector3, Matrix3, Box3, Matrix4, Ray, MathUtils } from 'three';
-
-var a = {
-  c: null,
-  // center
-  u: [new Vector3(), new Vector3(), new Vector3()],
-  // basis vectors
-  e: [] // half width
-
-};
-var b = {
-  c: null,
-  // center
-  u: [new Vector3(), new Vector3(), new Vector3()],
-  // basis vectors
-  e: [] // half width
-
-};
-var R = [[], [], []];
-var AbsR = [[], [], []];
-var t = [];
-var xAxis = new Vector3();
-var yAxis = new Vector3();
-var zAxis = new Vector3();
-var v1 = new Vector3();
-var size = new Vector3();
-var closestPoint = new Vector3();
-var rotationMatrix = new Matrix3();
-var aabb = new Box3();
-var matrix = new Matrix4();
-var inverse = new Matrix4();
-var localRay = new Ray(); // OBB
-
-function OBB(center = new Vector3(), halfSize = new Vector3(), rotation = new Matrix3()) {
-  this.center = center;
-  this.halfSize = halfSize;
-  this.rotation = rotation;
-}
-
-Object.assign(OBB.prototype, {
-  set: function (center, halfSize, rotation) {
-    this.center = center;
-    this.halfSize = halfSize;
-    this.rotation = rotation;
-    return this;
-  },
-  copy: function (obb) {
-    this.center.copy(obb.center);
-    this.halfSize.copy(obb.halfSize);
-    this.rotation.copy(obb.rotation);
-    return this;
-  },
-  clone: function () {
-    return new this.constructor().copy(this);
-  },
-  getSize: function (result) {
-    return result.copy(this.halfSize).multiplyScalar(2);
-  },
-
-  /**
-   * Reference: Closest Point on OBB to Point in Real-Time Collision Detection
-   * by Christer Ericson (chapter 5.1.4)
-   */
-  clampPoint: function (point, result) {
-    var halfSize = this.halfSize;
-    v1.subVectors(point, this.center);
-    this.rotation.extractBasis(xAxis, yAxis, zAxis); // start at the center position of the OBB
-
-    result.copy(this.center); // project the target onto the OBB axes and walk towards that point
-
-    var x = MathUtils.clamp(v1.dot(xAxis), -halfSize.x, halfSize.x);
-    result.add(xAxis.multiplyScalar(x));
-    var y = MathUtils.clamp(v1.dot(yAxis), -halfSize.y, halfSize.y);
-    result.add(yAxis.multiplyScalar(y));
-    var z = MathUtils.clamp(v1.dot(zAxis), -halfSize.z, halfSize.z);
-    result.add(zAxis.multiplyScalar(z));
-    return result;
-  },
-  containsPoint: function (point) {
-    v1.subVectors(point, this.center);
-    this.rotation.extractBasis(xAxis, yAxis, zAxis); // project v1 onto each axis and check if these points lie inside the OBB
-
-    return Math.abs(v1.dot(xAxis)) <= this.halfSize.x && Math.abs(v1.dot(yAxis)) <= this.halfSize.y && Math.abs(v1.dot(zAxis)) <= this.halfSize.z;
-  },
-  intersectsBox3: function (box3) {
-    return this.intersectsOBB(obb.fromBox3(box3));
-  },
-  intersectsSphere: function (sphere) {
-    // find the point on the OBB closest to the sphere center
-    this.clampPoint(sphere.center, closestPoint); // if that point is inside the sphere, the OBB and sphere intersect
-
-    return closestPoint.distanceToSquared(sphere.center) <= sphere.radius * sphere.radius;
-  },
-
-  /**
-   * Reference: OBB-OBB Intersection in Real-Time Collision Detection
-   * by Christer Ericson (chapter 4.4.1)
-   *
-   */
-  intersectsOBB: function (obb, epsilon = Number.EPSILON) {
-    // prepare data structures (the code uses the same nomenclature like the reference)
-    a.c = this.center;
-    a.e[0] = this.halfSize.x;
-    a.e[1] = this.halfSize.y;
-    a.e[2] = this.halfSize.z;
-    this.rotation.extractBasis(a.u[0], a.u[1], a.u[2]);
-    b.c = obb.center;
-    b.e[0] = obb.halfSize.x;
-    b.e[1] = obb.halfSize.y;
-    b.e[2] = obb.halfSize.z;
-    obb.rotation.extractBasis(b.u[0], b.u[1], b.u[2]); // compute rotation matrix expressing b in a's coordinate frame
-
-    for (let i = 0; i < 3; i++) {
-      for (let j = 0; j < 3; j++) {
-        R[i][j] = a.u[i].dot(b.u[j]);
-      }
-    } // compute translation vector
-
-
-    v1.subVectors(b.c, a.c); // bring translation into a's coordinate frame
-
-    t[0] = v1.dot(a.u[0]);
-    t[1] = v1.dot(a.u[1]);
-    t[2] = v1.dot(a.u[2]); // compute common subexpressions. Add in an epsilon term to
-    // counteract arithmetic errors when two edges are parallel and
-    // their cross product is (near) null
-
-    for (let i = 0; i < 3; i++) {
-      for (let j = 0; j < 3; j++) {
-        AbsR[i][j] = Math.abs(R[i][j]) + epsilon;
-      }
-    }
-
-    var ra, rb; // test axes L = A0, L = A1, L = A2
-
-    for (let i = 0; i < 3; i++) {
-      ra = a.e[i];
-      rb = b.e[0] * AbsR[i][0] + b.e[1] * AbsR[i][1] + b.e[2] * AbsR[i][2];
-      if (Math.abs(t[i]) > ra + rb) return false;
-    } // test axes L = B0, L = B1, L = B2
-
-
-    for (let i = 0; i < 3; i++) {
-      ra = a.e[0] * AbsR[0][i] + a.e[1] * AbsR[1][i] + a.e[2] * AbsR[2][i];
-      rb = b.e[i];
-      if (Math.abs(t[0] * R[0][i] + t[1] * R[1][i] + t[2] * R[2][i]) > ra + rb) return false;
-    } // test axis L = A0 x B0
-
-
-    ra = a.e[1] * AbsR[2][0] + a.e[2] * AbsR[1][0];
-    rb = b.e[1] * AbsR[0][2] + b.e[2] * AbsR[0][1];
-    if (Math.abs(t[2] * R[1][0] - t[1] * R[2][0]) > ra + rb) return false; // test axis L = A0 x B1
-
-    ra = a.e[1] * AbsR[2][1] + a.e[2] * AbsR[1][1];
-    rb = b.e[0] * AbsR[0][2] + b.e[2] * AbsR[0][0];
-    if (Math.abs(t[2] * R[1][1] - t[1] * R[2][1]) > ra + rb) return false; // test axis L = A0 x B2
-
-    ra = a.e[1] * AbsR[2][2] + a.e[2] * AbsR[1][2];
-    rb = b.e[0] * AbsR[0][1] + b.e[1] * AbsR[0][0];
-    if (Math.abs(t[2] * R[1][2] - t[1] * R[2][2]) > ra + rb) return false; // test axis L = A1 x B0
-
-    ra = a.e[0] * AbsR[2][0] + a.e[2] * AbsR[0][0];
-    rb = b.e[1] * AbsR[1][2] + b.e[2] * AbsR[1][1];
-    if (Math.abs(t[0] * R[2][0] - t[2] * R[0][0]) > ra + rb) return false; // test axis L = A1 x B1
-
-    ra = a.e[0] * AbsR[2][1] + a.e[2] * AbsR[0][1];
-    rb = b.e[0] * AbsR[1][2] + b.e[2] * AbsR[1][0];
-    if (Math.abs(t[0] * R[2][1] - t[2] * R[0][1]) > ra + rb) return false; // test axis L = A1 x B2
-
-    ra = a.e[0] * AbsR[2][2] + a.e[2] * AbsR[0][2];
-    rb = b.e[0] * AbsR[1][1] + b.e[1] * AbsR[1][0];
-    if (Math.abs(t[0] * R[2][2] - t[2] * R[0][2]) > ra + rb) return false; // test axis L = A2 x B0
-
-    ra = a.e[0] * AbsR[1][0] + a.e[1] * AbsR[0][0];
-    rb = b.e[1] * AbsR[2][2] + b.e[2] * AbsR[2][1];
-    if (Math.abs(t[1] * R[0][0] - t[0] * R[1][0]) > ra + rb) return false; // test axis L = A2 x B1
-
-    ra = a.e[0] * AbsR[1][1] + a.e[1] * AbsR[0][1];
-    rb = b.e[0] * AbsR[2][2] + b.e[2] * AbsR[2][0];
-    if (Math.abs(t[1] * R[0][1] - t[0] * R[1][1]) > ra + rb) return false; // test axis L = A2 x B2
-
-    ra = a.e[0] * AbsR[1][2] + a.e[1] * AbsR[0][2];
-    rb = b.e[0] * AbsR[2][1] + b.e[1] * AbsR[2][0];
-    if (Math.abs(t[1] * R[0][2] - t[0] * R[1][2]) > ra + rb) return false; // since no separating axis is found, the OBBs must be intersecting
-
-    return true;
-  },
-
-  /**
-   * Reference: Testing Box Against Plane in Real-Time Collision Detection
-   * by Christer Ericson (chapter 5.2.3)
-   */
-  intersectsPlane: function (plane) {
-    this.rotation.extractBasis(xAxis, yAxis, zAxis); // compute the projection interval radius of this OBB onto L(t) = this->center + t * p.normal;
-
-    const r = this.halfSize.x * Math.abs(plane.normal.dot(xAxis)) + this.halfSize.y * Math.abs(plane.normal.dot(yAxis)) + this.halfSize.z * Math.abs(plane.normal.dot(zAxis)); // compute distance of the OBB's center from the plane
-
-    const d = plane.normal.dot(this.center) - plane.constant; // Intersection occurs when distance d falls within [-r,+r] interval
-
-    return Math.abs(d) <= r;
-  },
-
-  /**
-   * Performs a ray/OBB intersection test and stores the intersection point
-   * to the given 3D vector. If no intersection is detected, *null* is returned.
-   */
-  intersectRay: function (ray, result) {
-    // the idea is to perform the intersection test in the local space
-    // of the OBB.
-    this.getSize(size);
-    aabb.setFromCenterAndSize(v1.set(0, 0, 0), size); // create a 4x4 transformation matrix
-
-    matrix4FromRotationMatrix(matrix, this.rotation);
-    matrix.setPosition(this.center); // transform ray to the local space of the OBB
-
-    inverse.copy(matrix).invert();
-    localRay.copy(ray).applyMatrix4(inverse); // perform ray <-> AABB intersection test
-
-    if (localRay.intersectBox(aabb, result)) {
-      // transform the intersection point back to world space
-      return result.applyMatrix4(matrix);
-    } else {
-      return null;
-    }
-  },
-
-  /**
-   * Performs a ray/OBB intersection test. Returns either true or false if
-   * there is a intersection or not.
-   */
-  intersectsRay: function (ray) {
-    return this.intersectRay(ray, v1) !== null;
-  },
-  fromBox3: function (box3) {
-    box3.getCenter(this.center);
-    box3.getSize(this.halfSize).multiplyScalar(0.5);
-    this.rotation.identity();
-    return this;
-  },
-  equals: function (obb) {
-    return obb.center.equals(this.center) && obb.halfSize.equals(this.halfSize) && obb.rotation.equals(this.rotation);
-  },
-  applyMatrix4: function (matrix) {
-    var e = matrix.elements;
-    var sx = v1.set(e[0], e[1], e[2]).length();
-    var sy = v1.set(e[4], e[5], e[6]).length();
-    var sz = v1.set(e[8], e[9], e[10]).length();
-    var det = matrix.determinant();
-    if (det < 0) sx = -sx;
-    rotationMatrix.setFromMatrix4(matrix);
-    var invSX = 1 / sx;
-    var invSY = 1 / sy;
-    var invSZ = 1 / sz;
-    rotationMatrix.elements[0] *= invSX;
-    rotationMatrix.elements[1] *= invSX;
-    rotationMatrix.elements[2] *= invSX;
-    rotationMatrix.elements[3] *= invSY;
-    rotationMatrix.elements[4] *= invSY;
-    rotationMatrix.elements[5] *= invSY;
-    rotationMatrix.elements[6] *= invSZ;
-    rotationMatrix.elements[7] *= invSZ;
-    rotationMatrix.elements[8] *= invSZ;
-    this.rotation.multiply(rotationMatrix);
-    this.halfSize.x *= sx;
-    this.halfSize.y *= sy;
-    this.halfSize.z *= sz;
-    v1.setFromMatrixPosition(matrix);
-    this.center.add(v1);
-    return this;
-  }
-});
-
-function matrix4FromRotationMatrix(matrix4, matrix3) {
-  var e = matrix4.elements;
-  var me = matrix3.elements;
-  e[0] = me[0];
-  e[1] = me[1];
-  e[2] = me[2];
-  e[3] = 0;
-  e[4] = me[3];
-  e[5] = me[4];
-  e[6] = me[5];
-  e[7] = 0;
-  e[8] = me[6];
-  e[9] = me[7];
-  e[10] = me[8];
-  e[11] = 0;
-  e[12] = 0;
-  e[13] = 0;
-  e[14] = 0;
-  e[15] = 1;
-}
-
-var obb = new OBB();
-
-export { OBB };

package/math/Octree.cjs.js

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0});var e=require("three"),t=require("./Capsule.cjs.js"),n=function(){var n=new e.Vector3,r=new e.Vector3,i=new e.Plane,s=new e.Line3,a=new e.Line3,o=new e.Sphere,l=new t.Capsule;function h(e){this.triangles=[],this.box=e,this.subTrees=[]}return Object.assign(h.prototype,{addTriangle:function(t){return this.bounds||(this.bounds=new e.Box3),this.bounds.min.x=Math.min(this.bounds.min.x,t.a.x,t.b.x,t.c.x),this.bounds.min.y=Math.min(this.bounds.min.y,t.a.y,t.b.y,t.c.y),this.bounds.min.z=Math.min(this.bounds.min.z,t.a.z,t.b.z,t.c.z),this.bounds.max.x=Math.max(this.bounds.max.x,t.a.x,t.b.x,t.c.x),this.bounds.max.y=Math.max(this.bounds.max.y,t.a.y,t.b.y,t.c.y),this.bounds.max.z=Math.max(this.bounds.max.z,t.a.z,t.b.z,t.c.z),this.triangles.push(t),this},calcBox:function(){return this.box=this.bounds.clone(),this.box.min.x-=.01,this.box.min.y-=.01,this.box.min.z-=.01,this},split:function(t){if(this.box){var i,s,a,o=[],l=r.copy(this.box.max).sub(this.box.min).multiplyScalar(.5);for(let t=0;t<2;t++)for(let r=0;r<2;r++)for(let a=0;a<2;a++)i=new e.Box3,s=n.set(t,r,a),i.min.copy(this.box.min).add(s.multiply(l)),i.max.copy(i.min).add(l),o.push(new h(i));for(;a=this.triangles.pop();)for(let e=0;e<o.length;e++)o[e].box.intersectsTriangle(a)&&o[e].triangles.push(a);for(let e=0;e<o.length;e++){var u=o[e].triangles.length;u>8&&t<16&&o[e].split(t+1),0!=u&&this.subTrees.push(o[e])}return this}},build:function(){return this.calcBox(),this.split(0),this},getRayTriangles:function(e,t){for(let r=0;r<this.subTrees.length;r++){var n=this.subTrees[r];if(e.intersectsBox(n.box))if(n.triangles.length>0)for(let e=0;e<n.triangles.length;e++)-1===t.indexOf(n.triangles[e])&&t.push(n.triangles[e]);else n.getRayTriangles(e,t)}return t},triangleCapsuleIntersect:function(e,t){var r,o,l,h;t.getPlane(i);var u=i.distanceToPoint(e.start)-e.radius,c=i.distanceToPoint(e.end)-e.radius;if(u>0&&c>0||u<-e.radius&&c<-e.radius)return!1;var g=Math.abs(u/(Math.abs(u)+Math.abs(c))),d=n.copy(e.start).lerp(e.end,g);if(t.containsPoint(d))return{normal:i.normal.clone(),point:d.clone(),depth:Math.abs(Math.min(u,c))};var p=e.radius*e.radius;l=s.set(e.start,e.end);var b=[[t.a,t.b],[t.b,t.c],[t.c,t.a]];for(let t=0;t<b.length;t++)if(h=a.set(b[t][0],b[t][1]),[r,o]=e.lineLineMinimumPoints(l,h),r.distanceToSquared(o)<p)return{normal:r.clone().sub(o).normalize(),point:o.clone(),depth:e.radius-r.distanceTo(o)};return!1},triangleSphereIntersect:function(e,t){if(t.getPlane(i),!e.intersectsPlane(i))return!1;var a=Math.abs(i.distanceToSphere(e)),o=e.radius*e.radius-a*a,l=i.projectPoint(e.center,n);if(t.containsPoint(e.center))return{normal:i.normal.clone(),point:l.clone(),depth:Math.abs(i.distanceToSphere(e))};var h=[[t.a,t.b],[t.b,t.c],[t.c,t.a]];for(let t=0;t<h.length;t++){s.set(h[t][0],h[t][1]),s.closestPointToPoint(l,!0,r);var u=r.distanceToSquared(e.center);if(u<o)return{normal:e.center.clone().sub(r).normalize(),point:r.clone(),depth:e.radius-Math.sqrt(u)}}return!1},getSphereTriangles:function(e,t){for(let r=0;r<this.subTrees.length;r++){var n=this.subTrees[r];if(e.intersectsBox(n.box))if(n.triangles.length>0)for(let e=0;e<n.triangles.length;e++)-1===t.indexOf(n.triangles[e])&&t.push(n.triangles[e]);else n.getSphereTriangles(e,t)}},getCapsuleTriangles:function(e,t){for(let r=0;r<this.subTrees.length;r++){var n=this.subTrees[r];if(e.intersectsBox(n.box))if(n.triangles.length>0)for(let e=0;e<n.triangles.length;e++)-1===t.indexOf(n.triangles[e])&&t.push(n.triangles[e]);else n.getCapsuleTriangles(e,t)}},sphereIntersect(e){o.copy(e);var t,n=[],r=!1;this.getSphereTriangles(e,n);for(let e=0;e<n.length;e++)(t=this.triangleSphereIntersect(o,n[e]))&&(r=!0,o.center.add(t.normal.multiplyScalar(t.depth)));if(r){var i=o.center.clone().sub(e.center),s=i.length();return{normal:i.normalize(),depth:s}}return!1},capsuleIntersect:function(t){l.copy(t);var r,i=[],s=!1;this.getCapsuleTriangles(l,i);for(let e=0;e<i.length;e++)(r=this.triangleCapsuleIntersect(l,i[e]))&&(s=!0,l.translate(r.normal.multiplyScalar(r.depth)));if(s){var a=l.getCenter(new e.Vector3).sub(t.getCenter(n)),o=a.length();return{normal:a.normalize(),depth:o}}return!1},rayIntersect:function(e){if(0!==e.direction.length()){var t,r,i,s=[],a=1e100;this.getRayTriangles(e,s);for(let l=0;l<s.length;l++)if(i=e.intersectTriangle(s[l].a,s[l].b,s[l].c,!0,n)){var o=i.sub(e.origin).length();a>o&&(r=i.clone().add(e.origin),a=o,t=s[l])}return a<1e100&&{distance:a,triangle:t,position:r}}},fromGraphNode:function(t){return t.traverse((t=>{if("Mesh"===t.type){t.updateMatrix(),t.updateWorldMatrix();var n,r=!1;t.geometry.index?(r=!0,n=t.geometry.clone().toNonIndexed()):n=t.geometry;var i=n.attributes.position.array,s=t.matrixWorld;for(let t=0;t<i.length;t+=9){var a=new e.Vector3(i[t],i[t+1],i[t+2]),o=new e.Vector3(i[t+3],i[t+4],i[t+5]),l=new e.Vector3(i[t+6],i[t+7],i[t+8]);a.applyMatrix4(s),o.applyMatrix4(s),l.applyMatrix4(s),this.addTriangle(new e.Triangle(a,o,l))}r&&n.dispose()}})),this.build(),this}}),h}();exports.Octree=n;

package/math/Octree.d.ts

@@ -1,24 +0,0 @@
-import { Triangle, Box3, Ray, Sphere, Object3D } from 'three';
-
-import { Capsule } from './Capsule';
-
-export class Octree {
-    constructor(box?: Box3);
-    triangles: Triangle[];
-    box: Box3;
-    subTrees: Octree[];
-
-    addTriangle(triangle: Triangle): this;
-    calcBox(): this;
-    split(level: number): this;
-    build(): this;
-    getRayTriangles(ray: Ray, triangles: Triangle[]): Triangle[];
-    triangleCapsuleIntersect(capsule: Capsule, triangle: Triangle): any;
-    triangleSphereIntersect(sphere: Sphere, triangle: Triangle): any;
-    getSphereTriangles(sphere: Sphere, triangles: Triangle[]): Triangle[];
-    getCapsuleTriangles(capsule: Capsule, triangles: Triangle[]): Triangle[];
-    sphereIntersect(sphere: Sphere): any;
-    capsuleIntersect(capsule: Capsule): any;
-    rayIntersect(ray: Ray): any;
-    fromGraphNode(group: Object3D): this;
-}

package/math/Octree.js

@@ -1,341 +0,0 @@
-import { Vector3, Plane, Line3, Sphere, Box3, Triangle } from 'three';
-import { Capsule } from './Capsule.js';
-
-var Octree = function () {
-  var _v1 = new Vector3();
-
-  var _v2 = new Vector3();
-
-  var _plane = new Plane();
-
-  var _line1 = new Line3();
-
-  var _line2 = new Line3();
-
-  var _sphere = new Sphere();
-
-  var _capsule = new Capsule();
-
-  function Octree(box) {
-    this.triangles = [];
-    this.box = box;
-    this.subTrees = [];
-  }
-
-  Object.assign(Octree.prototype, {
-    addTriangle: function (triangle) {
-      if (!this.bounds) this.bounds = new Box3();
-      this.bounds.min.x = Math.min(this.bounds.min.x, triangle.a.x, triangle.b.x, triangle.c.x);
-      this.bounds.min.y = Math.min(this.bounds.min.y, triangle.a.y, triangle.b.y, triangle.c.y);
-      this.bounds.min.z = Math.min(this.bounds.min.z, triangle.a.z, triangle.b.z, triangle.c.z);
-      this.bounds.max.x = Math.max(this.bounds.max.x, triangle.a.x, triangle.b.x, triangle.c.x);
-      this.bounds.max.y = Math.max(this.bounds.max.y, triangle.a.y, triangle.b.y, triangle.c.y);
-      this.bounds.max.z = Math.max(this.bounds.max.z, triangle.a.z, triangle.b.z, triangle.c.z);
-      this.triangles.push(triangle);
-      return this;
-    },
-    calcBox: function () {
-      this.box = this.bounds.clone(); // offset small ammount to account for regular grid
-
-      this.box.min.x -= 0.01;
-      this.box.min.y -= 0.01;
-      this.box.min.z -= 0.01;
-      return this;
-    },
-    split: function (level) {
-      if (!this.box) return;
-
-      var subTrees = [],
-          halfsize = _v2.copy(this.box.max).sub(this.box.min).multiplyScalar(0.5),
-          box,
-          v,
-          triangle;
-
-      for (let x = 0; x < 2; x++) {
-        for (let y = 0; y < 2; y++) {
-          for (let z = 0; z < 2; z++) {
-            box = new Box3();
-            v = _v1.set(x, y, z);
-            box.min.copy(this.box.min).add(v.multiply(halfsize));
-            box.max.copy(box.min).add(halfsize);
-            subTrees.push(new Octree(box));
-          }
-        }
-      }
-
-      while (triangle = this.triangles.pop()) {
-        for (let i = 0; i < subTrees.length; i++) {
-          if (subTrees[i].box.intersectsTriangle(triangle)) {
-            subTrees[i].triangles.push(triangle);
-          }
-        }
-      }
-
-      for (let i = 0; i < subTrees.length; i++) {
-        var len = subTrees[i].triangles.length;
-
-        if (len > 8 && level < 16) {
-          subTrees[i].split(level + 1);
-        }
-
-        if (len != 0) {
-          this.subTrees.push(subTrees[i]);
-        }
-      }
-
-      return this;
-    },
-    build: function () {
-      this.calcBox();
-      this.split(0);
-      return this;
-    },
-    getRayTriangles: function (ray, triangles) {
-      for (let i = 0; i < this.subTrees.length; i++) {
-        var subTree = this.subTrees[i];
-        if (!ray.intersectsBox(subTree.box)) continue;
-
-        if (subTree.triangles.length > 0) {
-          for (let j = 0; j < subTree.triangles.length; j++) {
-            if (triangles.indexOf(subTree.triangles[j]) === -1) triangles.push(subTree.triangles[j]);
-          }
-        } else {
-          subTree.getRayTriangles(ray, triangles);
-        }
-      }
-
-      return triangles;
-    },
-    triangleCapsuleIntersect: function (capsule, triangle) {
-      var point1, point2, line1, line2;
-      triangle.getPlane(_plane);
-      var d1 = _plane.distanceToPoint(capsule.start) - capsule.radius;
-      var d2 = _plane.distanceToPoint(capsule.end) - capsule.radius;
-
-      if (d1 > 0 && d2 > 0 || d1 < -capsule.radius && d2 < -capsule.radius) {
-        return false;
-      }
-
-      var delta = Math.abs(d1 / (Math.abs(d1) + Math.abs(d2)));
-
-      var intersectPoint = _v1.copy(capsule.start).lerp(capsule.end, delta);
-
-      if (triangle.containsPoint(intersectPoint)) {
-        return {
-          normal: _plane.normal.clone(),
-          point: intersectPoint.clone(),
-          depth: Math.abs(Math.min(d1, d2))
-        };
-      }
-
-      var r2 = capsule.radius * capsule.radius;
-      line1 = _line1.set(capsule.start, capsule.end);
-      var lines = [[triangle.a, triangle.b], [triangle.b, triangle.c], [triangle.c, triangle.a]];
-
-      for (let i = 0; i < lines.length; i++) {
-        line2 = _line2.set(lines[i][0], lines[i][1]);
-        [point1, point2] = capsule.lineLineMinimumPoints(line1, line2);
-
-        if (point1.distanceToSquared(point2) < r2) {
-          return {
-            normal: point1.clone().sub(point2).normalize(),
-            point: point2.clone(),
-            depth: capsule.radius - point1.distanceTo(point2)
-          };
-        }
-      }
-
-      return false;
-    },
-    triangleSphereIntersect: function (sphere, triangle) {
-      triangle.getPlane(_plane);
-      if (!sphere.intersectsPlane(_plane)) return false;
-      var depth = Math.abs(_plane.distanceToSphere(sphere));
-      var r2 = sphere.radius * sphere.radius - depth * depth;
-
-      var plainPoint = _plane.projectPoint(sphere.center, _v1);
-
-      if (triangle.containsPoint(sphere.center)) {
-        return {
-          normal: _plane.normal.clone(),
-          point: plainPoint.clone(),
-          depth: Math.abs(_plane.distanceToSphere(sphere))
-        };
-      }
-
-      var lines = [[triangle.a, triangle.b], [triangle.b, triangle.c], [triangle.c, triangle.a]];
-
-      for (let i = 0; i < lines.length; i++) {
-        _line1.set(lines[i][0], lines[i][1]);
-
-        _line1.closestPointToPoint(plainPoint, true, _v2);
-
-        var d = _v2.distanceToSquared(sphere.center);
-
-        if (d < r2) {
-          return {
-            normal: sphere.center.clone().sub(_v2).normalize(),
-            point: _v2.clone(),
-            depth: sphere.radius - Math.sqrt(d)
-          };
-        }
-      }
-
-      return false;
-    },
-    getSphereTriangles: function (sphere, triangles) {
-      for (let i = 0; i < this.subTrees.length; i++) {
-        var subTree = this.subTrees[i];
-        if (!sphere.intersectsBox(subTree.box)) continue;
-
-        if (subTree.triangles.length > 0) {
-          for (let j = 0; j < subTree.triangles.length; j++) {
-            if (triangles.indexOf(subTree.triangles[j]) === -1) triangles.push(subTree.triangles[j]);
-          }
-        } else {
-          subTree.getSphereTriangles(sphere, triangles);
-        }
-      }
-    },
-    getCapsuleTriangles: function (capsule, triangles) {
-      for (let i = 0; i < this.subTrees.length; i++) {
-        var subTree = this.subTrees[i];
-        if (!capsule.intersectsBox(subTree.box)) continue;
-
-        if (subTree.triangles.length > 0) {
-          for (let j = 0; j < subTree.triangles.length; j++) {
-            if (triangles.indexOf(subTree.triangles[j]) === -1) triangles.push(subTree.triangles[j]);
-          }
-        } else {
-          subTree.getCapsuleTriangles(capsule, triangles);
-        }
-      }
-    },
-
-    sphereIntersect(sphere) {
-      _sphere.copy(sphere);
-
-      var triangles = [],
-          result,
-          hit = false;
-      this.getSphereTriangles(sphere, triangles);
-
-      for (let i = 0; i < triangles.length; i++) {
-        if (result = this.triangleSphereIntersect(_sphere, triangles[i])) {
-          hit = true;
-
-          _sphere.center.add(result.normal.multiplyScalar(result.depth));
-        }
-      }
-
-      if (hit) {
-        var collisionVector = _sphere.center.clone().sub(sphere.center);
-
-        var depth = collisionVector.length();
-        return {
-          normal: collisionVector.normalize(),
-          depth: depth
-        };
-      }
-
-      return false;
-    },
-
-    capsuleIntersect: function (capsule) {
-      _capsule.copy(capsule);
-
-      var triangles = [],
-          result,
-          hit = false;
-      this.getCapsuleTriangles(_capsule, triangles);
-
-      for (let i = 0; i < triangles.length; i++) {
-        if (result = this.triangleCapsuleIntersect(_capsule, triangles[i])) {
-          hit = true;
-
-          _capsule.translate(result.normal.multiplyScalar(result.depth));
-        }
-      }
-
-      if (hit) {
-        var collisionVector = _capsule.getCenter(new Vector3()).sub(capsule.getCenter(_v1));
-
-        var depth = collisionVector.length();
-        return {
-          normal: collisionVector.normalize(),
-          depth: depth
-        };
-      }
-
-      return false;
-    },
-    rayIntersect: function (ray) {
-      if (ray.direction.length() === 0) return;
-      var triangles = [],
-          triangle,
-          position,
-          distance = 1e100,
-          result;
-      this.getRayTriangles(ray, triangles);
-
-      for (let i = 0; i < triangles.length; i++) {
-        result = ray.intersectTriangle(triangles[i].a, triangles[i].b, triangles[i].c, true, _v1);
-
-        if (result) {
-          var newdistance = result.sub(ray.origin).length();
-
-          if (distance > newdistance) {
-            position = result.clone().add(ray.origin);
-            distance = newdistance;
-            triangle = triangles[i];
-          }
-        }
-      }
-
-      return distance < 1e100 ? {
-        distance: distance,
-        triangle: triangle,
-        position: position
-      } : false;
-    },
-    fromGraphNode: function (group) {
-      group.traverse(obj => {
-        if (obj.type === 'Mesh') {
-          obj.updateMatrix();
-          obj.updateWorldMatrix();
-          var geometry,
-              isTemp = false;
-
-          if (obj.geometry.index) {
-            isTemp = true;
-            geometry = obj.geometry.clone().toNonIndexed();
-          } else {
-            geometry = obj.geometry;
-          }
-
-          var positions = geometry.attributes.position.array;
-          var transform = obj.matrixWorld;
-
-          for (let i = 0; i < positions.length; i += 9) {
-            var v1 = new Vector3(positions[i], positions[i + 1], positions[i + 2]);
-            var v2 = new Vector3(positions[i + 3], positions[i + 4], positions[i + 5]);
-            var v3 = new Vector3(positions[i + 6], positions[i + 7], positions[i + 8]);
-            v1.applyMatrix4(transform);
-            v2.applyMatrix4(transform);
-            v3.applyMatrix4(transform);
-            this.addTriangle(new Triangle(v1, v2, v3));
-          }
-
-          if (isTemp) {
-            geometry.dispose();
-          }
-        }
-      });
-      this.build();
-      return this;
-    }
-  });
-  return Octree;
-}();
-
-export { Octree };

package/math/SimplexNoise.cjs.js

@@ -1 +0,0 @@
-"use strict";function t(t){return t&&"object"==typeof t&&"default"in t?t:{default:t}}Object.defineProperty(exports,"__esModule",{value:!0});var e=t(require("@babel/runtime/helpers/defineProperty"));exports.SimplexNoise=class{constructor(t=Math){e.default(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]]),e.default(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]]),e.default(this,"p",[]),e.default(this,"perm",[]),e.default(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]]),e.default(this,"dot",((t,e,s)=>t[0]*e+t[1]*s)),e.default(this,"dot3",((t,e,s,h)=>t[0]*e+t[1]*s+t[2]*h)),e.default(this,"dot4",((t,e,s,h,r)=>t[0]*e+t[1]*s+t[2]*h+t[3]*r)),e.default(this,"noise",((t,e)=>{let s,h,r;const i=(t+e)*(.5*(Math.sqrt(3)-1)),o=Math.floor(t+i),l=Math.floor(e+i),d=(3-Math.sqrt(3))/6,a=(o+l)*d,p=t-(o-a),f=e-(l-a);let m=0,u=1;p>f&&(m=1,u=0);const n=p-m+d,M=f-u+d,c=p-1+2*d,g=f-1+2*d,q=255&o,x=255&l,b=this.perm[q+this.perm[x]]%12,y=this.perm[q+m+this.perm[x+u]]%12,j=this.perm[q+1+this.perm[x+1]]%12;let v=.5-p*p-f*f;v<0?s=0:(v*=v,s=v*v*this.dot(this.grad3[b],p,f));let P=.5-n*n-M*M;P<0?h=0:(P*=P,h=P*P*this.dot(this.grad3[y],n,M));let _=.5-c*c-g*g;return _<0?r=0:(_*=_,r=_*_*this.dot(this.grad3[j],c,g)),70*(s+h+r)})),e.default(this,"noise3d",((t,e,s)=>{let h,r,i,o;const l=(t+e+s)*(1/3),d=Math.floor(t+l),a=Math.floor(e+l),p=Math.floor(s+l),f=1/6,m=(d+a+p)*f,u=t-(d-m),n=e-(a-m),M=s-(p-m);let c,g,q,x,b,y;u>=n?n>=M?(c=1,g=0,q=0,x=1,b=1,y=0):u>=M?(c=1,g=0,q=0,x=1,b=0,y=1):(c=0,g=0,q=1,x=1,b=0,y=1):n<M?(c=0,g=0,q=1,x=0,b=1,y=1):u<M?(c=0,g=1,q=0,x=0,b=1,y=1):(c=0,g=1,q=0,x=1,b=1,y=0);const j=u-c+f,v=n-g+f,P=M-q+f,_=u-x+2*f,N=n-b+2*f,O=M-y+2*f,S=u-1+.5,k=n-1+.5,w=M-1+.5,z=255&d,A=255&a,B=255&p,C=this.perm[z+this.perm[A+this.perm[B]]]%12,D=this.perm[z+c+this.perm[A+g+this.perm[B+q]]]%12,E=this.perm[z+x+this.perm[A+b+this.perm[B+y]]]%12,F=this.perm[z+1+this.perm[A+1+this.perm[B+1]]]%12;let G=.6-u*u-n*n-M*M;G<0?h=0:(G*=G,h=G*G*this.dot3(this.grad3[C],u,n,M));let H=.6-j*j-v*v-P*P;H<0?r=0:(H*=H,r=H*H*this.dot3(this.grad3[D],j,v,P));let I=.6-_*_-N*N-O*O;I<0?i=0:(I*=I,i=I*I*this.dot3(this.grad3[E],_,N,O));let J=.6-S*S-k*k-w*w;return J<0?o=0:(J*=J,o=J*J*this.dot3(this.grad3[F],S,k,w)),32*(h+r+i+o)})),e.default(this,"noise4d",((t,e,s,h)=>{const r=this.grad4,i=this.simplex,o=this.perm,l=(Math.sqrt(5)-1)/4,d=(5-Math.sqrt(5))/20;let a,p,f,m,u;const n=(t+e+s+h)*l,M=Math.floor(t+n),c=Math.floor(e+n),g=Math.floor(s+n),q=Math.floor(h+n),x=(M+c+g+q)*d,b=t-(M-x),y=e-(c-x),j=s-(g-x),v=h-(q-x),P=(b>y?32:0)+(b>j?16:0)+(y>j?8:0)+(b>v?4:0)+(y>v?2:0)+(j>v?1:0);let _,N,O,S,k,w,z,A,B,C,D,E;_=i[P][0]>=3?1:0,N=i[P][1]>=3?1:0,O=i[P][2]>=3?1:0,S=i[P][3]>=3?1:0,k=i[P][0]>=2?1:0,w=i[P][1]>=2?1:0,z=i[P][2]>=2?1:0,A=i[P][3]>=2?1:0,B=i[P][0]>=1?1:0,C=i[P][1]>=1?1:0,D=i[P][2]>=1?1:0,E=i[P][3]>=1?1:0;const F=b-_+d,G=y-N+d,H=j-O+d,I=v-S+d,J=b-k+2*d,K=y-w+2*d,L=j-z+2*d,Q=v-A+2*d,R=b-B+3*d,T=y-C+3*d,U=j-D+3*d,V=v-E+3*d,W=b-1+4*d,X=y-1+4*d,Y=j-1+4*d,Z=v-1+4*d,$=255&M,tt=255&c,et=255&g,st=255&q,ht=o[$+o[tt+o[et+o[st]]]]%32,rt=o[$+_+o[tt+N+o[et+O+o[st+S]]]]%32,it=o[$+k+o[tt+w+o[et+z+o[st+A]]]]%32,ot=o[$+B+o[tt+C+o[et+D+o[st+E]]]]%32,lt=o[$+1+o[tt+1+o[et+1+o[st+1]]]]%32;let dt=.6-b*b-y*y-j*j-v*v;dt<0?a=0:(dt*=dt,a=dt*dt*this.dot4(r[ht],b,y,j,v));let at=.6-F*F-G*G-H*H-I*I;at<0?p=0:(at*=at,p=at*at*this.dot4(r[rt],F,G,H,I));let pt=.6-J*J-K*K-L*L-Q*Q;pt<0?f=0:(pt*=pt,f=pt*pt*this.dot4(r[it],J,K,L,Q));let ft=.6-R*R-T*T-U*U-V*V;ft<0?m=0:(ft*=ft,m=ft*ft*this.dot4(r[ot],R,T,U,V));let mt=.6-W*W-X*X-Y*Y-Z*Z;return mt<0?u=0:(mt*=mt,u=mt*mt*this.dot4(r[lt],W,X,Y,Z)),27*(a+p+f+m+u)}));for(let e=0;e<256;e++)this.p[e]=Math.floor(256*t.random());for(let t=0;t<512;t++)this.perm[t]=this.p[255&t]}};