@woosh/meep-engine 2.33.25 → 2.33.29

package/core/binary/ValidatingBitSetWrapper.js

@@ -0,0 +1,81 @@
+//
+
+/**
+ * Debug tool to verify correct behavior of a BitSet
+ */
+export class ValidatingBitSetWrapper {
+    /**
+     *
+     * @param {BitSet} source
+     */
+    constructor(source) {
+        this.__source = source;
+    }
+
+    preventShrink() {
+        this.__source.preventShrink();
+    }
+
+    setShrinkFactor(x) {
+        this.__source.setShrinkFactor(x);
+    }
+
+    setCapacity(x) {
+        this.__source.setCapacity(x);
+    }
+
+    size() {
+        return this.__source.size();
+    }
+
+    capacity() {
+        return this.__source.capacity();
+    }
+
+    previousSetBit(i) {
+        const bit = this.__source.previousSetBit(i);
+
+        if (bit !== -1 && (this.__source.get(bit) !== true || bit > i)) {
+            debugger;
+        }
+
+        return bit;
+    }
+
+    nextSetBit(i) {
+        const bit = this.__source.nextSetBit(i);
+
+        if (bit !== -1 && (this.__source.get(bit) !== true || bit < i)) {
+            debugger;
+        }
+
+        return bit;
+    }
+
+    nextClearBit(i) {
+        const bit = this.__source.nextClearBit(i);
+
+        if (bit !== -1 && (this.__source.get(bit) !== false || bit < i)) {
+            debugger;
+        }
+
+        return bit;
+    }
+
+    set(x, y) {
+        this.__source.set(x, y);
+    }
+
+    clear(i) {
+        this.__source.clear(i);
+    }
+
+    get(i) {
+        return this.__source.get(i);
+    }
+
+
+    reset() {
+        this.__source.reset();
+    }
+}

package/core/bvh2/aabb3/AABB3.js

@@ -761,16 +761,9 @@ AABB3.prototype.computePlaneSide = function computePlaneSide(plane) {
     const normal = plane.normal;
 
     return computeAABB3PlaneSide(
-        normal.x,
-        normal.y,
-        normal.z,
-        plane.constant,
-        this.x0,
-        this.y0,
-        this.z0,
-        this.x1,
-        this.y1,
-        this.z1
+        normal.x, normal.y, normal.z, plane.constant,
+        this.x0, this.y0, this.z0,
+        this.x1, this.y1, this.z1
     );
 };
 

package/core/cache/Cache.d.ts

@@ -4,13 +4,15 @@ export class Cache<K, V> {
                     keyWeigher,
                     valueWeigher,
                     keyHashFunction,
-                    keyEqualityFunction
+                    keyEqualityFunction,
+                    capacity
                 }?: {
         maxWeight?: number,
         keyWeigher?: (key: K) => number,
         valueWeigher?: (value: V) => number,
         keyHashFunction?: (key: K) => number,
-        keyEqualityFunction?: (a: K, b: K) => boolean
+        keyEqualityFunction?: (a: K, b: K) => boolean,
+        capacity?: number
     })
 
     size(): number

package/core/cache/Cache.js

@@ -16,6 +16,7 @@ export class Cache {
      * @param {function(key:Key, value:Value)} [removeListener] will be notified when element is either explicitly removed or evicted
      * @param {function(Key):number} [keyHashFunction]
      * @param {function(Key, Key):boolean} [keyEqualityFunction]
+     * @param {number} capacity initial capacity for the cache, helps prevent early resizing
      * @constructor
      * @template Key, Value
      */
@@ -25,7 +26,8 @@ export class Cache {
                     valueWeigher = returnOne,
                     removeListener = noop,
                     keyHashFunction = returnZero,
-                    keyEqualityFunction = strictEquals
+                    keyEqualityFunction = strictEquals,
+                    capacity
                 } = {}) {
 
         assert.isNumber(maxWeight, 'maxWeight');
@@ -95,7 +97,8 @@ export class Cache {
          */
         this.data = new HashMap({
             keyHashFunction,
-            keyEqualityFunction
+            keyEqualityFunction,
+            capacity
         });
 
         /**

package/core/collection/HashMap.d.ts

@@ -1,7 +1,14 @@
 export class HashMap<K, V> implements Iterable<[V, K]> {
-    constructor({keyHashFunction, keyEqualityFunction}: {
+    constructor({
+                    keyHashFunction,
+                    keyEqualityFunction,
+                    capacity,
+                    loadFactor
+                }: {
         keyHashFunction: (k: K) => number,
-        keyEqualityFunction: (a: K, b: K) => boolean
+        keyEqualityFunction: (a: K, b: K) => boolean,
+        capacity?: number,
+        loadFactor?: number
     })
 
     constructor()

package/core/collection/HashSet.d.ts

@@ -1,7 +1,12 @@
 export class HashSet<T> {
-    constructor({keyHashFunction, keyEqualityFunction}: {
+    constructor({
+                    keyHashFunction,
+                    keyEqualityFunction,
+                    capacity
+                }: {
         keyHashFunction: (k: T) => number,
-        keyEqualityFunction: (a: T, b: T) => boolean
+        keyEqualityFunction: (a: T, b: T) => boolean,
+        capacity?: number
     })
 
     constructor()

package/core/collection/HashSet.js

@@ -11,7 +11,11 @@ export class HashSet {
     /**
      * @template T
      */
-    constructor({ keyHashFunction = invokeObjectHash, keyEqualityFunction = invokeObjectEquals } = {}) {
+    constructor({
+                    keyHashFunction = invokeObjectHash,
+                    keyEqualityFunction = invokeObjectEquals,
+                    capacity
+                } = {}) {
 
         /**
          * Using HashMap as a backing, this is not the most efficient approach, but it works
@@ -20,7 +24,8 @@ export class HashSet {
          */
         this.__map = new HashMap({
             keyHashFunction,
-            keyEqualityFunction
+            keyEqualityFunction,
+            capacity
         });
     }
 

package/core/collection/array/typed/typed_array_copy.js

@@ -2,7 +2,7 @@ import { array_copy } from "../copyArray.js";
 
 
 /**
- *
+ * Assumes arrays have the same type
  * @param {TypedArray|Float32Array} source
  * @param {TypedArray|Float32Array} destination
  */

package/core/geom/3d/frustum/array_setFromProjectionMatrix.js

@@ -1,5 +1,3 @@
-import { v3_length } from "../../v3_length.js";
-
 /**
  *
  * @param {number[]} destination
@@ -10,10 +8,12 @@ import { v3_length } from "../../v3_length.js";
  * @param {number} w
  */
 function array_set_plane_normalized(destination, destination_offset, x, y, z, w) {
-    const length = v3_length(x, y, z);
+    // compute vector length
+    const length = Math.hypot(x, y, z);
 
     const inverseNormalLength = 1.0 / length;
 
+    // apply normalization
     destination[destination_offset] = x * inverseNormalLength;
     destination[destination_offset + 1] = y * inverseNormalLength;
     destination[destination_offset + 2] = z * inverseNormalLength;

package/core/geom/3d/shape/AbstractShape3D.js

@@ -1,5 +1,31 @@
 export class AbstractShape3D {
-    constructor() {
+    /**
+     * Signed distance to boundary of the shape from the given point
+     * @param {number[]} point
+     * @returns {number}
+     */
+    signed_distance_at_point(point) {
+        throw new Error('Not Implemented');
+    }
+
+    /**
+     * Samples both distances as well as the gradient
+     * @param {number[]} result resulting gradient is written here
+     * @param {number[]} point sampling point
+     * @returns {number}
+     */
+    signed_distance_gradient_at_point(result, point) {
+        throw new Error('Not Implemented');
+    }
+
+    /**
+     *
+     * @param {number[]} result where the resulting point is stored
+     * @param {number[]} reference reference point from which to go
+     * @returns {void}
+     */
+    nearest_point_on_surface(result, reference) {
+        throw new Error('Not Implemented');
     }
 
     /**
@@ -7,6 +33,7 @@ export class AbstractShape3D {
      * @param {number[]} result
      * @param {number} result_offset
      * @param {function} random
+     * @returns {void}
      */
     sample_random_point_in_volume(result, result_offset, random) {
         throw new Error('Not Implemented');

package/core/geom/3d/shape/TransformedShape3D.js

@@ -1,11 +1,12 @@
 import { mat4, vec3 } from "gl-matrix";
 import { AbstractShape3D } from "./AbstractShape3D.js";
+import { sign } from "../../../math/sign.js";
 
 /**
  *
  * @type {number[]|Float32Array|vec3}
  */
-const scratch_v3 = [];
+const scratch_v3_0 = [];
 
 export class TransformedShape3D extends AbstractShape3D {
     constructor() {
@@ -98,29 +99,83 @@ export class TransformedShape3D extends AbstractShape3D {
     }
 
     get volume() {
-        mat4.getScaling(scratch_v3, this.__matrix);
+        mat4.getScaling(scratch_v3_0, this.__matrix);
 
-        const scale_modifier = scratch_v3[0] * scratch_v3[1] * scratch_v3[2];
+        const scale_modifier = scratch_v3_0[0] * scratch_v3_0[1] * scratch_v3_0[2];
 
         return this.__subject.volume * scale_modifier;
     }
 
+    signed_distance_gradient_at_point(result, point) {
+        // transform point to subject's local space
+        vec3.transformMat4(scratch_v3_0, point, this.__inverse_matrix);
+
+        const subject = this.__subject;
+
+        // sample gradient at the point
+        const distance = subject.signed_distance_gradient_at_point(scratch_v3_0, scratch_v3_0);
+
+        const m = this.__matrix;
+
+        const m11 = m[0];
+        const m12 = m[1];
+        const m13 = m[2];
+
+        const m21 = m[4];
+        const m22 = m[5];
+        const m23 = m[6];
+
+        const m31 = m[8];
+        const m32 = m[9];
+        const m33 = m[10];
+
+        const scale_x = Math.hypot(m11, m12, m13);
+        const scale_y = Math.hypot(m21, m22, m23);
+        const scale_z = Math.hypot(m31, m32, m33);
+
+        const scaled_gx = scratch_v3_0[0] * scale_x;
+        const scaled_gy = scratch_v3_0[1] * scale_y;
+        const scaled_gz = scratch_v3_0[2] * scale_z;
+
+        // normalize gradient
+        const gd = distance / Math.hypot(scratch_v3_0[0], scratch_v3_0[1], scratch_v3_0[2]);
+
+        const scaled_dx = scaled_gx * gd ;
+        const scaled_dy = scaled_gy * gd ;
+        const scaled_dz = scaled_gz * gd ;
+
+        // determine sign
+        const result_sign = sign(distance);
+
+        const scaled_distance = result_sign * Math.sqrt(scaled_dx * scaled_dx + scaled_dy * scaled_dy + scaled_dz * scaled_dz);
+
+        result[0] = scaled_gx;
+        result[1] = scaled_gy;
+        result[2] = scaled_gz;
+
+        return scaled_distance;
+    }
+
+    signed_distance_at_point(point) {
+        return this.signed_distance_gradient_at_point(scratch_v3_0, point);
+    }
+
     contains_point(point) {
         // transform point to subject's local space
-        vec3.transformMat4(scratch_v3, point, this.__inverse_matrix);
+        vec3.transformMat4(scratch_v3_0, point, this.__inverse_matrix);
 
-        return this.__subject.contains_point(scratch_v3);
+        return this.__subject.contains_point(scratch_v3_0);
     }
 
     sample_random_point_in_volume(result, result_offset, random) {
-        this.__subject.sample_random_point_in_volume(scratch_v3, 0, random);
+        this.__subject.sample_random_point_in_volume(scratch_v3_0, 0, random);
 
         // apply transform
-        vec3.transformMat4(scratch_v3, scratch_v3, this.__matrix);
+        vec3.transformMat4(scratch_v3_0, scratch_v3_0, this.__matrix);
 
         // write out
-        result[0] = scratch_v3[0];
-        result[1] = scratch_v3[1];
-        result[2] = scratch_v3[2];
+        result[0] = scratch_v3_0[0];
+        result[1] = scratch_v3_0[1];
+        result[2] = scratch_v3_0[2];
     }
 }

package/core/geom/3d/shape/TransformedShape3D.spec.js

@@ -0,0 +1,33 @@
+import { UnitCubeShape3D } from "./UnitCubeShape3D.js";
+import { TransformedShape3D } from "./TransformedShape3D.js";
+
+test('signed distance identity transform', () => {
+
+    const s = TransformedShape3D.from_translation_scale(new UnitCubeShape3D(), [0, 0, 0], [1, 1, 1]);
+
+    expect(s.signed_distance_at_point([0, 0, 0])).toBeCloseTo(-0.5);
+
+    expect(s.signed_distance_at_point([1, 0, 0])).toBeCloseTo(0.5);
+});
+
+test('signed distance translation', () => {
+
+    const s = TransformedShape3D.from_translation_scale(new UnitCubeShape3D(), [1, 0, 0], [1, 1, 1]);
+
+    expect(s.signed_distance_at_point([0, 0, 0])).toBeCloseTo(0.5);
+
+    expect(s.signed_distance_at_point([-1, 0, 0])).toBeCloseTo(1.5);
+
+    expect(s.signed_distance_at_point([1, 0, 0])).toBeCloseTo(-0.5);
+});
+
+test('signed distance scale', () => {
+
+    const s = TransformedShape3D.from_translation_scale(new UnitCubeShape3D(), [0, 0, 0], [2, 2, 2]);
+
+    expect(s.signed_distance_at_point([0, 0, 0])).toBeCloseTo(-1);
+
+    expect(s.signed_distance_at_point([1, 0, 0])).toBeCloseTo(0);
+
+    expect(s.signed_distance_at_point([2, 0, 0])).toBeCloseTo(1);
+});

package/core/geom/3d/shape/{CompositeShape.js → UnionShape3D.js}

@@ -2,6 +2,8 @@ import { AbstractShape3D } from "./AbstractShape3D.js";
 import { seededRandom } from "../../../math/random/seededRandom.js";
 import { binarySearchHighIndex } from "../../../collection/array/binarySearchHighIndex.js";
 import { compareNumbers } from "../../../primitives/numbers/compareNumbers.js";
+import { min2 } from "../../../math/min2.js";
+import { compute_signed_distance_gradient_by_sampling } from "./util/compute_signed_distance_gradient_by_sampling.js";
 
 /**
  * To avoid severe performance overhead, we limit number of possible rejections
@@ -18,16 +20,7 @@ const VOLUME_OVERLAP_ESTIMATION_SUB_TAPS = 4;
 
 const scratch_array = [];
 
-/**
- *
- * @param {AbstractShape3D} shape
- * @return {number}
- */
-function getVolume(shape) {
-    return shape.volume;
-}
-
-export class CompositeShape3D extends AbstractShape3D {
+export class UnionShape3D extends AbstractShape3D {
     constructor() {
         super();
 
@@ -50,6 +43,10 @@ export class CompositeShape3D extends AbstractShape3D {
         this.__child_volumes = [];
     }
 
+    /**
+     *
+     * @private
+     */
     __compute_volume_variables() {
         this.__volume_sum = 0;
 
@@ -123,7 +120,7 @@ export class CompositeShape3D extends AbstractShape3D {
     }
 
     static from(children) {
-        const r = new CompositeShape3D();
+        const r = new UnionShape3D();
 
         r.children = children;
 
@@ -169,6 +166,25 @@ export class CompositeShape3D extends AbstractShape3D {
         return r;
     }
 
+    signed_distance_gradient_at_point(result, point) {
+        return compute_signed_distance_gradient_by_sampling(result, this, point);
+    }
+
+    signed_distance_at_point(point) {
+        let r = Infinity;
+
+        const children = this.children;
+        const child_count = children.length;
+
+        for (let i = 0; i < child_count; i++) {
+            const child = children[i];
+
+            r = min2(child.signed_distance_at_point(point), r);
+        }
+
+        return r;
+    }
+
     contains_point(point) {
         const children = this.children;
         const n = children.length;
@@ -183,7 +199,6 @@ export class CompositeShape3D extends AbstractShape3D {
         return false;
     }
 
-
     sample_random_point_in_volume(result, result_offset, random) {
         const children = this.children;
         const child_count = children.length;

package/core/geom/3d/shape/UnitCubeShape3D.js

@@ -1,5 +1,11 @@
 import { AbstractShape3D } from "./AbstractShape3D.js";
 import { randomPointInBox } from "../../random/randomPointInBox.js";
+import { v3_length } from "../../v3_length.js";
+import { max2 } from "../../../math/max2.js";
+import { max3 } from "../../../math/max3.js";
+import { min2 } from "../../../math/min2.js";
+import { clamp } from "../../../math/clamp.js";
+import { compute_signed_distance_gradient_by_sampling } from "./util/compute_signed_distance_gradient_by_sampling.js";
 
 export class UnitCubeShape3D extends AbstractShape3D {
 
@@ -7,6 +13,77 @@ export class UnitCubeShape3D extends AbstractShape3D {
         return 1;
     }
 
+    nearest_point_on_surface(result, reference) {
+        const r_x = reference[0];
+        const r_y = reference[1];
+        const r_z = reference[2];
+
+        // figure out closest face to the reference point
+        const ar_x = Math.abs(r_x);
+        const ar_y = Math.abs(r_y);
+        const ar_z = Math.abs(r_z);
+
+        if (ar_x > ar_y && ar_x > ar_z) {
+            // X is smallest, project onto X axis
+            if (r_x <= 0) {
+                result[0] = -0.5;
+            } else {
+                result[0] = 0.5;
+            }
+
+            result[1] = clamp(r_y, -0.5, 0.5);
+            result[2] = clamp(r_z, -0.5, 0.5);
+        } else if (ar_y > ar_x && ar_y > ar_z) {
+            // Y is smallest, project onto X axis
+            if (r_y <= 0) {
+                result[1] = -0.5;
+            } else {
+                result[1] = 0.5;
+            }
+
+            result[0] = clamp(r_x, -0.5, 0.5);
+            result[2] = clamp(r_z, -0.5, 0.5);
+        } else {
+            // project onto Z axis
+
+            if (r_z <= 0) {
+                result[2] = -0.5;
+            } else {
+                result[2] = 0.5;
+            }
+
+            result[0] = clamp(r_x, -0.5, 0.5);
+            result[1] = clamp(r_y, -0.5, 0.5);
+        }
+    }
+
+    signed_distance_gradient_at_point(result, point) {
+        return compute_signed_distance_gradient_by_sampling(result,this, point);
+    }
+
+    signed_distance_at_point(point) {
+        /*
+        based on https://www.iquilezles.org/www/articles/distfunctions/distfunctions.htm
+        original shader code:
+            ------------
+            float sdBox( vec3 p, vec3 b )
+            {
+              vec3 q = abs(p) - b;
+              return length(max(q,0.0)) + min(max(q.x,max(q.y,q.z)),0.0);
+            }
+            ------------
+         */
+        const q_x = Math.abs(point[0]) - 0.5;
+        const q_y = Math.abs(point[1]) - 0.5;
+        const q_z = Math.abs(point[2]) - 0.5;
+
+        return v3_length(
+            max2(q_x, 0),
+            max2(q_y, 0),
+            max2(q_z, 0)
+        ) + min2(max3(q_x, q_y, q_z), 0);
+    }
+
     contains_point(point) {
         const x = point[0];
         const y = point[1];

package/core/geom/3d/shape/UnitCubeShape3D.spec.js

@@ -0,0 +1,42 @@
+import { UnitCubeShape3D } from "./UnitCubeShape3D.js";
+
+test('signed distance', () => {
+    const s = new UnitCubeShape3D();
+
+    expect(s.signed_distance_at_point([0, 0, 0])).toBeCloseTo(-0.5);
+
+    expect(s.signed_distance_at_point([0.5, 0, 0])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0, 0.5, 0])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0, 0, 0.5])).toBeCloseTo(0);
+
+    expect(s.signed_distance_at_point([-0.5, 0, 0])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0, -0.5, 0])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0, 0, -0.5])).toBeCloseTo(0);
+
+    expect(s.signed_distance_at_point([0.5, 0.5, 0])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0, 0.5, 0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0.5, 0, 0.5])).toBeCloseTo(0);
+
+    expect(s.signed_distance_at_point([-0.5, 0.5, 0])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0.5, -0.5, 0])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([-0.5, -0.5, 0])).toBeCloseTo(0);
+
+    expect(s.signed_distance_at_point([0, -0.5, 0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0, 0.5, -0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0, -0.5, -0.5])).toBeCloseTo(0);
+
+    expect(s.signed_distance_at_point([-0.5, 0, 0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0.5, 0, -0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([-0.5, 0, -0.5])).toBeCloseTo(0);
+
+    expect(s.signed_distance_at_point([0.5, 0.5, 0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([-0.5, 0.5, 0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0.5, -0.5, 0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0.5, 0.5, -0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([-0.5, -0.5, 0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([0.5, -0.5, -0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([-0.5, 0.5, -0.5])).toBeCloseTo(0);
+    expect(s.signed_distance_at_point([-0.5, -0.5, -0.5])).toBeCloseTo(0);
+
+    expect(s.signed_distance_at_point([1, 0, 0])).toBeCloseTo(0.5);
+});

package/core/geom/3d/shape/UnitSphereShape3D.js

@@ -1,6 +1,11 @@
 import { AbstractShape3D } from "./AbstractShape3D.js";
 import { randomPointInSphere } from "../../random/randomPointInSphere.js";
+import { v3_length } from "../../v3_length.js";
+import { compute_signed_distance_gradient_by_sampling } from "./util/compute_signed_distance_gradient_by_sampling.js";
 
+/**
+ * Sphere with diameter of 1 (radius = 0.5)
+ */
 export class UnitSphereShape3D extends AbstractShape3D {
     get volume() {
         return 0.523598776;
@@ -10,12 +15,38 @@ export class UnitSphereShape3D extends AbstractShape3D {
         return 3.14159265;
     }
 
+    nearest_point_on_surface(result, reference) {
+
+        const r_x = reference[0];
+        const r_y = reference[1];
+        const r_z = reference[2];
+
+        // normalize vector to 0.5 radius
+        const d = 0.5 / Math.hypot(r_x, r_y, r_z);
+
+        result[0] = r_x * d;
+        result[1] = r_y * d;
+        result[2] = r_z * d;
+    }
+
+    signed_distance_gradient_at_point(result, point) {
+        return compute_signed_distance_gradient_by_sampling(result,this, point);
+    }
+
+    signed_distance_at_point(point) {
+        return v3_length(
+            point[0],
+            point[1],
+            point[2]
+        ) - 0.5;
+    }
+
     contains_point(point) {
         const x = point[0];
         const y = point[1];
         const z = point[2];
 
-        return (x * x + y * y + z * z) < 1;
+        return (x * x + y * y + z * z) < 0.25;
     }
 
     sample_random_point_in_volume(result, result_offset, random) {