@woosh/meep-engine 2.43.1 → 2.43.4

package/core/geom/3d/tetrahedra/prototypeTetrahedraBuilder.js

@@ -1,8 +1,6 @@
 import { EngineHarness } from "../../../../engine/EngineHarness.js";
 import { compute_delaunay_tetrahedral_mesh } from "./delaunay/compute_delaunay_tetrahedral_mesh.js";
-import { LineBasicMaterial, Uint32BufferAttribute } from "three";
-import { BufferGeometry } from "three/src/core/BufferGeometry.js";
-import { Float32BufferAttribute } from "three/src/core/BufferAttribute.js";
+import { LineBasicMaterial } from "three";
 import { ShadedGeometry } from "../../../../engine/graphics/ecs/mesh-v2/ShadedGeometry.js";
 import { DrawMode } from "../../../../engine/graphics/ecs/mesh-v2/DrawMode.js";
 import EntityBuilder from "../../../../engine/ecs/EntityBuilder.js";
@@ -10,7 +8,11 @@ import { Transform } from "../../../../engine/ecs/transform/Transform.js";
 import { ShadedGeometrySystem } from "../../../../engine/graphics/ecs/mesh-v2/ShadedGeometrySystem.js";
 import { GizmoRenderingPlugin } from "../../../../engine/graphics/render/gizmo/GizmoRenderingPlugin.js";
 import { Gizmo } from "../../../../engine/graphics/render/gizmo/Gizmo.js";
-import { LAYOUT_TETRA_BYTE_SIZE } from "./tetrahedra_collection.js";
+import { build_tetrahedral_mesh_buffer_geometry } from "./build_tetrahedral_mesh_buffer_geometry.js";
+import { seededRandom } from "../../../math/random/seededRandom.js";
+import { randomFloatBetween } from "../../../math/random/randomFloatBetween.js";
+import { delay } from "../../../process/delay.js";
+import { TetrahedralMesh } from "./TetrahedralMesh.js";
 
 /**
  *
@@ -26,45 +28,52 @@ async function main(engine) {
     const offset = [7.5, 1, 7.5];
     const scale = [.5, .5, .5];
 
-    const points = [
-        0, 0, 0,
-        10, 0, 0,
-        10, 0, 10,
-        0, 0, 10,
-
-        0, 10, 0,
-        10, 10, 0,
-        10, 10, 10,
-        0, 10, 10,
-    ];
-
-    const tetrahedra = compute_delaunay_tetrahedral_mesh(points, points.length / 3);
-
-    const lines = [];
+    const points = [];
+
+    // points.push(
+    //     0, 0, 0,
+    //     10, 0, 0,
+    //     10, 0, 10,
+    //     0, 0, 10,
+    //
+    //     0, 10, 0,
+    //     10, 10, 0,
+    //     10, 10, 10,
+    //     0, 10, 10,
+    // );
+
+    const random = seededRandom();
+
+    for (let i = 0; i < 600; i++) {
+        points.push(
+            randomFloatBetween(random, -100, 100),
+            randomFloatBetween(random, 0, 150),
+            randomFloatBetween(random, -100, 100),
+        );
+    }
 
-    for (let i = tetrahedra.__occupancy.nextSetBit(0); i !== -1; i = tetrahedra.__occupancy.nextSetBit(i + 1)) {
+    // make_justified_point_grid(new AABB3(-100, 0, -100, 100, 150, 100), 40, (x, y, z) => {
+    //     points.push(x, y, z);
+    // });
 
-        const tet_address = i * LAYOUT_TETRA_BYTE_SIZE;
+    await delay(1000);
 
-        const a = tetrahedra.__view.getUint32(tet_address);
-        const b = tetrahedra.__view.getUint32(tet_address + 4);
-        const c = tetrahedra.__view.getUint32(tet_address + 8);
-        const d = tetrahedra.__view.getUint32(tet_address + 12);
+    const tetrahedra = new TetrahedralMesh();
+    // console.time('mesh build');
+    console.profile('mesh build');
+    compute_delaunay_tetrahedral_mesh(tetrahedra, points, points.length / 3);
+    console.profileEnd('mesh build');
+    // console.timeEnd('mesh build');
 
-        lines.push(a, b);
-        lines.push(a, c);
-        lines.push(a, d);
+    console.log(tetrahedra);
 
-        lines.push(b, c);
-        lines.push(c, d);
-        lines.push(b, d);
+    await delay(500);
 
-    }
+    const relocated_elements = tetrahedra.compact();
+    console.log(`Compaction relocated ${relocated_elements} elements`);
 
-    const geometry = new BufferGeometry();
+    const geometry = build_tetrahedral_mesh_buffer_geometry(tetrahedra, points);
 
-    geometry.setIndex(new Uint32BufferAttribute(lines, 1, false));
-    geometry.setAttribute('position', new Float32BufferAttribute(points, 3, false));
 
 
     new EntityBuilder()

package/core/geom/3d/tetrahedra/tetrahedron_compute_signed_volume.js

@@ -0,0 +1,83 @@
+/**
+ * Compute signed volume of a tetrahedron with the last point at the origin
+ * @see "EFFICIENT FEATURE EXTRACTION FOR 2D/3D OBJECTS IN MESH REPRESENTATION" by Cha Zhang and Tsuhan Chen
+ * @param {number} ax
+ * @param {number} ay
+ * @param {number} az
+ * @param {number} bx
+ * @param {number} by
+ * @param {number} bz
+ * @param {number} cx
+ * @param {number} cy
+ * @param {number} cz
+ * @return {number}
+ */
+function triangle_compute_signed_volume(
+    ax, ay, az,
+    bx, by, bz,
+    cx, cy, cz
+) {
+
+    const v321 = cx * by * az;
+    const v231 = bx * cy * az;
+    const v312 = cx * ay * bz;
+    const v132 = ax * cy * bz;
+    const v213 = bx * ay * cz;
+    const v123 = ax * by * cz;
+
+    return (1.0 / 6.0) * (-v321 + v231 + v312 - v132 - v213 + v123);
+
+}
+
+
+/**
+ * @see https://en.wikipedia.org/wiki/Tetrahedron
+ *
+ * @param {ArrayLike<number>|number[]|Float32Array} points
+ * @param {number} a
+ * @param {number} b
+ * @param {number} c
+ * @param {number} d
+ * @returns {number}
+ */
+export function tetrahedron_compute_signed_volume(points, a, b, c, d) {
+
+    const a3 = a * 3;
+    const b3 = b * 3;
+    const c3 = c * 3;
+    const d3 = d * 3;
+
+    const ax = points[a3];
+    const ay = points[a3 + 1];
+    const az = points[a3 + 2];
+
+    const bx = points[b3];
+    const by = points[b3 + 1];
+    const bz = points[b3 + 2];
+
+    const cx = points[c3];
+    const cy = points[c3 + 1];
+    const cz = points[c3 + 2];
+
+    const dx = points[d3];
+    const dy = points[d3 + 1];
+    const dz = points[d3 + 2];
+
+    const adx = ax - dx;
+    const ady = ay - dy;
+    const adz = az - dz;
+
+    const bdx = bx - dx;
+    const bdy = by - dy;
+    const bdz = bz - dz;
+
+    const cdx = cx - dx;
+    const cdy = cy - dy;
+    const cdz = cz - dz;
+
+    return triangle_compute_signed_volume(
+        adx, ady, adz,
+        bdx, bdy, bdz,
+        cdx, cdy, cdz
+    );
+}

package/core/geom/3d/tetrahedra/tetrahedron_compute_signed_volume.spec.js

@@ -0,0 +1,24 @@
+import { tetrahedron_compute_signed_volume } from "./tetrahedron_compute_signed_volume.js";
+
+test("0 volume", () => {
+    expect(tetrahedron_compute_signed_volume([
+        0, 0, 0
+    ], 0, 0, 0, 0)).toBe(0);
+});
+
+test("positive volume", () => {
+
+    expect(tetrahedron_compute_signed_volume([
+        1, 0, 1,
+        1, 0, 0,
+        0, 0, 0,
+        1, 1, 1
+    ], 1, 2, 3, 0)).toBeGreaterThan(0);
+
+    expect(tetrahedron_compute_signed_volume([
+        0, 0, 0,
+        2, 0, 0,
+        0, 2, 0,
+        0, 0, 2
+    ], 1, 2, 3, 0)).toBeGreaterThan(0);
+})

package/core/geom/3d/tetrahedra/tetrahedron_contains_point.spec.js

@@ -0,0 +1,66 @@
+import { tetrahedron_contains_point } from "./tetrahedron_contains_point.js";
+
+test("basic containment", () => {
+    const tetrahedron = [
+        1, 0, 1,
+        1, 0, 0,
+        0, 0, 0,
+        1, 1, 1
+    ];
+
+    expect(
+        tetrahedron_contains_point([
+            ...tetrahedron,
+            //
+            0.5, 0.1, 0.5
+        ], 0, 1, 2, 3, 4)
+    ).toBe(true);
+
+    expect(
+        tetrahedron_contains_point([
+            ...tetrahedron,
+            //
+            -1, 0, 0
+        ], 0, 1, 2, 3, 4)
+    ).toBe(false);
+
+    expect(
+        tetrahedron_contains_point([
+            ...tetrahedron,
+            //
+            2, 0, 0
+        ], 0, 1, 2, 3, 4)
+    ).toBe(false);
+
+    expect(
+        tetrahedron_contains_point([
+            ...tetrahedron,
+            //
+            0, -1, 0
+        ], 0, 1, 2, 3, 4)
+    ).toBe(false);
+
+    expect(
+        tetrahedron_contains_point([
+            ...tetrahedron,
+            //
+            0, 2, 0
+        ], 0, 1, 2, 3, 4)
+    ).toBe(false);
+
+    expect(
+        tetrahedron_contains_point([
+            ...tetrahedron,
+            //
+            0, 0, -1
+        ], 0, 1, 2, 3, 4)
+    ).toBe(false);
+
+    expect(
+        tetrahedron_contains_point([
+            ...tetrahedron,
+            //
+            0, 0, 2
+        ], 0, 1, 2, 3, 4)
+    ).toBe(false);
+});

package/core/geom/3d/tetrahedra/validate_tetrahedral_mesh.js

@@ -0,0 +1,166 @@
+import { tetrahedron_compute_signed_volume } from "./tetrahedron_compute_signed_volume.js";
+import { noop } from "../../../function/Functions.js";
+import { INVALID_NEIGHBOUR } from "./TetrahedralMesh.js";
+
+/**
+ *
+ * @param {TetrahedralMesh} mesh
+ * @param {ArrayLike<number>|number[]} points
+ * @param {number} tet
+ * @return {number}
+ */
+export function get_tetrahedron_volume(mesh, points, tet) {
+
+    const a = mesh.getVertexIndex(tet, 0);
+    const b = mesh.getVertexIndex(tet, 1);
+    const c = mesh.getVertexIndex(tet, 2);
+    const d = mesh.getVertexIndex(tet, 3);
+
+    return tetrahedron_compute_signed_volume(points, a, b, c, d);
+}
+
+/**
+ *
+ * @param {TetrahedralMesh} mesh
+ * @param {number} tet
+ * @param {number} neighbour_id
+ * @param {function(string):*} consumer
+ * @return {boolean}
+ */
+export function validate_neighbour(mesh, tet, neighbour_id, consumer) {
+    let valid = true;
+
+    const neighbour = mesh.getNeighbour(tet, neighbour_id);
+
+    if (neighbour === INVALID_NEIGHBOUR) {
+        return true;
+    }
+
+    // decode neighbour
+    const neighbour_tet = neighbour >> 2;
+    const neighbour_vertex_id = neighbour & 3;
+
+    if (!mesh.exists(neighbour_tet)) {
+
+
+        consumer(`Tetrahedron ${tet} Neighbour[${neighbour_id}] ${neighbour_tet} does not exist in the mesh`);
+
+        return false;
+    }
+
+    const back_link = mesh.getNeighbour(neighbour_tet, neighbour_vertex_id);
+
+    if (back_link === INVALID_NEIGHBOUR) {
+
+        consumer(`Tetrahedron ${tet} Neighbour[${neighbour_id}] ${neighbour_tet} links back to invalid neighbour (no neighbour), expected ${tet} instead`);
+        return false;
+    }
+
+    const back_link_tet = back_link >> 2;
+    const back_link_vertex_index = back_link & 3;
+
+    if (back_link_tet !== tet) {
+        valid = false;
+
+        consumer(`Tetrahedron ${tet} Neighbour[${neighbour_id}] ${neighbour_tet} links back to a different tet, expected ${tet}, got ${back_link_tet}`)
+    } else if (back_link_vertex_index !== neighbour_id) {
+        valid = false;
+
+        consumer(`Tetrahedron ${tet} Neighbour[${neighbour_id}] ${neighbour_tet} links back to a different vertex, expected ${neighbour_id}, got ${back_link_vertex_index}`);
+
+    }
+
+    for (let j = 0; j < 4; j++) {
+        const v = mesh.getVertexIndex(tet, j);
+
+        if (j === neighbour_id) {
+            continue;
+        }
+
+        if (!mesh.tetContainsVertex(neighbour_tet, v)) {
+            valid = false;
+
+            consumer(`Tetrahedron ${tet} Neighbour[${neighbour_id}] ${neighbour_tet} does not share vertex ${v} with the tet`);
+
+        }
+    }
+
+    return valid;
+}
+
+
+/**
+ *
+ * @param {TetrahedralMesh} mesh
+ * @param {number} tet
+ * @param {function(problem:string):*} consumer
+ */
+export function validate_tetrahedron_neighbourhood(mesh, tet, consumer = noop) {
+    let valid = true;
+
+    for (let i = 0; i < 4; i++) {
+
+        if (!validate_neighbour(mesh, tet, i, consumer)) {
+            valid = false;
+        }
+
+    }
+
+    return valid;
+}
+
+/**
+ *
+ * @param {TetrahedralMesh} mesh
+ * @param {number} tet
+ * @returns {boolean}
+ */
+function is_tetrahedron_degenerate(mesh, tet) {
+
+    for (let i0 = 0; i0 < 4; i0++) {
+        const v0 = mesh.getVertexIndex(tet, i0);
+        for (let i1 = i0 + 1; i1 < 4; i1++) {
+            if (v0 === mesh.getVertexIndex(tet, i1)) {
+                // identical vertices
+                return true;
+            }
+        }
+    }
+
+    return false;
+}
+
+/**
+ *
+ * @param {TetrahedralMesh} mesh
+ * @param {ArrayLike<number>} points
+ * @param {(problem:string)=>*} [consumer]
+ * @returns {boolean}
+ */
+export function validate_tetrahedral_mesh(mesh, points, consumer = noop) {
+    let is_valid = true;
+
+    mesh.forEach((tet, mesh) => {
+
+        const volume = get_tetrahedron_volume(mesh, points, tet);
+        if (volume < 0) {
+            is_valid = false;
+
+            consumer(`Tetrahedron ${tet} has negative volume ${volume}`);
+        }
+
+        // check for degeneracy
+        if (is_tetrahedron_degenerate(mesh, tet)) {
+            is_valid = false;
+            consumer(`Tetrahedron ${tet} is degenerate (multiple vertices have the same index)`);
+        }
+
+        if (!validate_tetrahedron_neighbourhood(mesh, tet, consumer)) {
+            is_valid = false;
+        }
+
+    });
+
+
+    return is_valid;
+}

package/core/geom/3d/util/make_justified_point_grid.js

@@ -0,0 +1,31 @@
+import { max2 } from "../../../math/max2.js";
+
+/**
+ * Created a grid of points to fill given bounds, spacing is used as upper-bound,
+ * actual spacing will be justified to provide even distanced along each dimension separately
+ * @param {AABB3} aabb3
+ * @param {number} spacing
+ * @param {function(x:number,y:number,z:number)} callback
+ */
+export function make_justified_point_grid(aabb3, spacing, callback) {
+
+    const steps_x = Math.ceil(aabb3.getExtentsX() / spacing);
+    const steps_y = Math.ceil(aabb3.getExtentsY() / spacing);
+    const steps_z = Math.ceil(aabb3.getExtentsZ() / spacing);
+
+    const spacing_x = aabb3.getExtentsX() / max2(1, steps_x - 1);
+    const spacing_y = aabb3.getExtentsY() / max2(1, steps_y - 1);
+    const spacing_z = aabb3.getExtentsZ() / max2(1, steps_z - 1);
+
+    for (let i = 0; i < steps_x; i++) {
+        for (let j = 0; j < steps_y; j++) {
+            for (let k = 0; k < steps_z; k++) {
+                const x = i * spacing_x + aabb3.x0;
+                const y = j * spacing_y + aabb3.y0;
+                const z = k * spacing_z + aabb3.z0;
+
+                callback(x, y, z);
+            }
+        }
+    }
+}

package/core/geom/Bezier.js

@@ -1,30 +1,3 @@
-import Vector3 from "./Vector3.js";
-
-export function Bezier() {
-
-}
-
-Bezier.computeQuadratic = (function () {
-    const a = new Vector3();
-
-    function computeQuadratic(p0, p1, p2, t, result) {
-        const minus = 1 - t;
-        const minus2 = minus * minus;
-
-        result.copy(p0).multiplyScalar(minus2);
-
-        a.copy(p1).multiplyScalar(minus * 2 * t);
-        result.add(a);
-
-        a.copy(p2).multiplyScalar(t * t);
-        result.add(a);
-
-    }
-
-    return computeQuadratic;
-})();
-
-
 /**
  *
  * @param {Vector2} result

package/core/geom/Plane.js

@@ -5,10 +5,6 @@
 
 import { v3_dot } from "./v3_dot.js";
 
-function Plane() {
-
-}
-
 /**
 
  Algorithm taken from http://geomalgorithms.com/a05-_intersect-1.html. See the

package/core/geom/packing/miniball/Subspan.js

@@ -40,13 +40,13 @@ export class Subspan {
 
         /**
          * DxD square matrix, where D is number of dimensions
-         * @type {[]}
+         * @type {number[][]}
          */
         this.Q = null;
 
         /**
          * DxD square matrix, where D is number of dimensions
-         * @type {[]}
+         * @type {number[][]}
          */
         this.R = null;
 

package/core/geom/v3_lerp.js

@@ -11,7 +11,12 @@ import { lerp } from "../math/lerp.js";
  * @param {number} b_z
  * @param {number} fraction
  */
-export function v3_lerp(result, a_x, a_y, a_z, b_x, b_y, b_z, fraction) {
+export function v3_lerp(
+    result,
+    a_x, a_y, a_z,
+    b_x, b_y, b_z,
+    fraction
+) {
 
     const x = lerp(a_x, b_x, fraction);
     const y = lerp(a_y, b_y, fraction);

package/core/math/isqrt.js

@@ -0,0 +1,28 @@
+/**
+ * Integer square root
+ *
+ * @author Jim Ulery (attributed on hextreme)
+ * @see https://en.wikipedia.org/wiki/Integer_square_root
+ * @see https://git.immc.ucl.ac.be/hextreme/hxt_seqdel/-/blob/master/src/hxt_tetrahedra.c#L54
+ *
+ * @param {number} input
+ * @returns {number}
+ */
+export function isqrt(input) {
+    let temp;
+
+    let g = 0;
+    let b = 0x8000;
+    let bshft = 15;
+
+    let val = input;
+
+    do {
+        if (val >= (temp = (((g << 1) + b) << bshft--))) {
+            g += b;
+            val -= temp;
+        }
+    } while (b >>= 1);
+
+    return g;
+}

package/core/math/isqrt.spec.js

@@ -0,0 +1,9 @@
+import { isqrt } from "./isqrt.js";
+
+test('1', () => {
+    expect(isqrt(1)).toBe(1);
+});
+
+test('4', () => {
+    expect(isqrt(4)).toBe(2);
+});

package/core/math/max.spec.js

@@ -0,0 +1,25 @@
+import { max2 } from "./max2.js";
+
+test("0,0", () => {
+    expect(max2(0, 0)).toBe(0);
+});
+
+test("0,1", () => {
+    expect(max2(0, 1)).toBe(1);
+});
+
+test("1,0", () => {
+    expect(max2(1, 0)).toBe(1);
+});
+
+test("-1,0", () => {
+    expect(max2(-1, 0)).toBe(0);
+});
+
+test("0,-1", () => {
+    expect(max2(0, -1)).toBe(0);
+});
+
+test("Infinity,-Infinity", () => {
+    expect(max2(Infinity, -Infinity)).toBe(Infinity);
+});

package/core/math/min2.spec.js

@@ -0,0 +1,25 @@
+import { min2 } from "./min2.js";
+
+test("0,0", () => {
+    expect(min2(0, 0)).toBe(0);
+});
+
+test("0,1", () => {
+    expect(min2(0, 1)).toBe(0);
+});
+
+test("1,0", () => {
+    expect(min2(1, 0)).toBe(0);
+});
+
+test("-1,0", () => {
+    expect(min2(-1, 0)).toBe(-1);
+});
+
+test("0,-1", () => {
+    expect(min2(0, -1)).toBe(-1);
+});
+
+test("Infinity,-Infinity", () => {
+    expect(min2(Infinity, -Infinity)).toBe(-Infinity);
+});

package/core/model/node-graph/node/NodeInstance.js

@@ -1,8 +1,8 @@
 import { assert } from "../../../assert.js";
-import { isArrayEqual } from "../../../collection/ArrayUtils.js";
 import List from "../../../collection/list/List.js";
 import { NodeInstancePortReference } from "./NodeInstancePortReference.js";
 import { PortDirection } from "./PortDirection.js";
+import { isArrayEqual } from "../../../collection/array/isArrayEqual.js";
 
 export class NodeInstance {
     constructor() {
@@ -27,14 +27,14 @@ export class NodeInstance {
 
         /**
          * Internal instance data
-         * @type {[]}
+         * @type {Array}
          */
         this.parameters = [];
 
 
         /**
          * @transient
-         * @type {[]}
+         * @type {Array}
          */
         this.outputsValues = [];
 

package/core/primitives/strings/prefixTree/PrefixTreeLeaf.js

@@ -6,7 +6,7 @@ export class PrefixTreeLeaf extends PrefixTreeNode {
 
         /**
          * Values associated with the word
-         * @type {[]}
+         * @type {Array}
          */
         this.values = [];
 

package/core/process/delay.js

@@ -0,0 +1,5 @@
+export  function delay(timeout_ms) {
+    return new Promise((resolve, reject) => {
+        setTimeout(resolve, timeout_ms);
+    });
+}