@woosh/meep-engine 2.63.0 → 2.65.0

package/package.json

@@ -5,7 +5,7 @@
   "description": "Fully featured ECS game engine written in JavaScript",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.63.0",
+  "version": "2.65.0",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {

package/src/core/binary/UINT16_MAX.js

@@ -0,0 +1,5 @@
+/**
+ * equal to `Math.pow(2,16) - 1`
+ * @type {number}
+ */
+export const UINT16_MAX = 65535;

package/src/core/bvh2/BinaryNode.js

@@ -3,19 +3,19 @@
  */
 
 
-import {assert} from "../assert.js";
-import {arrayQuickSort} from "../collection/array/arrayQuickSort.js";
-import {aabb3_box_surface_area_2} from "../geom/3d/aabb/aabb3_box_surface_area_2.js";
-import {aabb3_combined_surface_area} from "../geom/3d/aabb/aabb3_combined_surface_area.js";
-import {aabb3_intersects_aabb3} from "../geom/3d/aabb/aabb3_intersects_aabb3.js";
-import {max2} from "../math/max2.js";
-import {min2} from "../math/min2.js";
-import {computeSampleStandardDeviation} from "../math/statistics/computeSampleStandardDeviation.js";
-import {isLeaf, LeafNode} from "./LeafNode.js";
-import {Node} from "./Node.js";
-import {surfaceAreaHeuristic} from "./sah/surfaceAreaHeuristic.js";
-import {BVHVisitor} from "./traversal/BVHVisitor.js";
-import {traverseBinaryNodeUsingVisitor} from "./traversal/traverseBinaryNodeUsingVisitor.js";
+import { assert } from "../assert.js";
+import { arrayQuickSort } from "../collection/array/arrayQuickSort.js";
+import { aabb3_box_surface_area_2 } from "../geom/3d/aabb/aabb3_box_surface_area_2.js";
+import { aabb3_combined_surface_area } from "../geom/3d/aabb/aabb3_combined_surface_area.js";
+import { aabb3_intersects_aabb3 } from "../geom/3d/aabb/aabb3_intersects_aabb3.js";
+import { max2 } from "../math/max2.js";
+import { min2 } from "../math/min2.js";
+import { computeSampleStandardDeviation } from "../math/statistics/computeSampleStandardDeviation.js";
+import { isLeaf, LeafNode } from "./LeafNode.js";
+import { Node } from "./Node.js";
+import { surfaceAreaHeuristic } from "./sah/surfaceAreaHeuristic.js";
+import { BVHVisitor } from "./traversal/BVHVisitor.js";
+import { traverseBinaryNodeUsingVisitor } from "./traversal/traverseBinaryNodeUsingVisitor.js";
 
 
 /**
@@ -37,7 +37,7 @@ let stackPointer = 0;
 const stack = [];
 
 /**
- * @deprecated use {@link ExplicitBinaryBoundingVolumeHierarchy} instead
+ * @deprecated use {@link BVH} instead
  */
 export class BinaryNode extends Node {
     constructor() {

package/src/core/bvh2/LeafNode.js

@@ -1,9 +1,9 @@
 /**
  * Created by Alex on 17/11/2014.
  */
-import {deserializeAABB3} from "../geom/3d/aabb/deserializeAABB3.js";
-import {serializeAABB3} from "../geom/3d/aabb/serializeAABB3.js";
-import {Node} from "./Node.js";
+import { deserializeAABB3 } from "../geom/3d/aabb/deserializeAABB3.js";
+import { serializeAABB3 } from "../geom/3d/aabb/serializeAABB3.js";
+import { Node } from "./Node.js";
 
 
 /**
@@ -16,7 +16,7 @@ function isLeaf(node) {
 }
 
 /**
- * @deprecated use {@link ExplicitBinaryBoundingVolumeHierarchy} and {@link EBBVHLeafProxy} respectively
+ * @deprecated use {@link BVH} and {@link BvhClient} respectively
  */
 export class LeafNode extends Node {
     /**

package/src/core/bvh2/bvh3/{ExplicitBinaryBoundingVolumeHierarchy.d.ts → BVH.d.ts}

@@ -1,4 +1,4 @@
-export class ExplicitBinaryBoundingVolumeHierarchy {
+export class BVH {
     readonly root: number
 
     node_capacity: number

package/src/core/bvh2/bvh3/{ExplicitBinaryBoundingVolumeHierarchy.js → BVH.js}

@@ -1,9 +1,9 @@
-import { aabb3_compute_surface_area } from "../../geom/3d/aabb/aabb3_compute_surface_area.js";
-import { min2 } from "../../math/min2.js";
-import { max2 } from "../../math/max2.js";
 import { assert } from "../../assert.js";
-import { typed_array_copy } from "../../collection/array/typed/typed_array_copy.js";
 import { array_copy } from "../../collection/array/array_copy.js";
+import { typed_array_copy } from "../../collection/array/typed/typed_array_copy.js";
+import { aabb3_compute_surface_area } from "../../geom/3d/aabb/aabb3_compute_surface_area.js";
+import { max2 } from "../../math/max2.js";
+import { min2 } from "../../math/min2.js";
 
 export const COLUMN_PARENT = 6;
 export const COLUMN_CHILD_1 = 7;
@@ -58,7 +58,7 @@ const INITIAL_CAPACITY = 128;
  * @see https://blog.dashlane.com/how-is-data-stored-in-v8-js-engine-memory
  * @class
  */
-export class ExplicitBinaryBoundingVolumeHierarchy {
+export class BVH {
 
     /**
      *
@@ -373,7 +373,7 @@ export class ExplicitBinaryBoundingVolumeHierarchy {
     /**
      *
      * @param {number} id
-     * @param {number[]} result
+     * @param {number[]|Float32Array} result
      */
     node_get_aabb(id, result) {
         assert.isNonNegativeInteger(id, 'id');
@@ -993,7 +993,7 @@ export class ExplicitBinaryBoundingVolumeHierarchy {
 
     /**
      *
-     * @param {function(node:number, tree:ExplicitBinaryBoundingVolumeHierarchy):void} callback
+     * @param {function(node:number, tree:BVH):void} callback
      * @param {*} [ctx]
      */
     traverse(callback, ctx) {

package/src/core/bvh2/bvh3/{ExplicitBinaryBoundingVolumeHierarchy.spec.js → BVH.spec.js}

@@ -1,17 +1,17 @@
-import { ExplicitBinaryBoundingVolumeHierarchy, NULL_NODE } from "./ExplicitBinaryBoundingVolumeHierarchy.js";
+import { BVH, NULL_NODE } from "./BVH.js";
 
 test("constructor doesn't throw", () => {
-    expect(() => new ExplicitBinaryBoundingVolumeHierarchy()).not.toThrow();
+    expect(() => new BVH()).not.toThrow();
 });
 
 test("initial root is NULL", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     expect(bvh.root).toBe(NULL_NODE);
 });
 
 test("allocate a node", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const id = bvh.allocate_node();
 
@@ -21,7 +21,7 @@ test("allocate a node", () => {
 });
 
 test("set/get aabb", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const node = bvh.allocate_node();
 
@@ -37,7 +37,7 @@ test("set/get aabb", () => {
 });
 
 test("insert one leaf", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const node = bvh.allocate_node();
 
@@ -48,7 +48,7 @@ test("insert one leaf", () => {
 
 test("node reuse after de-allocation", () => {
 
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const a = bvh.allocate_node();
 
@@ -61,7 +61,7 @@ test("node reuse after de-allocation", () => {
 
 test("insert two leaves", () => {
 
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const a = bvh.allocate_node();
     bvh.insert_leaf(a);
@@ -79,7 +79,7 @@ test("insert two leaves", () => {
 
 test("set/get user data", () => {
 
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const a = bvh.allocate_node();
 
@@ -89,7 +89,7 @@ test("set/get user data", () => {
 });
 
 test("remove single leaf", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const a = bvh.allocate_node();
     bvh.insert_leaf(a);
@@ -104,7 +104,7 @@ test("remove single leaf", () => {
 
 test("add and remove 5 nodes", () => {
 
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const leaves = [];
     const removed_leaves = [];
@@ -146,13 +146,13 @@ test("add and remove 5 nodes", () => {
 
 
 test("release_all from empty doesn't throw", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     expect(() => bvh.release_all()).not.toThrow();
 });
 
 test("release_all with 1 leaf", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const a = bvh.allocate_node();
 
@@ -164,7 +164,7 @@ test("release_all with 1 leaf", () => {
 });
 
 test("capacity grows as necessary when allocating", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     bvh.node_capacity = 1;
 
@@ -176,7 +176,7 @@ test("capacity grows as necessary when allocating", () => {
 });
 
 test("trim sets capacity to exact allocated size", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     bvh.node_capacity = 1;
 
@@ -192,7 +192,7 @@ test("trim sets capacity to exact allocated size", () => {
 
 test("node property setters/getters", () => {
 
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const node = bvh.allocate_node();
 
@@ -221,7 +221,7 @@ test("node property setters/getters", () => {
 
 
 test("node_set_aabb_primitive", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const node = bvh.allocate_node();
 
@@ -235,7 +235,7 @@ test("node_set_aabb_primitive", () => {
 });
 
 test("swap two detached nodes", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const a = bvh.allocate_node();
     const b = bvh.allocate_node();
@@ -250,7 +250,7 @@ test("swap two detached nodes", () => {
 });
 
 test("setting capacity", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     bvh.node_capacity = 3;
 
@@ -278,7 +278,7 @@ test("setting capacity", () => {
 });
 
 test("move leaf node", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const a = bvh.allocate_node();
     const b = bvh.allocate_node();

package/src/core/bvh2/bvh3/{EBBVHLeafProxy.js → BvhClient.js}

@@ -3,10 +3,10 @@ import { assert } from "../../assert.js";
 /**
  * A convenience class to work with BVH leaf nodes
  */
-export class EBBVHLeafProxy {
+export class BvhClient {
     /**
      *
-     * @type {ExplicitBinaryBoundingVolumeHierarchy|null}
+     * @type {BVH|null}
      */
     #tree = null;
 
@@ -28,7 +28,7 @@ export class EBBVHLeafProxy {
 
     /**
      *
-     * @param {ExplicitBinaryBoundingVolumeHierarchy} tree
+     * @param {BVH} tree
      * @param {number} data Must be a uint32
      */
     link(tree, data) {

package/src/core/bvh2/bvh3/BvhClient.spec.js

@@ -0,0 +1,51 @@
+import { BVH } from "./BVH.js";
+import { BvhClient } from "./BvhClient.js";
+import { bvh_query_leaves_generic } from "./query/bvh_query_leaves_generic.js";
+import { BVHQueryAny } from "./query/BVHQueryAny.js";
+
+test("connect/disconnect", () => {
+
+    const client = new BvhClient();
+
+    const bvh = new BVH();
+
+    client.bounds[0] = 2
+    client.bounds[1] = 3
+    client.bounds[2] = 5
+    client.bounds[3] = 7
+    client.bounds[4] = 11
+    client.bounds[5] = 13
+
+    expect(client.is_linked).toBe(false);
+
+    client.link(bvh, 17);
+
+    expect(client.is_linked).toBe(true);
+
+    const leaves = [];
+    bvh_query_leaves_generic(leaves, 0, bvh, bvh.root, BVHQueryAny.INSTANCE);
+
+    expect(leaves.length).toEqual(1);
+
+    const leaf = leaves[0];
+
+    expect(bvh.node_get_user_data(leaf)).toEqual(17);
+
+    const aabb = [];
+
+    bvh.node_get_aabb(leaf, aabb);
+
+    expect(aabb).toEqual(Array.from(client.bounds));
+
+    // disconnect
+    client.unlink();
+
+    expect(client.is_linked).toBe(false);
+
+    expect(bvh_query_leaves_generic(
+        leaves, 0,
+        bvh, bvh.root,
+        BVHQueryAny.INSTANCE
+    ))
+        .toBe(0);
+});

package/src/core/bvh2/bvh3/ebvh_build_for_geometry_incremental.js

@@ -1,9 +1,9 @@
-import { min2 } from "../../math/min2.js";
 import { compute_triangle_group_aabb3 } from "../../../engine/graphics/sh3/path_tracer/compute_triangle_group_aabb3.js";
+import { min2 } from "../../math/min2.js";
 
 /**
  * Build the BVH by relying on BVH's own incremental insertion mechanism
- * @param {ExplicitBinaryBoundingVolumeHierarchy} bvh
+ * @param {BVH} bvh
  * @param {number[]|Float32Array} index_array
  * @param {number[]|Float32Array} positions_array
  * @param {number} [batch_size] can batch triangles in groups of up-to this many triangles per BVH leaf

package/src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.js

@@ -1,15 +1,15 @@
+import { compute_triangle_group_aabb3 } from "../../../engine/graphics/sh3/path_tracer/compute_triangle_group_aabb3.js";
+import { arrayQuickSort } from "../../collection/array/arrayQuickSort.js";
 import { AABB3 } from "../../geom/3d/aabb/AABB3.js";
 import { aabb3_from_v3_array } from "../../geom/3d/aabb/aabb3_from_v3_array.js";
 import morton from "../../geom/3d/morton/Morton.js";
-import { arrayQuickSort } from "../../collection/array/arrayQuickSort.js";
-import { compute_triangle_group_aabb3 } from "../../../engine/graphics/sh3/path_tracer/compute_triangle_group_aabb3.js";
-import { NULL_NODE } from "./ExplicitBinaryBoundingVolumeHierarchy.js";
 import { max2 } from "../../math/max2.js";
+import { NULL_NODE } from "./BVH.js";
 
 /**
  * Build the BVH bottom-up using spatial hash sorting
  * Resulting BVH is produced very quickly, has perfect balance and is of decent quality
- * @param {ExplicitBinaryBoundingVolumeHierarchy} bvh
+ * @param {BVH} bvh
  * @param {number[]|Float32Array} index_array
  * @param {number[]|Float32Array} position_array
  */

package/src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.spec.js

@@ -1,9 +1,9 @@
+import { BVH, NULL_NODE } from "./BVH.js";
 import { ebvh_build_for_geometry_morton } from "./ebvh_build_for_geometry_morton.js";
-import { ExplicitBinaryBoundingVolumeHierarchy, NULL_NODE } from "./ExplicitBinaryBoundingVolumeHierarchy.js";
 
 test("sanity check with 1 triangle", () => {
 
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     ebvh_build_for_geometry_morton(bvh, [0, 1, 2], [
         0, 1, 3,
@@ -29,7 +29,7 @@ test("sanity check with 1 triangle", () => {
 });
 
 test("sanity check with 2 triangles", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     ebvh_build_for_geometry_morton(
         bvh,

package/src/core/bvh2/bvh3/ebvh_sort_for_traversal_depth_first.js

@@ -1,16 +1,10 @@
-import {
-    COLUMN_CHILD_1,
-    COLUMN_HEIGHT,
-    COLUMN_PARENT,
-    ELEMENT_WORD_COUNT,
-    NULL_NODE
-} from "./ExplicitBinaryBoundingVolumeHierarchy.js";
+import { COLUMN_CHILD_1, COLUMN_HEIGHT, COLUMN_PARENT, ELEMENT_WORD_COUNT, NULL_NODE } from "./BVH.js";
 
 /**
  * Sort live nodes in the traversal order.
  * This makes most queries have linear access, resulting in near-optimal cache usage
  * NOTE: assumes that there are no free nodes
- * @param {ExplicitBinaryBoundingVolumeHierarchy} bvh
+ * @param {BVH} bvh
  */
 export function ebvh_sort_for_traversal_depth_first(bvh) {
     const stack = [];

package/src/core/bvh2/bvh3/query/BVHQuery.js

@@ -2,7 +2,7 @@ export class BVHQuery {
     /**
      *
      * @param {number} node
-     * @param {ExplicitBinaryBoundingVolumeHierarchy} tree
+     * @param {BVH} tree
      * @returns {boolean}
      */
     evaluate(node, tree) {

package/src/core/bvh2/bvh3/query/BVHQueryIntersectsFrustum.js

@@ -1,18 +1,16 @@
-import { BVHQuery } from "./BVHQuery.js";
 import { aabb3_array_intersects_frustum_array } from "../../../geom/3d/aabb/aabb3_array_intersects_frustum_array.js";
+import { BVHQuery } from "./BVHQuery.js";
 
 const scratch_aabb = [];
 
 export class BVHQueryIntersectsFrustum extends BVHQuery {
-    constructor() {
-        super();
-
-        /**
-         * Collection of 6 planes: normal_x, normal_y, normal_z, offset
-         * @type {number[]}
-         */
-        this.frustum = [];
-    }
+
+    /**
+     * Collection of 6 planes: normal_x, normal_y, normal_z, offset
+     * @type {number[]}
+     */
+    frustum = [];
+
 
     /**
      *

package/src/core/bvh2/bvh3/query/BVHQueryIntersectsRay.js

@@ -1,21 +1,21 @@
-import { BVHQuery } from "./BVHQuery.js";
 import { aabb3_array_intersects_ray_array } from "../../../geom/3d/aabb/aabb3_array_intersects_ray_array.js";
+import { BVHQuery } from "./BVHQuery.js";
 
 const scratch_aabb = [];
 
 export class BVHQueryIntersectsRay extends BVHQuery {
-    constructor() {
-        super();
-
-        this.ray = [];
-    }
+    /**
+     *
+     * @type {number[]}
+     */
+    ray = [];
 
     /**
      *
      * @param {number[]|ArrayLike<number>} ray
      * @returns {BVHQueryIntersectsRay}
      */
-    static from(ray){
+    static from(ray) {
         const r = new BVHQueryIntersectsRay();
 
         r.ray = ray;

package/src/core/bvh2/bvh3/query/BVHQueryIntersectsSphere.js

@@ -0,0 +1,37 @@
+import { aabb3_array_intersects_sphere_array } from "../../../geom/3d/aabb/aabb3_array_intersects_sphere_array.js";
+import { BVHQuery } from "./BVHQuery.js";
+
+const scratch_aabb = [];
+
+export class BVHQueryIntersectsSphere extends BVHQuery {
+
+    /**
+     *
+     * @type {number[]}
+     */
+    sphere = [];
+
+    /**
+     *
+     * @param {number[]|ArrayLike<number>} sphere
+     * @returns {BVHQueryIntersectsRay}
+     */
+    static from(sphere) {
+        const r = new BVHQueryIntersectsSphere();
+
+        r.sphere = sphere;
+
+        return r;
+    }
+
+    evaluate(node, tree) {
+
+        tree.node_get_aabb(node, scratch_aabb);
+
+        // test node against the ray
+        return aabb3_array_intersects_sphere_array(
+            scratch_aabb,
+            this.sphere
+        );
+    }
+}

package/src/core/bvh2/bvh3/query/bvh_collect_user_data.js

@@ -1,7 +1,7 @@
 //
 
-import { NULL_NODE } from "../ExplicitBinaryBoundingVolumeHierarchy.js";
 import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
+import { NULL_NODE } from "../BVH.js";
 
 const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
 
@@ -9,7 +9,7 @@ const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
  *
  * @param {number[]} destination
  * @param {number} destination_offset
- * @param {ExplicitBinaryBoundingVolumeHierarchy} bvh
+ * @param {BVH} bvh
  * @param {number} root
  * @returns {number} number of collected elements
  */

package/src/core/bvh2/bvh3/query/bvh_query_leaves_generic.js

@@ -1,11 +1,11 @@
-import { NULL_NODE } from "../ExplicitBinaryBoundingVolumeHierarchy.js";
 import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
+import { NULL_NODE } from "../BVH.js";
 
 const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
 
 /**
  *
- * @param {ExplicitBinaryBoundingVolumeHierarchy} bvh
+ * @param {BVH} bvh
  * @param {number[]} result
  * @param {number} result_offset
  * @param {number} root

package/src/core/bvh2/bvh3/query/bvh_query_leaves_generic.spec.js

@@ -1,9 +1,9 @@
-import { ExplicitBinaryBoundingVolumeHierarchy } from "../ExplicitBinaryBoundingVolumeHierarchy.js";
+import { BVH } from "../BVH.js";
 import { bvh_query_leaves_generic } from "./bvh_query_leaves_generic.js";
 import { BVHQueryAny } from "./BVHQueryAny.js";
 
 test("all-accepting query", () => {
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     const leaf_a = bvh.allocate_node();
     const leaf_b = bvh.allocate_node();

package/src/core/bvh2/bvh3/query/bvh_query_leaves_ray.js

@@ -1,18 +1,13 @@
-import { aabb3_intersects_ray } from "../../../geom/3d/aabb/aabb3_intersects_ray.js";
-import {
-    COLUMN_CHILD_1,
-    COLUMN_CHILD_2,
-    ELEMENT_WORD_COUNT,
-    NULL_NODE
-} from "../ExplicitBinaryBoundingVolumeHierarchy.js";
 import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
+import { aabb3_intersects_ray } from "../../../geom/3d/aabb/aabb3_intersects_ray.js";
+import { COLUMN_CHILD_1, COLUMN_CHILD_2, ELEMENT_WORD_COUNT, NULL_NODE } from "../BVH.js";
 
 const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
 
 
 /**
  *
- * @param {ExplicitBinaryBoundingVolumeHierarchy} bvh
+ * @param {BVH} bvh
  * @param {number} root
  * @param {number[]} result
  * @param {number} result_offset

package/src/core/bvh2/bvh3/query/bvh_query_leaves_ray.spec.js

@@ -1,4 +1,4 @@
-import { ExplicitBinaryBoundingVolumeHierarchy } from "../ExplicitBinaryBoundingVolumeHierarchy.js";
+import { BVH } from "../BVH.js";
 import { bvh_query_leaves_ray } from "./bvh_query_leaves_ray.js";
 
 /**
@@ -7,7 +7,7 @@ import { bvh_query_leaves_ray } from "./bvh_query_leaves_ray.js";
  */
 function makeBVH(...leaves) {
 
-    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+    const bvh = new BVH();
 
     for (let i = 0; i < leaves.length; i++) {