@itwin/core-geometry 5.1.0-dev.9 → 5.2.0-dev.2

package/lib/cjs/numerics/SmallSystem.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SmallSystem.d.ts","sourceRoot":"","sources":["../../../src/numerics/SmallSystem.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAKhD;;;GAGG;AACH,qBAAa,WAAW;IACtB;;;;;;;;OAQG;WACW,8CAA8C,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAC7G,MAAM,EAAE,QAAQ,GAAG,OAAO;IAsB5B;;;;;;OAMG;WACW,8CAA8C,CAC1D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAChD,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAChD,MAAM,EAAE,QAAQ,GAAG,OAAO;IAkB5B;;;;;;;;OAQG;WACW,8CAA8C,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAC7G,MAAM,EAAE,QAAQ,GAAG,OAAO;IAuB5B;;;;;;;;OAQG;WACW,+CAA+C,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IA6B9J;;;;;OAKG;WACW,qCAAqC,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAmBxH;;;;;OAKG;WACW,oCAAoC,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,GAAG,MAAM,GAAG,SAAS;IAWzH;;;;;OAKG;WACW,kCAAkC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAY7H;;;;;;;;OAQG;WACW,qCAAqC,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EACpG,MAAM,EAAE,QAAQ,GAAG,OAAO;IAQ5B;;;;;;;;;;;;;;;;OAgBG;WACW,mCAAmC,CAC/C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EACtE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EACtE,MAAM,EAAE,QAAQ,GAAG,OAAO;IAa5B;;;;;;;;;;;OAWG;WACW,cAAc,CAC1B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,sBAAsB;IAC9C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,uBAAuB;IAC/C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,aAAa;IACrC,MAAM,EAAE,QAAQ,GACf,OAAO;IAaV;;;;;;;;;;;;;;;;;;;OAmBG;WACW,cAAc,CAC1B,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,sBAAsB;IAC7D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,uBAAuB;IAC9D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,uBAAuB;IAC9D,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAK,aAAa;IACpD,MAAM,CAAC,EAAE,QAAQ,GAChB,QAAQ,GAAG,SAAS;IAcvB;;;;;;;;;;OAUG;WACW,gBAAgB,CAC5B,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAChC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAChC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAU5E;;;;;OAKG;WACW,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAShH;;;;OAIG;WACW,iBAAiB,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAC9C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAC7C,OAAO,EAAE,GAAG,SAAS;CAGzB"}
+{"version":3,"file":"SmallSystem.d.ts","sourceRoot":"","sources":["../../../src/numerics/SmallSystem.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAKhD;;;GAGG;AACH,qBAAa,WAAW;IACtB;;;;;;;;;OASG;WACW,8BAA8B,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,aAAa,GAAG,SAAS;IAavH;;;;;;;;OAQG;WACW,8CAA8C,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,GAAG,OAAO;IAQ3I;;;;;OAKG;WACW,8CAA8C,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAG,OAAO;IAU3L;;;;;;;OAOG;WACW,8CAA8C,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,GAAG,OAAO;IAQ3I;;;;;;;;;;;;OAYG;WACW,+BAA+B,CAC3C,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EACtB,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EACtB,GAAG,GAAE,MAAqC,GACzC;QAAE,EAAE,EAAE,aAAa,CAAC;QAAC,EAAE,EAAE,aAAa,CAAA;KAAE,GAAG,SAAS;IA+BvD;;;;;;;;;;;;;OAaG;WACW,oCAAoC,CAChD,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EACtB,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EACtB,GAAG,GAAE,MAAqC,GACzC;QAAE,EAAE,EAAE,aAAa,CAAC;QAAC,EAAE,CAAC,EAAE,aAAa,CAAA;KAAE,GAAG,SAAS;IAaxD;;;;;;;OAOG;WACW,+CAA+C,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IA6B9J;;;;;OAKG;WACW,qCAAqC,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAqBxH;;;;;OAKG;WACW,oCAAoC,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,GAAG,MAAM,GAAG,SAAS;IAWzH;;;;;OAKG;WACW,kCAAkC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAY7H;;;;;;;OAOG;WACW,qCAAqC,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EACpG,MAAM,EAAE,QAAQ,GAAG,OAAO;IAQ5B;;;;;;;;;;;;;;;OAeG;WACW,mCAAmC,CAC/C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EACtE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EACtE,MAAM,EAAE,QAAQ,GAAG,OAAO;IAa5B;;;;;;;;;;;OAWG;WACW,cAAc,CAC1B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,sBAAsB;IAC9C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,uBAAuB;IAC/C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,aAAa;IACrC,MAAM,EAAE,QAAQ,GACf,OAAO;IAaV;;;;;;;;;;;;;;;;;;;OAmBG;WACW,cAAc,CAC1B,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,sBAAsB;IAC7D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,uBAAuB;IAC9D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,uBAAuB;IAC9D,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAK,aAAa;IACpD,MAAM,CAAC,EAAE,QAAQ,GAChB,QAAQ,GAAG,SAAS;IAcvB;;;;;;;;;;OAUG;WACW,gBAAgB,CAC5B,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAChC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAChC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAU5E;;;;;OAKG;WACW,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAShH;;;;OAIG;WACW,iBAAiB,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAC9C,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAC7C,OAAO,EAAE,GAAG,SAAS;CAGzB"}

package/lib/cjs/numerics/SmallSystem.js

@@ -18,92 +18,150 @@ const Polynomials_1 = require("./Polynomials");
  * @public
  */
 class SmallSystem {
+    /**
+     * Intersect two transverse 2D lines.
+     * * If the lines are parallel and overlap, the returned intersection is of dubious use.
+     * @param a0 start point of line A
+     * @param aDir direction vector of line A
+     * @param b0 start point of line B
+     * @param bDir direction vector of line B
+     * @returns intersection fractions, `x` along line A and `y` along line B; or `undefined` if no intersection.
+     * @see [[lineSegmentXYUVOverlapUnbounded]], [[lineSegmentXYUVIntersectionUnbounded]]
+     */
+    static lineXYUVTransverseIntersection(a0, aDir, b0, bDir) {
+        const cx = b0.x - a0.x;
+        const cy = b0.y - a0.y;
+        const aCrossB = Geometry_1.Geometry.crossProductXYXY(aDir.x, aDir.y, bDir.x, bDir.y);
+        const cCrossB = Geometry_1.Geometry.crossProductXYXY(cx, cy, bDir.x, bDir.y);
+        const cCrossA = Geometry_1.Geometry.crossProductXYXY(cx, cy, aDir.x, aDir.y);
+        const x = Geometry_1.Geometry.conditionalDivideFraction(cCrossB, aCrossB);
+        const y = Geometry_1.Geometry.conditionalDivideFraction(cCrossA, aCrossB);
+        if (x !== undefined && y !== undefined)
+            return { x, y };
+        return undefined;
+    }
     /**
      * Return true if lines (a0,a1) to (b0, b1) have a simple intersection.
-     * Return the fractional (not xy) coordinates in result.x, result.y
-     * @param a0 start point of line a
-     * @param a1  end point of line a
-     * @param b0  start point of line b
-     * @param b1 end point of line b
-     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     * Return the fractional (not xy) coordinates in result.x, result.y.
+     * @param a0 start point of line A
+     * @param a1 end point of line A
+     * @param b0 start point of line B
+     * @param b1 end point of line B
+     * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.
      */
     static lineSegment2dXYTransverseIntersectionUnbounded(a0, a1, b0, b1, result) {
         const ux = a1.x - a0.x;
         const uy = a1.y - a0.y;
         const vx = b1.x - b0.x;
         const vy = b1.y - b0.y;
-        const cx = b0.x - a0.x;
-        const cy = b0.y - a0.y;
-        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
-        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
-        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
-        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
-        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
-        if (s !== undefined && t !== undefined) {
-            result.set(s, -t);
-            return true;
-        }
-        result.set(0, 0);
-        return false;
+        return this.lineSegmentXYUVTransverseIntersectionUnbounded(a0.x, a0.y, ux, uy, b0.x, b0.y, vx, vy, result);
     }
     /**
-     * * (ax0,ay0) to (ax0+ux,ay0+uy) are line A.
-     * * (bx0,by0) to (bx0+vx,by0+vy) are lineB.
-     * * Return true if the lines have a simple intersection.
-     * * Return the fractional (not xy) coordinates in result.x, result.y
-     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     * Return true if the lines have a simple intersection.
+     * * Points (ax0,ay0) to (ax0+ux,ay0+uy) are at fractions 0 and 1 of line A.
+     * * Points (bx0,by0) to (bx0+vx,by0+vy) are at fractions 0 and 1 of line B.
+     * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.
      */
     static lineSegmentXYUVTransverseIntersectionUnbounded(ax0, ay0, ux, uy, bx0, by0, vx, vy, result) {
-        const cx = bx0 - ax0;
-        const cy = by0 - ay0;
-        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
-        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
-        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
-        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
-        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
-        if (s !== undefined && t !== undefined) {
-            result.set(s, -t);
+        const transverse = this.lineXYUVTransverseIntersection({ x: ax0, y: ay0 }, { x: ux, y: uy }, { x: bx0, y: by0 }, { x: vx, y: vy });
+        if (transverse) {
+            result.set(transverse.x, transverse.y);
             return true;
         }
         result.set(0, 0);
         return false;
     }
     /**
-     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts
-     * Return the fractional (not xy) coordinates in result.x, result.y
-     * @param a0 start point of line a
-     * @param a1  end point of line a
-     * @param b0  start point of line b
-     * @param b1 end point of line b
-     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts.
+     * @param a0 start point of line A
+     * @param a1 end point of line A
+     * @param b0 start point of line B
+     * @param b1 end point of line B
+     * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.
      */
     static lineSegment3dXYTransverseIntersectionUnbounded(a0, a1, b0, b1, result) {
         const ux = a1.x - a0.x;
         const uy = a1.y - a0.y;
         const vx = b1.x - b0.x;
         const vy = b1.y - b0.y;
-        const cx = b0.x - a0.x;
-        const cy = b0.y - a0.y;
-        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
-        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
-        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
-        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
-        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
-        if (s !== undefined && t !== undefined) {
-            result.set(s, -t);
-            return true;
-        }
-        result.set(0, 0);
-        return false;
+        return this.lineSegmentXYUVTransverseIntersectionUnbounded(a0.x, a0.y, ux, uy, b0.x, b0.y, vx, vy, result);
+    }
+    /**
+     * Intersect two overlapping unbounded 2D lines.
+     * @param a0 start point of line A
+     * @param aDir direction vector of line A; end point of line segment A is `a0 + aDir`
+     * @param b0 start point of line B
+     * @param bDir direction vector of line B; end point of line segment B is `b0 + bDir`
+     * @param tol overlap distance tolerance
+     * @returns `undefined` if the lines have a simple (transverse) intersection, or are parallel without overlap.
+     * Otherwise, return the fractions at which each segment overlaps the other line:
+     * * segment B maps to fractions in the range f0.x < f1.x on line A.
+     * * segment A maps to fractions in the range f0.y < f1.y on line B.
+     * @see [[lineXYUVTransverseIntersection]], [[lineSegmentXYUVIntersectionUnbounded]]
+     */
+    static lineSegmentXYUVOverlapUnbounded(a0, aDir, b0, bDir, tol = Geometry_1.Geometry.smallMetricDistance) {
+        const tol2 = tol * tol;
+        const projectToSegment = (s, e0, eDir) => {
+            const eDotE = Geometry_1.Geometry.dotProductXYXY(eDir.x, eDir.y, eDir.x, eDir.y);
+            const sDotE = Geometry_1.Geometry.dotProductXYXY(s.x - e0.x, s.y - e0.y, eDir.x, eDir.y);
+            const f = Geometry_1.Geometry.safeDivideFraction(sDotE, eDotE, 0.0);
+            return { f, p: { x: e0.x + f * eDir.x, y: e0.y + f * eDir.y } };
+        };
+        const a0OnB = projectToSegment(a0, b0, bDir);
+        if (Geometry_1.Geometry.distanceSquaredXYXY(a0.x, a0.y, a0OnB.p.x, a0OnB.p.y) > tol2)
+            return undefined;
+        const a1x = a0.x + aDir.x;
+        const a1y = a0.y + aDir.y;
+        const a1OnB = projectToSegment({ x: a1x, y: a1y }, b0, bDir);
+        if (Geometry_1.Geometry.distanceSquaredXYXY(a1x, a1y, a1OnB.p.x, a1OnB.p.y) > tol2)
+            return undefined;
+        const b0OnA = projectToSegment(b0, a0, aDir);
+        if (Geometry_1.Geometry.distanceSquaredXYXY(b0.x, b0.y, b0OnA.p.x, b0OnA.p.y) > tol2)
+            return undefined;
+        const b1x = b0.x + bDir.x;
+        const b1y = b0.y + bDir.y;
+        const b1OnA = projectToSegment({ x: b1x, y: b1y }, a0, aDir);
+        if (Geometry_1.Geometry.distanceSquaredXYXY(b1x, b1y, b1OnA.p.x, b1OnA.p.y) > tol2)
+            return undefined;
+        if (b0OnA.f > b1OnA.f)
+            [b0OnA.f, b1OnA.f] = [b1OnA.f, b0OnA.f];
+        if (a0OnB.f > a1OnB.f)
+            [a0OnB.f, a1OnB.f] = [a1OnB.f, a0OnB.f];
+        return { f0: { x: b0OnA.f, y: a0OnB.f }, f1: { x: b1OnA.f, y: a1OnB.f } };
+    }
+    /**
+     * Intersect two transverse or overlapping unbounded 2D line segments.
+     * @param a0 start point of line A
+     * @param aDir direction vector of line A; end point of line segment A is `a0 + aDir`
+     * @param b0 start point of line B
+     * @param bDir direction vector of line B; end point of line segment B is `b0 + bDir`
+     * @param tol overlap distance tolerance
+     * @returns intersection fractions:
+     * * If `f1` is undefined, the intersection occurs at fraction f0.x along line A and f0.y along line B.
+     * * If `f1` is defined, the line segments are parallel and overlap:
+     * segment B maps to fractions in the range f0.x < f1.x on line A;
+     * segment A maps to fractions in the range f0.y < f1.y on line B.
+     * * If `undefined`, the lines are parallel without overlap.
+     */
+    static lineSegmentXYUVIntersectionUnbounded(a0, aDir, b0, bDir, tol = Geometry_1.Geometry.smallMetricDistance) {
+        // Normal practice is to do the (quick, simple) transverse intersection first, but the transverse intersector's
+        // notion of coincidence is based on the determinant ratios, which are hard to relate to physical tolerance.
+        // So do the overlap first. This should do a quick exit in non-coincident case.
+        const overlap = this.lineSegmentXYUVOverlapUnbounded(a0, aDir, b0, bDir, tol);
+        if (overlap)
+            return overlap;
+        const transverse = this.lineXYUVTransverseIntersection(a0, aDir, b0, bDir);
+        if (transverse)
+            return { f0: transverse };
+        return undefined;
     }
     /**
      * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts of WEIGHTED 4D Points
-     * Return the fractional (not xy) coordinates in result.x, result.y
-     * @param hA0 homogeneous start point of line a
-     * @param hA1 homogeneous end point of line a
-     * @param hB0 homogeneous start point of line b
-     * @param hB1 homogeneous end point of line b
-     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     * @param hA0 homogeneous start point of line A
+     * @param hA1 homogeneous end point of line A
+     * @param hB0 homogeneous start point of line B
+     * @param hB1 homogeneous end point of line B
+     * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.
      */
     static lineSegment3dHXYTransverseIntersectionUnbounded(hA0, hA1, hB0, hB1, result) {
         // Considering only x,y,w parts....
@@ -123,15 +181,15 @@ class SmallSystem {
     }
     /**
      * Return the line fraction at which the (homogeneous) line is closest to a space point as viewed in xy only.
-     * @param hA0 homogeneous start point of line a
-     * @param hA1 homogeneous end point of line a
+     * @param hA0 homogeneous start point of the line
+     * @param hA1 homogeneous end point of the line
      * @param spacePoint homogeneous point in space
      */
     static lineSegment3dHXYClosestPointUnbounded(hA0, hA1, spacePoint) {
-        // Considering only x,y,w parts....
+        // Considering only x,y,w parts.
         // weighted difference of (A1 w0 - A0 w1) is (cartesian) tangent vector along the line as viewed.
-        // The perpendicular (pure vector) W = (-y,x) flip is the direction of projection
-        // Point Q along A is (in full homogeneous)  `(1-lambda) A0 + lambda 1 A1`
+        // The perpendicular (pure vector) W = (-y,x) flip is the direction of projection.
+        // Point Q along A is (in full homogeneous) `(1-lambda) A0 + lambda 1 A1`.
         // PointQ is colinear with spacePoint and and W when the xyw homogeneous determinant | Q W spacePoint | is zero.
         const tx = hA1.x * hA0.w - hA0.x * hA1.w;
         const ty = hA1.y * hA0.w - hA0.y * hA1.w;
@@ -174,19 +232,17 @@ class SmallSystem {
     }
     /**
      * Return true if lines (a0,a1) to (b0, b1) have closest approach (go by each other) in 3d
-     * Return the fractional (not xy) coordinates in result.x, result.y
-     * @param a0 start point of line a
-     * @param a1  end point of line a
-     * @param b0  start point of line b
-     * @param b1 end point of line b
-     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     * @param a0 start point of line A
+     * @param a1 end point of line A
+     * @param b0 start point of line B
+     * @param b1 end point of line B
+     * @param result vector to receive fractional coordinates of closest approach: result.x is fraction on line A, result.y is fraction on line B.
      */
     static lineSegment3dClosestApproachUnbounded(a0, a1, b0, b1, result) {
         return this.ray3dXYZUVWClosestApproachUnbounded(a0.x, a0.y, a0.z, a1.x - a0.x, a1.y - a0.y, a1.z - a0.z, b0.x, b0.y, b0.z, b1.x - b0.x, b1.y - b0.y, b1.z - b0.z, result);
     }
     /**
      * Return true if the given rays have closest approach (go by each other) in 3d
-     * Return the fractional (not xy) coordinates as x and y parts of a Point2d.
      * @param ax x-coordinate of the origin of the first ray
      * @param ay y-coordinate of the origin of the first ray
      * @param az z-coordinate of the origin of the first ray
@@ -199,7 +255,7 @@ class SmallSystem {
      * @param bu x-coordinate of the direction vector of the second ray
      * @param bv y-coordinate of the direction vector of the second ray
      * @param bw z-coordinate of the direction vector of the second ray
-     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.
      */
     static ray3dXYZUVWClosestApproachUnbounded(ax, ay, az, au, av, aw, bx, by, bz, bu, bv, bw, result) {
         const cx = bx - ax;
@@ -293,7 +349,7 @@ class SmallSystem {
         return this.linearSystem3d(normalA.x, normalA.y, normalA.z, normalB.x, normalB.y, normalB.z, normalC.x, normalC.y, normalC.z, Geometry_1.Geometry.dotProductXYZXYZ(xyzA.x, xyzA.y, xyzA.z, normalA.x, normalA.y, normalA.z), Geometry_1.Geometry.dotProductXYZXYZ(xyzB.x, xyzB.y, xyzB.z, normalB.x, normalB.y, normalB.z), Geometry_1.Geometry.dotProductXYZXYZ(xyzC.x, xyzC.y, xyzC.z, normalC.x, normalC.y, normalC.z), result);
     }
     /**
-     * * in rowB, replace `rowB[j] += a * rowB[pivot] * rowA[j] / rowA[pivot]` for `j>pivot`
+     * In rowB, replace `rowB[j] += a * rowB[pivot] * rowA[j] / rowA[pivot]` for `j > pivot`
      * @param rowA row that does not change
      * @param pivotIndex index of pivot (divisor) in rowA.
      * @param rowB row where elimination occurs.

package/lib/cjs/numerics/SmallSystem.js.map

@@ -1 +1 @@
-{"version":3,"file":"SmallSystem.js","sourceRoot":"","sources":["../../../src/numerics/SmallSystem.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAkE;AAClE,mEAAkE;AAGlE,+CAAmD;AAEnD,mBAAmB;AAEnB;;;GAGG;AACH,MAAa,WAAW;IACtB;;;;;;;;OAQG;IACI,MAAM,CAAC,8CAA8C,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EAC7G,MAAgB;QAChB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,8CAA8C,CAC1D,GAAW,EAAE,GAAW,EAAE,EAAU,EAAE,EAAU,EAChD,GAAW,EAAE,GAAW,EAAE,EAAU,EAAE,EAAU,EAChD,MAAgB;QAEhB,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;QACrB,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;QAErB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,8CAA8C,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EAC7G,MAAgB;QAChB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,+CAA+C,CAAC,GAAY,EAAE,GAAY,EAAE,GAAY,EAAE,GAAY,EAAE,MAAiB;QACrI,mCAAmC;QACnC,uEAAuE;QACvE,2GAA2G;QAC3G,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CACnC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CACnC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,SAAS,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;QAC/E,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,mBAAQ,CAAC,aAAa,CAClC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,mBAAQ,CAAC,aAAa,CAClC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,SAAS,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;YAC5E,IAAI,SAAS,KAAK,SAAS;gBACzB,OAAO,0BAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,qCAAqC,CAAC,GAAY,EAAE,GAAY,EAAE,UAAmB;QACjG,mCAAmC;QACnC,iGAAiG;QACjG,iFAAiF;QACjF,0EAA0E;QAC1E,gHAAgH;QAChH,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,mBAAQ,CAAC,aAAa,CACjC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,EACxB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,EACvB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,mBAAQ,CAAC,aAAa,CACjC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,EACxB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,EACvB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC;IAChE,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,oCAAoC,CAAC,OAAc,EAAE,OAAc,EAAE,UAAiB;QAClG,iCAAiC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC7B,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,kCAAkC,CAAC,OAAgB,EAAE,OAAgB,EAAE,UAAmB;QACtG,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACvC,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EACpG,MAAgB;QAChB,OAAO,IAAI,CAAC,mCAAmC,CAC7C,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAChB,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EACrC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAChB,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EACrC,MAAM,CAAC,CAAC;IACZ,CAAC;IACD;;;;;;;;;;;;;;;;OAgBG;IACI,MAAM,CAAC,mCAAmC,CAC/C,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EACtE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EACtE,MAAgB;QAEhB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAEnB,MAAM,EAAE,GAAG,mBAAQ,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,OAAO,WAAW,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IACtE,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,cAAc,CAC1B,EAAU,EAAE,EAAU,EAAE,sBAAsB;IAC9C,EAAU,EAAE,EAAU,EAAE,uBAAuB;IAC/C,EAAU,EAAE,EAAU,EAAE,aAAa;IACrC,MAAgB;QAEhB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,cAAc,CAC1B,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,sBAAsB;IAC7D,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,uBAAuB;IAC9D,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,uBAAuB;IAC9D,EAAU,EAAE,EAAU,EAAE,EAAU,EAAK,aAAa;IACpD,MAAiB;QAEjB,sDAAsD;QACtD,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAChF,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YAC1D,OAAO,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAC5B,IAAa,EAAE,OAAiB,EAChC,IAAa,EAAE,OAAiB,EAChC,IAAa,EAAE,OAAiB,EAAE,MAAiB;QACnD,OAAO,IAAI,CAAC,cAAc,CACxB,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAClF,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAClF,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAAC,IAAkB,EAAE,UAAkB,EAAE,IAAkB,EAAE,CAAS;QACpG,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAClC,CAAC,IAAI,CAAC,CAAC;QACP,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACrC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAC7B,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAC9C,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;QAE9C,OAAO,gCAAkB,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9E,CAAC;CACF;AA3WD,kCA2WC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Numerics\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { Point4d } from \"../geometry4d/Point4d\";\nimport { BilinearPolynomial } from \"./Polynomials\";\n\n// cspell:word XYUV\n\n/**\n * static methods for commonly appearing sets of equations in 2 or 3 variables\n * @public\n */\nexport class SmallSystem {\n  /**\n   * Return true if lines (a0,a1) to (b0, b1) have a simple intersection.\n   * Return the fractional (not xy) coordinates in result.x, result.y\n   * @param a0 start point of line a\n   * @param a1  end point of line a\n   * @param b0  start point of line b\n   * @param b1 end point of line b\n   * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.\n   */\n  public static lineSegment2dXYTransverseIntersectionUnbounded(a0: Point2d, a1: Point2d, b0: Point2d, b1: Point2d,\n    result: Vector2d): boolean {\n    const ux = a1.x - a0.x;\n    const uy = a1.y - a0.y;\n\n    const vx = b1.x - b0.x;\n    const vy = b1.y - b0.y;\n\n    const cx = b0.x - a0.x;\n    const cy = b0.y - a0.y;\n\n    const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n    const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n    const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n    const s = Geometry.conditionalDivideFraction(cv, uv);\n    const t = Geometry.conditionalDivideFraction(cu, uv);\n    if (s !== undefined && t !== undefined) {\n      result.set(s, -t);\n      return true;\n    }\n    result.set(0, 0);\n    return false;\n  }\n  /**\n   * * (ax0,ay0) to (ax0+ux,ay0+uy) are line A.\n   * * (bx0,by0) to (bx0+vx,by0+vy) are lineB.\n   * * Return true if the lines have a simple intersection.\n   * * Return the fractional (not xy) coordinates in result.x, result.y\n   * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.\n   */\n  public static lineSegmentXYUVTransverseIntersectionUnbounded(\n    ax0: number, ay0: number, ux: number, uy: number,\n    bx0: number, by0: number, vx: number, vy: number,\n    result: Vector2d): boolean {\n\n    const cx = bx0 - ax0;\n    const cy = by0 - ay0;\n\n    const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n    const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n    const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n    const s = Geometry.conditionalDivideFraction(cv, uv);\n    const t = Geometry.conditionalDivideFraction(cu, uv);\n    if (s !== undefined && t !== undefined) {\n      result.set(s, -t);\n      return true;\n    }\n    result.set(0, 0);\n    return false;\n  }\n\n  /**\n   * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts\n   * Return the fractional (not xy) coordinates in result.x, result.y\n   * @param a0 start point of line a\n   * @param a1  end point of line a\n   * @param b0  start point of line b\n   * @param b1 end point of line b\n   * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.\n   */\n  public static lineSegment3dXYTransverseIntersectionUnbounded(a0: Point3d, a1: Point3d, b0: Point3d, b1: Point3d,\n    result: Vector2d): boolean {\n    const ux = a1.x - a0.x;\n    const uy = a1.y - a0.y;\n\n    const vx = b1.x - b0.x;\n    const vy = b1.y - b0.y;\n\n    const cx = b0.x - a0.x;\n    const cy = b0.y - a0.y;\n\n    const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n    const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n    const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n    const s = Geometry.conditionalDivideFraction(cv, uv);\n    const t = Geometry.conditionalDivideFraction(cu, uv);\n    if (s !== undefined && t !== undefined) {\n      result.set(s, -t);\n      return true;\n    }\n    result.set(0, 0);\n    return false;\n  }\n\n  /**\n   * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts of WEIGHTED 4D Points\n   * Return the fractional (not xy) coordinates in result.x, result.y\n   * @param hA0 homogeneous start point of line a\n   * @param hA1 homogeneous end point of line a\n   * @param hB0 homogeneous start point of line b\n   * @param hB1 homogeneous end point of line b\n   * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.\n   */\n  public static lineSegment3dHXYTransverseIntersectionUnbounded(hA0: Point4d, hA1: Point4d, hB0: Point4d, hB1: Point4d, result?: Vector2d): Vector2d | undefined {\n    // Considering only x,y,w parts....\n    // Point Q along B is (in full homogeneous)  `(1-lambda) B0 + lambda 1`\n    // PointQ is colinear with A0,A1 when the determinant det (A0,A1,Q) is zero.  (Each column takes xyw parts)\n    const alpha0 = Geometry.tripleProduct(\n      hA0.x, hA1.x, hB0.x,\n      hA0.y, hA1.y, hB0.y,\n      hA0.w, hA1.w, hB0.w);\n    const alpha1 = Geometry.tripleProduct(\n      hA0.x, hA1.x, hB1.x,\n      hA0.y, hA1.y, hB1.y,\n      hA0.w, hA1.w, hB1.w);\n    const fractionB = Geometry.conditionalDivideFraction(-alpha0, alpha1 - alpha0);\n    if (fractionB !== undefined) {\n      const beta0 = Geometry.tripleProduct(\n        hB0.x, hB1.x, hA0.x,\n        hB0.y, hB1.y, hA0.y,\n        hB0.w, hB1.w, hA0.w);\n      const beta1 = Geometry.tripleProduct(\n        hB0.x, hB1.x, hA1.x,\n        hB0.y, hB1.y, hA1.y,\n        hB0.w, hB1.w, hA1.w);\n      const fractionA = Geometry.conditionalDivideFraction(-beta0, beta1 - beta0);\n      if (fractionA !== undefined)\n        return Vector2d.create(fractionA, fractionB, result);\n    }\n    return undefined;\n  }\n\n  /**\n   * Return the line fraction at which the (homogeneous) line is closest to a space point as viewed in xy only.\n   * @param hA0 homogeneous start point of line a\n   * @param hA1 homogeneous end point of line a\n   * @param spacePoint homogeneous point in space\n   */\n  public static lineSegment3dHXYClosestPointUnbounded(hA0: Point4d, hA1: Point4d, spacePoint: Point4d): number | undefined {\n    // Considering only x,y,w parts....\n    // weighted difference of (A1 w0 - A0 w1) is (cartesian) tangent vector along the line as viewed.\n    // The perpendicular (pure vector) W = (-y,x) flip is the direction of projection\n    // Point Q along A is (in full homogeneous)  `(1-lambda) A0 + lambda 1 A1`\n    // PointQ is colinear with spacePoint and and W when the xyw homogeneous determinant | Q W spacePoint | is zero.\n    const tx = hA1.x * hA0.w - hA0.x * hA1.w;\n    const ty = hA1.y * hA0.w - hA0.y * hA1.w;\n    const det0 = Geometry.tripleProduct(\n      hA0.x, -ty, spacePoint.x,\n      hA0.y, tx, spacePoint.y,\n      hA0.w, 0, spacePoint.w);\n    const det1 = Geometry.tripleProduct(\n      hA1.x, -ty, spacePoint.x,\n      hA1.y, tx, spacePoint.y,\n      hA1.w, 0, spacePoint.w);\n    return Geometry.conditionalDivideFraction(-det0, det1 - det0);\n  }\n\n  /**\n   * Return the line fraction at which the line is closest to a space point as viewed in xy only.\n   * @param pointA0 start point\n   * @param pointA1 end point\n   * @param spacePoint point in space\n   */\n  public static lineSegment3dXYClosestPointUnbounded(pointA0: XAndY, pointA1: XAndY, spacePoint: XAndY): number | undefined {\n    // Considering only x,y parts....\n    const ux = pointA1.x - pointA0.x;\n    const uy = pointA1.y - pointA0.y;\n    const uu = ux * ux + uy * uy;\n    const vx = spacePoint.x - pointA0.x;\n    const vy = spacePoint.y - pointA0.y;\n    const uv = ux * vx + uy * vy;\n    return Geometry.conditionalDivideFraction(uv, uu);\n  }\n\n  /**\n   * Return the line fraction at which the line is closest to a space point\n   * @param pointA0 start point\n   * @param pointA1 end point\n   * @param spacePoint point in space\n   */\n  public static lineSegment3dClosestPointUnbounded(pointA0: Point3d, pointA1: Point3d, spacePoint: Point3d): number | undefined {\n    const ux = pointA1.x - pointA0.x;\n    const uy = pointA1.y - pointA0.y;\n    const uz = pointA1.z - pointA0.z;\n    const uu = ux * ux + uy * uy + uz * uz;\n    const vx = spacePoint.x - pointA0.x;\n    const vy = spacePoint.y - pointA0.y;\n    const vz = spacePoint.z - pointA0.z;\n    const uv = ux * vx + uy * vy + uz * vz;\n    return Geometry.conditionalDivideFraction(uv, uu);\n  }\n\n  /**\n   * Return true if lines (a0,a1) to (b0, b1) have closest approach (go by each other) in 3d\n   * Return the fractional (not xy) coordinates in result.x, result.y\n   * @param a0 start point of line a\n   * @param a1  end point of line a\n   * @param b0  start point of line b\n   * @param b1 end point of line b\n   * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.\n   */\n  public static lineSegment3dClosestApproachUnbounded(a0: Point3d, a1: Point3d, b0: Point3d, b1: Point3d,\n    result: Vector2d): boolean {\n    return this.ray3dXYZUVWClosestApproachUnbounded(\n      a0.x, a0.y, a0.z,\n      a1.x - a0.x, a1.y - a0.y, a1.z - a0.z,\n      b0.x, b0.y, b0.z,\n      b1.x - b0.x, b1.y - b0.y, b1.z - b0.z,\n      result);\n  }\n  /**\n   * Return true if the given rays have closest approach (go by each other) in 3d\n   * Return the fractional (not xy) coordinates as x and y parts of a Point2d.\n   * @param ax x-coordinate of the origin of the first ray\n   * @param ay y-coordinate of the origin of the first ray\n   * @param az z-coordinate of the origin of the first ray\n   * @param au x-coordinate of the direction vector of the first ray\n   * @param av y-coordinate of the direction vector of the first ray\n   * @param aw z-coordinate of the direction vector of the first ray\n   * @param bx x-coordinate of the origin of the second ray\n   * @param by y-coordinate of the origin of the second ray\n   * @param bz z-coordinate of the origin of the second ray\n   * @param bu x-coordinate of the direction vector of the second ray\n   * @param bv y-coordinate of the direction vector of the second ray\n   * @param bw z-coordinate of the direction vector of the second ray\n   * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.\n   */\n  public static ray3dXYZUVWClosestApproachUnbounded(\n    ax: number, ay: number, az: number, au: number, av: number, aw: number,\n    bx: number, by: number, bz: number, bu: number, bv: number, bw: number,\n    result: Vector2d): boolean {\n\n    const cx = bx - ax;\n    const cy = by - ay;\n    const cz = bz - az;\n\n    const uu = Geometry.hypotenuseSquaredXYZ(au, av, aw);\n    const vv = Geometry.hypotenuseSquaredXYZ(bu, bv, bw);\n    const uv = Geometry.dotProductXYZXYZ(au, av, aw, bu, bv, bw);\n    const cu = Geometry.dotProductXYZXYZ(cx, cy, cz, au, av, aw);\n    const cv = Geometry.dotProductXYZXYZ(cx, cy, cz, bu, bv, bw);\n    return SmallSystem.linearSystem2d(uu, -uv, uv, -vv, cu, cv, result);\n  }\n  /**\n   * Solve the pair of linear equations\n   * * `ux * x + vx * y = cx`\n   * * `uy * x + vy * y = cy`\n   * @param ux xx coefficient\n   * @param vx xy coefficient\n   * @param uy yx coefficient\n   * @param vy yy coefficient\n   * @param cx x right hand side\n   * @param cy y right hand side\n   * @param result (x,y) solution (MUST be preallocated by caller)\n   */\n  public static linearSystem2d(\n    ux: number, vx: number, // first row of matrix\n    uy: number, vy: number, // second row of matrix\n    cx: number, cy: number, // right side\n    result: Vector2d,\n  ): boolean {\n    const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n    const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n    const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n    const s = Geometry.conditionalDivideFraction(cv, uv);\n    const t = Geometry.conditionalDivideFraction(cu, uv);\n    if (s !== undefined && t !== undefined) {\n      result.set(s, t);\n      return true;\n    }\n    result.set(0, 0);\n    return false;\n  }\n  /**\n   * Solve a linear system:\n   * * x equation: `axx * u + axy * v + axz * w = cx`\n   * * y equation: `ayx * u + ayy * v + ayz * w = cy`\n   * * z equation: `azx * u + azy * v + azz * w = cz`\n   * @param axx row 0, column 0 coefficient\n   * @param axy row 0, column 1 coefficient\n   * @param axz row 0, column 1 coefficient\n   * @param ayx row 1, column 0 coefficient\n   * @param ayy row 1, column 1 coefficient\n   * @param ayz row 1, column 2 coefficient\n   * @param azx row 2, column 0 coefficient\n   * @param azy row 2, column 1 coefficient\n   * @param azz row 2, column 2 coefficient\n   * @param cx right hand side row 0 coefficient\n   * @param cy right hand side row 1 coefficient\n   * @param cz right hand side row 2 coefficient\n   * @param result optional result.\n   * @returns solution vector (u,v,w) or `undefined` if system is singular.\n   */\n  public static linearSystem3d(\n    axx: number, axy: number, axz: number, // first row of matrix\n    ayx: number, ayy: number, ayz: number, // second row of matrix\n    azx: number, azy: number, azz: number, // second row of matrix\n    cx: number, cy: number, cz: number,    // right side\n    result?: Vector3d,\n  ): Vector3d | undefined {\n    // determinants of various combinations of columns ...\n    const detXYZ = Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, axz, ayz, azz);\n    const detCYZ = Geometry.tripleProduct(cx, cy, cz, axy, ayy, azy, axz, ayz, azz);\n    const detXCZ = Geometry.tripleProduct(axx, ayx, azx, cx, cy, cz, axz, ayz, azz);\n    const detXYC = Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, cx, cy, cz);\n    const s = Geometry.conditionalDivideFraction(detCYZ, detXYZ);\n    const t = Geometry.conditionalDivideFraction(detXCZ, detXYZ);\n    const u = Geometry.conditionalDivideFraction(detXYC, detXYZ);\n    if (s !== undefined && t !== undefined && u !== undefined) {\n      return Vector3d.create(s, t, u, result);\n    }\n    return undefined;\n  }\n  /**\n   * Compute the intersection of three planes.\n   * @param xyzA point on the first plane\n   * @param normalA normal of the first plane\n   * @param xyzB point on the second plane\n   * @param normalB normal of the second plane\n   * @param xyzC point on the third plane\n   * @param normalC normal of the third plane\n   * @param result optional result\n   * @returns intersection point of the three planes (as a Vector3d), or undefined if at least two planes are parallel.\n   */\n  public static intersect3Planes(\n    xyzA: Point3d, normalA: Vector3d,\n    xyzB: Point3d, normalB: Vector3d,\n    xyzC: Point3d, normalC: Vector3d, result?: Vector3d): Vector3d | undefined {\n    return this.linearSystem3d(\n      normalA.x, normalA.y, normalA.z,\n      normalB.x, normalB.y, normalB.z,\n      normalC.x, normalC.y, normalC.z,\n      Geometry.dotProductXYZXYZ(xyzA.x, xyzA.y, xyzA.z, normalA.x, normalA.y, normalA.z),\n      Geometry.dotProductXYZXYZ(xyzB.x, xyzB.y, xyzB.z, normalB.x, normalB.y, normalB.z),\n      Geometry.dotProductXYZXYZ(xyzC.x, xyzC.y, xyzC.z, normalC.x, normalC.y, normalC.z), result);\n  }\n\n  /**\n   * * in rowB, replace `rowB[j] += a * rowB[pivot] * rowA[j] / rowA[pivot]` for `j>pivot`\n   * @param rowA row that does not change\n   * @param pivotIndex index of pivot (divisor) in rowA.\n   * @param rowB row where elimination occurs.\n   */\n  public static eliminateFromPivot(rowA: Float64Array, pivotIndex: number, rowB: Float64Array, a: number): boolean {\n    const n = rowA.length;\n    let q = Geometry.conditionalDivideFraction(rowB[pivotIndex], rowA[pivotIndex]);\n    if (q === undefined) return false;\n    q *= a;\n    for (let j = pivotIndex + 1; j < n; j++)\n      rowB[j] += q * rowA[j];\n    return true;\n  }\n  /**\n   * Solve a pair of bilinear equations\n   * * First equation: `a0 + b0 * u + c0 * v + d0 * u * v = 0`\n   * * Second equation: `a1 + b1 * u + c1 * v + d1 * u * v = 0`\n   */\n  public static solveBilinearPair(\n    a0: number, b0: number, c0: number, d0: number,\n    a1: number, b1: number, c1: number, d1: number,\n  ): Point2d[] | undefined {\n    return BilinearPolynomial.solveBilinearPair(a0, b0, c0, d0, a1, b1, c1, d1);\n  }\n}\n"]}
+{"version":3,"file":"SmallSystem.js","sourceRoot":"","sources":["../../../src/numerics/SmallSystem.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAkE;AAClE,mEAAkE;AAGlE,+CAAmD;AAEnD,mBAAmB;AAEnB;;;GAGG;AACH,MAAa,WAAW;IACtB;;;;;;;;;OASG;IACI,MAAM,CAAC,8BAA8B,CAAC,EAAS,EAAE,IAAW,EAAE,EAAS,EAAE,IAAW;QACzF,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,OAAO,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,OAAO,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/D,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/D,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;YACpC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,8CAA8C,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,MAAgB;QAC/H,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,8CAA8C,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IAC7G,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,8CAA8C,CAAC,GAAW,EAAE,GAAW,EAAE,EAAU,EAAE,EAAU,EAAE,GAAW,EAAE,GAAW,EAAE,EAAU,EAAE,EAAU,EAAE,MAAgB;QAC/K,MAAM,UAAU,GAAG,IAAI,CAAC,8BAA8B,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACpI,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,8CAA8C,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,MAAgB;QAC/H,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,8CAA8C,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IAC7G,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,+BAA+B,CAC3C,EAAS,EAAE,IAAW,EACtB,EAAS,EAAE,IAAW,EACtB,MAAc,mBAAQ,CAAC,mBAAmB;QAE1C,MAAM,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;QACvB,MAAM,gBAAgB,GAAG,CAAC,CAAQ,EAAE,EAAS,EAAE,IAAW,EAA2B,EAAE;YACrF,MAAM,KAAK,GAAG,mBAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACtE,MAAM,KAAK,GAAG,mBAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9E,MAAM,CAAC,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YACzD,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;QAClE,CAAC,CAAC;QACF,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7C,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;YACvE,OAAO,SAAS,CAAC;QACnB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7D,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;YACrE,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7C,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;YACvE,OAAO,SAAS,CAAC;QACnB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7D,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;YACrE,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YACnB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YACnB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;IAC5E,CAAC;IAED;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,oCAAoC,CAChD,EAAS,EAAE,IAAW,EACtB,EAAS,EAAE,IAAW,EACtB,MAAc,mBAAQ,CAAC,mBAAmB;QAE1C,+GAA+G;QAC/G,4GAA4G;QAC5G,+EAA+E;QAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,+BAA+B,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9E,IAAI,OAAO;YACT,OAAO,OAAO,CAAC;QACjB,MAAM,UAAU,GAAG,IAAI,CAAC,8BAA8B,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,UAAU;YACZ,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,+CAA+C,CAAC,GAAY,EAAE,GAAY,EAAE,GAAY,EAAE,GAAY,EAAE,MAAiB;QACrI,mCAAmC;QACnC,uEAAuE;QACvE,2GAA2G;QAC3G,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CACnC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CACnC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,SAAS,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;QAC/E,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,mBAAQ,CAAC,aAAa,CAClC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,mBAAQ,CAAC,aAAa,CAClC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,SAAS,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;YAC5E,IAAI,SAAS,KAAK,SAAS;gBACzB,OAAO,0BAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,qCAAqC,CAAC,GAAY,EAAE,GAAY,EAAE,UAAmB;QACjG,gCAAgC;QAChC,iGAAiG;QACjG,kFAAkF;QAClF,0EAA0E;QAC1E,gHAAgH;QAChH,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,mBAAQ,CAAC,aAAa,CACjC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,EACxB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,EACvB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CACvB,CAAC;QACF,MAAM,IAAI,GAAG,mBAAQ,CAAC,aAAa,CACjC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,EACxB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,EACvB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CACvB,CAAC;QACF,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC;IAChE,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,oCAAoC,CAAC,OAAc,EAAE,OAAc,EAAE,UAAiB;QAClG,iCAAiC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC7B,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,kCAAkC,CAAC,OAAgB,EAAE,OAAgB,EAAE,UAAmB;QACtG,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACvC,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,qCAAqC,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EACpG,MAAgB;QAChB,OAAO,IAAI,CAAC,mCAAmC,CAC7C,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAChB,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EACrC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAChB,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EACrC,MAAM,CAAC,CAAC;IACZ,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,mCAAmC,CAC/C,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EACtE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EACtE,MAAgB;QAEhB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAEnB,MAAM,EAAE,GAAG,mBAAQ,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,OAAO,WAAW,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IACtE,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,cAAc,CAC1B,EAAU,EAAE,EAAU,EAAE,sBAAsB;IAC9C,EAAU,EAAE,EAAU,EAAE,uBAAuB;IAC/C,EAAU,EAAE,EAAU,EAAE,aAAa;IACrC,MAAgB;QAEhB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,cAAc,CAC1B,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,sBAAsB;IAC7D,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,uBAAuB;IAC9D,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,uBAAuB;IAC9D,EAAU,EAAE,EAAU,EAAE,EAAU,EAAK,aAAa;IACpD,MAAiB;QAEjB,sDAAsD;QACtD,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAChF,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YAC1D,OAAO,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAC5B,IAAa,EAAE,OAAiB,EAChC,IAAa,EAAE,OAAiB,EAChC,IAAa,EAAE,OAAiB,EAAE,MAAiB;QACnD,OAAO,IAAI,CAAC,cAAc,CACxB,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAClF,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAClF,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAAC,IAAkB,EAAE,UAAkB,EAAE,IAAkB,EAAE,CAAS;QACpG,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAClC,CAAC,IAAI,CAAC,CAAC;QACP,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACrC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAC7B,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAC9C,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;QAE9C,OAAO,gCAAkB,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9E,CAAC;CACF;AApaD,kCAoaC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Numerics\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { WritableXAndY, XAndY } from \"../geometry3d/XYZProps\";\nimport { Point4d } from \"../geometry4d/Point4d\";\nimport { BilinearPolynomial } from \"./Polynomials\";\n\n// cspell:word XYUV\n\n/**\n * static methods for commonly appearing sets of equations in 2 or 3 variables\n * @public\n */\nexport class SmallSystem {\n  /**\n   * Intersect two transverse 2D lines.\n   * * If the lines are parallel and overlap, the returned intersection is of dubious use.\n   * @param a0 start point of line A\n   * @param aDir direction vector of line A\n   * @param b0 start point of line B\n   * @param bDir direction vector of line B\n   * @returns intersection fractions, `x` along line A and `y` along line B; or `undefined` if no intersection.\n   * @see [[lineSegmentXYUVOverlapUnbounded]], [[lineSegmentXYUVIntersectionUnbounded]]\n   */\n  public static lineXYUVTransverseIntersection(a0: XAndY, aDir: XAndY, b0: XAndY, bDir: XAndY): WritableXAndY | undefined {\n    const cx = b0.x - a0.x;\n    const cy = b0.y - a0.y;\n    const aCrossB = Geometry.crossProductXYXY(aDir.x, aDir.y, bDir.x, bDir.y);\n    const cCrossB = Geometry.crossProductXYXY(cx, cy, bDir.x, bDir.y);\n    const cCrossA = Geometry.crossProductXYXY(cx, cy, aDir.x, aDir.y);\n    const x = Geometry.conditionalDivideFraction(cCrossB, aCrossB);\n    const y = Geometry.conditionalDivideFraction(cCrossA, aCrossB);\n    if (x !== undefined && y !== undefined)\n      return { x, y };\n    return undefined;\n  }\n\n  /**\n   * Return true if lines (a0,a1) to (b0, b1) have a simple intersection.\n   * Return the fractional (not xy) coordinates in result.x, result.y.\n   * @param a0 start point of line A\n   * @param a1 end point of line A\n   * @param b0 start point of line B\n   * @param b1 end point of line B\n   * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.\n   */\n  public static lineSegment2dXYTransverseIntersectionUnbounded(a0: Point2d, a1: Point2d, b0: Point2d, b1: Point2d, result: Vector2d): boolean {\n    const ux = a1.x - a0.x;\n    const uy = a1.y - a0.y;\n    const vx = b1.x - b0.x;\n    const vy = b1.y - b0.y;\n    return this.lineSegmentXYUVTransverseIntersectionUnbounded(a0.x, a0.y, ux, uy, b0.x, b0.y, vx, vy, result);\n  }\n\n  /**\n   * Return true if the lines have a simple intersection.\n   * * Points (ax0,ay0) to (ax0+ux,ay0+uy) are at fractions 0 and 1 of line A.\n   * * Points (bx0,by0) to (bx0+vx,by0+vy) are at fractions 0 and 1 of line B.\n   * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.\n   */\n  public static lineSegmentXYUVTransverseIntersectionUnbounded(ax0: number, ay0: number, ux: number, uy: number, bx0: number, by0: number, vx: number, vy: number, result: Vector2d): boolean {\n    const transverse = this.lineXYUVTransverseIntersection({ x: ax0, y: ay0 }, { x: ux, y: uy } , { x: bx0, y: by0 }, { x: vx, y: vy });\n    if (transverse) {\n      result.set(transverse.x, transverse.y);\n      return true;\n    }\n    result.set(0, 0);\n    return false;\n  }\n\n  /**\n   * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts.\n   * @param a0 start point of line A\n   * @param a1 end point of line A\n   * @param b0 start point of line B\n   * @param b1 end point of line B\n   * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.\n   */\n  public static lineSegment3dXYTransverseIntersectionUnbounded(a0: Point3d, a1: Point3d, b0: Point3d, b1: Point3d, result: Vector2d): boolean {\n    const ux = a1.x - a0.x;\n    const uy = a1.y - a0.y;\n    const vx = b1.x - b0.x;\n    const vy = b1.y - b0.y;\n    return this.lineSegmentXYUVTransverseIntersectionUnbounded(a0.x, a0.y, ux, uy, b0.x, b0.y, vx, vy, result);\n  }\n\n  /**\n   * Intersect two overlapping unbounded 2D lines.\n   * @param a0 start point of line A\n   * @param aDir direction vector of line A; end point of line segment A is `a0 + aDir`\n   * @param b0 start point of line B\n   * @param bDir direction vector of line B; end point of line segment B is `b0 + bDir`\n   * @param tol overlap distance tolerance\n   * @returns `undefined` if the lines have a simple (transverse) intersection, or are parallel without overlap.\n   * Otherwise, return the fractions at which each segment overlaps the other line:\n   * * segment B maps to fractions in the range f0.x < f1.x on line A.\n   * * segment A maps to fractions in the range f0.y < f1.y on line B.\n   * @see [[lineXYUVTransverseIntersection]], [[lineSegmentXYUVIntersectionUnbounded]]\n   */\n  public static lineSegmentXYUVOverlapUnbounded(\n    a0: XAndY, aDir: XAndY,\n    b0: XAndY, bDir: XAndY,\n    tol: number = Geometry.smallMetricDistance\n  ): { f0: WritableXAndY, f1: WritableXAndY } | undefined {\n    const tol2 = tol * tol;\n    const projectToSegment = (s: XAndY, e0: XAndY, eDir: XAndY): { f: number, p: XAndY } => {\n      const eDotE = Geometry.dotProductXYXY(eDir.x, eDir.y, eDir.x, eDir.y);\n      const sDotE = Geometry.dotProductXYXY(s.x - e0.x, s.y - e0.y, eDir.x, eDir.y);\n      const f = Geometry.safeDivideFraction(sDotE, eDotE, 0.0);\n      return { f, p: { x: e0.x + f * eDir.x, y: e0.y + f * eDir.y } };\n    };\n    const a0OnB = projectToSegment(a0, b0, bDir);\n    if (Geometry.distanceSquaredXYXY(a0.x, a0.y, a0OnB.p.x, a0OnB.p.y) > tol2)\n      return undefined;\n    const a1x = a0.x + aDir.x;\n    const a1y = a0.y + aDir.y;\n    const a1OnB = projectToSegment({ x: a1x, y: a1y }, b0, bDir);\n    if (Geometry.distanceSquaredXYXY(a1x, a1y, a1OnB.p.x, a1OnB.p.y) > tol2)\n      return undefined;\n    const b0OnA = projectToSegment(b0, a0, aDir);\n    if (Geometry.distanceSquaredXYXY(b0.x, b0.y, b0OnA.p.x, b0OnA.p.y) > tol2)\n      return undefined;\n    const b1x = b0.x + bDir.x;\n    const b1y = b0.y + bDir.y;\n    const b1OnA = projectToSegment({ x: b1x, y: b1y }, a0, aDir);\n    if (Geometry.distanceSquaredXYXY(b1x, b1y, b1OnA.p.x, b1OnA.p.y) > tol2)\n      return undefined;\n    if (b0OnA.f > b1OnA.f)\n      [b0OnA.f, b1OnA.f] = [b1OnA.f, b0OnA.f];\n    if (a0OnB.f > a1OnB.f)\n      [a0OnB.f, a1OnB.f] = [a1OnB.f, a0OnB.f];\n    return { f0: { x: b0OnA.f, y: a0OnB.f }, f1: { x: b1OnA.f, y: a1OnB.f } };\n  }\n\n  /**\n   * Intersect two transverse or overlapping unbounded 2D line segments.\n   * @param a0 start point of line A\n   * @param aDir direction vector of line A; end point of line segment A is `a0 + aDir`\n   * @param b0 start point of line B\n   * @param bDir direction vector of line B; end point of line segment B is `b0 + bDir`\n   * @param tol overlap distance tolerance\n   * @returns intersection fractions:\n   * * If `f1` is undefined, the intersection occurs at fraction f0.x along line A and f0.y along line B.\n   * * If `f1` is defined, the line segments are parallel and overlap:\n   * segment B maps to fractions in the range f0.x < f1.x on line A;\n   * segment A maps to fractions in the range f0.y < f1.y on line B.\n   * * If `undefined`, the lines are parallel without overlap.\n   */\n  public static lineSegmentXYUVIntersectionUnbounded(\n    a0: XAndY, aDir: XAndY,\n    b0: XAndY, bDir: XAndY,\n    tol: number = Geometry.smallMetricDistance\n  ): { f0: WritableXAndY, f1?: WritableXAndY } | undefined {\n    // Normal practice is to do the (quick, simple) transverse intersection first, but the transverse intersector's\n    // notion of coincidence is based on the determinant ratios, which are hard to relate to physical tolerance.\n    // So do the overlap first. This should do a quick exit in non-coincident case.\n    const overlap = this.lineSegmentXYUVOverlapUnbounded(a0, aDir, b0, bDir, tol);\n    if (overlap)\n      return overlap;\n    const transverse = this.lineXYUVTransverseIntersection(a0, aDir, b0, bDir);\n    if (transverse)\n      return { f0: transverse };\n    return undefined;\n  }\n\n  /**\n   * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts of WEIGHTED 4D Points\n   * @param hA0 homogeneous start point of line A\n   * @param hA1 homogeneous end point of line A\n   * @param hB0 homogeneous start point of line B\n   * @param hB1 homogeneous end point of line B\n   * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.\n   */\n  public static lineSegment3dHXYTransverseIntersectionUnbounded(hA0: Point4d, hA1: Point4d, hB0: Point4d, hB1: Point4d, result?: Vector2d): Vector2d | undefined {\n    // Considering only x,y,w parts....\n    // Point Q along B is (in full homogeneous)  `(1-lambda) B0 + lambda 1`\n    // PointQ is colinear with A0,A1 when the determinant det (A0,A1,Q) is zero.  (Each column takes xyw parts)\n    const alpha0 = Geometry.tripleProduct(\n      hA0.x, hA1.x, hB0.x,\n      hA0.y, hA1.y, hB0.y,\n      hA0.w, hA1.w, hB0.w);\n    const alpha1 = Geometry.tripleProduct(\n      hA0.x, hA1.x, hB1.x,\n      hA0.y, hA1.y, hB1.y,\n      hA0.w, hA1.w, hB1.w);\n    const fractionB = Geometry.conditionalDivideFraction(-alpha0, alpha1 - alpha0);\n    if (fractionB !== undefined) {\n      const beta0 = Geometry.tripleProduct(\n        hB0.x, hB1.x, hA0.x,\n        hB0.y, hB1.y, hA0.y,\n        hB0.w, hB1.w, hA0.w);\n      const beta1 = Geometry.tripleProduct(\n        hB0.x, hB1.x, hA1.x,\n        hB0.y, hB1.y, hA1.y,\n        hB0.w, hB1.w, hA1.w);\n      const fractionA = Geometry.conditionalDivideFraction(-beta0, beta1 - beta0);\n      if (fractionA !== undefined)\n        return Vector2d.create(fractionA, fractionB, result);\n    }\n    return undefined;\n  }\n\n  /**\n   * Return the line fraction at which the (homogeneous) line is closest to a space point as viewed in xy only.\n   * @param hA0 homogeneous start point of the line\n   * @param hA1 homogeneous end point of the line\n   * @param spacePoint homogeneous point in space\n   */\n  public static lineSegment3dHXYClosestPointUnbounded(hA0: Point4d, hA1: Point4d, spacePoint: Point4d): number | undefined {\n    // Considering only x,y,w parts.\n    // weighted difference of (A1 w0 - A0 w1) is (cartesian) tangent vector along the line as viewed.\n    // The perpendicular (pure vector) W = (-y,x) flip is the direction of projection.\n    // Point Q along A is (in full homogeneous) `(1-lambda) A0 + lambda 1 A1`.\n    // PointQ is colinear with spacePoint and and W when the xyw homogeneous determinant | Q W spacePoint | is zero.\n    const tx = hA1.x * hA0.w - hA0.x * hA1.w;\n    const ty = hA1.y * hA0.w - hA0.y * hA1.w;\n    const det0 = Geometry.tripleProduct(\n      hA0.x, -ty, spacePoint.x,\n      hA0.y, tx, spacePoint.y,\n      hA0.w, 0, spacePoint.w,\n    );\n    const det1 = Geometry.tripleProduct(\n      hA1.x, -ty, spacePoint.x,\n      hA1.y, tx, spacePoint.y,\n      hA1.w, 0, spacePoint.w,\n    );\n    return Geometry.conditionalDivideFraction(-det0, det1 - det0);\n  }\n\n  /**\n   * Return the line fraction at which the line is closest to a space point as viewed in xy only.\n   * @param pointA0 start point\n   * @param pointA1 end point\n   * @param spacePoint point in space\n   */\n  public static lineSegment3dXYClosestPointUnbounded(pointA0: XAndY, pointA1: XAndY, spacePoint: XAndY): number | undefined {\n    // Considering only x,y parts....\n    const ux = pointA1.x - pointA0.x;\n    const uy = pointA1.y - pointA0.y;\n    const uu = ux * ux + uy * uy;\n    const vx = spacePoint.x - pointA0.x;\n    const vy = spacePoint.y - pointA0.y;\n    const uv = ux * vx + uy * vy;\n    return Geometry.conditionalDivideFraction(uv, uu);\n  }\n\n  /**\n   * Return the line fraction at which the line is closest to a space point\n   * @param pointA0 start point\n   * @param pointA1 end point\n   * @param spacePoint point in space\n   */\n  public static lineSegment3dClosestPointUnbounded(pointA0: Point3d, pointA1: Point3d, spacePoint: Point3d): number | undefined {\n    const ux = pointA1.x - pointA0.x;\n    const uy = pointA1.y - pointA0.y;\n    const uz = pointA1.z - pointA0.z;\n    const uu = ux * ux + uy * uy + uz * uz;\n    const vx = spacePoint.x - pointA0.x;\n    const vy = spacePoint.y - pointA0.y;\n    const vz = spacePoint.z - pointA0.z;\n    const uv = ux * vx + uy * vy + uz * vz;\n    return Geometry.conditionalDivideFraction(uv, uu);\n  }\n\n  /**\n   * Return true if lines (a0,a1) to (b0, b1) have closest approach (go by each other) in 3d\n   * @param a0 start point of line A\n   * @param a1 end point of line A\n   * @param b0 start point of line B\n   * @param b1 end point of line B\n   * @param result vector to receive fractional coordinates of closest approach: result.x is fraction on line A, result.y is fraction on line B.\n   */\n  public static lineSegment3dClosestApproachUnbounded(a0: Point3d, a1: Point3d, b0: Point3d, b1: Point3d,\n    result: Vector2d): boolean {\n    return this.ray3dXYZUVWClosestApproachUnbounded(\n      a0.x, a0.y, a0.z,\n      a1.x - a0.x, a1.y - a0.y, a1.z - a0.z,\n      b0.x, b0.y, b0.z,\n      b1.x - b0.x, b1.y - b0.y, b1.z - b0.z,\n      result);\n  }\n  /**\n   * Return true if the given rays have closest approach (go by each other) in 3d\n   * @param ax x-coordinate of the origin of the first ray\n   * @param ay y-coordinate of the origin of the first ray\n   * @param az z-coordinate of the origin of the first ray\n   * @param au x-coordinate of the direction vector of the first ray\n   * @param av y-coordinate of the direction vector of the first ray\n   * @param aw z-coordinate of the direction vector of the first ray\n   * @param bx x-coordinate of the origin of the second ray\n   * @param by y-coordinate of the origin of the second ray\n   * @param bz z-coordinate of the origin of the second ray\n   * @param bu x-coordinate of the direction vector of the second ray\n   * @param bv y-coordinate of the direction vector of the second ray\n   * @param bw z-coordinate of the direction vector of the second ray\n   * @param result vector to receive fractional coordinates of intersection: result.x is fraction on line A, result.y is fraction on line B.\n   */\n  public static ray3dXYZUVWClosestApproachUnbounded(\n    ax: number, ay: number, az: number, au: number, av: number, aw: number,\n    bx: number, by: number, bz: number, bu: number, bv: number, bw: number,\n    result: Vector2d): boolean {\n\n    const cx = bx - ax;\n    const cy = by - ay;\n    const cz = bz - az;\n\n    const uu = Geometry.hypotenuseSquaredXYZ(au, av, aw);\n    const vv = Geometry.hypotenuseSquaredXYZ(bu, bv, bw);\n    const uv = Geometry.dotProductXYZXYZ(au, av, aw, bu, bv, bw);\n    const cu = Geometry.dotProductXYZXYZ(cx, cy, cz, au, av, aw);\n    const cv = Geometry.dotProductXYZXYZ(cx, cy, cz, bu, bv, bw);\n    return SmallSystem.linearSystem2d(uu, -uv, uv, -vv, cu, cv, result);\n  }\n  /**\n   * Solve the pair of linear equations\n   * * `ux * x + vx * y = cx`\n   * * `uy * x + vy * y = cy`\n   * @param ux xx coefficient\n   * @param vx xy coefficient\n   * @param uy yx coefficient\n   * @param vy yy coefficient\n   * @param cx x right hand side\n   * @param cy y right hand side\n   * @param result (x,y) solution (MUST be preallocated by caller)\n   */\n  public static linearSystem2d(\n    ux: number, vx: number, // first row of matrix\n    uy: number, vy: number, // second row of matrix\n    cx: number, cy: number, // right side\n    result: Vector2d,\n  ): boolean {\n    const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n    const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n    const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n    const s = Geometry.conditionalDivideFraction(cv, uv);\n    const t = Geometry.conditionalDivideFraction(cu, uv);\n    if (s !== undefined && t !== undefined) {\n      result.set(s, t);\n      return true;\n    }\n    result.set(0, 0);\n    return false;\n  }\n  /**\n   * Solve a linear system:\n   * * x equation: `axx * u + axy * v + axz * w = cx`\n   * * y equation: `ayx * u + ayy * v + ayz * w = cy`\n   * * z equation: `azx * u + azy * v + azz * w = cz`\n   * @param axx row 0, column 0 coefficient\n   * @param axy row 0, column 1 coefficient\n   * @param axz row 0, column 1 coefficient\n   * @param ayx row 1, column 0 coefficient\n   * @param ayy row 1, column 1 coefficient\n   * @param ayz row 1, column 2 coefficient\n   * @param azx row 2, column 0 coefficient\n   * @param azy row 2, column 1 coefficient\n   * @param azz row 2, column 2 coefficient\n   * @param cx right hand side row 0 coefficient\n   * @param cy right hand side row 1 coefficient\n   * @param cz right hand side row 2 coefficient\n   * @param result optional result.\n   * @returns solution vector (u,v,w) or `undefined` if system is singular.\n   */\n  public static linearSystem3d(\n    axx: number, axy: number, axz: number, // first row of matrix\n    ayx: number, ayy: number, ayz: number, // second row of matrix\n    azx: number, azy: number, azz: number, // second row of matrix\n    cx: number, cy: number, cz: number,    // right side\n    result?: Vector3d,\n  ): Vector3d | undefined {\n    // determinants of various combinations of columns ...\n    const detXYZ = Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, axz, ayz, azz);\n    const detCYZ = Geometry.tripleProduct(cx, cy, cz, axy, ayy, azy, axz, ayz, azz);\n    const detXCZ = Geometry.tripleProduct(axx, ayx, azx, cx, cy, cz, axz, ayz, azz);\n    const detXYC = Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, cx, cy, cz);\n    const s = Geometry.conditionalDivideFraction(detCYZ, detXYZ);\n    const t = Geometry.conditionalDivideFraction(detXCZ, detXYZ);\n    const u = Geometry.conditionalDivideFraction(detXYC, detXYZ);\n    if (s !== undefined && t !== undefined && u !== undefined) {\n      return Vector3d.create(s, t, u, result);\n    }\n    return undefined;\n  }\n  /**\n   * Compute the intersection of three planes.\n   * @param xyzA point on the first plane\n   * @param normalA normal of the first plane\n   * @param xyzB point on the second plane\n   * @param normalB normal of the second plane\n   * @param xyzC point on the third plane\n   * @param normalC normal of the third plane\n   * @param result optional result\n   * @returns intersection point of the three planes (as a Vector3d), or undefined if at least two planes are parallel.\n   */\n  public static intersect3Planes(\n    xyzA: Point3d, normalA: Vector3d,\n    xyzB: Point3d, normalB: Vector3d,\n    xyzC: Point3d, normalC: Vector3d, result?: Vector3d): Vector3d | undefined {\n    return this.linearSystem3d(\n      normalA.x, normalA.y, normalA.z,\n      normalB.x, normalB.y, normalB.z,\n      normalC.x, normalC.y, normalC.z,\n      Geometry.dotProductXYZXYZ(xyzA.x, xyzA.y, xyzA.z, normalA.x, normalA.y, normalA.z),\n      Geometry.dotProductXYZXYZ(xyzB.x, xyzB.y, xyzB.z, normalB.x, normalB.y, normalB.z),\n      Geometry.dotProductXYZXYZ(xyzC.x, xyzC.y, xyzC.z, normalC.x, normalC.y, normalC.z), result);\n  }\n\n  /**\n   * In rowB, replace `rowB[j] += a * rowB[pivot] * rowA[j] / rowA[pivot]` for `j > pivot`\n   * @param rowA row that does not change\n   * @param pivotIndex index of pivot (divisor) in rowA.\n   * @param rowB row where elimination occurs.\n   */\n  public static eliminateFromPivot(rowA: Float64Array, pivotIndex: number, rowB: Float64Array, a: number): boolean {\n    const n = rowA.length;\n    let q = Geometry.conditionalDivideFraction(rowB[pivotIndex], rowA[pivotIndex]);\n    if (q === undefined) return false;\n    q *= a;\n    for (let j = pivotIndex + 1; j < n; j++)\n      rowB[j] += q * rowA[j];\n    return true;\n  }\n  /**\n   * Solve a pair of bilinear equations\n   * * First equation: `a0 + b0 * u + c0 * v + d0 * u * v = 0`\n   * * Second equation: `a1 + b1 * u + c1 * v + d1 * u * v = 0`\n   */\n  public static solveBilinearPair(\n    a0: number, b0: number, c0: number, d0: number,\n    a1: number, b1: number, c1: number, d1: number,\n  ): Point2d[] | undefined {\n    return BilinearPolynomial.solveBilinearPair(a0, b0, c0, d0, a1, b1, c1, d1);\n  }\n}\n"]}

package/lib/cjs/polyface/FacetOrientation.d.ts

@@ -11,7 +11,7 @@ export declare class FacetOrientationFixup {
     private constructor();
     private edgeIdToFacetOrientation;
     /**
-     * RETURN FALSE IF ANY EDGE HAS 3 ORE MORE FACETS
+     * RETURN FALSE IF ANY EDGE HAS 3 OR MORE FACETS
      */
     private setupUnoriented;
     private recordFacetInComponent;

package/lib/cjs/polyface/FacetOrientation.js

@@ -50,7 +50,7 @@ class FacetOrientationFixup {
         return this._facetOrientation[facetIndex];
     }
     /**
-     * RETURN FALSE IF ANY EDGE HAS 3 ORE MORE FACETS
+     * RETURN FALSE IF ANY EDGE HAS 3 OR MORE FACETS
      */
     setupUnoriented() {
         this._edges.sort();

package/lib/cjs/polyface/FacetOrientation.js.map

@@ -1 +1 @@
-{"version":3,"file":"FacetOrientation.js","sourceRoot":"","sources":["../../../src/polyface/FacetOrientation.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,6DAAwE;AAExE,mDAAgD;AAEhD,MAAM,qBAAqB;IAClB,WAAW,CAAS;IACpB,WAAW,CAAS;IACpB,cAAc,CAAS;IAC9B,YAAmB,cAAsB;QACvC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACxC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACvC,CAAC;IACD,oCAAoC;IAC7B,iBAAiB,CAAC,WAAmB;QAC1C,IAAI,WAAW,GAAG,CAAC;YACjB,IAAI,CAAC,WAAW,EAAE,CAAC;aAChB,IAAI,WAAW,GAAG,CAAC;YACtB,IAAI,CAAC,WAAW,EAAE,CAAC;IACvB,CAAC;CACF;AACD,MAAa,qBAAqB;IACxB,MAAM,CAAqB;IAC3B,kBAAkB,CAAW;IAC7B,sBAAsB,CAAW;IACjC,4BAA4B,CAAW;IACvC,iBAAiB,CAAW;IAC5B,WAAW,CAA0B;IACrC,QAAQ,CAAkB;IAC1B,KAAK,CAAkB,CAAC,sFAAsF;IACtH,YAAoB,IAAqB;QACvC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,GAAG,6BAAa,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9D,IAAI,CAAC,kBAAkB,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,sBAAsB,GAAG,EAAE,CAAC;QACjC,IAAI,CAAC,4BAA4B,GAAG,EAAE,CAAC;QACvC,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAEO,wBAAwB,CAAC,MAAc;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC;QACxD,OAAO,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAC5C,CAAC;IACD;;OAEG;IACK,eAAe;QACrB,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACpC,0DAA0D;QAC1D,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YACnD,IAAI,UAAU,GAAG,aAAa;gBAC5B,aAAa,GAAG,UAAU,CAAC;YAC7B,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,4DAA4D;QAC5D,qFAAqF;QACrF,uDAAuD;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YACnD,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACxD,IAAI,CAAC,KAAK,CAAC,CAAC;gBACV,IAAI,CAAC,4BAA4B,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;iBAC/C,CAAC;gBACJ,qBAAqB,CAAC,WAAW,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QACD,6DAA6D;QAC7D,0CAA0C;QAC1C,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,QAAQ,EAAE,UAAU,EAAE,EAAE,CAAC;YAC7D,IAAI,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC;YAChC,OAAO,UAAU,GAAG,QAAQ,IAAI,iCAAY,CAAC,qBAAqB,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;gBACjH,uBAAuB;gBACvB,qBAAqB,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;gBACnF,UAAU,EAAE,CAAC;YACf,CAAC;YACD,iEAAiE;YACjE,IAAI,UAAU,GAAG,UAAU,GAAG,CAAC;gBAC7B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACO,sBAAsB,CAAC,UAAkB,EAAE,WAAmB;QACpE,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpE,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC;QACjD,aAAa,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAC/C,CAAC;IAEO,mBAAmB,CAAC,SAAiB;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,UAAU,CAAC;QAC3D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,qBAAqB,CAAC,SAAS,CAAC,CAAC,CAAC;QAC5D,IAAI,CAAC,sBAAsB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IACO,UAAU,GAAa,EAAE,CAAC;IAE1B,qBAAqB,CAAC,QAAgB,EAAE,KAAe;QAC7D,qBAAqB,CAAC,oBAAoB,CAAC,IAAI,CAAC,sBAAsB,EAAE,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACnG,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,OAAO;QACb,iCAAiC;QACjC,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACpC,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;QAClC,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,KAAK,IAAI,aAAa,GAAG,CAAC,EAAE,aAAa,GAAG,QAAQ,EAAE,aAAa,EAAE,EAAE,CAAC;YACtE,IAAI,IAAI,CAAC,wBAAwB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;gBACrB,IAAI,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;gBACxC,IAAI,CAAC,qBAAqB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;gBACrD,yDAAyD;gBACzD,iDAAiD;gBACjD,IAAI,aAAiC,CAAC;gBACtC,OAAO,SAAS,KAAK,CAAC,aAAa,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBACvD,MAAM,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC,CAAC,UAAU,CAAC;oBACtD,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;oBAC1D,qBAAqB,CAAC,oBAAoB,CAAC,IAAI,CAAC,kBAAkB,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;oBAClG,KAAK,MAAM,iBAAiB,IAAI,aAAa,EAAE,CAAC;wBAC9C,IAAI,iBAAiB,KAAK,aAAa,EAAE,CAAC;4BACxC,MAAM,aAAa,GAAG,SAAS,CAAC,iBAAiB,CAAC,CAAC,UAAU,CAAC;4BAC9D,MAAM,mBAAmB,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;4BAClE,IAAI,mBAAmB,KAAK,CAAC,EAAE,CAAC;gCAC9B,8BAA8B;gCAC9B,sEAAsE;gCACtE,MAAM,cAAc,GAAG,iCAAY,CAAC,mBAAmB,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;gCACrJ,IAAI,CAAC,sBAAsB,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;gCAC3D,IAAI,CAAC,qBAAqB,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;gCACzD,qBAAqB,CAAC,WAAW,CAAC,IAAI,CAAC,sBAAsB,EAAE,aAAa,EAAE,iBAAiB,CAAC,CAAC;4BACnG,CAAC;iCAAM,CAAC;gCACN,gDAAgD;gCAChD,MAAM,eAAe,GAAG,iCAAY,CAAC,mBAAmB,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC;gCACjH,IAAI,eAAe,GAAG,eAAe,GAAG,mBAAmB,GAAG,CAAC;oCAC7D,OAAO,KAAK,CAAC;4BACjB,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,0FAA0F;QAC1F,OAAO,IAAI,CAAC;IACd,CAAC;IACO,gBAAgB;QACtB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,eAAe,EAAE,GAAG,CAAC;YAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YACpD,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3C,UAAU,EAAE,CAAC;gBACb,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IACM,MAAM,CAAC,OAAO,CAAC,IAAqB;QACzC,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;QAC7B,IAAI,EAAE;YACJ,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD;;OAEG;IACK,MAAM,CAAC,WAAW,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS;QAC7D,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,CAAC;IACD;;;OAGG;IACK,MAAM,CAAC,oBAAoB,CAAC,IAAc,EAAE,MAAc,EAAE,WAAqB;QACvF,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,MAAM,CAAC;QACf,GAAG,CAAC;YACF,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC,QAAQ,CAAC,KAAK,MAAM,EAAE;IACzB,CAAC;CACF;AAlLD,sDAkLC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Polyface\n */\nimport { IndexedEdgeMatcher, SortableEdge } from \"./IndexedEdgeMatcher\";\nimport { IndexedPolyface, PolyfaceVisitor } from \"./Polyface\";\nimport { PolyfaceQuery } from \"./PolyfaceQuery\";\n\nclass OrientedComponentData {\n  public numPositive: number;\n  public numNegative: number;\n  public firstEdgeIndex: number;\n  public constructor(firstEdgeIndex: number) {\n    this.numPositive = this.numNegative = 0;\n    this.firstEdgeIndex = firstEdgeIndex;\n  }\n  // announce a new facet orientation.\n  public recordOrientation(orientation: number) {\n    if (orientation > 0)\n      this.numPositive++;\n    else if (orientation < 0)\n      this.numNegative++;\n  }\n}\nexport class FacetOrientationFixup {\n  private _edges: IndexedEdgeMatcher;\n  private _edgeToPartnerEdge: number[];\n  private _edgeToEdgeInComponent: number[];\n  private _facetToFirstEdgeInComponent: number[];\n  private _facetOrientation: number[];\n  private _components: OrientedComponentData[];\n  private _visitor: PolyfaceVisitor;\n  private _mesh: IndexedPolyface; // we could get by with just a Polyface/Visitor but for the call to reverseSingleFacet\n  private constructor(mesh: IndexedPolyface) {\n    this._visitor = mesh.createVisitor(1);\n    this._edges = PolyfaceQuery.createIndexedEdges(this._visitor);\n    this._edgeToPartnerEdge = [];\n    this._edgeToEdgeInComponent = [];\n    this._facetToFirstEdgeInComponent = [];\n    this._facetOrientation = [];\n    this._components = [];\n    this._mesh = mesh;\n  }\n\n  private edgeIdToFacetOrientation(edgeId: number): number {\n    const facetIndex = this._edges.edges[edgeId].facetIndex;\n    return this._facetOrientation[facetIndex];\n  }\n  /**\n   * RETURN FALSE IF ANY EDGE HAS 3 ORE MORE FACETS\n   */\n  private setupUnoriented(): boolean {\n    this._edges.sort();\n    const edgeArray = this._edges.edges;\n    // make each edge a singleton with itself as successor . .\n    let maxFacetIndex = -1;\n    const numEdges = this._edges.edges.length;\n    for (let i = 0; i < numEdges; i++) {\n      const facetIndex = this._edges.edges[i].facetIndex;\n      if (facetIndex > maxFacetIndex)\n        maxFacetIndex = facetIndex;\n      this._edgeToEdgeInComponent.push(i);\n      this._edgeToPartnerEdge.push(i);\n    }\n    for (let i = 0; i <= maxFacetIndex; i++) {\n      this._facetToFirstEdgeInComponent.push(-1);\n      this._facetOrientation.push(0);\n    }\n    // make each edge part of a component for only its own facet\n    // (This component exists only ephemerally -- it is not referenced by true component)\n    // (swapping entries in the cyclic loops merges loops.)\n    for (let i = 0; i < numEdges; i++) {\n      const facetIndex = this._edges.edges[i].facetIndex;\n      const j = this._facetToFirstEdgeInComponent[facetIndex];\n      if (j === -1)\n        this._facetToFirstEdgeInComponent[facetIndex] = i;\n      else {\n        FacetOrientationFixup.swapEntries(this._edgeToEdgeInComponent, i, j);\n      }\n    }\n    // make contiguous partner edges cycles in edgeToPartnerEdge.\n    // edge i is initially always a singleton.\n    for (let edgeIndex0 = 0; edgeIndex0 < numEdges; edgeIndex0++) {\n      let edgeIndex1 = edgeIndex0 + 1;\n      while (edgeIndex1 < numEdges && SortableEdge.areUndirectedPartners(edgeArray[edgeIndex0], edgeArray[edgeIndex1])) {\n        // splice the loops ...\n        FacetOrientationFixup.swapEntries(this._edgeToPartnerEdge, edgeIndex0, edgeIndex1);\n        edgeIndex1++;\n      }\n      // BUT .. everything else will fail if more than 2 anywhere .....\n      if (edgeIndex1 > edgeIndex0 + 2)\n        return false;\n    }\n    return true;\n  }\n  private recordFacetInComponent(facetIndex: number, orientation: number) {\n    const componentData = this._components[this._components.length - 1];\n    this._facetOrientation[facetIndex] = orientation;\n    componentData.recordOrientation(orientation);\n  }\n\n  private initializeComponent(edgeIndex: number) {\n    const facetIndex = this._edges.edges[edgeIndex].facetIndex;\n    this._components.push(new OrientedComponentData(edgeIndex));\n    this.recordFacetInComponent(facetIndex, 1);\n  }\n  private _workArray: number[] = [];\n\n  private pushFacetEdgesOnStack(seedEdge: number, stack: number[]) {\n    FacetOrientationFixup.extractCyclicIndices(this._edgeToEdgeInComponent, seedEdge, this._workArray);\n    for (const edgeIndex of this._workArray) {\n      stack.push(edgeIndex);\n    }\n  }\n  /**\n   * * Run flood search from every possible seed, assigning positive and negative orientations\n   * * Halt and return false if flood detects Klein bottle effects.\n   * @return true if flood\n   */\n  private doFlood(): boolean {\n    // Finally time for flood search.\n    const edgeStack: number[] = [];\n    const edgeArray = this._edges.edges;\n    const numEdges = edgeArray.length;\n    const neighborEdges: number[] = [];\n    for (let seedEdgeIndex = 0; seedEdgeIndex < numEdges; seedEdgeIndex++) {\n      if (this.edgeIdToFacetOrientation(seedEdgeIndex) === 0) {\n        edgeStack.length = 0;\n        this.initializeComponent(seedEdgeIndex);\n        this.pushFacetEdgesOnStack(seedEdgeIndex, edgeStack);\n        // An edge on the stack is part of the current component.\n        // Its partners may or may not have been visited.\n        let baseEdgeIndex: number | undefined;\n        while (undefined !== (baseEdgeIndex = edgeStack.pop())) {\n          const baseFacet = edgeArray[baseEdgeIndex].facetIndex;\n          const baseOrientation = this._facetOrientation[baseFacet];\n          FacetOrientationFixup.extractCyclicIndices(this._edgeToPartnerEdge, baseEdgeIndex, neighborEdges);\n          for (const neighborEdgeIndex of neighborEdges) {\n            if (neighborEdgeIndex !== baseEdgeIndex) {\n              const neighborFacet = edgeArray[neighborEdgeIndex].facetIndex;\n              const neighborOrientation = this._facetOrientation[neighborFacet];\n              if (neighborOrientation === 0) {\n                // first visit to this facet !\n                // orientations of baseEdge and neighborEdge tell us how to orient it.\n                const newOrientation = SortableEdge.areDirectedPartners(edgeArray[baseEdgeIndex], edgeArray[neighborEdgeIndex]) ? baseOrientation : -baseOrientation;\n                this.recordFacetInComponent(neighborFacet, newOrientation);\n                this.pushFacetEdgesOnStack(neighborEdgeIndex, edgeStack);\n                FacetOrientationFixup.swapEntries(this._edgeToEdgeInComponent, baseEdgeIndex, neighborEdgeIndex);\n              } else {\n                // looking across to an already-visited facet ..\n                const edgeOrientation = SortableEdge.relativeOrientation(edgeArray[baseEdgeIndex], edgeArray[neighborEdgeIndex]);\n                if (edgeOrientation * baseOrientation * neighborOrientation > 0)\n                  return false;\n              }\n            }\n          }\n        }\n      }\n    }\n    // fall through when floods have completed in all components, with no Klein bottle effects\n    return true;\n  }\n  private doFacetReversals(): number {\n    let numReverse = 0;\n    for (this._visitor.reset(); this._visitor.moveToNextFacet();) {\n      const facetIndex = this._visitor.currentReadIndex();\n      if (this._facetOrientation[facetIndex] < 0) {\n        numReverse++;\n        this._mesh.reverseSingleFacet(facetIndex);\n      }\n    }\n    return numReverse;\n  }\n  public static doFixup(mesh: IndexedPolyface): boolean {\n    const context = new FacetOrientationFixup(mesh);\n    if (!context.setupUnoriented())\n      return false;\n    const ok = context.doFlood();\n    if (ok)\n      context.doFacetReversals();\n    return ok;\n  }\n  /** swap entries at indices in a number array.\n   * * indices are not checked for validity.\n   */\n  private static swapEntries(data: number[], i: number, j: number) {\n    const q = data[i];\n    data[i] = data[j];\n    data[j] = q;\n  }\n  /**\n   *\n   * @param data an array of cyclically linked loops.\n   */\n  private static extractCyclicIndices(data: number[], index0: number, loopIndices: number[]) {\n    loopIndices.length = 0;\n    let i = index0;\n    do {\n      loopIndices.push(i);\n      i = data[i];\n    } while (i !== index0);\n  }\n}\n"]}
+{"version":3,"file":"FacetOrientation.js","sourceRoot":"","sources":["../../../src/polyface/FacetOrientation.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,6DAAwE;AAExE,mDAAgD;AAEhD,MAAM,qBAAqB;IAClB,WAAW,CAAS;IACpB,WAAW,CAAS;IACpB,cAAc,CAAS;IAC9B,YAAmB,cAAsB;QACvC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACxC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACvC,CAAC;IACD,oCAAoC;IAC7B,iBAAiB,CAAC,WAAmB;QAC1C,IAAI,WAAW,GAAG,CAAC;YACjB,IAAI,CAAC,WAAW,EAAE,CAAC;aAChB,IAAI,WAAW,GAAG,CAAC;YACtB,IAAI,CAAC,WAAW,EAAE,CAAC;IACvB,CAAC;CACF;AACD,MAAa,qBAAqB;IACxB,MAAM,CAAqB;IAC3B,kBAAkB,CAAW;IAC7B,sBAAsB,CAAW;IACjC,4BAA4B,CAAW;IACvC,iBAAiB,CAAW;IAC5B,WAAW,CAA0B;IACrC,QAAQ,CAAkB;IAC1B,KAAK,CAAkB,CAAC,sFAAsF;IACtH,YAAoB,IAAqB;QACvC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,GAAG,6BAAa,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9D,IAAI,CAAC,kBAAkB,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,sBAAsB,GAAG,EAAE,CAAC;QACjC,IAAI,CAAC,4BAA4B,GAAG,EAAE,CAAC;QACvC,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAEO,wBAAwB,CAAC,MAAc;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC;QACxD,OAAO,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;IAC5C,CAAC;IACD;;OAEG;IACK,eAAe;QACrB,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACpC,0DAA0D;QAC1D,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YACnD,IAAI,UAAU,GAAG,aAAa;gBAC5B,aAAa,GAAG,UAAU,CAAC;YAC7B,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,4DAA4D;QAC5D,qFAAqF;QACrF,uDAAuD;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YACnD,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACxD,IAAI,CAAC,KAAK,CAAC,CAAC;gBACV,IAAI,CAAC,4BAA4B,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;iBAC/C,CAAC;gBACJ,qBAAqB,CAAC,WAAW,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QACD,6DAA6D;QAC7D,0CAA0C;QAC1C,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,QAAQ,EAAE,UAAU,EAAE,EAAE,CAAC;YAC7D,IAAI,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC;YAChC,OAAO,UAAU,GAAG,QAAQ,IAAI,iCAAY,CAAC,qBAAqB,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;gBACjH,uBAAuB;gBACvB,qBAAqB,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;gBACnF,UAAU,EAAE,CAAC;YACf,CAAC;YACD,iEAAiE;YACjE,IAAI,UAAU,GAAG,UAAU,GAAG,CAAC;gBAC7B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACO,sBAAsB,CAAC,UAAkB,EAAE,WAAmB;QACpE,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpE,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,GAAG,WAAW,CAAC;QACjD,aAAa,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAC/C,CAAC;IAEO,mBAAmB,CAAC,SAAiB;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,UAAU,CAAC;QAC3D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,qBAAqB,CAAC,SAAS,CAAC,CAAC,CAAC;QAC5D,IAAI,CAAC,sBAAsB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IACO,UAAU,GAAa,EAAE,CAAC;IAE1B,qBAAqB,CAAC,QAAgB,EAAE,KAAe;QAC7D,qBAAqB,CAAC,oBAAoB,CAAC,IAAI,CAAC,sBAAsB,EAAE,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACnG,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,OAAO;QACb,iCAAiC;QACjC,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACpC,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;QAClC,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,KAAK,IAAI,aAAa,GAAG,CAAC,EAAE,aAAa,GAAG,QAAQ,EAAE,aAAa,EAAE,EAAE,CAAC;YACtE,IAAI,IAAI,CAAC,wBAAwB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;gBACrB,IAAI,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;gBACxC,IAAI,CAAC,qBAAqB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;gBACrD,yDAAyD;gBACzD,iDAAiD;gBACjD,IAAI,aAAiC,CAAC;gBACtC,OAAO,SAAS,KAAK,CAAC,aAAa,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBACvD,MAAM,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC,CAAC,UAAU,CAAC;oBACtD,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;oBAC1D,qBAAqB,CAAC,oBAAoB,CAAC,IAAI,CAAC,kBAAkB,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;oBAClG,KAAK,MAAM,iBAAiB,IAAI,aAAa,EAAE,CAAC;wBAC9C,IAAI,iBAAiB,KAAK,aAAa,EAAE,CAAC;4BACxC,MAAM,aAAa,GAAG,SAAS,CAAC,iBAAiB,CAAC,CAAC,UAAU,CAAC;4BAC9D,MAAM,mBAAmB,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;4BAClE,IAAI,mBAAmB,KAAK,CAAC,EAAE,CAAC;gCAC9B,8BAA8B;gCAC9B,sEAAsE;gCACtE,MAAM,cAAc,GAAG,iCAAY,CAAC,mBAAmB,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;gCACrJ,IAAI,CAAC,sBAAsB,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;gCAC3D,IAAI,CAAC,qBAAqB,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;gCACzD,qBAAqB,CAAC,WAAW,CAAC,IAAI,CAAC,sBAAsB,EAAE,aAAa,EAAE,iBAAiB,CAAC,CAAC;4BACnG,CAAC;iCAAM,CAAC;gCACN,gDAAgD;gCAChD,MAAM,eAAe,GAAG,iCAAY,CAAC,mBAAmB,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC;gCACjH,IAAI,eAAe,GAAG,eAAe,GAAG,mBAAmB,GAAG,CAAC;oCAC7D,OAAO,KAAK,CAAC;4BACjB,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,0FAA0F;QAC1F,OAAO,IAAI,CAAC;IACd,CAAC;IACO,gBAAgB;QACtB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,eAAe,EAAE,GAAG,CAAC;YAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YACpD,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3C,UAAU,EAAE,CAAC;gBACb,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IACM,MAAM,CAAC,OAAO,CAAC,IAAqB;QACzC,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;QAC7B,IAAI,EAAE;YACJ,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD;;OAEG;IACK,MAAM,CAAC,WAAW,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS;QAC7D,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,CAAC;IACD;;;OAGG;IACK,MAAM,CAAC,oBAAoB,CAAC,IAAc,EAAE,MAAc,EAAE,WAAqB;QACvF,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,MAAM,CAAC;QACf,GAAG,CAAC;YACF,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC,QAAQ,CAAC,KAAK,MAAM,EAAE;IACzB,CAAC;CACF;AAlLD,sDAkLC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Polyface\n */\nimport { IndexedEdgeMatcher, SortableEdge } from \"./IndexedEdgeMatcher\";\nimport { IndexedPolyface, PolyfaceVisitor } from \"./Polyface\";\nimport { PolyfaceQuery } from \"./PolyfaceQuery\";\n\nclass OrientedComponentData {\n  public numPositive: number;\n  public numNegative: number;\n  public firstEdgeIndex: number;\n  public constructor(firstEdgeIndex: number) {\n    this.numPositive = this.numNegative = 0;\n    this.firstEdgeIndex = firstEdgeIndex;\n  }\n  // announce a new facet orientation.\n  public recordOrientation(orientation: number) {\n    if (orientation > 0)\n      this.numPositive++;\n    else if (orientation < 0)\n      this.numNegative++;\n  }\n}\nexport class FacetOrientationFixup {\n  private _edges: IndexedEdgeMatcher;\n  private _edgeToPartnerEdge: number[];\n  private _edgeToEdgeInComponent: number[];\n  private _facetToFirstEdgeInComponent: number[];\n  private _facetOrientation: number[];\n  private _components: OrientedComponentData[];\n  private _visitor: PolyfaceVisitor;\n  private _mesh: IndexedPolyface; // we could get by with just a Polyface/Visitor but for the call to reverseSingleFacet\n  private constructor(mesh: IndexedPolyface) {\n    this._visitor = mesh.createVisitor(1);\n    this._edges = PolyfaceQuery.createIndexedEdges(this._visitor);\n    this._edgeToPartnerEdge = [];\n    this._edgeToEdgeInComponent = [];\n    this._facetToFirstEdgeInComponent = [];\n    this._facetOrientation = [];\n    this._components = [];\n    this._mesh = mesh;\n  }\n\n  private edgeIdToFacetOrientation(edgeId: number): number {\n    const facetIndex = this._edges.edges[edgeId].facetIndex;\n    return this._facetOrientation[facetIndex];\n  }\n  /**\n   * RETURN FALSE IF ANY EDGE HAS 3 OR MORE FACETS\n   */\n  private setupUnoriented(): boolean {\n    this._edges.sort();\n    const edgeArray = this._edges.edges;\n    // make each edge a singleton with itself as successor . .\n    let maxFacetIndex = -1;\n    const numEdges = this._edges.edges.length;\n    for (let i = 0; i < numEdges; i++) {\n      const facetIndex = this._edges.edges[i].facetIndex;\n      if (facetIndex > maxFacetIndex)\n        maxFacetIndex = facetIndex;\n      this._edgeToEdgeInComponent.push(i);\n      this._edgeToPartnerEdge.push(i);\n    }\n    for (let i = 0; i <= maxFacetIndex; i++) {\n      this._facetToFirstEdgeInComponent.push(-1);\n      this._facetOrientation.push(0);\n    }\n    // make each edge part of a component for only its own facet\n    // (This component exists only ephemerally -- it is not referenced by true component)\n    // (swapping entries in the cyclic loops merges loops.)\n    for (let i = 0; i < numEdges; i++) {\n      const facetIndex = this._edges.edges[i].facetIndex;\n      const j = this._facetToFirstEdgeInComponent[facetIndex];\n      if (j === -1)\n        this._facetToFirstEdgeInComponent[facetIndex] = i;\n      else {\n        FacetOrientationFixup.swapEntries(this._edgeToEdgeInComponent, i, j);\n      }\n    }\n    // make contiguous partner edges cycles in edgeToPartnerEdge.\n    // edge i is initially always a singleton.\n    for (let edgeIndex0 = 0; edgeIndex0 < numEdges; edgeIndex0++) {\n      let edgeIndex1 = edgeIndex0 + 1;\n      while (edgeIndex1 < numEdges && SortableEdge.areUndirectedPartners(edgeArray[edgeIndex0], edgeArray[edgeIndex1])) {\n        // splice the loops ...\n        FacetOrientationFixup.swapEntries(this._edgeToPartnerEdge, edgeIndex0, edgeIndex1);\n        edgeIndex1++;\n      }\n      // BUT .. everything else will fail if more than 2 anywhere .....\n      if (edgeIndex1 > edgeIndex0 + 2)\n        return false;\n    }\n    return true;\n  }\n  private recordFacetInComponent(facetIndex: number, orientation: number) {\n    const componentData = this._components[this._components.length - 1];\n    this._facetOrientation[facetIndex] = orientation;\n    componentData.recordOrientation(orientation);\n  }\n\n  private initializeComponent(edgeIndex: number) {\n    const facetIndex = this._edges.edges[edgeIndex].facetIndex;\n    this._components.push(new OrientedComponentData(edgeIndex));\n    this.recordFacetInComponent(facetIndex, 1);\n  }\n  private _workArray: number[] = [];\n\n  private pushFacetEdgesOnStack(seedEdge: number, stack: number[]) {\n    FacetOrientationFixup.extractCyclicIndices(this._edgeToEdgeInComponent, seedEdge, this._workArray);\n    for (const edgeIndex of this._workArray) {\n      stack.push(edgeIndex);\n    }\n  }\n  /**\n   * * Run flood search from every possible seed, assigning positive and negative orientations\n   * * Halt and return false if flood detects Klein bottle effects.\n   * @return true if flood\n   */\n  private doFlood(): boolean {\n    // Finally time for flood search.\n    const edgeStack: number[] = [];\n    const edgeArray = this._edges.edges;\n    const numEdges = edgeArray.length;\n    const neighborEdges: number[] = [];\n    for (let seedEdgeIndex = 0; seedEdgeIndex < numEdges; seedEdgeIndex++) {\n      if (this.edgeIdToFacetOrientation(seedEdgeIndex) === 0) {\n        edgeStack.length = 0;\n        this.initializeComponent(seedEdgeIndex);\n        this.pushFacetEdgesOnStack(seedEdgeIndex, edgeStack);\n        // An edge on the stack is part of the current component.\n        // Its partners may or may not have been visited.\n        let baseEdgeIndex: number | undefined;\n        while (undefined !== (baseEdgeIndex = edgeStack.pop())) {\n          const baseFacet = edgeArray[baseEdgeIndex].facetIndex;\n          const baseOrientation = this._facetOrientation[baseFacet];\n          FacetOrientationFixup.extractCyclicIndices(this._edgeToPartnerEdge, baseEdgeIndex, neighborEdges);\n          for (const neighborEdgeIndex of neighborEdges) {\n            if (neighborEdgeIndex !== baseEdgeIndex) {\n              const neighborFacet = edgeArray[neighborEdgeIndex].facetIndex;\n              const neighborOrientation = this._facetOrientation[neighborFacet];\n              if (neighborOrientation === 0) {\n                // first visit to this facet !\n                // orientations of baseEdge and neighborEdge tell us how to orient it.\n                const newOrientation = SortableEdge.areDirectedPartners(edgeArray[baseEdgeIndex], edgeArray[neighborEdgeIndex]) ? baseOrientation : -baseOrientation;\n                this.recordFacetInComponent(neighborFacet, newOrientation);\n                this.pushFacetEdgesOnStack(neighborEdgeIndex, edgeStack);\n                FacetOrientationFixup.swapEntries(this._edgeToEdgeInComponent, baseEdgeIndex, neighborEdgeIndex);\n              } else {\n                // looking across to an already-visited facet ..\n                const edgeOrientation = SortableEdge.relativeOrientation(edgeArray[baseEdgeIndex], edgeArray[neighborEdgeIndex]);\n                if (edgeOrientation * baseOrientation * neighborOrientation > 0)\n                  return false;\n              }\n            }\n          }\n        }\n      }\n    }\n    // fall through when floods have completed in all components, with no Klein bottle effects\n    return true;\n  }\n  private doFacetReversals(): number {\n    let numReverse = 0;\n    for (this._visitor.reset(); this._visitor.moveToNextFacet();) {\n      const facetIndex = this._visitor.currentReadIndex();\n      if (this._facetOrientation[facetIndex] < 0) {\n        numReverse++;\n        this._mesh.reverseSingleFacet(facetIndex);\n      }\n    }\n    return numReverse;\n  }\n  public static doFixup(mesh: IndexedPolyface): boolean {\n    const context = new FacetOrientationFixup(mesh);\n    if (!context.setupUnoriented())\n      return false;\n    const ok = context.doFlood();\n    if (ok)\n      context.doFacetReversals();\n    return ok;\n  }\n  /** swap entries at indices in a number array.\n   * * indices are not checked for validity.\n   */\n  private static swapEntries(data: number[], i: number, j: number) {\n    const q = data[i];\n    data[i] = data[j];\n    data[j] = q;\n  }\n  /**\n   *\n   * @param data an array of cyclically linked loops.\n   */\n  private static extractCyclicIndices(data: number[], index0: number, loopIndices: number[]) {\n    loopIndices.length = 0;\n    let i = index0;\n    do {\n      loopIndices.push(i);\n      i = data[i];\n    } while (i !== index0);\n  }\n}\n"]}