@woosh/meep-engine 2.66.0 → 2.68.0

package/src/core/bvh2/traversal/ThreeClippingPlaneComputingBVHVisitor.js

@@ -1,384 +0,0 @@
-import { BVHVisitor } from "./BVHVisitor.js";
-import { read_frustum_planes_to_array } from "../../geom/3d/frustum/read_frustum_planes_to_array.js";
-import {
-    aabb3_detailed_volume_intersection_callback_based
-} from "./aabb3_detailed_volume_intersection_callback_based.js";
-import { v3_distance_above_plane } from "../../geom/vec3/v3_distance_above_plane.js";
-
-export class ThreeClippingPlaneComputingBVHVisitor extends BVHVisitor {
-    constructor() {
-        super();
-
-        /**
-         * @private
-         * @type {Frustum}
-         */
-        this.frustum = null;
-
-        /**
-         *
-         * @type {Plane[]}
-         * @private
-         */
-        this.__planes = [];
-
-        /**
-         *
-         * @type {number}
-         * @private
-         */
-        this.__planeCount = 0;
-
-        /**
-         *
-         * @type {Vector3}
-         * @private
-         */
-        this.__nearPlaneNormal = null;
-        /**
-         *
-         * @type {number}
-         * @private
-         */
-        this.__nearPlaneConstant = 0;
-
-        /**
-         *
-         * @type {Float32Array}
-         * @private
-         */
-        this.__planes_f32 = new Float32Array(24);
-
-        this.near = 0;
-        this.far = 0;
-    }
-
-    /**
-     *
-     * @param {Frustum} frustum
-     */
-    setFrustum(frustum) {
-        this.frustum = frustum;
-        const planes = frustum.planes;
-
-        this.__planes[0] = planes[0];
-        this.__planes[1] = planes[1];
-        this.__planes[2] = planes[2];
-        this.__planes[3] = planes[3];
-        this.__planes[4] = planes[5];
-
-        const nearPlane = planes[5];
-
-
-        this.__nearPlaneNormal = nearPlane.normal;
-        this.__nearPlaneConstant = nearPlane.constant;
-
-        this.__planeCount = 5;
-
-        read_frustum_planes_to_array(planes, this.__planes_f32);
-    }
-
-    /**
-     *
-     * @param {number} x
-     * @param {number} y
-     * @param {number} z
-     * @private
-     */
-    __process_point(x, y, z) {
-
-        // project onto "near" plane
-        const d = this.__distanceToNearPlane(x, y, z);
-
-        if (d < this.near) {
-            this.near = d;
-        }
-
-        if (d > this.far) {
-            this.far = d;
-        }
-
-        // ThreeClippingPlaneComputingBVHVisitor.DEBUG_POINTS_0.send3(x, y, z);
-    }
-
-    /**
-     *
-     * @param {number} x
-     * @param {number} y
-     * @param {number} z
-     * @return {number}
-     * @private
-     */
-    __distanceToNearPlane(x, y, z) {
-
-        const n = this.__nearPlaneNormal;
-
-        return v3_distance_above_plane(x, y, z, n.x, n.y, n.z, this.__nearPlaneConstant);
-    }
-
-    /**
-     * The algorithm has 3 phases:
-     * 1 ) test corners and record which corners are outside of which planes
-     * 2 ) test edges attached to outside corners
-     * 3 ) test planes attached to outside edges
-     *
-     * Progressive nature of the algorithm provides good efficiency, as additional phases are only invoked as needed. The algorithm also requires very little memory and is entirely recursion-free
-     * @param {AABB3} box
-     * @param {number} plane_mask
-     * @private
-     */
-    __traverseBox_Detailed(box, plane_mask) {
-
-        // make sure to include nearest corner
-        this.__traverseBoxNearCorner(box);
-
-
-        aabb3_detailed_volume_intersection_callback_based(
-            box.x0, box.y0, box.z0, box.x1, box.y1, box.z1,
-            plane_mask,
-            this.__planes_f32,
-            this.__planeCount,
-            this.__process_point,
-            this
-        );
-    }
-
-    /**
-     *
-     * @param {AABB3} box
-     * @private
-     */
-    __traverseBoxNearCorner(box) {
-
-        const normal = this.__nearPlaneNormal;
-
-        const plane_normal_x = normal.x;
-        const plane_normal_y = normal.y;
-        const plane_normal_z = normal.z;
-
-        const _x0 = box.x0;
-        const _y0 = box.y0;
-        const _z0 = box.z0;
-        const _x1 = box.x1;
-        const _y1 = box.y1;
-        const _z1 = box.z1;
-
-        let x0,
-            y0,
-            z0;
-
-        // construct nearest and farthest corners along the plane normal
-        if (plane_normal_x > 0) {
-            x0 = _x0;
-        } else {
-            x0 = _x1;
-        }
-
-        if (plane_normal_y > 0) {
-            y0 = _y0;
-        } else {
-            y0 = _y1;
-        }
-
-        if (plane_normal_z > 0) {
-            z0 = _z0;
-        } else {
-            z0 = _z1;
-        }
-
-        this.__process_point(x0, y0, z0);
-    }
-
-    /**
-     *
-     * @param {AABB3} box
-     * @private
-     */
-    __traverseBoxNearAndFarCorners(box) {
-        const normal = this.__nearPlaneNormal;
-
-        const plane_normal_x = normal.x;
-        const plane_normal_y = normal.y;
-        const plane_normal_z = normal.z;
-
-        const _x0 = box.x0;
-        const _y0 = box.y0;
-        const _z0 = box.z0;
-        const _x1 = box.x1;
-        const _y1 = box.y1;
-        const _z1 = box.z1;
-
-        let x0,
-            y0,
-            z0,
-            x1,
-            y1,
-            z1;
-
-        // construct nearest and farthest corners along the plane normal
-        if (plane_normal_x > 0) {
-            x0 = _x0;
-            x1 = _x1;
-        } else {
-            x0 = _x1;
-            x1 = _x0;
-        }
-
-        if (plane_normal_y > 0) {
-            y0 = _y0;
-            y1 = _y1;
-        } else {
-            y0 = _y1;
-            y1 = _y0;
-        }
-
-        if (plane_normal_z > 0) {
-            z0 = _z0;
-            z1 = _z1;
-        } else {
-            z0 = _z1;
-            z1 = _z0;
-        }
-
-        this.__process_point(x0, y0, z0);
-        this.__process_point(x1, y1, z1);
-    }
-
-
-    visitLeaf(node) {
-        // ThreeClippingPlaneComputingBVHVisitor.VISIT_COUNT_LEAF++;
-
-        let intersection_mask = 0;
-
-        const planeCount = this.__planeCount;
-        const planes = this.__planes;
-
-        //check planes first
-        for (let i = 0; i < planeCount; i++) {
-            const clipPlane = planes[i];
-
-            const planeSide = node.computePlaneSide(clipPlane);
-            if (planeSide < 0) {
-                return false;
-            } else if (planeSide === 0) {
-                intersection_mask |= 1 << i;
-            }
-
-        }
-
-        if (intersection_mask !== 0) {
-            // special case, box intersects one or more planes, compute clipping points
-            this.__traverseBox_Detailed(node, intersection_mask);
-        } else {
-            // box is fully within the frustum
-            this.__traverseBoxNearAndFarCorners(node);
-        }
-
-    }
-
-    visitBinary(node) {
-        const _x0 = node.x0;
-        const _y0 = node.y0;
-        const _z0 = node.z0;
-        const _x1 = node.x1;
-        const _y1 = node.y1;
-        const _z1 = node.z1;
-
-
-        const normal = this.__nearPlaneNormal;
-
-        const plane_normal_x = normal.x;
-        const plane_normal_y = normal.y;
-        const plane_normal_z = normal.z;
-
-        let x0,
-            y0,
-            z0,
-            x1,
-            y1,
-            z1;
-
-        // construct nearest and farthest corners along the plane normal
-        if (plane_normal_x > 0) {
-            x0 = _x0;
-            x1 = _x1;
-        } else {
-            x0 = _x1;
-            x1 = _x0;
-        }
-
-        if (plane_normal_y > 0) {
-            y0 = _y0;
-            y1 = _y1;
-        } else {
-            y0 = _y1;
-            y1 = _y0;
-        }
-
-        if (plane_normal_z > 0) {
-            z0 = _z0;
-            z1 = _z1;
-        } else {
-            z0 = _z1;
-            z1 = _z0;
-        }
-
-        const d_far = this.__distanceToNearPlane(x1, y1, z1);
-
-        if (d_far < 0) {
-            //behind near plane
-            return false;
-        }
-
-        const d_near = this.__distanceToNearPlane(x0, y0, z0);
-
-        //if all corners lie between already set clipping planes - we don't need to check children
-        if (!(d_near < this.near || d_far > this.far)) {
-            return false;
-        }
-
-        /**
-         *
-         * @type {Plane[]}
-         */
-        const planes = this.__planes;
-
-        let intersects = false;
-        //check planes
-        for (let i = 0; i < 4; i++) {
-            const clipPlane = planes[i];
-
-            const planeSide = node.computePlaneSide(clipPlane);
-
-            if (planeSide < 0) {
-                return false;
-            } else if (planeSide === 0) {
-                intersects = true;
-            }
-        }
-
-        if (intersects) {
-            // node intersects the frustum, continue traversal
-            return true;
-        } else {
-            // node is fully inside the frustum. No need to traverse further
-
-            if (d_near < this.near) {
-                this.near = d_near;
-            }
-
-            if (d_far > this.far) {
-                this.far = d_far;
-            }
-
-            return false;
-        }
-
-    }
-}
-
-// ThreeClippingPlaneComputingBVHVisitor.DEBUG_POINTS_0 = new Signal(); // DEBUG
-// ThreeClippingPlaneComputingBVHVisitor.DEBUG_POINTS_1 = new Signal(); // DEBUG
-// ThreeClippingPlaneComputingBVHVisitor.DEBUG_POINTS_2 = new Signal(); // DEBUG
-//
-// ThreeClippingPlaneComputingBVHVisitor.VISIT_COUNT_LEAF = 0; // DEBUG

package/src/core/bvh2/traversal/ThreeFrustumsIntersectionBVHVisitor.js

@@ -1,52 +0,0 @@
-import { BVHVisitor } from "./BVHVisitor.js";
-import { traverseBinaryNodeUsingVisitor } from "./traverseBinaryNodeUsingVisitor.js";
-
-export class ThreeFrustumsIntersectionBVHVisitor extends BVHVisitor {
-    constructor() {
-        super();
-
-        /**
-         * [plane_x, plane_y, plane_z, constant] collection, defining a frustum
-         * @private
-         * @type {ArrayLike<number>|number[]}
-         */
-        this.frustum = [];
-
-        /**
-         *
-         * @type {BVHVisitor}
-         */
-        this.collector = null;
-    }
-
-    /**
-     *
-     * @param {ArrayLike<number>|number[]|Float32Array} frustum
-     */
-    setFrustum(frustum) {
-        this.frustum = frustum;
-    }
-
-    visitLeaf(node) {
-
-        const degree = node.intersectFrustumDegree_array(this.frustum);
-
-        if (degree !== 0) {
-            // at least partially visible
-            this.collector.visitLeaf(node);
-        }
-    }
-
-    visitBinary(node) {
-
-        const degree = node.intersectFrustumDegree_array(this.frustum);
-
-        if (degree === 2) {
-            //completely inside, do fast traversal
-            traverseBinaryNodeUsingVisitor(node, this.collector);
-            return false;
-        }
-
-        return degree === 1;
-    }
-}

package/src/core/bvh2/traversal/bvh_traverse_pre_order_using_stack.js

@@ -1,43 +0,0 @@
-const stack = [];
-let stackPointer = 0;
-
-/**
- *
- * @param {BinaryNode} root
- * @param {function(BinaryNode|LeafNode):*} visitor
- * @param {*} [thisArg]
- * @return {number}
- */
-export function bvh_traverse_pre_order_using_stack(root, visitor, thisArg) {
-    let visitCount = 0;
-
-    const stackOffset = stackPointer;
-
-    stack[stackPointer++] = root;
-
-    let n;
-
-    while (stackPointer-- > stackOffset) {
-
-        visitCount++;
-
-        n = stack[stackPointer];
-
-        visitor.call(thisArg, n);
-
-        if (!n.isLeafNode) {
-            //a binary node
-            if (n.right !== null) {
-                stack[stackPointer++] = n.right;
-            }
-            if (n.left !== null) {
-                stack[stackPointer++] = n.left;
-            }
-        }
-    }
-
-    // drop stack frame
-    stackPointer = stackOffset;
-
-    return visitCount;
-}

package/src/core/bvh2/traversal/queryBinaryNode_ClippingPlanes.d.ts

@@ -1,5 +0,0 @@
-import {BinaryNode} from "../BinaryNode";
-import {Plane} from "three";
-import {LeafNode} from "../LeafNode";
-
-export function queryBinaryNode_ClippingPlanes(destination: LeafNode[], destinationOffset: number, root: BinaryNode, planes: Plane[]): number

package/src/core/bvh2/traversal/queryBinaryNode_ClippingPlanes.js

@@ -1,66 +0,0 @@
-/**
- *
- * @type {(BinaryNode|LeafNode)[]}
- */
-
-const stack = [];
-let stackPointer = 0;
-
-/**
- * @template T
- * @param {LeafNode<T>[]} destination
- * @param {number} destinationOffset
- * @param {BinaryNode<T>} root
- * @param {Plane[]} planes
- */
-export function queryBinaryNode_ClippingPlanes(destination, destinationOffset, root, planes) {
-
-    let n;
-
-    const plane_count = planes.length;
-
-    const stackOffset = stackPointer;
-
-    stack[stackPointer++] = root;
-
-    let i = 0;
-
-    stack_loop:while (stackPointer-- > stackOffset) {
-
-        n = stack[stackPointer];
-
-        for (let j = 0; j < plane_count; j++) {
-            const plane = planes[j];
-
-            const planeSide = n.computePlaneSide(plane);
-
-            if (planeSide < 0) {
-
-                continue stack_loop;
-            }
-        }
-
-        if (n.isBinaryNode) {
-
-            if (n.right !== null) {
-                stack[stackPointer++] = n.right;
-            }
-
-            if (n.left !== null) {
-                stack[stackPointer++] = n.left;
-            }
-        } else {
-
-            destination[destinationOffset + i] = n;
-
-            i++;
-        }
-
-    }
-
-    //drop the stack frame
-    stackPointer = stackOffset;
-
-    return i;
-
-}

package/src/core/bvh2/traversal/queryBinaryNode_CollectData.js

@@ -1,49 +0,0 @@
-/**
- *
- * @type {(BinaryNode|LeafNode)[]}
- */
-const stack = [];
-let stackPointer = 0;
-
-/**
- * @template T
- * @param {T[]} destination
- * @param {number} destinationOffset
- * @param {BinaryNode<T>} root
- */
-export function queryBinaryNode_CollectData(destination, destinationOffset, root) {
-    let n;
-    let i = 0;
-
-    const stackOffset = stackPointer;
-
-    stack[stackPointer++] = root;
-
-    while (stackPointer-- > stackOffset) {
-
-        n = stack[stackPointer];
-
-        if (n.isBinaryNode) {
-
-            if (n.right !== null) {
-                stack[stackPointer++] = n.right;
-            }
-
-            if (n.left !== null) {
-                stack[stackPointer++] = n.left;
-            }
-
-        } else {
-
-            destination[destinationOffset + i] = n.object;
-
-            i++;
-        }
-
-    }
-
-    //drop the stack frame
-    stackPointer = stackOffset;
-
-    return i;
-}

package/src/core/bvh2/traversal/queryBinaryNode_CollectLeaves.js

@@ -1,51 +0,0 @@
-
-/**
- *
- * @type {(BinaryNode|LeafNode)[]}
- */
-const stack = [];
-let stackPointer = 0;
-
-/**
- * @template T
- * @param {LeafNode<T>[]} destination
- * @param {number} destinationOffset
- * @param {BinaryNode<T>} root
- */
-export function queryBinaryNode_CollectLeaves(destination, destinationOffset, root){
-    let n;
-
-    const stackOffset = stackPointer;
-
-    stack[stackPointer++] = root;
-
-    let i = 0;
-
-    while (stackPointer-- > stackOffset) {
-
-        n = stack[stackPointer];
-
-        if (n.isBinaryNode) {
-
-            if (n.right !== null) {
-                stack[stackPointer++] = n.right;
-            }
-
-            if (n.left !== null) {
-                stack[stackPointer++] = n.left;
-            }
-
-        } else {
-
-            destination[destinationOffset + i] = n;
-
-            i++;
-        }
-
-    }
-
-    //drop the stack frame
-    stackPointer = stackOffset;
-
-    return i;
-}