@woosh/meep-engine 2.66.0 → 2.68.0

package/src/core/bvh2/BVHTasks.js

@@ -1,65 +0,0 @@
-import { RingBuffer } from "../collection/RingBuffer.js";
-import Task from "../process/task/Task.js";
-import { TaskSignal } from "../process/task/TaskSignal.js";
-import { optimize } from "./transform/RotationOptimizer.js";
-
-
-/**
- *
- * @param {BinaryNode} bvh
- * @param {number} iterationLength
- * @returns {Task}
- */
-export function buildTreeOptimizationTask(bvh, iterationLength) {
-
-    const buffer = new RingBuffer(10);
-
-    let cycles = 0;
-    let sameChangeCountCycles = 0;
-
-    //optimize bvh
-    const task = new Task({
-        name: "Optimization of Bounding Volume Hierarchy",
-
-        initializer(task, executor) {
-            cycles = 0;
-            sameChangeCountCycles = 0;
-            buffer.clear();
-        },
-
-        cycleFunction() {
-            const optimizationsDone = optimize(bvh, iterationLength);
-            if (optimizationsDone > 0) {
-                console.log('otimization step.. changes: ', optimizationsDone);
-
-                cycles += optimizationsDone;
-                if (buffer.contains(optimizationsDone)) {
-                    sameChangeCountCycles++;
-                    if (sameChangeCountCycles > 100) {
-                        console.warn("detected optimization oscillation after 100 cycles, terminating");
-                        //stuck in oscillation, probably
-                        return TaskSignal.EndSuccess;
-                    }
-                } else {
-                    //reset counter
-                    sameChangeCountCycles = 0;
-                }
-
-                buffer.push(optimizationsDone);
-
-                return TaskSignal.Continue;
-            } else {
-                return TaskSignal.EndSuccess;
-            }
-        },
-        computeProgress: function () {
-            if (iterationLength <= 0) {
-                return 0;
-            } else {
-                return cycles / iterationLength;
-            }
-        }
-    });
-
-    return task;
-}

package/src/core/bvh2/BinaryNode.d.ts

@@ -1,13 +0,0 @@
-import {Node} from "./Node";
-import {LeafNode} from "./LeafNode";
-
-export class BinaryNode<T = any> extends Node<T> {
-    left: Node<T>
-    right: Node<T>
-
-    traversePreOrderUsingStack(visitor: (node: Node<T>) => boolean, thisArg?: any): void
-
-    insert(x0: number, y0: number, z0: number, x1: number, y1: number, z1: number, value: T): LeafNode<T>
-
-    traverseRayLeafIntersections(startX: number, startY: number, startZ: number, directionX: number, directionY: number, directionZ: number, visitor: (node: LeafNode<T>) => any, thisArg?: any);
-}