matterviz 0.3.0 → 0.3.2

package/dist/marching-cubes.d.ts

@@ -0,0 +1,14 @@
+import type { Matrix3x3, Vec3 } from './math';
+export interface MarchingCubesResult {
+    vertices: Vec3[];
+    faces: number[][];
+    normals: Vec3[];
+}
+export interface MarchingCubesOptions {
+    periodic?: boolean;
+    interpolate?: boolean;
+    centered?: boolean;
+    normals?: boolean;
+}
+export declare function marching_cubes(grid: number[][][], iso_value: number, k_lattice: Matrix3x3, options?: MarchingCubesOptions): MarchingCubesResult;
+export declare function compute_vertex_normals(vertices: Vec3[], faces: number[][]): Vec3[];

package/dist/marching-cubes.js

@@ -0,0 +1,519 @@
+// Edge table: for each cube configuration (256 cases), which edges are intersected
+// Each bit indicates whether that edge has an intersection
+// deno-fmt-ignore
+const EDGE_TABLE = [0x0, 0x109, 0x203, 0x30a, 0x406, 0x50f, 0x605, 0x70c, 0x80c, 0x905, 0xa0f, 0xb06, 0xc0a, 0xd03, 0xe09, 0xf00, 0x190, 0x99, 0x393, 0x29a, 0x596, 0x49f, 0x795, 0x69c, 0x99c, 0x895, 0xb9f, 0xa96, 0xd9a, 0xc93, 0xf99, 0xe90, 0x230, 0x339, 0x33, 0x13a, 0x636, 0x73f, 0x435, 0x53c, 0xa3c, 0xb35, 0x83f, 0x936, 0xe3a, 0xf33, 0xc39, 0xd30, 0x3a0, 0x2a9, 0x1a3, 0xaa, 0x7a6, 0x6af, 0x5a5, 0x4ac, 0xbac, 0xaa5, 0x9af, 0x8a6, 0xfaa, 0xea3, 0xda9, 0xca0, 0x460, 0x569, 0x663, 0x76a, 0x66, 0x16f, 0x265, 0x36c, 0xc6c, 0xd65, 0xe6f, 0xf66, 0x86a, 0x963, 0xa69, 0xb60, 0x5f0, 0x4f9, 0x7f3, 0x6fa, 0x1f6, 0xff, 0x3f5, 0x2fc, 0xdfc, 0xcf5, 0xfff, 0xef6, 0x9fa, 0x8f3, 0xbf9, 0xaf0, 0x650, 0x759, 0x453, 0x55a, 0x256, 0x35f, 0x55, 0x15c, 0xe5c, 0xf55, 0xc5f, 0xd56, 0xa5a, 0xb53, 0x859, 0x950, 0x7c0, 0x6c9, 0x5c3, 0x4ca, 0x3c6, 0x2cf, 0x1c5, 0xcc, 0xfcc, 0xec5, 0xdcf, 0xcc6, 0xbca, 0xac3, 0x9c9, 0x8c0, 0x8c0, 0x9c9, 0xac3, 0xbca, 0xcc6, 0xdcf, 0xec5, 0xfcc, 0xcc, 0x1c5, 0x2cf, 0x3c6, 0x4ca, 0x5c3, 0x6c9, 0x7c0, 0x950, 0x859, 0xb53, 0xa5a, 0xd56, 0xc5f, 0xf55, 0xe5c, 0x15c, 0x55, 0x35f, 0x256, 0x55a, 0x453, 0x759, 0x650, 0xaf0, 0xbf9, 0x8f3, 0x9fa, 0xef6, 0xfff, 0xcf5, 0xdfc, 0x2fc, 0x3f5, 0xff, 0x1f6, 0x6fa, 0x7f3, 0x4f9, 0x5f0, 0xb60, 0xa69, 0x963, 0x86a, 0xf66, 0xe6f, 0xd65, 0xc6c, 0x36c, 0x265, 0x16f, 0x66, 0x76a, 0x663, 0x569, 0x460, 0xca0, 0xda9, 0xea3, 0xfaa, 0x8a6, 0x9af, 0xaa5, 0xbac, 0x4ac, 0x5a5, 0x6af, 0x7a6, 0xaa, 0x1a3, 0x2a9, 0x3a0, 0xd30, 0xc39, 0xf33, 0xe3a, 0x936, 0x83f, 0xb35, 0xa3c, 0x53c, 0x435, 0x73f, 0x636, 0x13a, 0x33, 0x339, 0x230, 0xe90, 0xf99, 0xc93, 0xd9a, 0xa96, 0xb9f, 0x895, 0x99c, 0x69c, 0x795, 0x49f, 0x596, 0x29a, 0x393, 0x99, 0x190, 0xf00, 0xe09, 0xd03, 0xc0a, 0xb06, 0xa0f, 0x905, 0x80c, 0x70c, 0x605, 0x50f, 0x406, 0x30a, 0x203, 0x109, 0x0];
+// Triangle table: for each cube configuration, list of edge triplets forming triangles
+// -1 marks the end of the triangle list for that configuration
+const TRI_TABLE = [
+    [],
+    [0, 8, 3],
+    [0, 1, 9],
+    [1, 8, 3, 9, 8, 1],
+    [1, 2, 10],
+    [0, 8, 3, 1, 2, 10],
+    [9, 2, 10, 0, 2, 9],
+    [2, 8, 3, 2, 10, 8, 10, 9, 8],
+    [3, 11, 2],
+    [0, 11, 2, 8, 11, 0],
+    [1, 9, 0, 2, 3, 11],
+    [1, 11, 2, 1, 9, 11, 9, 8, 11],
+    [3, 10, 1, 11, 10, 3],
+    [0, 10, 1, 0, 8, 10, 8, 11, 10],
+    [3, 9, 0, 3, 11, 9, 11, 10, 9],
+    [9, 8, 10, 10, 8, 11],
+    [4, 7, 8],
+    [4, 3, 0, 7, 3, 4],
+    [0, 1, 9, 8, 4, 7],
+    [4, 1, 9, 4, 7, 1, 7, 3, 1],
+    [1, 2, 10, 8, 4, 7],
+    [3, 4, 7, 3, 0, 4, 1, 2, 10],
+    [9, 2, 10, 9, 0, 2, 8, 4, 7],
+    [2, 10, 9, 2, 9, 7, 2, 7, 3, 7, 9, 4],
+    [8, 4, 7, 3, 11, 2],
+    [11, 4, 7, 11, 2, 4, 2, 0, 4],
+    [9, 0, 1, 8, 4, 7, 2, 3, 11],
+    [4, 7, 11, 9, 4, 11, 9, 11, 2, 9, 2, 1],
+    [3, 10, 1, 3, 11, 10, 7, 8, 4],
+    [1, 11, 10, 1, 4, 11, 1, 0, 4, 7, 11, 4],
+    [4, 7, 8, 9, 0, 11, 9, 11, 10, 11, 0, 3],
+    [4, 7, 11, 4, 11, 9, 9, 11, 10],
+    [9, 5, 4],
+    [9, 5, 4, 0, 8, 3],
+    [0, 5, 4, 1, 5, 0],
+    [8, 5, 4, 8, 3, 5, 3, 1, 5],
+    [1, 2, 10, 9, 5, 4],
+    [3, 0, 8, 1, 2, 10, 4, 9, 5],
+    [5, 2, 10, 5, 4, 2, 4, 0, 2],
+    [2, 10, 5, 3, 2, 5, 3, 5, 4, 3, 4, 8],
+    [9, 5, 4, 2, 3, 11],
+    [0, 11, 2, 0, 8, 11, 4, 9, 5],
+    [0, 5, 4, 0, 1, 5, 2, 3, 11],
+    [2, 1, 5, 2, 5, 8, 2, 8, 11, 4, 8, 5],
+    [10, 3, 11, 10, 1, 3, 9, 5, 4],
+    [4, 9, 5, 0, 8, 1, 8, 10, 1, 8, 11, 10],
+    [5, 4, 0, 5, 0, 11, 5, 11, 10, 11, 0, 3],
+    [5, 4, 8, 5, 8, 10, 10, 8, 11],
+    [9, 7, 8, 5, 7, 9],
+    [9, 3, 0, 9, 5, 3, 5, 7, 3],
+    [0, 7, 8, 0, 1, 7, 1, 5, 7],
+    [1, 5, 3, 3, 5, 7],
+    [9, 7, 8, 9, 5, 7, 10, 1, 2],
+    [10, 1, 2, 9, 5, 0, 5, 3, 0, 5, 7, 3],
+    [8, 0, 2, 8, 2, 5, 8, 5, 7, 10, 5, 2],
+    [2, 10, 5, 2, 5, 3, 3, 5, 7],
+    [7, 9, 5, 7, 8, 9, 3, 11, 2],
+    [9, 5, 7, 9, 7, 2, 9, 2, 0, 2, 7, 11],
+    [2, 3, 11, 0, 1, 8, 1, 7, 8, 1, 5, 7],
+    [11, 2, 1, 11, 1, 7, 7, 1, 5],
+    [9, 5, 8, 8, 5, 7, 10, 1, 3, 10, 3, 11],
+    [5, 7, 0, 5, 0, 9, 7, 11, 0, 1, 0, 10, 11, 10, 0],
+    [11, 10, 0, 11, 0, 3, 10, 5, 0, 8, 0, 7, 5, 7, 0],
+    [11, 10, 5, 7, 11, 5],
+    [10, 6, 5],
+    [0, 8, 3, 5, 10, 6],
+    [9, 0, 1, 5, 10, 6],
+    [1, 8, 3, 1, 9, 8, 5, 10, 6],
+    [1, 6, 5, 2, 6, 1],
+    [1, 6, 5, 1, 2, 6, 3, 0, 8],
+    [9, 6, 5, 9, 0, 6, 0, 2, 6],
+    [5, 9, 8, 5, 8, 2, 5, 2, 6, 3, 2, 8],
+    [2, 3, 11, 10, 6, 5],
+    [11, 0, 8, 11, 2, 0, 10, 6, 5],
+    [0, 1, 9, 2, 3, 11, 5, 10, 6],
+    [5, 10, 6, 1, 9, 2, 9, 11, 2, 9, 8, 11],
+    [6, 3, 11, 6, 5, 3, 5, 1, 3],
+    [0, 8, 11, 0, 11, 5, 0, 5, 1, 5, 11, 6],
+    [3, 11, 6, 0, 3, 6, 0, 6, 5, 0, 5, 9],
+    [6, 5, 9, 6, 9, 11, 11, 9, 8],
+    [5, 10, 6, 4, 7, 8],
+    [4, 3, 0, 4, 7, 3, 6, 5, 10],
+    [1, 9, 0, 5, 10, 6, 8, 4, 7],
+    [10, 6, 5, 1, 9, 7, 1, 7, 3, 7, 9, 4],
+    [6, 1, 2, 6, 5, 1, 4, 7, 8],
+    [1, 2, 5, 5, 2, 6, 3, 0, 4, 3, 4, 7],
+    [8, 4, 7, 9, 0, 5, 0, 6, 5, 0, 2, 6],
+    [7, 3, 9, 7, 9, 4, 3, 2, 9, 5, 9, 6, 2, 6, 9],
+    [3, 11, 2, 7, 8, 4, 10, 6, 5],
+    [5, 10, 6, 4, 7, 2, 4, 2, 0, 2, 7, 11],
+    [0, 1, 9, 4, 7, 8, 2, 3, 11, 5, 10, 6],
+    [9, 2, 1, 9, 11, 2, 9, 4, 11, 7, 11, 4, 5, 10, 6],
+    [8, 4, 7, 3, 11, 5, 3, 5, 1, 5, 11, 6],
+    [5, 1, 11, 5, 11, 6, 1, 0, 11, 7, 11, 4, 0, 4, 11],
+    [0, 5, 9, 0, 6, 5, 0, 3, 6, 11, 6, 3, 8, 4, 7],
+    [6, 5, 9, 6, 9, 11, 4, 7, 9, 7, 11, 9],
+    [10, 4, 9, 6, 4, 10],
+    [4, 10, 6, 4, 9, 10, 0, 8, 3],
+    [10, 0, 1, 10, 6, 0, 6, 4, 0],
+    [8, 3, 1, 8, 1, 6, 8, 6, 4, 6, 1, 10],
+    [1, 4, 9, 1, 2, 4, 2, 6, 4],
+    [3, 0, 8, 1, 2, 9, 2, 4, 9, 2, 6, 4],
+    [0, 2, 4, 4, 2, 6],
+    [8, 3, 2, 8, 2, 4, 4, 2, 6],
+    [10, 4, 9, 10, 6, 4, 11, 2, 3],
+    [0, 8, 2, 2, 8, 11, 4, 9, 10, 4, 10, 6],
+    [3, 11, 2, 0, 1, 6, 0, 6, 4, 6, 1, 10],
+    [6, 4, 1, 6, 1, 10, 4, 8, 1, 2, 1, 11, 8, 11, 1],
+    [9, 6, 4, 9, 3, 6, 9, 1, 3, 11, 6, 3],
+    [8, 11, 1, 8, 1, 0, 11, 6, 1, 9, 1, 4, 6, 4, 1],
+    [3, 11, 6, 3, 6, 0, 0, 6, 4],
+    [6, 4, 8, 11, 6, 8],
+    [7, 10, 6, 7, 8, 10, 8, 9, 10],
+    [0, 7, 3, 0, 10, 7, 0, 9, 10, 6, 7, 10],
+    [10, 6, 7, 1, 10, 7, 1, 7, 8, 1, 8, 0],
+    [10, 6, 7, 10, 7, 1, 1, 7, 3],
+    [1, 2, 6, 1, 6, 8, 1, 8, 9, 8, 6, 7],
+    [2, 6, 9, 2, 9, 1, 6, 7, 9, 0, 9, 3, 7, 3, 9],
+    [7, 8, 0, 7, 0, 6, 6, 0, 2],
+    [7, 3, 2, 6, 7, 2],
+    [2, 3, 11, 10, 6, 8, 10, 8, 9, 8, 6, 7],
+    [2, 0, 7, 2, 7, 11, 0, 9, 7, 6, 7, 10, 9, 10, 7],
+    [1, 8, 0, 1, 7, 8, 1, 10, 7, 6, 7, 10, 2, 3, 11],
+    [11, 2, 1, 11, 1, 7, 10, 6, 1, 6, 7, 1],
+    [8, 9, 6, 8, 6, 7, 9, 1, 6, 11, 6, 3, 1, 3, 6],
+    [0, 9, 1, 11, 6, 7],
+    [7, 8, 0, 7, 0, 6, 3, 11, 0, 11, 6, 0],
+    [7, 11, 6],
+    [7, 6, 11],
+    [3, 0, 8, 11, 7, 6],
+    [0, 1, 9, 11, 7, 6],
+    [8, 1, 9, 8, 3, 1, 11, 7, 6],
+    [10, 1, 2, 6, 11, 7],
+    [1, 2, 10, 3, 0, 8, 6, 11, 7],
+    [2, 9, 0, 2, 10, 9, 6, 11, 7],
+    [6, 11, 7, 2, 10, 3, 10, 8, 3, 10, 9, 8],
+    [7, 2, 3, 6, 2, 7],
+    [7, 0, 8, 7, 6, 0, 6, 2, 0],
+    [2, 7, 6, 2, 3, 7, 0, 1, 9],
+    [1, 6, 2, 1, 8, 6, 1, 9, 8, 8, 7, 6],
+    [10, 7, 6, 10, 1, 7, 1, 3, 7],
+    [10, 7, 6, 1, 7, 10, 1, 8, 7, 1, 0, 8],
+    [0, 3, 7, 0, 7, 10, 0, 10, 9, 6, 10, 7],
+    [7, 6, 10, 7, 10, 8, 8, 10, 9],
+    [6, 8, 4, 11, 8, 6],
+    [3, 6, 11, 3, 0, 6, 0, 4, 6],
+    [8, 6, 11, 8, 4, 6, 9, 0, 1],
+    [9, 4, 6, 9, 6, 3, 9, 3, 1, 11, 3, 6],
+    [6, 8, 4, 6, 11, 8, 2, 10, 1],
+    [1, 2, 10, 3, 0, 11, 0, 6, 11, 0, 4, 6],
+    [4, 11, 8, 4, 6, 11, 0, 2, 9, 2, 10, 9],
+    [10, 9, 3, 10, 3, 2, 9, 4, 3, 11, 3, 6, 4, 6, 3],
+    [8, 2, 3, 8, 4, 2, 4, 6, 2],
+    [0, 4, 2, 4, 6, 2],
+    [1, 9, 0, 2, 3, 4, 2, 4, 6, 4, 3, 8],
+    [1, 9, 4, 1, 4, 2, 2, 4, 6],
+    [8, 1, 3, 8, 6, 1, 8, 4, 6, 6, 10, 1],
+    [10, 1, 0, 10, 0, 6, 6, 0, 4],
+    [4, 6, 3, 4, 3, 8, 6, 10, 3, 0, 3, 9, 10, 9, 3],
+    [10, 9, 4, 6, 10, 4],
+    [4, 9, 5, 7, 6, 11],
+    [0, 8, 3, 4, 9, 5, 11, 7, 6],
+    [5, 0, 1, 5, 4, 0, 7, 6, 11],
+    [11, 7, 6, 8, 3, 4, 3, 5, 4, 3, 1, 5],
+    [9, 5, 4, 10, 1, 2, 7, 6, 11],
+    [6, 11, 7, 1, 2, 10, 0, 8, 3, 4, 9, 5],
+    [7, 6, 11, 5, 4, 10, 4, 2, 10, 4, 0, 2],
+    [3, 4, 8, 3, 5, 4, 3, 2, 5, 10, 5, 2, 11, 7, 6],
+    [7, 2, 3, 7, 6, 2, 5, 4, 9],
+    [9, 5, 4, 0, 8, 6, 0, 6, 2, 6, 8, 7],
+    [3, 6, 2, 3, 7, 6, 1, 5, 0, 5, 4, 0],
+    [6, 2, 8, 6, 8, 7, 2, 1, 8, 4, 8, 5, 1, 5, 8],
+    [9, 5, 4, 10, 1, 6, 1, 7, 6, 1, 3, 7],
+    [1, 6, 10, 1, 7, 6, 1, 0, 7, 8, 7, 0, 9, 5, 4],
+    [4, 0, 10, 4, 10, 5, 0, 3, 10, 6, 10, 7, 3, 7, 10],
+    [7, 6, 10, 7, 10, 8, 5, 4, 10, 4, 8, 10],
+    [6, 9, 5, 6, 11, 9, 11, 8, 9],
+    [3, 6, 11, 0, 6, 3, 0, 5, 6, 0, 9, 5],
+    [0, 11, 8, 0, 5, 11, 0, 1, 5, 5, 6, 11],
+    [6, 11, 3, 6, 3, 5, 5, 3, 1],
+    [1, 2, 10, 9, 5, 11, 9, 11, 8, 11, 5, 6],
+    [0, 11, 3, 0, 6, 11, 0, 9, 6, 5, 6, 9, 1, 2, 10],
+    [11, 8, 5, 11, 5, 6, 8, 0, 5, 10, 5, 2, 0, 2, 5],
+    [6, 11, 3, 6, 3, 5, 2, 10, 3, 10, 5, 3],
+    [5, 8, 9, 5, 2, 8, 5, 6, 2, 3, 8, 2],
+    [9, 5, 6, 9, 6, 0, 0, 6, 2],
+    [1, 5, 8, 1, 8, 0, 5, 6, 8, 3, 8, 2, 6, 2, 8],
+    [1, 5, 6, 2, 1, 6],
+    [1, 3, 6, 1, 6, 10, 3, 8, 6, 5, 6, 9, 8, 9, 6],
+    [10, 1, 0, 10, 0, 6, 9, 5, 0, 5, 6, 0],
+    [0, 3, 8, 5, 6, 10],
+    [10, 5, 6],
+    [11, 5, 10, 7, 5, 11],
+    [11, 5, 10, 11, 7, 5, 8, 3, 0],
+    [5, 11, 7, 5, 10, 11, 1, 9, 0],
+    [10, 7, 5, 10, 11, 7, 9, 8, 1, 8, 3, 1],
+    [11, 1, 2, 11, 7, 1, 7, 5, 1],
+    [0, 8, 3, 1, 2, 7, 1, 7, 5, 7, 2, 11],
+    [9, 7, 5, 9, 2, 7, 9, 0, 2, 2, 11, 7],
+    [7, 5, 2, 7, 2, 11, 5, 9, 2, 3, 2, 8, 9, 8, 2],
+    [2, 5, 10, 2, 3, 5, 3, 7, 5],
+    [8, 2, 0, 8, 5, 2, 8, 7, 5, 10, 2, 5],
+    [9, 0, 1, 5, 10, 3, 5, 3, 7, 3, 10, 2],
+    [9, 8, 2, 9, 2, 1, 8, 7, 2, 10, 2, 5, 7, 5, 2],
+    [1, 3, 5, 3, 7, 5],
+    [0, 8, 7, 0, 7, 1, 1, 7, 5],
+    [9, 0, 3, 9, 3, 5, 5, 3, 7],
+    [9, 8, 7, 5, 9, 7],
+    [5, 8, 4, 5, 10, 8, 10, 11, 8],
+    [5, 0, 4, 5, 11, 0, 5, 10, 11, 11, 3, 0],
+    [0, 1, 9, 8, 4, 10, 8, 10, 11, 10, 4, 5],
+    [10, 11, 4, 10, 4, 5, 11, 3, 4, 9, 4, 1, 3, 1, 4],
+    [2, 5, 1, 2, 8, 5, 2, 11, 8, 4, 5, 8],
+    [0, 4, 11, 0, 11, 3, 4, 5, 11, 2, 11, 1, 5, 1, 11],
+    [0, 2, 5, 0, 5, 9, 2, 11, 5, 4, 5, 8, 11, 8, 5],
+    [9, 4, 5, 2, 11, 3],
+    [2, 5, 10, 3, 5, 2, 3, 4, 5, 3, 8, 4],
+    [5, 10, 2, 5, 2, 4, 4, 2, 0],
+    [3, 10, 2, 3, 5, 10, 3, 8, 5, 4, 5, 8, 0, 1, 9],
+    [5, 10, 2, 5, 2, 4, 1, 9, 2, 9, 4, 2],
+    [8, 4, 5, 8, 5, 3, 3, 5, 1],
+    [0, 4, 5, 1, 0, 5],
+    [8, 4, 5, 8, 5, 3, 9, 0, 5, 0, 3, 5],
+    [9, 4, 5],
+    [4, 11, 7, 4, 9, 11, 9, 10, 11],
+    [0, 8, 3, 4, 9, 7, 9, 11, 7, 9, 10, 11],
+    [1, 10, 11, 1, 11, 4, 1, 4, 0, 7, 4, 11],
+    [3, 1, 4, 3, 4, 8, 1, 10, 4, 7, 4, 11, 10, 11, 4],
+    [4, 11, 7, 9, 11, 4, 9, 2, 11, 9, 1, 2],
+    [9, 7, 4, 9, 11, 7, 9, 1, 11, 2, 11, 1, 0, 8, 3],
+    [11, 7, 4, 11, 4, 2, 2, 4, 0],
+    [11, 7, 4, 11, 4, 2, 8, 3, 4, 3, 2, 4],
+    [2, 9, 10, 2, 7, 9, 2, 3, 7, 7, 4, 9],
+    [9, 10, 7, 9, 7, 4, 10, 2, 7, 8, 7, 0, 2, 0, 7],
+    [3, 7, 10, 3, 10, 2, 7, 4, 10, 1, 10, 0, 4, 0, 10],
+    [1, 10, 2, 8, 7, 4],
+    [4, 9, 1, 4, 1, 7, 7, 1, 3],
+    [4, 9, 1, 4, 1, 7, 0, 8, 1, 8, 7, 1],
+    [4, 0, 3, 7, 4, 3],
+    [4, 8, 7],
+    [9, 10, 8, 10, 11, 8],
+    [3, 0, 9, 3, 9, 11, 11, 9, 10],
+    [0, 1, 10, 0, 10, 8, 8, 10, 11],
+    [3, 1, 10, 11, 3, 10],
+    [1, 2, 11, 1, 11, 9, 9, 11, 8],
+    [3, 0, 9, 3, 9, 11, 1, 2, 9, 2, 11, 9],
+    [0, 2, 11, 8, 0, 11],
+    [3, 2, 11],
+    [2, 3, 8, 2, 8, 10, 10, 8, 9],
+    [9, 10, 2, 0, 9, 2],
+    [2, 3, 8, 2, 8, 10, 0, 1, 8, 1, 10, 8],
+    [1, 10, 2],
+    [1, 3, 8, 9, 1, 8],
+    [0, 9, 1],
+    [0, 3, 8],
+    [],
+];
+// Vertex positions for the 8 corners of a unit cube - flat arrays for speed
+// Format: [x0,y0,z0, x1,y1,z1, ...] - access as CUBE_VERTS_X[i], etc.
+const CUBE_VERTS_X = new Int8Array([0, 1, 1, 0, 0, 1, 1, 0]);
+const CUBE_VERTS_Y = new Int8Array([0, 0, 1, 1, 0, 0, 1, 1]);
+const CUBE_VERTS_Z = new Int8Array([0, 0, 0, 0, 1, 1, 1, 1]);
+// Edge definitions: pairs of vertex indices for each of 12 edges
+// Flattened for direct access: edge i has vertices EDGE_V1[i] and EDGE_V2[i]
+const EDGE_V1 = new Uint8Array([0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3]);
+const EDGE_V2 = new Uint8Array([1, 2, 3, 0, 5, 6, 7, 4, 4, 5, 6, 7]);
+// Compute gradient (normal) at a grid point using central differences
+function compute_gradient(grid, ix, iy, iz, nx, ny, nz, periodic) {
+    // Wrap for periodic, clamp for non-periodic boundaries
+    const wrap = (val, dim) => ((val % dim) + dim) % dim;
+    const clamp = (val, max) => Math.max(0, Math.min(val, max));
+    const [ix_w, iy_w, iz_w] = periodic
+        ? [wrap(ix, nx), wrap(iy, ny), wrap(iz, nz)]
+        : [clamp(ix, nx - 1), clamp(iy, ny - 1), clamp(iz, nz - 1)];
+    const [ix_m, ix_p] = periodic
+        ? [wrap(ix - 1, nx), wrap(ix + 1, nx)]
+        : [Math.max(0, ix - 1), Math.min(nx - 1, ix + 1)];
+    const [iy_m, iy_p] = periodic
+        ? [wrap(iy - 1, ny), wrap(iy + 1, ny)]
+        : [Math.max(0, iy - 1), Math.min(ny - 1, iy + 1)];
+    const [iz_m, iz_p] = periodic
+        ? [wrap(iz - 1, nz), wrap(iz + 1, nz)]
+        : [Math.max(0, iz - 1), Math.min(nz - 1, iz + 1)];
+    const dx = (grid[ix_p][iy_w][iz_w] - grid[ix_m][iy_w][iz_w]) * 0.5;
+    const dy = (grid[ix_w][iy_p][iz_w] - grid[ix_w][iy_m][iz_w]) * 0.5;
+    const dz = (grid[ix_w][iy_w][iz_p] - grid[ix_w][iy_w][iz_m]) * 0.5;
+    const len_sq = dx * dx + dy * dy + dz * dz;
+    if (len_sq < 1e-20)
+        return [0, 0, 1];
+    const inv_len = 1 / Math.sqrt(len_sq);
+    return [-dx * inv_len, -dy * inv_len, -dz * inv_len];
+}
+// Main marching cubes algorithm (optimized version)
+export function marching_cubes(grid, iso_value, k_lattice, options = {}) {
+    const { periodic = true, interpolate = true, centered = true, normals: compute_norms = true, } = options;
+    // When centered=true, shift fractional coordinates by -0.5 so the grid is
+    // centered at the origin (Γ point). This is needed for proper BZ visualization.
+    const center_offset = centered ? 0.5 : 0;
+    const nx = grid.length;
+    const ny = grid[0]?.length || 0;
+    const nz = grid[0]?.[0]?.length || 0;
+    if (nx < 2 || ny < 2 || nz < 2) {
+        return { vertices: [], faces: [], normals: [] };
+    }
+    const vertices = [];
+    const faces = [];
+    const normals = [];
+    // Precompute grid dimension products for flattening and cache keys
+    const ny_nz = ny * nz;
+    const max_flat = nx * ny_nz; // for computing cache keys
+    // Use numeric cache key - safe for grids up to ~300³ (2^53 / 2 / max_flat)
+    // For much larger grids (>30M cells), consider switching to Map<string, number>
+    // with keys like `${flat1},${flat2}` or Map<bigint, number> to avoid
+    // Number.MAX_SAFE_INTEGER limits. The current approach is faster for typical grids.
+    if (max_flat > 30_000_000) {
+        console.warn(`Grid size ${nx}×${ny}×${nz} may cause cache key overflow`);
+    }
+    const vertex_cache = new Map();
+    // Safe modulo wrapping helper (handles negative values correctly)
+    const wrap = (val, size) => ((val % size) + size) % size;
+    // Precompute k_lattice values for faster coordinate transform
+    const [kx0, kx1, kx2] = k_lattice[0];
+    const [ky0, ky1, ky2] = k_lattice[1];
+    const [kz0, kz1, kz2] = k_lattice[2];
+    // Precompute inverse grid sizes for fractional coordinate conversion.
+    // Non-periodic grids: n points span [0,1] with spacing 1/(n-1) — endpoints at 0 and 1.
+    // Periodic grids: n points span [0,1) with spacing 1/n — point n wraps back to 0.
+    const inv_nx = 1 / (periodic ? nx : nx - 1);
+    const inv_ny = 1 / (periodic ? ny : ny - 1);
+    const inv_nz = 1 / (periodic ? nz : nz - 1);
+    // Get or create vertex on an edge (fully optimized with flat array lookups)
+    const get_vertex_on_edge = (ix, iy, iz, edge_idx, cube_values) => {
+        // Use flat arrays instead of destructuring
+        const v1_idx = EDGE_V1[edge_idx];
+        const v2_idx = EDGE_V2[edge_idx];
+        const ox1 = CUBE_VERTS_X[v1_idx];
+        const oy1 = CUBE_VERTS_Y[v1_idx];
+        const oz1 = CUBE_VERTS_Z[v1_idx];
+        const ox2 = CUBE_VERTS_X[v2_idx];
+        const oy2 = CUBE_VERTS_Y[v2_idx];
+        const oz2 = CUBE_VERTS_Z[v2_idx];
+        // Compute wrapped grid positions using safe modulo for periodic boundaries
+        const g1x = periodic ? wrap(ix + ox1, nx) : ix + ox1;
+        const g1y = periodic ? wrap(iy + oy1, ny) : iy + oy1;
+        const g1z = periodic ? wrap(iz + oz1, nz) : iz + oz1;
+        const g2x = periodic ? wrap(ix + ox2, nx) : ix + ox2;
+        const g2y = periodic ? wrap(iy + oy2, ny) : iy + oy2;
+        const g2z = periodic ? wrap(iz + oz2, nz) : iz + oz2;
+        // Create numeric cache key (sorted for consistency)
+        // Safe for grids up to ~300³ before exceeding Number.MAX_SAFE_INTEGER
+        const flat1 = g1x * ny_nz + g1y * nz + g1z;
+        const flat2 = g2x * ny_nz + g2y * nz + g2z;
+        const cache_key = flat1 < flat2 ? flat1 * max_flat + flat2 : flat2 * max_flat + flat1;
+        const cached = vertex_cache.get(cache_key);
+        if (cached !== undefined)
+            return cached;
+        // Compute vertex position
+        const v1 = cube_values[v1_idx];
+        const v2 = cube_values[v2_idx];
+        let fx, fy, fz;
+        if (interpolate) {
+            const f1x = (ix + ox1) * inv_nx - center_offset;
+            const f1y = (iy + oy1) * inv_ny - center_offset;
+            const f1z = (iz + oz1) * inv_nz - center_offset;
+            const f2x = (ix + ox2) * inv_nx - center_offset;
+            const f2y = (iy + oy2) * inv_ny - center_offset;
+            const f2z = (iz + oz2) * inv_nz - center_offset;
+            const dv = v2 - v1;
+            if (Math.abs(dv) < 1e-10) {
+                fx = f1x;
+                fy = f1y;
+                fz = f1z;
+            }
+            else {
+                const lerp = (iso_value - v1) / dv;
+                fx = f1x + lerp * (f2x - f1x);
+                fy = f1y + lerp * (f2y - f1y);
+                fz = f1z + lerp * (f2z - f1z);
+            }
+        }
+        else {
+            fx = (ix + (ox1 + ox2) * 0.5) * inv_nx - center_offset;
+            fy = (iy + (oy1 + oy2) * 0.5) * inv_ny - center_offset;
+            fz = (iz + (oz1 + oz2) * 0.5) * inv_nz - center_offset;
+        }
+        // Transform to Cartesian (inlined)
+        const vert_idx = vertices.length;
+        vertices.push([
+            fx * kx0 + fy * ky0 + fz * kz0,
+            fx * kx1 + fy * ky1 + fz * kz1,
+            fx * kx2 + fy * ky2 + fz * kz2,
+        ]);
+        // Compute normal from grid gradient (skip if caller will compute from geometry)
+        if (compute_norms) {
+            normals.push(compute_gradient(grid, ix + ox1, iy + oy1, iz + oz1, nx, ny, nz, periodic));
+        }
+        vertex_cache.set(cache_key, vert_idx);
+        return vert_idx;
+    };
+    // Iterate over all cubes in the grid
+    const max_x = periodic ? nx : nx - 1;
+    const max_y = periodic ? ny : ny - 1;
+    const max_z = periodic ? nz : nz - 1;
+    // Preallocate cube_values array (reuse across iterations)
+    const cube_values = new Array(8);
+    for (let ix = 0; ix < max_x; ix++) {
+        const ix_row = grid[ix];
+        const ix1_row = grid[(ix + 1) % nx];
+        for (let iy = 0; iy < max_y; iy++) {
+            const iy_col = ix_row[iy];
+            const iy1_col = ix_row[(iy + 1) % ny];
+            const ix1_iy_col = ix1_row[iy];
+            const ix1_iy1_col = ix1_row[(iy + 1) % ny];
+            for (let iz = 0; iz < max_z; iz++) {
+                const iz1 = (iz + 1) % nz;
+                // Get corner values (inlined for speed)
+                cube_values[0] = iy_col[iz];
+                cube_values[1] = ix1_iy_col[iz];
+                cube_values[2] = ix1_iy1_col[iz];
+                cube_values[3] = iy1_col[iz];
+                cube_values[4] = iy_col[iz1];
+                cube_values[5] = ix1_iy_col[iz1];
+                cube_values[6] = ix1_iy1_col[iz1];
+                cube_values[7] = iy1_col[iz1];
+                // Compute cube index (unrolled for speed)
+                let cube_index = 0;
+                if (cube_values[0] < iso_value)
+                    cube_index |= 1;
+                if (cube_values[1] < iso_value)
+                    cube_index |= 2;
+                if (cube_values[2] < iso_value)
+                    cube_index |= 4;
+                if (cube_values[3] < iso_value)
+                    cube_index |= 8;
+                if (cube_values[4] < iso_value)
+                    cube_index |= 16;
+                if (cube_values[5] < iso_value)
+                    cube_index |= 32;
+                if (cube_values[6] < iso_value)
+                    cube_index |= 64;
+                if (cube_values[7] < iso_value)
+                    cube_index |= 128;
+                // Skip if cube is entirely inside or outside
+                if (EDGE_TABLE[cube_index] === 0)
+                    continue;
+                // Get triangles for this cube configuration
+                const tri_list = TRI_TABLE[cube_index];
+                const tri_len = tri_list.length;
+                // Create triangles
+                for (let tri_idx = 0; tri_idx < tri_len; tri_idx += 3) {
+                    const v0 = get_vertex_on_edge(ix, iy, iz, tri_list[tri_idx], cube_values);
+                    const v1 = get_vertex_on_edge(ix, iy, iz, tri_list[tri_idx + 1], cube_values);
+                    const v2 = get_vertex_on_edge(ix, iy, iz, tri_list[tri_idx + 2], cube_values);
+                    // Skip degenerate triangles
+                    if (v0 !== v1 && v1 !== v2 && v0 !== v2) {
+                        faces.push([v0, v1, v2]);
+                    }
+                }
+            }
+        }
+    }
+    return { vertices, faces, normals };
+}
+// Compute per-vertex normals from faces using area-weighted averaging
+// Uses fan triangulation for N-gon faces (quads, etc.)
+export function compute_vertex_normals(vertices, faces) {
+    const normals = vertices.map(() => [0, 0, 0]);
+    for (const face of faces) {
+        // Validate face has at least 3 indices and all are within bounds
+        if (face.length < 3)
+            continue;
+        if (face.some((idx) => idx < 0 || idx >= vertices.length))
+            continue;
+        // Fan triangulation: for N vertices, process N-2 triangles (0,1,2), (0,2,3), ...
+        const v0 = vertices[face[0]];
+        for (let fan_idx = 1; fan_idx < face.length - 1; fan_idx++) {
+            const idx1 = face[fan_idx];
+            const idx2 = face[fan_idx + 1];
+            const v1 = vertices[idx1];
+            const v2 = vertices[idx2];
+            // Edge vectors
+            const e1 = [v1[0] - v0[0], v1[1] - v0[1], v1[2] - v0[2]];
+            const e2 = [v2[0] - v0[0], v2[1] - v0[1], v2[2] - v0[2]];
+            // Cross product (face normal * 2 * area)
+            const normal = [
+                e1[1] * e2[2] - e1[2] * e2[1],
+                e1[2] * e2[0] - e1[0] * e2[2],
+                e1[0] * e2[1] - e1[1] * e2[0],
+            ];
+            // Add to the 3 vertices of this triangle
+            normals[face[0]][0] += normal[0];
+            normals[face[0]][1] += normal[1];
+            normals[face[0]][2] += normal[2];
+            normals[idx1][0] += normal[0];
+            normals[idx1][1] += normal[1];
+            normals[idx1][2] += normal[2];
+            normals[idx2][0] += normal[0];
+            normals[idx2][1] += normal[1];
+            normals[idx2][2] += normal[2];
+        }
+    }
+    // Normalize all normals
+    for (const normal of normals) {
+        const len = Math.hypot(normal[0], normal[1], normal[2]);
+        if (len > 0) {
+            normal[0] /= len;
+            normal[1] /= len;
+            normal[2] /= len;
+        }
+    }
+    return normals;
+}

package/dist/math.d.ts

@@ -34,6 +34,7 @@ export type Matrix4Tuple = [
     number,
     number
 ];
+export declare function combinations<T>(arr: T[], k: number): T[][];
 export declare const LOG_EPS = 1e-9;
 export declare const EPS = 1e-10;
 export declare const RAD_TO_DEG: number;
@@ -71,7 +72,11 @@ export declare const cross_3d: (vec1: Vec3, vec2: Vec3) => Vec3;
 export declare const lerp: (start: number, end: number, t: number) => number;
 export declare const lerp_vec3: (start: Vec3, end: Vec3, t: number) => Vec3;
 export declare const centered_frac: (val: number) => number;
+export declare const vecs_equal: (vec_a?: Vec3, vec_b?: Vec3) => boolean;
 export declare function normalize_vec3(vec: Vec3, fallback?: Vec3): Vec3;
+export declare function compute_in_plane_basis(normal: Vec3): [Vec3, Vec3];
+export declare function are_coplanar(points: number[][], tolerance?: number): boolean;
+export declare function merge_coplanar_triangles(positions: Float32Array, tolerance?: number): Float32Array;
 export declare function compute_bounding_box(vertices: Vec3[]): {
     min: Vec3;
     max: Vec3;
@@ -85,3 +90,6 @@ export declare function compute_bounding_box_2d(vertices: Vec2[]): {
     height: number;
 };
 export declare function polygon_centroid(vertices: Vec2[]): Vec2;
+export declare function solve_linear_system(A: number[][], // NxN coefficient matrix
+b: number[]): number[] | null;
+export declare function convex_hull_2d(points: Vec2[]): Vec2[];