flo-mat 2.0.4 → 3.0.0

package/node/svg/get-loop-bounds.d.ts

@@ -1,12 +1,12 @@
-import { Loop } from '../loop.js';
-import { IPointOnShape } from '../point-on-shape.js';
+import { Loop } from 'flo-boolean';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
 /**
- * @hidden
+ * @internal
  */
 declare const getLoopBounds: (a: Loop) => {
-    minX: IPointOnShape;
-    minY: IPointOnShape;
-    maxX: IPointOnShape;
-    maxY: IPointOnShape;
+    minX: PointOnShape;
+    minY: PointOnShape;
+    maxX: PointOnShape;
+    maxY: PointOnShape;
 };
 export { getLoopBounds };

package/node/svg/get-loop-bounds.js

@@ -1,10 +1,10 @@
 import { getBounds } from 'flo-bezier3';
 import { memoize } from 'flo-memoize';
-import { PointOnShape } from '../point-on-shape.js';
-/** @hidden */
+import { createPos } from '../point-on-shape/create-pos.js';
+/** @internal */
 const INF = Number.POSITIVE_INFINITY;
 /**
- * @hidden
+ * @internal
  */
 const getLoopBounds = memoize(function (loop) {
     const extremes = [
@@ -71,10 +71,14 @@ const getLoopBounds = memoize(function (loop) {
         }
     });
     return {
-        minX: new PointOnShape(extremes[0][0].bezier, extremes[0][0].t),
-        minY: new PointOnShape(extremes[0][1].bezier, extremes[0][1].t),
-        maxX: new PointOnShape(extremes[1][0].bezier, extremes[1][0].t),
-        maxY: new PointOnShape(extremes[1][1].bezier, extremes[1][1].t)
+        // minX : new PointOnShape(extremes[0][0].bezier, extremes[0][0].t),
+        // minY : new PointOnShape(extremes[0][1].bezier, extremes[0][1].t),
+        // maxX : new PointOnShape(extremes[1][0].bezier, extremes[1][0].t),
+        // maxY : new PointOnShape(extremes[1][1].bezier, extremes[1][1].t)
+        minY: createPos(extremes[0][1].bezier, extremes[0][1].t, true),
+        minX: createPos(extremes[0][0].bezier, extremes[0][0].t, true),
+        maxX: createPos(extremes[1][0].bezier, extremes[1][0].t, true),
+        maxY: createPos(extremes[1][1].bezier, extremes[1][1].t, true)
     };
 });
 export { getLoopBounds };

package/node/svg/get-loop-bounds.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-loop-bounds.js","sourceRoot":"","sources":["../../src/svg/get-loop-bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC,OAAO,EAAE,YAAY,EAAiB,MAAM,sBAAsB,CAAC;AAGnE,cAAc;AACd,MAAM,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;AAGrC;;GAEG;AACH,MAAM,aAAa,GAAG,OAAO,CAAC,UAAS,IAAU;IAMhD,MAAM,QAAQ,GAIN;QACP;YACC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAC;YAC5C,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,EAAC;SAC5C;QACD;YACC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,GAAG,EAAC;YAC7C,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,GAAG,EAAC;SAC7C;KACD,CAAC;IAEF,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAS,KAAY;QACxC,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACpB,iCAAiC;QACjC,MAAM,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QAG7B;YACC;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;YAED;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;SACD;QAED;YACC;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;YAED;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;SACD;IACF,CAAC,CAAC,CAAC;IAEH,OAAO;QACN,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAI,EAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAChE,CAAC;AACH,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,aAAa,EAAE,CAAA"}
+{"version":3,"file":"get-loop-bounds.js","sourceRoot":"","sources":["../../src/svg/get-loop-bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAItC,OAAO,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAG5D,gBAAgB;AAChB,MAAM,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;AAGrC;;GAEG;AACH,MAAM,aAAa,GAAG,OAAO,CAAC,UAAS,IAAU;IAMhD,MAAM,QAAQ,GAIN;QACP;YACC,EAAE,MAAM,EAAE,SAAU,EAAE,CAAC,EAAE,SAAU,EAAE,GAAG,EAAE,GAAG,EAAC;YAC9C,EAAE,MAAM,EAAE,SAAU,EAAE,CAAC,EAAE,SAAU,EAAE,GAAG,EAAE,GAAG,EAAC;SAC9C;QACD;YACC,EAAE,MAAM,EAAE,SAAU,EAAE,CAAC,EAAE,SAAU,EAAE,GAAG,EAAE,CAAC,GAAG,EAAC;YAC/C,EAAE,MAAM,EAAE,SAAU,EAAE,CAAC,EAAE,SAAU,EAAE,GAAG,EAAE,CAAC,GAAG,EAAC;SAC/C;KACD,CAAC;IAEF,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAS,KAAY;QACxC,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACpB,iCAAiC;QACjC,MAAM,MAAM,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;QAG7B;YACC;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;YAED;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;SACD;QAED;YACC;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;YAED;gBACC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC7D,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;wBAChB,MAAM,EAAG,KAAK;wBACd,CAAC,EAAQ,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxB,GAAG,EAAM,CAAC;qBACV,CAAC;iBACF;aACD;SACD;IACF,CAAC,CAAC,CAAC;IAEH,OAAO;QACN,oEAAoE;QACpE,oEAAoE;QACpE,oEAAoE;QACpE,mEAAmE;QACnE,IAAI,EAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;QAC/D,IAAI,EAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;QAC/D,IAAI,EAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;QAC/D,IAAI,EAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;KAC/D,CAAC;AACH,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/svg/get-min-y-pos.d.ts

@@ -1,8 +1,8 @@
-/** @hidden */
-import { Loop } from '../loop.js';
+/** @internal */
+import { Loop } from 'flo-boolean';
 /**
- * @hidden
+ * @internal
  * Get topmost PointOnShape of the given loop.
  */
-declare function getMinYPos(loop: Loop): import("../point-on-shape.js").IPointOnShape;
+declare function getMinYPos(loop: Loop): import("../point-on-shape/point-on-shape.js").PointOnShape;
 export { getMinYPos };

package/node/svg/get-min-y-pos.js

@@ -1,6 +1,6 @@
 import { getLoopBounds } from './get-loop-bounds.js';
 /**
- * @hidden
+ * @internal
  * Get topmost PointOnShape of the given loop.
  */
 function getMinYPos(loop) {

package/node/svg/get-shape-bounds.d.ts

@@ -1,9 +1,10 @@
-import { Loop } from '../loop.js';
+import { Loop } from 'flo-boolean';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
 /** @internal */
 declare const getShapeBounds: (a: Loop[]) => {
-    minX: import("../point-on-shape.js").IPointOnShape;
-    minY: import("../point-on-shape.js").IPointOnShape;
-    maxX: import("../point-on-shape.js").IPointOnShape;
-    maxY: import("../point-on-shape.js").IPointOnShape;
+    minX: PointOnShape;
+    minY: PointOnShape;
+    maxX: PointOnShape;
+    maxY: PointOnShape;
 };
 export { getShapeBounds };

package/node/svg/get-shape-bounds.js

@@ -1,6 +1,5 @@
 import { memoize } from 'flo-memoize';
 import { getLoopBounds } from './get-loop-bounds.js';
-// TODO - move to another library
 /** @internal */
 const getShapeBounds = memoize(function (loops) {
     let minX_ = Number.POSITIVE_INFINITY;
@@ -30,7 +29,12 @@ const getShapeBounds = memoize(function (loops) {
             maxY_ = bounds.maxY.p[1];
         }
     }
-    return { minX, minY, maxX, maxY };
+    return {
+        minX: minX,
+        minY: minY,
+        maxX: maxX,
+        maxY: maxY
+    };
 });
 export { getShapeBounds };
 //# sourceMappingURL=get-shape-bounds.js.map

package/node/svg/get-shape-bounds.js.map

@@ -1 +1 @@
-{"version":3,"file":"get-shape-bounds.js","sourceRoot":"","sources":["../../src/svg/get-shape-bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAGrD,iCAAiC;AAGjC,gBAAgB;AAChB,MAAM,cAAc,GAAG,OAAO,CAAC,UAAS,KAAa;IACjD,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAErC,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IACT,IAAI,IAAI,CAAC;IAET,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACtB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;KACJ;IAED,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACtC,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,cAAc,EAAE,CAAA"}
+{"version":3,"file":"get-shape-bounds.js","sourceRoot":"","sources":["../../src/svg/get-shape-bounds.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAGtC,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAGrD,gBAAgB;AAChB,MAAM,cAAc,GAAG,OAAO,CAAC,UAAS,KAAa;IACjD,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IACrC,IAAI,KAAK,GAAG,MAAM,CAAC,iBAAiB,CAAC;IAErC,IAAI,IAAkB,CAAC;IACvB,IAAI,IAAkB,CAAC;IACvB,IAAI,IAAkB,CAAC;IACvB,IAAI,IAAkB,CAAC;IAEvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACtB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE;YAC1B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACnB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;KACJ;IAED,OAAO;QACH,IAAI,EAAE,IAAK;QACX,IAAI,EAAE,IAAK;QACX,IAAI,EAAE,IAAK;QACX,IAAI,EAAE,IAAK;KACd,CAAC;AACN,CAAC,CAAC,CAAC;AAGH,OAAO,EAAE,cAAc,EAAE,CAAA"}

package/node/sweep-line/sweep-line.d.ts

@@ -1,5 +1,5 @@
 /**
- * @hidden
+ * @internal
  * Generalized sweepline algorithm.
  *
  * Typically used to turn O(n^2) algorithms into roughly O(n logn) algorithms.

package/node/sweep-line/sweep-line.js

@@ -1,9 +1,9 @@
-/** @hidden */
+/** @internal */
 const EVENT_LEFT = 0;
-/** @hidden */
+/** @internal */
 const EVENT_RIGHT = 1;
 /**
- * @hidden
+ * @internal
  * Generalized sweepline algorithm.
  *
  * Typically used to turn O(n^2) algorithms into roughly O(n logn) algorithms.
@@ -54,7 +54,7 @@ function sweepLine(items, getLeftmost, getRightmost, predicate) {
     return pairedItems;
 }
 /**
- * @hidden
+ * @internal
  * Compare two Events by their x-axis and then by their type. Since it is
  * open boxes that are compared we must let the right endpoint type come
  * before the left.

package/node/sweep-line/sweep-line.js.map

@@ -1 +1 @@
-{"version":3,"file":"sweep-line.js","sourceRoot":"","sources":["../../src/sweep-line/sweep-line.ts"],"names":[],"mappings":"AACA,cAAc;AACd,MAAM,UAAU,GAAI,CAAC,CAAC;AACtB,cAAc;AACd,MAAM,WAAW,GAAG,CAAC,CAAC;AAOtB;;;;;;;;;;;;;;;GAeG;AACH,SAAS,SAAS,CACV,KAAU,EACV,WAAgC,EAChC,YAAiC,EACjC,SAA0C;IAE9C,mDAAmD;IACnD,MAAM,MAAM,GAAgB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACzB,MAAM,CAAC,IAAI,CAAC;YACF,IAAI,EAAE,UAAU;YAChB,IAAI;YACJ,CAAC,EAAE,WAAW,CAAC,IAAI,CAAC;SACvB,CAAC,CAAC;QACT,MAAM,CAAC,IAAI,CAAC;YACF,IAAI,EAAE,WAAW;YACjB,IAAI;YACJ,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC;SACxB,CAAC,CAAC;KACT;IAED,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAErB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAK,CAAC;IAE9B,yDAAyD;IAC5D,MAAM,WAAW,GAAY,EAAE,CAAC;IAChC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QACxB,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;QAEvB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE;YAC9B,KAAK,MAAM,UAAU,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE;gBAC9C,IAAI,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE;oBACpB,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;iBACjD;aACD;YAED,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;SACtB;aAAM,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE;YACtC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;SAC/B;KACJ;IAED,OAAO,WAAW,CAAC;AACpB,CAAC;AAeD;;;;;;;GAOG;AACH,SAAS,OAAO,CAAI,CAAY,EAAE,CAAY;IAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEtB,IAAI,GAAG,KAAK,CAAC,EAAE;QAAE,OAAO,GAAG,CAAC;KAAE;IAE9B,2CAA2C;IAC3C,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}
+{"version":3,"file":"sweep-line.js","sourceRoot":"","sources":["../../src/sweep-line/sweep-line.ts"],"names":[],"mappings":"AACA,gBAAgB;AAChB,MAAM,UAAU,GAAI,CAAC,CAAC;AACtB,gBAAgB;AAChB,MAAM,WAAW,GAAG,CAAC,CAAC;AAOtB;;;;;;;;;;;;;;;GAeG;AACH,SAAS,SAAS,CACV,KAAU,EACV,WAAgC,EAChC,YAAiC,EACjC,SAA0C;IAE9C,mDAAmD;IACnD,MAAM,MAAM,GAAgB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACzB,MAAM,CAAC,IAAI,CAAC;YACF,IAAI,EAAE,UAAU;YAChB,IAAI;YACJ,CAAC,EAAE,WAAW,CAAC,IAAI,CAAC;SACvB,CAAC,CAAC;QACT,MAAM,CAAC,IAAI,CAAC;YACF,IAAI,EAAE,WAAW;YACjB,IAAI;YACJ,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC;SACxB,CAAC,CAAC;KACT;IAED,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAErB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAK,CAAC;IAE9B,yDAAyD;IAC5D,MAAM,WAAW,GAAY,EAAE,CAAC;IAChC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QACxB,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;QAEvB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE;YAC9B,KAAK,MAAM,UAAU,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE;gBAC9C,IAAI,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE;oBACpB,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;iBACjD;aACD;YAED,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;SACtB;aAAM,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE;YACtC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;SAC/B;KACJ;IAED,OAAO,WAAW,CAAC;AACpB,CAAC;AAeD;;;;;;;GAOG;AACH,SAAS,OAAO,CAAI,CAAY,EAAE,CAAY;IAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEtB,IAAI,GAAG,KAAK,CAAC,EAAE;QAAE,OAAO,GAAG,CAAC;KAAE;IAE9B,2CAA2C;IAC3C,OAAO,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AAGD,OAAO,EAAE,SAAS,EAAE,CAAA"}

package/package.json

@@ -2,7 +2,7 @@
     "name": "flo-mat",
     "sideEffects": false,
     "description": "Medial / Scale Axis Transform (MAT/SAT) Library.",
-    "version": "2.0.4",
+    "version": "3.0.0",
     "author": {
         "name": "Floris Steenkamp"
     },
@@ -33,25 +33,25 @@
     "dependencies": {
         "big-float-ts": "^3.0.3",
         "double-double": "^2.0.7",
-        "flo-bezier3": "^4.1.4",
-        "flo-boolean": "^2.1.7",
+        "flo-bezier3": "^5.0.0",
+        "flo-boolean": "^2.1.8",
         "flo-draw": "^2.0.2",
         "flo-gauss-quadrature": "^2.1.2",
         "flo-ll-rb-tree": "^0.3.3",
         "flo-memoize": "^1.1.1",
-        "flo-poly": "^6.0.5",
+        "flo-poly": "^6.0.8",
         "flo-vector2d": "^4.0.2"
     },
     "devDependencies": {
         "@types/chai": "^4.3.5",
         "@types/mocha": "^10.0.1",
-        "@types/node": "^20.4.2",
-        "@typescript-eslint/eslint-plugin": "^6.0.0",
-        "@typescript-eslint/parser": "^6.0.0",
-        "c8": "^8.0.0",
+        "@types/node": "^20.4.8",
+        "@typescript-eslint/eslint-plugin": "^6.2.1",
+        "@typescript-eslint/parser": "^6.2.1",
+        "c8": "^8.0.1",
         "chai": "^4.3.7",
         "circular-dependency-plugin": "^5.2.2",
-        "eslint": "^8.44.0",
+        "eslint": "^8.46.0",
         "eslint-plugin-tree-shaking": "^1.10.0",
         "mocha": "^10.2.0",
         "resolve-typescript-plugin": "^2.0.1",
@@ -60,7 +60,7 @@
         "ts-loader": "^9.4.4",
         "ts-node": "^10.9.1",
         "typescript": "^5.1.6",
-        "webpack": "^5.88.1",
+        "webpack": "^5.88.2",
         "webpack-cli": "^5.1.4"
     },
     "scripts": {

package/src/closest-boundary-point/closest-points-on-curve-precise.ts

@@ -0,0 +1,75 @@
+import { ddDeflate, allRootsCertified, RootInterval } from 'flo-poly';
+import { evalDeCasteljauDd, getFootpointPolyDd } from 'flo-bezier3';
+import { Curve } from "../curve/curve.js";
+
+
+/**
+ * @internal
+ * @param curve The curve
+ * @param p The point from which to check
+ * @param tRange The allowed t range
+ * @param touchedCurve The bezier on which p is located
+ * @param t The t value of the bezier that locates p
+ */
+function closestPointsOnCurvePrecise(
+        curve: Curve, 
+        p: number[], 
+        [tS,tE]: number[] = [0,1], 
+        touchedCurve: Curve,
+        t: number): {
+            p: number[];
+            t: number;
+        }[] {
+
+    const _poly = getFootpointPolyDd(curve.ps, p);
+
+    const poly = curve === touchedCurve
+        ? ddDeflate(_poly, t)
+        : _poly;
+
+    const roots: Omit<RootInterval,'multiplicity'>[] = 
+        allRootsCertified(poly, tS, tE);
+
+    // Also test the endpoints
+    const dontPush0 = (
+        (t === 1 && curve === touchedCurve.next) ||
+        (t === 0 && curve === touchedCurve)
+    );
+
+    const dontPush1 = (
+        (t === 0 && curve === touchedCurve.prev) ||
+        (t === 1 && curve === touchedCurve)
+    );
+
+    if (tS === 0) {
+        if (!dontPush0) { roots.push({ tS: 0, tE: 0 }); }
+    } else if (tS === 1) {
+        if (!dontPush1) { roots.push({ tS: 1, tE: 1 }); }
+    } else {
+        roots.push({ tS: tS, tE: tS });
+    }
+
+    if (tE === 0) {
+        if (!dontPush0) { roots.push({ tS: 0, tE: 0 }); }
+    } else if (tE === 1) {
+        if (!dontPush1) { roots.push({ tS: 1, tE: 1 }); }
+    } else {
+        roots.push({ tS: tE, tE: tE });
+    }
+
+    const ps = roots.map(
+        root => { 
+            const tS = root.tS;
+            const tE = root.tE;
+            const t = tS < 0 
+                ? 0
+                : tE > 1 ? 1 : (tS + tE)/2;
+            return { p: evalDeCasteljauDd(curve.ps,[0,t]).map(v => v[1]), t }
+        }
+    );
+
+    return ps;
+}
+
+
+export { closestPointsOnCurvePrecise }

package/src/closest-boundary-point/closest-points-on-curve.ts

@@ -0,0 +1,72 @@
+import { allRoots, deflate } from 'flo-poly';
+import { evalDeCasteljau, getFootpointPoly } from 'flo-bezier3';
+import { Curve } from "../curve/curve.js";
+import { eAdd, growExpansion } from 'big-float-ts';
+
+
+/**
+ * @internal
+ * @param curve The curve
+ * @param p The point from which to check
+ * @param tRange The allowed t range
+ * @param touchedCurve The bezier on which p is located
+ * @param t The t value of the bezier that locates p
+ */
+function closestPointsOnCurve(
+        curve: Curve, 
+        p: number[], 
+        [tS,tE]: number[] = [0,1], 
+        touchedCurve: Curve,
+        t: number): {
+            p: number[];
+            t: number;
+        }[] {
+
+    const _poly = getFootpointPoly(curve.ps, p);
+
+    const poly = curve === touchedCurve
+        ? deflate(_poly, t)
+        : _poly;
+
+    const roots = allRoots(poly, tS, tE);
+
+    // Also test the endpoints
+    let push0 = true;
+    let push1 = true;
+    if ((t === 1 && curve === touchedCurve.next) ||
+        (t === 0 && curve === touchedCurve)) {
+        push0 = false;
+    }
+    if ((t === 0 && curve === touchedCurve.prev) ||
+        (t === 1 && curve === touchedCurve)) {
+        push1 = false;
+    }
+
+    if (tS === 0) {
+        if (push0) { roots.push(0); }
+    } else if (tS === 1) {
+        if (push1) { roots.push(1); }
+    } else {
+        roots.push(tS);
+    }
+
+    if (tE === 0) {
+        if (push0) { roots.push(0); }
+    } else if (tE === 1) {
+        if (push1) { roots.push(1); }
+    } else {
+        roots.push(tE);
+    }
+
+    const ps = roots.map(
+        r => { 
+            const t = r < 0 ? 0 : r > 1 ? 1 : r;
+            return { p: evalDeCasteljau(curve.ps,t), t }
+        }
+    );
+
+    return ps;
+}
+
+
+export { closestPointsOnCurve }

package/src/closest-boundary-point/cull-bezier-pieces.ts

@@ -0,0 +1,35 @@
+import { BezierPiece } from '../mat/bezier-piece.js';
+import { getBestDistanceSquared } from './get-best-distance-squared.js';
+import { cullByLooseBoundingBox } from './cull-by-loose-bounding-box.js';
+import { cullByTightBoundingBox } from './cull-by-tight-boundary-box.js';
+
+
+/**
+ * @internal
+ * @param bezierPieces 
+ * @param p 
+ * @param extreme
+ */
+function cullBezierPieces1(
+        bezierPieces: BezierPiece[],
+        p: number[]) {
+
+    const bestSquaredDistance = getBestDistanceSquared(
+        bezierPieces, p
+    );
+    bezierPieces = cullByLooseBoundingBox(
+        bezierPieces, p,
+        bestSquaredDistance
+    );
+    
+    bezierPieces = cullByTightBoundingBox(
+        bezierPieces, p,
+        bestSquaredDistance
+    );
+
+
+    return bezierPieces;
+}
+
+
+export { cullBezierPieces1 }

package/src/{mat/closest-boundary-point → closest-boundary-point}/cull-by-loose-bounding-box.ts

@@ -1,10 +1,11 @@
-import { getBoundingBox_ } from '../../get-bounding-box-.js';
-import { BezierPiece } from '../bezier-piece.js';
+import { allRoots, deflate } from 'flo-poly';
+import { BezierPiece } from '../mat/bezier-piece.js';
 import { getClosestSquareDistanceToRect } from '../geometry/get-closest-square-distance-to-rect.js';
+import { getBoundingBox_ } from '../geometry/get-bounding-box-.js';
 
 
 /**
- * @hidden
+ * @internal
  * When checking distances, ignore all those with closest possible distance 
  * further than 'bestSquaredDistance', i.e. cull them.
  * @param bezierPieces 

package/src/{mat/closest-boundary-point → closest-boundary-point}/cull-by-tight-boundary-box.ts

@@ -1,6 +1,6 @@
 import { getBoundingBoxTight } from "flo-bezier3";
 import { memoize } from "flo-memoize";
-import { BezierPiece } from "../bezier-piece.js";
+import { BezierPiece } from "../mat/bezier-piece.js";
 import { getClosestSquaredDistanceToRotatedRect } from '../geometry/get-closest-squared-distance-to-rotated-rect.js';
 
 
@@ -8,7 +8,7 @@ const getBoundingBoxTight_ = memoize(getBoundingBoxTight);
 
 
 /**
- * @hidden
+ * @internal
  * When checking distances, ignore all those with closest possible distance 
  * further than 'bestSquaredDistance', i.e. cull them.
  * @param bezierPieces 

package/src/closest-boundary-point/dd-deflate-with-running-error.ts

@@ -0,0 +1,88 @@
+// TODO - import from `flo-poly` in the future
+import { ddMultDouble2 } from "double-double";
+import { ddAddDd } from "double-double";
+import { γγ } from '../error-analysis/gamma.js';
+
+
+// We *have* to do the below❗ The assignee is a getter❗ The assigned is a pure function❗ Otherwise code is too slow❗
+const qmd = ddMultDouble2;
+const qaq = ddAddDd;
+
+const { abs } = Math;
+
+const γγ3 = γγ(3);
+
+
+/**
+ * Deflates the given polynomial *approximately* by removing a factor (x - t).
+ * 
+ * @param p a polynomial with coefficients given densely as an array of 
+ * double-double precision floating point numbers from highest to lowest power, 
+ * e.g. `[[0,5],[0,-3],[0,0]]` represents the polynomial `5x^2 - 3x`
+ * @param pE the coefficient-wise absolute error of the input polynomial that
+ * still need to be multiplied by γγ3, i.e. it is `γγ3` times too big.
+ * @param t an evaluation point of the polynomial.
+ * 
+ * @example
+ * ```typescript
+ * // The polynomial x^3 - 5x^2 + 8x - 4 has a root at 1 and a double root at 2 
+ * ddDeflate([[0,1], [0,-5], [0,8], [0,-4]], [0,2]); //=> [[0,1], [0,-3], [0,2]] 
+ * ddDeflate([[0,1], [0,-3], [0,2], [0,2]);          //=> [[0,1], [0,-1]] 
+ * ddDeflate([[0,1], [0,-1]], [0,1]);                //=> [[0,1]]
+ * ```
+ * 
+ * @doc
+ */
+function ddDeflateWithRunningError(
+		p: number[][],
+		pE: number[],
+		t: number): {
+			coeffs: number[][];
+			errBound: number[];
+		} {
+
+	//--------------------------------------------------------------------------
+    // `var` -> a variable
+    // `$var` -> the double precision approximation to `var`
+    // `_var` -> the absolute value of $var (a prefix underscore on a variable means absolute value)
+    // `var_` -> the error in var (a postfix underscore means error bound but should still be multiplied by 3*γ²)
+    // `_var_` -> means both absolute value and absolute error bound
+    // recall: `a*b`, where both `a` and `b` have errors |a| and |b| we get for the
+    //   * error bound of (a*b) === a_|b| + |a|b_ + |a*b|   (when either of a and b is double)
+    //   * error bound of (a*b) === a_|b| + |a|b_ + 2|a*b|  (when both a and b is double-double)
+    //   * error bound of (a+b) === a_ + b_ + |a+b|         (when a and/or b is double or double-double)
+    // * the returned errors need to be multiplied by 3γ² to get the true error
+    // * can use either `$var` or `var[var.length-1]` (the approx value) in error calculations
+    //   due to multiplication by 3*γ² and not 3*u²
+    //--------------------------------------------------------------------------
+    const d = p.length - 1;
+	const bs = [p[0]];    // coefficients
+    let b_ = pE[0];       // running error
+	const bEs = [b_];     // coefficient-wise error bound
+
+	for (let i=1; i<d; i++) {
+        // p[i] + t*bs[i-1];
+
+		const a = bs[i-1];
+		const $m = t*a[1];
+		const _t = abs(t);
+		const m_ = _t*b_ + abs($m);
+
+		const pi = p[i];
+		const p_ = pE[i];
+		b_ = p_ + m_ + abs(pi[1] + $m);
+
+		const b = qaq(pi,qmd(t,a));
+
+		bs.push(b);
+		bEs.push(b_);
+	}
+
+	return {
+        coeffs: bs,
+        errBound: bEs.map(e => γγ3*e)
+    };
+}
+
+
+export { ddDeflateWithRunningError }

package/src/closest-boundary-point/foot-and-endpoint-info.ts

@@ -0,0 +1,16 @@
+import { RootInterval } from "flo-poly";
+import { Curve } from "../curve/curve";
+
+
+type FootAndEndpointInfo = {
+    curve: Curve;
+    p: number[];
+    t: number;
+    d: number;
+    box: number[][];
+    // ri: RootInterval;
+    dSquaredI: number[];
+}
+
+
+export { FootAndEndpointInfo }

package/src/{mat/closest-boundary-point → closest-boundary-point}/get-best-distance-squared.ts

@@ -1,10 +1,10 @@
 import { evalDeCasteljau } from 'flo-bezier3';
 import { squaredDistanceBetween } from 'flo-vector2d';
-import { BezierPiece } from "../bezier-piece.js";
+import { BezierPiece } from "../mat/bezier-piece.js";
 
 
 /**
- * @hidden
+ * @internal
  * Finds an initial distance such that the closest point can not be further than 
  * this distance away.
  */ 
@@ -32,8 +32,7 @@ function getBestDistanceSquared(
     }
 
     // The extra multiplier is to account for floating point precision.
-    // TODO - remove delta (or base it on theory)
-    return bestSquaredDistance * 1.01;
+    return (1 + 2**-10)*bestSquaredDistance;
 }
 
 

package/src/closest-boundary-point/get-close-boundary-points-certified.ts

@@ -0,0 +1,69 @@
+import { BezierPiece  } from '../mat/bezier-piece.js';
+import { getPotentialClosestPointsOnCurveCertified } from './get-potential-closest-points-on-curve-certified.js';
+import { cullBezierPieces1 } from './cull-bezier-pieces.js';
+import { Curve } from '../curve/curve.js';
+import { FootAndEndpointInfo } from './foot-and-endpoint-info.js';
+import { PointOnShape } from '../point-on-shape/point-on-shape.js';
+import { createPos } from '../point-on-shape/create-pos.js';
+
+
+/**
+ * @internal
+ * Returns the closest boundary point to the given point, limited to the given 
+ * bezier pieces, including the beziers actually checked after culling.
+ * @param bezierPieces
+ * @param x
+ * @param touchedCurve
+ * @param t
+ * @param extreme
+ */
+function getCloseBoundaryPointsCertified(
+        bezierPieces: BezierPiece[], 
+        x: number[], 
+		touchedCurve: Curve | undefined = undefined,
+		t: number | undefined = undefined,
+		for1Prong = false,
+		angle = 0): PointOnShape[] {
+	
+	bezierPieces = cullBezierPieces1(bezierPieces, x);
+ 
+	const pInfoss: FootAndEndpointInfo[] = [];
+	for (let i=0; i<bezierPieces.length; i++) {
+		const bezierPiece = bezierPieces[i];
+
+		const pInfos = getPotentialClosestPointsOnCurveCertified(
+			bezierPiece.curve, 
+			x, 
+			bezierPiece.ts, 
+			touchedCurve, 
+			t,
+			for1Prong,
+			angle
+		);
+
+		pInfoss.push(...pInfos);
+	}
+
+	/** the minimum max interval value */
+	let minMax = Number.POSITIVE_INFINITY;
+	for (let i=0; i<pInfoss.length; i++) {
+		const diMax = pInfoss[i].dSquaredI[1];
+		if (diMax < minMax) {
+			minMax = diMax;
+		}
+	}
+
+	const closestPointInfos: FootAndEndpointInfo[] = [];
+
+	for (let i=0; i<pInfoss.length; i++) {
+		const info = pInfoss[i];
+		if (info.dSquaredI[0] <= minMax) {
+			closestPointInfos.push(info);
+		}
+	}
+
+	return closestPointInfos.map(info => createPos(info.curve, info.t, false));
+}
+
+
+export { getCloseBoundaryPointsCertified };