@woosh/meep-engine 2.68.0 → 2.69.0

package/src/engine/graphics/geometry/bvh/buffered/BinaryBVHFromBufferGeometry.js

@@ -1,123 +0,0 @@
-/**
- * Created by Alex on 29/05/2016.
- */
-import IndexedBinaryBVH from '../../../../../core/bvh2/binary/IndexedBinaryBVH.js';
-import { min3 } from "../../../../../core/math/min3.js";
-import { max3 } from "../../../../../core/math/max3.js";
-
-/**
- *
- * @param {Float32Array|Float64Array|Array.<Number>} vertices
- * @param {Uint8Array|Uint16Array|Uint32Array|Array.<Number>} indices
- * @returns {IndexedBinaryBVH}
- */
-function buildUnsorted(vertices, indices) {
-    //
-    const numNodes = indices.length / 3;
-
-    const tree = new IndexedBinaryBVH();
-    tree.initialize(numNodes);
-
-    for (let i = 0; i < numNodes; i++) {
-
-        const index3 = i * 3;
-
-        // read triangle vertex indices
-        const iA = indices[index3];
-        const iB = indices[index3 + 1];
-        const iC = indices[index3 + 2];
-
-        const a = iA * 3;
-        const b = iB * 3;
-        const c = iC * 3;
-
-        // read actual positions of each vertex
-        const aX = vertices[a];
-        const aY = vertices[a + 1];
-        const aZ = vertices[a + 2];
-
-        const bX = vertices[b];
-        const bY = vertices[b + 1];
-        const bZ = vertices[b + 2];
-
-        const cX = vertices[c];
-        const cY = vertices[c + 1];
-        const cZ = vertices[c + 2];
-
-        // compute bounds of the triangle
-        const x0 = min3(aX, bX, cX);
-        const y0 = min3(aY, bY, cY);
-        const z0 = min3(aZ, bZ, cZ);
-
-        const x1 = max3(aX, bX, cX);
-        const y1 = max3(aY, bY, cY);
-        const z1 = max3(aZ, bZ, cZ);
-
-        tree.writeLeaf(i, x0, y0, z0, x1, y1, z1);
-    }
-
-    // finalize build
-    tree.unsortedBuiltIntermediate();
-
-    return tree;
-}
-
-/**
- *
- * @param {Float32Array|Float64Array|Array.<Number>} vertices
- * @returns {IndexedBinaryBVH}
- */
-export function buildUnsortedUnindexed(vertices) {
-    //
-    const numNodes = vertices.length / 9;
-
-    const tree = new IndexedBinaryBVH();
-    tree.initialize(numNodes);
-
-    for (let i = 0; i < numNodes; i++) {
-
-        const index3 = i * 3;
-
-        // read triangle vertex indices
-        const iA = index3;
-        const iB = index3 + 1;
-        const iC = index3 + 2;
-
-        const a = iA * 3;
-        const b = iB * 3;
-        const c = iC * 3;
-
-        // read actual positions of each vertex
-        const aX = vertices[a];
-        const aY = vertices[a + 1];
-        const aZ = vertices[a + 2];
-
-        const bX = vertices[b];
-        const bY = vertices[b + 1];
-        const bZ = vertices[b + 2];
-
-        const cX = vertices[c];
-        const cY = vertices[c + 1];
-        const cZ = vertices[c + 2];
-
-        // compute bounds of the triangle
-        const x0 = min3(aX, bX, cX);
-        const y0 = min3(aY, bY, cY);
-        const z0 = min3(aZ, bZ, cZ);
-
-        const x1 = max3(aX, bX, cX);
-        const y1 = max3(aY, bY, cY);
-        const z1 = max3(aZ, bZ, cZ);
-
-        tree.writeLeaf(i, x0, y0, z0, x1, y1, z1);
-    }
-
-    // finalize build
-    tree.unsortedBuiltIntermediate();
-
-    return tree;
-}
-
-export {
-    buildUnsorted
-};