@woosh/meep-engine 2.109.0 → 2.109.2

package/src/core/binary/BitSet.js

@@ -1,43 +1,8 @@
 import { assert } from "../assert.js";
 import { max3 } from "../math/max3.js";
 import { min2 } from "../math/min2.js";
-
-/**
- * de Bruijn sequence
- * @see https://graphics.stanford.edu/~seander/bithacks.html
- * @type {Uint8Array}
- */
-const msb_lut = new Uint8Array([
-    0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
-    31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
-]);
-
-/**
- * get most significant set bit
- * @see https://graphics.stanford.edu/~seander/bithacks.html
- * @param {number} v 32 bit integer
- * @returns {number} integer position of most significant bit
- */
-function msb_32(v) {
-    v |= v >>> 1;
-    v |= v >>> 2;
-    v |= v >>> 4;
-    v |= v >>> 8;
-    v |= v >>> 16;
-    v = (v >>> 1) + 1;
-    return msb_lut[(v * 0x077CB531) >>> 27];
-}
-
-/**
- * Get index of the least significant set bit
- * Also known as ctz32 or "count trailing zeroes"
- * @see https://graphics.stanford.edu/~seander/bithacks.html
- * @param {number} v
- * @returns {number}
- */
-function lsb_32(v) {
-    return msb_lut[((v & -v) * 0x077CB531) >>> 27];
-}
+import { align_32 } from "./align_32.js";
+import { lsb_32 } from "./lsb_32.js";
 
 /**
  * Used for overallocating space when bit set needs to grow
@@ -59,12 +24,21 @@ const SHRINK_FACTOR = 0.5;
  */
 const RESIZE_COUNT_THRESHOLD = 128;
 
+/**
+ * @readonly
+ * @type {number}
+ */
+const DEFAULT_INITIAL_CAPACITY = 64;
+
 export class BitSet {
     /**
      * Dynamically sized bit field
      * @constructor
+     * @param {number} [initial_capacity]
      */
-    constructor() {
+    constructor(initial_capacity = DEFAULT_INITIAL_CAPACITY) {
+        assert.isNonNegativeInteger(initial_capacity, 'initial_capacity');
+
         /**
          * Number of bits currently in use
          * @private
@@ -77,7 +51,7 @@ export class BitSet {
          * @private
          * @type {number}
          */
-        this.__capacity = 64;
+        this.__capacity = align_32(initial_capacity);
 
         /**
          * Uint32-backed storage
@@ -615,9 +589,7 @@ export class BitSet {
      * @returns {BitSet}
      */
     static fixedSize(x) {
-        const r = new BitSet();
-
-        r.setCapacity(x);
+        const r = new BitSet(x);
 
         //prevent resizing
         r.__shrinkFactor = 0;

package/src/core/binary/align_32.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Align to the nearest number divisible by 32, rounding up
+ * @param {number} n
+ * @returns {number}
+ */
+export function align_32(n: number): number;
+//# sourceMappingURL=align_32.d.ts.map

package/src/core/binary/align_32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"align_32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/align_32.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,4BAHW,MAAM,GACJ,MAAM,CAIlB"}

package/src/core/binary/align_32.js

@@ -0,0 +1,8 @@
+/**
+ * Align to the nearest number divisible by 32, rounding up
+ * @param {number} n
+ * @returns {number}
+ */
+export function align_32(n) {
+    return ((n + 31) >>> 5) << 5
+}

package/src/core/binary/align_32.spec.d.ts

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

package/src/core/binary/align_32.spec.d.ts.map

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

package/src/core/binary/align_32.spec.js

@@ -0,0 +1,11 @@
+import { align_32 } from "./align_32.js";
+
+test("basics", () => {
+    expect(align_32(0)).toBe(0);
+    expect(align_32(1)).toBe(32);
+    expect(align_32(31)).toBe(32);
+    expect(align_32(32)).toBe(32);
+    expect(align_32(33)).toBe(64);
+    expect(align_32(63)).toBe(64);
+    expect(align_32(64)).toBe(64);
+});

package/src/core/binary/align_4.js

@@ -11,4 +11,5 @@ export function align_4(n) {
     assert.greaterThanOrEqual(result, n, 'aligned result must be >= input');
 
     return result;
-}
+}
+

package/src/core/binary/ctz32.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ctz32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/ctz32.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,yBAHW,MAAM,GACL,MAAM,CAmCjB"}
+{"version":3,"file":"ctz32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/ctz32.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,yBAHW,MAAM,GACL,MAAM,CAoCjB"}

package/src/core/binary/ctz32.js

@@ -5,34 +5,35 @@
  * @return {number}
  */
 export function ctz32(x) {
+    let _x = x;
     let n = 0;
 
-    if ((x & 0xffff) === 0) {
-        x >>= 16;
+    if ((_x & 0xffff) === 0) {
+        _x >>= 16;
         n += 16;
     }
 
-    if ((x & 0xff) === 0) {
-        x >>= 8;
+    if ((_x & 0xff) === 0) {
+        _x >>= 8;
         n += 8;
     }
 
-    if ((x & 0xf) === 0) {
-        x >>= 4;
+    if ((_x & 0xf) === 0) {
+        _x >>= 4;
         n += 4;
     }
 
-    if ((x & 0x3) === 0) {
-        x >>= 2;
+    if ((_x & 0x3) === 0) {
+        _x >>= 2;
         n += 2;
     }
 
-    if ((x & 0x1) === 0) {
-        x >>= 1;
+    if ((_x & 0x1) === 0) {
+        _x >>= 1;
         n += 1;
     }
 
-    if (x === 0) {
+    if (_x === 0) {
         n += 1;
     }
 

package/src/core/binary/lsb_32.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Get index of the least significant set bit
+ * Also known as ctz32 or "count trailing zeroes"
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @param {number} v
+ * @returns {number}
+ */
+export function lsb_32(v: number): number;
+//# sourceMappingURL=lsb_32.d.ts.map

package/src/core/binary/lsb_32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lsb_32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/lsb_32.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,0BAHW,MAAM,GACJ,MAAM,CAIlB"}

package/src/core/binary/lsb_32.js

@@ -0,0 +1,12 @@
+import { msb_lut_de_bruijn } from "./msb_lut_de_bruijn.js";
+
+/**
+ * Get index of the least significant set bit
+ * Also known as ctz32 or "count trailing zeroes"
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @param {number} v
+ * @returns {number}
+ */
+export function lsb_32(v) {
+    return msb_lut_de_bruijn[((v & -v) * 0x077CB531) >>> 27];
+}

package/src/core/binary/msb_32.d.ts

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

package/src/core/binary/msb_32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"msb_32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/msb_32.js"],"names":[],"mappings":""}

package/src/core/binary/msb_32.js

@@ -0,0 +1,20 @@
+import { msb_lut_de_bruijn } from "./msb_lut_de_bruijn.js";
+
+/**
+ * get most significant set bit
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @param {number} x 32 bit integer
+ * @returns {number} integer position of most significant bit
+ */
+function msb_32(x) {
+    let v = x;
+
+    v |= v >>> 1;
+    v |= v >>> 2;
+    v |= v >>> 4;
+    v |= v >>> 8;
+    v |= v >>> 16;
+    v = (v >>> 1) + 1;
+
+    return msb_lut_de_bruijn[(v * 0x077CB531) >>> 27];
+}

package/src/core/binary/msb_lut_de_bruijn.d.ts

@@ -0,0 +1,7 @@
+/**
+ * de Bruijn sequence
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @type {Uint8Array}
+ */
+export const msb_lut_de_bruijn: Uint8Array;
+//# sourceMappingURL=msb_lut_de_bruijn.d.ts.map

package/src/core/binary/msb_lut_de_bruijn.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"msb_lut_de_bruijn.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/msb_lut_de_bruijn.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,gCAFU,UAAU,CAKjB"}

package/src/core/binary/msb_lut_de_bruijn.js

@@ -0,0 +1,9 @@
+/**
+ * de Bruijn sequence
+ * @see https://graphics.stanford.edu/~seander/bithacks.html
+ * @type {Uint8Array}
+ */
+export const msb_lut_de_bruijn = new Uint8Array([
+    0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
+    31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
+]);

package/src/core/binary/reinterpret_int32_as_float32.d.ts

@@ -0,0 +1,7 @@
+/**
+ *
+ * @param {number} value
+ * @returns {number}
+ */
+export function reinterpret_int32_as_float32(value: number): number;
+//# sourceMappingURL=reinterpret_int32_as_float32.d.ts.map

package/src/core/binary/reinterpret_int32_as_float32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reinterpret_int32_as_float32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/reinterpret_int32_as_float32.js"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,oDAHW,MAAM,GACJ,MAAM,CAMlB"}

package/src/core/binary/reinterpret_int32_as_float32.js

@@ -0,0 +1,14 @@
+const b = new ArrayBuffer(4);
+const b_f32 = new Float32Array(b);
+const b_i32 = new Int32Array(b);
+
+/**
+ *
+ * @param {number} value
+ * @returns {number}
+ */
+export function reinterpret_int32_as_float32(value) {
+    b_i32[0] = value;
+
+    return b_f32[0];
+}

package/src/core/binary/reverse_bits_uint32.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Reverses order of bits in an unsigned 32bit integer
+ * @example 1110 would become 0111
+ * @param {number} input
+ * @returns {number}
+ */
+export function reverse_bits_uint32(input: number): number;
+//# sourceMappingURL=reverse_bits_uint32.d.ts.map

package/src/core/binary/reverse_bits_uint32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reverse_bits_uint32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/reverse_bits_uint32.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,2CAHW,MAAM,GACJ,MAAM,CAYlB"}

package/src/core/binary/reverse_bits_uint32.js

@@ -0,0 +1,17 @@
+/**
+ * Reverses order of bits in an unsigned 32bit integer
+ * @example 1110 would become 0111
+ * @param {number} input
+ * @returns {number}
+ */
+export function reverse_bits_uint32(input) {
+    let x = input;
+
+    x = ((x << 16) | (x >>> 16))
+    x = ((x & 0x55555555) << 1) | ((x & 0xAAAAAAAA) >>> 1)
+    x = ((x & 0x33333333) << 2) | ((x & 0xCCCCCCCC) >>> 2)
+    x = ((x & 0x0F0F0F0F) << 4) | ((x & 0xF0F0F0F0) >>> 4)
+    x = ((x & 0x00FF00FF) << 8) | ((x & 0xFF00FF00) >>> 8)
+
+    return x
+}

package/src/core/binary/reverse_bits_uint32.spec.d.ts

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

package/src/core/binary/reverse_bits_uint32.spec.d.ts.map

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

package/src/core/binary/reverse_bits_uint32.spec.js

@@ -0,0 +1,18 @@
+import { reverse_bits_uint32 } from "./reverse_bits_uint32.js";
+
+test("basics", () => {
+
+    expect(reverse_bits_uint32(1 << 31)).toEqual(1);
+    expect(reverse_bits_uint32(1)).toEqual(1 << 31);
+
+    expect(reverse_bits_uint32(2)).toEqual(1 << 30);
+    expect(reverse_bits_uint32(1 << 30)).toEqual(2);
+
+    expect(reverse_bits_uint32(0b1111)).toEqual(
+        (1 << 31) | (1 << 30) | (1 << 29) | (1 << 28)
+    );
+    expect(reverse_bits_uint32(
+        (1 << 31) | (1 << 30) | (1 << 29) | (1 << 28)
+    )).toEqual(0b1111);
+
+});

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;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"}
+{"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,QAAM,QAsB1C;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,QAwChB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA0GhB;IAED;;;;;OAKG;IACH,wBAqBC;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

@@ -410,7 +410,7 @@ export class BVH {
     /**
      *
      * @param {number} id
-     * @param {number[]|ArrayLike<number>} aabb
+     * @param {number[]|ArrayLike<number>|AABB3} aabb
      */
     node_set_aabb(id, aabb) {
         assert.isNonNegativeInteger(id, 'id');
@@ -562,27 +562,24 @@ export class BVH {
         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 a_z0 = float32[address_a + 2];
-        const b_z0 = float32[address_b + 2];
-        const z0 = min2(a_z0, b_z0);
-
         const a_x1 = float32[address_a + 3];
-        const b_x1 = float32[address_b + 3];
-        const x1 = max2(a_x1, b_x1);
-
         const a_y1 = float32[address_a + 4];
-        const b_y1 = float32[address_b + 4];
-        const y1 = max2(a_y1, b_y1);
-
         const a_z1 = float32[address_a + 5];
+
+        const b_x0 = float32[address_b];
+        const b_y0 = float32[address_b + 1];
+        const b_z0 = float32[address_b + 2];
+        const b_x1 = float32[address_b + 3];
+        const b_y1 = float32[address_b + 4];
         const b_z1 = float32[address_b + 5];
+
+        const x0 = min2(a_x0, b_x0);
+        const y0 = min2(a_y0, b_y0);
+        const z0 = min2(a_z0, b_z0);
+        const x1 = max2(a_x1, b_x1);
+        const y1 = max2(a_y1, b_y1);
         const z1 = max2(a_z1, b_z1);
 
 
@@ -718,8 +715,6 @@ export class BVH {
         const uint32 = this.__data_uint32;
 
         do {
-            index = this.balance(index);
-
             const address = index * ELEMENT_WORD_COUNT;
 
             const child1 = uint32[address + COLUMN_CHILD_1];

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

@@ -1 +1 @@
-{"version":3,"file":"ebvh_build_for_geometry_incremental.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_for_geometry_incremental.js"],"names":[],"mappings":"AAGA;;;;;;GAMG;AACH,2EAJW,MAAM,EAAE,GAAC,YAAY,mBACrB,MAAM,EAAE,GAAC,YAAY,eACrB,MAAM,QA8BhB"}
+{"version":3,"file":"ebvh_build_for_geometry_incremental.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_for_geometry_incremental.js"],"names":[],"mappings":"AAKA;;;;;;GAMG;AACH,2EAJW,MAAM,EAAE,GAAC,YAAY,mBACrB,MAAM,EAAE,GAAC,YAAY,eACrB,MAAM,QA8BhB"}

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

@@ -1,4 +1,6 @@
-import { compute_triangle_group_aabb3 } from "../../../engine/graphics/sh3/path_tracer/compute_triangle_group_aabb3.js";
+import {
+    compute_triangle_group_aabb3
+} from "../../../engine/graphics/sh3/path_tracer/geometry/compute_triangle_group_aabb3.js";
 import { min2 } from "../../math/min2.js";
 
 /**

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":"AAWA;;;;;;;;GAQG;AACH,sEALW,MAAM,EAAE,GAAC,YAAY,kBACrB,MAAM,EAAE,GAAC,YAAY,iBACrB,WAAW,WACX,KAAK,QA2Ff;sBA1GqB,6BAA6B"}
+{"version":3,"file":"ebvh_build_for_geometry_morton.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_for_geometry_morton.js"],"names":[],"mappings":"AAWA;;;;;;;;GAQG;AACH,sEALW,MAAM,EAAE,GAAC,YAAY,kBACrB,MAAM,EAAE,GAAC,YAAY,iBACrB,WAAW,WACX,KAAK,QA0Ff;sBAzGqB,6BAA6B"}

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

@@ -1,6 +1,6 @@
 import { assert } from "../../assert.js";
 import { array_copy } from "../../collection/array/array_copy.js";
-import { array_quick_sort_by_lookup } from "../../collection/array/array_quick_sort_by_lookup.js";
+import { array_quick_sort_by_lookup_uint } from "../../collection/array/array_quick_sort_by_lookup_uint.js";
 import { AABB3 } from "../../geom/3d/aabb/AABB3.js";
 import { aabb3_from_v3_array } from "../../geom/3d/aabb/aabb3_from_v3_array.js";
 import { aabb3_compute_from_triangle } from "../../geom/3d/aabb3_compute_from_triangle.js";
@@ -73,7 +73,7 @@ export function ebvh_build_for_geometry_morton(
     build_triangle_morton_codes(morton_codes, tri_count, index_array, position_array, bounds.x0, bounds.y0, bounds.z0, bounds.x1, bounds.y1, bounds.z1);
 
     // sort leaves by morton codes
-    array_quick_sort_by_lookup(sorted_triangle_order, morton_codes, 0, tri_count - 1);
+    array_quick_sort_by_lookup_uint(sorted_triangle_order, morton_codes, 0, tri_count - 1);
 
     // assign leaves
     for (let i = 0; i < tri_count; i++) {
@@ -81,11 +81,6 @@ export function ebvh_build_for_geometry_morton(
 
         const triangle_index = sorted_triangle_order[i];
 
-        bvh.node_set_child1(node, NULL_NODE); //mark node as a leaf
-        bvh.node_set_user_data(node, triangle_index);
-
-        bvh.node_set_height(node, 0);
-
         const triangle_index3 = triangle_index * 3;
 
         const a_index = index_array[triangle_index3];
@@ -99,6 +94,10 @@ export function ebvh_build_for_geometry_morton(
             position_array, a_index, b_index, c_index
         );
 
+        bvh.node_set_child1(node, NULL_NODE); //mark node as a leaf
+        bvh.node_set_user_data(node, triangle_index);
+
+        bvh.node_set_height(node, 0);
     }
 
     // record newly generated nodes as "unprocessed"

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":"AAGA;;;;;;;;;;GAUG;AACH,kEANW,MAAM,EAAE,GAAC,WAAW,oBACpB,MAAM,aACN,MAAM,EAAE,GAAC,WAAW,oBACpB,MAAM,GACJ,MAAM,CAyDlB"}
+{"version":3,"file":"ebvh_build_hierarchy.d.ts","sourceRoot":"","sources":["../../../../../src/core/bvh2/bvh3/ebvh_build_hierarchy.js"],"names":[],"mappings":"AAIA;;;;;;;;;;GAUG;AACH,kEANW,MAAM,EAAE,GAAC,WAAW,oBACpB,MAAM,aACN,MAAM,EAAE,GAAC,WAAW,oBACpB,MAAM,GACJ,MAAM,CA4DlB"}

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

@@ -1,5 +1,6 @@
 import { assert } from "../../assert.js";
 import { max2 } from "../../math/max2.js";
+import { NULL_NODE } from "./BVH.js";
 
 /**
  * Given a set of leaves, build intermediate node hierarchy on top, all the way up to the root
@@ -66,5 +67,8 @@ export function ebvh_build_hierarchy(
         unprocessed_node_count = added_nodes;
     }
 
+    // set the root to have no parent
+    bvh.node_set_parent(unprocessed_nodes[0], NULL_NODE);
+
     return unprocessed_nodes[0];
 }

package/src/core/bvh2/bvh3/query/backtracking/bvh_backtracking_query_leaves_ray.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Traverses bvh starting from a given node, but can back-track all the way up to the root
+ * @param {BVH} bvh
+ * @param {number} starting_node
+ * @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_backtracking_query_leaves_ray(bvh: BVH, starting_node: 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_backtracking_query_leaves_ray.d.ts.map

package/src/core/bvh2/bvh3/query/backtracking/bvh_backtracking_query_leaves_ray.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvh_backtracking_query_leaves_ray.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/bvh2/bvh3/query/backtracking/bvh_backtracking_query_leaves_ray.js"],"names":[],"mappings":"AAQA;;;;;;;;;;;;;GAaG;AACH,2EAXW,MAAM,UACN,MAAM,EAAE,iBACR,MAAM,YACN,MAAM,YACN,MAAM,YACN,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,GACJ,MAAM,CA6GlB"}