@needle-tools/three 0.145.2 → 0.146.1

package/examples/js/math/Octree.js

@@ -1,19 +1,12 @@
 ( function () {
 
 	const _v1 = new THREE.Vector3();
-
 	const _v2 = new THREE.Vector3();
-
 	const _plane = new THREE.Plane();
-
 	const _line1 = new THREE.Line3();
-
 	const _line2 = new THREE.Line3();
-
 	const _sphere = new THREE.Sphere();
-
 	const _capsule = new THREE.Capsule();
-
 	class Octree {
 
 		constructor( box ) {
@@ -23,7 +16,6 @@
 			this.subTrees = [];
 
 		}
-
 		addTriangle( triangle ) {
 
 			if ( ! this.bounds ) this.bounds = new THREE.Box3();
@@ -37,25 +29,22 @@
 			return this;
 
 		}
-
 		calcBox() {
 
-			this.box = this.bounds.clone(); // offset small ammount to account for regular grid
+			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( level ) {
 
 			if ( ! this.box ) return;
 			const subTrees = [];
-
 			const halfsize = _v2.copy( this.box.max ).sub( this.box.min ).multiplyScalar( 0.5 );
-
 			for ( let x = 0; x < 2; x ++ ) {
 
 				for ( let y = 0; y < 2; y ++ ) {
@@ -63,9 +52,7 @@
 					for ( let z = 0; z < 2; z ++ ) {
 
 						const box = new THREE.Box3();
-
 						const 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 ) );
@@ -77,7 +64,6 @@
 			}
 
 			let triangle;
-
 			while ( triangle = this.triangles.pop() ) {
 
 				for ( let i = 0; i < subTrees.length; i ++ ) {
@@ -95,7 +81,6 @@
 			for ( let i = 0; i < subTrees.length; i ++ ) {
 
 				const len = subTrees[ i ].triangles.length;
-
 				if ( len > 8 && level < 16 ) {
 
 					subTrees[ i ].split( level + 1 );
@@ -113,7 +98,6 @@
 			return this;
 
 		}
-
 		build() {
 
 			this.calcBox();
@@ -121,14 +105,12 @@
 			return this;
 
 		}
-
 		getRayTriangles( ray, triangles ) {
 
 			for ( let i = 0; i < this.subTrees.length; i ++ ) {
 
 				const subTree = this.subTrees[ i ];
 				if ( ! ray.intersectsBox( subTree.box ) ) continue;
-
 				if ( subTree.triangles.length > 0 ) {
 
 					for ( let j = 0; j < subTree.triangles.length; j ++ ) {
@@ -148,13 +130,11 @@
 			return triangles;
 
 		}
-
 		triangleCapsuleIntersect( capsule, triangle ) {
 
 			triangle.getPlane( _plane );
 			const d1 = _plane.distanceToPoint( capsule.start ) - capsule.radius;
 			const d2 = _plane.distanceToPoint( capsule.end ) - capsule.radius;
-
 			if ( d1 > 0 && d2 > 0 || d1 < - capsule.radius && d2 < - capsule.radius ) {
 
 				return false;
@@ -162,9 +142,7 @@
 			}
 
 			const delta = Math.abs( d1 / ( Math.abs( d1 ) + Math.abs( d2 ) ) );
-
 			const intersectPoint = _v1.copy( capsule.start ).lerp( capsule.end, delta );
-
 			if ( triangle.containsPoint( intersectPoint ) ) {
 
 				return {
@@ -176,17 +154,12 @@
 			}
 
 			const r2 = capsule.radius * capsule.radius;
-
 			const line1 = _line1.set( capsule.start, capsule.end );
-
 			const lines = [[ triangle.a, triangle.b ], [ triangle.b, triangle.c ], [ triangle.c, triangle.a ]];
-
 			for ( let i = 0; i < lines.length; i ++ ) {
 
 				const line2 = _line2.set( lines[ i ][ 0 ], lines[ i ][ 1 ] );
-
 				const [ point1, point2 ] = capsule.lineLineMinimumPoints( line1, line2 );
-
 				if ( point1.distanceToSquared( point2 ) < r2 ) {
 
 					return {
@@ -202,16 +175,13 @@
 			return false;
 
 		}
-
 		triangleSphereIntersect( sphere, triangle ) {
 
 			triangle.getPlane( _plane );
 			if ( ! sphere.intersectsPlane( _plane ) ) return false;
 			const depth = Math.abs( _plane.distanceToSphere( sphere ) );
 			const r2 = sphere.radius * sphere.radius - depth * depth;
-
 			const plainPoint = _plane.projectPoint( sphere.center, _v1 );
-
 			if ( triangle.containsPoint( sphere.center ) ) {
 
 				return {
@@ -223,15 +193,11 @@
 			}
 
 			const 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 );
-
 				const d = _v2.distanceToSquared( sphere.center );
-
 				if ( d < r2 ) {
 
 					return {
@@ -247,14 +213,12 @@
 			return false;
 
 		}
-
 		getSphereTriangles( sphere, triangles ) {
 
 			for ( let i = 0; i < this.subTrees.length; i ++ ) {
 
 				const subTree = this.subTrees[ i ];
 				if ( ! sphere.intersectsBox( subTree.box ) ) continue;
-
 				if ( subTree.triangles.length > 0 ) {
 
 					for ( let j = 0; j < subTree.triangles.length; j ++ ) {
@@ -272,14 +236,12 @@
 			}
 
 		}
-
 		getCapsuleTriangles( capsule, triangles ) {
 
 			for ( let i = 0; i < this.subTrees.length; i ++ ) {
 
 				const subTree = this.subTrees[ i ];
 				if ( ! capsule.intersectsBox( subTree.box ) ) continue;
-
 				if ( subTree.triangles.length > 0 ) {
 
 					for ( let j = 0; j < subTree.triangles.length; j ++ ) {
@@ -297,22 +259,18 @@
 			}
 
 		}
-
 		sphereIntersect( sphere ) {
 
 			_sphere.copy( sphere );
-
 			const triangles = [];
 			let 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 ) );
 
 				}
@@ -322,7 +280,6 @@
 			if ( hit ) {
 
 				const collisionVector = _sphere.center.clone().sub( sphere.center );
-
 				const depth = collisionVector.length();
 				return {
 					normal: collisionVector.normalize(),
@@ -334,22 +291,18 @@
 			return false;
 
 		}
-
 		capsuleIntersect( capsule ) {
 
 			_capsule.copy( capsule );
-
 			const triangles = [];
 			let 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 ) );
 
 				}
@@ -359,7 +312,6 @@
 			if ( hit ) {
 
 				const collisionVector = _capsule.getCenter( new THREE.Vector3() ).sub( capsule.getCenter( _v1 ) );
-
 				const depth = collisionVector.length();
 				return {
 					normal: collisionVector.normalize(),
@@ -371,7 +323,6 @@
 			return false;
 
 		}
-
 		rayIntersect( ray ) {
 
 			if ( ray.direction.length() === 0 ) return;
@@ -380,15 +331,12 @@
 				position,
 				distance = 1e100;
 			this.getRayTriangles( ray, triangles );
-
 			for ( let i = 0; i < triangles.length; i ++ ) {
 
 				const result = ray.intersectTriangle( triangles[ i ].a, triangles[ i ].b, triangles[ i ].c, true, _v1 );
-
 				if ( result ) {
 
 					const newdistance = result.sub( ray.origin ).length();
-
 					if ( distance > newdistance ) {
 
 						position = result.clone().add( ray.origin );
@@ -408,7 +356,6 @@
 			} : false;
 
 		}
-
 		fromGraphNode( group ) {
 
 			group.updateWorldMatrix( true, true );
@@ -418,7 +365,6 @@
 
 					let geometry,
 						isTemp = false;
-
 					if ( obj.geometry.index !== null ) {
 
 						isTemp = true;
@@ -431,7 +377,6 @@
 					}
 
 					const positionAttribute = geometry.getAttribute( 'position' );
-
 					for ( let i = 0; i < positionAttribute.count; i += 3 ) {
 
 						const v1 = new THREE.Vector3().fromBufferAttribute( positionAttribute, i );