@woosh/meep-engine 2.48.19 → 2.48.21

package/src/engine/graphics/micron/build/buildMicronGeometryFromBufferGeometry.js

@@ -1,311 +0,0 @@
-import { TopoMesh } from "../../../../core/geom/3d/topology/struct/TopoMesh.js";
-import { PatchRepresentation } from "./PatchRepresentation.js";
-import { MicronGeometry } from "../format/MicronGeometry.js";
-import { buildAbstractPatchHierarchy } from "./hierarchy/buildAbstractPatchHierarchy.js";
-import { AttributeSpec } from "../../geometry/AttributeSpec.js";
-import { typedArrayToDataType } from "../../../../core/collection/array/typedArrayToDataType.js";
-import { BinaryDataType } from "../../../../core/binary/type/BinaryDataType.js";
-import { MicronGeometryPatch } from "../format/MicronGeometryPatch.js";
-import { build_clustering_info } from "./debug/build_clustering_info.js";
-import { build_graph_info } from "./debug/build_graph_info.js";
-import { build_geometry_info } from "./build_geometry_info.js";
-import { build_leaf_patches_metis } from "./clustering/build_leaf_patches_metis.js";
-import { compute_buffer_geometry_byte_size } from "../../geometry/buffered/compute_buffer_geometry_byte_size.js";
-import { deinterleaveBufferGeometry } from "../../geometry/buffered/deinterleaveBufferGeometry.js";
-import { update_topo_face_normals } from "../../../../core/geom/3d/topology/update_topo_face_normals.js";
-import { mergeVertices } from "three/examples/jsm/utils/BufferGeometryUtils.js";
-
-/**
- * Returns current time in milliseconds
- * Wrapper to ensure support of both web as well as node.js
- * @return {number}
- */
-function current_time_millis() {
-    if (typeof performance !== 'undefined') {
-        return performance.now();
-    } else {
-        return Date.now();
-    }
-}
-
-/**
- *
- * @param {AttributeSpec} spec
- * @param {THREE.BufferAttribute} source
- */
-function custom_attribute_format_normal(spec, source) {
-    // compress normals
-    spec.normalized = true;
-    spec.type = BinaryDataType.Int8;
-}
-
-/**
- *
- * @param {AttributeSpec} spec
- * @param {THREE.BufferAttribute} source
- */
-function custom_attribute_format_uv(spec, source) {
-    // TODO make sure we only do this when source actually fits in half-float
-    spec.type = BinaryDataType.Float16;
-}
-
-/**
- *
- * @param {AttributeSpec} spec
- * @param {THREE.BufferAttribute} source
- */
-function custom_attribute_format_color(spec, source) {
-    // crush color data to 8 bit
-    spec.type = BinaryDataType.Uint8;
-    spec.normalized = true;
-}
-
-/**
- *
- * @param {AttributeSpec} spec
- * @param {THREE.BufferAttribute} source
- * @param {string} name
- */
-function format_attribute(spec, source, name) {
-
-    spec.name = name;
-
-    switch (name) {
-        case 'uv':
-        case 'uv2':
-            custom_attribute_format_uv(spec, source);
-            break;
-        case 'tangent':
-        case 'normal':
-            custom_attribute_format_normal(spec, source);
-            break;
-        case 'color':
-            custom_attribute_format_color(spec, source);
-            break;
-        default:
-            spec.normalized = source.normalized;
-            spec.type = typedArrayToDataType(source.array)
-    }
-
-    spec.itemSize = source.itemSize;
-}
-
-/**
- *
- * @param {THREE.BufferGeometry} buffer_geometry
- * @returns {AttributeSpec[]}
- */
-function attributes_from_buffer_geometry(buffer_geometry) {
-    const result = [];
-
-    const source_attributes = buffer_geometry.attributes;
-    for (const attributesKey in source_attributes) {
-        const source_attribute = source_attributes[attributesKey];
-        const spec = new AttributeSpec();
-
-        format_attribute(spec, source_attribute, attributesKey);
-
-        result.push(spec);
-    }
-
-    // to ensure that input order of attributes does not matter, we sort the attributes by name
-    result.sort(AttributeSpec.byName);
-
-    return result;
-}
-
-const PRINT_VERBOSE_STATS = false;
-
-/**
- *
- * @param {THREE.BufferGeometry} input
- * @returns {Promise<MicronGeometry>}
- */
-export async function buildMicronGeometryFromBufferGeometry(input) {
-    let source_geometry = deinterleaveBufferGeometry(input);
-
-    // merge vertices to create better connectivity
-    source_geometry = mergeVertices(source_geometry);
-
-    // build topology representation
-    const topoMesh = new TopoMesh();
-
-    const position_attribute = source_geometry.getAttribute("position");
-    const index_attribute = source_geometry.index;
-
-    const face_index_array = index_attribute.array;
-    const vertex_position_array = position_attribute.array;
-
-    topoMesh.build(vertex_position_array, face_index_array);
-
-    // compute aabb
-    // const geometry_aabb = new AABB3();
-    // aabb3_from_v3_array(geometry_aabb, vertex_position_array, vertex_position_array.length);
-
-    // weld_duplicate_vertices(topoMesh, geometry_aabb);
-
-    // debugValidateMesh(topoMesh);
-
-    // expandConnectivityByLocality(topoMesh, geometry_aabb);
-    // collapse_all_degenerate_edges(topoMesh.getEdges(), topoMesh);
-
-    // ensure faces have normals for mesh simplification
-    update_topo_face_normals(Array.from(topoMesh.getFaces()), topoMesh.getFaces().size);
-
-    /**
-     * Used to generate neighbourhood assignment
-     * @type {Map<number, PatchRepresentation>}
-     */
-    const face_to_patch_map = new Map();
-
-
-    /**
-     * Used to generate neighbourhood assignment
-     * @type {Map<number, PatchRepresentation[]>}
-     */
-    const vertex_to_patch_map = new Map();
-
-    // TODO drop patches with 0 volume (degenerate triangles)
-
-    const t_build_leaf_patches_start = current_time_millis();
-
-    const patches = await build_leaf_patches_metis(
-        topoMesh,
-        face_index_array,
-        vertex_position_array,
-        face_to_patch_map,
-        vertex_to_patch_map
-    );
-
-    if (PRINT_VERBOSE_STATS) {
-        console.log(`build leaf patches: ${(current_time_millis() - t_build_leaf_patches_start)}ms`);
-
-
-        console.log(build_clustering_info(patches));
-    }
-
-    // verify total poly count
-
-
-    // determine patch neighbours by checking common edges
-    // console.time('assign initial neighbours');
-    // assignInitialPatchNeighbours(patches, face_to_patch_map);
-    // console.timeEnd('assign initial neighbours');
-
-
-    const t_build_hierarchy_start = current_time_millis();
-
-    /**
-     *
-     * @type {PatchRepresentation}
-     */
-    const root = await buildAbstractPatchHierarchy(patches);
-
-    if (PRINT_VERBOSE_STATS) {
-        console.log(`build hierarchy: ${(current_time_millis() - t_build_hierarchy_start)}ms`);
-    }
-
-    // console.profile('simplification');
-    // console.time('simplification');
-    // build_simplified_clusters(root, topoMesh);
-    // console.timeEnd('simplification');
-    // console.profileEnd('simplification');
-
-
-    // compute number of patches over the triangle limit
-
-    // assign IDs to the patches
-    assign_ids_to_hierarchy(root);
-
-    if (PRINT_VERBOSE_STATS) {
-        console.log(build_graph_info(root));
-    }
-
-    const r = new MicronGeometry();
-
-    r.proxy = source_geometry; // TODO use r.buildProxy(1) instead
-
-    r.source_triangle_count = index_attribute.count / 3;
-    r.source_vertex_count = source_geometry.getAttribute('position').count;
-    r.source_byte_size = compute_buffer_geometry_byte_size(source_geometry);
-
-    // console.time('build geometry');
-
-    const vertex_attributes = attributes_from_buffer_geometry(source_geometry);
-
-    r.vertex_spec.setAttributes(vertex_attributes);
-    r.root = compilePatchGraph(root, source_geometry, r.vertex_spec);
-
-    r.initialize();
-
-    // console.timeEnd('build geometry');
-
-    if (PRINT_VERBOSE_STATS) {
-        console.log(build_geometry_info(r));
-    }
-
-    // assign dependencies
-
-
-    return r;
-}
-
-/**
- *
- * @param {PatchRepresentation} node
- * @param {THREE.BufferGeometry} geometry
- * @param {VertexDataSpec} vertex_spec
- * @returns {MicronGeometryPatch}
- */
-function compilePatchGraph(node, geometry, vertex_spec) {
-    // map nodes
-
-    /**
-     *
-     * @type {Map<number, PatchRepresentation>}
-     */
-    const id_to_rep_map = new Map();
-
-    /**
-     *
-     * @type {Map<number, MicronGeometryPatch>}
-     */
-    const id_to_concrete_map = new Map();
-
-    node.traverse(patch => {
-        const patch_id = patch.id;
-
-        id_to_rep_map.set(patch_id, patch);
-
-        const concrete = new MicronGeometryPatch();
-
-        patch.buildMicronGeometryPatch(concrete, geometry, vertex_spec);
-
-        id_to_concrete_map.set(patch_id, concrete);
-    });
-
-    // assemble graph structure
-    for (const id of id_to_rep_map.keys()) {
-        const concrete = id_to_concrete_map.get(id);
-        const rep = id_to_rep_map.get(id);
-
-        concrete.children = rep.children.map(c => id_to_concrete_map.get(c.id));
-        concrete.parents = rep.parents.map(c => id_to_concrete_map.get(c.id));
-    }
-
-    return id_to_concrete_map.get(node.id);
-}
-
-/**
- *
- * @param {PatchRepresentation} root
- */
-function assign_ids_to_hierarchy(root) {
-    let patch_id_counter = 0;
-
-    root.traverse(p => {
-
-        p.id = patch_id_counter++
-    });
-
-}

package/src/engine/graphics/micron/build/build_geometry_info.js

@@ -1,21 +0,0 @@
-import { prettyPrint } from "../../../../core/NumberFormat.js";
-
-/**
- *
- * @param {MicronGeometry} g
- * @return {string}
- */
-export function build_geometry_info(g) {
-    const micron_byte_size = g.computeByteSize();
-    const micron_vertex_count = g.__patches.reduce((acc,p)=>acc+p.vertex_count,0);
-    const micron_triangle_count = g.__patches.reduce((acc,p)=>acc+p.polygon_count,0);
-
-    return `Geometry Stats:
-    Source Byte Size: ${prettyPrint(g.source_byte_size)}
-    Source Bits Per Triangle: ${prettyPrint(g.source_byte_size/g.source_triangle_count)}
-    Source Bits Per Vertex: ${prettyPrint(g.source_byte_size/g.source_vertex_count)}
-    
-    Micron Byte Size: ${prettyPrint(micron_byte_size)} (${(micron_byte_size * 100 / g.source_byte_size).toPrecision(3)}% of source)
-    Micron Bits Per Triangle: ${prettyPrint(micron_byte_size/micron_triangle_count)}
-    Micron Bits Per Vertex: ${prettyPrint(micron_byte_size/micron_vertex_count)}`;
-}

package/src/engine/graphics/micron/build/clustering/assignInitialPatchNeighbours.js

@@ -1,63 +0,0 @@
-import { array_push_if_unique } from "../../../../../core/collection/array/array_push_if_unique.js";
-import { BitSet } from "../../../../../core/binary/BitSet.js";
-
-/**
- * TODO: consider tracking neighbours in the patch construction loop, to avoid these super-nested loops
- * NOTE: assumes that all patches reference common topology, that is they reference same instances of edges, faces and vertices
- * @param {PatchRepresentation[]} patches
- * @param {Map<number,PatchRepresentation>} face_to_patch_map
- */
-export function assignInitialPatchNeighbours(patches, face_to_patch_map) {
-
-    /**
-     *
-     * @type {BitSet}
-     */
-    const closed_vertices = new BitSet();
-
-    const patch_count = patches.length;
-    for (let i = 0; i < patch_count; i++) {
-        const patch = patches[i];
-
-        const mesh = patch.topology_snapshot;
-
-        const patch_vertices = mesh.vertices;
-        const patch_vertex_count = patch_vertices.length;
-
-
-        for (let j = 0; j < patch_vertex_count; j++) {
-            const patch_vertex = patch_vertices[j];
-
-            const vertex_index = patch_vertex.index;
-
-            if (closed_vertices.get(vertex_index)) {
-                continue;
-            }
-
-            closed_vertices.set(vertex_index, true);
-
-            const vertex_faces = patch_vertex.faces;
-            const vertex_face_count = vertex_faces.length;
-
-            for (let k = 0; k < vertex_face_count; k++) {
-                const face = vertex_faces[k];
-
-                const neighbour_patch = face_to_patch_map.get(face.index);
-
-                if (neighbour_patch === patch) {
-                    // neighbour is within the origin patch
-                    continue;
-                }
-
-                // neighbouring face is in a different patch, record that
-                array_push_if_unique(patch.neighbours, neighbour_patch);
-                array_push_if_unique(neighbour_patch.neighbours, patch);
-
-                // record border vertex for both patches
-                patch.vertices_shared.add(vertex_index);
-            }
-        }
-
-    }
-}
-

package/src/engine/graphics/micron/build/clustering/assign_patch_neighbours_from_topology.js

@@ -1,46 +0,0 @@
-import { array_push_if_unique } from "../../../../../core/collection/array/array_push_if_unique.js";
-
-/**
- *
- * @param {PatchRepresentation[]} patches
- */
-export function assign_patch_neighbours_from_topology(patches) {
-    /**
-     *
-     * @type {Map<number, PatchRepresentation[]>}
-     */
-    const vertex_to_patch_map = new Map();
-
-    const patch_count = patches.length;
-    for (let i = 0; i < patch_count; i++) {
-        const patch = patches[i];
-
-        const mesh = patch.topology_snapshot;
-
-        const vertices = mesh.vertices;
-        const vertex_count = vertices.length;
-        for (let j = 0; j < vertex_count; j++) {
-            const vertex = vertices[j];
-
-            const vertex_index = vertex.index;
-
-            const existing = vertex_to_patch_map.get(vertex_index);
-
-            if (existing === undefined) {
-                // not yet registered, most common expected case
-                vertex_to_patch_map.set(vertex_index, [patch]);
-            } else {
-                const existing_patches_count = existing.length;
-                for (let k = 0; k < existing_patches_count; k++) {
-                    const neighbour_patch = existing[k];
-
-                    // neighbouring face is in a different patch, record that
-                    array_push_if_unique(patch.neighbours, neighbour_patch);
-                    array_push_if_unique(neighbour_patch.neighbours, patch);
-                }
-
-                existing.push(patch);
-            }
-        }
-    }
-}

package/src/engine/graphics/micron/build/clustering/build_clustering_2.js

@@ -1,37 +0,0 @@
-import FastBinaryHeap from "../../../../../core/collection/heap/FastBinaryHeap.js";
-import { mn_graph_collapse_weighted_edge } from "../../../../../core/graph/mn_graph_collapse_weighted_edge.js";
-import { build_face_graph_from_mesh } from "../../../../../core/graph/build_face_graph_from_mesh.js";
-
-/**
- *
- * @param {TopoMesh} mesh
- * @param {number} max_face_count faces per cluster
- */
-export function build_clustering_2(mesh, max_face_count) {
-    // initialize all faces to individual clusters
-    const graph = build_face_graph_from_mesh(mesh);
-
-    // simplify graph by collapsing heaviest edges recursively
-    const open_set = new FastBinaryHeap(function (edge) {
-        return edge.weight;
-    });
-
-    // add all edges to the heap
-    const edges = graph.getEdges();
-
-    for (let edge of edges) {
-        open_set.push(edge);
-    }
-
-    while (!open_set.isEmpty()) {
-        const edge = open_set.pop();
-
-        if (!mn_graph_collapse_weighted_edge(graph, edge, max_face_count, open_set)) {
-            // collapse was rejected, remove the edge from the graph
-            graph.removeEdge(edge);
-        }
-    }
-
-    // graph is partitioned at this point
-    console.warn(graph);
-}