@woosh/meep-engine 3.2.0 → 3.3.0

package/src/shade/renderer/global_illumination/brick4/cpu/brick4_empty_gpu_structure.d.ts

@@ -0,0 +1,23 @@
+/**
+ * A valid brick4 structure that lights nothing.
+ *
+ * There is no way to *un-upload* a lightmap: {@link Brick4LightMap} owns one buffer and the shader
+ * reads it unconditionally whenever the renderer is in Brick4 mode. So "no lightmap" has to be said
+ * in the format itself, and this is what says it — a root brick with no children whose every probe
+ * is zero. RGBE9995 zero decodes to a zero DC term, and `sh3_uncompress` scales every higher band by
+ * that DC, so all nine coefficients come back at zero: black indirect light, everywhere.
+ *
+ * **Built by the real encoder rather than written out here.** The layout — metadata, then nodes,
+ * then the probe section, with probe pointers resolved to absolute word addresses — belongs to
+ * {@link brick4_to_gpu_structure}, and a second hand-rolled copy of it would be free to drift.
+ *
+ * **The bounds are a unit box, not the zero box a fresh `AABB3` carries.** A zero-size volume makes
+ * the shader's `(position - min) / size` divide by zero, and the NaN that comes out of it survives
+ * into the trilinear weights — where `probe * weight` is `0 * NaN`, which is NaN rather than the
+ * black this is for. Any non-degenerate box does; where it sits does not matter, because traversal
+ * stops at the root and every probe in it reads the same zero.
+ *
+ * @returns {ArrayBuffer}
+ */
+export function brick4_empty_gpu_structure(): ArrayBuffer;
+//# sourceMappingURL=brick4_empty_gpu_structure.d.ts.map

package/src/shade/renderer/global_illumination/brick4/cpu/brick4_empty_gpu_structure.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"brick4_empty_gpu_structure.d.ts","sourceRoot":"","sources":["../../../../../../../src/shade/renderer/global_illumination/brick4/cpu/brick4_empty_gpu_structure.js"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,8CAFa,WAAW,CAUvB"}

package/src/shade/renderer/global_illumination/brick4/cpu/brick4_empty_gpu_structure.js

@@ -0,0 +1,34 @@
+import { BRICK4_PROBE_ENCODED_SIZE } from "../BRICK4_PROBE_ENCODED_SIZE.js";
+import { Brick4IntermediateNode } from "./Brick4IntermediateNode.js";
+import { brick4_to_gpu_structure } from "./brick4_to_gpu_structure.js";
+
+/**
+ * A valid brick4 structure that lights nothing.
+ *
+ * There is no way to *un-upload* a lightmap: {@link Brick4LightMap} owns one buffer and the shader
+ * reads it unconditionally whenever the renderer is in Brick4 mode. So "no lightmap" has to be said
+ * in the format itself, and this is what says it — a root brick with no children whose every probe
+ * is zero. RGBE9995 zero decodes to a zero DC term, and `sh3_uncompress` scales every higher band by
+ * that DC, so all nine coefficients come back at zero: black indirect light, everywhere.
+ *
+ * **Built by the real encoder rather than written out here.** The layout — metadata, then nodes,
+ * then the probe section, with probe pointers resolved to absolute word addresses — belongs to
+ * {@link brick4_to_gpu_structure}, and a second hand-rolled copy of it would be free to drift.
+ *
+ * **The bounds are a unit box, not the zero box a fresh `AABB3` carries.** A zero-size volume makes
+ * the shader's `(position - min) / size` divide by zero, and the NaN that comes out of it survives
+ * into the trilinear weights — where `probe * weight` is `0 * NaN`, which is NaN rather than the
+ * black this is for. Any non-degenerate box does; where it sits does not matter, because traversal
+ * stops at the root and every probe in it reads the same zero.
+ *
+ * @returns {ArrayBuffer}
+ */
+export function brick4_empty_gpu_structure() {
+
+    const root = new Brick4IntermediateNode();
+
+    root.bounds.setBounds(0, 0, 0, 1, 1, 1);
+
+    // every probe slot already indexes probe 0, and probe 0 is the one all-zero probe below
+    return brick4_to_gpu_structure(root, new Uint32Array(BRICK4_PROBE_ENCODED_SIZE));
+}

package/src/shade/renderer/scene/optimization/geometry/internal/anchor_grow_topological.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"anchor_grow_topological.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/scene/optimization/geometry/internal/anchor_grow_topological.js"],"names":[],"mappings":"AAWA;;;;;;;;;GASG;AAEH;;;;;;;;;;;;;;;;;;;;GAoBG;AACH;IAX0B,UAAU;IACV,UAAU;IACJ,UAAU;IACV,UAAU;IACL,6BAA6B,EAAvD,IAAI,MAAM,EAAE,MAAM,CAAC;IACN,WAAW,EAAxB,MAAM;IACO,WAAW,EAAxB,MAAM;IACO,gBAAgB,EAA7B,MAAM;IACQ,cAAc,GAA5B,MAAM;IACJ,UAAU,GAAG,IAAI,CAsI7B;;;;;;;;aAhKa,MAAM,EAAE;;;;aACR,MAAM,EAAE;;;;2BACR,IAAI,MAAM,EAAE,MAAM,CAAC;;;;yBACnB,IAAI,MAAM,EAAE,MAAM,CAAC;;;;eACnB,OAAO,qDAAqD,EAAE,SAAS"}
+{"version":3,"file":"anchor_grow_topological.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/scene/optimization/geometry/internal/anchor_grow_topological.js"],"names":[],"mappings":"AAYA;;;;;;;;;GASG;AAEH;;;;;;;;;;;;;;;;;;;;GAoBG;AACH;IAX0B,UAAU;IACV,UAAU;IACJ,UAAU;IACV,UAAU;IACL,6BAA6B,EAAvD,IAAI,MAAM,EAAE,MAAM,CAAC;IACN,WAAW,EAAxB,MAAM;IACO,WAAW,EAAxB,MAAM;IACO,gBAAgB,EAA7B,MAAM;IACQ,cAAc,GAA5B,MAAM;IACJ,UAAU,GAAG,IAAI,CA8I7B;;;;;;;;aAxKa,MAAM,EAAE;;;;aACR,MAAM,EAAE;;;;2BACR,IAAI,MAAM,EAAE,MAAM,CAAC;;;;yBACnB,IAAI,MAAM,EAAE,MAAM,CAAC;;;;eACnB,OAAO,qDAAqD,EAAE,SAAS"}

package/src/shade/renderer/scene/optimization/geometry/internal/anchor_grow_topological.js

@@ -1,9 +1,10 @@
 import { NULL_POINTER } from "../../../../../../core/geom/3d/topology/struct/binary/BinaryTopology.js";
+import { bt_edge_get } from "../../../../../../core/geom/3d/topology/struct/binary/query/bt_edge_get.js";
+import { bt_edge_other_face } from "../../../../../../core/geom/3d/topology/struct/binary/query/bt_edge_other_face.js";
+import { bt_face_third_vertex } from "../../../../../../core/geom/3d/topology/struct/binary/query/bt_face_third_vertex.js";
 import Vector3 from "../../../../../../core/geom/Vector3.js";
 import { Transform } from "../../../../../../engine/ecs/transform/Transform.js";
 import { StandardAttributes } from "../../../../geometry/StandardAttributes.js";
-import { bt_edge_other_face, bt_face_third_vertex } from "./bt_face_loop_helpers.js";
-import { bt_find_edge_between } from "./bt_find_edge_between.js";
 import { apply_match_transform, match_solve_transform } from "./match_solve_transform.js";
 import { vertex_attribute_pairs, vertex_attributes_match } from "./vertex_attributes_equal.js";
 
@@ -98,6 +99,14 @@ export function anchor_grow_topological(args) {
             continue;
         }
 
+        if (ev1_b === ev2_b) {
+            // Nothing constrains the correspondence to be injective, so an edge of A can arrive with
+            // both of its endpoints mapped onto a single vertex of B. There is no edge to cross
+            // there, and bt_edge_get asked for an edge between a vertex and itself answers with an
+            // arbitrary edge of that vertex's disk rather than with NULL_POINTER.
+            continue;
+        }
+
         // Identify face_a' on the other side of edge_a from any matched face on this edge
         // Find a matched face on this edge
         const loop_a = topology_a.edge_read_loop(edge_a);
@@ -121,7 +130,7 @@ export function anchor_grow_topological(args) {
         if (matched_faces_a.has(face_a_prime)) continue;
 
         // Find edge_b connecting (ev1_b, ev2_b)
-        const edge_b = bt_find_edge_between(topology_b, ev1_b, ev2_b);
+        const edge_b = bt_edge_get(topology_b, ev1_b, ev2_b);
         if (edge_b === NULL_POINTER) continue;
 
         const face_b_inside = f_b_for_a.get(any_matched_face_a);

package/src/shade/renderer/scene/optimization/geometry/internal/match_validate_topology.js

@@ -1,4 +1,4 @@
-import { bt_face_read_triangle_corners } from "./bt_face_loop_helpers.js";
+import { bt_face_read_triangle_vertices } from "../../../../../../core/geom/3d/topology/struct/binary/query/bt_face_read_triangle.js";
 
 const a_corners = [0, 0, 0];
 const b_corners = [0, 0, 0];
@@ -29,8 +29,8 @@ export function match_validate_topology(
         const face_b = face_b_for_a.get(face_a);
         if (face_b === undefined) return false;
 
-        if (!bt_face_read_triangle_corners(topology_a, face_a, a_corners)) return false;
-        if (!bt_face_read_triangle_corners(topology_b, face_b, b_corners)) return false;
+        if (!bt_face_read_triangle_vertices(a_corners, topology_a, face_a)) return false;
+        if (!bt_face_read_triangle_vertices(b_corners, topology_b, face_b)) return false;
 
         const exp0 = vertex_b_for_a.get(a_corners[0]);
         const exp1 = vertex_b_for_a.get(a_corners[1]);

package/src/shade/renderer/scene/optimization/geometry/internal/seed_correspondence_from_window.js

@@ -1,4 +1,4 @@
-import { bt_face_read_triangle_corners } from "./bt_face_loop_helpers.js";
+import { bt_face_read_triangle_vertices } from "../../../../../../core/geom/3d/topology/struct/binary/query/bt_face_read_triangle.js";
 import { vertex_attribute_pairs, vertex_attributes_match } from "./vertex_attributes_equal.js";
 
 /**
@@ -37,8 +37,8 @@ export function seed_correspondence_from_window(
         const face_a = a_start + t;
         const face_b = b_start + t;
 
-        if (!bt_face_read_triangle_corners(topology_a, face_a, a_corners)) return null;
-        if (!bt_face_read_triangle_corners(topology_b, face_b, b_corners)) return null;
+        if (!bt_face_read_triangle_vertices(a_corners, topology_a, face_a)) return null;
+        if (!bt_face_read_triangle_vertices(b_corners, topology_b, face_b)) return null;
 
         const offset = find_matching_perm(va_to_vb, a_corners, b_corners, attrs);
         if (offset === -1) return null;

package/src/shade/renderer/scene/serialization/deserialize_scene.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"deserialize_scene.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/scene/serialization/deserialize_scene.js"],"names":[],"mappings":"AAyMA;;;;;;GAMG;AACH,0CAJW,YAAY,iBAEV,cAAc,CA6R1B;AAED;;;;;;;GAOG;AACH,yCAJW,MAAM,iBAEJ,cAAc,CAuB1B;6BAzgB4B,yCAAyC"}
+{"version":3,"file":"deserialize_scene.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/scene/serialization/deserialize_scene.js"],"names":[],"mappings":"AAuMA;;;;;;GAMG;AACH,0CAJW,YAAY,iBAEV,cAAc,CA6R1B;AAED;;;;;;;GAOG;AACH,yCAJW,MAAM,iBAEJ,cAAc,CAuB1B;6BAvgB4B,yCAAyC"}

package/src/shade/renderer/scene/serialization/deserialize_scene.js

@@ -109,8 +109,6 @@ function is_avif_hdr(array_buffer) {
     return false;
 }
 
-// ─── PQ EOTF (inverse of the OETF used during serialization) ────────────────
-
 /**
  * @param {BinaryBuffer} buffer
  * @param {ShadeTexture[]} textures  indexed texture table

package/src/shade/renderer/scene/optimization/geometry/internal/bt_face_loop_helpers.d.ts

@@ -1,32 +0,0 @@
-/**
- * Read the 3 corner vertex IDs of a triangular face into `out` (offset 0..2).
- * Caller must ensure the face has exactly 3 loops.
- *
- * @param {BinaryTopology} mesh
- * @param {number} face_id
- * @param {number[]|Uint32Array} out length >= 3
- * @returns {boolean} false if the face is degenerate (no loop)
- */
-export function bt_face_read_triangle_corners(mesh: BinaryTopology, face_id: number, out: number[] | Uint32Array): boolean;
-/**
- * Given an edge incident to two faces and one of those faces, return the
- * other face. Returns NULL_POINTER if the edge is a boundary (one face) or
- * non-manifold in a way that doesn't match.
- *
- * @param {BinaryTopology} mesh
- * @param {number} edge_id
- * @param {number} face_id The known face on this edge
- * @returns {number}
- */
-export function bt_edge_other_face(mesh: BinaryTopology, edge_id: number, face_id: number): number;
-/**
- * Return the vertex of `face_id` that lies on neither end of `edge_id`. Caller
- * is responsible for ensuring `edge_id` is actually one of the face's edges.
- *
- * @param {BinaryTopology} mesh
- * @param {number} face_id
- * @param {number} edge_id
- * @returns {number} vertex ID, or NULL_POINTER if the edge is not part of the face
- */
-export function bt_face_third_vertex(mesh: BinaryTopology, face_id: number, edge_id: number): number;
-//# sourceMappingURL=bt_face_loop_helpers.d.ts.map

package/src/shade/renderer/scene/optimization/geometry/internal/bt_face_loop_helpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_face_loop_helpers.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/scene/optimization/geometry/internal/bt_face_loop_helpers.js"],"names":[],"mappings":"AAEA;;;;;;;;GAQG;AACH,6EAJW,MAAM,OACN,MAAM,EAAE,GAAC,WAAW,GAClB,OAAO,CAYnB;AAED;;;;;;;;;GASG;AACH,kEAJW,MAAM,WACN,MAAM,GACJ,MAAM,CAiBlB;AAED;;;;;;;;GAQG;AACH,oEAJW,MAAM,WACN,MAAM,GACJ,MAAM,CAmBlB"}

package/src/shade/renderer/scene/optimization/geometry/internal/bt_face_loop_helpers.js

@@ -1,77 +0,0 @@
-import { NULL_POINTER } from "../../../../../../core/geom/3d/topology/struct/binary/BinaryTopology.js";
-
-/**
- * Read the 3 corner vertex IDs of a triangular face into `out` (offset 0..2).
- * Caller must ensure the face has exactly 3 loops.
- *
- * @param {BinaryTopology} mesh
- * @param {number} face_id
- * @param {number[]|Uint32Array} out length >= 3
- * @returns {boolean} false if the face is degenerate (no loop)
- */
-export function bt_face_read_triangle_corners(mesh, face_id, out) {
-    const l0 = mesh.face_read_loop(face_id);
-    if (l0 === NULL_POINTER) return false;
-    const l1 = mesh.loop_read_next(l0);
-    const l2 = mesh.loop_read_next(l1);
-
-    out[0] = mesh.loop_read_vertex(l0);
-    out[1] = mesh.loop_read_vertex(l1);
-    out[2] = mesh.loop_read_vertex(l2);
-    return true;
-}
-
-/**
- * Given an edge incident to two faces and one of those faces, return the
- * other face. Returns NULL_POINTER if the edge is a boundary (one face) or
- * non-manifold in a way that doesn't match.
- *
- * @param {BinaryTopology} mesh
- * @param {number} edge_id
- * @param {number} face_id The known face on this edge
- * @returns {number}
- */
-export function bt_edge_other_face(mesh, edge_id, face_id) {
-    // walk radial cycle from any loop on the edge
-    const start = mesh.edge_read_loop(edge_id);
-    if (start === NULL_POINTER) return NULL_POINTER;
-
-    let loop = start;
-    do {
-        const f = mesh.loop_read_face(loop);
-        if (f !== face_id) {
-            return f;
-        }
-        loop = mesh.loop_read_radial_next(loop);
-    } while (loop !== start);
-
-    return NULL_POINTER;
-}
-
-/**
- * Return the vertex of `face_id` that lies on neither end of `edge_id`. Caller
- * is responsible for ensuring `edge_id` is actually one of the face's edges.
- *
- * @param {BinaryTopology} mesh
- * @param {number} face_id
- * @param {number} edge_id
- * @returns {number} vertex ID, or NULL_POINTER if the edge is not part of the face
- */
-export function bt_face_third_vertex(mesh, face_id, edge_id) {
-    const ev1 = mesh.edge_read_vertex1(edge_id);
-    const ev2 = mesh.edge_read_vertex2(edge_id);
-
-    const start = mesh.face_read_loop(face_id);
-    if (start === NULL_POINTER) return NULL_POINTER;
-
-    let loop = start;
-    do {
-        const v = mesh.loop_read_vertex(loop);
-        if (v !== ev1 && v !== ev2) {
-            return v;
-        }
-        loop = mesh.loop_read_next(loop);
-    } while (loop !== start);
-
-    return NULL_POINTER;
-}

package/src/shade/renderer/scene/optimization/geometry/internal/bt_find_edge_between.d.ts

@@ -1,12 +0,0 @@
-/**
- * Find the edge ID connecting two vertices in a BinaryTopology mesh, or
- * NULL_POINTER if no such edge exists. Walks v1's disk cycle (typically very
- * short for manifold meshes).
- *
- * @param {BinaryTopology} mesh
- * @param {number} v1
- * @param {number} v2
- * @returns {number} edge ID or NULL_POINTER
- */
-export function bt_find_edge_between(mesh: BinaryTopology, v1: number, v2: number): number;
-//# sourceMappingURL=bt_find_edge_between.d.ts.map

package/src/shade/renderer/scene/optimization/geometry/internal/bt_find_edge_between.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_find_edge_between.d.ts","sourceRoot":"","sources":["../../../../../../../../src/shade/renderer/scene/optimization/geometry/internal/bt_find_edge_between.js"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,+DAJW,MAAM,MACN,MAAM,GACJ,MAAM,CAwBlB"}

package/src/shade/renderer/scene/optimization/geometry/internal/bt_find_edge_between.js

@@ -1,35 +0,0 @@
-import { NULL_POINTER } from "../../../../../../core/geom/3d/topology/struct/binary/BinaryTopology.js";
-
-/**
- * Find the edge ID connecting two vertices in a BinaryTopology mesh, or
- * NULL_POINTER if no such edge exists. Walks v1's disk cycle (typically very
- * short for manifold meshes).
- *
- * @param {BinaryTopology} mesh
- * @param {number} v1
- * @param {number} v2
- * @returns {number} edge ID or NULL_POINTER
- */
-export function bt_find_edge_between(mesh, v1, v2) {
-    const start = mesh.vertex_read_edge(v1);
-    if (start === NULL_POINTER) {
-        return NULL_POINTER;
-    }
-
-    let edge = start;
-    do {
-        const ev1 = mesh.edge_read_vertex1(edge);
-        const ev2 = mesh.edge_read_vertex2(edge);
-
-        const other = ev1 === v1 ? ev2 : ev1;
-        if (other === v2) {
-            return edge;
-        }
-
-        edge = ev1 === v1
-            ? mesh.edge_read_v1_disk_next(edge)
-            : mesh.edge_read_v2_disk_next(edge);
-    } while (edge !== start && edge !== NULL_POINTER);
-
-    return NULL_POINTER;
-}

package/src/shade/renderer/scene/serialization/linear_to_pq.d.ts

@@ -1,2 +0,0 @@
-export function linearToPQ(x: any): number;
-//# sourceMappingURL=linear_to_pq.d.ts.map

package/src/shade/renderer/scene/serialization/linear_to_pq.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"linear_to_pq.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/scene/serialization/linear_to_pq.js"],"names":[],"mappings":"AAAA,2CAaC"}

package/src/shade/renderer/scene/serialization/linear_to_pq.js

@@ -1,14 +0,0 @@
-export function linearToPQ(x) {
-
-    // ─── PQ OETF (SMPTE ST 2084) ───────────────────────────────
-    // Input:  linear light, normalized so 1.0 = 10000 nits
-    // Output: PQ signal in [0, 1]
-    const PQ_m1 = 0.1593017578125;   // 2610 / 16384
-    const PQ_m2 = 78.84375;          // 2523 / 32
-    const PQ_c1 = 0.8359375;         // 3424 / 4096
-    const PQ_c2 = 18.8515625;        // 2413 / 128
-    const PQ_c3 = 18.6875;           // 2392 / 128
-
-    const xp = Math.pow(Math.max(x, 0), PQ_m1);
-    return Math.pow((PQ_c1 + PQ_c2 * xp) / (1.0 + PQ_c3 * xp), PQ_m2);
-}

package/src/shade/renderer/scene/serialization/pq_to_linear.d.ts

@@ -1,9 +0,0 @@
-/**
- * Inverse PQ (ST 2084 EOTF): convert a PQ signal value back to linear light.
- * Output is normalized so that 1.0 = SDR reference white (203 nits).
- *
- * @param {number} pq  PQ signal in [0, 1]
- * @returns {number}   linear light (1.0 = SDR white)
- */
-export function pqToLinear(pq: number): number;
-//# sourceMappingURL=pq_to_linear.d.ts.map

package/src/shade/renderer/scene/serialization/pq_to_linear.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pq_to_linear.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/scene/serialization/pq_to_linear.js"],"names":[],"mappings":"AAaA;;;;;;GAMG;AACH,+BAHW,MAAM,GACJ,MAAM,CAWlB"}

package/src/shade/renderer/scene/serialization/pq_to_linear.js

@@ -1,30 +0,0 @@
-const PQ_m1 = 0.1593017578125;   // 2610 / 16384
-const PQ_m2 = 78.84375;          // 2523 / 32
-const PQ_c1 = 0.8359375;         // 3424 / 4096
-const PQ_c2 = 18.8515625;        // 2413 / 128
-const PQ_c3 = 18.6875;           // 2392 / 128
-const SDR_WHITE_NITS = 203;
-const PQ_MAX_NITS = 10000;
-
-const PQ_NITS_RATIO = PQ_MAX_NITS / SDR_WHITE_NITS;
-
-const PQ_m2_inv = 1.0 / PQ_m2;
-const PQ_m1_inv = 1.0 / PQ_m1;
-
-/**
- * Inverse PQ (ST 2084 EOTF): convert a PQ signal value back to linear light.
- * Output is normalized so that 1.0 = SDR reference white (203 nits).
- *
- * @param {number} pq  PQ signal in [0, 1]
- * @returns {number}   linear light (1.0 = SDR white)
- */
-export function pqToLinear(pq) {
-    const pqPow = Math.pow(pq, PQ_m2_inv);
-    const numerator = Math.max(pqPow - PQ_c1, 0);
-    const denominator = PQ_c2 - PQ_c3 * pqPow;
-    const linear_normalized = Math.pow(numerator / denominator, PQ_m1_inv);
-
-    // Undo the normalization: linear_normalized is in [0,1] where 1.0 = 10000 nits
-    // Engine convention: 1.0 = SDR white = 203 nits
-    return linear_normalized * PQ_NITS_RATIO;
-}