@woosh/meep-engine 2.67.0 → 2.69.0

package/src/engine/graphics/geometry/buffered/query/ClippingPlaneContainmentComputingVisitor.js

@@ -1,195 +0,0 @@
-import { aabb3_compute_plane_side } from "../../../../../core/geom/3d/aabb/aabb3_compute_plane_side.js";
-import { NodeType } from "../../../../../core/bvh2/binary/NodeType.js";
-import { computeTrianglePlaneSide } from "../../../../../core/geom/3d/triangle/computeTrianglePlaneSide.js";
-import { GeometrySpatialAcceleratorVisitor } from "./GeometryVisitor.js";
-
-export class ClippingPlaneContainmentComputingVisitor extends GeometrySpatialAcceleratorVisitor {
-    constructor() {
-        super();
-
-        /**
-         * @private
-         * @type {Plane[]}
-         */
-        this.planes = [];
-
-        /**
-         *
-         * @private
-         * @type {number}
-         */
-        this.plane_count = 0;
-
-        this.__hit_count_in = 0;
-        this.__hit_count_out = 0;
-        this.__hit_count_intersect = 0;
-    }
-
-    reset() {
-        this.__hit_count_in = 0;
-        this.__hit_count_intersect = 0;
-        this.__hit_count_out = 0;
-    }
-
-    /**
-     *
-     * @returns {number}
-     */
-    getContainment() {
-        if (this.__hit_count_out === 0) {
-            if (this.__hit_count_intersect > 0) {
-                return 0;
-            } else {
-                // fully in
-                return 1;
-            }
-        } else {
-            if (this.__hit_count_intersect > 0 || this.__hit_count_in > 0) {
-                return 0;
-            } else {
-                // fully out
-                return -1;
-            }
-        }
-    }
-
-    /**
-     * @param {Plane[]} planes
-     */
-    setPlanes(planes) {
-        this.planes = planes;
-        this.plane_count = planes.length;
-    }
-
-
-    visit(address, type) {
-        const root = this.__root;
-
-        const data = root.data;
-        const binaryNodeCount = root.binaryNodeCount;
-
-        const planes = this.planes;
-        const plane_count = this.plane_count;
-
-        let intersect_flag = false;
-        if (type === NodeType.LEAF) {
-            // check triangle intersection
-
-            const index = address / 6 - binaryNodeCount;
-
-            const index3 = index * 3;
-
-            const indices = this.__buffer_indices;
-
-            const a = indices[index3];
-            const b = indices[index3 + 1];
-            const c = indices[index3 + 2];
-
-            const vertices = this.__buffer_vertices;
-
-            const stride = this.__buffer_vertex_stride;
-            const offset = this.__buffer_position_offset;
-
-            const a_address = a * stride + offset;
-            const b_address = b * stride + offset;
-            const c_address = c * stride + offset;
-
-            const ax = vertices[a_address];
-            const ay = vertices[a_address + 1];
-            const az = vertices[a_address + 2];
-
-            const bx = vertices[b_address];
-            const by = vertices[b_address + 1];
-            const bz = vertices[b_address + 2];
-
-            const cx = vertices[c_address];
-            const cy = vertices[c_address + 1];
-            const cz = vertices[c_address + 2];
-
-            for (let i = 0; i < plane_count; i++) {
-                const plane = planes[i];
-
-                const plane_normal_x = plane.normal.x;
-                const plane_normal_y = plane.normal.y;
-                const plane_normal_z = plane.normal.z;
-                const plane_constant = plane.constant;
-
-                const side = computeTrianglePlaneSide(
-                    plane_normal_x,
-                    plane_normal_y,
-                    plane_normal_z,
-                    plane_constant,
-                    ax, ay, az,
-                    bx, by, bz,
-                    cx, cy, cz
-                );
-
-                if (side === -3) {
-                    // fully outside
-                    this.__hit_count_out++;
-                    return false;
-                } else if (side < 3) {
-                    intersect_flag = true;
-                }
-            }
-
-            if (intersect_flag) {
-                this.__hit_count_intersect++;
-            } else {
-                this.__hit_count_in++;
-            }
-
-            return false;
-        } else {
-            // this is an intermediate node (binary node)
-
-            // check AABB intersection
-
-
-            const x0 = data[address];
-            const y0 = data[address + 1];
-            const z0 = data[address + 2];
-            const x1 = data[address + 3];
-            const y1 = data[address + 4];
-            const z1 = data[address + 5];
-
-
-            for (let i = 0; i < plane_count; i++) {
-                const plane = planes[i];
-
-                const plane_normal_x = plane.normal.x;
-                const plane_normal_y = plane.normal.y;
-                const plane_normal_z = plane.normal.z;
-                const plane_constant = plane.constant;
-
-                const side = aabb3_compute_plane_side(
-                    plane_normal_x,
-                    plane_normal_y,
-                    plane_normal_z,
-                    plane_constant,
-
-                    x0, y0, z0,
-                    x1, y1, z1
-                );
-
-                if (side === -2) {
-                    this.__hit_count_out++;
-
-                    return false;
-                } else if (side === 0) {
-                    intersect_flag = true;
-                }
-            }
-
-            if (intersect_flag) {
-                return true;
-            } else {
-                // no need to traverse further down, the whole node is in
-                this.__hit_count_in++;
-                return false;
-            }
-        }
-
-
-    }
-}

package/src/engine/graphics/geometry/buffered/query/GeometryVisitor.js

@@ -1,87 +0,0 @@
-import { IndexedBinaryBVHVisitor } from "../../../../../core/bvh2/binary/IndexedBinaryBVHVisitor.js";
-
-export class GeometrySpatialAcceleratorVisitor extends IndexedBinaryBVHVisitor {
-    constructor() {
-        super();
-
-
-        /**
-         * @protected
-         * @type {THREE.BufferGeometry}
-         */
-        this.__geometry = null;
-
-        /**
-         *
-         * @type {number[]}
-         * @protected
-         */
-        this.__buffer_indices = null;
-
-        /**
-         *
-         * @type {number[]}
-         * @protected
-         */
-        this.__buffer_vertices = null;
-
-        /**
-         *
-         * @type {number}
-         * @protected
-         */
-        this.__buffer_vertex_stride = 3;
-
-        /**
-         *
-         * @type {number}
-         * @protected
-         */
-        this.__buffer_position_offset = 0;
-
-        /**
-         * @protected
-         * @type {IndexedBinaryBVH}
-         */
-        this.__root = null;
-    }
-
-    /**
-     * @param {IndexedBinaryBVH} root
-     */
-    setRoot(root) {
-        this.__root = root;
-    }
-
-
-    /**
-     * @param {THREE.BufferGeometry} geometry
-     */
-    setGeometry(geometry) {
-        this.geometry = geometry;
-
-        const index_attribute = geometry.getIndex();
-
-        if (index_attribute) {
-            this.__buffer_indices = index_attribute.array;
-        } else {
-            // no index attribute
-            this.__buffer_indices = null;
-        }
-
-        const position_attribute = geometry.getAttribute('position');
-
-        if (position_attribute.isInterleavedBufferAttribute) {
-            const data = position_attribute.data;
-
-            this.__buffer_vertices = data.array;
-            this.__buffer_vertex_stride = data.stride;
-            this.__buffer_position_offset = position_attribute.offset;
-        } else {
-            this.__buffer_vertices = position_attribute.array;
-            this.__buffer_vertex_stride = 3;
-            this.__buffer_position_offset = 0;
-        }
-    }
-
-}

package/src/engine/graphics/geometry/buffered/query/RaycastNearestHitComputingVisitor.js

@@ -1,206 +0,0 @@
-import { SurfacePoint3 } from "../../../../../core/geom/3d/SurfacePoint3.js";
-import { NodeType } from "../../../../../core/bvh2/binary/NodeType.js";
-import Vector3 from "../../../../../core/geom/Vector3.js";
-import { computeTriangleRayIntersection } from "../../../../../core/geom/3d/triangle/computeTriangleRayIntersection.js";
-import { GeometrySpatialAcceleratorVisitor } from "./GeometryVisitor.js";
-import { aabb3_intersects_ray } from "../../../../../core/geom/3d/aabb/aabb3_intersects_ray.js";
-import { assert } from "../../../../../core/assert.js";
-
-export class RaycastNearestHitComputingVisitor extends GeometrySpatialAcceleratorVisitor {
-    constructor() {
-        super();
-
-
-        /**
-         *
-         * @type {number}
-         * @private
-         */
-        this.__nearest_distance = Number.POSITIVE_INFINITY;
-
-        /**
-         * @readonly
-         * @type {SurfacePoint3}
-         * @private
-         */
-        this.__nearest_hit = new SurfacePoint3();
-
-        /**
-         * @readonly
-         * @type {SurfacePoint3}
-         * @private
-         */
-        this.__temp_hit = new SurfacePoint3();
-
-        /**
-         *
-         * @type {boolean}
-         * @private
-         */
-        this.__hit_found = false;
-
-        /**
-         * @readonly
-         * @type {Vector3}
-         * @private
-         */
-        this.__ray_origin = new Vector3();
-
-        /**
-         * @readonly
-         * @type {Vector3}
-         * @private
-         */
-        this.__ray_direction = new Vector3();
-    }
-
-    /**
-     *
-     * @param {number} origin_x
-     * @param {number} origin_y
-     * @param {number} origin_z
-     * @param {number} direction_x
-     * @param {number} direction_y
-     * @param {number} direction_z
-     */
-    setRay(origin_x, origin_y, origin_z, direction_x, direction_y, direction_z) {
-        this.__ray_origin.set(
-            origin_x,
-            origin_y,
-            origin_z
-        );
-
-        this.__ray_direction.set(
-            direction_x,
-            direction_y,
-            direction_z
-        );
-    }
-
-    reset() {
-        this.__nearest_distance = Number.POSITIVE_INFINITY;
-        this.__hit_found = false;
-    }
-
-    getNearestHit() {
-        return this.__nearest_hit;
-    }
-
-    isHitFound() {
-        return this.__hit_found;
-    }
-
-
-    visit(address, type) {
-        const root = this.__root;
-
-        const data = root.data;
-        const binaryNodeCount = root.binaryNodeCount;
-
-        const rayOrigin = this.__ray_origin;
-        const rayDirection = this.__ray_direction;
-
-        if (type === NodeType.LEAF) {
-            // do triangle test
-
-            const index = address / 6 - binaryNodeCount;
-
-            const index3 = index * 3;
-
-            const indices = this.__buffer_indices;
-
-            let a, b, c;
-
-            if (indices !== null) {
-                assert.lessThan(index3 + 2, indices.length, 'triangle index overflow, possibly geometry changed but tree was not rebuilt?');
-
-                a = indices[index3];
-                b = indices[index3 + 1];
-                c = indices[index3 + 2];
-            } else {
-                // implicit indices
-                a = index3;
-                b = index3 + 1;
-                c = index3 + 2;
-            }
-
-            const vertices = this.__buffer_vertices;
-
-            const stride = this.__buffer_vertex_stride;
-            const offset = this.__buffer_position_offset;
-
-            const a_address = a * stride + offset;
-            const b_address = b * stride + offset;
-            const c_address = c * stride + offset;
-
-            assert.lessThan(a_address + 2, vertices.length, 'a-vertex overflow');
-            assert.lessThan(b_address + 2, vertices.length, 'b-vertex overflow');
-            assert.lessThan(c_address + 2, vertices.length, 'c-vertex overflow');
-
-            const ax = vertices[a_address];
-            const ay = vertices[a_address + 1];
-            const az = vertices[a_address + 2];
-
-            const bx = vertices[b_address];
-            const by = vertices[b_address + 1];
-            const bz = vertices[b_address + 2];
-
-            const cx = vertices[c_address];
-            const cy = vertices[c_address + 1];
-            const cz = vertices[c_address + 2];
-
-            const temp_hit = this.__temp_hit;
-
-            if (computeTriangleRayIntersection(
-                temp_hit,
-                rayOrigin.x,
-                rayOrigin.y,
-                rayOrigin.z,
-                rayDirection.x,
-                rayDirection.y,
-                rayDirection.z,
-                ax, ay, az,
-                bx, by, bz,
-                cx, cy, cz
-            )) {
-                const d = temp_hit.position.distanceSqrTo(rayOrigin);
-
-                if (d < this.__nearest_distance) {
-                    this.__nearest_hit.copy(temp_hit);
-                    this.__nearest_hit.index = index;
-
-                    this.__nearest_distance = d;
-
-                    this.__hit_found = true;
-                }
-
-            }
-
-            return false;
-
-        } else {
-            // do AABB test
-
-            const x0 = data[address];
-            const y0 = data[address + 1];
-            const z0 = data[address + 2];
-            const x1 = data[address + 3];
-            const y1 = data[address + 4];
-            const z1 = data[address + 5];
-
-            return aabb3_intersects_ray(
-                x0, y0, z0,
-                x1, y1, z1,
-
-                rayOrigin.x,
-                rayOrigin.y,
-                rayOrigin.z,
-
-                rayDirection.x,
-                rayDirection.y,
-                rayDirection.z
-            );
-
-        }
-    }
-}

package/src/engine/graphics/geometry/bvh/BVHFromGeometry.js

@@ -1,72 +0,0 @@
-/**
- * Created by Alex on 02/09/2015.
- */
-import { BinaryNode } from '../../../../core/bvh2/BinaryNode.js';
-
-function faceToBox(f, vertices) {
-    const a = vertices[f.a];
-    const b = vertices[f.b];
-    const c = vertices[f.c];
-    //make a box
-    const x0 = Math.min(a.x, b.x, c.x),
-        y0 = Math.min(a.y, b.y, c.y),
-        z0 = Math.min(a.z, b.z, c.z),
-        x1 = Math.max(a.x, b.x, c.x),
-        y1 = Math.max(a.y, b.y, c.y),
-        z1 = Math.max(a.z, b.z, c.z);
-    return {
-        x0: x0,
-        y0: y0,
-        z0: z0,
-        x1: x1,
-        y1: y1,
-        z1: z1,
-        object: f
-    };
-}
-
-function fillTree(faces, vertices, tree) {
-    const numFaces = faces.length;
-    let a, b, c;
-    //make a box
-    let x0, y0, z0, x1, y1, z1;
-    let face;
-
-    function processLeaf(leaf, index) {
-        face = faces[index];
-        a = vertices[face.a];
-        b = vertices[face.b];
-        c = vertices[face.c];
-
-        //make a box
-        x0 = Math.min(a.x, b.x, c.x);
-        y0 = Math.min(a.y, b.y, c.y);
-        z0 = Math.min(a.z, b.z, c.z);
-        x1 = Math.max(a.x, b.x, c.x);
-        y1 = Math.max(a.y, b.y, c.y);
-        z1 = Math.max(a.z, b.z, c.z);
-
-        //set node
-        leaf.setBounds(x0, y0, z0, x1, y1, z1);
-        leaf.object = face;
-    }
-
-    tree.insertManyBoxes2(processLeaf, numFaces);
-}
-
-function bvhFromGeometry(geometry) {
-    //console.time("building geometry bvh");
-    const tree = new BinaryNode();
-    tree.setNegativelyInfiniteBounds();
-    const vertices = geometry.vertices;
-    const faces = geometry.faces;
-
-    fillTree(faces, vertices, tree);
-
-    //console.timeEnd("building geometry bvh");
-    //
-    //console.log("built bvh for " + faces.length + " faces");
-    return tree;
-}
-
-export default bvhFromGeometry;