webgl2-sdf 0.0.1 → 0.0.2

package/node/utils/clip-line-segment-to-strips.js

@@ -0,0 +1,150 @@
+import { segStripX } from "./seg-strip-x";
+const { floor, ceil } = Math;
+/**
+ * Clips a line segment to strip boundaries and returns multiple segments.
+ *
+ * * modifies strips by adding line segments to each strip
+ * * size/count *must* be a power of 2
+ *
+ * @param count the number of strips
+ * @param height the height of a strip
+ * @param seg the line segment (array of 2 points)
+ */
+function clipLineSegmentToStrips(strips, height, seg) {
+    const count = strips.length;
+    /** `cellSize` *must* be a power of two */
+    const cellSize = height / count;
+    const [p0, p1] = seg;
+    const ps = segStripX(seg, [0, 0, height]);
+    const [x0, y0] = p0;
+    const [x1, y1] = p1;
+    const dX = x1 - x0;
+    const dY = y1 - y0;
+    const p0IsInStrip = x0 < 0 && y0 > 0 && y0 < height;
+    const p1IsInStrip = x1 < 0 && y1 > 0 && y1 < height;
+    // if line is completely outside strip
+    if ((ps.length < 2 && !p0IsInStrip && !p1IsInStrip) &&
+        ((x0 !== 0 || dX !== 0) ||
+            ((y0 <= 0 && y1 <= 0) || (y0 >= height && y1 >= height)))) {
+        return;
+    }
+    // Determine which strips the line passes through
+    if (dY === 0) { // no crossings possible
+        return;
+    }
+    // Use Bresenham-like approach to find all strips the line crosses
+    const stepY = y1 > y0 ? cellSize : -cellSize;
+    /** first point of each line segment to connect */
+    /** current x position */
+    let x = x0;
+    /** current y position */
+    let y = y0;
+    let i = 0;
+    // left-to-right
+    const ltr = x1 > x0;
+    // bottom-to-top
+    const btt = y1 > y0;
+    // // line segment min-y excluded
+    // const crossing =
+    //     (seg.y > y != seg.w > y) &&
+    //     (x > (seg.z - seg.x)*(y - seg.y) / (seg.w - seg.y) + seg.x);
+    const fY = btt ? floor : ceil;
+    while (true) {
+        // Find next strip boundary
+        let nextGridX = ((ltr && x < 0) || (!ltr && x > 0)) ? 0 : Number.NEGATIVE_INFINITY;
+        let nextGridY = cellSize * fY((y + stepY) / cellSize);
+        // Calculate parameter t for intersection with horizontal strip lines
+        // eq. (1)
+        const tX = (nextGridX - x0) / dX;
+        // eq. (2)
+        const tY = (nextGridY - y0) / dY;
+        const useTx = tX < tY && dX !== 0;
+        /** intersection X */
+        const xX = useTx ? 0 : x0 + tY * dX;
+        /** intersection Y */
+        const xY = useTx ? y0 + tX * dY : nextGridY;
+        // if we're past the line endpoint
+        if ((tX > 1 || dX === 0) && tY > 1) {
+            const v = floor(p1[1] / cellSize);
+            strips[v]?.lineSegs.push([[x, y], p1]);
+            break;
+        }
+        if (((xX >= 0 && (x0 !== 0 || dX !== 0)) || xY <= 0 || xY >= height)) {
+            // next strip intersection is on edge of strips
+            const entering = !p0IsInStrip && i === 0;
+            if (entering) {
+                // update current x,y position
+                [x, y] = ps[0];
+                i++;
+                continue;
+            }
+            else {
+                const v = fY(y / cellSize) - (btt ? 0 : 1); // previous v
+                const seg_ = [[x, y], ps[i]];
+                strips[v]?.lineSegs.push(seg_);
+                break;
+            }
+        }
+        // previous v
+        const v = fY(y / cellSize) - (btt ? 0 : 1);
+        strips[v]?.lineSegs.push([[x, y], [xX, xY]]);
+        // update current position
+        x = xX;
+        y = xY;
+    }
+}
+export { clipLineSegmentToStrips };
+// Quokka tests - https://www.desmos.com/calculator/uyqsdkviih
+// import { createEmptyStrips } from "./create-empty-strips";
+// {
+//     const strips = createEmptyStrips(8);
+//     const seg = [[0, 100], [0, 400]];
+//     toDesmosStr(seg);
+//     clipLineSegmentToStrips(strips, 512, seg);
+//     testAllEmptyExcept(strips,[1,2,3,4,5,6]);
+// }
+// {
+//     const strips = createEmptyStrips(8);
+//     const seg = [[83, 166], [-90, 440]];
+//     toDesmosStr(seg);
+//     clipLineSegmentToStrips(strips, 512, seg);
+//     testAllEmptyExcept(strips,[4,5,6]);
+// }
+// {
+//     const strips = createEmptyStrips(8);
+//     const seg = [[-570, 236], [-392, 546]];
+//     toDesmosStr(seg);
+//     clipLineSegmentToStrips(strips, 512, seg);
+//     testAllEmptyExcept(strips,[3,4,5,6,7]);
+// }
+// {
+//     const strips = createEmptyStrips(8);
+//     const seg = [[-462, 632], [-152, 611]];
+//     toDesmosStr(seg);
+//     clipLineSegmentToStrips(strips, 512, seg);
+//     testAllEmptyExcept(strips,[]);
+// }
+// function toDesmosStr(seg: number[][]) {
+//     const [[x0,y0],[x1,y1]] = seg;
+//     return `\\left(\\left(1-t\\right)\\cdot${x0.toFixed(2)}+t\\cdot\\left(${x1.toFixed(2)}\\right),\\left(1-t\\right)\\cdot${y0.toFixed(2)}+t\\cdot${y1.toFixed(2)}\\right)`;
+// }
+// function testAllEmptyExcept(
+//         strips: Strip[],
+//         exceptions: number[]) {
+//     for (let i=0; i<strips.length; i++) {
+//         const strip = strips[i];
+//         const idx = exceptions.findIndex(v => v === i);
+//         const exception = exceptions[idx];
+//         const len = strip.lineSegs.length;
+//         if (exception === undefined) {
+//             if (len !== 0) {
+//                 throw new Error(`Strip ${i} must be empty`);
+//             }
+//         } else {
+//             if (len !== 1) {
+//                 throw new Error(`Strip ${i} must contain 1 segments, found ${len}`);
+//             }
+//         }
+//     }
+// }
+//# sourceMappingURL=clip-line-segment-to-strips.js.map

package/node/utils/clip-line-segment-to-strips.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clip-line-segment-to-strips.js","sourceRoot":"","sources":["../../src/utils/clip-line-segment-to-strips.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAG1C,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAG7B;;;;;;;;;GASG;AACH,SAAS,uBAAuB,CACxB,MAAe,EACf,MAAc,EACd,GAAe;IAEnB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5B,0CAA0C;IAC1C,MAAM,QAAQ,GAAG,MAAM,GAAC,KAAK,CAAC;IAE9B,MAAM,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,GAAG,CAAC;IACpB,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,EAAC,CAAC,EAAC,MAAM,CAAC,CAAC,CAAC;IACxC,MAAM,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,EAAE,CAAC;IACnB,MAAM,CAAC,EAAE,EAAC,EAAE,CAAC,GAAG,EAAE,CAAC;IAEnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAEnB,MAAM,WAAW,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC;IACpD,MAAM,WAAW,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC;IAEpD,sCAAsC;IACtC,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC;QAC/C,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACtB,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;QAE7D,OAAO;IACX,CAAC;IAED,iDAAiD;IAEjD,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,CAAE,wBAAwB;QACrC,OAAO;IACX,CAAC;IAED,kEAAkE;IAClE,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAE7C,kDAAkD;IAElD,yBAAyB;IACzB,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,yBAAyB;IACzB,IAAI,CAAC,GAAG,EAAE,CAAC;IAEX,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,gBAAgB;IAChB,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;IACpB,gBAAgB;IAChB,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;IAEpB,iCAAiC;IACjC,mBAAmB;IACnB,kCAAkC;IAClC,mEAAmE;IAEnE,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAC9B,OAAO,IAAI,EAAE,CAAC;QACV,2BAA2B;QAC3B,IAAI,SAAS,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC;QAEnF,IAAI,SAAS,GAAG,QAAQ,GAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAC,QAAQ,CAAC,CAAC;QAElD,qEAAqE;QACrE,UAAU;QACV,MAAM,EAAE,GAAG,CAAC,SAAS,GAAG,EAAE,CAAC,GAAC,EAAE,CAAC;QAC/B,UAAU;QACV,MAAM,EAAE,GAAG,CAAC,SAAS,GAAG,EAAE,CAAC,GAAC,EAAE,CAAC;QAE/B,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAElC,qBAAqB;QACrB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC;QAClC,qBAAqB;QACrB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QAE1C,kCAAkC;QAClC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,GAAC,QAAQ,CAAC,CAAC;YAChC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM;QACV,CAAC;QAED,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,EAAE,CAAC;YACnE,+CAA+C;YAC/C,MAAM,QAAQ,GAAG,CAAC,WAAW,IAAI,CAAC,KAAK,CAAC,CAAC;YAEzC,IAAI,QAAQ,EAAE,CAAC;gBACX,8BAA8B;gBAC9B,CAAC,CAAC,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBACd,CAAC,EAAE,CAAC;gBACJ,SAAS;YACb,CAAC;iBAAM,CAAC;gBACJ,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,aAAa;gBACxD,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC/B,MAAM;YACV,CAAC;QACL,CAAC;QAED,aAAa;QACb,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEzC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE3C,0BAA0B;QAC1B,CAAC,GAAG,EAAE,CAAC;QACP,CAAC,GAAG,EAAE,CAAC;IACX,CAAC;AACL,CAAC;AAGD,OAAO,EAAE,uBAAuB,EAAE,CAAA;AAGlC,8DAA8D;AAC9D,6DAA6D;AAE7D,IAAI;AACJ,2CAA2C;AAC3C,wCAAwC;AAExC,wBAAwB;AACxB,iDAAiD;AACjD,gDAAgD;AAChD,IAAI;AAGJ,IAAI;AACJ,2CAA2C;AAC3C,2CAA2C;AAE3C,wBAAwB;AACxB,iDAAiD;AACjD,0CAA0C;AAC1C,IAAI;AAEJ,IAAI;AACJ,2CAA2C;AAC3C,8CAA8C;AAE9C,wBAAwB;AACxB,iDAAiD;AACjD,8CAA8C;AAC9C,IAAI;AAEJ,IAAI;AACJ,2CAA2C;AAC3C,8CAA8C;AAE9C,wBAAwB;AACxB,iDAAiD;AACjD,qCAAqC;AACrC,IAAI;AAGJ,0CAA0C;AAC1C,qCAAqC;AACrC,gLAAgL;AAChL,IAAI;AACJ,+BAA+B;AAC/B,2BAA2B;AAC3B,kCAAkC;AAElC,4CAA4C;AAC5C,mCAAmC;AACnC,0DAA0D;AAC1D,6CAA6C;AAC7C,6CAA6C;AAC7C,yCAAyC;AACzC,+BAA+B;AAC/B,+DAA+D;AAC/D,gBAAgB;AAChB,mBAAmB;AACnB,+BAA+B;AAC/B,uFAAuF;AACvF,gBAAgB;AAChB,YAAY;AACZ,QAAQ;AACR,IAAI"}

package/node/utils/create-empty-grid.js

@@ -0,0 +1,24 @@
+import { ROW_COUNT } from "../row-count";
+/**
+ *
+ * @param colCount
+ * @param padCount
+ */
+function createEmptyGrid(colCount, padCount) {
+    const grid = [];
+    // for (let u=0; u<ROW_COUNT + 2*padCount; u++) {
+    for (let u = 0; u < colCount + 2 * padCount; u++) {
+        const cells = [];
+        for (let v = 0; v < ROW_COUNT + 2 * padCount; v++) {
+            cells.push({
+                lineSegs: [],
+                closeCells: [],
+                crossingCells: []
+            });
+        }
+        grid.push(cells);
+    }
+    return grid;
+}
+export { createEmptyGrid };
+//# sourceMappingURL=create-empty-grid.js.map

package/node/utils/create-empty-grid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create-empty-grid.js","sourceRoot":"","sources":["../../src/utils/create-empty-grid.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAIzC;;;;GAIG;AACH,SAAS,eAAe,CAChB,QAAgB,EAChB,QAAgB;IAEpB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,iDAAiD;IACjD,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,GAAG,CAAC,GAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,SAAS,GAAG,CAAC,GAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,KAAK,CAAC,IAAI,CAAC;gBACP,QAAQ,EAAE,EAAE;gBACZ,UAAU,EAAE,EAAE;gBACd,aAAa,EAAE,EAAE;aACpB,CAAC,CAAC;QACP,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAGD,OAAO,EAAE,eAAe,EAAE,CAAA"}

package/node/utils/create-empty-strips.js

@@ -0,0 +1,16 @@
+import { ROW_COUNT } from "../row-count";
+/**
+ *
+ * @param count the number of strips
+ */
+// TODO - remove
+function createEmptyStrips() {
+    const strips = [];
+    for (let v = 0; v < ROW_COUNT; v++) {
+        // TODO - simplify
+        strips.push({ lineSegs: [] });
+    }
+    return strips;
+}
+export { createEmptyStrips };
+//# sourceMappingURL=create-empty-strips.js.map

package/node/utils/create-empty-strips.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create-empty-strips.js","sourceRoot":"","sources":["../../src/utils/create-empty-strips.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAIzC;;;GAGG;AACH,gBAAgB;AAChB,SAAS,iBAAiB;IACtB,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,kBAAkB;QAClB,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,iBAAiB,EAAE,CAAA"}

package/node/utils/distance-seg-to-p.js

@@ -0,0 +1,35 @@
+const { min, max, sqrt } = Math;
+/**
+ * Returns the minimum distance from the given line segment to the origin.
+ */
+function distanceSegToP(seg, p) {
+    const seg0 = seg[0];
+    const seg1 = seg[1];
+    const _x1 = seg0[0];
+    const _y1 = seg0[1];
+    const _x2 = seg1[0];
+    const _y2 = seg1[1];
+    const x = p[0];
+    const y = p[1];
+    const x1 = _x1 - x;
+    const y1 = _y1 - y;
+    const x2 = _x2 - x;
+    const y2 = _y2 - y;
+    // Vector from point 1 to point 2
+    const dx = x2 - x1;
+    const dy = y2 - y1;
+    const lengthSq = dx * dx + dy * dy;
+    // Calculate projection parameter t
+    // t represents where the closest point lies on the line segment
+    // t = 0 means closest point is at seg[0], t = 1 means closest point is at seg[1]
+    const t = max(0, min(1, -(x1 * dx + y1 * dy) / lengthSq));
+    // Find the closest point on the segment
+    const closestX = x1 + t * dx;
+    const closestY = y1 + t * dy;
+    // Return distance from origin to closest point
+    return sqrt(closestX * closestX + closestY * closestY);
+}
+export { distanceSegToP };
+// Quokka tests
+// distanceSegToOrigin([[0,1],[-1,-2]]);//?
+//# sourceMappingURL=distance-seg-to-p.js.map

package/node/utils/distance-seg-to-p.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"distance-seg-to-p.js","sourceRoot":"","sources":["../../src/utils/distance-seg-to-p.ts"],"names":[],"mappings":"AACA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAGhC;;GAEG;AACH,SAAS,cAAc,CACf,GAAe,EACf,CAAW;IAEf,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAEpB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACf,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEf,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IAEnB,iCAAiC;IACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAEnB,MAAM,QAAQ,GAAG,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC;IAE/B,mCAAmC;IACnC,gEAAgE;IAChE,iFAAiF;IACjF,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAEtD,wCAAwC;IACxC,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAC,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAC,EAAE,CAAC;IAE3B,+CAA+C;IAC/C,OAAO,IAAI,CAAC,QAAQ,GAAC,QAAQ,GAAG,QAAQ,GAAC,QAAQ,CAAC,CAAC;AACvD,CAAC;AAGD,OAAO,EAAE,cAAc,EAAE,CAAA;AAEzB,eAAe;AACf,2CAA2C"}

package/node/utils/find-close-cells.js

@@ -0,0 +1,130 @@
+import { ROW_COUNT } from "../row-count";
+import { circsCache } from "./calc-circs";
+import { distanceSegToP } from "./distance-seg-to-p";
+import { jumpIdx } from "./jump-idx";
+const { min, SQRT2 } = Math;
+function findCloseCells(grid, colCount, cellSize, maxDistance, padCount) {
+    const findCloseCellsFor_ = findCloseCellsFor(grid, colCount, cellSize, maxDistance, padCount);
+    let _minD = 0; // minimum for previous row, col 0
+    let minD = 0;
+    for (let i = padCount; i < colCount + padCount; i++) {
+        minD = _minD;
+        for (let j = padCount; j < ROW_COUNT + padCount; j++) {
+            minD = findCloseCellsFor_(i, j, minD);
+            if (j === padCount) {
+                _minD = minD;
+            }
+        }
+    }
+}
+function findCloseCellsFor(grid, colCount, cellSize, maxDistance, padCount) {
+    return function findCloseCellsFor_(i, j, _minD) {
+        // reduce current circle search range since we moved one square
+        let k = jumpIdx((_minD - SQRT2 * cellSize) / cellSize);
+        let minD = Number.POSITIVE_INFINITY;
+        while (k < circsCache.length) {
+            const from = circsCache[k].from;
+            // `SQRT2` to account for diagonal
+            if (cellSize * from > maxDistance + SQRT2 * cellSize) {
+                break;
+            }
+            // uncomment loop below to search all equidistant squares
+            // while (circsCache?.[k].from === from) {
+            const { u, v } = circsCache[k];
+            const u_ = u + i;
+            const v_ = v + j;
+            if (u_ < 0 || u_ >= colCount + 2 * padCount ||
+                v_ < 0 || v_ >= ROW_COUNT + 2 * padCount) {
+                k++;
+                continue;
+            }
+            const { lineSegs } = grid[u_][v_];
+            for (let l = 0; l < lineSegs.length; l++) {
+                // center of square
+                const c = [(i - padCount + 0.5) * cellSize, (j - padCount + 0.5) * cellSize];
+                const d = distanceSegToP(lineSegs[l], c);
+                if (d < minD) {
+                    minD = d;
+                }
+            }
+            k++;
+            // }
+            if (minD !== Number.POSITIVE_INFINITY) {
+                break;
+            }
+        }
+        if (minD === Number.POSITIVE_INFINITY) {
+            return min(maxDistance + SQRT2 * cellSize, cellSize * circsCache[circsCache.length - 1].from);
+        }
+        const { closeCells } = grid[i][j];
+        let l = jumpIdx((_minD - 2 * SQRT2 * cellSize) / cellSize);
+        while (l < circsCache.length) {
+            const { from, u, v } = circsCache[l];
+            // `SQRT2` to account for diagonal
+            if (cellSize * from > min(minD, maxDistance) + SQRT2 * cellSize) {
+                break;
+            }
+            const u_ = u + i;
+            const v_ = v + j;
+            if (u_ < 0 || u_ >= colCount + 2 * padCount ||
+                v_ < 0 || v_ >= ROW_COUNT + 2 * padCount) {
+                l++;
+                continue;
+            }
+            const { lineSegs } = grid[u_][v_];
+            if (lineSegs.length > 0) {
+                closeCells.push((2 * padCount + ROW_COUNT) * u_ + v_);
+            }
+            l++;
+        }
+        return minD;
+    };
+}
+export { findCloseCells };
+// Quokka tests
+// const grid: Cell[][] = [
+//     [
+//         { u: 0, v: 0, lineSegs: [], closeCells: [], crossingCells: [] },
+//         { u: 0, v: 1, lineSegs: [], closeCells: [], crossingCells: [] },
+//         { u: 0, v: 2, lineSegs: [], closeCells: [], crossingCells: [] },
+//         { u: 0, v: 3, lineSegs: [], closeCells: [], crossingCells: [] }
+//     ],
+//     [
+//         { u: 1, v: 0, lineSegs: [], closeCells: [], crossingCells: [] },
+//         {
+//             u: 1, v: 1,
+//             lineSegs: [[[175, 163], [175, 355]]],
+//             closeCells: [], crossingCells: []
+//         },
+//         {
+//             u: 1, v: 2,
+//             lineSegs: [[[175, 355], [335, 355]]],
+//             closeCells: [], crossingCells: []
+//         },
+//         { u: 1, v: 3, lineSegs: [], closeCells: [], crossingCells: [] }
+//     ],
+//     [
+//         { u: 2, v: 0, lineSegs: [], closeCells: [], crossingCells: [] },
+//         {
+//             u: 2, v: 1,
+//             lineSegs: [[[335, 163], [175, 163]]],
+//             closeCells: [], crossingCells: []
+//         },
+//         {
+//             u: 2, v: 2,
+//             lineSegs: [[[335, 355], [335, 163]]],
+//             closeCells: [], crossingCells: []
+//         },
+//         { u: 2, v: 3, lineSegs: [], closeCells: [], crossingCells: [] }
+//     ],
+//     [
+//         { u: 3, v: 0, lineSegs: [], closeCells: [], crossingCells: [] },
+//         { u: 3, v: 1, lineSegs: [], closeCells: [], crossingCells: [] },
+//         { u: 3, v: 2, lineSegs: [], closeCells: [], crossingCells: [] },
+//         { u: 3, v: 3, lineSegs: [], closeCells: [], crossingCells: [] }
+//     ]
+// ];
+// findCloseCells(grid);
+// const v = grid.map(cells => cells.map(c => ({ u: c.u, v: c.v, closeCells: c.closeCells })));
+// v;//?
+//# sourceMappingURL=find-close-cells.js.map

package/node/utils/find-close-cells.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-close-cells.js","sourceRoot":"","sources":["../../src/utils/find-close-cells.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAGrC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;AAG5B,SAAS,cAAc,CACf,IAAc,EACd,QAAgB,EAChB,QAAgB,EAChB,WAAmB,EACnB,QAAgB;IAEpB,MAAM,kBAAkB,GAAG,iBAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAA;IAE7F,IAAI,KAAK,GAAG,CAAC,CAAC,CAAE,kCAAkC;IAClD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAC,QAAQ,EAAE,CAAC,GAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,IAAI,GAAG,KAAK,CAAC;QACb,KAAK,IAAI,CAAC,GAAC,QAAQ,EAAE,CAAC,GAAC,SAAS,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAAC,KAAK,GAAG,IAAI,CAAC;YAAC,CAAC;QACzC,CAAC;IACL,CAAC;AACL,CAAC;AAGD,SAAS,iBAAiB,CAClB,IAAc,EACd,QAAgB,EAChB,QAAgB,EAChB,WAAmB,EACnB,QAAgB;IAEpB,OAAO,SAAS,kBAAkB,CAC1B,CAAS,EACT,CAAS,EACT,KAAa;QAEjB,+DAA+D;QAC/D,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,GAAG,KAAK,GAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;QACrD,IAAI,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACpC,OAAO,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAEhC,kCAAkC;YAClC,IAAI,QAAQ,GAAC,IAAI,GAAG,WAAW,GAAG,KAAK,GAAC,QAAQ,EAAE,CAAC;gBAC/C,MAAM;YACV,CAAC;YAED,yDAAyD;YACzD,0CAA0C;YACtC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,QAAQ,GAAG,CAAC,GAAC,QAAQ;gBACrC,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,SAAS,GAAG,CAAC,GAAC,QAAQ,EAAE,CAAC;gBAEzC,CAAC,EAAE,CAAC;gBAAC,SAAS;YAClB,CAAC;YAED,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAClC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,mBAAmB;gBACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,GAAG,CAAC,GAAC,QAAQ,EAAE,CAAC,CAAC,GAAG,QAAQ,GAAG,GAAG,CAAC,GAAC,QAAQ,CAAC,CAAC;gBACzE,MAAM,CAAC,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBACX,IAAI,GAAG,CAAC,CAAC;gBACb,CAAC;YACL,CAAC;YAED,CAAC,EAAE,CAAC;YACR,IAAI;YAEJ,IAAI,IAAI,KAAK,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBACpC,MAAM;YACV,CAAC;QACL,CAAC;QAED,IAAI,IAAI,KAAK,MAAM,CAAC,iBAAiB,EAAE,CAAC;YACpC,OAAO,GAAG,CACN,WAAW,GAAG,KAAK,GAAC,QAAQ,EAC5B,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CACpD,CAAC;QACN,CAAC;QAED,MAAM,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,GAAC,KAAK,GAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;QACvD,OAAO,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;YAC3B,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAErC,kCAAkC;YAClC,IAAI,QAAQ,GAAC,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,GAAG,KAAK,GAAC,QAAQ,EAAE,CAAC;gBAC1D,MAAM;YACV,CAAC;YAED,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,QAAQ,GAAG,CAAC,GAAC,QAAQ;gBACrC,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,SAAS,GAAG,CAAC,GAAC,QAAQ,EAAE,CAAC;gBAEzC,CAAC,EAAE,CAAC;gBAAC,SAAS;YAClB,CAAC;YAED,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAClC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,GAAC,QAAQ,GAAG,SAAS,CAAC,GAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACtD,CAAC;YAED,CAAC,EAAE,CAAC;QACR,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC,CAAA;AACL,CAAC;AAGD,OAAO,EAAE,cAAc,EAAE,CAAA;AAGzB,eAAe;AACf,2BAA2B;AAC3B,QAAQ;AACR,2EAA2E;AAC3E,2EAA2E;AAC3E,2EAA2E;AAC3E,0EAA0E;AAC1E,SAAS;AACT,QAAQ;AACR,2EAA2E;AAC3E,YAAY;AACZ,0BAA0B;AAC1B,oDAAoD;AACpD,gDAAgD;AAChD,aAAa;AACb,YAAY;AACZ,0BAA0B;AAC1B,oDAAoD;AACpD,gDAAgD;AAChD,aAAa;AACb,0EAA0E;AAC1E,SAAS;AACT,QAAQ;AACR,2EAA2E;AAC3E,YAAY;AACZ,0BAA0B;AAC1B,oDAAoD;AACpD,gDAAgD;AAChD,aAAa;AACb,YAAY;AACZ,0BAA0B;AAC1B,oDAAoD;AACpD,gDAAgD;AAChD,aAAa;AACb,0EAA0E;AAC1E,SAAS;AACT,QAAQ;AACR,2EAA2E;AAC3E,2EAA2E;AAC3E,2EAA2E;AAC3E,0EAA0E;AAC1E,QAAQ;AACR,KAAK;AAEL,wBAAwB;AACxB,+FAA+F;AAC/F,QAAQ"}

package/node/utils/find-crossing-cells.js

@@ -0,0 +1,31 @@
+import { ROW_COUNT } from "../row-count";
+// TODO - simplify?
+// TODO - could be made much faster by also checking intersections here
+// and passing the result to the next cell
+function findCrossingCells(grid, colCount, padCount) {
+    for (let i = padCount; i < colCount + padCount; i++) {
+        for (let j = padCount; j < ROW_COUNT + padCount; j++) {
+            const cc = grid[i][j].crossingCells;
+            for (let k = padCount; k <= i; k++) {
+                if (grid[k][j].lineSegs.length === 0) {
+                    continue;
+                }
+                cc.push((ROW_COUNT + 2 * padCount) * k + j);
+            }
+        }
+    }
+}
+export { findCrossingCells };
+// Quokka tests
+// import { createEmptyGrid } from "./create-empty-grid";
+// // const g = createEmptyGrid(0);
+// const g = createEmptyGrid(0);
+// // g[0][0].lineSegs.push([[]]);
+// g[2][0].lineSegs.push([[]]);
+// g[2][2].lineSegs.push([[]]);
+// findCrossingCells(g);
+// let r = 2;
+// // g.map(r => r.map(c => c.crossingCells))[r].map(v => v);//?
+// g.map(r => r.map(c => c.crossingCells))[r].map(v => v.map(r => r[1]));//?
+// g;//?
+//# sourceMappingURL=find-crossing-cells.js.map

package/node/utils/find-crossing-cells.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find-crossing-cells.js","sourceRoot":"","sources":["../../src/utils/find-crossing-cells.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAIzC,mBAAmB;AACnB,uEAAuE;AACvE,0CAA0C;AAC1C,SAAS,iBAAiB,CAClB,IAAc,EACd,QAAgB,EAChB,QAAgB;IAEpB,KAAK,IAAI,CAAC,GAAC,QAAQ,EAAE,CAAC,GAAC,QAAQ,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAC,QAAQ,EAAE,CAAC,GAAC,SAAS,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;YAEpC,KAAK,IAAI,CAAC,GAAC,QAAQ,EAAE,CAAC,IAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAAC,SAAS;gBAAC,CAAC;gBACnD,EAAE,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,GAAC,QAAQ,CAAC,GAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAGD,OAAO,EAAE,iBAAiB,EAAE,CAAA;AAG5B,eAAe;AACf,yDAAyD;AACzD,mCAAmC;AACnC,gCAAgC;AAChC,kCAAkC;AAClC,+BAA+B;AAC/B,+BAA+B;AAC/B,wBAAwB;AACxB,aAAa;AACb,gEAAgE;AAChE,4EAA4E;AAC5E,QAAQ"}

package/node/utils/get-distance-to-line-function.js

@@ -0,0 +1,45 @@
+const { sqrt } = Math;
+/**
+ * Returns a function that returns the signed distance to the given line from
+ * the given point.
+ *
+ * @param pS a point on the line
+ * @param pE a different point on the line; if `pS` is the same as `pE` then
+ * the distance to the point `pS` (or `pE`) will be returned.
+ */
+function getDistanceToLineFunction(pS, pE) {
+    const xS = pS[0];
+    const yS = pS[1];
+    const xE = pE[0];
+    const yE = pE[1];
+    const s = yS - yE;
+    const t = xE - xS;
+    const v = xS * yE - xE * yS;
+    // Calculate the length of the line for normalization
+    const lineLength = sqrt(s * s + t * t);
+    return function (p) {
+        const x = p[0];
+        const y = p[1];
+        // Calculate the perpendicular distance from point to line
+        return lineLength !== 0
+            ? (s * x + t * y + v) / lineLength
+            : sqrt((x - xS) ** 2 + (y - yS) ** 2);
+    };
+}
+export { getDistanceToLineFunction };
+// Quokka tests
+{
+    const pS = [6, 2];
+    const pE = [6, 2];
+    const p = [10, 1];
+    const f = getDistanceToLineFunction(pS, pE);
+    f(p); //?
+}
+// {
+//     const p0 = [0,0];
+//     const p1 = [6,1];
+//     const p2 = [10,1];
+//     const f = getDistanceToLineFunction(p0,p2);
+//     f(p1);//?
+// }
+//# sourceMappingURL=get-distance-to-line-function.js.map

package/node/utils/get-distance-to-line-function.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-distance-to-line-function.js","sourceRoot":"","sources":["../../src/utils/get-distance-to-line-function.ts"],"names":[],"mappings":"AACA,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAGtB;;;;;;;GAOG;AACH,SAAS,yBAAyB,CAChC,EAAY,EACZ,EAAY;IAEb,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAEjB,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAClB,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAClB,MAAM,CAAC,GAAG,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC;IAExB,qDAAqD;IACrD,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,GAAC,CAAC,GAAG,CAAC,GAAC,CAAC,CAAC,CAAC;IAEnC,OAAO,UAAS,CAAW;QAC1B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEf,0DAA0D;QAC1D,OAAO,UAAU,KAAK,CAAC;YACb,CAAC,CAAC,CAAC,CAAC,GAAC,CAAC,GAAG,CAAC,GAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU;YAC9B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,IAAE,CAAC,CAAC,CACpC;IACR,CAAC,CAAA;AACF,CAAC;AAGD,OAAO,EAAE,yBAAyB,EAAE,CAAA;AAGpC,eAAe;AACf,CAAC;IACG,MAAM,EAAE,GAAG,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAC,CAAC,CAAC,CAAC;IACjB,MAAM,CAAC,GAAG,yBAAyB,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA,GAAG;AACZ,CAAC;AACD,IAAI;AACJ,wBAAwB;AACxB,wBAAwB;AACxB,yBAAyB;AACzB,kDAAkD;AAClD,gBAAgB;AAChB,IAAI"}

package/node/utils/jump-idx.js

@@ -0,0 +1,81 @@
+import { circsCache } from "./calc-circs";
+const { trunc, max, E } = Math;
+/**
+ * @param v
+ */
+function binarySearchRange(v) {
+    let min = 0;
+    let max = circsCache.length - 1;
+    let mid = 0;
+    while (min <= max) {
+        mid = (min + max) >>> 1; //?
+        const midVal = circsCache[mid].from;
+        if (midVal === v) {
+            // return [min,mid,max];
+            return mid;
+        }
+        else if (v > midVal) {
+            min = mid + 1;
+        }
+        else {
+            max = mid - 1;
+        }
+    }
+    // return [min,mid,max];
+    return mid;
+}
+// const [Q,R] = [10.606601717798213, 35.531676008879735];
+// const [A1,B1,F1] = [102.42126, 0.153169, -117.56077];
+// const [A2,B2,C2,D2,F2] = [-0.000660087, 0.388148, 841.25744, -0.0529616, -1089.49916];
+// const [A3,B3,C3,D3,F3] = [-7567711.63, -0.0251756, 7562560.69, 0.025054, -7475.16953];
+// function jumpIdxOld(
+//         c: number) {
+//     let idx = trunc(
+//         c <= 0 ? 0 : c <= 0.7071067811865476 ? 1 : c <= 1.5 ? 5
+//         // Three-part regression (faster than binary search in this case)
+//         : (c <= Q) 
+//         ? A1*(E**(B1*c)) + F1
+//         : c <= R
+//         ? A2*(E**(B2*c)) + C2*(E**(-D2*c)) + F2
+//         : A3*(E**(B3*c)) + C3*(E**(-D3*c)) + F3);
+//     c = max(0, c);
+//     while (circsCache[idx].from > c) { idx--; }
+//     while (circsCache[idx + 1].from < c) { idx++; }
+//     return idx;
+// }
+function jumpIdx(c) {
+    let idx = binarySearchRange(c);
+    c = max(0, c);
+    while (idx !== 0 && circsCache[idx].from >= c) {
+        idx--;
+    }
+    while (idx < circsCache.length - 2 && circsCache[idx + 1].from < c) {
+        idx++;
+    }
+    return idx;
+}
+export { jumpIdx };
+// Quokka tests
+// // circsCache.slice(0,30).map(c => c.from);//?
+// circsCache[12].from;//?
+// circsCache[15].from;//?
+// // circsCache.length;//?
+// // jumpIdxOld(1.5811388300841898);//?
+// jumpIdx(0.5);//?
+// binarySearchRange(1.5811388300841898);//?
+// jumpIdxOld(3.7);//?
+// jumpIdx(3.7);//?
+// // binarySearchRange(3.7);//?
+// jumpIdxOld(0);//?
+// jumpIdx(0);//?
+// // binarySearchRange(0);//?
+// jumpIdxOld(13.7);//?
+// jumpIdx(13.7);//?
+// // binarySearchRange(13.7);//?
+// jumpIdxOld(33.7);//?
+// jumpIdx(33.7);//?
+// // binarySearchRange(33.7);//?
+// // jumpIdxOld(55);//?
+// // jumpIdx(55);//?
+// binarySearchRange(55);//?
+//# sourceMappingURL=jump-idx.js.map

package/node/utils/jump-idx.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jump-idx.js","sourceRoot":"","sources":["../../src/utils/jump-idx.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC;AAG/B;;GAEG;AACH,SAAS,iBAAiB,CAClB,CAAS;IAEb,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IAEhC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAChB,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA,GAAG;QAC3B,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QACpC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACf,wBAAwB;YACxB,OAAO,GAAG,CAAC;QACf,CAAC;aAAM,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC;YACpB,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACJ,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,CAAC;IACL,CAAC;IAED,wBAAwB;IACxB,OAAO,GAAG,CAAC;AACf,CAAC;AAGD,0DAA0D;AAC1D,wDAAwD;AACxD,yFAAyF;AACzF,yFAAyF;AACzF,uBAAuB;AACvB,uBAAuB;AAEvB,uBAAuB;AACvB,kEAAkE;AAClE,4EAA4E;AAC5E,sBAAsB;AACtB,gCAAgC;AAChC,mBAAmB;AACnB,kDAAkD;AAClD,oDAAoD;AAEpD,qBAAqB;AACrB,kDAAkD;AAClD,sDAAsD;AAEtD,kBAAkB;AAClB,IAAI;AAGJ,SAAS,OAAO,CACR,CAAS;IAEb,IAAI,GAAG,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAE/B,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACd,OAAO,GAAG,KAAK,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;QAAC,GAAG,EAAE,CAAC;IAAC,CAAC;IACzD,OAAO,GAAG,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAAC,GAAG,EAAE,CAAC;IAAC,CAAC;IAE9E,OAAO,GAAG,CAAC;AACf,CAAC;AAGD,OAAO,EAAE,OAAO,EAAE,CAAA;AAGlB,eAAe;AACf,iDAAiD;AACjD,0BAA0B;AAC1B,0BAA0B;AAC1B,2BAA2B;AAE3B,wCAAwC;AACxC,mBAAmB;AACnB,4CAA4C;AAG5C,sBAAsB;AACtB,mBAAmB;AACnB,gCAAgC;AAEhC,oBAAoB;AACpB,iBAAiB;AACjB,8BAA8B;AAE9B,uBAAuB;AACvB,oBAAoB;AACpB,iCAAiC;AAEjC,uBAAuB;AACvB,oBAAoB;AACpB,iCAAiC;AAEjC,wBAAwB;AACxB,qBAAqB;AACrB,4BAA4B"}

package/node/utils/map-to-viewbox.js

@@ -0,0 +1,29 @@
+function mapToViewbox(viewbox, width, height, psss) {
+    if (viewbox[0] === 0 && viewbox[1] === 0 &&
+        viewbox[2] === width && viewbox[3] === height) {
+        return psss;
+    }
+    const [vx, vy, vw, vh] = viewbox;
+    const scaleX = width / vw;
+    const scaleY = height / vh;
+    const psss_ = [];
+    for (let i = 0; i < psss.length; i++) {
+        const pss = psss[i];
+        const pss_ = [];
+        for (let j = 0; j < pss.length; j++) {
+            const ps = pss[j];
+            const ps_ = [];
+            for (let k = 0; k < ps.length; k++) {
+                const [x, y] = ps[k];
+                const x_ = scaleX * x - vx;
+                const y_ = scaleY * y - vy;
+                ps_.push([x_, y_]);
+            }
+            pss_.push(ps_);
+        }
+        psss_.push(pss_);
+    }
+    return psss_;
+}
+export { mapToViewbox };
+//# sourceMappingURL=map-to-viewbox.js.map

package/node/utils/map-to-viewbox.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map-to-viewbox.js","sourceRoot":"","sources":["../../src/utils/map-to-viewbox.ts"],"names":[],"mappings":"AACA,SAAS,YAAY,CACb,OAAsC,EACtC,KAAa,EACb,MAAc,EACd,IAAsB;IAE1B,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;QACpC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC;QAEhD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC;IAEjC,MAAM,MAAM,GAAG,KAAK,GAAC,EAAE,CAAC;IACxB,MAAM,MAAM,GAAG,MAAM,GAAC,EAAE,CAAC;IACzB,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,IAAI,GAAmB,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,GAAG,GAAe,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,CAAC,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBAEpB,MAAM,EAAE,GAAG,MAAM,GAAC,CAAC,GAAG,EAAE,CAAC;gBACzB,MAAM,EAAE,GAAG,MAAM,GAAC,CAAC,GAAG,EAAE,CAAC;gBACzB,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAC,EAAE,CAAC,CAAC,CAAC;YACtB,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAGD,OAAO,EAAE,YAAY,EAAE,CAAA"}