@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/geometry3d/BilinearPatch.d.ts

@@ -0,0 +1,107 @@
+/** @packageDocumentation
+ * @module Solid
+ */
+import { CurveAndSurfaceLocationDetail } from "../bspline/SurfaceLocationDetail";
+import { UVSurface } from "./GeometryHandler";
+import { Plane3dByOriginAndVectors } from "./Plane3dByOriginAndVectors";
+import { Point3d } from "./Point3dVector3d";
+import { Range3d } from "./Range";
+import { Ray3d } from "./Ray3d";
+import { Transform } from "./Transform";
+/**
+ * * A Bilinear patch is defined by its 4 corner points.
+ * * the corner points do not have to be coplanar
+ *
+ * *    v direction (up)
+ *      |
+ *      |
+ *      |
+ *  point01---A1-----------point11
+ *      |     |             |
+ *      B0----X------------B1
+ *      |     |             |
+ *  point00--A0-----------point10 -----------> u direction
+ *
+ * * To evaluate aa point at (u,v), the following are equivalent:
+ *   * interpolate with u to get both A0 and A1, viz
+ *      * A0 = interpolate between point00 and point10 at fraction u
+ *      * A1 = interpolate between point01 and point11 at fraction u
+ *      * X = interpolate between A0 and A1 at fraction v
+ *   * interpolate first with v to get B0 and B1, viz
+ *      * B0 = interpolate between point00 and point01 at fraction v
+ *      * B1 = interpolate between point10 and point11 at fraction v
+ *      * X = interpolate between B0 and B1 at fraction u
+ *   * sum all at once as
+ *      * X = (1-u)* (1-v) *point00 + (1-u)*v * point01 + u * (1-v) *point10 + u* v * point11
+ *
+ * @internal
+ */
+export declare class BilinearPatch implements UVSurface {
+    /** corner at parametric coordinate (0,0) */
+    point00: Point3d;
+    /** corner at parametric coordinate (1,0) */
+    point10: Point3d;
+    /** corner at parametric coordinate (0,1) */
+    point01: Point3d;
+    /** corner at parametric coordinate (1,1) */
+    point11: Point3d;
+    /**
+     * Capture (not clone) corner points, in u direction at v=0, then in same direction at v=1
+     * @param point00 Point at uv=0,0
+     * @param point10 Point at uv=1,0
+     * @param point10 Point at uv=0,1
+     * @param point11 Point at uv=11
+     */
+    constructor(point00: Point3d, point10: Point3d, point01: Point3d, point11: Point3d);
+    /** clone (not capture) corners to create a new BilinearPatch
+     * @param point00 Point at uv=0,0
+     * @param point10 Point at uv=1,0
+     * @param point10 Point at uv=0,1
+     * @param point11 Point at uv=11
+     */
+    static create(point00: Point3d, point10: Point3d, point01: Point3d, point11: Point3d): BilinearPatch;
+    /** create a patch with from xyz values of the 4 corners
+     */
+    static createXYZ(x00: number, y00: number, z00: number, x10: number, y10: number, z10: number, x01: number, y01: number, z01: number, x11: number, y11: number, z11: number): BilinearPatch;
+    /** return a clone with same coordinates */
+    clone(): BilinearPatch;
+    /** test equality of the 4 points */
+    isAlmostEqual(other: BilinearPatch): boolean;
+    /** Apply the transform to each point */
+    tryTransformInPlace(transform: Transform): boolean;
+    /**
+     * return a cloned and transformed patch.
+     * @param transform
+     */
+    cloneTransformed(transform: Transform): BilinearPatch | undefined;
+    /** Extend a range by the range of the(optionally transformed) patch
+     */
+    extendRange(range: Range3d, transform?: Transform): void;
+    /** Evaluate as a uv surface
+     * @param u fractional position in minor (phi)
+     * @param v fractional position on major (theta) arc
+     */
+    uvFractionToPoint(u: number, v: number, result?: Point3d): Point3d;
+    /** Evaluate as a uv surface, returning point and two derivative vectors.
+     * @param u fractional position
+     * @param v fractional position
+     */
+    uvFractionToPointAndTangents(u: number, v: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors;
+    /** if data[ib][pivotColumn] is larger (abs) than data[ia][pivotColumn] swap the iA and iB arrays */
+    private static conditionalPivot;
+    /**
+     * Compute the (points of) intersection with a ray.
+     * @param ray ray in space
+     * @returns 1 or 2 points if there are intersections, undefined if no intersections
+     */
+    intersectRay(ray: Ray3d): CurveAndSurfaceLocationDetail[] | undefined;
+    /**
+     * Returns the larger of the u-direction edge lengths at v=0 and v=1
+     */
+    maxUEdgeLength(): number;
+    /**
+     * Returns the larger of the v-direction edge lengths at u=0 and u=1
+     */
+    maxVEdgeLength(): number;
+}
+//# sourceMappingURL=BilinearPatch.d.ts.map

package/lib/esm/geometry3d/BilinearPatch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BilinearPatch.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/BilinearPatch.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,6BAA6B,EAA2B,MAAM,kCAAkC,CAAC;AAI1G,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAClC,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,qBAAa,aAAc,YAAW,SAAS;IAC7C,4CAA4C;IACrC,OAAO,EAAE,OAAO,CAAC;IACxB,4CAA4C;IACrC,OAAO,EAAE,OAAO,CAAC;IACxB,4CAA4C;IACrC,OAAO,EAAE,OAAO,CAAC;IACxB,4CAA4C;IACrC,OAAO,EAAE,OAAO,CAAC;IACxB;;;;;;OAMG;gBACgB,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IAMzF;;;;;OAKG;WACW,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IAI3F;OACG;WACW,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAC3D,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EACrC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EACrC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM;IAOvC,2CAA2C;IACpC,KAAK,IAAI,aAAa;IAO7B,oCAAoC;IAC7B,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAMnD,wCAAwC;IACjC,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAOzD;;;OAGG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,aAAa,GAAG,SAAS;IAKxE;OACG;IACI,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS;IAaxD;;;OAGG;IACI,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAWzE;;;OAGG;IACI,4BAA4B,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,yBAAyB,GAAG,yBAAyB;IAqBxH,oGAAoG;IACpG,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAO/B;;;;OAIG;IACI,YAAY,CAAC,GAAG,EAAE,KAAK,GAAG,6BAA6B,EAAE,GAAG,SAAS;IAmC5E;;OAEG;IACI,cAAc,IAAI,MAAM;IAG/B;;OAEG;IACI,cAAc,IAAI,MAAM;CAGhC"}

package/lib/esm/geometry3d/BilinearPatch.js

@@ -0,0 +1,200 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Solid
+ */
+import { CurveAndSurfaceLocationDetail, UVSurfaceLocationDetail } from "../bspline/SurfaceLocationDetail";
+import { CurveLocationDetail } from "../curve/CurveLocationDetail";
+import { Geometry } from "../Geometry";
+import { SmallSystem } from "../numerics/Polynomials";
+import { Plane3dByOriginAndVectors } from "./Plane3dByOriginAndVectors";
+import { Point3d } from "./Point3dVector3d";
+/**
+ * * A Bilinear patch is defined by its 4 corner points.
+ * * the corner points do not have to be coplanar
+ *
+ * *    v direction (up)
+ *      |
+ *      |
+ *      |
+ *  point01---A1-----------point11
+ *      |     |             |
+ *      B0----X------------B1
+ *      |     |             |
+ *  point00--A0-----------point10 -----------> u direction
+ *
+ * * To evaluate aa point at (u,v), the following are equivalent:
+ *   * interpolate with u to get both A0 and A1, viz
+ *      * A0 = interpolate between point00 and point10 at fraction u
+ *      * A1 = interpolate between point01 and point11 at fraction u
+ *      * X = interpolate between A0 and A1 at fraction v
+ *   * interpolate first with v to get B0 and B1, viz
+ *      * B0 = interpolate between point00 and point01 at fraction v
+ *      * B1 = interpolate between point10 and point11 at fraction v
+ *      * X = interpolate between B0 and B1 at fraction u
+ *   * sum all at once as
+ *      * X = (1-u)* (1-v) *point00 + (1-u)*v * point01 + u * (1-v) *point10 + u* v * point11
+ *
+ * @internal
+ */
+export class BilinearPatch {
+    /**
+     * Capture (not clone) corner points, in u direction at v=0, then in same direction at v=1
+     * @param point00 Point at uv=0,0
+     * @param point10 Point at uv=1,0
+     * @param point10 Point at uv=0,1
+     * @param point11 Point at uv=11
+     */
+    constructor(point00, point10, point01, point11) {
+        this.point00 = point00;
+        this.point10 = point10;
+        this.point01 = point01;
+        this.point11 = point11;
+    }
+    /** clone (not capture) corners to create a new BilinearPatch
+     * @param point00 Point at uv=0,0
+     * @param point10 Point at uv=1,0
+     * @param point10 Point at uv=0,1
+     * @param point11 Point at uv=11
+     */
+    static create(point00, point10, point01, point11) {
+        return new BilinearPatch(point00.clone(), point10.clone(), point01.clone(), point11.clone());
+    }
+    /** create a patch with from xyz values of the 4 corners
+     */
+    static createXYZ(x00, y00, z00, x10, y10, z10, x01, y01, z01, x11, y11, z11) {
+        return new BilinearPatch(Point3d.create(x00, y00, z00), Point3d.create(x10, y10, z10), Point3d.create(x01, y01, z01), Point3d.create(x11, y11, z11));
+    }
+    /** return a clone with same coordinates */
+    clone() {
+        return new BilinearPatch(this.point00.clone(), this.point10.clone(), this.point01.clone(), this.point11.clone());
+    }
+    /** test equality of the 4 points */
+    isAlmostEqual(other) {
+        return this.point00.isAlmostEqual(other.point00)
+            && this.point10.isAlmostEqual(other.point10)
+            && this.point01.isAlmostEqual(other.point01)
+            && this.point11.isAlmostEqual(other.point11);
+    }
+    /** Apply the transform to each point */
+    tryTransformInPlace(transform) {
+        transform.multiplyPoint3d(this.point00, this.point00);
+        transform.multiplyPoint3d(this.point10, this.point10);
+        transform.multiplyPoint3d(this.point01, this.point01);
+        transform.multiplyPoint3d(this.point11, this.point11);
+        return true;
+    }
+    /**
+     * return a cloned and transformed patch.
+     * @param transform
+     */
+    cloneTransformed(transform) {
+        const result = this.clone();
+        result.tryTransformInPlace(transform);
+        return result;
+    }
+    /** Extend a range by the range of the(optionally transformed) patch
+     */
+    extendRange(range, transform) {
+        if (transform) {
+            range.extendTransformedPoint(transform, this.point00);
+            range.extendTransformedPoint(transform, this.point10);
+            range.extendTransformedPoint(transform, this.point01);
+            range.extendTransformedPoint(transform, this.point11);
+        }
+        else {
+            range.extendPoint(this.point00);
+            range.extendPoint(this.point10);
+            range.extendPoint(this.point01);
+            range.extendPoint(this.point11);
+        }
+    }
+    /** Evaluate as a uv surface
+     * @param u fractional position in minor (phi)
+     * @param v fractional position on major (theta) arc
+     */
+    uvFractionToPoint(u, v, result) {
+        const f00 = (1.0 - u) * (1.0 - v);
+        const f10 = u * (1.0 - v);
+        const f01 = (1.0 - u) * v;
+        const f11 = u * v;
+        return Point3d.create(f00 * this.point00.x + f10 * this.point10.x + f01 * this.point01.x + f11 * this.point11.x, f00 * this.point00.y + f10 * this.point10.y + f01 * this.point01.y + f11 * this.point11.y, f00 * this.point00.z + f10 * this.point10.z + f01 * this.point01.z + f11 * this.point11.z, result);
+    }
+    /** Evaluate as a uv surface, returning point and two derivative vectors.
+     * @param u fractional position
+     * @param v fractional position
+     */
+    uvFractionToPointAndTangents(u, v, result) {
+        const u0 = 1.0 - u;
+        const v0 = 1.0 - v;
+        const f00 = u0 * v0;
+        const f10 = u * v0;
+        const f01 = u0 * v;
+        const f11 = u * v;
+        return Plane3dByOriginAndVectors.createOriginAndVectorsXYZ(f00 * this.point00.x + f10 * this.point10.x + f01 * this.point01.x + f11 * this.point11.x, f00 * this.point00.y + f10 * this.point10.y + f01 * this.point01.y + f11 * this.point11.y, f00 * this.point00.z + f10 * this.point10.z + f01 * this.point01.z + f11 * this.point11.z, 
+        // u derivative ..
+        v0 * (this.point10.x - this.point00.x) + v * (this.point11.x - this.point01.x), v0 * (this.point10.y - this.point00.y) + v * (this.point11.y - this.point01.y), v0 * (this.point10.z - this.point00.z) + v * (this.point11.z - this.point01.z), 
+        // v derivative ..
+        u0 * (this.point01.x - this.point00.x) + u * (this.point11.x - this.point10.x), u0 * (this.point01.y - this.point00.y) + u * (this.point11.y - this.point10.y), u0 * (this.point01.z - this.point00.z) + u * (this.point11.z - this.point10.z), result);
+    }
+    /** if data[ib][pivotColumn] is larger (abs) than data[ia][pivotColumn] swap the iA and iB arrays */
+    static conditionalPivot(pivotColumn, data, iA, iB) {
+        if (Math.abs(data[iB][pivotColumn]) > Math.abs(data[iA][pivotColumn])) {
+            const q = data[iA];
+            data[iA] = data[iB];
+            data[iB] = q;
+        }
+    }
+    /**
+     * Compute the (points of) intersection with a ray.
+     * @param ray ray in space
+     * @returns 1 or 2 points if there are intersections, undefined if no intersections
+     */
+    intersectRay(ray) {
+        const vectorU = this.point10.minus(this.point00);
+        const vectorV = this.point01.minus(this.point00);
+        const vectorW = this.point11.minus(this.point10);
+        vectorW.subtractInPlace(vectorV);
+        // coefficients of (each component of)
+        //    `ray.origin + t * ray.direction = point00 + u * vectorU + v * vectorV + u*v*vectorW`
+        // for x as typical direction as x, the scalar equation with coefficient order for arrays is
+        //    `0 = -ray.origin.x * t + (point00.x - ray.origin.x) + u * vectorU.x + v * vectorV.x + u * v * vectorW.x`
+        // (and that particular equation is invoked to isolate t when uv is known)
+        const coffs = [
+            new Float64Array([-ray.direction.x, this.point00.x - ray.origin.x, vectorU.x, vectorV.x, vectorW.x]),
+            new Float64Array([-ray.direction.y, this.point00.y - ray.origin.y, vectorU.y, vectorV.y, vectorW.y]),
+            new Float64Array([-ray.direction.z, this.point00.z - ray.origin.z, vectorU.z, vectorV.z, vectorW.z])
+        ];
+        // bring the largest ray.direction coefficient to the 0 equation.
+        BilinearPatch.conditionalPivot(0, coffs, 0, 1);
+        BilinearPatch.conditionalPivot(0, coffs, 0, 2);
+        SmallSystem.eliminateFromPivot(coffs[0], 0, coffs[1], -1.0);
+        SmallSystem.eliminateFromPivot(coffs[0], 0, coffs[2], -1.0);
+        const uvArray = SmallSystem.solveBilinearPair(coffs[1][1], coffs[1][2], coffs[1][3], coffs[1][4], coffs[2][1], coffs[2][2], coffs[2][3], coffs[2][4]);
+        if (uvArray) {
+            const result = [];
+            for (const uv of uvArray) {
+                const t = -(coffs[0][1] + coffs[0][2] * uv.x + (coffs[0][3] + coffs[0][4] * uv.x) * uv.y) / coffs[0][0];
+                const point = ray.fractionToPoint(t);
+                result.push(new CurveAndSurfaceLocationDetail(CurveLocationDetail.createRayFractionPoint(ray, t, point), UVSurfaceLocationDetail.createSurfaceUVPoint(this, uv, point)));
+            }
+            return result;
+        }
+        return undefined;
+    }
+    /**
+     * Returns the larger of the u-direction edge lengths at v=0 and v=1
+     */
+    maxUEdgeLength() {
+        return Geometry.maxXY(this.point00.distance(this.point10), this.point01.distance(this.point11));
+    }
+    /**
+     * Returns the larger of the v-direction edge lengths at u=0 and u=1
+     */
+    maxVEdgeLength() {
+        return Geometry.maxXY(this.point00.distance(this.point01), this.point10.distance(this.point11));
+    }
+}
+//# sourceMappingURL=BilinearPatch.js.map

package/lib/esm/geometry3d/BilinearPatch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BilinearPatch.js","sourceRoot":"","sources":["../../../src/geometry3d/BilinearPatch.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,6BAA6B,EAAE,uBAAuB,EAAE,MAAM,kCAAkC,CAAC;AAC1G,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAEtD,OAAO,EAAE,yBAAyB,EAAE,MAAM,6BAA6B,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAK5C;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,OAAO,aAAa;IASxB;;;;;;OAMG;IACH,YAAmB,OAAgB,EAAE,OAAgB,EAAE,OAAgB,EAAE,OAAgB;QACvF,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,OAAgB,EAAE,OAAgB,EAAE,OAAgB,EAAE,OAAgB;QACzF,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;IAC/F,CAAC;IAED;OACG;IACI,MAAM,CAAC,SAAS,CAAC,GAAW,EAAE,GAAW,EAAE,GAAW,EAC3D,GAAW,EAAE,GAAW,EAAE,GAAW,EACrC,GAAW,EAAE,GAAW,EAAE,GAAW,EACrC,GAAW,EAAE,GAAW,EAAE,GAAW;QACrC,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EACpD,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAC7B,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAC7B,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,2CAA2C;IACpC,KAAK;QACV,OAAO,IAAI,aAAa,CACtB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EACpB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EACpB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EACpB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;IAC1B,CAAC;IACD,oCAAoC;IAC7B,aAAa,CAAC,KAAoB;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC;eAC3C,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC;eACzC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC;eACzC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;IACD,wCAAwC;IACjC,mBAAmB,CAAC,SAAoB;QAC7C,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACtD,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACtD,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACtD,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACtD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;OACG;IACI,WAAW,CAAC,KAAc,EAAE,SAAqB;QACtD,IAAI,SAAS,EAAE;YACb,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACtD,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACtD,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACtD,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;SACvD;aAAM;YACL,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SACjC;IACH,CAAC;IACD;;;OAGG;IACI,iBAAiB,CAAC,CAAS,EAAE,CAAS,EAAE,MAAgB;QAC7D,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,OAAO,OAAO,CAAC,MAAM,CACnB,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EACzF,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EACzF,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EACzF,MAAM,CAAC,CAAC;IACZ,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,CAAS,EAAE,CAAS,EAAE,MAAkC;QAC1F,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;QACnB,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;QACnB,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,OAAO,yBAAyB,CAAC,yBAAyB,CACxD,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EACzF,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EACzF,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;QACzF,kBAAkB;QAClB,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9E,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9E,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAC9E,kBAAkB;QAClB,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9E,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9E,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9E,MAAM,CAAC,CAAC;IACZ,CAAC;IACD,oGAAoG;IAC5F,MAAM,CAAC,gBAAgB,CAAC,WAAmB,EAAE,IAAoB,EAAE,EAAU,EAAE,EAAU;QAC/F,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE;YACrE,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YACpB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;SACd;IACH,CAAC;IACD;;;;OAIG;IACI,YAAY,CAAC,GAAU;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACjC,sCAAsC;QACtC,0FAA0F;QAC1F,4FAA4F;QAC5F,8GAA8G;QAC9G,0EAA0E;QAC1E,MAAM,KAAK,GAAG;YACZ,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YACpG,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YACpG,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;SAAC,CAAC;QACxG,iEAAiE;QACjE,aAAa,CAAC,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,aAAa,CAAC,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,WAAW,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5D,WAAW,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,WAAW,CAAC,iBAAiB,CAC3C,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAClD,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,OAAO,EAAE;YACX,MAAM,MAAM,GAAoC,EAAE,CAAC;YACnD,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE;gBACxB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxG,MAAM,KAAK,GAAG,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,IAAI,6BAA6B,CAC3C,mBAAmB,CAAC,sBAAsB,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,EACzD,uBAAuB,CAAC,oBAAoB,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;aACnE;YACD,OAAO,MAAM,CAAC;SACf;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACI,cAAc;QACnB,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAClG,CAAC;IACD;;OAEG;IACI,cAAc;QACnB,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAClG,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Solid\r\n */\r\n\r\nimport { CurveAndSurfaceLocationDetail, UVSurfaceLocationDetail } from \"../bspline/SurfaceLocationDetail\";\r\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { SmallSystem } from \"../numerics/Polynomials\";\r\nimport { UVSurface } from \"./GeometryHandler\";\r\nimport { Plane3dByOriginAndVectors } from \"./Plane3dByOriginAndVectors\";\r\nimport { Point3d } from \"./Point3dVector3d\";\r\nimport { Range3d } from \"./Range\";\r\nimport { Ray3d } from \"./Ray3d\";\r\nimport { Transform } from \"./Transform\";\r\n\r\n/**\r\n * * A Bilinear patch is defined by its 4 corner points.\r\n * * the corner points do not have to be coplanar\r\n *\r\n * *    v direction (up)\r\n *      |\r\n *      |\r\n *      |\r\n *  point01---A1-----------point11\r\n *      |     |             |\r\n *      B0----X------------B1\r\n *      |     |             |\r\n *  point00--A0-----------point10 -----------> u direction\r\n *\r\n * * To evaluate aa point at (u,v), the following are equivalent:\r\n *   * interpolate with u to get both A0 and A1, viz\r\n *      * A0 = interpolate between point00 and point10 at fraction u\r\n *      * A1 = interpolate between point01 and point11 at fraction u\r\n *      * X = interpolate between A0 and A1 at fraction v\r\n *   * interpolate first with v to get B0 and B1, viz\r\n *      * B0 = interpolate between point00 and point01 at fraction v\r\n *      * B1 = interpolate between point10 and point11 at fraction v\r\n *      * X = interpolate between B0 and B1 at fraction u\r\n *   * sum all at once as\r\n *      * X = (1-u)* (1-v) *point00 + (1-u)*v * point01 + u * (1-v) *point10 + u* v * point11\r\n *\r\n * @internal\r\n */\r\nexport class BilinearPatch implements UVSurface {\r\n  /** corner at parametric coordinate (0,0) */\r\n  public point00: Point3d;\r\n  /** corner at parametric coordinate (1,0) */\r\n  public point10: Point3d;\r\n  /** corner at parametric coordinate (0,1) */\r\n  public point01: Point3d;\r\n  /** corner at parametric coordinate (1,1) */\r\n  public point11: Point3d;\r\n  /**\r\n   * Capture (not clone) corner points, in u direction at v=0, then in same direction at v=1\r\n   * @param point00 Point at uv=0,0\r\n   * @param point10 Point at uv=1,0\r\n   * @param point10 Point at uv=0,1\r\n   * @param point11 Point at uv=11\r\n   */\r\n  public constructor(point00: Point3d, point10: Point3d, point01: Point3d, point11: Point3d) {\r\n    this.point00 = point00;\r\n    this.point10 = point10;\r\n    this.point01 = point01;\r\n    this.point11 = point11;\r\n  }\r\n  /** clone (not capture) corners to create a new BilinearPatch\r\n   * @param point00 Point at uv=0,0\r\n   * @param point10 Point at uv=1,0\r\n   * @param point10 Point at uv=0,1\r\n   * @param point11 Point at uv=11\r\n   */\r\n  public static create(point00: Point3d, point10: Point3d, point01: Point3d, point11: Point3d) {\r\n    return new BilinearPatch(point00.clone(), point10.clone(), point01.clone(), point11.clone());\r\n  }\r\n\r\n  /** create a patch with from xyz values of the 4 corners\r\n   */\r\n  public static createXYZ(x00: number, y00: number, z00: number,\r\n    x10: number, y10: number, z10: number,\r\n    x01: number, y01: number, z01: number,\r\n    x11: number, y11: number, z11: number) {\r\n    return new BilinearPatch(Point3d.create(x00, y00, z00),\r\n      Point3d.create(x10, y10, z10),\r\n      Point3d.create(x01, y01, z01),\r\n      Point3d.create(x11, y11, z11));\r\n  }\r\n\r\n  /** return a clone with same coordinates */\r\n  public clone(): BilinearPatch {\r\n    return new BilinearPatch(\r\n      this.point00.clone(),\r\n      this.point10.clone(),\r\n      this.point01.clone(),\r\n      this.point11.clone());\r\n  }\r\n  /** test equality of the 4 points */\r\n  public isAlmostEqual(other: BilinearPatch): boolean {\r\n    return this.point00.isAlmostEqual(other.point00)\r\n      && this.point10.isAlmostEqual(other.point10)\r\n      && this.point01.isAlmostEqual(other.point01)\r\n      && this.point11.isAlmostEqual(other.point11);\r\n  }\r\n  /** Apply the transform to each point */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    transform.multiplyPoint3d(this.point00, this.point00);\r\n    transform.multiplyPoint3d(this.point10, this.point10);\r\n    transform.multiplyPoint3d(this.point01, this.point01);\r\n    transform.multiplyPoint3d(this.point11, this.point11);\r\n    return true;\r\n  }\r\n  /**\r\n   * return a cloned and transformed patch.\r\n   * @param transform\r\n   */\r\n  public cloneTransformed(transform: Transform): BilinearPatch | undefined {\r\n    const result = this.clone();\r\n    result.tryTransformInPlace(transform);\r\n    return result;\r\n  }\r\n  /** Extend a range by the range of the(optionally transformed) patch\r\n   */\r\n  public extendRange(range: Range3d, transform?: Transform) {\r\n    if (transform) {\r\n      range.extendTransformedPoint(transform, this.point00);\r\n      range.extendTransformedPoint(transform, this.point10);\r\n      range.extendTransformedPoint(transform, this.point01);\r\n      range.extendTransformedPoint(transform, this.point11);\r\n    } else {\r\n      range.extendPoint(this.point00);\r\n      range.extendPoint(this.point10);\r\n      range.extendPoint(this.point01);\r\n      range.extendPoint(this.point11);\r\n    }\r\n  }\r\n  /** Evaluate as a uv surface\r\n   * @param u fractional position in minor (phi)\r\n   * @param v fractional position on major (theta) arc\r\n   */\r\n  public uvFractionToPoint(u: number, v: number, result?: Point3d): Point3d {\r\n    const f00 = (1.0 - u) * (1.0 - v);\r\n    const f10 = u * (1.0 - v);\r\n    const f01 = (1.0 - u) * v;\r\n    const f11 = u * v;\r\n    return Point3d.create(\r\n      f00 * this.point00.x + f10 * this.point10.x + f01 * this.point01.x + f11 * this.point11.x,\r\n      f00 * this.point00.y + f10 * this.point10.y + f01 * this.point01.y + f11 * this.point11.y,\r\n      f00 * this.point00.z + f10 * this.point10.z + f01 * this.point01.z + f11 * this.point11.z,\r\n      result);\r\n  }\r\n  /** Evaluate as a uv surface, returning point and two derivative vectors.\r\n   * @param u fractional position\r\n   * @param v fractional position\r\n   */\r\n  public uvFractionToPointAndTangents(u: number, v: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors {\r\n    const u0 = 1.0 - u;\r\n    const v0 = 1.0 - v;\r\n    const f00 = u0 * v0;\r\n    const f10 = u * v0;\r\n    const f01 = u0 * v;\r\n    const f11 = u * v;\r\n    return Plane3dByOriginAndVectors.createOriginAndVectorsXYZ(\r\n      f00 * this.point00.x + f10 * this.point10.x + f01 * this.point01.x + f11 * this.point11.x,\r\n      f00 * this.point00.y + f10 * this.point10.y + f01 * this.point01.y + f11 * this.point11.y,\r\n      f00 * this.point00.z + f10 * this.point10.z + f01 * this.point01.z + f11 * this.point11.z,\r\n      // u derivative ..\r\n      v0 * (this.point10.x - this.point00.x) + v * (this.point11.x - this.point01.x),\r\n      v0 * (this.point10.y - this.point00.y) + v * (this.point11.y - this.point01.y),\r\n      v0 * (this.point10.z - this.point00.z) + v * (this.point11.z - this.point01.z),\r\n      // v derivative ..\r\n      u0 * (this.point01.x - this.point00.x) + u * (this.point11.x - this.point10.x),\r\n      u0 * (this.point01.y - this.point00.y) + u * (this.point11.y - this.point10.y),\r\n      u0 * (this.point01.z - this.point00.z) + u * (this.point11.z - this.point10.z),\r\n      result);\r\n  }\r\n  /** if data[ib][pivotColumn] is larger (abs) than data[ia][pivotColumn] swap the iA and iB arrays */\r\n  private static conditionalPivot(pivotColumn: number, data: Float64Array[], iA: number, iB: number) {\r\n    if (Math.abs(data[iB][pivotColumn]) > Math.abs(data[iA][pivotColumn])) {\r\n      const q = data[iA];\r\n      data[iA] = data[iB];\r\n      data[iB] = q;\r\n    }\r\n  }\r\n  /**\r\n   * Compute the (points of) intersection with a ray.\r\n   * @param ray ray in space\r\n   * @returns 1 or 2 points if there are intersections, undefined if no intersections\r\n   */\r\n  public intersectRay(ray: Ray3d): CurveAndSurfaceLocationDetail[] | undefined {\r\n    const vectorU = this.point10.minus(this.point00);\r\n    const vectorV = this.point01.minus(this.point00);\r\n    const vectorW = this.point11.minus(this.point10);\r\n    vectorW.subtractInPlace(vectorV);\r\n    // coefficients of (each component of)\r\n    //    `ray.origin + t * ray.direction = point00 + u * vectorU + v * vectorV + u*v*vectorW`\r\n    // for x as typical direction as x, the scalar equation with coefficient order for arrays is\r\n    //    `0 = -ray.origin.x * t + (point00.x - ray.origin.x) + u * vectorU.x + v * vectorV.x + u * v * vectorW.x`\r\n    // (and that particular equation is invoked to isolate t when uv is known)\r\n    const coffs = [\r\n      new Float64Array([-ray.direction.x, this.point00.x - ray.origin.x, vectorU.x, vectorV.x, vectorW.x]),\r\n      new Float64Array([-ray.direction.y, this.point00.y - ray.origin.y, vectorU.y, vectorV.y, vectorW.y]),\r\n      new Float64Array([-ray.direction.z, this.point00.z - ray.origin.z, vectorU.z, vectorV.z, vectorW.z])];\r\n    // bring the largest ray.direction coefficient to the 0 equation.\r\n    BilinearPatch.conditionalPivot(0, coffs, 0, 1);\r\n    BilinearPatch.conditionalPivot(0, coffs, 0, 2);\r\n    SmallSystem.eliminateFromPivot(coffs[0], 0, coffs[1], -1.0);\r\n    SmallSystem.eliminateFromPivot(coffs[0], 0, coffs[2], -1.0);\r\n    const uvArray = SmallSystem.solveBilinearPair(\r\n      coffs[1][1], coffs[1][2], coffs[1][3], coffs[1][4],\r\n      coffs[2][1], coffs[2][2], coffs[2][3], coffs[2][4]);\r\n    if (uvArray) {\r\n      const result: CurveAndSurfaceLocationDetail[] = [];\r\n      for (const uv of uvArray) {\r\n        const t = -(coffs[0][1] + coffs[0][2] * uv.x + (coffs[0][3] + coffs[0][4] * uv.x) * uv.y) / coffs[0][0];\r\n        const point = ray.fractionToPoint(t);\r\n        result.push(new CurveAndSurfaceLocationDetail(\r\n          CurveLocationDetail.createRayFractionPoint(ray, t, point),\r\n          UVSurfaceLocationDetail.createSurfaceUVPoint(this, uv, point)));\r\n      }\r\n      return result;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Returns the larger of the u-direction edge lengths at v=0 and v=1\r\n   */\r\n  public maxUEdgeLength(): number {\r\n    return Geometry.maxXY(this.point00.distance(this.point10), this.point01.distance(this.point11));\r\n  }\r\n  /**\r\n   * Returns the larger of the v-direction edge lengths at u=0 and u=1\r\n   */\r\n  public maxVEdgeLength(): number {\r\n    return Geometry.maxXY(this.point00.distance(this.point01), this.point10.distance(this.point11));\r\n  }\r\n}\r\n"]}

package/lib/esm/geometry3d/CoincidentGeometryOps.d.ts

@@ -0,0 +1,56 @@
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { Arc3d } from "../curve/Arc3d";
+import { CurveLocationDetail, CurveLocationDetailPair } from "../curve/CurveLocationDetail";
+import { Point3d } from "./Point3dVector3d";
+/**
+ * `CoincidentGeometryQuery` has methods useful in testing for overlapping geometry.
+ * * Each instance carries tolerance information that can be reused over extended call sequences.
+ * * These methods are expected to be called internally by CurveCurve intersection methods.
+ * @internal
+ */
+export declare class CoincidentGeometryQuery {
+    private _vectorU?;
+    private _vectorV?;
+    private _tolerance;
+    private constructor();
+    static create(tolerance?: number): CoincidentGeometryQuery;
+    /**
+     * * Assign both the fraction and fraction1 values in the detail, possibly swapped.
+     * * reevaluate the points as simple interpolation between given points.
+     */
+    static assignDetailInterpolatedFractionsAndPoints(detail: CurveLocationDetail, f0: number, f1: number, pointA: Point3d, pointB: Point3d, swap?: boolean): void;
+    /** Return a curve location detail with projection of a `spacePoint` to the line segment with `pointA` and `pointB`
+     *
+     */
+    projectPointToSegmentXY(spacePoint: Point3d, pointA: Point3d, pointB: Point3d): CurveLocationDetail;
+    /**
+     * * project `pointA0` and `pointA1` onto the segment with `pointB0` and `pointB1`
+     * * In the returned detail pair, the `detailA` has fractions along segmentA, and `detailB` has fractions along segment B
+     * @param pointA0 start point of segment A
+     * @param pointA1 end point of segment A
+     * @param pointB0 start point of segment B
+     * @param pointB1 end point of segment B
+     */
+    coincidentSegmentRangeXY(pointA0: Point3d, pointA1: Point3d, pointB0: Point3d, pointB1: Point3d, restrictToBounds?: boolean): CurveLocationDetailPair | undefined;
+    /**
+     * Create a CurveLocationDetailPair from . . .
+     * @param cpA curveA
+     * @param cpB curve B
+     * @param fractionsOnA fractions of an active section of curveA
+     * @param fractionB0 fraction of an original containing B interval
+     * @param fractionB1 end fraction of an original containing B interval
+     */
+    private createDetailPair;
+    private appendDetailPair;
+    /**
+     * Test if 2 arcs have coinciding portions.
+     * @param arcA
+     * @param arcB
+     * @param _restrictToBounds
+     * @return 0, 1, or 2 overlap intervals.
+     */
+    coincidentArcIntersectionXY(arcA: Arc3d, arcB: Arc3d, _restrictToBounds?: boolean): CurveLocationDetailPair[] | undefined;
+}
+//# sourceMappingURL=CoincidentGeometryOps.d.ts.map

package/lib/esm/geometry3d/CoincidentGeometryOps.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CoincidentGeometryOps.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/CoincidentGeometryOps.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAI5F,OAAO,EAAE,OAAO,EAAY,MAAM,mBAAmB,CAAC;AAGtD;;;;;GAKG;AACH,qBAAa,uBAAuB;IAClC,OAAO,CAAC,QAAQ,CAAC,CAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,CAAW;IAC5B,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO;WAGO,MAAM,CAAC,SAAS,GAAE,MAAqC,GAAG,uBAAuB;IAG/F;;;OAGG;WACW,0CAA0C,CAAC,MAAM,EAAE,mBAAmB,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAC1G,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAE,OAAe;IAazD;;OAEG;IACI,uBAAuB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,mBAAmB;IAS1G;;;;;;;OAOG;IACI,wBAAwB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,gBAAgB,GAAE,OAAc,GAAG,uBAAuB,GAAG,SAAS;IA4D9K;;;;;;;OAOG;IACH,OAAO,CAAC,gBAAgB;IAexB,OAAO,CAAC,gBAAgB;IAQxB;;;;;;OAMG;IACI,2BAA2B,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB,GAAE,OAAc,GAAG,uBAAuB,EAAE,GAAG,SAAS;CAsCvI"}

package/lib/esm/geometry3d/CoincidentGeometryOps.js

@@ -0,0 +1,196 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { CurveLocationDetail, CurveLocationDetailPair } from "../curve/CurveLocationDetail";
+import { Geometry } from "../Geometry";
+import { AngleSweep } from "./AngleSweep";
+import { Vector3d } from "./Point3dVector3d";
+import { Segment1d } from "./Segment1d";
+/**
+ * `CoincidentGeometryQuery` has methods useful in testing for overlapping geometry.
+ * * Each instance carries tolerance information that can be reused over extended call sequences.
+ * * These methods are expected to be called internally by CurveCurve intersection methods.
+ * @internal
+ */
+export class CoincidentGeometryQuery {
+    constructor(tolerance = Geometry.smallMetricDistance) {
+        this._tolerance = tolerance;
+    }
+    static create(tolerance = Geometry.smallMetricDistance) {
+        return new CoincidentGeometryQuery(tolerance);
+    }
+    /**
+     * * Assign both the fraction and fraction1 values in the detail, possibly swapped.
+     * * reevaluate the points as simple interpolation between given points.
+     */
+    static assignDetailInterpolatedFractionsAndPoints(detail, f0, f1, pointA, pointB, swap = false) {
+        if (swap) {
+            detail.fraction = f1;
+            detail.fraction1 = f0;
+        }
+        else {
+            detail.fraction = f0;
+            detail.fraction1 = f1;
+        }
+        detail.point = pointA.interpolate(detail.fraction, pointB, detail.point);
+        detail.point1 = pointA.interpolate(detail.fraction1, pointB, detail.point1);
+    }
+    /** Return a curve location detail with projection of a `spacePoint` to the line segment with `pointA` and `pointB`
+     *
+     */
+    projectPointToSegmentXY(spacePoint, pointA, pointB) {
+        this._vectorU = Vector3d.createStartEnd(pointA, pointB, this._vectorU);
+        this._vectorV = Vector3d.createStartEnd(pointA, spacePoint, this._vectorV);
+        const uDotU = this._vectorU.dotProductXY(this._vectorU);
+        const uDotV = this._vectorU.dotProductXY(this._vectorV);
+        const fraction = Geometry.safeDivideFraction(uDotV, uDotU, 0.0);
+        return CurveLocationDetail.createCurveFractionPoint(undefined, fraction, pointA.interpolate(fraction, pointB));
+    }
+    /**
+     * * project `pointA0` and `pointA1` onto the segment with `pointB0` and `pointB1`
+     * * In the returned detail pair, the `detailA` has fractions along segmentA, and `detailB` has fractions along segment B
+     * @param pointA0 start point of segment A
+     * @param pointA1 end point of segment A
+     * @param pointB0 start point of segment B
+     * @param pointB1 end point of segment B
+     */
+    coincidentSegmentRangeXY(pointA0, pointA1, pointB0, pointB1, restrictToBounds = true) {
+        const detailAOnB = this.projectPointToSegmentXY(pointA0, pointB0, pointB1);
+        if (pointA0.distanceXY(detailAOnB.point) > this._tolerance)
+            return undefined;
+        const detailA1OnB = this.projectPointToSegmentXY(pointA1, pointB0, pointB1);
+        if (pointA1.distanceXY(detailA1OnB.point) > this._tolerance)
+            return undefined;
+        const detailBOnA = this.projectPointToSegmentXY(pointB0, pointA0, pointA1);
+        if (pointB0.distanceXY(detailBOnA.point) > this._tolerance)
+            return undefined;
+        const detailB1OnA = this.projectPointToSegmentXY(pointB1, pointA0, pointA1);
+        if (pointB1.distanceXY(detailB1OnA.point) > this._tolerance)
+            return undefined;
+        detailAOnB.fraction1 = detailA1OnB.fraction;
+        detailAOnB.point1 = detailA1OnB.point; // capture -- detailB0OnA is not reused.
+        detailBOnA.fraction1 = detailB1OnA.fraction;
+        detailBOnA.point1 = detailB1OnA.point;
+        if (!restrictToBounds)
+            return CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+        const segment = Segment1d.create(detailBOnA.fraction, detailBOnA.fraction1);
+        if (segment.clampDirectedTo01()) {
+            segment.reverseIfNeededForDeltaSign(1.0);
+            const f0 = segment.x0;
+            const f1 = segment.x1;
+            const h0 = detailBOnA.inverseInterpolateFraction(f0);
+            const h1 = detailBOnA.inverseInterpolateFraction(f1);
+            // recompute fractions and points..
+            CoincidentGeometryQuery.assignDetailInterpolatedFractionsAndPoints(detailBOnA, f0, f1, pointA0, pointA1);
+            CoincidentGeometryQuery.assignDetailInterpolatedFractionsAndPoints(detailAOnB, h0, h1, pointB0, pointB1);
+            return CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+        }
+        else {
+            if (segment.signedDelta() < 0.0) {
+                if (detailBOnA.point.isAlmostEqual(pointA0)) {
+                    detailBOnA.collapseToStart();
+                    detailAOnB.collapseToStart();
+                    return CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+                }
+                if (detailBOnA.point1.isAlmostEqual(pointA1)) {
+                    detailBOnA.collapseToEnd();
+                    detailAOnB.collapseToEnd();
+                    return CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+                }
+            }
+            else {
+                if (detailBOnA.point.isAlmostEqual(pointA1)) {
+                    detailBOnA.collapseToStart();
+                    detailAOnB.collapseToEnd();
+                    return CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+                }
+                if (detailBOnA.point1.isAlmostEqual(pointA0)) {
+                    detailBOnA.collapseToEnd();
+                    detailAOnB.collapseToStart();
+                    return CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+                }
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Create a CurveLocationDetailPair from . . .
+     * @param cpA curveA
+     * @param cpB curve B
+     * @param fractionsOnA fractions of an active section of curveA
+     * @param fractionB0 fraction of an original containing B interval
+     * @param fractionB1 end fraction of an original containing B interval
+     */
+    createDetailPair(cpA, cpB, fractionsOnA, fractionB0, fractionB1, reverse) {
+        const deltaB = fractionB1 - fractionB0;
+        const g0 = Geometry.conditionalDivideFraction(fractionsOnA.x0 - fractionB0, deltaB);
+        const g1 = Geometry.conditionalDivideFraction(fractionsOnA.x1 - fractionB0, deltaB);
+        if (g0 !== undefined && g1 !== undefined) {
+            const detailA = CurveLocationDetail.createCurveEvaluatedFractionFraction(cpA, fractionsOnA.x0, fractionsOnA.x1);
+            const detailB = CurveLocationDetail.createCurveEvaluatedFractionFraction(cpB, g0, g1);
+            if (reverse) {
+                detailA.swapFractionsAndPoints();
+                detailB.swapFractionsAndPoints();
+            }
+            return CurveLocationDetailPair.createCapture(detailA, detailB);
+        }
+        return undefined;
+    }
+    appendDetailPair(result, pair) {
+        if (pair === undefined)
+            return result;
+        if (result === undefined)
+            return [pair];
+        result.push(pair);
+        return result;
+    }
+    /**
+     * Test if 2 arcs have coinciding portions.
+     * @param arcA
+     * @param arcB
+     * @param _restrictToBounds
+     * @return 0, 1, or 2 overlap intervals.
+     */
+    coincidentArcIntersectionXY(arcA, arcB, _restrictToBounds = true) {
+        let result;
+        if (arcA.center.isAlmostEqual(arcB.center)) {
+            const matrixBToA = arcA.matrixRef.multiplyMatrixInverseMatrix(arcB.matrixRef);
+            if (matrixBToA) {
+                const ux = matrixBToA.at(0, 0);
+                const uy = matrixBToA.at(1, 0);
+                const vx = matrixBToA.at(0, 1);
+                const vy = matrixBToA.at(1, 1);
+                const ru = Geometry.hypotenuseXY(ux, uy);
+                const rv = Geometry.hypotenuseXY(vx, vy);
+                const dot = Geometry.dotProductXYXY(ux, uy, vx, vy);
+                const cross = Geometry.crossProductXYXY(ux, uy, vx, vy);
+                if (Geometry.isAlmostEqualNumber(ru, 1.0)
+                    && Geometry.isAlmostEqualNumber(rv, 1.0)
+                    && Geometry.isAlmostEqualNumber(0, dot)) {
+                    const alphaB0Radians = Math.atan2(uy, ux); // angular position of arcB 0 point in A sweep
+                    const sweepDirection = cross > 0 ? 1.0 : -1.0; // 1 if arcB's parameter space sweeps forward, -1 if reverse
+                    const betaStartRadians = alphaB0Radians + sweepDirection * arcB.sweep.startRadians;
+                    const betaEndRadians = alphaB0Radians + sweepDirection * arcB.sweep.endRadians;
+                    const fractionSpacesReversed = (sweepDirection * arcA.sweep.sweepRadians * arcB.sweep.sweepRadians) < 0;
+                    const sweepB = AngleSweep.createStartEndRadians(betaStartRadians, betaEndRadians);
+                    const sweepA = arcA.sweep;
+                    const fractionPeriodA = sweepA.fractionPeriod();
+                    const fractionB0 = sweepA.radiansToPositivePeriodicFraction(sweepB.startRadians);
+                    const fractionSweep = sweepB.sweepRadians / sweepA.sweepRadians;
+                    const fractionB1 = fractionB0 + fractionSweep;
+                    const fractionSweepB = Segment1d.create(fractionB0, fractionB1);
+                    if (fractionSweepB.clampDirectedTo01())
+                        result = this.appendDetailPair(result, this.createDetailPair(arcA, arcB, fractionSweepB, fractionB0, fractionB1, fractionSpacesReversed));
+                    if (fractionB1 > fractionPeriodA) {
+                        const fractionSweepBWrap = Segment1d.create(fractionB0 - fractionPeriodA, fractionB1 - fractionPeriodA);
+                        if (fractionSweepBWrap.clampDirectedTo01())
+                            result = this.appendDetailPair(result, this.createDetailPair(arcA, arcB, fractionSweepBWrap, fractionB0, fractionB1, fractionSpacesReversed));
+                    }
+                }
+            }
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=CoincidentGeometryOps.js.map