@woosh/meep-engine 2.93.2 → 2.94.0

package/package.json

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

package/src/core/bvh2/bvh3/BVH.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BVH.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/BVH.js"],"names":[],"mappings":"AAQA,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;AAU/B;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEqB;AAgBrC;;;;;;GAMG;AACH;IAEI;;;;OAIG;IACH,sBAA2E;IAE3E;;;;OAIG;IACH,uBAAsD;IAEtD;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAEnB;;;OAGG;IACH,mBAEC;IAUD;;;OAGG;IACH,+BAMC;IAlBD;;;OAGG;IACH,4BAEC;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBAqBC;IAED;;OAEG;IACH,aAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAqDlB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAOnB;IAED;;;;OAIG;IACH,uBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,uBAHW,MAAM,SACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAGD;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,oBAHW,MAAM,UACN,MAAM,QAKhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,QAe/B;IAED;;;;OAIG;IACH,kBAHW,MAAM,QACN,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,QAsBpC;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAWlB;IAED;;;;;;;;;OASG;IACH,4BARW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAmBhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAoBlB;IAED;;;;;OAKG;IACH,wCAJW,MAAM,WACN,MAAM,GACJ,MAAM,CAoClB;IAED;;;;;OAKG;IACH,oCAJW,MAAM,WACN,MAAM,WACN,MAAM,QAyChB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA0GhB;IAED;;;;;OAKG;IACH,wBAuBC;IAED;;;;OAIG;IACH,yBA4BC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;OAMG;IACH,gBAoMC;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,yCA8BC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;OAKG;IACH,0BA6BC;IAED;;;;;OAKG;IACH,cAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAsCnB;CACJ"}
+{"version":3,"file":"BVH.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/BVH.js"],"names":[],"mappings":"AAQA,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEqB;AAgBrC;;;;;;GAMG;AACH;IAEI;;;;OAIG;IACH,sBAA2E;IAE3E;;;;OAIG;IACH,uBAAsD;IAEtD;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAEnB;;;OAGG;IACH,mBAEC;IAUD;;;OAGG;IACH,+BAMC;IAlBD;;;OAGG;IACH,4BAEC;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBAqBC;IAED;;OAEG;IACH,aAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAqDlB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAOnB;IAED;;;;OAIG;IACH,uBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,uBAHW,MAAM,SACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAGD;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,oBAHW,MAAM,UACN,MAAM,QAKhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,QAe/B;IAED;;;;OAIG;IACH,kBAHW,MAAM,QACN,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,QAsBpC;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAWlB;IAED;;;;;;;;;OASG;IACH,4BARW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAmBhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAoBlB;IAED;;;;;OAKG;IACH,wCAJW,MAAM,WACN,MAAM,GACJ,MAAM,CAoClB;IAED;;;;;OAKG;IACH,oCAJW,MAAM,WACN,MAAM,WACN,MAAM,QA2ChB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA0GhB;IAED;;;;;OAKG;IACH,wBAuBC;IAED;;;;OAIG;IACH,yBA4BC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;OAMG;IACH,gBAoMC;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,yCA8BC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;OAKG;IACH,0BA6BC;IAED;;;;;OAKG;IACH,cAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAsCnB;CACJ"}

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

@@ -17,7 +17,7 @@ export const COLUMN_HEIGHT = 9;
  * @readonly
  * @type {number}
  */
-const COLUMN_USER_DATA = COLUMN_CHILD_2;
+export const COLUMN_USER_DATA = COLUMN_CHILD_2;
 
 /**
  *
@@ -553,8 +553,11 @@ export class BVH {
      * @param {number} index_b
      */
     node_set_combined_aabb(destination, index_a, index_b) {
+        assert.isNonNegativeInteger(destination, 'destination');
+
         const address_a = ELEMENT_WORD_COUNT * index_a;
         const address_b = ELEMENT_WORD_COUNT * index_b;
+        const address_destination = ELEMENT_WORD_COUNT * destination;
 
         const float32 = this.__data_float32;
 
@@ -582,7 +585,6 @@ export class BVH {
         const b_z1 = float32[address_b + 5];
         const z1 = max2(a_z1, b_z1);
 
-        const address_destination = destination * ELEMENT_WORD_COUNT;
 
         float32[address_destination] = x0;
         float32[address_destination + 1] = y0;

package/src/core/bvh2/bvh3/build_triangle_morton_codes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"build_triangle_morton_codes.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/build_triangle_morton_codes.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AACH,0DAXW,MAAM,EAAE,GAAC,WAAW,aACpB,MAAM,eACN,MAAM,EAAE,GAAC,UAAU,GAAC,WAAW,GAAC,WAAW,kBAC3C,MAAM,EAAE,GAAC,YAAY,WACrB,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,QA2DhB"}
+{"version":3,"file":"build_triangle_morton_codes.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/build_triangle_morton_codes.js"],"names":[],"mappings":"AAEA;;;;;;;;;;;;GAYG;AACH,0DAXW,MAAM,EAAE,GAAC,WAAW,aACpB,MAAM,eACN,MAAM,EAAE,GAAC,UAAU,GAAC,WAAW,GAAC,WAAW,kBAC3C,MAAM,EAAE,GAAC,YAAY,WACrB,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,WACN,MAAM,QA4DhB"}

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

@@ -26,6 +26,7 @@ export function build_triangle_morton_codes(
     const aabb_size_y = aabb_y1 - aabb_y0;
     const aabb_size_z = aabb_z1 - aabb_z0;
 
+    // compute multipliers to bring normalized values in range of 10bit unsigned integer each
     const morton_scale_x = aabb_size_x === 0 ? 0 : 1023 / aabb_size_x;
     const morton_scale_y = aabb_size_y === 0 ? 0 : 1023 / aabb_size_y;
     const morton_scale_z = aabb_size_z === 0 ? 0 : 1023 / aabb_size_z;
@@ -59,7 +60,7 @@ export function build_triangle_morton_codes(
         const center_y = (ay + by + cy) * 0.333333333;
         const center_z = (az + bz + cz) * 0.333333333;
 
-        // normalize to bounds
+        // normalize to 10bit range
         const ncx = (center_x - aabb_x0) * morton_scale_x;
         const ncy = (center_y - aabb_y0) * morton_scale_y;
         const ncz = (center_z - aabb_z0) * morton_scale_z;

package/src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ebvh_build_for_geometry_morton.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.js"],"names":[],"mappings":"AASA;;;;;;GAMG;AACH,sEAHW,MAAM,EAAE,GAAC,YAAY,kBACrB,MAAM,EAAE,GAAC,YAAY,QAgE/B"}
+{"version":3,"file":"ebvh_build_for_geometry_morton.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.js"],"names":[],"mappings":"AAUA;;;;;;GAMG;AACH,sEAHW,MAAM,EAAE,GAAC,YAAY,kBACrB,MAAM,EAAE,GAAC,YAAY,QA0E/B"}

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

@@ -1,4 +1,5 @@
 import { compute_triangle_group_aabb3 } from "../../../engine/graphics/sh3/path_tracer/compute_triangle_group_aabb3.js";
+import { assert } from "../../assert.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";
@@ -15,6 +16,14 @@ import { ebvh_build_hierarchy } from "./ebvh_build_hierarchy.js";
  * @param {number[]|Float32Array} position_array
  */
 export function ebvh_build_for_geometry_morton(bvh, index_array, position_array) {
+    assert.defined(bvh, 'bvh');
+
+    assert.defined(index_array, 'index_array');
+    assert.isArrayLike(index_array, 'index_array');
+
+    assert.defined(position_array, 'position_array');
+    assert.isArrayLike(position_array, 'position_array');
+
     // clear out existing BVH
     bvh.release_all();
 
@@ -42,6 +51,8 @@ export function ebvh_build_for_geometry_morton(bvh, index_array, position_array)
     }
 
     const morton_codes = new Uint32Array(tri_count);
+
+    // indices of triangles, but sorted by morton codes
     const sorted_triangle_order = new Uint32Array(tri_count);
 
     for (let i = 0; i < tri_count; i++) {
@@ -75,5 +86,5 @@ export function ebvh_build_for_geometry_morton(bvh, index_array, position_array)
     }
 
     // assign root
-    bvh.__root = ebvh_build_hierarchy(bvh,unprocessed_nodes,tri_count,nodes,used_index);
+    bvh.__root = ebvh_build_hierarchy(bvh, unprocessed_nodes, tri_count, nodes, used_index);
 }

package/src/core/bvh2/bvh3/ebvh_build_hierarchy.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ebvh_build_hierarchy.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_hierarchy.js"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,kEANW,MAAM,EAAE,GAAC,WAAW,oBACpB,MAAM,aACN,MAAM,EAAE,GAAC,WAAW,oBACpB,MAAM,GACJ,MAAM,CAgDlB"}
+{"version":3,"file":"ebvh_build_hierarchy.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_hierarchy.js"],"names":[],"mappings":"AAGA;;;;;;;;;GASG;AACH,kEANW,MAAM,EAAE,GAAC,WAAW,oBACpB,MAAM,aACN,MAAM,EAAE,GAAC,WAAW,oBACpB,MAAM,GACJ,MAAM,CAyDlB"}

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

@@ -1,3 +1,4 @@
+import { assert } from "../../assert.js";
 import { max2 } from "../../math/max2.js";
 
 /**
@@ -10,7 +11,16 @@ import { max2 } from "../../math/max2.js";
  * @param {number} node_pool_offset
  * @returns {number} new root
  */
-export function ebvh_build_hierarchy(bvh, unprocessed_nodes, input_node_count, node_pool, node_pool_offset) {
+export function ebvh_build_hierarchy(
+    bvh,
+    unprocessed_nodes,
+    input_node_count,
+    node_pool,
+    node_pool_offset
+) {
+
+    assert.isNonNegativeInteger(input_node_count,'input_node_count');
+    assert.isNonNegativeInteger(node_pool_offset,'node_pool_offset');
 
     let used_index = node_pool_offset;
 

package/src/core/bvh2/bvh3/ebvh_geometry_query_nearest_triangle_ray.d.ts

@@ -0,0 +1,14 @@
+/**
+ *
+ * @param {number[]} output
+ * @param {number} output_offset
+ * @param {BVH} bvh
+ * @param {number} root
+ * @param {number[]} ray
+ * @param {number} min_distance
+ * @param {number} max_distance
+ * @param {number[]|Uint32Array} indices
+ * @param {number[]|Float32Array} positions
+ */
+export function ebvh_geometry_query_nearest_triangle_ray(output: number[], output_offset: number, bvh: BVH, root: number, ray: number[], min_distance: number, max_distance: number, indices: number[] | Uint32Array, positions: number[] | Float32Array): boolean;
+//# sourceMappingURL=ebvh_geometry_query_nearest_triangle_ray.d.ts.map

package/src/core/bvh2/bvh3/ebvh_geometry_query_nearest_triangle_ray.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ebvh_geometry_query_nearest_triangle_ray.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_geometry_query_nearest_triangle_ray.js"],"names":[],"mappings":"AAWA;;;;;;;;;;;GAWG;AACH,iEAVW,MAAM,EAAE,iBACR,MAAM,kBAEN,MAAM,OACN,MAAM,EAAE,gBACR,MAAM,gBACN,MAAM,WACN,MAAM,EAAE,GAAC,WAAW,aACpB,MAAM,EAAE,GAAC,YAAY,WA4H/B"}

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

@@ -0,0 +1,146 @@
+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 { aabb3_signed_distance_sqr_to_point } from "../../geom/3d/aabb/aabb3_signed_distance_sqr_to_point.js";
+import {
+    computeTriangleRayIntersectionBarycentricGeometry
+} from "../../geom/3d/triangle/computeTriangleRayIntersectionBarycentricGeometry.js";
+import { COLUMN_CHILD_1, COLUMN_CHILD_2, COLUMN_USER_DATA, ELEMENT_WORD_COUNT, NULL_NODE } from "./BVH.js";
+
+const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
+const v3_scratch_0 = [];
+
+/**
+ *
+ * @param {number[]} output
+ * @param {number} output_offset
+ * @param {BVH} bvh
+ * @param {number} root
+ * @param {number[]} ray
+ * @param {number} min_distance
+ * @param {number} max_distance
+ * @param {number[]|Uint32Array} indices
+ * @param {number[]|Float32Array} positions
+ */
+export function ebvh_geometry_query_nearest_triangle_ray(
+    output, output_offset,
+    bvh, root,
+    ray, min_distance, max_distance,
+    indices, positions
+) {
+
+    const origin_x = ray[0];
+    const origin_y = ray[1];
+    const origin_z = ray[2];
+
+    const direction_x = ray[3];
+    const direction_y = ray[4];
+    const direction_z = ray[5];
+
+    let best_t = max_distance;
+
+    let best_index = -1;
+    let best_u = 0;
+    let best_v = 0;
+
+    /**
+     *
+     * @type {number}
+     */
+    const stack_top = stack.pointer++;
+
+    stack[stack_top] = root;
+
+
+    /*
+     For performance, we bind data directly to avoid extra copies required to read out AABB
+     */
+    const float32 = bvh.__data_float32;
+    const uint32 = bvh.__data_uint32;
+
+    do {
+        stack.pointer--;
+
+        /**
+         *
+         * @type {number}
+         */
+        const node = stack[stack.pointer];
+
+        const address = node * ELEMENT_WORD_COUNT;
+
+        // test node against the ray
+        const aabb_x0 = float32[address];
+        const aabb_y0 = float32[address + 1];
+        const aabb_z0 = float32[address + 2];
+        const aabb_x1 = float32[address + 3];
+        const aabb_y1 = float32[address + 4];
+        const aabb_z1 = float32[address + 5];
+
+        const intersects = aabb3_intersects_ray(
+            aabb_x0, aabb_y0, aabb_z0,
+            aabb_x1, aabb_y1, aabb_z1,
+            origin_x, origin_y, origin_z,
+            direction_x, direction_y, direction_z
+        );
+
+        if (!intersects) {
+            continue;
+        }
+
+        const distance = aabb3_signed_distance_sqr_to_point(
+            aabb_x0, aabb_y0, aabb_z0,
+            aabb_x1, aabb_y1, aabb_z1,
+            origin_x, origin_y, origin_z
+        );
+
+        if (distance > best_t * best_t) {
+            // whole AABB is too far
+            continue;
+        }
+
+        // get fist child to check if this is a leaf node or not
+        const child_1 = uint32[address + COLUMN_CHILD_1];
+
+        if (child_1 !== NULL_NODE) {
+
+            // this is not a leaf node, push children onto traversal stack
+            stack[stack.pointer++] = child_1;
+            stack[stack.pointer++] = uint32[address + COLUMN_CHILD_2];
+            continue;
+        }
+
+        // leaf node
+        const triangle_index = uint32[address + COLUMN_USER_DATA];
+
+        const intersection_found = computeTriangleRayIntersectionBarycentricGeometry(
+            v3_scratch_0,
+            origin_x, origin_y, origin_z,
+            direction_x, direction_y, direction_z,
+            indices, triangle_index,
+            positions
+        );
+
+        if (intersection_found && v3_scratch_0[0] < best_t && v3_scratch_0[0] > min_distance) {
+            best_t = v3_scratch_0[0];
+
+            best_index = triangle_index;
+            best_u = v3_scratch_0[1];
+            best_v = v3_scratch_0[2];
+
+        }
+
+    } while (stack.pointer > stack_top);
+
+
+    if (best_t === max_distance) {
+        // no intersection
+        return false;
+    }
+
+    output[0] = best_index; // index of hit triangle
+    output[1] = best_u;
+    output[2] = best_v;
+    output[3] = best_t;
+
+    return true;
+}

package/src/core/bvh2/bvh3/query/bvh_query_user_data_ray.d.ts

@@ -0,0 +1,16 @@
+/**
+ *
+ * @param {BVH} bvh
+ * @param {number} root
+ * @param {number[]} result
+ * @param {number} result_offset
+ * @param {number} origin_x
+ * @param {number} origin_y
+ * @param {number} origin_z
+ * @param {number} direction_x
+ * @param {number} direction_y
+ * @param {number} direction_z
+ * @returns {number}
+ */
+export function bvh_query_user_data_ray(bvh: BVH, root: number, result: number[], result_offset: number, origin_x: number, origin_y: number, origin_z: number, direction_x: number, direction_y: number, direction_z: number): number;
+//# sourceMappingURL=bvh_query_user_data_ray.d.ts.map

package/src/core/bvh2/bvh3/query/bvh_query_user_data_ray.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvh_query_user_data_ray.d.ts","sourceRoot":"","sources":["../../../../../../src/core/bvh2/bvh3/query/bvh_query_user_data_ray.js"],"names":[],"mappings":"AAOA;;;;;;;;;;;;;GAaG;AACH,wDAXW,MAAM,UACN,MAAM,EAAE,iBACR,MAAM,YACN,MAAM,YACN,MAAM,YACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,GACJ,MAAM,CAsElB"}

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

@@ -0,0 +1,90 @@
+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, COLUMN_USER_DATA, ELEMENT_WORD_COUNT, NULL_NODE } from "../BVH.js";
+
+const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
+
+
+/**
+ *
+ * @param {BVH} bvh
+ * @param {number} root
+ * @param {number[]} result
+ * @param {number} result_offset
+ * @param {number} origin_x
+ * @param {number} origin_y
+ * @param {number} origin_z
+ * @param {number} direction_x
+ * @param {number} direction_y
+ * @param {number} direction_z
+ * @returns {number}
+ */
+export function bvh_query_user_data_ray(
+    bvh, root,
+    result, result_offset,
+    origin_x, origin_y, origin_z,
+    direction_x, direction_y, direction_z
+) {
+
+    if (root === NULL_NODE) {
+        return 0;
+    }
+
+
+    /**
+     *
+     * @type {number}
+     */
+    const stack_top = stack.pointer++;
+
+    stack[stack_top] = root;
+
+    let result_cursor = result_offset;
+
+    /*
+     For performance, we bind data directly to avoid extra copies required to read out AABB
+     */
+    const float32 = bvh.__data_float32;
+    const uint32 = bvh.__data_uint32;
+
+    do {
+        stack.pointer--;
+
+        /**
+         *
+         * @type {number}
+         */
+        const node = stack[stack.pointer];
+
+        const address = node * ELEMENT_WORD_COUNT;
+
+        // test node against the ray
+        const intersects = aabb3_intersects_ray(
+            float32[address], float32[address + 1], float32[address + 2],
+            float32[address + 3], float32[address + 4], float32[address + 5],
+            origin_x, origin_y, origin_z,
+            direction_x, direction_y, direction_z
+        );
+
+        if (!intersects) {
+            continue;
+        }
+
+        // get fist child to check if this is a leaf node or not
+        const child_1 = uint32[address + COLUMN_CHILD_1];
+
+        if (child_1 !== NULL_NODE) {
+
+            // this is not a leaf node, push children onto traversal stack
+            stack[stack.pointer++] = child_1;
+            stack[stack.pointer++] = uint32[address + COLUMN_CHILD_2];
+
+        } else {
+            // leaf node
+
+            result[result_cursor++] = uint32[address + COLUMN_USER_DATA];
+        }
+    } while (stack.pointer > stack_top);
+
+    return result_cursor - result_offset;
+}

package/src/core/color/Color.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Color.d.ts","sourceRoot":"","sources":["../../../../src/core/color/Color.js"],"names":[],"mappings":"AAeA;;GAEG;AACH;IA8hBI;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,KAAK,CAIjB;IAED;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,KACN,MAAM,GACL,KAAK,CAQhB;IAGD;;;;OAIG;IACH,kBAHW,MAAM,GACL,KAAK,CAQhB;IAED;;;;OAIG;IACH,kCAHW,KAAK,UACL,KAAK,QAIf;IAED;;;;OAIG;IACH,kCAHW,KAAK,UACL,KAAK,QAIf;IArlBD;;;;;;OAMG;IACH,gBALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,EAkChB;IA/BG;;;;OAIG;IACH,GAFU,MAAM,CAEN;IACV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IACV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IAEV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IAEV;;;OAGG;IACH,oBAFU,OAAO,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,CAAC,CAE5C;IAWjC;;;OAGG;IACH,mBAEC;IAdD;;;OAGG;IACH,gBAEC;IAkBD;;;OAGG;IACH,mBAEC;IAdD;;;OAGG;IACH,gBAEC;IAkBD;;;OAGG;IACH,mBAEC;IAdD;;;OAGG;IACH,gBAEC;IAkBD;;;OAGG;IACH,mBAEC;IAdD;;;OAGG;IACH,gBAEC;IAUD;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAKhB;IAED;;;OAGG;IACH,QAFW,MAAM,QAIhB;IAED;;;;;;OAMG;IACH,OALW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAsBhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqDhB;IAED;;;;;;;OAOG;IACH,UALW,MAAM,KACN,MAAM,KACN,MAAM,QAyDhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QA6ChB;IAED;;;OAGG;IACH,oBAFY,MAAM,CAIjB;IAED;;;;MAEC;IAED;;;OAGG;IACH,UAFa,MAAM,CAKlB;IAED;;;OAGG;IACH,gBAFW,MAAM,QAQhB;IAED;;;;OAIG;IACH,SAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,mBAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,cAFW,KAAK,WAOf;IAED;;;OAGG;IACH,YAFW,KAAK,QAKf;IAED;;;OAGG;IACH,SAFa,KAAK,CAQjB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;;aAGC;IAED;;;;;MAOC;IAWD;;;;OAIG;IACH,0BAHW,MAAM,EAAE,sBACR,MAAM,QAOhB;IAED;;;OAGG;IACH,2CAKC;IAED;;;OAGG;IACH,6CAQC;IAED;;;;OAIG;IACH,WAHW,MAAM,GACJ,IAAI,CAYhB;IAED;;;;;OAKG;IACH,cAJW,KAAK,KACL,KAAK,KACL,MAAM,QAOhB;IA1ED,sDAOC;CA8HJ;;aAIS,SAAS,KAAK,CAAC;eAMf,SAAS,KAAK,CAAC;cAMf,SAAS,KAAK,CAAC;gBAMf,SAAS,KAAK,CAAC;cAMf,SAAS,KAAK,CAAC;iBAMf,SAAS,KAAK,CAAC;eAMf,SAAS,KAAK,CAAC;eAMf,SAAS,KAAK,CAAC;qBAMf,SAAS,KAAK,CAAC;;mBA5pBN,4BAA4B"}
+{"version":3,"file":"Color.d.ts","sourceRoot":"","sources":["../../../../src/core/color/Color.js"],"names":[],"mappings":"AAeA;;GAEG;AACH;IAwiBI;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,KAAK,CAIjB;IAED;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,KACN,MAAM,GACL,KAAK,CAQhB;IAGD;;;;OAIG;IACH,kBAHW,MAAM,GACL,KAAK,CAQhB;IAED;;;;OAIG;IACH,kCAHW,KAAK,UACL,KAAK,QAIf;IAED;;;;OAIG;IACH,kCAHW,KAAK,UACL,KAAK,QAIf;IA/lBD;;;;;;OAMG;IACH,gBALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,EAkChB;IA/BG;;;;OAIG;IACH,GAFU,MAAM,CAEN;IACV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IACV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IAEV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IAEV;;;OAGG;IACH,oBAFU,OAAO,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,CAAC,CAE5C;IAWjC;;;OAGG;IACH,mBAEC;IAdD;;;OAGG;IACH,gBAEC;IAkBD;;;OAGG;IACH,mBAEC;IAdD;;;OAGG;IACH,gBAEC;IAkBD;;;OAGG;IACH,mBAEC;IAdD;;;OAGG;IACH,gBAEC;IAkBD;;;OAGG;IACH,mBAEC;IAdD;;;OAGG;IACH,gBAEC;IAUD;;;OAGG;IACH,qBAEC;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAKhB;IAED;;;OAGG;IACH,QAFW,MAAM,QAIhB;IAED;;;;;;OAMG;IACH,OALW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAsBhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqDhB;IAED;;;;;;;OAOG;IACH,UALW,MAAM,KACN,MAAM,KACN,MAAM,QAyDhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QA6ChB;IAED;;;OAGG;IACH,oBAFY,MAAM,CAIjB;IAED;;;;MAEC;IAED;;;OAGG;IACH,UAFa,MAAM,CAKlB;IAED;;;OAGG;IACH,gBAFW,MAAM,QAUhB;IAED;;;;OAIG;IACH,SAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,mBAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,cAFW,KAAK,WAOf;IAED;;;OAGG;IACH,YAFW,KAAK,QAKf;IAED;;;OAGG;IACH,SAFa,KAAK,CAQjB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;;aAGC;IAED;;;;;MAOC;IAWD;;;;OAIG;IACH,0BAHW,MAAM,EAAE,sBACR,MAAM,QAOhB;IAED;;;OAGG;IACH,2CAKC;IAED;;;OAGG;IACH,6CAQC;IAED;;;;OAIG;IACH,WAHW,MAAM,GACJ,IAAI,CAYhB;IAED;;;;;OAKG;IACH,cAJW,KAAK,KACL,KAAK,KACL,MAAM,QAOhB;IA1ED,sDAOC;CA8HJ;;aAIS,SAAS,KAAK,CAAC;eAMf,SAAS,KAAK,CAAC;cAMf,SAAS,KAAK,CAAC;gBAMf,SAAS,KAAK,CAAC;cAMf,SAAS,KAAK,CAAC;iBAMf,SAAS,KAAK,CAAC;eAMf,SAAS,KAAK,CAAC;eAMf,SAAS,KAAK,CAAC;qBAMf,SAAS,KAAK,CAAC;;mBArqBN,4BAA4B"}

package/src/core/color/Color.js

@@ -1,17 +1,17 @@
 import { assert } from "../assert.js";
+import { float2uint8 } from "../binary/float2uint8.js";
 import Signal from "../events/signal/Signal.js";
-import { parse_color } from "./parse_color.js";
-import { min2 } from "../math/min2.js";
+import { clamp01 } from "../math/clamp01.js";
+import { lerp } from "../math/lerp.js";
 import { max2 } from "../math/max2.js";
+import { min2 } from "../math/min2.js";
 import { min3 } from "../math/min3.js";
+import { rgb2hex } from "./hex/rgb2hex.js";
 import { rgb2hsv } from "./hsv/rgb2hsv.js";
+import { parse_color } from "./parse_color.js";
 import { rgb2uint24 } from "./rgb2uint24.js";
-import { clamp01 } from "../math/clamp01.js";
-import { rgb2hex } from "./hex/rgb2hex.js";
 import { linear_to_sRGB } from "./sRGB/linear_to_sRGB.js";
 import { sRGB_to_linear } from "./sRGB/sRGB_to_linear.js";
-import { lerp } from "../math/lerp.js";
-import { float2uint8 } from "../binary/float2uint8.js";
 
 /**
  * @class
@@ -22,7 +22,7 @@ export class Color {
      * @param {number} r value from 0 to 1
      * @param {number} g value from 0 to 1
      * @param {number} b value from 0 to 1
-     * @param {number} [a] value from 0 to 1
+     * @param {number} [a] value from 0 to 1 Alpha channel (transparency)
      */
     constructor(r = 0, g = 0, b = 0, a = 1) {
         /**
@@ -122,6 +122,14 @@ export class Color {
         this.a = v;
     }
 
+    /**
+     * Pretending to be an array
+     * @return {number}
+     */
+    get length() {
+        return 4;
+    }
+
     /**
      *
      * @param {number} r
@@ -400,6 +408,8 @@ export class Color {
      * @param {number} value
      */
     fromUint(value) {
+        assert.isNonNegativeInteger(value, 'value');
+
         const r = value >> 16;
         const g = (value >> 8) & 0xFF;
         const b = (value) & 0xFF;

package/src/core/geom/2d/bvh/BVH2D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BVH2D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/bvh/BVH2D.js"],"names":[],"mappings":"AASA,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEoB;AAgBpC;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,sBAA2E;IAE3E;;;;OAIG;IACH,uBAAsD;IAEtD;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAEnB;;;OAGG;IACH,mBAEC;IAUD;;;OAGG;IACH,+BAMC;IAlBD;;;OAGG;IACH,4BAEC;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBAqBC;IAED;;OAEG;IACH,aAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAmDlB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAOnB;IAED;;;;OAIG;IACH,uBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,uBAHW,MAAM,SACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAGD;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,oBAHW,MAAM,UACN,MAAM,QAKhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,QAa/B;IAED;;;;OAIG;IACH,kBAHW,MAAM,QACN,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,QAkBpC;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAWlB;IAED;;;;;;;;;OASG;IACH,4BARW,MAAM,MACN,MAAM,MACN,MAAM,MAEN,MAAM,MACN,MAAM,QAkBhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAkBlB;IAED;;;;;OAKG;IACH,wCAJW,MAAM,WACN,MAAM,GACJ,MAAM,CA6BlB;IAED;;;;;OAKG;IACH,oCAJW,MAAM,WACN,MAAM,WACN,MAAM,QA+BhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA0GhB;IAED;;;;;OAKG;IACH,wBAuBC;IAED;;;;OAIG;IACH,yBA4BC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;OAMG;IACH,gBAoMC;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,yCA8BC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;OAKG;IACH,0BA6BC;IAED;;;;;OAKG;IACH,cAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAsCnB;CACJ"}
+{"version":3,"file":"BVH2D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/bvh/BVH2D.js"],"names":[],"mappings":"AAUA,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEoB;AAgBpC;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,sBAA2E;IAE3E;;;;OAIG;IACH,uBAAsD;IAEtD;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAEnB;;;OAGG;IACH,mBAEC;IAUD;;;OAGG;IACH,+BAMC;IAlBD;;;OAGG;IACH,4BAEC;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBAqBC;IAED;;OAEG;IACH,aAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAmDlB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAOnB;IAED;;;;OAIG;IACH,uBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,uBAHW,MAAM,SACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAGD;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,oBAHW,MAAM,UACN,MAAM,QAKhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,QAa/B;IAED;;;;OAIG;IACH,kBAHW,MAAM,QACN,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,QAkBpC;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAWlB;IAED;;;;;;;;;OASG;IACH,4BARW,MAAM,MACN,MAAM,MACN,MAAM,MAEN,MAAM,MACN,MAAM,QAkBhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAkBlB;IAED;;;;;OAKG;IACH,wCAJW,MAAM,WACN,MAAM,GACJ,MAAM,CA6BlB;IAED;;;;;OAKG;IACH,oCAJW,MAAM,WACN,MAAM,WACN,MAAM,QAgBhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CAgHhB;IAED;;;;;OAKG;IACH,wBAuBC;IAED;;;;OAIG;IACH,yBA4BC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;OAMG;IACH,gBAuMC;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,yCA8BC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;OAKG;IACH,0BA6BC;IAED;;;;;OAKG;IACH,cAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAsCnB;CACJ"}

package/src/core/geom/2d/bvh/BVH2D.js

@@ -4,6 +4,7 @@ import { array_copy } from "../../../collection/array/array_copy.js";
 import { typed_array_copy } from "../../../collection/array/typed/typed_array_copy.js";
 import { max2 } from "../../../math/max2.js";
 import { min2 } from "../../../math/min2.js";
+import { aabb2_array_combine } from "../aabb/aabb2_array_combine.js";
 import { aabb2_compute_area } from "../aabb/aabb2_compute_area.js";
 
 
@@ -536,31 +537,16 @@ export class BVH2D {
         const address_a = ELEMENT_WORD_COUNT * index_a;
         const address_b = ELEMENT_WORD_COUNT * index_b;
 
-        const float32 = this.__data_float32;
-
-        const a_x0 = float32[address_a];
-        const b_x0 = float32[address_b];
-        const x0 = min2(a_x0, b_x0);
-
-        const a_y0 = float32[address_a + 1];
-        const b_y0 = float32[address_b + 1];
-        const y0 = min2(a_y0, b_y0);
+        const address_destination = ELEMENT_WORD_COUNT * destination;
 
-        const a_x1 = float32[address_a + 2];
-        const b_x1 = float32[address_b + 2];
-        const x1 = max2(a_x1, b_x1);
-
-        const a_y1 = float32[address_a + 3];
-        const b_y1 = float32[address_b + 3];
-        const y1 = max2(a_y1, b_y1);
-
-        const address_destination = destination * ELEMENT_WORD_COUNT;
+        const float32 = this.__data_float32;
 
-        float32[address_destination] = x0;
-        float32[address_destination + 1] = y0;
+        aabb2_array_combine(
+            float32,address_destination,
+            float32,address_a,
+            float32,address_b
+        );
 
-        float32[address_destination + 2] = x1;
-        float32[address_destination + 3] = y1;
     }
 
     /**
@@ -586,10 +572,16 @@ export class BVH2D {
         // Find the best sibling for this node
         let index = this.__root;
 
-        while (this.node_is_leaf(index) === false) {
+        while (true) {
             const node_address = index * ELEMENT_WORD_COUNT;
 
             const child1 = uint32[node_address + COLUMN_CHILD_1];
+
+            if(child1 === NULL_NODE){
+                // it's a leaf node
+                break;
+            }
+
             const child2 = uint32[node_address + COLUMN_CHILD_2];
 
             const area = this.node_get_surface_area(index);
@@ -803,20 +795,23 @@ export class BVH2D {
         //b2TreeNode* A = m_nodes + iA;
         const uint32 = this.__data_uint32;
 
-        if (this.node_is_leaf(iA) || uint32[iA * ELEMENT_WORD_COUNT + COLUMN_HEIGHT] < 2) {
+        const iB = uint32[iA * ELEMENT_WORD_COUNT + COLUMN_CHILD_1];
+
+        const is_leaf_node = iB === NULL_NODE;
+
+        if (is_leaf_node || uint32[iA * ELEMENT_WORD_COUNT + COLUMN_HEIGHT] < 2) {
             return iA;
         }
 
-        const iB = uint32[iA * ELEMENT_WORD_COUNT + COLUMN_CHILD_1];
         const iC = uint32[iA * ELEMENT_WORD_COUNT + COLUMN_CHILD_2];
 
         assert.notEqual(iA, iB, 'child1 equal to parent');
         assert.notEqual(iA, iB, 'child2 equal to parent');
 
         assert.greaterThanOrEqual(iB, 0);
-        assert.lessThan(iB, this.node_capacity);
+        assert.lessThan(iB, this.__capacity);
         assert.greaterThanOrEqual(iC, 0);
-        assert.lessThan(iC, this.node_capacity);
+        assert.lessThan(iC, this.__capacity);
 
         //b2TreeNode* B = m_nodes + iB;
         //b2TreeNode* C = m_nodes + iC;
@@ -835,9 +830,9 @@ export class BVH2D {
             // b2TreeNode* G = m_nodes + iG;
 
             assert.greaterThanOrEqual(iF, 0);
-            assert.lessThan(iF, this.node_capacity);
+            assert.lessThan(iF, this.__capacity);
             assert.greaterThanOrEqual(iG, 0);
-            assert.lessThan(iG, this.node_capacity);
+            assert.lessThan(iG, this.__capacity);
 
             // Swap A and C
             uint32[iC * ELEMENT_WORD_COUNT + COLUMN_CHILD_1] = iA;

package/src/core/geom/2d/bvh/BVH2D.spec.js

@@ -305,16 +305,16 @@ test("move leaf node", () => {
     expect(actual_bounds).toEqual(a_new_bounds);
 });
 
-test.skip("performance, insert 100k random nodes", () => {
+test.skip("performance, insert 1m random nodes", () => {
 
     const random = seededRandom(1);
 
     const bvh = new BVH2D();
 
-    const min_bound = -1000;
-    const max_bound = 1000;
+    const min_bound = 1;
+    const max_bound = 99;
 
-    const OBJECT_COUNT = 100000;
+    const OBJECT_COUNT = 1000000;
 
     const leaves = new Uint32Array(OBJECT_COUNT);
     for (let i = 0; i < OBJECT_COUNT; i++) {
@@ -325,13 +325,14 @@ test.skip("performance, insert 100k random nodes", () => {
         const x = randomFloatBetween(random, min_bound, max_bound);
         const y = randomFloatBetween(random, min_bound, max_bound);
 
-        const extents = randomFloatBetween(random, 1, 10);
+        const extents_x = randomFloatBetween(random, 0.05, 1);
+        const extents_y = randomFloatBetween(random, 0.05, 1);
 
-        const x0 = x - extents;
-        const y0 = y - extents;
+        const x0 = x - extents_x;
+        const y0 = y - extents_y;
 
-        const x1 = x + extents;
-        const y1 = y + extents;
+        const x1 = x + extents_x;
+        const y1 = y + extents_y;
 
         // console.log([x0, y0, z0, x1, y1, z1].join(', '))
 

package/src/core/geom/2d/bvh/bvh2d_query_all_data_by_circle.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=bvh2d_query_all_data_by_circle.spec.d.ts.map

package/src/core/geom/2d/bvh/bvh2d_query_all_data_by_circle.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvh2d_query_all_data_by_circle.spec.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/bvh/bvh2d_query_all_data_by_circle.spec.js"],"names":[],"mappings":""}