@itwin/core-geometry 4.2.0-dev.9 → 4.3.0-dev.1

package/lib/cjs/curve/CurveCurve.d.ts

@@ -2,10 +2,9 @@
  * @module Curve
  */
 import { Matrix4d } from "../geometry4d/Matrix4d";
-import { CurveLocationDetailArrayPair } from "./CurveCurveIntersectXY";
 import { CurveLocationDetailPair } from "./CurveLocationDetail";
 import { CurvePrimitive } from "./CurvePrimitive";
-import { GeometryQuery } from "./GeometryQuery";
+import { AnyCurve } from "./CurveTypes";
 /**
  * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.
  * @public
@@ -13,36 +12,35 @@ import { GeometryQuery } from "./GeometryQuery";
 export declare class CurveCurve {
     /**
      * Return xy intersections of 2 curves.
-     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
-     * @param geometryA first geometry
-     * @param extendA true to allow geometryA to extend
-     * @param geometryB second geometry
-     * @param extendB true to allow geometryB to extend
+     * @param curveA first curve
+     * @param extendA true to allow curveA to extend
+     * @param curveB second curve
+     * @param extendB true to allow curveB to extend
      * @param tolerance optional distance tolerance for coincidence
      */
-    static intersectionXYPairs(geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean, tolerance?: number): CurveLocationDetailPair[];
+    static intersectionXYPairs(curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean, tolerance?: number): CurveLocationDetailPair[];
     /**
      * Return xy intersections of 2 projected curves.
-     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
-     * @param geometryA first geometry
-     * @param extendA true to allow geometryA to extend
-     * @param geometryB second geometry
-     * @param extendB true to allow geometryB to extend
+     * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections.
+     * @param curveA first curve
+     * @param extendA true to allow curveA to extend
+     * @param curveB second curve
+     * @param extendB true to allow curveB to extend
      * @param tolerance optional distance tolerance for coincidence
      */
-    static intersectionProjectedXYPairs(worldToLocal: Matrix4d, geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean, tolerance?: number): CurveLocationDetailPair[];
+    static intersectionProjectedXYPairs(worldToLocal: Matrix4d, curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean, tolerance?: number): CurveLocationDetailPair[];
     /**
-     * Return full 3d xyz intersections of 2 curves.
-     *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.
-     *  * Not Implemented for bspline and bezier curves.
-     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
-     * @beta
-     * @param geometryA first geometry
-     * @param extendA true to allow geometryA to extend
-     * @param geometryB second geometry
-     * @param extendB true to allow geometryB to extend
-     */
-    static intersectionXYZ(geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean): CurveLocationDetailArrayPair;
+   * Return full 3d xyz intersections of 2 curves.
+   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.
+   *  * Not Implemented for bspline and bezier curves.
+   * @beta
+   * @param curveA first curve
+   * @param extendA true to allow curveA to extend
+   * @param curveB second curve
+   * @param extendB true to allow curveB to extend
+   * @returns array of intersections structured as CurveLocationDetailPair[]
+   */
+    static intersectionXYZPairs(curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean): CurveLocationDetailPair[];
     /**
      * Return xy intersections of input curves.
      * @param primitives input curves to intersect
@@ -50,11 +48,30 @@ export declare class CurveCurve {
      */
     static allIntersectionsAmongPrimitivesXY(primitives: CurvePrimitive[], tolerance?: number): CurveLocationDetailPair[];
     /**
-     * Return xy close approaches of 2 projected curves.
-     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
-     * @param geometryA first geometry
-     * @param geometryB second geometry
+     * Return at least one XY close approach between 2 curves.
+     * * Close approach xy-distances are measured without regard to z. This is equivalent to their separation distance
+     * as seen in the top view, or as measured between their projections onto the xy-plane.
+     * * If more than one approach is returned, one of them is the closest approach.
+     * * If an input curve is a `CurveCollection`, then close approaches are computed to each `CurvePrimitive` child.
+     * This can lead to many returned pairs, especially when both inputs are `CurveCollection`s. If an input curve is
+     * an `AnyRegion` then close approaches are computed only to the boundary curves, not to the interior.
+     * @param curveA first curve
+     * @param curveB second curve
+     * @param maxDistance maximum xy-distance to consider between the curves.
+     * Close approaches further than this xy-distance are not returned.
+     */
+    static closeApproachProjectedXYPairs(curveA: AnyCurve, curveB: AnyCurve, maxDistance: number): CurveLocationDetailPair[];
+    /**
+     * Convenience method that calls [[closeApproachProjectedXYPairs]] with a large `maxDistance`
+     * and returns a detail pair representing the closest xy-approach between the curves.
+     * * There may be many detail pairs that represent "closest" xy-approach, including coincident interval pairs,
+     * isolated intersections, or close approaches within tolerance of each other. This method makes no attempt to
+     * distinguish among them, and returns a pair whose `detail.point` values are separated by the smallest xy distance
+     * found among the pairs.
+     * @param curveA first curve
+     * @param curveB second curve
+     * @return detail pair of closest xy-approach, undefined if not found
      */
-    static closeApproachProjectedXYPairs(geometryA: GeometryQuery, geometryB: GeometryQuery, maxDistance: number): CurveLocationDetailPair[];
+    static closestApproachProjectedXYPair(curveA: AnyCurve, curveB: AnyCurve): CurveLocationDetailPair | undefined;
 }
 //# sourceMappingURL=CurveCurve.d.ts.map

package/lib/cjs/curve/CurveCurve.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CurveCurve.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAGlD,OAAO,EAAyB,4BAA4B,EAAE,MAAM,yBAAyB,CAAC;AAE9F,OAAO,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;GAGG;AACH,qBAAa,UAAU;IACrB;;;;;;;;OAQG;WACW,mBAAmB,CAC/B,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EACtF,SAAS,GAAE,MAAqC,GAC/C,uBAAuB,EAAE;IAa5B;;;;;;;;OAQG;WACW,4BAA4B,CACxC,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAC9G,SAAS,GAAE,MAAqC,GAC/C,uBAAuB,EAAE;IAK5B;;;;;;;;;;OAUG;WACW,eAAe,CAC3B,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,GACrF,4BAA4B;IAK/B;;;;OAIG;WACW,iCAAiC,CAC7C,UAAU,EAAE,cAAc,EAAE,EAAE,SAAS,GAAE,MAAqC,GAC7E,uBAAuB,EAAE;IAW5B;;;;;OAKG;WACW,6BAA6B,CACzC,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,GACtE,uBAAuB,EAAE;CAM7B"}
+{"version":3,"file":"CurveCurve.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD,OAAO,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAKxC;;;GAGG;AACH,qBAAa,UAAU;IACrB;;;;;;;OAOG;WACW,mBAAmB,CAC/B,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,OAAO,EAChB,SAAS,GAAE,MAAqC,GAC/C,uBAAuB,EAAE;IAa5B;;;;;;;;OAQG;WACW,4BAA4B,CACxC,YAAY,EAAE,QAAQ,EACtB,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,OAAO,EAChB,SAAS,GAAE,MAAqC,GAC/C,uBAAuB,EAAE;IAK5B;;;;;;;;;;KAUC;WACa,oBAAoB,CAChC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,GACrE,uBAAuB,EAAE;IAK5B;;;;OAIG;WACW,iCAAiC,CAC7C,UAAU,EAAE,cAAc,EAAE,EAAE,SAAS,GAAE,MAAqC,GAC7E,uBAAuB,EAAE;IAW5B;;;;;;;;;;;;OAYG;WACW,6BAA6B,CACzC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,GACtD,uBAAuB,EAAE;IAM5B;;;;;;;;;;OAUG;WACW,8BAA8B,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAG,uBAAuB,GAAG,SAAS;CAkBtH"}

package/lib/cjs/curve/CurveCurve.js

@@ -10,10 +10,10 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.CurveCurve = void 0;
 const Geometry_1 = require("../Geometry");
 const CurveCollection_1 = require("./CurveCollection");
-const CurveCurveCloseApproachXY_1 = require("./CurveCurveCloseApproachXY");
-const CurveCurveIntersectXY_1 = require("./CurveCurveIntersectXY");
-const CurveCurveIntersectXYZ_1 = require("./CurveCurveIntersectXYZ");
 const CurvePrimitive_1 = require("./CurvePrimitive");
+const CurveCurveCloseApproachXY_1 = require("./internalContexts/CurveCurveCloseApproachXY");
+const CurveCurveIntersectXY_1 = require("./internalContexts/CurveCurveIntersectXY");
+const CurveCurveIntersectXYZ_1 = require("./internalContexts/CurveCurveIntersectXYZ");
 /**
  * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.
  * @public
@@ -21,56 +21,55 @@ const CurvePrimitive_1 = require("./CurvePrimitive");
 class CurveCurve {
     /**
      * Return xy intersections of 2 curves.
-     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
-     * @param geometryA first geometry
-     * @param extendA true to allow geometryA to extend
-     * @param geometryB second geometry
-     * @param extendB true to allow geometryB to extend
+     * @param curveA first curve
+     * @param extendA true to allow curveA to extend
+     * @param curveB second curve
+     * @param extendB true to allow curveB to extend
      * @param tolerance optional distance tolerance for coincidence
      */
-    static intersectionXYPairs(geometryA, extendA, geometryB, extendB, tolerance = Geometry_1.Geometry.smallMetricDistance) {
-        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(undefined, extendA, geometryB, extendB, tolerance);
-        if (geometryB instanceof CurvePrimitive_1.CurvePrimitive) {
-            geometryA.dispatchToGeometryHandler(handler);
+    static intersectionXYPairs(curveA, extendA, curveB, extendB, tolerance = Geometry_1.Geometry.smallMetricDistance) {
+        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(undefined, extendA, curveB, extendB, tolerance);
+        if (curveB instanceof CurvePrimitive_1.CurvePrimitive) {
+            curveA.dispatchToGeometryHandler(handler);
         }
-        else if (geometryB instanceof CurveCollection_1.CurveCollection) {
-            const allCurves = geometryB.collectCurvePrimitives();
+        else if (curveB instanceof CurveCollection_1.CurveCollection) {
+            const allCurves = curveB.collectCurvePrimitives();
             for (const child of allCurves) {
                 handler.resetGeometry(false, child, false);
-                geometryA.dispatchToGeometryHandler(handler);
+                curveA.dispatchToGeometryHandler(handler);
             }
         }
         return handler.grabPairedResults();
     }
     /**
      * Return xy intersections of 2 projected curves.
-     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
-     * @param geometryA first geometry
-     * @param extendA true to allow geometryA to extend
-     * @param geometryB second geometry
-     * @param extendB true to allow geometryB to extend
+     * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections.
+     * @param curveA first curve
+     * @param extendA true to allow curveA to extend
+     * @param curveB second curve
+     * @param extendB true to allow curveB to extend
      * @param tolerance optional distance tolerance for coincidence
      */
-    static intersectionProjectedXYPairs(worldToLocal, geometryA, extendA, geometryB, extendB, tolerance = Geometry_1.Geometry.smallMetricDistance) {
-        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(worldToLocal, extendA, geometryB, extendB, tolerance);
-        geometryA.dispatchToGeometryHandler(handler);
+    static intersectionProjectedXYPairs(worldToLocal, curveA, extendA, curveB, extendB, tolerance = Geometry_1.Geometry.smallMetricDistance) {
+        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(worldToLocal, extendA, curveB, extendB, tolerance);
+        curveA.dispatchToGeometryHandler(handler);
         return handler.grabPairedResults();
     }
     /**
-     * Return full 3d xyz intersections of 2 curves.
-     *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.
-     *  * Not Implemented for bspline and bezier curves.
-     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
-     * @beta
-     * @param geometryA first geometry
-     * @param extendA true to allow geometryA to extend
-     * @param geometryB second geometry
-     * @param extendB true to allow geometryB to extend
-     */
-    static intersectionXYZ(geometryA, extendA, geometryB, extendB) {
-        const handler = new CurveCurveIntersectXYZ_1.CurveCurveIntersectXYZ(extendA, geometryB, extendB);
-        geometryA.dispatchToGeometryHandler(handler);
-        return handler.grabResults();
+   * Return full 3d xyz intersections of 2 curves.
+   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.
+   *  * Not Implemented for bspline and bezier curves.
+   * @beta
+   * @param curveA first curve
+   * @param extendA true to allow curveA to extend
+   * @param curveB second curve
+   * @param extendB true to allow curveB to extend
+   * @returns array of intersections structured as CurveLocationDetailPair[]
+   */
+    static intersectionXYZPairs(curveA, extendA, curveB, extendB) {
+        const handler = new CurveCurveIntersectXYZ_1.CurveCurveIntersectXYZ(extendA, curveB, extendB);
+        curveA.dispatchToGeometryHandler(handler);
+        return handler.grabPairedResults();
     }
     /**
      * Return xy intersections of input curves.
@@ -80,26 +79,62 @@ class CurveCurve {
     static allIntersectionsAmongPrimitivesXY(primitives, tolerance = Geometry_1.Geometry.smallMetricDistance) {
         const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);
         for (let i = 0; i < primitives.length; i++) {
-            const geometryA = primitives[i];
+            const curveA = primitives[i];
             for (let j = i + 1; j < primitives.length; j++) {
                 handler.resetGeometry(false, primitives[j], false);
-                geometryA.dispatchToGeometryHandler(handler);
+                curveA.dispatchToGeometryHandler(handler);
             }
         }
         return handler.grabPairedResults();
     }
     /**
-     * Return xy close approaches of 2 projected curves.
-     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
-     * @param geometryA first geometry
-     * @param geometryB second geometry
+     * Return at least one XY close approach between 2 curves.
+     * * Close approach xy-distances are measured without regard to z. This is equivalent to their separation distance
+     * as seen in the top view, or as measured between their projections onto the xy-plane.
+     * * If more than one approach is returned, one of them is the closest approach.
+     * * If an input curve is a `CurveCollection`, then close approaches are computed to each `CurvePrimitive` child.
+     * This can lead to many returned pairs, especially when both inputs are `CurveCollection`s. If an input curve is
+     * an `AnyRegion` then close approaches are computed only to the boundary curves, not to the interior.
+     * @param curveA first curve
+     * @param curveB second curve
+     * @param maxDistance maximum xy-distance to consider between the curves.
+     * Close approaches further than this xy-distance are not returned.
      */
-    static closeApproachProjectedXYPairs(geometryA, geometryB, maxDistance) {
-        const handler = new CurveCurveCloseApproachXY_1.CurveCurveCloseApproachXY(geometryB);
+    static closeApproachProjectedXYPairs(curveA, curveB, maxDistance) {
+        const handler = new CurveCurveCloseApproachXY_1.CurveCurveCloseApproachXY(curveB);
         handler.maxDistanceToAccept = maxDistance;
-        geometryA.dispatchToGeometryHandler(handler);
+        curveA.dispatchToGeometryHandler(handler);
         return handler.grabPairedResults();
     }
+    /**
+     * Convenience method that calls [[closeApproachProjectedXYPairs]] with a large `maxDistance`
+     * and returns a detail pair representing the closest xy-approach between the curves.
+     * * There may be many detail pairs that represent "closest" xy-approach, including coincident interval pairs,
+     * isolated intersections, or close approaches within tolerance of each other. This method makes no attempt to
+     * distinguish among them, and returns a pair whose `detail.point` values are separated by the smallest xy distance
+     * found among the pairs.
+     * @param curveA first curve
+     * @param curveB second curve
+     * @return detail pair of closest xy-approach, undefined if not found
+     */
+    static closestApproachProjectedXYPair(curveA, curveB) {
+        const range = curveA.range();
+        range.extendRange(curveB.range());
+        const maxDistance = range.low.distanceXY(range.high);
+        const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, maxDistance);
+        if (!closeApproaches.length)
+            return undefined;
+        let iMin = 0;
+        let minDistXY = 2 * maxDistance;
+        for (let i = 0; i < closeApproaches.length; ++i) {
+            const distXY = closeApproaches[i].detailA.point.distanceXY(closeApproaches[i].detailB.point);
+            if (distXY < minDistXY) {
+                iMin = i;
+                minDistXY = distXY;
+            }
+        }
+        return closeApproaches[iMin];
+    }
 }
 exports.CurveCurve = CurveCurve;
 //# sourceMappingURL=CurveCurve.js.map

package/lib/cjs/curve/CurveCurve.js.map

@@ -1 +1 @@
-{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAEvC,uDAAoD;AACpD,2EAAwE;AACxE,mEAA8F;AAC9F,qEAAkE;AAElE,qDAAkD;AAGlD;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB,EACtF,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7F,IAAI,SAAS,YAAY,+BAAc,EAAE;YACvC,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;SAC9C;aAAM,IAAI,SAAS,YAAY,iCAAe,EAAE;YAC/C,MAAM,SAAS,GAAG,SAAS,CAAC,sBAAsB,EAAE,CAAC;YACrD,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE;gBAC7B,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC3C,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;aAC9C;SACF;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAsB,EAAE,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB,EAC9G,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAChG,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB;QAEtF,MAAM,OAAO,GAAG,IAAI,+CAAsB,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACxE,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iCAAiC,CAC7C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACnD,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;aAC9C;SACF;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,6BAA6B,CACzC,SAAwB,EAAE,SAAwB,EAAE,WAAmB;QAEvE,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,SAAS,CAAC,CAAC;QACzD,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;CACF;AA7FD,gCA6FC","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/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { CurveCurveCloseApproachXY } from \"./CurveCurveCloseApproachXY\";\r\nimport { CurveCurveIntersectXY, CurveLocationDetailArrayPair } from \"./CurveCurveIntersectXY\";\r\nimport { CurveCurveIntersectXYZ } from \"./CurveCurveIntersectXYZ\";\r\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\n\r\n/**\r\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\r\n * @public\r\n */\r\nexport class CurveCurve {\r\n  /**\r\n   * Return xy intersections of 2 curves.\r\n   * * **NOTE:** GeometryQuery inputs should really be AnyCurve.\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionXYPairs(\r\n    geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, extendA, geometryB, extendB, tolerance);\r\n    if (geometryB instanceof CurvePrimitive) {\r\n      geometryA.dispatchToGeometryHandler(handler);\r\n    } else if (geometryB instanceof CurveCollection) {\r\n      const allCurves = geometryB.collectCurvePrimitives();\r\n      for (const child of allCurves) {\r\n        handler.resetGeometry(false, child, false);\r\n        geometryA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of 2 projected curves.\r\n   * * **NOTE:** GeometryQuery inputs should really be AnyCurve.\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionProjectedXYPairs(\r\n    worldToLocal: Matrix4d, geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(worldToLocal, extendA, geometryB, extendB, tolerance);\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return full 3d xyz intersections of 2 curves.\r\n   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\r\n   *  * Not Implemented for bspline and bezier curves.\r\n   * * **NOTE:** GeometryQuery inputs should really be AnyCurve.\r\n   * @beta\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   */\r\n  public static intersectionXYZ(\r\n    geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean,\r\n  ): CurveLocationDetailArrayPair {\r\n    const handler = new CurveCurveIntersectXYZ(extendA, geometryB, extendB);\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of input curves.\r\n   * @param primitives input curves to intersect\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static allIntersectionsAmongPrimitivesXY(\r\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);\r\n    for (let i = 0; i < primitives.length; i++) {\r\n      const geometryA = primitives[i];\r\n      for (let j = i + 1; j < primitives.length; j++) {\r\n        handler.resetGeometry(false, primitives[j], false);\r\n        geometryA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy close approaches of 2 projected curves.\r\n   * * **NOTE:** GeometryQuery inputs should really be AnyCurve.\r\n   * @param geometryA first geometry\r\n   * @param geometryB second geometry\r\n   */\r\n  public static closeApproachProjectedXYPairs(\r\n    geometryA: GeometryQuery, geometryB: GeometryQuery, maxDistance: number,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveCloseApproachXY(geometryB);\r\n    handler.maxDistanceToAccept = maxDistance;\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAEvC,uDAAoD;AAEpD,qDAAkD;AAElD,4FAAyF;AACzF,oFAAiF;AACjF,sFAAmF;AAEnF;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;OAOG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC1F,IAAI,MAAM,YAAY,+BAAc,EAAE;YACpC,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;SAC3C;aAAM,IAAI,MAAM,YAAY,iCAAe,EAAE;YAC5C,MAAM,SAAS,GAAG,MAAM,CAAC,sBAAsB,EAAE,CAAC;YAClD,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE;gBAC7B,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC3C,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;aAC3C;SACF;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAsB,EACtB,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7F,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;KAUC;IACM,MAAM,CAAC,oBAAoB,CAChC,MAAgB,EAAE,OAAgB,EAAE,MAAgB,EAAE,OAAgB;QAEtE,MAAM,OAAO,GAAG,IAAI,+CAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACrE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iCAAiC,CAC7C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACnD,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;aAC3C;SACF;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAgB,EAAE,MAAgB,EAAE,WAAmB;QAEvD,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,MAAM,CAAC,CAAC;QACtD,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,8BAA8B,CAAC,MAAgB,EAAE,MAAgB;QAC7E,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QAClC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,eAAe,GAAG,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QACxF,IAAI,CAAC,eAAe,CAAC,MAAM;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,SAAS,GAAG,CAAC,GAAG,WAAW,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;YAC/C,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC7F,IAAI,MAAM,GAAG,SAAS,EAAE;gBACtB,IAAI,GAAG,CAAC,CAAC;gBACT,SAAS,GAAG,MAAM,CAAC;aACpB;SACF;QACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF;AAvID,gCAuIC","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/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyCurve } from \"./CurveTypes\";\r\nimport { CurveCurveCloseApproachXY } from \"./internalContexts/CurveCurveCloseApproachXY\";\r\nimport { CurveCurveIntersectXY } from \"./internalContexts/CurveCurveIntersectXY\";\r\nimport { CurveCurveIntersectXYZ } from \"./internalContexts/CurveCurveIntersectXYZ\";\r\n\r\n/**\r\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\r\n * @public\r\n */\r\nexport class CurveCurve {\r\n  /**\r\n   * Return xy intersections of 2 curves.\r\n   * @param curveA first curve\r\n   * @param extendA true to allow curveA to extend\r\n   * @param curveB second curve\r\n   * @param extendB true to allow curveB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionXYPairs(\r\n    curveA: AnyCurve,\r\n    extendA: boolean,\r\n    curveB: AnyCurve,\r\n    extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, extendA, curveB, extendB, tolerance);\r\n    if (curveB instanceof CurvePrimitive) {\r\n      curveA.dispatchToGeometryHandler(handler);\r\n    } else if (curveB instanceof CurveCollection) {\r\n      const allCurves = curveB.collectCurvePrimitives();\r\n      for (const child of allCurves) {\r\n        handler.resetGeometry(false, child, false);\r\n        curveA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of 2 projected curves.\r\n   * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections.\r\n   * @param curveA first curve\r\n   * @param extendA true to allow curveA to extend\r\n   * @param curveB second curve\r\n   * @param extendB true to allow curveB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionProjectedXYPairs(\r\n    worldToLocal: Matrix4d,\r\n    curveA: AnyCurve,\r\n    extendA: boolean,\r\n    curveB: AnyCurve,\r\n    extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(worldToLocal, extendA, curveB, extendB, tolerance);\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n * Return full 3d xyz intersections of 2 curves.\r\n *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\r\n *  * Not Implemented for bspline and bezier curves.\r\n * @beta\r\n * @param curveA first curve\r\n * @param extendA true to allow curveA to extend\r\n * @param curveB second curve\r\n * @param extendB true to allow curveB to extend\r\n * @returns array of intersections structured as CurveLocationDetailPair[]\r\n */\r\n  public static intersectionXYZPairs(\r\n    curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXYZ(extendA, curveB, extendB);\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of input curves.\r\n   * @param primitives input curves to intersect\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static allIntersectionsAmongPrimitivesXY(\r\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);\r\n    for (let i = 0; i < primitives.length; i++) {\r\n      const curveA = primitives[i];\r\n      for (let j = i + 1; j < primitives.length; j++) {\r\n        handler.resetGeometry(false, primitives[j], false);\r\n        curveA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return at least one XY close approach between 2 curves.\r\n   * * Close approach xy-distances are measured without regard to z. This is equivalent to their separation distance\r\n   * as seen in the top view, or as measured between their projections onto the xy-plane.\r\n   * * If more than one approach is returned, one of them is the closest approach.\r\n   * * If an input curve is a `CurveCollection`, then close approaches are computed to each `CurvePrimitive` child.\r\n   * This can lead to many returned pairs, especially when both inputs are `CurveCollection`s. If an input curve is\r\n   * an `AnyRegion` then close approaches are computed only to the boundary curves, not to the interior.\r\n   * @param curveA first curve\r\n   * @param curveB second curve\r\n   * @param maxDistance maximum xy-distance to consider between the curves.\r\n   * Close approaches further than this xy-distance are not returned.\r\n   */\r\n  public static closeApproachProjectedXYPairs(\r\n    curveA: AnyCurve, curveB: AnyCurve, maxDistance: number,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveCloseApproachXY(curveB);\r\n    handler.maxDistanceToAccept = maxDistance;\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Convenience method that calls [[closeApproachProjectedXYPairs]] with a large `maxDistance`\r\n   * and returns a detail pair representing the closest xy-approach between the curves.\r\n   * * There may be many detail pairs that represent \"closest\" xy-approach, including coincident interval pairs,\r\n   * isolated intersections, or close approaches within tolerance of each other. This method makes no attempt to\r\n   * distinguish among them, and returns a pair whose `detail.point` values are separated by the smallest xy distance\r\n   * found among the pairs.\r\n   * @param curveA first curve\r\n   * @param curveB second curve\r\n   * @return detail pair of closest xy-approach, undefined if not found\r\n   */\r\n  public static closestApproachProjectedXYPair(curveA: AnyCurve, curveB: AnyCurve): CurveLocationDetailPair | undefined {\r\n    const range = curveA.range();\r\n    range.extendRange(curveB.range());\r\n    const maxDistance = range.low.distanceXY(range.high);\r\n    const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, maxDistance);\r\n    if (!closeApproaches.length)\r\n      return undefined;\r\n    let iMin = 0;\r\n    let minDistXY = 2 * maxDistance;\r\n    for (let i = 0; i < closeApproaches.length; ++i) {\r\n      const distXY = closeApproaches[i].detailA.point.distanceXY(closeApproaches[i].detailB.point);\r\n      if (distXY < minDistXY) {\r\n        iMin = i;\r\n        minDistXY = distXY;\r\n      }\r\n    }\r\n    return closeApproaches[iMin];\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/CurveFactory.d.ts

@@ -13,7 +13,7 @@ import { XAndY } from "../geometry3d/XYZProps";
 import { IndexedPolyface } from "../polyface/Polyface";
 import { RuledSweep } from "../solid/RuledSweep";
 import { Arc3d } from "./Arc3d";
-import { AnyCurve } from "./CurveChain";
+import { AnyCurve } from "./CurveTypes";
 import { CurveChain } from "./CurveCollection";
 import { CurvePrimitive } from "./CurvePrimitive";
 import { GeometryQuery } from "./GeometryQuery";