flo-mat 2.0.1 → 2.0.3

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

@@ -1,73 +1,73 @@
-/** @hidden */
-const EVENT_LEFT = 0;
-/** @hidden */
-const EVENT_RIGHT = 1;
-/**
- * @hidden
- * Generalized sweepline algorithm.
- *
- * Typically used to turn O(n^2) algorithms into roughly O(n logn) algorithms.
- *
- * @param items An array of items that are to be compared. Items should
- * typically be geometric objects in 2d space with well-defined left and right
- * endpoints.
- * @param getLeftmostPoint A function that returns the leftmost point of the
- * geometric object of interest.
- * @param getRightmostPoint A function that returns the rightmost point of the
- * geometric object of interest.
- * @param predicate A predicate that takes two geometric objects and returns
- * true if they are of interest or false otherwise.
- */
-function sweepLine(items, getLeftmost, getRightmost, predicate) {
-    // Initialize event queue to contain all endpoints.
-    let events = [];
-    for (let item of items) {
-        events.push({
-            type: EVENT_LEFT,
-            item,
-            x: getLeftmost(item)
-        });
-        events.push({
-            type: EVENT_RIGHT,
-            item,
-            x: getRightmost(item)
-        });
-    }
-    events.sort(compare);
-    let activeItems = new Set();
-    /** A list of pairs of items that passed the predicate */
-    let pairedItems = [];
-    for (let event of events) {
-        let { item } = event;
-        if (event.type === EVENT_LEFT) {
-            for (let activeItem of activeItems.values()) {
-                if (predicate(item, activeItem)) {
-                    pairedItems.push([item, activeItem]);
-                }
-            }
-            activeItems.add(item);
-        }
-        else if (event.type === EVENT_RIGHT) {
-            activeItems.delete(event.item);
-        }
-    }
-    return pairedItems;
-}
-/**
- * @hidden
- * 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.
- * @param a An event
- * @param b Another event
- */
-function compare(a, b) {
-    let res = a.x - b.x;
-    if (res !== 0) {
-        return res;
-    }
-    // Alwys put left events before right ones.
-    return a.type === EVENT_LEFT ? -1 : +1;
-}
-export { sweepLine };
+/** @hidden */
+const EVENT_LEFT = 0;
+/** @hidden */
+const EVENT_RIGHT = 1;
+/**
+ * @hidden
+ * Generalized sweepline algorithm.
+ *
+ * Typically used to turn O(n^2) algorithms into roughly O(n logn) algorithms.
+ *
+ * @param items An array of items that are to be compared. Items should
+ * typically be geometric objects in 2d space with well-defined left and right
+ * endpoints.
+ * @param getLeftmostPoint A function that returns the leftmost point of the
+ * geometric object of interest.
+ * @param getRightmostPoint A function that returns the rightmost point of the
+ * geometric object of interest.
+ * @param predicate A predicate that takes two geometric objects and returns
+ * true if they are of interest or false otherwise.
+ */
+function sweepLine(items, getLeftmost, getRightmost, predicate) {
+    // Initialize event queue to contain all endpoints.
+    const events = [];
+    for (const item of items) {
+        events.push({
+            type: EVENT_LEFT,
+            item,
+            x: getLeftmost(item)
+        });
+        events.push({
+            type: EVENT_RIGHT,
+            item,
+            x: getRightmost(item)
+        });
+    }
+    events.sort(compare);
+    const activeItems = new Set();
+    /** A list of pairs of items that passed the predicate */
+    const pairedItems = [];
+    for (const event of events) {
+        const { item } = event;
+        if (event.type === EVENT_LEFT) {
+            for (const activeItem of activeItems.values()) {
+                if (predicate(item, activeItem)) {
+                    pairedItems.push([item, activeItem]);
+                }
+            }
+            activeItems.add(item);
+        }
+        else if (event.type === EVENT_RIGHT) {
+            activeItems.delete(event.item);
+        }
+    }
+    return pairedItems;
+}
+/**
+ * @hidden
+ * 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.
+ * @param a An event
+ * @param b Another event
+ */
+function compare(a, b) {
+    const res = a.x - b.x;
+    if (res !== 0) {
+        return res;
+    }
+    // Alwys put left events before right ones.
+    return a.type === EVENT_LEFT ? -1 : +1;
+}
+export { sweepLine };
 //# sourceMappingURL=sweep-line.js.map

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,IAAI,MAAM,GAAgB,EAAE,CAAC;IAChC,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE;QACvB,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,IAAI,WAAW,GAAG,IAAI,GAAG,EAAK,CAAC;IAE5B,yDAAyD;IAC5D,IAAI,WAAW,GAAY,EAAE,CAAC;IAC9B,KAAK,IAAI,KAAK,IAAI,MAAM,EAAE;QACtB,IAAI,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;QAErB,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE;YAC9B,KAAK,IAAI,UAAU,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE;gBAC5C,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,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEpB,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,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"}

package/node/to-scale-axis.d.ts

@@ -1,16 +1,16 @@
-import { Mat } from './mat.js';
-/** @hidden */
-/**
- * Apply and returns an enhanced version of the Scale Axis Transform (SAT) to
- * the given MAT. The returned SAT is guaranteed to be a subset of the MAT and
- * preserves topology at any scale.
- *
- * Typically the MAT contains too many branches caused by minute details on the
- * boundary of the shape. The SAT is a simplification of the MAT that preserves
- * less detail the higher the applied scale factor. The severity at which noise
- * are removed depends on the local scale of the shape.
- * @param mat The Medial Axis Transform ([[Mat]]) on which to apply the SAT.
- * @param s The scale factor >= 1 (e.g. 1.3)
- */
-declare function toScaleAxis(mat: Mat, s: number, f?: (s: number) => (r: number) => number): Mat;
-export { toScaleAxis };
+import { Mat } from './mat.js';
+/** @hidden */
+/**
+ * Apply and returns an enhanced version of the Scale Axis Transform (SAT) to
+ * the given MAT. The returned SAT is guaranteed to be a subset of the MAT and
+ * preserves topology at any scale.
+ *
+ * Typically the MAT contains too many branches caused by minute details on the
+ * boundary of the shape. The SAT is a simplification of the MAT that preserves
+ * less detail the higher the applied scale factor. The severity at which noise
+ * are removed depends on the local scale of the shape.
+ * @param mat The Medial Axis Transform ([[Mat]]) on which to apply the SAT.
+ * @param s The scale factor >= 1 (e.g. 1.3)
+ */
+declare function toScaleAxis(mat: Mat, s: number, f?: (s: number) => (r: number) => number): Mat;
+export { toScaleAxis };

package/node/to-scale-axis.js

@@ -1,74 +1,75 @@
-import { length } from 'flo-bezier3';
-import { traverseEdges } from './traverse-edges.js';
-import { traverseVertices } from './traverse-vertices.js';
-import { getLargestVertex } from './mat/get-largest-vertex.js';
-import { getLeaves } from './mat/get-leaves.js';
-import { cull } from './mat/to-scale-axis/cull.js';
-import { addDebugInfo } from './mat/to-scale-axis/add-debug-info.js';
-import { clone } from './cp-node/clone.js';
-import { getCurveToNext } from './get-curve-to-next.js';
-function linearScale(s) {
-    return function (r) {
-        return s * r;
-    };
-}
-/** @hidden */
-//let len = length([0,1]);
-/**
- * Apply and returns an enhanced version of the Scale Axis Transform (SAT) to
- * the given MAT. The returned SAT is guaranteed to be a subset of the MAT and
- * preserves topology at any scale.
- *
- * Typically the MAT contains too many branches caused by minute details on the
- * boundary of the shape. The SAT is a simplification of the MAT that preserves
- * less detail the higher the applied scale factor. The severity at which noise
- * are removed depends on the local scale of the shape.
- * @param mat The Medial Axis Transform ([[Mat]]) on which to apply the SAT.
- * @param s The scale factor >= 1 (e.g. 1.3)
- */
-function toScaleAxis(mat, s, f = linearScale) {
-    if (typeof _debug_ !== 'undefined') {
-        var timingStart = performance.now();
-        let leaves = getLeaves(mat.cpNode);
-        _debug_.generated.elems.leaves.push(leaves);
-    }
-    /** The largest vertex (as measured by its inscribed disk) */
-    let cpNodes = [];
-    traverseVertices(clone(mat.cpNode), cpNode => { cpNodes.push(cpNode); });
-    let cpNode = getLargestVertex(cpNodes);
-    let f_ = f(s);
-    if (typeof _debug_ !== 'undefined') {
-        _debug_.generated.elems.maxVertex.push(cpNode);
-    }
-    /**
-     * All vertices that are set to be culled initially. This may change later
-     * in order to preserve topology.
-     */
-    let culls = new Set();
-    let rMap = new Map();
-    traverseEdges(cpNode, function (cpNode) {
-        /** The occulating radius stored with this vertex. */
-        let R = rMap.get(cpNode) || f_(cpNode.cp.circle.radius);
-        let cpNode_ = cpNode.next;
-        let l = length([0, 1], getCurveToNext(cpNode));
-        let r = cpNode_.cp.circle.radius;
-        let r_ = f_(r);
-        if (R - l > r_) {
-            for (let cpNode of cpNode_.getCpNodesOnCircle()) {
-                rMap.set(cpNode, R - l); // Update osculating radii
-            }
-            culls.add(cpNode_.cp.circle);
-        }
-    });
-    cull(culls, cpNode);
-    if (typeof _debug_ !== 'undefined') {
-        _debug_.generated.elems.culls.push(Array.from(culls));
-    }
-    // TODO - put line below back - goes into infinite loop
-    //let sat: Mat = { cpNode, cpTrees: createNewCpTree(cpNode) };
-    let sat = { cpNode, cpTrees: undefined };
-    addDebugInfo(sat, timingStart);
-    return sat;
-}
-export { toScaleAxis };
+import { length } from 'flo-bezier3';
+import { traverseEdges } from './traverse-edges.js';
+import { traverseVertices } from './traverse-vertices.js';
+import { getLargestVertex } from './mat/get-largest-vertex.js';
+import { getLeaves } from './mat/get-leaves.js';
+import { cull } from './mat/to-scale-axis/cull.js';
+import { addDebugInfo } from './mat/to-scale-axis/add-debug-info.js';
+import { clone } from './cp-node/clone.js';
+import { getCurveToNext } from './get-curve-to-next.js';
+function linearScale(s) {
+    return function (r) {
+        return s * r;
+    };
+}
+/** @hidden */
+//let len = length([0,1]);
+/**
+ * Apply and returns an enhanced version of the Scale Axis Transform (SAT) to
+ * the given MAT. The returned SAT is guaranteed to be a subset of the MAT and
+ * preserves topology at any scale.
+ *
+ * Typically the MAT contains too many branches caused by minute details on the
+ * boundary of the shape. The SAT is a simplification of the MAT that preserves
+ * less detail the higher the applied scale factor. The severity at which noise
+ * are removed depends on the local scale of the shape.
+ * @param mat The Medial Axis Transform ([[Mat]]) on which to apply the SAT.
+ * @param s The scale factor >= 1 (e.g. 1.3)
+ */
+function toScaleAxis(mat, s, f = linearScale) {
+    let timingStart = 0;
+    if (typeof _debug_ !== 'undefined') {
+        timingStart = performance.now();
+        const leaves = getLeaves(mat.cpNode);
+        _debug_.generated.elems.leaves.push(leaves);
+    }
+    /** The largest vertex (as measured by its inscribed disk) */
+    const cpNodes = [];
+    traverseVertices(clone(mat.cpNode), cpNode => { cpNodes.push(cpNode); });
+    const cpNode = getLargestVertex(cpNodes);
+    const f_ = f(s);
+    if (typeof _debug_ !== 'undefined') {
+        _debug_.generated.elems.maxVertex.push(cpNode);
+    }
+    /**
+     * All vertices that are set to be culled initially. This may change later
+     * in order to preserve topology.
+     */
+    const culls = new Set();
+    const rMap = new Map();
+    traverseEdges(cpNode, function (cpNode) {
+        /** The occulating radius stored with this vertex. */
+        const R = rMap.get(cpNode) || f_(cpNode.cp.circle.radius);
+        const cpNode_ = cpNode.next;
+        const l = length([0, 1], getCurveToNext(cpNode));
+        const r = cpNode_.cp.circle.radius;
+        const r_ = f_(r);
+        if (R - l > r_) {
+            for (const cpNode of cpNode_.getCpNodesOnCircle()) {
+                rMap.set(cpNode, R - l); // Update osculating radii
+            }
+            culls.add(cpNode_.cp.circle);
+        }
+    });
+    cull(culls, cpNode);
+    if (typeof _debug_ !== 'undefined') {
+        _debug_.generated.elems.culls.push(Array.from(culls));
+    }
+    // TODO - put line below back - goes into infinite loop
+    //const sat: Mat = { cpNode, cpTrees: createNewCpTree(cpNode) };
+    const sat = { cpNode, cpTrees: undefined };
+    addDebugInfo(sat, timingStart);
+    return sat;
+}
+export { toScaleAxis };
 //# sourceMappingURL=to-scale-axis.js.map

package/node/to-scale-axis.js.map

@@ -1 +1 @@
-{"version":3,"file":"to-scale-axis.js","sourceRoot":"","sources":["../src/to-scale-axis.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAKrC,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAE/D,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,6BAA6B,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,uCAAuC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAGxD,SAAS,WAAW,CAAC,CAAS;IAC7B,OAAO,UAAS,CAAS;QACxB,OAAO,CAAC,GAAC,CAAC,CAAC;IACZ,CAAC,CAAA;AACF,CAAC;AAGD,cAAc;AACd,0BAA0B;AAG1B;;;;;;;;;;;GAWG;AACH,SAAS,WAAW,CAClB,GAAQ,EACR,CAAS,EACT,IAA0C,WAAW;IAEtD,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,IAAI,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACpC,IAAI,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KAC5C;IAED,6DAA6D;IAC7D,IAAI,OAAO,GAAa,EAAE,CAAC;IAC3B,gBAAgB,CACf,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EACjB,MAAM,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACnC,CAAC;IAEF,IAAI,MAAM,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IACvC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEd,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KAC/C;IAED;;;OAGG;IACH,IAAI,KAAK,GAAgB,IAAI,GAAG,EAAE,CAAC;IAEnC,IAAI,IAAI,GAAuB,IAAI,GAAG,EAAE,CAAC;IAEzC,aAAa,CAAC,MAAM,EAAE,UAAS,MAAM;QACpC,qDAAqD;QACrD,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAExD,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;QAE1B,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;QAE9C,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC;QACjC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE;YACf,KAAK,IAAI,MAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,EAAE;gBAChD,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,0BAA0B;aACnD;YACD,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;SAC7B;IACF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEpB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;KACtD;IAED,uDAAuD;IACvD,8DAA8D;IAC9D,IAAI,GAAG,GAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IAE9C,YAAY,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAE/B,OAAO,GAAG,CAAC;AACZ,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}
+{"version":3,"file":"to-scale-axis.js","sourceRoot":"","sources":["../src/to-scale-axis.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAKrC,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAE/D,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,6BAA6B,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,uCAAuC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAGxD,SAAS,WAAW,CAAC,CAAS;IAC7B,OAAO,UAAS,CAAS;QACxB,OAAO,CAAC,GAAC,CAAC,CAAC;IACZ,CAAC,CAAA;AACF,CAAC;AAGD,cAAc;AACd,0BAA0B;AAG1B;;;;;;;;;;;GAWG;AACH,SAAS,WAAW,CAClB,GAAQ,EACR,CAAS,EACT,IAA0C,WAAW;IAEtD,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KAC5C;IAED,6DAA6D;IAC7D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,gBAAgB,CACf,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EACjB,MAAM,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACnC,CAAC;IAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KAC/C;IAED;;;OAGG;IACH,MAAM,KAAK,GAAgB,IAAI,GAAG,EAAE,CAAC;IAErC,MAAM,IAAI,GAAuB,IAAI,GAAG,EAAE,CAAC;IAE3C,aAAa,CAAC,MAAM,EAAE,UAAS,MAAM;QACpC,qDAAqD;QACrD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAE1D,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;QAE5B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;QAEhD,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC;QACnC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE;YACf,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,EAAE;gBAClD,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,0BAA0B;aACnD;YACD,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;SAC7B;IACF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEpB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;KACtD;IAED,uDAAuD;IACvD,gEAAgE;IAChE,MAAM,GAAG,GAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IAEhD,YAAY,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAE/B,OAAO,GAAG,CAAC;AACZ,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

package/node/traverse-edges.d.ts

@@ -1,10 +1,10 @@
-import { CpNode } from './cp-node.js';
-/**
- * Traverses all edges (depth first) of the given MAT tree starting at the given
- * vertex (represented by a [[CpNode]]).
- * @param cpNode Any [[CpNode]] representing the start vertex.
- * @param f A callback function for each CpNode representing the vertex at the
- * start of an edge.
-  */
-declare function traverseEdges(cpNode: CpNode, f: (cpNode: CpNode) => void): void;
-export { traverseEdges };
+import { CpNode } from './cp-node.js';
+/**
+ * Traverses all edges (depth first) of the given MAT tree starting at the given
+ * vertex (represented by a [[CpNode]]).
+ * @param cpNode Any [[CpNode]] representing the start vertex.
+ * @param f A callback function for each CpNode representing the vertex at the
+ * start of an edge.
+  */
+declare function traverseEdges(cpNode: CpNode, f: (cpNode: CpNode) => void): void;
+export { traverseEdges };

package/node/traverse-edges.js

@@ -1,22 +1,22 @@
-/**
- * Traverses all edges (depth first) of the given MAT tree starting at the given
- * vertex (represented by a [[CpNode]]).
- * @param cpNode Any [[CpNode]] representing the start vertex.
- * @param f A callback function for each CpNode representing the vertex at the
- * start of an edge.
-  */
-function traverseEdges(cpNode, f) {
-    // Since the tree is unrooted we must iterate in all directions from the
-    // given vertex.
-    let cps = cpNode.getCpNodesOnCircle();
-    while (cps.length) {
-        let cp = cps.pop();
-        f(cp);
-        if (cp.isTerminating()) {
-            continue;
-        }
-        cps.push(...cp.getChildren());
-    }
-}
-export { traverseEdges };
+/**
+ * Traverses all edges (depth first) of the given MAT tree starting at the given
+ * vertex (represented by a [[CpNode]]).
+ * @param cpNode Any [[CpNode]] representing the start vertex.
+ * @param f A callback function for each CpNode representing the vertex at the
+ * start of an edge.
+  */
+function traverseEdges(cpNode, f) {
+    // Since the tree is unrooted we must iterate in all directions from the
+    // given vertex.
+    const cps = cpNode.getCpNodesOnCircle();
+    while (cps.length) {
+        const cp = cps.pop();
+        f(cp);
+        if (cp.isTerminating()) {
+            continue;
+        }
+        cps.push(...cp.getChildren());
+    }
+}
+export { traverseEdges };
 //# sourceMappingURL=traverse-edges.js.map

package/node/traverse-edges.js.map

@@ -1 +1 @@
-{"version":3,"file":"traverse-edges.js","sourceRoot":"","sources":["../src/traverse-edges.ts"],"names":[],"mappings":"AAGA;;;;;;IAMI;AACJ,SAAS,aAAa,CACpB,MAAc,EACd,CAA2B;IAE5B,wEAAwE;IACxE,gBAAgB;IAChB,IAAI,GAAG,GAAG,MAAM,CAAC,kBAAkB,EAAE,CAAC;IAEtC,OAAO,GAAG,CAAC,MAAM,EAAE;QAClB,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,EAAE,CAAC,CAAC;QAEN,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE;YAAE,SAAS;SAAE;QACrC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;KAC9B;AACF,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}
+{"version":3,"file":"traverse-edges.js","sourceRoot":"","sources":["../src/traverse-edges.ts"],"names":[],"mappings":"AAGA;;;;;;IAMI;AACJ,SAAS,aAAa,CACpB,MAAc,EACd,CAA2B;IAE5B,wEAAwE;IACxE,gBAAgB;IAChB,MAAM,GAAG,GAAG,MAAM,CAAC,kBAAkB,EAAE,CAAC;IAExC,OAAO,GAAG,CAAC,MAAM,EAAE;QAClB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QACrB,CAAC,CAAC,EAAE,CAAC,CAAC;QAEN,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE;YAAE,SAAS;SAAE;QACrC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;KAC9B;AACF,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/traverse-vertices.d.ts

@@ -1,12 +1,12 @@
-import { CpNode } from './cp-node.js';
-/**
- * Traverses the MAT tree and calls the given callback function for each vertex
- * (represented by a [[CpNode]]) on the MAT.
- *
- * It is usually preferable to use [[traverseEdges]] as it allows for the
- * traversal of all the smooth curves representing the MAT.
- * @param cpNode Any [[CpNode]] representing the start vertex.
- * @param f A callback function taking a single [[CpNode]] as parameter.
- */
-declare function traverseVertices(cpNode: CpNode, f: (cpNode: CpNode) => void): void;
-export { traverseVertices };
+import { CpNode } from './cp-node.js';
+/**
+ * Traverses the MAT tree and calls the given callback function for each vertex
+ * (represented by a [[CpNode]]) on the MAT.
+ *
+ * It is usually preferable to use [[traverseEdges]] as it allows for the
+ * traversal of all the smooth curves representing the MAT.
+ * @param cpNode Any [[CpNode]] representing the start vertex.
+ * @param f A callback function taking a single [[CpNode]] as parameter.
+ */
+declare function traverseVertices(cpNode: CpNode, f: (cpNode: CpNode) => void): void;
+export { traverseVertices };

package/node/traverse-vertices.js

@@ -1,28 +1,28 @@
-/**
- * Traverses the MAT tree and calls the given callback function for each vertex
- * (represented by a [[CpNode]]) on the MAT.
- *
- * It is usually preferable to use [[traverseEdges]] as it allows for the
- * traversal of all the smooth curves representing the MAT.
- * @param cpNode Any [[CpNode]] representing the start vertex.
- * @param f A callback function taking a single [[CpNode]] as parameter.
- */
-function traverseVertices(cpNode, f) {
-    f(cpNode);
-    // Since the tree is unrooted we must iterate in all directions from the
-    // given cpNode.	
-    cpNode.getCpNodesOnCircle()
-        .filter(cpNode => !cpNode.isTerminating())
-        .map(cpNode => cpNode.next)
-        .forEach(f_);
-    function f_(cpNode) {
-        let cps = [cpNode];
-        while (cps.length) {
-            let cp = cps.pop();
-            f(cp);
-            cps.push(...cp.vertexChildren);
-        }
-    }
-}
-export { traverseVertices };
+/**
+ * Traverses the MAT tree and calls the given callback function for each vertex
+ * (represented by a [[CpNode]]) on the MAT.
+ *
+ * It is usually preferable to use [[traverseEdges]] as it allows for the
+ * traversal of all the smooth curves representing the MAT.
+ * @param cpNode Any [[CpNode]] representing the start vertex.
+ * @param f A callback function taking a single [[CpNode]] as parameter.
+ */
+function traverseVertices(cpNode, f) {
+    f(cpNode);
+    // Since the tree is unrooted we must iterate in all directions from the
+    // given cpNode.	
+    cpNode.getCpNodesOnCircle()
+        .filter(cpNode => !cpNode.isTerminating())
+        .map(cpNode => cpNode.next)
+        .forEach(f_);
+    function f_(cpNode) {
+        const cps = [cpNode];
+        while (cps.length) {
+            const cp = cps.pop();
+            f(cp);
+            cps.push(...cp.vertexChildren);
+        }
+    }
+}
+export { traverseVertices };
 //# sourceMappingURL=traverse-vertices.js.map

package/node/traverse-vertices.js.map

@@ -1 +1 @@
-{"version":3,"file":"traverse-vertices.js","sourceRoot":"","sources":["../src/traverse-vertices.ts"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CACvB,MAAc,EACd,CAA2B;IAE5B,CAAC,CAAC,MAAM,CAAC,CAAC;IAEV,wEAAwE;IACxE,iBAAiB;IACjB,MAAM,CAAC,kBAAkB,EAAE;SACzB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;SACzC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;SAC1B,OAAO,CAAC,EAAE,CAAC,CAAC;IAEd,SAAS,EAAE,CAAC,MAAc;QACzB,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACnB,OAAO,GAAG,CAAC,MAAM,EAAE;YAClB,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YACnB,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;SAC/B;IACF,CAAC;AACF,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}
+{"version":3,"file":"traverse-vertices.js","sourceRoot":"","sources":["../src/traverse-vertices.ts"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CACvB,MAAc,EACd,CAA2B;IAE5B,CAAC,CAAC,MAAM,CAAC,CAAC;IAEV,wEAAwE;IACxE,iBAAiB;IACjB,MAAM,CAAC,kBAAkB,EAAE;SACzB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;SACzC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;SAC1B,OAAO,CAAC,EAAE,CAAC,CAAC;IAEd,SAAS,EAAE,CAAC,MAAc;QACzB,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,OAAO,GAAG,CAAC,MAAM,EAAE;YAClB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;SAC/B;IACF,CAAC;AACF,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}

package/package.json

@@ -1,7 +1,8 @@
 {
     "name": "flo-mat",
+    "sideEffects": false,
     "description": "Medial / Scale Axis Transform (MAT/SAT) Library.",
-    "version": "2.0.1",
+    "version": "2.0.3",
     "author": {
         "name": "Floris Steenkamp"
     },
@@ -30,33 +31,37 @@
         "skeleton"
     ],
     "dependencies": {
-        "big-float-ts": "^3.0.2",
-        "double-double": "^2.0.6",
-        "flo-bezier3": "^4.0.1",
-        "flo-boolean": "^2.1.1",
-        "flo-draw": "^2.0.0",
-        "flo-gauss-quadrature": "^2.1.1",
-        "flo-ll-rb-tree": "^0.3.2",
-        "flo-memoize": "^1.0.0",
-        "flo-poly": "^6.0.4",
-        "flo-vector2d": "^4.0.1"
+        "big-float-ts": "^3.0.3",
+        "double-double": "^2.0.7",
+        "flo-bezier3": "^4.1.4",
+        "flo-boolean": "^2.1.6",
+        "flo-draw": "^2.0.2",
+        "flo-gauss-quadrature": "^2.1.2",
+        "flo-ll-rb-tree": "^0.3.3",
+        "flo-memoize": "^1.0.2",
+        "flo-poly": "^6.0.5",
+        "flo-vector2d": "^4.0.2"
     },
     "devDependencies": {
-        "@types/chai": "^4.3.3",
-        "@types/mocha": "^10.0.0",
-        "@types/node": "^18.11.8",
-        "c8": "^7.12.0",
-        "chai": "^4.3.6",
-        "mocha": "^10.1.0",
-        "rimraf": "^3.0.2",
+        "@types/chai": "^4.3.4",
+        "@types/mocha": "^10.0.1",
+        "@types/node": "^18.15.11",
+        "@typescript-eslint/eslint-plugin": "^5.58.0",
+        "@typescript-eslint/parser": "^5.58.0",
+        "c8": "^7.13.0",
+        "chai": "^4.3.7",
+        "circular-dependency-plugin": "^5.2.2",
+        "eslint": "^8.38.0",
+        "eslint-plugin-tree-shaking": "^1.10.0",
+        "mocha": "^10.2.0",
+        "resolve-typescript-plugin": "^2.0.1",
+        "rimraf": "^5.0.0",
         "source-map-support": "^0.5.21",
-        "ts-loader": "^9.4.1",
+        "ts-loader": "^9.4.2",
         "ts-node": "^10.9.1",
-        "typescript": "^4.8.4",
-        "webpack": "^5.74.0",
-        "webpack-cli": "^4.10.0",
-        "circular-dependency-plugin": "^5.2.2",
-        "resolve-typescript-plugin": "^1.2.0"
+        "typescript": "^5.0.4",
+        "webpack": "^5.78.0",
+        "webpack-cli": "^5.0.1"
     },
     "scripts": {
         "build": "npm run build-browser && npm run build-node",

package/src/circle.ts

@@ -30,9 +30,9 @@ function engulfsCircle(c1: Circle, c2: Circle) {
         return false; 
     }
     
-    let d = squaredDistanceBetween(c1.center, c2.center);
-    let dr = c1.radius - c2.radius; 
-    let δ = dr*dr;
+    const d = squaredDistanceBetween(c1.center, c2.center);
+    const dr = c1.radius - c2.radius; 
+    const δ = dr*dr;
 
     return δ > d;
 }