@woosh/meep-engine 2.163.11 → 2.165.0

package/src/core/geom/3d/topology/bounds/compute_triangle_cluster_normal_bounding_cone.js

@@ -0,0 +1,87 @@
+import { array_copy } from "../../../../collection/array/array_copy.js";
+import { min2 } from "../../../../math/min2.js";
+import { ConicRay } from "../../../ConicRay.js";
+import { Miniball } from "../../../packing/miniball/Miniball.js";
+import { PointSet } from "../../../packing/miniball/PointSet.js";
+import { v3_angle } from "../../../vec3/v3_angle.js";
+
+/**
+ * Using Shirman and Abi-Ezzi method, compute bounding sphere of points, then build a cone from that
+ * @see L.A. Shirman and S.S. Abi-Ezzi, The cone of normals technique for fast processing of curved patches, Computer Graphics Forum, 12 (1993), 261-272.
+ * @param {ConicRay} result
+ * @param {Iterable<TopoTriangle>} faces
+ */
+export function compute_triangle_cluster_normal_bounding_cone(result, faces) {
+    const normal_data = [];
+    let normal_count = 0;
+
+    // extract face normals
+    for (let face of faces) {
+
+        const face_normal = face.normal;
+        if (face_normal[0] === 0 && face_normal[1] === 0 && face_normal[2] === 0) {
+            // skip
+            continue;
+        }
+
+        const address = normal_count * 3;
+
+        array_copy(face_normal, 0, normal_data, address, 3);
+
+        normal_count++;
+    }
+
+    const result_direction = result.direction;
+    if (normal_count === 0) {
+        // no valid normals, produce an arbitrary result
+        result_direction.set(1, 0, 0);
+        result.angle = 0;
+        return;
+    }
+
+    const point_set = new PointSet(normal_count, 3, normal_data);
+
+    const miniball = new Miniball(point_set);
+
+    const miniball_center = miniball.center();
+
+    if (Number.isNaN(miniball_center[0]) || Number.isNaN(miniball_center[1]) || Number.isNaN(miniball_center[2])) {
+        // something went wrong, center is undefined, fall-back to an open cone
+        result_direction.set(1, 0, 0);
+        result.angle = Math.PI;
+        return;
+    }
+
+    result_direction.fromArray(miniball_center, 0);
+    const center_vector_magnitude = result_direction.length();
+
+    if (center_vector_magnitude === 0) {
+        // degenerate, pointing in all directions
+        result_direction.set(1, 0, 0);
+        result.angle = Math.PI;
+        return;
+    }
+
+    result_direction.multiplyScalar(1 / center_vector_magnitude); // normalize direction vector
+
+    // include normals into the cone
+    let max_angle = 0;
+    for (let i = 0; i < normal_count; i++) {
+        const i3 = i * 3;
+
+        const normal_x = normal_data[i3];
+        const normal_y = normal_data[i3 + 1];
+        const normal_z = normal_data[i3 + 2];
+
+        const angle = v3_angle(
+            normal_x, normal_y, normal_z,
+            result_direction.x, result_direction.y, result_direction.z
+        );
+
+        if (angle > max_angle) {
+            max_angle = angle;
+        }
+    }
+
+    result.angle = min2(max_angle, Math.PI);
+}

package/src/core/geom/3d/topology/build_face_graph_from_mesh.d.ts

@@ -1,10 +1,3 @@
-/**
- * Given that the input graph is disconnected - makes it connected by adding very heavy edges between disconnected node clusters
- * If the graph is connected already - no change will be made
- * @template T
- * @param {Graph<T>} graph
- */
-export function graph_create_off_mesh_links<T>(graph: Graph<T>): void;
 /**
  *
  * @param {TopoMesh} mesh

package/src/core/geom/3d/topology/build_face_graph_from_mesh.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"build_face_graph_from_mesh.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/build_face_graph_from_mesh.js"],"names":[],"mappings":"AAOA;;;;;GAKG;AACH,sEAyBC;AAED;;;;GAIG;AACH,4DAFa,MAAM,uBAAuB,CAAC,CAqE1C;sBA9GqB,4BAA4B;0BADxB,6BAA6B"}
+{"version":3,"file":"build_face_graph_from_mesh.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/build_face_graph_from_mesh.js"],"names":[],"mappings":"AAKA;;;;GAIG;AACH,4DAFa,MAAM,uBAAuB,CAAC,CAqE1C;sBA5EqB,4BAA4B;0BADxB,6BAA6B"}

package/src/core/geom/3d/topology/build_face_graph_from_mesh.js

@@ -1,113 +1,78 @@
-import { graph_compute_disconnected_clusters } from "../../../graph/graph_compute_disconnected_clusters.js";
-import { MultiNode } from "../../../graph/MultiNode.js";
-import { Graph } from "../../../graph/v2/Graph.js";
-import { WeightedEdge } from "../../../graph/WeightedEdge.js";
-import { compute_face_connection_weight } from "./util/compute_face_connection_weight.js";
-
-
-/**
- * Given that the input graph is disconnected - makes it connected by adding very heavy edges between disconnected node clusters
- * If the graph is connected already - no change will be made
- * @template T
- * @param {Graph<T>} graph
- */
-export function graph_create_off_mesh_links(graph) {
-
-    const disconnected_clusters = graph_compute_disconnected_clusters(graph);
-    const cluster_count = disconnected_clusters.length;
-
-    if (cluster_count === 1) {
-        // all node belong to a single cluster.  We're done
-        return;
-    }
-
-    // TODO this can be done in a much smarter way
-    for (let i = 1; i < cluster_count; i++) {
-        const first_cluster = disconnected_clusters[i - 1];
-        const second_cluster = disconnected_clusters[i];
-
-        const node_a = first_cluster[first_cluster.length - 1];
-        const node_b = second_cluster[0];
-
-        const edge = new WeightedEdge(node_a, node_b);
-
-        // make edge very heavy
-        edge.weight = 1e10;
-
-        graph.addEdge(edge);
-    }
-}
-
-/**
- *
- * @param {TopoMesh} mesh
- * @returns {Graph<MultiNode<TopoTriangle>>}
- */
-export function build_face_graph_from_mesh(mesh) {
-
-    /**
-     *
-     * @type {Graph<MultiNode<TopoTriangle>>}
-     */
-    const face_cluster_graph = new Graph();
-    const faces = mesh.getFaces();
-
-    /**
-     *
-     * @type {Map<TopoTriangle, MultiNode<TopoTriangle>>}
-     */
-    const node_map = new Map();
-
-    // ingest faces
-    for (const face of faces) {
-        const node = new MultiNode();
-
-        node.source_nodes.push(face);
-
-        node_map.set(face, node);
-
-        face_cluster_graph.addNode(node);
-    }
-
-    // create connections between faces
-    const edges = mesh.getEdges();
-
-    for (const edge of edges) {
-        const edge_faces = edge.faces;
-
-        const edge_face_count = edge_faces.length;
-
-        if (edge_face_count <= 1) {
-            // vertex belongs to a single face, no connectivity
-            continue;
-        }
-
-        for (let j = 0; j < edge_face_count; j++) {
-            const face_0 = edge_faces[j];
-
-            const node_0 = node_map.get(face_0);
-
-            const f0_nc = face_cluster_graph.getNodeContainer(node_0);
-
-            for (let k = j + 1; k < edge_face_count; k++) {
-                const face_1 = edge_faces[k];
-
-                const node_1 = node_map.get(face_1);
-
-                const existing_edge = f0_nc.getAnyEdgeWith(node_1);
-                const connection_weight = compute_face_connection_weight(face_0, face_1) + edge.lengthSqr;
-
-                if (existing_edge !== undefined) {
-                    existing_edge.weight += connection_weight;
-                } else {
-                    const edge = new WeightedEdge(node_0, node_1);
-                    edge.weight = connection_weight;
-
-                    face_cluster_graph.addEdge(edge);
-                }
-            }
-        }
-    }
-
-    return face_cluster_graph;
-}
+import { MultiNode } from "../../../graph/MultiNode.js";
+import { Graph } from "../../../graph/v2/Graph.js";
+import { WeightedEdge } from "../../../graph/WeightedEdge.js";
+import { compute_face_connection_weight } from "./util/compute_face_connection_weight.js";
+
+/**
+ *
+ * @param {TopoMesh} mesh
+ * @returns {Graph<MultiNode<TopoTriangle>>}
+ */
+export function build_face_graph_from_mesh(mesh) {
+
+    /**
+     *
+     * @type {Graph<MultiNode<TopoTriangle>>}
+     */
+    const face_cluster_graph = new Graph();
+    const faces = mesh.getFaces();
+
+    /**
+     *
+     * @type {Map<TopoTriangle, MultiNode<TopoTriangle>>}
+     */
+    const node_map = new Map();
+
+    // ingest faces
+    for (const face of faces) {
+        const node = new MultiNode();
+
+        node.source_nodes.push(face);
+
+        node_map.set(face, node);
+
+        face_cluster_graph.addNode(node);
+    }
+
+    // create connections between faces
+    const edges = mesh.getEdges();
+
+    for (const edge of edges) {
+        const edge_faces = edge.faces;
+
+        const edge_face_count = edge_faces.length;
+
+        if (edge_face_count <= 1) {
+            // vertex belongs to a single face, no connectivity
+            continue;
+        }
+
+        for (let j = 0; j < edge_face_count; j++) {
+            const face_0 = edge_faces[j];
+
+            const node_0 = node_map.get(face_0);
+
+            const f0_nc = face_cluster_graph.getNodeContainer(node_0);
+
+            for (let k = j + 1; k < edge_face_count; k++) {
+                const face_1 = edge_faces[k];
+
+                const node_1 = node_map.get(face_1);
+
+                const existing_edge = f0_nc.getAnyEdgeWith(node_1);
+                const connection_weight = compute_face_connection_weight(face_0, face_1) + edge.lengthSqr;
+
+                if (existing_edge !== undefined) {
+                    existing_edge.weight += connection_weight;
+                } else {
+                    const edge = new WeightedEdge(node_0, node_1);
+                    edge.weight = connection_weight;
+
+                    face_cluster_graph.addEdge(edge);
+                }
+            }
+        }
+    }
+
+    return face_cluster_graph;
+}

package/src/core/geom/3d/topology/compareEdges.d.ts

@@ -1,2 +1,7 @@
-export {};
+/**
+ * @deprecated Renamed to {@link compare_edges} (and the previously-unexported function is now
+ * public surface; it also had a bug — it compared v0 twice instead of v1, now fixed).
+ */
+export const compareEdges: typeof compare_edges;
+import { compare_edges } from "./compare_edges.js";
 //# sourceMappingURL=compareEdges.d.ts.map

package/src/core/geom/3d/topology/compareEdges.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compareEdges.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/compareEdges.js"],"names":[],"mappings":""}
+{"version":3,"file":"compareEdges.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/compareEdges.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,gDAA0C;8BANZ,oBAAoB"}

package/src/core/geom/3d/topology/compareEdges.js

@@ -1,16 +1,7 @@
-import { compareVertices } from "./compareVertices.js";
-
-/**
- *
- * @param {TopoEdge} a
- * @param {TopoEdge} b
- * @returns {number}
- */
-function compareEdges(a, b) {
-    const v0 = compareVertices(a.v0, b.v0);
-    if (v0 !== 0) {
-        return v0;
-    }
-
-    return compareVertices(a.v0, b.v0);
-}
+import { compare_edges } from "./compare_edges.js";
+
+/**
+ * @deprecated Renamed to {@link compare_edges} (and the previously-unexported function is now
+ * public surface; it also had a bug — it compared v0 twice instead of v1, now fixed).
+ */
+export const compareEdges = compare_edges;

package/src/core/geom/3d/topology/compare_edges.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Total ordering over topological edges by their two endpoint vertices.
+ * @param {TopoEdge} a
+ * @param {TopoEdge} b
+ * @returns {number}
+ */
+export function compare_edges(a: TopoEdge, b: TopoEdge): number;
+//# sourceMappingURL=compare_edges.d.ts.map

package/src/core/geom/3d/topology/compare_edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compare_edges.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/compare_edges.js"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,yDAFa,MAAM,CASlB"}

package/src/core/geom/3d/topology/compare_edges.js

@@ -0,0 +1,16 @@
+import { compareVertices } from "./compareVertices.js";
+
+/**
+ * Total ordering over topological edges by their two endpoint vertices.
+ * @param {TopoEdge} a
+ * @param {TopoEdge} b
+ * @returns {number}
+ */
+export function compare_edges(a, b) {
+    const v0 = compareVertices(a.v0, b.v0);
+    if (v0 !== 0) {
+        return v0;
+    }
+
+    return compareVertices(a.v1, b.v1);
+}

package/src/core/geom/3d/topology/computeTopoMeshVertexDuplicates.d.ts

@@ -1,9 +1,7 @@
 /**
- *
- * @param {TopoMesh} mesh
- * @param {AABB3} aabb
- * @param {number} tolerance
- * @returns {Map<TopoVertex, TopoVertex[]>}
+ * @deprecated Renamed to {@link compute_topo_mesh_vertex_duplicates}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
  */
-export function computeTopoMeshVertexDuplicates(mesh: TopoMesh, aabb: AABB3, tolerance?: number): Map<TopoVertex, TopoVertex[]>;
+export const computeTopoMeshVertexDuplicates: typeof compute_topo_mesh_vertex_duplicates;
+import { compute_topo_mesh_vertex_duplicates } from "./compute_topo_mesh_vertex_duplicates.js";
 //# sourceMappingURL=computeTopoMeshVertexDuplicates.d.ts.map

package/src/core/geom/3d/topology/computeTopoMeshVertexDuplicates.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computeTopoMeshVertexDuplicates.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/computeTopoMeshVertexDuplicates.js"],"names":[],"mappings":"AAmCA;;;;;;GAMG;AACH,yFAHW,MAAM,GACJ,gBAAgB,YAAY,CAAC,CAmEzC"}
+{"version":3,"file":"computeTopoMeshVertexDuplicates.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/computeTopoMeshVertexDuplicates.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,yFAAmF;oDAN/B,0CAA0C"}

package/src/core/geom/3d/topology/computeTopoMeshVertexDuplicates.js

@@ -1,108 +1,7 @@
-import { EPSILON } from "../../../math/EPSILON.js";
-import { epsilonEquals } from "../../../math/epsilonEquals.js";
-import v3_morton_encode from "../morton/v3_morton_encode.js";
-
-/**
- *
- * @param {TopoVertex} a
- * @param {TopoVertex} b
- * @param {number} tolerance
- */
-function isPositionEquivalent(a, b, tolerance) {
-    return epsilonEquals(b.x, a.x, tolerance)
-        && epsilonEquals(b.y, a.y, tolerance)
-        && epsilonEquals(b.z, a.z, tolerance)
-        ;
-}
-
-/**
- *
- * @param {Map<TopoVertex,TopoVertex[]>} result
- * @param {TopoVertex} a
- * @param {TopoVertex} b
- */
-function recordDuplicate(result, a, b) {
-    let vertices = result.get(a);
-
-    if (vertices === undefined) {
-        vertices = [];
-
-        result.set(a, vertices);
-    }
-
-    vertices.push(b);
-}
-
-/**
- *
- * @param {TopoMesh} mesh
- * @param {AABB3} aabb
- * @param {number} tolerance
- * @returns {Map<TopoVertex, TopoVertex[]>}
- */
-export function computeTopoMeshVertexDuplicates(mesh, aabb, tolerance = EPSILON) {
-    const vertices = mesh.vertices;
-
-    const n = vertices.length;
-
-    // build spatial index for faster duplicate search
-    const spatial_hash = [];
-
-    /**
-     *
-     * @type {Map<TopoVertex, TopoVertex[]>}
-     */
-    const result = new Map();
-
-    let i, j;
-
-    const x0 = aabb.x0;
-    const y0 = aabb.y0;
-    const z0 = aabb.z0;
-
-    // 10 bit quantization
-    const e_x = 1023 / aabb.getExtentsX();
-    const e_y = 1023 / aabb.getExtentsY();
-    const e_z = 1023 / aabb.getExtentsZ();
-
-    //
-    for (i = 0; i < n; i++) {
-        const vertex_a = vertices[i];
-
-        const morton_code = v3_morton_encode(
-            Math.round((vertex_a.x - x0) * e_x),
-            Math.round((vertex_a.y - y0) * e_y),
-            Math.round((vertex_a.z - z0) * e_z)
-        );
-
-        let spatial_bucket = spatial_hash[morton_code];
-
-        if (spatial_bucket === undefined) {
-
-            spatial_bucket = [];
-            spatial_hash[morton_code] = spatial_bucket;
-
-        } else {
-
-            // look at others in the bucket
-            const bucket_size = spatial_bucket.length;
-
-            for (j = 0; j < bucket_size; j++) {
-                /**
-                 * @type {TopoVertex}
-                 */
-                const vertex_b = spatial_bucket[j];
-
-                if (isPositionEquivalent(vertex_a, vertex_b, tolerance)) {
-                    // same coordinates
-                    recordDuplicate(result, vertex_a, vertex_b);
-                    recordDuplicate(result, vertex_b, vertex_a);
-                }
-            }
-        }
-
-        spatial_bucket.push(vertex_a);
-    }
-
-    return result;
-}
+import { compute_topo_mesh_vertex_duplicates } from "./compute_topo_mesh_vertex_duplicates.js";
+
+/**
+ * @deprecated Renamed to {@link compute_topo_mesh_vertex_duplicates}. This re-export is kept for backward
+ * compatibility (meep is a library; old names are public surface).
+ */
+export const computeTopoMeshVertexDuplicates = compute_topo_mesh_vertex_duplicates;

package/src/core/geom/3d/topology/compute_topo_mesh_vertex_duplicates.d.ts

@@ -0,0 +1,9 @@
+/**
+ *
+ * @param {TopoMesh} mesh
+ * @param {AABB3} aabb
+ * @param {number} tolerance
+ * @returns {Map<TopoVertex, TopoVertex[]>}
+ */
+export function compute_topo_mesh_vertex_duplicates(mesh: TopoMesh, aabb: AABB3, tolerance?: number): Map<TopoVertex, TopoVertex[]>;
+//# sourceMappingURL=compute_topo_mesh_vertex_duplicates.d.ts.map

package/src/core/geom/3d/topology/compute_topo_mesh_vertex_duplicates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compute_topo_mesh_vertex_duplicates.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/compute_topo_mesh_vertex_duplicates.js"],"names":[],"mappings":"AAmCA;;;;;;GAMG;AACH,6FAHW,MAAM,GACJ,gBAAgB,YAAY,CAAC,CAmEzC"}

package/src/core/geom/3d/topology/compute_topo_mesh_vertex_duplicates.js

@@ -0,0 +1,108 @@
+import { EPSILON } from "../../../math/EPSILON.js";
+import { epsilonEquals } from "../../../math/epsilonEquals.js";
+import v3_morton_encode from "../morton/v3_morton_encode.js";
+
+/**
+ *
+ * @param {TopoVertex} a
+ * @param {TopoVertex} b
+ * @param {number} tolerance
+ */
+function isPositionEquivalent(a, b, tolerance) {
+    return epsilonEquals(b.x, a.x, tolerance)
+        && epsilonEquals(b.y, a.y, tolerance)
+        && epsilonEquals(b.z, a.z, tolerance)
+        ;
+}
+
+/**
+ *
+ * @param {Map<TopoVertex,TopoVertex[]>} result
+ * @param {TopoVertex} a
+ * @param {TopoVertex} b
+ */
+function recordDuplicate(result, a, b) {
+    let vertices = result.get(a);
+
+    if (vertices === undefined) {
+        vertices = [];
+
+        result.set(a, vertices);
+    }
+
+    vertices.push(b);
+}
+
+/**
+ *
+ * @param {TopoMesh} mesh
+ * @param {AABB3} aabb
+ * @param {number} tolerance
+ * @returns {Map<TopoVertex, TopoVertex[]>}
+ */
+export function compute_topo_mesh_vertex_duplicates(mesh, aabb, tolerance = EPSILON) {
+    const vertices = mesh.vertices;
+
+    const n = vertices.length;
+
+    // build spatial index for faster duplicate search
+    const spatial_hash = [];
+
+    /**
+     *
+     * @type {Map<TopoVertex, TopoVertex[]>}
+     */
+    const result = new Map();
+
+    let i, j;
+
+    const x0 = aabb.x0;
+    const y0 = aabb.y0;
+    const z0 = aabb.z0;
+
+    // 10 bit quantization
+    const e_x = 1023 / aabb.getExtentsX();
+    const e_y = 1023 / aabb.getExtentsY();
+    const e_z = 1023 / aabb.getExtentsZ();
+
+    //
+    for (i = 0; i < n; i++) {
+        const vertex_a = vertices[i];
+
+        const morton_code = v3_morton_encode(
+            Math.round((vertex_a.x - x0) * e_x),
+            Math.round((vertex_a.y - y0) * e_y),
+            Math.round((vertex_a.z - z0) * e_z)
+        );
+
+        let spatial_bucket = spatial_hash[morton_code];
+
+        if (spatial_bucket === undefined) {
+
+            spatial_bucket = [];
+            spatial_hash[morton_code] = spatial_bucket;
+
+        } else {
+
+            // look at others in the bucket
+            const bucket_size = spatial_bucket.length;
+
+            for (j = 0; j < bucket_size; j++) {
+                /**
+                 * @type {TopoVertex}
+                 */
+                const vertex_b = spatial_bucket[j];
+
+                if (isPositionEquivalent(vertex_a, vertex_b, tolerance)) {
+                    // same coordinates
+                    recordDuplicate(result, vertex_a, vertex_b);
+                    recordDuplicate(result, vertex_b, vertex_a);
+                }
+            }
+        }
+
+        spatial_bucket.push(vertex_a);
+    }
+
+    return result;
+}

package/src/core/geom/3d/topology/expandConnectivityByLocality.js

@@ -1,7 +1,7 @@
 import { array_copy } from "../../../collection/array/array_copy.js";
 import { array_set_diff_sorting } from "../../../collection/array/array_set_diff_sorting.js";
 import { compareFaces } from "./compareFaces.js";
-import { computeTopoMeshVertexDuplicates } from "./computeTopoMeshVertexDuplicates.js";
+import { compute_topo_mesh_vertex_duplicates } from "./compute_topo_mesh_vertex_duplicates.js";
 import { query_edge_other_vertex } from "./query/query_edge_other_vertex.js";
 
 /**
@@ -70,7 +70,7 @@ function connectEdges(a, b) {
 export function expandConnectivityByLocality(mesh, aabb) {
     const duplicate_edges = [];
 
-    const vertex_duplicates = computeTopoMeshVertexDuplicates(mesh, aabb);
+    const vertex_duplicates = compute_topo_mesh_vertex_duplicates(mesh, aabb);
 
     // find duplicate edges from vertices
     const edges = mesh.getEdges();

package/src/core/geom/3d/topology/graph_create_off_mesh_links.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Given that the input graph is disconnected - makes it connected by adding very heavy edges between disconnected node clusters
+ * If the graph is connected already - no change will be made
+ * @template T
+ * @param {import("../../../graph/v2/Graph.js").Graph<T>} graph
+ */
+export function graph_create_off_mesh_links<T>(graph: import("../../../graph/v2/Graph.js").Graph<T>): void;
+//# sourceMappingURL=graph_create_off_mesh_links.d.ts.map

package/src/core/geom/3d/topology/graph_create_off_mesh_links.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph_create_off_mesh_links.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/3d/topology/graph_create_off_mesh_links.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,2GAyBC"}