@woosh/meep-engine 2.131.48 → 2.132.1

package/src/engine/navigation/mesh/funnel_string_pull.js

@@ -0,0 +1,225 @@
+import { assert } from "../../../core/assert.js";
+
+
+/**
+ *
+ * @param {number} i0
+ * @param {number} i1
+ * @param {number[]|ArrayLike<number>} vertex_data
+ * @returns {boolean}
+ */
+function vertices_equal(i0, i1, vertex_data) {
+
+    assert.isNonNegativeInteger(i0, "i0");
+    assert.isNonNegativeInteger(i1, "i1");
+
+    const address_0 = i0 * 3;
+
+    const x0 = vertex_data[address_0];
+    const y0 = vertex_data[address_0 + 1];
+    const z0 = vertex_data[address_0 + 2];
+
+    const address_1 = i1 * 3;
+
+    const x1 = vertex_data[address_1];
+    const y1 = vertex_data[address_1 + 1];
+    const z1 = vertex_data[address_1 + 2];
+
+    const dx = x1 - x0;
+    const dy = y1 - y0;
+    const dz = z1 - z0;
+
+    const distance_sqr = dx * dx + dy * dy + dz * dz;
+
+    return distance_sqr < 1e-7;
+
+}
+
+/**
+ *
+ * @param {number} i0
+ * @param {number} i1
+ * @param {number} i2
+ * @param {number[]|Float32Array} vertex_data
+ * @param {number} normal_x
+ * @param {number} normal_y
+ * @param {number} normal_z
+ */
+function triangle_signed_area(
+    i0, i1, i2,
+    vertex_data,
+    normal_x, normal_y, normal_z
+) {
+    assert.isNonNegativeInteger(i0, "i0");
+    assert.isNonNegativeInteger(i1, "i1");
+    assert.isNonNegativeInteger(i2, "i2");
+
+    assert.isNumber(normal_x, "normal_x");
+    assert.isNumber(normal_y, "normal_y");
+    assert.isNumber(normal_z, "normal_z");
+
+    const address_0 = i0 * 3;
+
+    const x0 = vertex_data[address_0];
+    const y0 = vertex_data[address_0 + 1];
+    const z0 = vertex_data[address_0 + 2];
+
+    const address_1 = i1 * 3;
+
+    const x1 = vertex_data[address_1];
+    const y1 = vertex_data[address_1 + 1];
+    const z1 = vertex_data[address_1 + 2];
+
+    const address_2 = i2 * 3;
+
+    const x2 = vertex_data[address_2];
+    const y2 = vertex_data[address_2 + 1];
+    const z2 = vertex_data[address_2 + 2];
+
+
+    // 1. Calculate Vector U (b - a)
+    const ux = x1 - x0;
+    const uy = y1 - y0;
+    const uz = z1 - z0;
+
+    // 2. Calculate Vector V (c - a)
+    const vx = x2 - x0;
+    const vy = y2 - y0;
+    const vz = z2 - z0;
+
+    // 3. Calculate 3D Cross Product (U x V)
+    const crossX = uy * vz - uz * vy;
+    const crossY = uz * vx - ux * vz;
+    const crossZ = ux * vy - uy * vx;
+
+    // 4. Dot Product with the Surface Normal
+    return (crossX * normal_x) + (crossY * normal_y) + (crossZ * normal_z);
+}
+
+/**
+ * Implementation of the string-pulling algorithm for funnel path refinement.
+ * Does not allocate memory.
+ *
+ *
+ * @param {Uint32Array|number[]|ArrayLike<number>} output Indices of vertices are written here
+ * @param {number} output_offset where to start writing into the output, typically you want to pass 0 here.
+ * @param {Uint32Array|Uint16Array|Uint8Array|number[]} portal_vertices Flat array of vertex index pairs [left0,right0, left1, right1 ... leftN, rightN]
+ * @param {Float32Array|number[]|ArrayLike<number>} portal_normals Normal vectors for each portal. Should be set to the triangle normal, which we exit through this portal. can be filled with [up, up, up... ] if your portals lay in the horizontal plane mostly.
+ * @param {number} portal_count how many portals do we have to work with
+ * @param {Float32Array|number[]} vertex_data actual vertex positions
+ * @returns number of vertices written to the output
+ */
+export function funnel_string_pull(
+    output,
+    output_offset,
+    portal_vertices,
+    portal_normals,
+    portal_count,
+    vertex_data
+) {
+    assert.isArrayLike(output, "output");
+    assert.isNonNegativeInteger(output_offset, "output_offset");
+    assert.isArrayLike(portal_vertices, "portal_vertices");
+    assert.isArrayLike(portal_normals, "portal_normals");
+    assert.isNonNegativeInteger(portal_count, "portal_count");
+    assert.isArrayLike(vertex_data, "vertex_data");
+
+    if (portal_count === 0) {
+        // special case, no data
+        return 0;
+    }
+
+    // see https://github.com/donmccurdy/three-pathfinding/blob/1f0345a516b7d1a1dac6649cdb6e815b47df6dce/src/Channel.js#L16
+
+    let output_cursor = output_offset;
+
+    // Init scan state
+    let apexIndex = 0,
+        leftIndex = 0,
+        rightIndex = 0;
+
+    let portalApex = portal_vertices[0];
+    let portalLeft = portal_vertices[0];
+    let portalRight = portal_vertices[1];
+
+    // Add start point.
+    output[output_cursor++] = portalApex;
+
+    for (let i = 1; i < portal_count; i++) {
+        const portal_address = i * 2;
+
+        const left = portal_vertices[portal_address];
+        const right = portal_vertices[portal_address + 1];
+
+        const portal_normal_x = portal_normals[i * 3];
+        const portal_normal_y = portal_normals[i * 3 + 1];
+        const portal_normal_z = portal_normals[i * 3 + 2];
+
+        // Update right vertex.
+        if (triangle_signed_area(portalApex, portalRight, right, vertex_data, portal_normal_x, portal_normal_y, portal_normal_z) <= 0.0) {
+            if (vertices_equal(portalApex, portalRight, vertex_data) || triangle_signed_area(portalApex, portalLeft, right, vertex_data, portal_normal_x, portal_normal_y, portal_normal_z) > 0.0) {
+                // Tighten the funnel.
+                portalRight = right;
+                rightIndex = i;
+            } else {
+                // Right over left, insert left to path and restart scan from portal left point.
+                output[output_cursor++] = portalLeft;
+
+                // Make current left the new apex.
+                portalApex = portalLeft;
+                apexIndex = leftIndex;
+
+                // Reset portal
+                portalLeft = portalApex;
+                portalRight = portalApex;
+                leftIndex = apexIndex;
+                rightIndex = apexIndex;
+
+                // Restart scan
+                i = apexIndex;
+                continue;
+            }
+        }
+
+        // Update left vertex.
+        if (triangle_signed_area(portalApex, portalLeft, left, vertex_data, portal_normal_x, portal_normal_y, portal_normal_z) >= 0.0) {
+            if (vertices_equal(portalApex, portalLeft, vertex_data) || triangle_signed_area(portalApex, portalRight, left, vertex_data, portal_normal_x, portal_normal_y, portal_normal_z) < 0.0) {
+
+                // Tighten the funnel.
+                portalLeft = left;
+                leftIndex = i;
+
+            } else {
+
+                // Left over right, insert right to path and restart scan from portal right point.
+                output[output_cursor++] = portalRight;
+
+                // Make current right the new apex.
+                portalApex = portalRight;
+                apexIndex = rightIndex;
+
+                // Reset portal
+                portalLeft = portalApex;
+                portalRight = portalApex;
+                leftIndex = apexIndex;
+                rightIndex = apexIndex;
+
+                // Restart scan
+                i = apexIndex;
+            }
+        }
+    }
+
+    const last_portal_address = (portal_count - 1) * 2;
+
+    if (
+        (output_cursor === output_offset)
+        || (!vertices_equal(output[output_cursor - 1], portal_vertices[last_portal_address], vertex_data))
+    ) {
+        // Append last point to path.
+        output[output_cursor++] = portal_vertices[last_portal_address]
+    }
+
+
+    return output_cursor - output_offset;
+}

package/src/core/geom/3d/line/line3_computeSegmentPointDistance_sqr.d.ts

@@ -1,14 +0,0 @@
-/**
- * Computes shortest distance between a line segment(defined by 2 points) and a point
- * @param {number} x0
- * @param {number} y0
- * @param {number} z0
- * @param {number} x1
- * @param {number} y1
- * @param {number} z1
- * @param {number} px
- * @param {number} py
- * @param {number} pz
- */
-export function line3_computeSegmentPointDistance_sqr(x0: number, y0: number, z0: number, x1: number, y1: number, z1: number, px: number, py: number, pz: number): number;
-//# sourceMappingURL=line3_computeSegmentPointDistance_sqr.d.ts.map

package/src/core/geom/3d/line/line3_computeSegmentPointDistance_sqr.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"line3_computeSegmentPointDistance_sqr.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/line/line3_computeSegmentPointDistance_sqr.js"],"names":[],"mappings":"AAGA;;;;;;;;;;;GAWG;AACH,0DAVW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,UA2BhB"}

package/src/core/geom/3d/topology/struct/binary/io/OrderedEdge.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"OrderedEdge.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/OrderedEdge.js"],"names":[],"mappings":"AAEA;IACI;;;;OAIG;IACH,gBAHW,MAAM,MACN,MAAM,EAUhB;IANO,cAAe;IACf,eAAgB;IAOxB;;;;OAIG;IACH,QAHW,MAAM,MACN,MAAM,QAUhB;IAED;;;OAGG;IACH,YAFW,WAAW,QAKrB;IAED,qBAEC;IAED;;;OAGG;IACH,QAFY,MAAM,CAKjB;IAED;;;;OAIG;IACH,cAHW,WAAW,GACT,OAAO,CAMnB;CACJ"}

package/src/core/geom/3d/topology/struct/binary/io/bt_edge_create.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_edge_create.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_edge_create.js"],"names":[],"mappings":"AA8DA;;;;;;GAMG;AACH,yDAJW,MAAM,MACN,MAAM,GACL,MAAM,CAsCjB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_edge_get_or_create.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_edge_get_or_create.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_edge_get_or_create.js"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,gEAJW,MAAM,MACN,MAAM,GACJ,MAAM,CAmClB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_edge_kill.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_edge_kill.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_edge_kill.js"],"names":[],"mappings":"AAKA;;;GAGG;AACH,sDAFW,MAAM,QAkBhB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_face_kill.d.ts

@@ -1,7 +0,0 @@
-/**
- *
- * @param {BinaryTopology} mesh
- * @param {number} f
- */
-export function bt_face_kill(mesh: BinaryTopology, f: number): void;
-//# sourceMappingURL=bt_face_kill.d.ts.map

package/src/core/geom/3d/topology/struct/binary/io/bt_face_kill.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_face_kill.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_face_kill.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,sDAFW,MAAM,QAIhB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_face_kill.js

@@ -1,8 +0,0 @@
-/**
- *
- * @param {BinaryTopology} mesh
- * @param {number} f
- */
-export function bt_face_kill(mesh, f) {
-    throw new Error('Not Implemented');
-}

package/src/core/geom/3d/topology/struct/binary/io/bt_index_geometry_to_topology.d.ts

@@ -1,11 +0,0 @@
-/**
- * Populates supplied topology with data from supplied indexed geometry
- * @see https://github.com/blender/blender/blob/9cb061f4f0119e647173e7d354e1457e97632333/source/blender/blenkernel/intern/mesh_calc_edges.cc
- * @see https://github.com/blender/blender/blob/9cb061f4f0119e647173e7d354e1457e97632333/source/blender/io/stl/importer/stl_import_mesh.cc#L63
- * @param {BinaryTopology} out
- * @param {number[]} indices
- * @param {number[]} vertex_positions
- * @param {number[]} [vertex_normals]
- */
-export function bt_index_geometry_to_topology(out: BinaryTopology, indices: number[], vertex_positions: number[], vertex_normals?: number[]): void;
-//# sourceMappingURL=bt_index_geometry_to_topology.d.ts.map

package/src/core/geom/3d/topology/struct/binary/io/bt_index_geometry_to_topology.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_index_geometry_to_topology.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_index_geometry_to_topology.js"],"names":[],"mappings":"AAIA;;;;;;;;GAQG;AACH,4EAJW,MAAM,EAAE,oBACR,MAAM,EAAE,mBACR,MAAM,EAAE,QAwGlB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_kill_only_edge.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_kill_only_edge.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_kill_only_edge.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,2DAFW,MAAM,QAIhB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_kill_only_face.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_kill_only_face.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_kill_only_face.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,2DAFW,MAAM,QAIhB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_kill_only_vert.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_kill_only_vert.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_kill_only_vert.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,2DAFW,MAAM,QAIhB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_merge_verts_by_distance.d.ts

@@ -1,18 +0,0 @@
-/**
- * Patch mesh structure to make all loops/edges/faces point to this new replacement vertex instead of the victim
- * This effectively removes any usage of the victim from the mesh enabling us to safely remove it
- * @param {BinaryTopology} mesh
- * @param {number} victim
- * @param {number} replacement
- */
-export function bt_replace_vertex(mesh: BinaryTopology, victim: number, replacement: number): void;
-/**
- * Only considers distance, no other attributes are accounted for
- * Performs operation in-place
- * IMPORTANT: Assumes vertices are compacted, that is - there are no holes in the vertex element pool
- * @param {BinaryTopology} mesh
- * @param {number[]} mesh_bounds bounding box of the mesh, required for quantization
- * @param {number} [max_distance] distance between vertices within which we perform the merge
- */
-export function bt_merge_verts_by_distance(mesh: BinaryTopology, mesh_bounds: number[], max_distance?: number): void;
-//# sourceMappingURL=bt_merge_verts_by_distance.d.ts.map

package/src/core/geom/3d/topology/struct/binary/io/bt_merge_verts_by_distance.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_merge_verts_by_distance.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_merge_verts_by_distance.js"],"names":[],"mappings":"AAIA;;;;;;GAMG;AACH,gEAHW,MAAM,eACN,MAAM,QAIhB;AAED;;;;;;;GAOG;AACH,8EAHW,MAAM,EAAE,iBACR,MAAM,QA6DhB"}

package/src/core/geom/3d/topology/struct/binary/io/bt_merge_verts_by_distance.js

@@ -1,83 +0,0 @@
-import { HashMap } from "../../../../../../collection/map/HashMap.js";
-import { v3_distance_sqr } from "../../../../../vec3/v3_distance_sqr.js";
-import v3_morton_encode from "../../../../morton/v3_morton_encode.js";
-
-/**
- * Patch mesh structure to make all loops/edges/faces point to this new replacement vertex instead of the victim
- * This effectively removes any usage of the victim from the mesh enabling us to safely remove it
- * @param {BinaryTopology} mesh
- * @param {number} victim
- * @param {number} replacement
- */
-export function bt_replace_vertex(mesh, victim, replacement) {
-    throw new Error("Not Implemented");
-}
-
-/**
- * Only considers distance, no other attributes are accounted for
- * Performs operation in-place
- * IMPORTANT: Assumes vertices are compacted, that is - there are no holes in the vertex element pool
- * @param {BinaryTopology} mesh
- * @param {number[]} mesh_bounds bounding box of the mesh, required for quantization
- * @param {number} [max_distance] distance between vertices within which we perform the merge
- */
-export function bt_merge_verts_by_distance(
-    mesh,
-    mesh_bounds,
-    max_distance = 0.0001
-) {
-    const max_distance2 = max_distance * max_distance;
-
-    const v0 = new Float32Array(3);
-    const v1 = new Float32Array(3);
-
-    // 10 bit quantization
-    const e_x = 1023 / (mesh_bounds[3] - mesh_bounds[0]);
-    const e_y = 1023 / (mesh_bounds[4] - mesh_bounds[1]);
-    const e_z = 1023 / (mesh_bounds[5] - mesh_bounds[2]);
-
-    /**
-     *
-     * @type {HashMap<number,number>}
-     */
-    const vertex_hash = new HashMap({
-        keyHashFunction(vertex_index) {
-            mesh.vertex_read_coordinate(v0, 0, vertex_index);
-
-            return v3_morton_encode(
-                Math.round((v0[0] - mesh_bounds[0]) * e_x),
-                Math.round((v0[1] - mesh_bounds[1]) * e_y),
-                Math.round((v0[2] - mesh_bounds[2]) * e_z)
-            );
-        },
-        keyEqualityFunction(a, b) {
-            mesh.vertex_read_coordinate(v0, 0, a);
-            mesh.vertex_read_coordinate(v1, 0, b);
-
-            const d2 = v3_distance_sqr(
-                v0[0], v0[1], v0[2],
-                v1[0], v1[1], v1[2],
-            );
-
-            return d2 <= max_distance2;
-        }
-    });
-
-    const vertices = mesh.vertices;
-    let vertex_count = vertices.size;
-
-    for (let vertex = 1; vertex < vertex_count; vertex++) {
-        const master_vertex = vertex_hash.getOrSet(vertex, vertex);
-
-        if (master_vertex === vertex) {
-            // no collisions, vertex was hashed
-            continue;
-        }
-
-        // got a collision, need to remove the vertex
-        // let's take over all data from this vertex
-
-        bt_replace_vertex(mesh, vertex, master_vertex);
-    }
-
-}

package/src/core/geom/3d/topology/struct/binary/io/bt_mesh_calc_edges.d.ts.map

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

package/src/core/geom/3d/topology/struct/binary/io/bt_vert_kill.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_vert_kill.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_vert_kill.js"],"names":[],"mappings":"AAKA;;;;GAIG;AACH,sDAFW,MAAM,QAShB"}

package/src/core/geom/3d/topology/struct/binary/io/get_or_create_edge_map.d.ts.map

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

package/src/core/geom/3d/topology/struct/binary/query/bt_mesh_edge_has_vertex.d.ts

@@ -1,9 +0,0 @@
-/**
- *
- * @param {BinaryTopology} mesh
- * @param {number} edge_id
- * @param {number} vertex_id
- * @returns {boolean}
- */
-export function bt_mesh_edge_has_vertex(mesh: BinaryTopology, edge_id: number, vertex_id: number): boolean;
-//# sourceMappingURL=bt_mesh_edge_has_vertex.d.ts.map

package/src/core/geom/3d/topology/struct/binary/query/bt_mesh_edge_has_vertex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_mesh_edge_has_vertex.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_edge_has_vertex.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,uEAJW,MAAM,aACN,MAAM,GACJ,OAAO,CAUnB"}

package/src/core/geom/3d/topology/struct/binary/query/bt_mesh_edge_other_vertex.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_mesh_edge_other_vertex.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_edge_other_vertex.js"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,yEAJW,MAAM,aACN,MAAM,GACJ,MAAM,CAalB"}

package/src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_get_neighbour_faces.d.ts

@@ -1,10 +0,0 @@
-/**
- *
- * @param {number[]} output
- * @param {number} output_offset
- * @param {BinaryTopology} mesh
- * @param {number} face_id
- * @returns {number} number of faces written to output
- */
-export function bt_mesh_face_get_neighbour_faces(output: number[], output_offset: number, mesh: BinaryTopology, face_id: number): number;
-//# sourceMappingURL=bt_mesh_face_get_neighbour_faces.d.ts.map

package/src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_get_neighbour_faces.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bt_mesh_face_get_neighbour_faces.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_get_neighbour_faces.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,yDANW,MAAM,EAAE,iBACR,MAAM,iCAEN,MAAM,GACJ,MAAM,CAmClB"}

package/src/core/geom/3d/topology/struct/binary/query/bt_mesh_face_get_neighbour_faces.js

@@ -1,44 +0,0 @@
-import { assert } from "../../../../../../assert.js";
-
-/**
- *
- * @param {number[]} output
- * @param {number} output_offset
- * @param {BinaryTopology} mesh
- * @param {number} face_id
- * @returns {number} number of faces written to output
- */
-export function bt_mesh_face_get_neighbour_faces(
-    output,
-    output_offset,
-    mesh,
-    face_id
-) {
-    assert.isArrayLike(output, "output");
-    assert.isNonNegativeInteger(output_offset, "output_offset");
-    assert.isNonNegativeInteger(face_id, "face_id");
-    assert.defined(mesh, "mesh");
-    assert.notNull(mesh, "mesh");
-    assert.isObject(mesh, "mesh");
-    assert.equal(mesh.isBinaryTopology, true, "mesh.isBinaryTopology !== true");
-
-    const initial_loop_id = mesh.face_read_loop(face_id);
-
-    let result_offset = output_offset;
-    let loop_id;
-
-    // TODO can we skip the first loop?
-
-    do {
-        let face = mesh.loop_read_face(initial_loop_id)
-
-        loop_id = mesh.loop_read_next(initial_loop_id);
-
-        if (face !== face_id) {
-            output[result_offset++] = face;
-        }
-
-    } while (loop_id !== initial_loop_id);
-
-    return result_offset - output_offset;
-}

package/src/engine/navigation/__module.d.ts

@@ -1,2 +0,0 @@
-export * from "./grid/find_path_on_grid_astar.js";
-//# sourceMappingURL=__module.d.ts.map

package/src/engine/navigation/__module.d.ts.map

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

package/src/engine/navigation/__module.js

@@ -1 +0,0 @@
-export * from "./grid/find_path_on_grid_astar.js";