@woosh/meep-engine 2.110.7 → 2.110.9

package/src/core/collection/array/fastArrayEquals.js

@@ -5,6 +5,7 @@ import { is_typed_array_equals } from "./typed/is_typed_array_equals.js";
  *
  * @param {number[]|Uint8Array} a
  * @param {number[]|Uint8Array} b
+ * @returns {boolean}
  */
 export function fastArrayEquals(a, b) {
     if (Array.isArray(a) || Array.isArray(b)) {

package/src/core/collection/array/isArrayEqual.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"isArrayEqual.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/isArrayEqual.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,6DAFY,OAAO,CAqDlB"}
+{"version":3,"file":"isArrayEqual.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/isArrayEqual.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,6DAFY,OAAO,CAkDlB"}

package/src/core/collection/array/isArrayEqual.js

@@ -14,16 +14,16 @@ export function isArrayEqual(first, second) {
     assert.defined(second, 'second');
     assert.isArray(second, 'second');
 
-    const il = first.length;
+    const element_count = first.length;
 
-    if (il !== second.length) {
+    if (element_count !== second.length) {
         // arrays are of different size
         return false;
     }
 
     let i = 0;
 
-    for (; i < il; i++) {
+    for (; i < element_count; i++) {
 
         const a = first[i];
         const b = second[i];
@@ -32,19 +32,16 @@ export function isArrayEqual(first, second) {
             continue;
         }
 
-
-        if (a === undefined) {
-            // A is undefined, and B is something else
-            return false;
-        }
-
-        if (a === null) {
-            // A is null and B is something else
+        if (
+            a === undefined || a === null
+            || b === undefined || b === null
+        ) {
+            // shortcut to avoid working with nulls and undefined values
             return false;
         }
 
         // try "equals" method
-        if (typeof a.equals === "function") {
+        if (typeof a === "object" && typeof a.equals === "function") {
 
             if (!a.equals(b)) {
                 return false;

package/src/core/collection/array/isArrayEqual.spec.d.ts

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

package/src/core/collection/array/isArrayEqual.spec.d.ts.map

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

package/src/core/collection/array/isArrayEqual.spec.js

@@ -0,0 +1,25 @@
+import { isArrayEqual } from "./isArrayEqual.js";
+
+test("empty", () => {
+
+    expect(isArrayEqual([], [])).toBe(true);
+
+});
+
+test("primitives", () => {
+
+    expect(isArrayEqual([1], [1])).toBe(true);
+    expect(isArrayEqual([1], [7])).toBe(false);
+
+    expect(isArrayEqual([1, 3], [1, 3])).toBe(true);
+
+    expect(isArrayEqual([""], [""])).toBe(true);
+    expect(isArrayEqual(["a"], ["a"])).toBe(true);
+    expect(isArrayEqual(["a"], ["b"])).toBe(false);
+    expect(isArrayEqual(["a"], ["a", "b"])).toBe(false);
+
+    expect(isArrayEqual([true], [true])).toBe(true);
+    expect(isArrayEqual([true], [true, true])).toBe(false);
+    expect(isArrayEqual([true], [false])).toBe(false);
+
+});

package/src/core/collection/array/typed/is_typed_array_equals.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"is_typed_array_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_typed_array_equals.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,yCAJW,UAAU,GAAC,WAAW,KACtB,UAAU,GAAC,WAAW,GACpB,OAAO,CAiEnB"}
+{"version":3,"file":"is_typed_array_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_typed_array_equals.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,yCAJW,UAAU,GAAC,WAAW,KACtB,UAAU,GAAC,WAAW,GACpB,OAAO,CAkEnB"}

package/src/core/collection/array/typed/is_typed_array_equals.js

@@ -8,6 +8,7 @@ import { isArrayEqualStrict } from "../isArrayEqualStrict.js";
  * @returns {boolean}
  */
 export function is_typed_array_equals(a, b) {
+
     if (a === b) {
         // quick shortcut
         return true;

package/src/core/function/makeSequenceLoop.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"makeSequenceLoop.d.ts","sourceRoot":"","sources":["../../../../src/core/function/makeSequenceLoop.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,4DAcC"}

package/src/core/geom/3d/shape/AbstractShape3D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AbstractShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/AbstractShape3D.js"],"names":[],"mappings":"AAAA;IACI;;;;OAIG;IACH,gCAHW,MAAM,EAAE,GACN,MAAM,CAIlB;IAED;;;;;OAKG;IACH,0CAJW,MAAM,EAAE,SACR,MAAM,EAAE,GACN,MAAM,CAIlB;IAED;;;;;OAKG;IACH,iCAJW,MAAM,EAAE,aACR,MAAM,EAAE,GACN,IAAI,CAIhB;IAED;;;;;;OAMG;IACH,sCALW,MAAM,EAAE,iBACR,MAAM,qBAEJ,IAAI,CAIhB;IAED;;;;OAIG;IACH,sBAHW,MAAM,EAAE,GACN,OAAO,CAInB;IAED;;;OAGG;IACH,qBAEC;IAED;;OAEG;IACH,2BAEC;IAED;;;;OAIG;IACH,6BAHW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,GAAC,YAAY,GAClD,IAAI,CAIhB;IAED;;;;OAIG;IACH,6CAFa,OAAO,CAInB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;CACJ"}
+{"version":3,"file":"AbstractShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/AbstractShape3D.js"],"names":[],"mappings":"AAAA;IACI;;;;OAIG;IACH,gCAHW,MAAM,EAAE,GACN,MAAM,CAIlB;IAED;;;;;OAKG;IACH,0CAJW,MAAM,EAAE,SACR,MAAM,EAAE,GACN,MAAM,CAIlB;IAED;;;;;OAKG;IACH,iCAJW,MAAM,EAAE,aACR,MAAM,EAAE,GACN,IAAI,CAIhB;IAED;;;;;;OAMG;IACH,sCALW,MAAM,EAAE,iBACR,MAAM,qBAEJ,IAAI,CAIhB;IAED;;;;OAIG;IACH,sBAHW,MAAM,EAAE,GACN,OAAO,CAInB;IAED;;;OAGG;IACH,qBAEC;IAED;;OAEG;IACH,2BAEC;IAED;;;;OAIG;IACH,6BAHW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,GAAC,YAAY,GAClD,IAAI,CAIhB;IAED;;;;;;;;;OASG;IACH,gBAPW,MAAM,EAAE,GAAC,YAAY,iBACrB,MAAM,eACN,MAAM,eACN,MAAM,eACN,MAAM,GACJ,IAAI,CAIhB;IAED;;;;OAIG;IACH,6CAFa,OAAO,CAInB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;CACJ"}

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

@@ -72,6 +72,20 @@ export class AbstractShape3D {
         throw new Error('Not Implemented');
     }
 
+    /**
+     * Support function, given a direction vector, return point on the shape that's furthest in that direction
+     * Assumes direction is a unit vector
+     * @param {number[]|Float32Array} result
+     * @param {number} result_offset
+     * @param {number} direction_x
+     * @param {number} direction_y
+     * @param {number} direction_z
+     * @returns {void}
+     */
+    support(result, result_offset, direction_x, direction_y, direction_z) {
+        throw new Error("Not Implemented");
+    }
+
     /**
      * @template {AbstractShape3D} T
      * @param {T} other

package/src/core/geom/3d/shape/PointShape3D.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Describes a point, shape that encloses no space
+ */
+export class PointShape3D extends AbstractShape3D {
+    static INSTANCE: PointShape3D;
+    support(result: any, result_offset: any, direction_x: any, direction_y: any, direction_z: any): void;
+}
+import { AbstractShape3D } from "./AbstractShape3D.js";
+//# sourceMappingURL=PointShape3D.d.ts.map

package/src/core/geom/3d/shape/PointShape3D.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PointShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/PointShape3D.js"],"names":[],"mappings":"AAEA;;GAEG;AACH;IAOI,8BAAqC;IANrC,qGAIC;CAGJ;gCAb+B,sBAAsB"}

package/src/core/geom/3d/shape/PointShape3D.js

@@ -0,0 +1,14 @@
+import { AbstractShape3D } from "./AbstractShape3D.js";
+
+/**
+ * Describes a point, shape that encloses no space
+ */
+export class PointShape3D extends AbstractShape3D {
+    support(result, result_offset, direction_x, direction_y, direction_z) {
+        result[result_offset] = 0;
+        result[result_offset + 1] = 0;
+        result[result_offset + 2] = 0;
+    }
+
+    static INSTANCE = new PointShape3D();
+}

package/src/core/geom/3d/shape/TransformedShape3D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TransformedShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/TransformedShape3D.js"],"names":[],"mappings":";AAcA;IAkCI;;;;;OAKG;IACH,wBAHW,eAAe,MADf,MAAM,EAAE,GAAC,YAAY,GAAC,IAAI,GAExB,kBAAkB,CAS9B;IAED;;;;;OAKG;IACH,uCAJW,eAAe,eACf,MAAM,EAAE,SACR,MAAM,EAAE,sBAQlB;IAED;;;;;OAKG;IACH,2BAHW,eAAe,SACf,MAAM,EAAE,GAAC,YAAY,GAAC,IAAI,GAFxB,kBAAkB,CAS9B;IAtEG;;;;OAIG;IACH,iBAAoC;IAEpC;;;;OAIG;IACH,yBAA4C;IAE5C;;;;OAIG;IACH,kBAAqB;IAGzB;;;OAGG;IACH,+BAEC;IA4CD;;;OAGG;IACH,4CAIC;IAED,yCAEC;IAED,qBAMC;IAED,wCAKC;IAED,mEAgDC;IAED,6CAEC;IAED,gCAKC;IAED,kFAUC;IAED;;;;OAIG;IACH,cAHW,kBAAkB,GAChB,OAAO,CAOnB;IAED,eAGC;CACJ;;8BAIS,OAAO;;gCA9Me,sBAAsB;qBAN3B,WAAW;qBAAX,WAAW"}
+{"version":3,"file":"TransformedShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/TransformedShape3D.js"],"names":[],"mappings":";AAgBA;IAkCI;;;;;OAKG;IACH,wBAHW,eAAe,MADf,MAAM,EAAE,GAAC,YAAY,GAAC,IAAI,GAExB,kBAAkB,CAS9B;IAED;;;;;OAKG;IACH,uCAJW,eAAe,eACf,MAAM,EAAE,SACR,MAAM,EAAE,sBAalB;IAED;;;;OAIG;IACH,iCAHW,eAAe,eACf,MAAM,EAAE,sBAIlB;IAED;;;;;OAKG;IACH,2BAHW,eAAe,SACf,MAAM,EAAE,GAAC,YAAY,GAAC,IAAI,GAFxB,kBAAkB,CAS9B;IApFG;;;;OAIG;IACH,iBAAoC;IAEpC;;;;OAIG;IACH,yBAA4C;IAE5C;;;;OAIG;IACH,kBAAqB;IAGzB;;;OAGG;IACH,+BAEC;IA0DD;;;OAGG;IACH,4CAIC;IAED,yCAEC;IAED,qBAMC;IAED,wCAKC;IAED,mEAgDC;IAED,6CAEC;IAED,gCAKC;IAED,kFAIC;IAED,qGAMC;IAED;;;;OAIG;IACH,cAHW,kBAAkB,GAChB,OAAO,CAOnB;IAED,eAGC;CACJ;;8BAIS,OAAO;;gCA9Ne,sBAAsB;qBAR3B,WAAW;qBAAX,WAAW"}

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

@@ -1,8 +1,10 @@
 import { mat4, vec3 } from "gl-matrix";
+import { assert } from "../../../assert.js";
 import { isArrayEqualStrict } from "../../../collection/array/isArrayEqualStrict.js";
 import { computeHashFloatArray } from "../../../math/hash/computeHashFloatArray.js";
 import { sign } from "../../../math/sign.js";
 import { v3_length } from "../../vec3/v3_length.js";
+import { v3_matrix4_multiply } from "../../vec3/v3_matrix4_multiply.js";
 import { aabb3_matrix4_project } from "../aabb/aabb3_matrix4_project.js";
 import { AbstractShape3D } from "./AbstractShape3D.js";
 
@@ -10,7 +12,7 @@ import { AbstractShape3D } from "./AbstractShape3D.js";
  *
  * @type {number[]|Float32Array|vec3}
  */
-const scratch_v3_0 = [];
+const scratch_v3_0 = new Float32Array(3);
 
 export class TransformedShape3D extends AbstractShape3D {
     constructor() {
@@ -69,12 +71,26 @@ export class TransformedShape3D extends AbstractShape3D {
      */
     static from_translation_scale(subject, translation, scale) {
 
+        assert.isArrayLike(translation,'translation');
+        assert.greaterThanOrEqual(translation.length,3,'translation length must be >= 3');
+        assert.isArrayLike(scale,'scale');
+        assert.greaterThanOrEqual(scale.length,3,'scale length must be >= 3');
+
         const mat = mat4.create();
         mat4.fromRotationTranslationScale(mat, [0, 0, 0, 1], translation, scale);
 
         return TransformedShape3D.from_m4(subject, mat);
     }
 
+    /**
+     *
+     * @param {AbstractShape3D} subject
+     * @param {number[]} translation
+     */
+    static from_translation(subject, translation) {
+        return TransformedShape3D.from_translation_scale(subject, translation, [1, 1, 1]);
+    }
+
     /**
      *
      * @returns {TransformedShape3D}
@@ -119,7 +135,7 @@ export class TransformedShape3D extends AbstractShape3D {
 
     signed_distance_gradient_at_point(result, point) {
         // transform point to subject's local space
-        vec3.transformMat4(scratch_v3_0, point, this.__inverse_matrix);
+        v3_matrix4_multiply(scratch_v3_0, 0, point, 0, this.__inverse_matrix);
 
         const subject = this.__subject;
 
@@ -181,13 +197,15 @@ export class TransformedShape3D extends AbstractShape3D {
     sample_random_point_in_volume(result, result_offset, random) {
         this.__subject.sample_random_point_in_volume(scratch_v3_0, 0, random);
 
-        // apply transform
-        vec3.transformMat4(scratch_v3_0, scratch_v3_0, this.__matrix);
+        v3_matrix4_multiply(result, result_offset, scratch_v3_0, 0, this.__matrix);
+    }
+
+    support(result, result_offset, direction_x, direction_y, direction_z) {
+
+        this.__subject.support(scratch_v3_0, 0, direction_x, direction_y, direction_z);
+
+        v3_matrix4_multiply(result, result_offset, scratch_v3_0, 0, this.__matrix);
 
-        // write out
-        result[0] = scratch_v3_0[0];
-        result[1] = scratch_v3_0[1];
-        result[2] = scratch_v3_0[2];
     }
 
     /**

package/src/core/geom/3d/shape/UnionShape3D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UnionShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnionShape3D.js"],"names":[],"mappings":"AAwBA;IAqII;;;;OAIG;IACH,sBAHW,eAAe,EAAE,GACf,YAAY,CAQxB;IA5IG;;;OAGG;IACH,UAFU,eAAe,EAAE,CAET;IAElB;;;;;OAKG;IACH,kCAAmC;IAEnC,qBAAsB;IACtB,qBAAuB;IACvB,uBAAyB;IAG7B,wCAgCC;IAED;;;OAGG;IACH,mCAkBC;IAED;;;OAGG;IACH,2CA8CC;IAeD,qBAuBC;IAED,2BAYC;IAED,mEAEC;IAED,6CAaC;IAED,oCAYC;IAED,kFAoDC;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAKnB;IAED,eAWC;CACJ;gCA9T+B,sBAAsB"}
+{"version":3,"file":"UnionShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnionShape3D.js"],"names":[],"mappings":"AA0BA;IAqII;;;;OAIG;IACH,sBAHW,eAAe,EAAE,GACf,YAAY,CAQxB;IA5IG;;;OAGG;IACH,UAFU,eAAe,EAAE,CAET;IAElB;;;;;OAKG;IACH,kCAAmC;IAEnC,qBAAsB;IACtB,qBAAuB;IACvB,uBAAyB;IAG7B,wCAgCC;IAED;;;OAGG;IACH,mCAkBC;IAED;;;OAGG;IACH,2CA8CC;IAeD,qBAuBC;IAED,2BAYC;IAED,mEAEC;IAED,6CAaC;IAED,oCAYC;IAED,kFAoDC;IAED,qGAyBC;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAKnB;IAED,eAWC;CACJ;gCAnV+B,sBAAsB"}

package/src/core/geom/3d/shape/UnionShape3D.js

@@ -1,11 +1,13 @@
-import { AbstractShape3D } from "./AbstractShape3D.js";
-import { seededRandom } from "../../../math/random/seededRandom.js";
+import { array_copy } from "../../../collection/array/array_copy.js";
 import { binarySearchHighIndex } from "../../../collection/array/binarySearchHighIndex.js";
-import { min2 } from "../../../math/min2.js";
-import { compute_signed_distance_gradient_by_sampling } from "./util/compute_signed_distance_gradient_by_sampling.js";
 import { isArrayEqual } from "../../../collection/array/isArrayEqual.js";
 import { max2 } from "../../../math/max2.js";
+import { min2 } from "../../../math/min2.js";
+import { seededRandom } from "../../../math/random/seededRandom.js";
 import { number_compare_ascending } from "../../../primitives/numbers/number_compare_ascending.js";
+import { v3_dot } from "../../vec3/v3_dot.js";
+import { AbstractShape3D } from "./AbstractShape3D.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
@@ -294,6 +296,33 @@ export class UnionShape3D extends AbstractShape3D {
         }
     }
 
+    support(result, result_offset, direction_x, direction_y, direction_z) {
+        let best_distance = -Infinity;
+
+        const children = this.children;
+        const child_count = children.length;
+
+        for (let i = 0; i < child_count; i++) {
+            const child = children[i];
+
+            child.support(scratch_array, 0, direction_x, direction_y, direction_z);
+
+            const d = v3_dot(
+                scratch_array[0], scratch_array[1], scratch_array[2],
+                direction_x, direction_y, direction_z
+            );
+
+            if (d > best_distance) {
+                // best candidate so far, write to result
+                array_copy(scratch_array, 0, result, result_offset, 3);
+
+                best_distance = d;
+            }
+
+        }
+
+    }
+
     /**
      *
      * @param {UnionShape3D} other

package/src/core/geom/3d/shape/UnitCubeShape3D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UnitCubeShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnitCubeShape3D.js"],"names":[],"mappings":"AASA;IAEI,qBAEC;IAED,wCAQC;IAED,4DAYC;IAED,mEAEC;IAED,6CAqBC;IAED,oCASC;IAED,kFAEC;IAED,eAEC;CACJ;;;;gCApF+B,sBAAsB"}
+{"version":3,"file":"UnitCubeShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnitCubeShape3D.js"],"names":[],"mappings":"AAUA;IAkFI,iCAAwC;IAhFxC,qBAEC;IAED,wCAQC;IAED,4DAYC;IAED,qGAIC;IAED,mEAEC;IAED,6CAqBC;IAED,oCASC;IAED,kFAEC;IAED,eAEC;CAGJ;gCAtF+B,sBAAsB"}

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

@@ -1,11 +1,12 @@
-import { AbstractShape3D } from "./AbstractShape3D.js";
-import { randomPointInBox } from "../../random/randomPointInBox.js";
-import { v3_length } from "../../vec3/v3_length.js";
 import { max2 } from "../../../math/max2.js";
 import { max3 } from "../../../math/max3.js";
 import { min2 } from "../../../math/min2.js";
-import { compute_signed_distance_gradient_by_sampling } from "./util/compute_signed_distance_gradient_by_sampling.js";
+import { sign_not_zero } from "../../../math/sign_not_zero.js";
+import { randomPointInBox } from "../../random/randomPointInBox.js";
+import { v3_length } from "../../vec3/v3_length.js";
 import { aabb3_nearest_point_on_surface } from "../aabb/aabb3_nearest_point_on_surface.js";
+import { AbstractShape3D } from "./AbstractShape3D.js";
+import { compute_signed_distance_gradient_by_sampling } from "./util/compute_signed_distance_gradient_by_sampling.js";
 
 export class UnitCubeShape3D extends AbstractShape3D {
 
@@ -37,6 +38,12 @@ export class UnitCubeShape3D extends AbstractShape3D {
 
     }
 
+    support(result, result_offset, direction_x, direction_y, direction_z) {
+        result[result_offset] = sign_not_zero(direction_x) * 0.5;
+        result[result_offset + 1] = sign_not_zero(direction_y) * 0.5;
+        result[result_offset + 2] = sign_not_zero(direction_z) * 0.5;
+    }
+
     signed_distance_gradient_at_point(result, point) {
         return compute_signed_distance_gradient_by_sampling(result, this, point);
     }
@@ -82,6 +89,6 @@ export class UnitCubeShape3D extends AbstractShape3D {
     hash() {
         return 1;
     }
-}
 
-UnitCubeShape3D.INSTANCE = new UnitCubeShape3D();
+    static INSTANCE = new UnitCubeShape3D();
+}

package/src/core/geom/3d/shape/UnitSphereShape3D.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UnitSphereShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnitSphereShape3D.js"],"names":[],"mappings":"AAKA;;GAEG;AACH;IACI,qBAEC;IAED,2BAEC;IAED,wCAQC;IAED,4DAYC;IAED,mEAEC;IAED,6CAMC;IAED,oCAMC;IAED,kFAEC;IAED,eAEC;CACJ;;;;gCAlE+B,sBAAsB"}
+{"version":3,"file":"UnitSphereShape3D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/shape/UnitSphereShape3D.js"],"names":[],"mappings":"AAKA;;GAEG;AACH;IACI,qBAEC;IAED,2BAEC;IAED,qGAQC;IAED,wCAQC;IAED,4DAYC;IAED,mEAEC;IAED,6CAMC;IAED,oCAMC;IAED,kFAEC;IAED,eAEC;CACJ;;;;gCA5E+B,sBAAsB"}

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

@@ -15,6 +15,16 @@ export class UnitSphereShape3D extends AbstractShape3D {
         return Math.PI * 4;
     }
 
+    support(result, result_offset, direction_x, direction_y, direction_z) {
+
+        // since the sphere has a radius of 1, we don't have to multiply by it
+
+        result[result_offset] = direction_x;
+        result[result_offset + 1] = direction_y;
+        result[result_offset + 2] = direction_z;
+
+    }
+
     compute_bounding_box(result) {
         result[0] = -1;
         result[1] = -1;

package/src/core/geom/3d/tetrahedra/TetrahedralMesh.d.ts

@@ -97,11 +97,17 @@ export class TetrahedralMesh {
      */
     get isCompacted(): boolean;
     /**
-     * Traverse tetrahedrons
-     * @param {function(tet:number,mesh:TetrahedralMesh):*} visitor
+     * Traverse live tetrahedrons
+     * @param { function( tet_id:number, mesh:TetrahedralMesh ):* } visitor
      * @param {*} [thisArg]
      */
     forEach(visitor: any, thisArg?: any): void;
+    /**
+     * Produces a list of live tetrahedrons
+     * Allocates.
+     * @return {number[]}
+     */
+    getLive(): number[];
     /**
      * Clears all data from the mesh, making it contain 0 tetrahedrons
      */
@@ -117,17 +123,18 @@ export class TetrahedralMesh {
      */
     getCapacity(): number;
     /**
-     * How many tetrahedrons are contained in the mesh
+     * How many tetrahedrons are contained in the mesh, includes any unallocated tetrahedrons
      * @return {number}
      */
     size(): number;
     /**
      * Grow capacity to at least the specified size
-     * @param {number} capacity
+     * @private
+     * @param {number} capacity minimum
      */
-    growCapacity(capacity: number): void;
+    private growCapacity;
     /**
-     *
+     * Make sure that capacity is large enough to contain a certain total number of tetrahedrons
      * @param {number} capacity
      */
     ensureCapacity(capacity: number): void;
@@ -241,12 +248,12 @@ export class TetrahedralMesh {
      */
     deserialize(buffer: BinaryBuffer): void;
     /**
-     *
+     * Turns data into a base64 encoded string
      * @return {string}
      */
     serialize_base64(): string;
     /**
-     *
+     * Dual of serialization method, decodes a base64 representation
      * @param {string} str
      */
     deserialize_base64(str: string): void;

package/src/core/geom/3d/tetrahedra/TetrahedralMesh.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TetrahedralMesh.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/tetrahedra/TetrahedralMesh.js"],"names":[],"mappings":"AAgBA;;;;GAIG;AACH,qCAFU,MAAM,CAEkD;AAElE;;;GAGG;AACH,gCAFU,MAAM,CAE4B;AAE5C;;;GAGG;AACH,4BAFU,MAAM,CAEwB;AAoBxC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH;IACI;;;OAGG;IACH,2BAFW,MAAM,EAqDhB;IAhDG;;;;OAIG;IACH,iBAAsE;IAEtE;;;;OAIG;IACH,sBAAmD;IAEnD;;;;OAIG;IACH,eAAyC;IAEzC;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,mBAAmB;IAEnB;;;;OAIG;IACH,eAAgB;IAEhB;;;;OAIG;IACH,uBAAuB;IAG3B;;;OAGG;IACH,oBAEC;IAED;;;OAGG;IACH,2BAEC;IAED;;;;OAIG;IACH,2CAQC;IAED;;OAEG;IACH,cAWC;IAED;;;OAGG;IACH,sBAFW,MAAM,QA8BhB;IAED;;;OAGG;IACH,eAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,QAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,uBAFW,MAAM,QAchB;IAED;;;OAGG;IACH,yBAFW,MAAM,QAShB;IAED;;;;OAIG;IACH,YAHW,MAAM,GACL,OAAO,CAiBlB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,mBACN,MAAM,GACJ,MAAM,CAYlB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,mBACN,MAAM,aACN,MAAM,QAchB;IAGD;;;;;OAKG;IACH,0BAJW,MAAM,eACN,MAAM,GACJ,MAAM,CAYlB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,eACN,MAAM,UACN,MAAM,QAiBhB;IAED;;;;;OAKG;IACH,uBAJW,MAAM,UACN,MAAM,GACL,OAAO,CAUlB;IAGD;;;;OAIG;IACH,YAFY,MAAM,CA4BjB;IAED;;;;;;;;OAQG;IACH,eAPW,MAAM,EAAE,GAAC,YAAY,KACrB,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAqBlB;IAED;;;;OAIG;IACH,wBAFW,MAAM,QAmBhB;IAED;;;;OAIG;IACH,oBAFW,MAAM,QAmBhB;IAED;;;;;OAKG;IACH,2CAHW,MAAM,aACN,MAAM,QAwBhB;IAED;;;;;;;;OAQG;IACH,8BAPW,MAAM,KACN,MAAM,KACN,MAAM,UACN,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CA8DlB;IAGD;;;;;OAKG;IACH,uBAHW,MAAM,qBACN,MAAM,QA6BhB;IAED;;;;OAIG;IACH,WAFa,MAAM,CA2ClB;IAED;;;OAGG;IACH,kBAFW,YAAY,QAUtB;IAED;;;OAGG;IACH,oBAFW,YAAY,QAiBtB;IAED;;;OAGG;IACH,oBAFY,MAAM,CAUjB;IAED;;;OAGG;IACH,wBAFW,MAAM,QAQhB;IAGL;;;OAGG;IACH,4BAFU,OAAO,CAE0B;CAN1C;6BA/tB4B,iCAAiC"}
+{"version":3,"file":"TetrahedralMesh.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/tetrahedra/TetrahedralMesh.js"],"names":[],"mappings":"AAgBA;;;;GAIG;AACH,qCAFU,MAAM,CAEkD;AAElE;;;GAGG;AACH,gCAFU,MAAM,CAE4B;AAE5C;;;GAGG;AACH,4BAFU,MAAM,CAEwB;AAoBxC;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH;IACI;;;OAGG;IACH,2BAFW,MAAM,EAqDhB;IAhDG;;;;OAIG;IACH,iBAAsE;IAEtE;;;;OAIG;IACH,sBAAmD;IAEnD;;;;OAIG;IACH,eAAyC;IAEzC;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,mBAAmB;IAEnB;;;;OAIG;IACH,eAAgB;IAEhB;;;;OAIG;IACH,uBAAuB;IAG3B;;;OAGG;IACH,oBAIC;IAED;;;OAGG;IACH,2BAEC;IAED;;;;OAIG;IACH,2CAUC;IAED;;;;OAIG;IACH,WAFY,MAAM,EAAE,CAYnB;IAED;;OAEG;IACH,cAWC;IAED;;;OAGG;IACH,sBAFW,MAAM,QA8BhB;IAED;;;OAGG;IACH,eAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,QAFY,MAAM,CAIjB;IAED;;;;OAIG;IACH,qBAYC;IAED;;;OAGG;IACH,yBAFW,MAAM,QAWhB;IAED;;;;OAIG;IACH,YAHW,MAAM,GACL,OAAO,CAiBlB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,mBACN,MAAM,GACJ,MAAM,CAYlB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,mBACN,MAAM,aACN,MAAM,QAchB;IAGD;;;;;OAKG;IACH,0BAJW,MAAM,eACN,MAAM,GACJ,MAAM,CAYlB;IAED;;;;;OAKG;IACH,0BAJW,MAAM,eACN,MAAM,UACN,MAAM,QAiBhB;IAED;;;;;OAKG;IACH,uBAJW,MAAM,UACN,MAAM,GACL,OAAO,CAUlB;IAGD;;;;OAIG;IACH,YAFY,MAAM,CA4BjB;IAED;;;;;;;;OAQG;IACH,eAPW,MAAM,EAAE,GAAC,YAAY,KACrB,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAqBlB;IAED;;;;OAIG;IACH,wBAFW,MAAM,QAmBhB;IAED;;;;OAIG;IACH,oBAFW,MAAM,QAmBhB;IAED;;;;;OAKG;IACH,2CAHW,MAAM,aACN,MAAM,QAwBhB;IAED;;;;;;;;OAQG;IACH,8BAPW,MAAM,KACN,MAAM,KACN,MAAM,UACN,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CA8DlB;IAGD;;;;;OAKG;IACH,uBAHW,MAAM,qBACN,MAAM,QA6BhB;IAED;;;;OAIG;IACH,WAFa,MAAM,CA2ClB;IAED;;;OAGG;IACH,kBAFW,YAAY,QAUtB;IAED;;;OAGG;IACH,oBAFW,YAAY,QAiBtB;IAED;;;OAGG;IACH,oBAFY,MAAM,CAUjB;IAED;;;OAGG;IACH,wBAFW,MAAM,QAQhB;IAGL;;;OAGG;IACH,4BAFU,OAAO,CAE0B;CAN1C;6BAvvB4B,iCAAiC"}

package/src/core/geom/3d/tetrahedra/TetrahedralMesh.js

@@ -138,6 +138,8 @@ export class TetrahedralMesh {
      * @return {number}
      */
     get count() {
+        assert.equal(this.isCompacted, true, 'must be compacted');
+
         return this.__used_end;
     }
 
@@ -150,11 +152,13 @@ export class TetrahedralMesh {
     }
 
     /**
-     * Traverse tetrahedrons
-     * @param {function(tet:number,mesh:TetrahedralMesh):*} visitor
+     * Traverse live tetrahedrons
+     * @param { function( tet_id:number, mesh:TetrahedralMesh ):* } visitor
      * @param {*} [thisArg]
      */
     forEach(visitor, thisArg) {
+        assert.isFunction(visitor, 'visitor');
+
         for (let i = 0; i < this.__used_end; i++) {
             if (!this.exists(i)) {
                 continue;
@@ -164,6 +168,23 @@ export class TetrahedralMesh {
         }
     }
 
+    /**
+     * Produces a list of live tetrahedrons
+     * Allocates.
+     * @return {number[]}
+     */
+    getLive() {
+        /**
+         *
+         * @type {number[]}
+         */
+        const r = [];
+
+        this.forEach((tet) => r.push(tet));
+
+        return r;
+    }
+
     /**
      * Clears all data from the mesh, making it contain 0 tetrahedrons
      */
@@ -223,7 +244,7 @@ export class TetrahedralMesh {
     }
 
     /**
-     * How many tetrahedrons are contained in the mesh
+     * How many tetrahedrons are contained in the mesh, includes any unallocated tetrahedrons
      * @return {number}
      */
     size() {
@@ -232,7 +253,8 @@ export class TetrahedralMesh {
 
     /**
      * Grow capacity to at least the specified size
-     * @param {number} capacity
+     * @private
+     * @param {number} capacity minimum
      */
     growCapacity(capacity) {
         assert.isNonNegativeInteger(capacity, 'capacity');
@@ -249,12 +271,14 @@ export class TetrahedralMesh {
     }
 
     /**
-     *
+     * Make sure that capacity is large enough to contain a certain total number of tetrahedrons
      * @param {number} capacity
      */
     ensureCapacity(capacity) {
         assert.isNonNegativeInteger(capacity, 'capacity');
+
         if (this.__capacity >= capacity) {
+            // big enough
             return;
         }
 
@@ -570,7 +594,7 @@ export class TetrahedralMesh {
                     // point is outside the tet on the neighbour's side, move in that direction
                     const neighbour = this.getNeighbour(cur_tet, i);
 
-                    if(neighbour === INVALID_NEIGHBOUR){
+                    if (neighbour === INVALID_NEIGHBOUR) {
                         // walked outside the mesh, point is not contained within
                         return -1;
                     }
@@ -704,7 +728,7 @@ export class TetrahedralMesh {
         this.__used_end = buffer.readUintVar();
         this.__free_pointer = buffer.readUintVar();
 
-        this.growCapacity(this.__used_end);
+        this.ensureCapacity(this.__used_end);
 
         buffer.readUint32Array(this.__data_uint32, 0, this.__used_end * LAYOUT_TETRA_WORD_COUNT);
 
@@ -712,7 +736,7 @@ export class TetrahedralMesh {
     }
 
     /**
-     *
+     * Turns data into a base64 encoded string
      * @return {string}
      */
     serialize_base64() {
@@ -726,7 +750,7 @@ export class TetrahedralMesh {
     }
 
     /**
-     *
+     * Dual of serialization method, decodes a base64 representation
      * @param {string} str
      */
     deserialize_base64(str) {

package/src/core/geom/3d/tetrahedra/delaunay/compute_delaunay_tetrahedral_mesh.d.ts

@@ -4,7 +4,7 @@
  * @param {TetrahedralMesh} mesh
  * @param {number[]} input serialized set of 3d points (x,y,z)
  * @param {number} [n] number of points in the input
- * @returns {boolean}
+ * @returns {boolean} whether mesh was created or not. Returns false on failure
  */
 export function compute_delaunay_tetrahedral_mesh(mesh: TetrahedralMesh, input: number[], n?: number): boolean;
 import { TetrahedralMesh } from "../TetrahedralMesh.js";

package/src/core/geom/3d/tetrahedra/delaunay/compute_delaunay_tetrahedral_mesh.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compute_delaunay_tetrahedral_mesh.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/geom/3d/tetrahedra/delaunay/compute_delaunay_tetrahedral_mesh.js"],"names":[],"mappings":"AAcA;;;;;;;GAOG;AACH,wDALW,eAAe,SACf,MAAM,EAAE,MACR,MAAM,GACJ,OAAO,CAuEnB;gCAxF+B,uBAAuB"}
+{"version":3,"file":"compute_delaunay_tetrahedral_mesh.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/geom/3d/tetrahedra/delaunay/compute_delaunay_tetrahedral_mesh.js"],"names":[],"mappings":"AAcA;;;;;;;GAOG;AACH,wDALW,eAAe,SACf,MAAM,EAAE,MACR,MAAM,GACJ,OAAO,CAuEnB;gCAtF+B,uBAAuB"}

package/src/core/geom/3d/tetrahedra/delaunay/compute_delaunay_tetrahedral_mesh.js

@@ -1,15 +1,15 @@
 //
 
+import { assert } from "../../../../assert.js";
+import { BitSet } from "../../../../binary/BitSet.js";
 import { compute_bounding_simplex_3d } from "../compute_bounding_simplex_3d.js";
 import { TetrahedralMesh } from "../TetrahedralMesh.js";
+import { Cavity } from "./Cavity.js";
+import { fill_in_a_cavity } from "./fill_in_a_cavity.js";
+import { tetrahedral_mesh_compute_cavity } from "./tetrahedral_mesh_compute_cavity.js";
 import {
     tetrahedral_mesh_walk_towards_containing_tetrahedron
 } from "./tetrahedral_mesh_walk_towards_containing_tetrahedron.js";
-import { Cavity } from "./Cavity.js";
-import { tetrahedral_mesh_compute_cavity } from "./tetrahedral_mesh_compute_cavity.js";
-import { fill_in_a_cavity } from "./fill_in_a_cavity.js";
-import { BitSet } from "../../../../binary/BitSet.js";
-import { assert } from "../../../../assert.js";
 
 
 /**
@@ -18,7 +18,7 @@ import { assert } from "../../../../assert.js";
  * @param {TetrahedralMesh} mesh
  * @param {number[]} input serialized set of 3d points (x,y,z)
  * @param {number} [n] number of points in the input
- * @returns {boolean}
+ * @returns {boolean} whether mesh was created or not. Returns false on failure
  */
 export function compute_delaunay_tetrahedral_mesh(mesh, input, n = input.length / 3) {
     assert.notNull(mesh, 'mesh');
@@ -43,7 +43,7 @@ export function compute_delaunay_tetrahedral_mesh(mesh, input, n = input.length
 
     // start with a fairly low capacity for best-case scenario, rely on internal resizing after that
 
-    mesh.growCapacity(n + 1);
+    mesh.ensureCapacity(n + 1);
 
     const CAVITY = new Cavity();
 

package/src/core/geom/3d/tetrahedra/delaunay/tetrahedral_mesh_build_from_grid.spec.d.ts

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

package/src/core/geom/3d/tetrahedra/delaunay/tetrahedral_mesh_build_from_grid.spec.d.ts.map

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