@woosh/meep-engine 2.131.48 → 2.132.1

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

@@ -1,7 +1,8 @@
 /**
  * @see https://github.com/blender/blender/blob/master/source/blender/blenlib/intern/BLI_mempool.c
+ * @implements {Iterable<number>}
  */
-export class BinaryElementPool {
+export class BinaryElementPool implements Iterable<number> {
     /**
      *
      * @param {number} item_size in bytes
@@ -165,5 +166,21 @@ export class BinaryElementPool {
      * Note that initial allocation pointer is set to 0
      */
     clear(): void;
+    /**
+     * Copy data from another pool
+     * @param {BinaryElementPool} other
+     */
+    copy(other: BinaryElementPool): void;
+    /**
+     * Used for type checking
+     * @readonly
+     * @type {boolean}
+     */
+    readonly isBinaryElementPool: boolean;
+    /**
+     *
+     * @return {Generator<number>}
+     */
+    [Symbol.iterator](): Generator<number>;
 }
 //# sourceMappingURL=BinaryElementPool.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"BinaryElementPool.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryElementPool.js"],"names":[],"mappings":"AAyBA;;GAEG;AACH;IAwBI;;;;;OAKG;IACH,uBAJW,MAAM,qBACN,MAAM,sBACN,OAAO,EAkDjB;IA5ED;;;;OAIG;IACH,eAAY;IAEZ;;;;;OAKG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAW;IAeP;;;;OAIG;IACH,oBAA4B;IAG5B;;;;OAIG;IACH,sBAA8F;IAC9F;;;;OAIG;IACH,qBAAsD;IACtD;;;;OAIG;IACH,sBAAwD;IACxD;;;;OAIG;IACH,uBAA0D;IAC1D,oBAAiD;IAEjD;;;;OAIG;IACH,mBAAkC;IAItC;;;;OAIG;IACH,wBAHW,WAAW,2BACX,MAAM,QAsBhB;IAED,+BAEC;IAED;;;OAGG;IACH,wBAEC;IAED;;;;OAIG;IACH,mBAEC;IAED;;;OAGG;IACH,uBAEC;IAED;;;OAGG;IACH,uBAEC;IAGD;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,iCAEC;IAED;;OAEG;IACH,aAEC;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,MAAM,CAMjB;IAED;;;;;OAKG;IACH,iBAHW,MAAM,GACL,MAAM,CAIjB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACL,OAAO,CAsBlB;IAED;;;;OAIG;IACH,uBAwBC;IAED;;;;OAIG;IACH,wBAQC;IAED;;;OAGG;IACH,0BAFW,MAAM,QAMhB;IAGD;;;OAGG;IACH,YAFY,MAAM,CAqBjB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,MAAM,CAcjB;IAED;;;;OAIG;IACH,YAFW,MAAM,QAYhB;IAED;;;OAGG;IACH,cAGC;CACJ"}
+{"version":3,"file":"BinaryElementPool.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryElementPool.js"],"names":[],"mappings":"AA0BA;;;GAGG;AACH,mDAFyB,MAAM;IA0B3B;;;;;OAKG;IACH,uBAJW,MAAM,qBACN,MAAM,sBACN,OAAO,EAkDjB;IA5ED;;;;OAIG;IACH,eAAY;IAEZ;;;;;OAKG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAW;IAeP;;;;OAIG;IACH,oBAA4B;IAG5B;;;;OAIG;IACH,sBAA8F;IAC9F;;;;OAIG;IACH,qBAAsD;IACtD;;;;OAIG;IACH,sBAAwD;IACxD;;;;OAIG;IACH,uBAA0D;IAC1D,oBAAiD;IAEjD;;;;OAIG;IACH,mBAAkC;IAItC;;;;OAIG;IACH,wBAHW,WAAW,2BACX,MAAM,QAsBhB;IAED,+BAEC;IAED;;;OAGG;IACH,wBAEC;IAED;;;;OAIG;IACH,mBAEC;IAED;;;OAGG;IACH,uBAEC;IAED;;;OAGG;IACH,uBAEC;IAGD;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,iCAEC;IAED;;OAEG;IACH,aAEC;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,MAAM,CAMjB;IAED;;;;;OAKG;IACH,iBAHW,MAAM,GACL,MAAM,CAIjB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACL,OAAO,CAsBlB;IAED;;;;OAIG;IACH,uBAwBC;IAED;;;;OAIG;IACH,wBAQC;IAED;;;OAGG;IACH,0BAFW,MAAM,QAMhB;IAGD;;;OAGG;IACH,YAFY,MAAM,CAqBjB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,MAAM,CAcjB;IAED;;;;OAIG;IACH,YAFW,MAAM,QAYhB;IAED;;;OAGG;IACH,cAGC;IAED;;;OAGG;IACH,YAFW,iBAAiB,QA0B3B;IAoBL;;;;OAIG;IACH,8BAFU,OAAO,CAE8B;IAvB3C;;;OAGG;IACH,qBAFY,UAAU,MAAM,CAAC,CAa5B;CACJ"}

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

@@ -1,6 +1,7 @@
 import { assert } from "../../../../../assert.js";
 import { align_4 } from "../../../../../binary/align_4.js";
 import { makeArrayBuffer } from "../../../../../binary/makeArrayBuffer.js";
+import { array_buffer_copy } from "../../../../../collection/array/typed/array_buffer_copy.js";
 import { typed_array_copy } from "../../../../../collection/array/typed/typed_array_copy.js";
 import { max3 } from "../../../../../math/max3.js";
 
@@ -25,6 +26,7 @@ const CAPACITY_GROW_MIN_STEP = 32;
 
 /**
  * @see https://github.com/blender/blender/blob/master/source/blender/blenlib/intern/BLI_mempool.c
+ * @implements {Iterable<number>}
  */
 export class BinaryElementPool {
 
@@ -368,4 +370,58 @@ export class BinaryElementPool {
         this.__size = 0;
         this.__free_pointer = 0;
     }
+
+    /**
+     * Copy data from another pool
+     * @param {BinaryElementPool} other
+     */
+    copy(other) {
+        assert.defined(other, 'other');
+        assert.notNull(other, 'other');
+        assert.isObject(other, 'other');
+        assert.equal(other.isBinaryElementPool, true, 'other.isBinaryElementPool !== true');
+
+        this.__size = other.size;
+        this.__item_size = other.item_size;
+
+        const other_data_size = other.size * this.item_size;
+
+        const this_data = this.__data_buffer;
+        const other_data = other.__data_buffer;
+
+        if (this_data.byteLength < other_data_size) {
+            // pool is too small, re-allocate with a fast copy
+            this.fromArrayBuffer(other_data.slice(0), this.__size);
+        } else {
+            // pool is big enough, copy the data
+            array_buffer_copy(other_data, 0, this_data, 0, other_data_size);
+        }
+
+        this.__free_pointer = other.__free_pointer;
+        this.__free = other.__free.slice();
+    }
+
+    /**
+     *
+     * @return {Generator<number>}
+     */
+    * [Symbol.iterator]() {
+
+        for (let i = 0; i < this.__size; i++) {
+
+            if (this.is_allocated(i) === false) {
+                continue;
+            }
+
+            yield i;
+        }
+
+    }
 }
+
+/**
+ * Used for type checking
+ * @readonly
+ * @type {boolean}
+ */
+BinaryElementPool.prototype.isBinaryElementPool = true;

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

@@ -4,8 +4,8 @@
  */
 export const NULL_POINTER: number;
 /**
- * Heavily influenced by blender's internal mesh structure
- * @see https://github.com/blender/blender/blob/master/source/blender/bmesh/bmesh_class.h
+ * A high-performance memory-efficient, binary-backed topological data structure for representing 3D meshes.
+ * Manages interconnected vertices, edges, loops, and faces using contiguous memory pools.
  */
 export class BinaryTopology {
     /**
@@ -56,6 +56,10 @@ export class BinaryTopology {
      * @return {number}
      */
     get byteSize(): number;
+    /**
+     * Releases excess memory held by internal pools.
+     * Useful for serialization use cases.
+     */
     trim(): void;
     /**
      *
@@ -72,6 +76,10 @@ export class BinaryTopology {
      * @return {BinaryElementPool}
      */
     get loops(): BinaryElementPool;
+    /**
+     *
+     * @returns {BinaryElementPool}
+     */
     get faces(): BinaryElementPool;
     /**
      * Clear the topology, removed all data
@@ -87,10 +95,10 @@ export class BinaryTopology {
     /**
      *
      * @param {number} id
-     * @param {number[]} value
+     * @param {number[]|Float32Array} value
      * @param {number} value_offset
      */
-    vertex_write_coordinate(id: number, value: number[], value_offset: number): void;
+    vertex_write_coordinate(id: number, value: number[] | Float32Array, value_offset: number): void;
     /**
      *
      * @param {number[]|ArrayLike<number>|Float32Array} result
@@ -101,10 +109,10 @@ export class BinaryTopology {
     /**
      *
      * @param {number} id
-     * @param {number[]} value
+     * @param {number[]|Float32Array} value
      * @param {number} value_offset
      */
-    vertex_write_normal(id: number, value: number[], value_offset: number): void;
+    vertex_write_normal(id: number, value: number[] | Float32Array, value_offset: number): void;
     /**
      * @param {number} id
      * @returns {number}
@@ -145,51 +153,51 @@ export class BinaryTopology {
     edge_read_loop(id: number): number;
     /**
      *
-     * @param {number} value
+     * @param {number} loop_id loop ID
      * @param {number} id edge ID
      */
-    edge_write_loop(id: number, value: number): void;
+    edge_write_loop(id: number, loop_id: number): void;
     /**
      * @param {number} id edge ID
-     * @returns {number}
+     * @returns {number} edge ID
      */
     edge_read_v1_disk_next(id: number): number;
     /**
      *
-     * @param {number} value
+     * @param {number} value edge ID
      * @param {number} id edge ID
      */
     edge_write_v1_disk_next(id: number, value: number): void;
     /**
      * @param {number} id edge ID
-     * @returns {number}
+     * @returns {number} edge ID
      */
     edge_read_v1_disk_prev(id: number): number;
     /**
      *
-     * @param {number} value
+     * @param {number} value edge ID
      * @param {number} id edge ID
      */
     edge_write_v1_disk_prev(id: number, value: number): void;
     /**
      * @param {number} id edge ID
-     * @returns {number}
+     * @returns {number} edge ID
      */
     edge_read_v2_disk_next(id: number): number;
     /**
      *
-     * @param {number} value
+     * @param {number} value edge ID
      * @param {number} id edge ID
      */
     edge_write_v2_disk_next(id: number, value: number): void;
     /**
      * @param {number} id edge ID
-     * @returns {number}
+     * @returns {number} edge ID
      */
     edge_read_v2_disk_prev(id: number): number;
     /**
      *
-     * @param {number} value
+     * @param {number} value edge ID
      * @param {number} id edge ID
      */
     edge_write_v2_disk_prev(id: number, value: number): void;
@@ -294,6 +302,28 @@ export class BinaryTopology {
      * @param {number} id face ID
      */
     face_write_loop(id: number, value: number): void;
+    /**
+     * @param {number[]|ArrayLike<number>|Float32Array} result
+     * @param {number} result_offset
+     * @param {number} id face ID
+     */
+    face_read_normal(result: number[] | ArrayLike<number> | Float32Array, result_offset: number, id: number): void;
+    /**
+     * @param {number} id face ID
+     * @param {number[]|Float32Array} value
+     * @param {number} value_offset
+     */
+    face_write_normal(id: number, value: number[] | Float32Array, value_offset: number): void;
+    /**
+     * Copy data from another mesh.
+     * @param {BinaryTopology} other
+     */
+    copy(other: BinaryTopology): void;
+    /**
+     *
+     * @returns {BinaryTopology}
+     */
+    clone(): BinaryTopology;
     /**
      * Useful for type checking
      * @readonly

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

@@ -1 +1 @@
-{"version":3,"file":"BinaryTopology.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryTopology.js"],"names":[],"mappings":"AAkBA;;;GAGG;AACH,2BAFU,MAAM,CAEuB;AAEvC;;;GAGG;AACH;IACI;;;;;;;;OAQG;IACH,sBAA4F;IAE5F;;;;;;;;;OASG;IACH,oBAAsD;IAEtD;;;;;;;;;;;;OAYG;IACH,oBAAsD;IAEtD;;;;;;OAMG;IACH,oBAAsE;IAGtE;;;OAGG;IACH,uBAMC;IAED,aAKC;IAED;;;OAGG;IACH,kCAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,+BAEC;IAED,+BAEC;IAGD;;OAEG;IACH,cAKC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAQhB;IAED;;;;;OAKG;IACH,4BAJW,MAAM,SACN,MAAM,EAAE,gBACR,MAAM,QAQhB;IAED;;;;;OAKG;IACH,2BAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAQhB;IAED;;;;;OAKG;IACH,wBAJW,MAAM,SACN,MAAM,EAAE,gBACR,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,sBAFW,MAAM,WADN,MAAM,QAQhB;IAED;;;OAGG;IACH,sBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,uBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;OAGG;IACH,sBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,uBAFW,MAAM,SADN,MAAM,QAQhB;IAGD;;;OAGG;IACH,mBAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED,sBAMC;IAED;;;OAGG;IACH,oBAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,qBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,sBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,2BAFW,MAAM,SADN,MAAM,QAShB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,2BAFW,MAAM,SADN,MAAM,QAShB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAGL;;;;OAIG;IACH,2BAFU,OAAO,CAEwB;CAPxC;kCA7mBiC,wBAAwB"}
+{"version":3,"file":"BinaryTopology.d.ts","sourceRoot":"","sources":["../../../../../../../../src/core/geom/3d/topology/struct/binary/BinaryTopology.js"],"names":[],"mappings":"AAkBA;;;GAGG;AACH,2BAFU,MAAM,CAEuB;AAQvC;;;GAGG;AACH;IACI;;;;;;;;OAQG;IACH,sBAA4F;IAE5F;;;;;;;;;OASG;IACH,oBAAsD;IAEtD;;;;;;;;;;;;OAYG;IACH,oBAAsD;IAEtD;;;;;;OAMG;IACH,oBAAsE;IAGtE;;;OAGG;IACH,uBAMC;IAED;;;OAGG;IACH,aAKC;IAED;;;OAGG;IACH,kCAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,+BAEC;IAED;;;OAGG;IACH,+BAEC;IAGD;;OAEG;IACH,cAKC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAQhB;IAED;;;;;OAKG;IACH,4BAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAQhB;IAED;;;;;OAKG;IACH,2BAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAQhB;IAED;;;;;OAKG;IACH,wBAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,sBAFW,MAAM,WADN,MAAM,QAQhB;IAED;;;OAGG;IACH,sBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,uBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;OAGG;IACH,sBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,uBAFW,MAAM,SADN,MAAM,QAQhB;IAGD;;;OAGG;IACH,mBAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,WADN,MAAM,QAQhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;OAGG;IACH,2BAHW,MAAM,GACJ,MAAM,CAWlB;IAED;;;;OAIG;IACH,4BAFW,MAAM,SADN,MAAM,QAUhB;IAED,sBAMC;IAED;;;OAGG;IACH,oBAFW,MAAM,QAOhB;IAED;;;OAGG;IACH,qBAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,sBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAUhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,2BAFW,MAAM,SADN,MAAM,QAShB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAQlB;IAED;;;;OAIG;IACH,2BAFW,MAAM,SADN,MAAM,QAShB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,GACJ,MAAM,CAOlB;IAED;;;;OAIG;IACH,oBAFW,MAAM,SADN,MAAM,QAQhB;IAED;;;;OAIG;IACH,yBAJW,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,GAAC,YAAY,iBACvC,MAAM,MACN,MAAM,QAQhB;IAED;;;;OAIG;IACH,sBAJW,MAAM,SACN,MAAM,EAAE,GAAC,YAAY,gBACrB,MAAM,QAOhB;IAED;;;OAGG;IACH,YAFW,cAAc,QAgBxB;IAED;;;OAGG;IACH,SAFa,cAAc,CAM1B;IAIL;;;;OAIG;IACH,2BAFU,OAAO,CAEwB;CAPxC;kCAnrBiC,wBAAwB"}

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

@@ -22,9 +22,15 @@ const UINT_32_SIZE = 4;
  */
 export const NULL_POINTER = 0xFFFFFFFF;
 
+
+/*
+Heavily influenced by blender's internal mesh structure.
+@see https://github.com/blender/blender/blob/master/source/blender/bmesh/bmesh_class.h
+ */
+
 /**
- * Heavily influenced by blender's internal mesh structure
- * @see https://github.com/blender/blender/blob/master/source/blender/bmesh/bmesh_class.h
+ * A high-performance memory-efficient, binary-backed topological data structure for representing 3D meshes.
+ * Manages interconnected vertices, edges, loops, and faces using contiguous memory pools.
  */
 export class BinaryTopology {
     /**
@@ -87,6 +93,10 @@ export class BinaryTopology {
             ;
     }
 
+    /**
+     * Releases excess memory held by internal pools.
+     * Useful for serialization use cases.
+     */
     trim() {
         this.__loop_pool.trim();
         this.__vertex_pool.trim();
@@ -118,6 +128,10 @@ export class BinaryTopology {
         return this.__loop_pool;
     }
 
+    /**
+     *
+     * @returns {BinaryElementPool}
+     */
     get faces() {
         return this.__face_pool;
     }
@@ -150,7 +164,7 @@ export class BinaryTopology {
     /**
      *
      * @param {number} id
-     * @param {number[]} value
+     * @param {number[]|Float32Array} value
      * @param {number} value_offset
      */
     vertex_write_coordinate(id, value, value_offset) {
@@ -178,7 +192,7 @@ export class BinaryTopology {
     /**
      *
      * @param {number} id
-     * @param {number[]} value
+     * @param {number[]|Float32Array} value
      * @param {number} value_offset
      */
     vertex_write_normal(id, value, value_offset) {
@@ -279,19 +293,19 @@ export class BinaryTopology {
 
     /**
      *
-     * @param {number} value
+     * @param {number} loop_id loop ID
      * @param {number} id edge ID
      */
-    edge_write_loop(id, value) {
+    edge_write_loop(id, loop_id) {
         const pool = this.__edge_pool;
 
         const address = pool.element_address(id);
-        pool.data_view.setUint32(address + 2 * UINT_32_SIZE, value);
+        pool.data_view.setUint32(address + 2 * UINT_32_SIZE, loop_id);
     }
 
     /**
      * @param {number} id edge ID
-     * @returns {number}
+     * @returns {number} edge ID
      */
     edge_read_v1_disk_next(id) {
         assert.isNonNegativeInteger(id, 'id');
@@ -306,7 +320,7 @@ export class BinaryTopology {
 
     /**
      *
-     * @param {number} value
+     * @param {number} value edge ID
      * @param {number} id edge ID
      */
     edge_write_v1_disk_next(id, value) {
@@ -320,7 +334,7 @@ export class BinaryTopology {
 
     /**
      * @param {number} id edge ID
-     * @returns {number}
+     * @returns {number} edge ID
      */
     edge_read_v1_disk_prev(id) {
         assert.isNonNegativeInteger(id, 'id');
@@ -335,7 +349,7 @@ export class BinaryTopology {
 
     /**
      *
-     * @param {number} value
+     * @param {number} value edge ID
      * @param {number} id edge ID
      */
     edge_write_v1_disk_prev(id, value) {
@@ -349,7 +363,7 @@ export class BinaryTopology {
 
     /**
      * @param {number} id edge ID
-     * @returns {number}
+     * @returns {number} edge ID
      */
     edge_read_v2_disk_next(id) {
         assert.isNonNegativeInteger(id, 'id');
@@ -364,7 +378,7 @@ export class BinaryTopology {
 
     /**
      *
-     * @param {number} value
+     * @param {number} value edge ID
      * @param {number} id edge ID
      */
     edge_write_v2_disk_next(id, value) {
@@ -378,7 +392,7 @@ export class BinaryTopology {
 
     /**
      * @param {number} id edge ID
-     * @returns {number}
+     * @returns {number} edge ID
      */
     edge_read_v2_disk_prev(id) {
         assert.isNonNegativeInteger(id, 'id');
@@ -393,7 +407,7 @@ export class BinaryTopology {
 
     /**
      *
-     * @param {number} value
+     * @param {number} value edge ID
      * @param {number} id edge ID
      */
     edge_write_v2_disk_prev(id, value) {
@@ -621,6 +635,62 @@ export class BinaryTopology {
         const address = pool.element_address(id);
         pool.data_view.setUint32(address, value);
     }
+
+    /**
+     * @param {number[]|ArrayLike<number>|Float32Array} result
+     * @param {number} result_offset
+     * @param {number} id face ID
+     */
+    face_read_normal(result, result_offset, id) {
+        const pool = this.__face_pool;
+        // Offset by the first loop pointer (UINT_32_SIZE)
+        const f_address = pool.element_address(id) + UINT_32_SIZE;
+        const f_offset = f_address >> 2;
+        array_copy(pool.data_float32, f_offset, result, result_offset, 3);
+    }
+
+    /**
+     * @param {number} id face ID
+     * @param {number[]|Float32Array} value
+     * @param {number} value_offset
+     */
+    face_write_normal(id, value, value_offset) {
+        const pool = this.__face_pool;
+        const f_address = pool.element_address(id) + UINT_32_SIZE;
+        const f_offset = f_address >> 2;
+        array_copy(value, value_offset, pool.data_float32, f_offset, 3);
+    }
+
+    /**
+     * Copy data from another mesh.
+     * @param {BinaryTopology} other
+     */
+    copy(other) {
+        assert.defined(other, 'other');
+        assert.notNull(other, 'other');
+        assert.isObject(other, 'other');
+        assert.equal(other.isBinaryTopology, true, 'other is not a BinaryTopology');
+
+        if (this === other) {
+            return;
+        }
+
+        this.__vertex_pool.copy(other.vertices);
+        this.__edge_pool.copy(other.edges);
+        this.__loop_pool.copy(other.loops);
+        this.__face_pool.copy(other.faces);
+    }
+
+    /**
+     *
+     * @returns {BinaryTopology}
+     */
+    clone() {
+        const clone = new BinaryTopology();
+        clone.copy(this);
+        return clone;
+    }
+
 }
 
 /**

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

@@ -0,0 +1,9 @@
+/**
+ *
+ * Adds an edge to a vertex's disk cycle.
+ * @param {BinaryTopology} mesh
+ * @param {number} e Edge ID
+ * @param {number} v Vertex ID
+ */
+export function bt_disk_edge_add(mesh: BinaryTopology, e: number, v: number): void;
+//# sourceMappingURL=bt_disk_edge_add.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_disk_edge_add.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_disk_edge_add.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,0DAHW,MAAM,KACN,MAAM,QAmChB"}

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

@@ -0,0 +1,43 @@
+import { NULL_POINTER } from "../BinaryTopology.js";
+
+/**
+ *
+ * Adds an edge to a vertex's disk cycle.
+ * @param {BinaryTopology} mesh
+ * @param {number} e Edge ID
+ * @param {number} v Vertex ID
+ */
+export function bt_disk_edge_add(mesh, e, v) {
+    const is_v1 = mesh.edge_read_vertex1(e) === v;
+    const first_edge = mesh.vertex_read_edge(v);
+
+    if (first_edge === NULL_POINTER) {
+        if (is_v1) {
+            mesh.edge_write_v1_disk_prev(e, e);
+            mesh.edge_write_v1_disk_next(e, e);
+        } else {
+            mesh.edge_write_v2_disk_prev(e, e);
+            mesh.edge_write_v2_disk_next(e, e);
+        }
+        mesh.vertex_write_edge(v, e);
+    } else {
+        const first_is_v1 = mesh.edge_read_vertex1(first_edge) === v;
+        const prev = first_is_v1 ? mesh.edge_read_v1_disk_prev(first_edge) : mesh.edge_read_v2_disk_prev(first_edge);
+
+        // Insert `e` between `prev` and `first_edge`
+        if (is_v1) {
+            mesh.edge_write_v1_disk_prev(e, prev);
+            mesh.edge_write_v1_disk_next(e, first_edge);
+        } else {
+            mesh.edge_write_v2_disk_prev(e, prev);
+            mesh.edge_write_v2_disk_next(e, first_edge);
+        }
+
+        const prev_is_v1 = mesh.edge_read_vertex1(prev) === v;
+        if (prev_is_v1) mesh.edge_write_v1_disk_next(prev, e);
+        else mesh.edge_write_v2_disk_next(prev, e);
+
+        if (first_is_v1) mesh.edge_write_v1_disk_prev(first_edge, e);
+        else mesh.edge_write_v2_disk_prev(first_edge, e);
+    }
+}

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

@@ -1,8 +1,9 @@
 /**
+ * Removes an edge from a vertex's disk cycle.
  * @see https://github.com/blender/blender/blob/afb0d411072db51b871607034befe3677f9fd82d/source/blender/bmesh/intern/bmesh_structure.cc#L162
  * @param {BinaryTopology} mesh
- * @param {number} edge
- * @param {number} vertex
+ * @param {number} e Edge ID
+ * @param {number} v Vertex ID
  */
-export function bt_disk_edge_remove(mesh: BinaryTopology, edge: number, vertex: number): void;
+export function bt_disk_edge_remove(mesh: BinaryTopology, e: number, v: number): void;
 //# sourceMappingURL=bt_disk_edge_remove.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"bt_disk_edge_remove.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_disk_edge_remove.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,gEAHW,MAAM,UACN,MAAM,QAIhB"}
+{"version":3,"file":"bt_disk_edge_remove.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_disk_edge_remove.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,6DAHW,MAAM,KACN,MAAM,QAmChB"}

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

@@ -1,9 +1,43 @@
+import { NULL_POINTER } from "../BinaryTopology.js";
+
 /**
+ * Removes an edge from a vertex's disk cycle.
  * @see https://github.com/blender/blender/blob/afb0d411072db51b871607034befe3677f9fd82d/source/blender/bmesh/intern/bmesh_structure.cc#L162
  * @param {BinaryTopology} mesh
- * @param {number} edge
- * @param {number} vertex
+ * @param {number} e Edge ID
+ * @param {number} v Vertex ID
  */
-export function bt_disk_edge_remove(mesh, edge, vertex) {
-    throw new Error('Not Implemented');
+export function bt_disk_edge_remove(mesh, e, v) {
+    const is_v1 = mesh.edge_read_vertex1(e) === v;
+
+    const prev = is_v1 ? mesh.edge_read_v1_disk_prev(e) : mesh.edge_read_v2_disk_prev(e);
+    const next = is_v1 ? mesh.edge_read_v1_disk_next(e) : mesh.edge_read_v2_disk_next(e);
+
+    if (prev === e) {
+        // This is the only edge in the cycle
+        mesh.vertex_write_edge(v, NULL_POINTER);
+    } else {
+
+        const prev_is_v1 = mesh.edge_read_vertex1(prev) === v;
+
+        if (prev_is_v1) {
+            mesh.edge_write_v1_disk_next(prev, next);
+        } else {
+            mesh.edge_write_v2_disk_next(prev, next);
+        }
+
+        const next_is_v1 = mesh.edge_read_vertex1(next) === v;
+
+        if (next_is_v1) {
+            mesh.edge_write_v1_disk_prev(next, prev);
+        } else {
+            mesh.edge_write_v2_disk_prev(next, prev);
+        }
+
+        // If the vertex's entry pointer was looking at this edge, shift it
+        if (mesh.vertex_read_edge(v) === e) {
+            mesh.vertex_write_edge(v, next);
+        }
+
+    }
 }

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

@@ -0,0 +1,8 @@
+/**
+ * Safely untangles and removes a loop from the topology.
+ * Removes it from the edge's radial cycle, unlinks it from the face cycle, and frees the memory.
+ * @param {BinaryTopology} mesh
+ * @param {number} loop Loop ID
+ */
+export function bt_loop_kill(mesh: BinaryTopology, loop: number): void;
+//# sourceMappingURL=bt_loop_kill.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bt_loop_kill.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_loop_kill.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,yDAFW,MAAM,QA4BhB"}

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

@@ -0,0 +1,36 @@
+import { NULL_POINTER } from "../BinaryTopology.js";
+import { bt_radial_loop_remove } from "./bt_radial_loop_remove.js";
+
+/**
+ * Safely untangles and removes a loop from the topology.
+ * Removes it from the edge's radial cycle, unlinks it from the face cycle, and frees the memory.
+ * @param {BinaryTopology} mesh
+ * @param {number} loop Loop ID
+ */
+export function bt_loop_kill(mesh, loop) {
+    // 1. Untangle from the edge's radial cycle
+    const edge = mesh.loop_read_edge(loop);
+    if (edge !== NULL_POINTER) {
+        bt_radial_loop_remove(mesh, loop, edge);
+    }
+
+    // 2. Untangle from the face's loop cycle (doubly linked list)
+    const next = mesh.loop_read_next(loop);
+    const prev = mesh.loop_read_prev(loop);
+
+    if (next !== NULL_POINTER && prev !== NULL_POINTER) {
+        mesh.loop_write_next(prev, next);
+        mesh.loop_write_prev(next, prev);
+    }
+
+    // 3. Update the face's base loop pointer if it was looking at this loop
+    const face = mesh.loop_read_face(loop);
+    if (face !== NULL_POINTER) {
+        if (mesh.face_read_loop(face) === loop) {
+            // If it was the only loop left, the face now has no loops
+            mesh.face_write_loop(face, next === loop ? NULL_POINTER : next);
+        }
+    }
+
+    mesh.loops.release(loop);
+}

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

@@ -0,0 +1,10 @@
+/**
+ * Remove vertices/edges/loops/disks etc. that are not referenced by any faces.
+ * Useful when running topology modifying algorithms such as erosion or simplification.
+ * Performs in-place modification of the mesh.
+ *
+ * If a valid mesh is passed in, after calling this - the mesh is guaranteed to be in a valid state.
+ * @param {BinaryTopology} mesh
+ */
+export function bt_mesh_cleanup_faceless_references(mesh: BinaryTopology): void;
+//# sourceMappingURL=bt_mesh_cleanup_faceless_references.d.ts.map

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

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