@woosh/meep-engine 3.64.1 → 3.65.0

package/package.json

@@ -6,7 +6,7 @@
   "description": "Advanced 3D game engine",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "3.64.1",
+  "version": "3.65.0",
   "exports": {
     "./build/*": "./build/*",
     "./src/*": "./src/*",

package/src/core/binary/BinaryBuffer.d.ts

@@ -544,6 +544,11 @@ export class BinaryBuffer {
      */
     writeUint32Array(source: Uint32Array | number[] | ArrayLike<number>, source_offset: number, length: number): void;
     /**
+     * Copy `length` bytes of `array`, from `source_offset`, to the current position. `array` may
+     * share memory with this buffer: the bytes written are the ones it held before the copy.
+     *
+     * Part of a typed array shorter than {@link WRITE_BYTES_VIEW_THRESHOLD} is copied byte by byte
+     * and allocates nothing; a longer part is copied through a view of it, which is allocated.
      *
      * @param {Uint8Array|Uint8ClampedArray} array
      * @param {number} source_offset

package/src/core/binary/BinaryBuffer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BinaryBuffer.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BinaryBuffer.js"],"names":[],"mappings":"AAuCA;;;;;;;;;;;;;;;;;;GAkBG;AACH;IA85CI;;;;OAIG;IACH,4BAHW,UAAU,GACT,YAAY,CAUvB;IAED;;;;OAIG;IACH,0BAHW,WAAW,GACV,YAAY,CAQvB;IAED;;;;;OAKG;IACH,8BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,yBAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;;OAMG;IACH,yBALW,YAAY,UACZ,YAAY,UACZ,MAAM,GACJ,UAAU,CActB;IA7iDD;;;;;OAKG;IACH,YAFU,UAAU,GAAC,OAAO,CAES;IAErC;;;;;OAKG;IACH,UAFU,MAAM,CAEH;IASb;;OAEG;IACH,oBAEC;IAZD;;OAEG;IACH,mBAEC;IASD;;;OAGG;IACH,UAFU,MAAM,CAEgB;IAEhC;;;;;;OAMG;IACH,aAA6C;IAE7C;;;;OAIG;IACH,iBAAmC;IAEnC;;;;OAIG;IACH,qBAAyC;IAEzC;;;;OAIG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,4BAEC;IAED;;;;;;OAMG;IACH,sBAFW,WAAW,QAYrB;IAED;;;;OAIG;IACH,QAFa,YAAY,CAMxB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,QAyChB;IAED;;;OAGG;IACH,6BAFW,MAAM,QAuBhB;IAED;;;OAGG;IACH,eAFa,MAAM,CAMlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,YAFY,MAAM,CAQjB;IAED;;;OAGG;IACH,aAFY,MAAM,CAQjB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,sBAFX,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,sBAFtC,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,2BAFW,SAAS,sBAFT,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,sBAFZ,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAUhB;IAED;;;;;;;;;OASG;IACH,0BAJW,YAAY,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACvC,MAAM,UACN,MAAM,QAoBhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAMhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,uBAJW,SAAS,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACpC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACrC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACrC,MAAM,UACN,MAAM,QAYhB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,iBACnB,MAAM,UACN,MAAM,QAQhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,iBACpB,MAAM,UACN,MAAM,QAQhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;;;;OAMG;IACH,oBAFW,MAAM,QAmChB;IAED;;;OAGG;IACH,eAFa,MAAM,CA8BlB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACtC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,kBAJW,UAAU,GAAC,iBAAiB,iBAC5B,MAAM,UACN,MAAM,QAgChB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,sBACV,MAAM,UACN,MAAM,QAyBhB;IAED;;;OAGG;IACH,wBAFW,MAAM,QA8FhB;IAED;;;OAGG;IACH,kBAFa,MAAM,CAwElB;IAED;;;;;;;;OAQG;IACH,yBAFW,MAAM,QAuBhB;IAED;;;;;;;;;OASG;IACH,4BAJW,MAAM,oBACN,OAAO,GACL,MAAM,CAoBlB;IAED;;;;OAIG;IACH,YAFY,MAAM,CAIjB;IAED;;;;;;;;;;;OAWG;IACH,eAFY,MAAM,CAcjB;IAsJL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CANpC;2BAlmD0B,iBAAiB"}
+{"version":3,"file":"BinaryBuffer.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BinaryBuffer.js"],"names":[],"mappings":"AAoDA;;;;;;;;;;;;;;;;;;GAkBG;AACH;IAm7CI;;;;OAIG;IACH,4BAHW,UAAU,GACT,YAAY,CAUvB;IAED;;;;OAIG;IACH,0BAHW,WAAW,GACV,YAAY,CAQvB;IAED;;;;;OAKG;IACH,8BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,yBAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;;OAMG;IACH,yBALW,YAAY,UACZ,YAAY,UACZ,MAAM,GACJ,UAAU,CActB;IAlkDD;;;;;OAKG;IACH,YAFU,UAAU,GAAC,OAAO,CAES;IAErC;;;;;OAKG;IACH,UAFU,MAAM,CAEH;IASb;;OAEG;IACH,oBAEC;IAZD;;OAEG;IACH,mBAEC;IASD;;;OAGG;IACH,UAFU,MAAM,CAEgB;IAEhC;;;;;;OAMG;IACH,aAA6C;IAE7C;;;;OAIG;IACH,iBAAmC;IAEnC;;;;OAIG;IACH,qBAAyC;IAEzC;;;;OAIG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,4BAEC;IAED;;;;;;OAMG;IACH,sBAFW,WAAW,QAYrB;IAED;;;;OAIG;IACH,QAFa,YAAY,CAMxB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,QAyChB;IAED;;;OAGG;IACH,6BAFW,MAAM,QAuBhB;IAED;;;OAGG;IACH,eAFa,MAAM,CAMlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,YAFY,MAAM,CAQjB;IAED;;;OAGG;IACH,aAFY,MAAM,CAQjB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,sBAFX,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,sBAFtC,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,2BAFW,SAAS,sBAFT,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,sBAFZ,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAUhB;IAED;;;;;;;;;OASG;IACH,0BAJW,YAAY,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACvC,MAAM,UACN,MAAM,QAoBhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAUhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAMhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,uBAJW,SAAS,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACpC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACrC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACrC,MAAM,UACN,MAAM,QAYhB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,iBACnB,MAAM,UACN,MAAM,QAQhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,iBACpB,MAAM,UACN,MAAM,QAQhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;;;;OAMG;IACH,oBAFW,MAAM,QAmChB;IAED;;;OAGG;IACH,eAFa,MAAM,CA8BlB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACtC,MAAM,UACN,MAAM,QAYhB;IAED;;;;;;;;;;OAUG;IACH,kBAJW,UAAU,GAAC,iBAAiB,iBAC5B,MAAM,UACN,MAAM,QAgDhB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,sBACV,MAAM,UACN,MAAM,QAyBhB;IAED;;;OAGG;IACH,wBAFW,MAAM,QA8FhB;IAED;;;OAGG;IACH,kBAFa,MAAM,CAwElB;IAED;;;;;;;;OAQG;IACH,yBAFW,MAAM,QAuBhB;IAED;;;;;;;;;OASG;IACH,4BAJW,MAAM,oBACN,OAAO,GACL,MAAM,CAoBlB;IAED;;;;OAIG;IACH,YAFY,MAAM,CAIjB;IAED;;;;;;;;;;;OAWG;IACH,eAFY,MAAM,CAcjB;IAsJL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CANpC;2BApoD0B,iBAAiB"}

package/src/core/binary/BinaryBuffer.js

@@ -36,6 +36,19 @@ const MAX_SHIFT_UINT_VAR = 28;
  */
 const DEFAULT_INITIAL_SIZE = 1024;
 
+/**
+ * From this many bytes on, {@link BinaryBuffer#writeBytes} copies part of a typed array through a
+ * view of that part; below it, byte by byte.
+ *
+ * The view is an allocation, and a byte loop is not, but the loop is the slower copy from 32 bytes
+ * up, and its cost grows with the length where the view's barely does. The view is there for large
+ * copies. The threshold is the first power of two over an Ethernet frame's 1,500 bytes, so that
+ * nothing copied per network packet allocates.
+ *
+ * @type {number}
+ */
+const WRITE_BYTES_VIEW_THRESHOLD = 2048;
+
 
 /**
  * Utility for reading/writing binary data.
@@ -1155,6 +1168,11 @@ export class BinaryBuffer {
     }
 
     /**
+     * Copy `length` bytes of `array`, from `source_offset`, to the current position. `array` may
+     * share memory with this buffer: the bytes written are the ones it held before the copy.
+     *
+     * Part of a typed array shorter than {@link WRITE_BYTES_VIEW_THRESHOLD} is copied byte by byte
+     * and allocates nothing; a longer part is copied through a view of it, which is allocated.
      *
      * @param {Uint8Array|Uint8ClampedArray} array
      * @param {number} source_offset
@@ -1175,16 +1193,32 @@ export class BinaryBuffer {
 
             this.__data_uint8.set(array, targetAddress);
 
-        } else if (typeof array.subarray === "function") {
-            // typed array, use "subarray" method
+        } else if (length >= WRITE_BYTES_VIEW_THRESHOLD && typeof array.subarray === "function") {
+            // a large part of a typed array: the view is worth its allocation
 
             this.__data_uint8.set(array.subarray(source_offset, source_end), targetAddress);
 
         } else {
-            // not a typed array, copy byte by byte manually
+            // a small part of a typed array, or not a typed array: copy byte by byte
+
+            const data = this.__data_uint8;
+
+            if (array.byteOffset + source_offset >= data.byteOffset + targetAddress) {
+
+                for (let i = 0; i < length; i++) {
+                    data[targetAddress + i] = array[source_offset + i];
+                }
+
+            } else {
+                // If the two share memory the source starts before the destination, and a byte
+                // written going forwards could be one still to be read. Going backwards it cannot.
+                // (Not a typed array: there is no byteOffset, nothing is shared, and either
+                // direction will do.)
+
+                for (let i = length - 1; i >= 0; i--) {
+                    data[targetAddress + i] = array[source_offset + i];
+                }
 
-            for (let i = 0; i < length; i++) {
-                this.__data_uint8[targetAddress + i] = array[source_offset + i];
             }
 
         }

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

@@ -8,9 +8,6 @@
  * PRECONDITION: `cycle` is a single closed loop in which every vertex has exactly two incident edges. That
  * is what the boundary-extraction pass produces; a figure-of-eight or an open chain would walk off.
  *
- * Shared by {@link bt_mesh_close_boundary_holes} and {@link bt_mesh_fill_small_holes}, which each carried
- * a byte-identical copy.
- *
  * @param {BinaryTopology} mesh
  * @param {number[]|Uint32Array} cycle unordered boundary edge ids
  * @param {number} start_vertex vertex to begin the walk at; must be an endpoint of some edge in `cycle`
@@ -36,10 +33,10 @@ export function bt_boundary_loop_order_from(mesh: BinaryTopology, cycle: number[
  * direction opposite to the existing loop's traversal of the seed edge. Change how that walk picks its
  * first edge and the fill face winds the wrong way — which is why the two live in one file.
  *
- * The face normal stays zero; downstream tetrahedralization is position-only.
+ * No face normal is computed; downstream tetrahedralization is position-only.
  *
- * `bt_mesh_close_boundary_holes` and `bt_mesh_fill_small_holes` each carried a copy of this — forty
- * lines, identical in every step — and only the ordering walk above had been lifted out of them.
+ * The fan covers the hole, and only the hole, when every edge of the loop is visible from the centroid
+ * of its vertices. For any other loop use {@link bt_boundary_loop_min_area_fill}.
  *
  * @param {BinaryTopology} mesh
  * @param {number[]|Uint32Array} cycle unordered boundary edge ids forming one closed loop
@@ -48,4 +45,66 @@ export function bt_boundary_loop_order_from(mesh: BinaryTopology, cycle: number[
  * @copyright Company Named Limited (c) 2026
  */
 export function bt_boundary_loop_fan_fill(mesh: BinaryTopology, cycle: number[] | Uint32Array): void;
+/**
+ * Close one boundary hole with triangles over the hole's own vertices, choosing the triangulation of
+ * least total area. No vertex is added.
+ *
+ * ## Why least area
+ *
+ * A fill should cover what the loop encloses and nothing else. For a loop that is a simple polygon in a
+ * plane, every triangulation that stays inside it has the same total area — the polygon's — and any that
+ * puts a triangle outside has more, because that triangle then has to be paid back by another lying
+ * over the surface around the hole, wound the other way. So the least-area triangulation of such a loop
+ * IS a triangulation of the hole, whatever its shape, with no test for convexity or containment that
+ * could be got wrong. For a loop that is not flat it is the classic choice of closing surface, and no
+ * more than that.
+ *
+ * The fan in {@link bt_boundary_loop_fan_fill} does not have that property: it is a triangulation of the
+ * hole only when the whole loop is visible from the centroid of its vertices. For a crescent, an L, or
+ * a crack with more than one arm the centroid lies outside the hole, and the fan covers the surface
+ * between the two with triangles facing both ways.
+ *
+ * A loop need not be a simple polygon at all — a hairline crack encloses nothing, and two sheets that
+ * overlap by a sliver bound a loop that crosses itself. Least area is still the right answer there: it
+ * is the closure that adds as little surface as that loop permits, so the faces of a hole with no width
+ * have no area. Where the sheets overlap, some of those faces are wound against the surface: the loop
+ * itself is, and no closure made of faces alone can be otherwise.
+ *
+ * The search is the dynamic programme of Barequet and Sharir, "Filling gaps in the boundary of a
+ * polyhedron" (1995): the best triangulation of the chain `i .. j` is the best apex `k` between them
+ * plus the best of the two chains either side of it. It measures area in 3D, so the loop needs no plane
+ * to be projected onto. Time is cubic in the loop's edge count and memory quadratic.
+ *
+ * ## Equal areas
+ *
+ * Every triangulation of a flat hole has the same area, so area alone does not say which to take, and
+ * left to rounding the choice falls on triangles across three vertices of one straight side as readily
+ * as on any other — faces of no area, where faces with area would do. Among triangulations whose areas
+ * are equal to within what rounding can make of them, the one taken is the one whose triangles are
+ * nearest equilateral: least in the sum, over its triangles, of squared edge length over area. That is
+ * the measure a Delaunay triangulation minimises, and a triangle with no area makes it infinite.
+ *
+ * ## Edges
+ *
+ * A diagonal between two loop vertices that the mesh already joins by an edge is never used: the fill
+ * would put two more faces on a pair of vertices that already has its own, which is a non-manifold edge
+ * as soon as anything fuses the duplicates. When that rules out every triangulation the hole is left
+ * open and `false` is returned.
+ *
+ * ## Winding
+ *
+ * As in {@link bt_boundary_loop_fan_fill}, and for the reason given there: the loop is ordered from the
+ * seed edge's far endpoint, so every new face crosses each boundary edge against the face already on
+ * it.
+ *
+ * Face normals are written as zero.
+ *
+ * @param {BinaryTopology} mesh
+ * @param {number[]|Uint32Array} cycle unordered boundary edge ids forming one closed loop of at least 3 edges
+ * @returns {boolean} whether the hole was closed
+ *
+ * @author Alex Goldring
+ * @copyright Company Named Limited (c) 2026
+ */
+export function bt_boundary_loop_min_area_fill(mesh: BinaryTopology, cycle: number[] | Uint32Array): boolean;
 //# sourceMappingURL=bt_boundary_loop.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"bt_boundary_loop.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_boundary_loop.js"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,yEARW,MAAM,EAAE,GAAC,WAAW,gBACpB,MAAM,gBACN,MAAM,EAAE,GAAC,WAAW,aACpB,MAAM,EAAE,GAAC,WAAW,QAuD9B;AAeD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,uEALW,MAAM,EAAE,GAAC,WAAW,QA8D9B"}
+{"version":3,"file":"bt_boundary_loop.d.ts","sourceRoot":"","sources":["../../../../../../../../../src/core/geom/3d/topology/struct/binary/io/bt_boundary_loop.js"],"names":[],"mappings":"AAMA;;;;;;;;;;;;;;;;;;GAkBG;AACH,yEARW,MAAM,EAAE,GAAC,WAAW,gBACpB,MAAM,gBACN,MAAM,EAAE,GAAC,WAAW,aACpB,MAAM,EAAE,GAAC,WAAW,QAuD9B;AAeD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,uEALW,MAAM,EAAE,GAAC,WAAW,QA8D9B;AAmHD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4DG;AACH,4EANW,MAAM,EAAE,GAAC,WAAW,GAClB,OAAO,CAmLnB"}