@itwin/core-geometry 5.10.0-dev.16 → 5.10.0-dev.19

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;AAClD,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;;;;;;;;OAQG;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;IAG5B;;;;;;;;;OASG;WACW,4BAA4B,CACxC,YAAY,EAAE,QAAQ,GAAG,SAAS,EAClC,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,OAAO,EAChB,SAAS,GAAE,MAAqC,GAC/C,uBAAuB,EAAE;IAK5B;;;;;;;;;OASG;WACW,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;CAmBtH"}
+{"version":3,"file":"CurveCurve.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,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,MAAM,WAAW,iBAAiB;IAChC;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;GAGG;AACH,qBAAa,UAAU;IACrB;;;;;;;;OAQG;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;IAG5B;;;;;;;;;OASG;WACW,4BAA4B,CACxC,YAAY,EAAE,QAAQ,GAAG,SAAS,EAClC,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,QAAQ,EAChB,OAAO,EAAE,OAAO,EAChB,SAAS,GAAE,MAAqC,GAC/C,uBAAuB,EAAE;IAK5B;;;;;;;;;OASG;WACW,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;;;;;;;;;;;;;;OAcG;WACW,6BAA6B,CACzC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,oBAAoB,GAAE,MAAM,GAAG,iBAAkD,GACpH,uBAAuB,EAAE;IAW5B;;;;;;;;;;;;OAYG;WACW,8BAA8B,CAC1C,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,iBAAiB,GAC9D,uBAAuB,GAAG,SAAS;CAiBvC"}

package/lib/cjs/curve/CurveCurve.js

@@ -85,11 +85,18 @@ class CurveCurve {
      * an `AnyRegion`, then close approaches are computed only to the defining curves, not to the area they enclose.
      * @param curveA first curve
      * @param curveB second curve
-     * @param maxDistance maximum xy-distance to consider between the curves.
+     * @param maxDistanceOrOptions maximum xy-distance to consider between the curves, or a list of extended options.
      * Close approaches further than this xy-distance are not returned.
+     * @return array of detail pairs of close xy-approaches. XY-length of the returned close approach is set in `detailA.a`
+     * and `detailB.a`.
      */
-    static closeApproachProjectedXYPairs(curveA, curveB, maxDistance) {
-        const handler = new CurveCurveCloseApproachXY_1.CurveCurveCloseApproachXY(curveB);
+    static closeApproachProjectedXYPairs(curveA, curveB, maxDistanceOrOptions = Geometry_1.Geometry.largeCoordinateResult) {
+        const optionIsNumber = Geometry_1.Geometry.isNumber(maxDistanceOrOptions);
+        const maxDistance = optionIsNumber ? maxDistanceOrOptions : maxDistanceOrOptions.maxDistance ?? Geometry_1.Geometry.largeCoordinateResult;
+        const xyTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.xyTolerance;
+        const newtonTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.newtonTolerance;
+        const maxIterations = optionIsNumber ? undefined : maxDistanceOrOptions.maxIterations;
+        const handler = new CurveCurveCloseApproachXY_1.CurveCurveCloseApproachXY(curveB, xyTolerance, newtonTolerance, maxIterations);
         handler.maxDistanceToAccept = maxDistance;
         curveA.dispatchToGeometryHandler(handler);
         return handler.grabPairedResults();
@@ -103,20 +110,20 @@ class CurveCurve {
      * found among the pairs.
      * @param curveA first curve
      * @param curveB second curve
-     * @return detail pair of closest xy-approach, undefined if not found
+     * @param options optional parameters for close approach calculation
+     * @return detail pair of closest xy-approach, undefined if not found. XY-length of the returned close approach is
+     * set in `detailA.a` and `detailB.a`.
      */
-    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);
+    static closestApproachProjectedXYPair(curveA, curveB, options) {
+        if (options === undefined)
+            options = { maxDistance: Geometry_1.Geometry.largeCoordinateResult };
+        const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, options);
         if (!closeApproaches.length)
             return undefined;
         let iMin = 0;
-        let minDistXY = 2 * maxDistance;
+        let minDistXY = Geometry_1.Geometry.largeCoordinateResult;
         for (let i = 0; i < closeApproaches.length; ++i) {
-            // TODO: this distance should already be in detail.a. Verify this, then just use it instead of recomputing below.
-            const distXY = closeApproaches[i].detailA.point.distanceXY(closeApproaches[i].detailB.point);
+            const distXY = closeApproaches[i].detailA.a;
             if (distXY < minDistXY) {
                 iMin = i;
                 minDistXY = distXY;

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;AAKvC,4FAAyF;AACzF,oFAAiF;AACjF,sFAAmF;AAEnF;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,OAAO,UAAU,CAAC,4BAA4B,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACzG,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAkC,EAClC,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;;;;;;;;;OASG;IACI,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,CAAC;YAC3C,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,CAAC;gBAC/C,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;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,CAAC;YAChD,iHAAiH;YACjH,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,CAAC;gBACvB,IAAI,GAAG,CAAC,CAAC;gBACT,SAAS,GAAG,MAAM,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF;AA/HD,gCA+HC","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 { 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   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\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    return CurveCurve.intersectionProjectedXYPairs(undefined, curveA, extendA, curveB, extendB, tolerance);\r\n  }\r\n  /**\r\n   * Return xy intersections of 2 projected curves.\r\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\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 | undefined,\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   * @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.resetGeometryB(primitives[j]);\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 defining curves, not to the area they enclose.\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      // TODO: this distance should already be in detail.a. Verify this, then just use it instead of recomputing below.\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"]}
+{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAKvC,4FAAyF;AACzF,oFAAiF;AACjF,sFAAmF;AA6BnF;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,OAAO,UAAU,CAAC,4BAA4B,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACzG,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAkC,EAClC,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;;;;;;;;;OASG;IACI,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,CAAC;YAC3C,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,CAAC;gBAC/C,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAgB,EAAE,MAAgB,EAAE,uBAAmD,mBAAQ,CAAC,qBAAqB;QAErH,MAAM,cAAc,GAAG,mBAAQ,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC;QAC/D,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,CAAC,WAAW,IAAI,mBAAQ,CAAC,qBAAqB,CAAC;QAC/H,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,WAAW,CAAC;QAClF,MAAM,eAAe,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,eAAe,CAAC;QAC1F,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,aAAa,CAAC;QACtF,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;QACnG,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,8BAA8B,CAC1C,MAAgB,EAAE,MAAgB,EAAE,OAA2B;QAE/D,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,GAAG,EAAE,WAAW,EAAE,mBAAQ,CAAC,qBAAqB,EAAE,CAAC;QAC5D,MAAM,eAAe,GAAG,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACpF,IAAI,CAAC,eAAe,CAAC,MAAM;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,SAAS,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5C,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,CAAC;gBACT,SAAS,GAAG,MAAM,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF;AAxID,gCAwIC","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 { 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 * Options used for method [[CurveCurve.closeApproachProjectedXYPairs]] and [[CurveCurve.closestApproachProjectedXYPair]].\r\n * @public\r\n */\r\nexport interface CurveCurveOptions {\r\n  /**\r\n   * Maximum xy approach distance to be returned.\r\n   * Default: {@link Geometry.largeCoordinateResult}.\r\n   */\r\n  maxDistance?: number;\r\n  /**\r\n   * Tolerance for comparing xy points.\r\n   * Default: {@link Geometry.smallMetricDistance}.\r\n   */\r\n  xyTolerance?: number;\r\n  /**\r\n   * Newton convergence tolerance, in parametric space.\r\n   * Default: {@link Geometry.smallNewtonStep}.\r\n   */\r\n  newtonTolerance?: number;\r\n  /**\r\n   * Maximum number of iterations for the Newton method.\r\n   * Default: 50.\r\n   */\r\n  maxIterations?: number;\r\n}\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   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\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    return CurveCurve.intersectionProjectedXYPairs(undefined, curveA, extendA, curveB, extendB, tolerance);\r\n  }\r\n  /**\r\n   * Return xy intersections of 2 projected curves.\r\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\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 | undefined,\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   * @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.resetGeometryB(primitives[j]);\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 defining curves, not to the area they enclose.\r\n   * @param curveA first curve\r\n   * @param curveB second curve\r\n   * @param maxDistanceOrOptions maximum xy-distance to consider between the curves, or a list of extended options.\r\n   * Close approaches further than this xy-distance are not returned.\r\n   * @return array of detail pairs of close xy-approaches. XY-length of the returned close approach is set in `detailA.a`\r\n   * and `detailB.a`.\r\n   */\r\n  public static closeApproachProjectedXYPairs(\r\n    curveA: AnyCurve, curveB: AnyCurve, maxDistanceOrOptions: number | CurveCurveOptions = Geometry.largeCoordinateResult,\r\n  ): CurveLocationDetailPair[] {\r\n    const optionIsNumber = Geometry.isNumber(maxDistanceOrOptions);\r\n    const maxDistance = optionIsNumber ? maxDistanceOrOptions : maxDistanceOrOptions.maxDistance ?? Geometry.largeCoordinateResult;\r\n    const xyTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.xyTolerance;\r\n    const newtonTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.newtonTolerance;\r\n    const maxIterations = optionIsNumber ? undefined : maxDistanceOrOptions.maxIterations;\r\n    const handler = new CurveCurveCloseApproachXY(curveB, xyTolerance, newtonTolerance, maxIterations);\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   * @param options optional parameters for close approach calculation\r\n   * @return detail pair of closest xy-approach, undefined if not found. XY-length of the returned close approach is\r\n   * set in `detailA.a` and `detailB.a`.\r\n   */\r\n  public static closestApproachProjectedXYPair(\r\n    curveA: AnyCurve, curveB: AnyCurve, options?: CurveCurveOptions\r\n  ): CurveLocationDetailPair | undefined {\r\n    if (options === undefined)\r\n      options = { maxDistance: Geometry.largeCoordinateResult };\r\n    const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, options);\r\n    if (!closeApproaches.length)\r\n      return undefined;\r\n    let iMin = 0;\r\n    let minDistXY = Geometry.largeCoordinateResult;\r\n    for (let i = 0; i < closeApproaches.length; ++i) {\r\n      const distXY = closeApproaches[i].detailA.a;\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/internalContexts/CurveCurveCloseApproachXY.d.ts

@@ -33,6 +33,7 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     private _maxDistanceSquared;
     private _xyTolerance;
     private _newtonTolerance;
+    private _maxIterations;
     /**
      * Start and end points of line segments that meet closest approach criteria, i.e., they are perpendicular to
      * both curves and their length is smaller than _maxDistanceToAccept.
@@ -48,8 +49,9 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
      * @param geometryB second curve for intersection. Saved for reference by specific handler methods.
      * @param xyTolerance optional tolerance for comparing xy points (default [[Geometry.smallMetricDistance]]).
      * @param newtonTolerance optional relative fraction tolerance for Newton iteration (default [[Geometry.smallNewtonStep]]).
+     * @param maxIterations optional max iterations for Newton iteration (default 50).
      */
-    constructor(geometryB?: AnyCurve, xyTolerance?: number, newtonTolerance?: number);
+    constructor(geometryB?: AnyCurve, xyTolerance?: number, newtonTolerance?: number, maxIterations?: number);
     /** Set the (possibly undefined) max XY distance (z is ignored) to accept. */
     set maxDistanceToAccept(value: number | undefined);
     /** Access the (possibly undefined) max XY distance (z is ignored) to accept. */
@@ -197,11 +199,14 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     /** Specifies whether the curve needs to be stroked for close approach computation. */
     private needsStroking;
     /**
-     * Process seeds for xy close approach between one curve and another curve to be stroked.
+     * Process seeds for xy close approach between one curve and another curve.
+     * * Seeds typically result from solving a discrete close approach problem, where one or both curves have been stroked.
      * * Refine each result via Newton iteration. If it doesn't converge, remove it.
      * @param seeds the initial seed results to refine.
      * @param curveA curve to find its XY close approach with curveB.
-     * @param curveB the other curve to be stroked.
+     * @param curveAIsStroked whether `seeds` contains results from a linestring approximation to `curveA`
+     * @param curveB the other curve.
+     * @param curveBIsStroked whether `seeds` contains results from a linestring approximation to `curveB`
      * @param reversed whether `curveB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
      */
     private refineStrokedResultsByNewton;
@@ -218,7 +223,7 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     /**
      * Compute the XY close approach of a curve and another curve to be stroked.
      * @param curveA curve to find its XY close approach with curveB.
-     * @param curveB the other curve to be stroked.
+     * @param curveB the other curve, to be stroked.
      * @param reversed whether `curveB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
      */
     private dispatchCurveStrokedCurve;

package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CurveCurveCloseApproachXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveCloseApproachXY.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAEhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAOlF,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,2BAA2B,EAAE,MAAM,gCAAgC,CAAC;AAG7E,OAAO,EAA0C,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAEzG,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAKlE;;;;;;;;;;;;;GAaG;AACH,qBAAa,yBAA0B,SAAQ,8BAA8B;IAC3E,OAAO,CAAC,UAAU,CAAuB;IACzC;;;OAGG;IACH,OAAO,CAAC,oBAAoB,CAAqB;IACjD,gFAAgF;IAChF,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,gBAAgB,CAAS;IACjC;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAuC;IAEvD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,WAAW,CAAoB;IAE9C;;;;;OAKG;gBACgB,SAAS,CAAC,EAAE,QAAQ,EAAE,WAAW,GAAE,MAAqC,EAAE,eAAe,GAAE,MAAiC;IAS/I,6EAA6E;IAC7E,IAAW,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAQvD;IACD,gFAAgF;IAChF,IAAW,mBAAmB,IAAI,MAAM,GAAG,SAAS,CAEnD;IACD,mEAAmE;IACnE,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD;;;;OAIG;IACI,aAAa,CAAC,SAAS,CAAC,EAAE,QAAQ;IAIzC,8DAA8D;IAC9D,OAAO,CAAC,cAAc;IAOtB,0FAA0F;IACnF,iBAAiB,IAAI,uBAAuB,EAAE;IAGrD;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,sBAAsB;IAsB9B;;;;;;OAMG;IACH,OAAO,CAAC,iBAAiB;IAYzB;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,sBAAsB;IAsB9B,oEAAoE;IACpE,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAoB3C;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA2D5C;;;;;;OAMG;IACH,OAAO,CAAC,+BAA+B;IAavC,+DAA+D;IAC/D,OAAO,CAAC,uBAAuB;IAK/B;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAgB7B;;;;;;;;OAQG;IACH,OAAO,CAAC,0CAA0C;IAiBlD;;;;;;;;;OASG;IACH,OAAO,CAAC,iBAAiB;IA0CzB;;;;;;;OAOG;IACI,8BAA8B,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,GAAE,OAAe,GAAG,IAAI;IAmBhG,4CAA4C;IAC5C,OAAO,CAAC,cAAc;IAYtB,6DAA6D;IAC7D,OAAO,CAAC,wBAAwB;IAehC,yDAAyD;IACzD,OAAO,CAAC,oBAAoB;IA+B5B;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,wBAAwB;IAahC,0DAA0D;IAC1D,OAAO,CAAC,2BAA2B;IAgDnC,8CAA8C;IAC9C,OAAO,CAAC,uBAAuB;IAU/B,oFAAoF;IACpF,OAAO,CAAC,mCAAmC;IAmB3C,sFAAsF;IACtF,OAAO,CAAC,aAAa;IAGrB;;;;;;;OAOG;IACH,OAAO,CAAC,4BAA4B;IAkBpC;;;;;;OAMG;IACH,OAAO,CAAC,WAAW;IAKnB,4FAA4F;IAC5F,OAAO,CAAC,mCAAmC;IAkB3C;;;;;OAKG;IACH,OAAO,CAAC,yBAAyB;IAoBjC,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IAqBjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAgB1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAgB7C,gEAAgE;IAChD,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,GAAG;IAUjE,+DAA+D;IAC/C,sBAAsB,CAAC,MAAM,EAAE,kBAAkB,GAAG,GAAG;IAUvE,8EAA8E;IAC9D,iCAAiC,CAAC,KAAK,EAAE,2BAA2B,GAAG,GAAG;IAS1F,8EAA8E;IAC9D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAIpE"}
+{"version":3,"file":"CurveCurveCloseApproachXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveCloseApproachXY.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAEhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAOlF,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,2BAA2B,EAAE,MAAM,gCAAgC,CAAC;AAG7E,OAAO,EAA0C,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAEzG,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAKlE;;;;;;;;;;;;;GAaG;AACH,qBAAa,yBAA0B,SAAQ,8BAA8B;IAC3E,OAAO,CAAC,UAAU,CAAuB;IACzC;;;OAGG;IACH,OAAO,CAAC,oBAAoB,CAAqB;IACjD,gFAAgF;IAChF,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO,CAAC,cAAc,CAAS;IAC/B;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAuC;IAEvD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,WAAW,CAAoB;IAE9C;;;;;;OAMG;gBAED,SAAS,CAAC,EAAE,QAAQ,EACpB,WAAW,GAAE,MAAqC,EAClD,eAAe,GAAE,MAAiC,EAClD,aAAa,GAAE,MAAW;IAW5B,6EAA6E;IAC7E,IAAW,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAQvD;IACD,gFAAgF;IAChF,IAAW,mBAAmB,IAAI,MAAM,GAAG,SAAS,CAEnD;IACD,mEAAmE;IACnE,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD;;;;OAIG;IACI,aAAa,CAAC,SAAS,CAAC,EAAE,QAAQ;IAIzC,8DAA8D;IAC9D,OAAO,CAAC,cAAc;IAOtB,0FAA0F;IACnF,iBAAiB,IAAI,uBAAuB,EAAE;IAGrD;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,sBAAsB;IAsB9B;;;;;;OAMG;IACH,OAAO,CAAC,iBAAiB;IAYzB;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,sBAAsB;IAsB9B,oEAAoE;IACpE,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAoB3C;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA2D5C;;;;;;OAMG;IACH,OAAO,CAAC,+BAA+B;IAavC,+DAA+D;IAC/D,OAAO,CAAC,uBAAuB;IAK/B;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAgB7B;;;;;;;;OAQG;IACH,OAAO,CAAC,0CAA0C;IAiBlD;;;;;;;;;OASG;IACH,OAAO,CAAC,iBAAiB;IA0CzB;;;;;;;OAOG;IACI,8BAA8B,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,GAAE,OAAe,GAAG,IAAI;IAmBhG,4CAA4C;IAC5C,OAAO,CAAC,cAAc;IAYtB,6DAA6D;IAC7D,OAAO,CAAC,wBAAwB;IAehC,yDAAyD;IACzD,OAAO,CAAC,oBAAoB;IA+B5B;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,wBAAwB;IAahC,0DAA0D;IAC1D,OAAO,CAAC,2BAA2B;IAgDnC,8CAA8C;IAC9C,OAAO,CAAC,uBAAuB;IAU/B,oFAAoF;IACpF,OAAO,CAAC,mCAAmC;IAmB3C,sFAAsF;IACtF,OAAO,CAAC,aAAa;IAGrB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,4BAA4B;IA0BpC;;;;;;OAMG;IACH,OAAO,CAAC,WAAW;IAKnB,4FAA4F;IAC5F,OAAO,CAAC,mCAAmC;IAkB3C;;;;;OAKG;IACH,OAAO,CAAC,yBAAyB;IAmBjC,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IAqBjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAgB1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAgB7C,gEAAgE;IAChD,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,GAAG;IAUjE,+DAA+D;IAC/C,sBAAsB,CAAC,MAAM,EAAE,kBAAkB,GAAG,GAAG;IAUvE,8EAA8E;IAC9D,iCAAiC,CAAC,KAAK,EAAE,2BAA2B,GAAG,GAAG;IAS1F,8EAA8E;IAC9D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAIpE"}

package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js

@@ -54,6 +54,7 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
     _maxDistanceSquared;
     _xyTolerance;
     _newtonTolerance;
+    _maxIterations;
     /**
      * Start and end points of line segments that meet closest approach criteria, i.e., they are perpendicular to
      * both curves and their length is smaller than _maxDistanceToAccept.
@@ -69,13 +70,16 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
      * @param geometryB second curve for intersection. Saved for reference by specific handler methods.
      * @param xyTolerance optional tolerance for comparing xy points (default [[Geometry.smallMetricDistance]]).
      * @param newtonTolerance optional relative fraction tolerance for Newton iteration (default [[Geometry.smallNewtonStep]]).
+     * @param maxIterations optional max iterations for Newton iteration (default 50).
      */
-    constructor(geometryB, xyTolerance = Geometry_1.Geometry.smallMetricDistance, newtonTolerance = Geometry_1.Geometry.smallNewtonStep) {
+    constructor(geometryB, xyTolerance = Geometry_1.Geometry.smallMetricDistance, newtonTolerance = Geometry_1.Geometry.smallNewtonStep, maxIterations = 50 // seen: 47
+    ) {
         super();
         this._geometryB = geometryB instanceof ProxyCurve_1.ProxyCurve ? geometryB.proxyCurve : geometryB;
         this._maxDistanceSquared = Geometry_1.Geometry.smallMetricDistanceSquared;
         this._xyTolerance = xyTolerance;
         this._newtonTolerance = newtonTolerance;
+        this._maxIterations = maxIterations;
         const compare = CurveLocationDetail_1.CurveLocationDetailPair.comparePairsByPoints(xyTolerance, true);
         this._results = new core_bentley_1.SortedArray(compare, core_bentley_1.DuplicatePolicy.Retain);
     }
@@ -594,21 +598,27 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         return curve instanceof BSplineCurve_1.BSplineCurve3dBase || curve instanceof TransitionSpiral3d_1.TransitionSpiral3d;
     }
     /**
-     * Process seeds for xy close approach between one curve and another curve to be stroked.
+     * Process seeds for xy close approach between one curve and another curve.
+     * * Seeds typically result from solving a discrete close approach problem, where one or both curves have been stroked.
      * * Refine each result via Newton iteration. If it doesn't converge, remove it.
      * @param seeds the initial seed results to refine.
      * @param curveA curve to find its XY close approach with curveB.
-     * @param curveB the other curve to be stroked.
+     * @param curveAIsStroked whether `seeds` contains results from a linestring approximation to `curveA`
+     * @param curveB the other curve.
+     * @param curveBIsStroked whether `seeds` contains results from a linestring approximation to `curveB`
      * @param reversed whether `curveB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
      */
-    refineStrokedResultsByNewton(seeds, curveA, curveB, reversed = false) {
+    refineStrokedResultsByNewton(seeds, curveA, curveAIsStroked, curveB, curveBIsStroked, reversed = false) {
         const xyMatchingFunction = new Newton_1.CurveCurveCloseApproachXYRRtoRRD(curveA, curveB);
-        const newtonSearcher = new Newton_1.Newton2dUnboundedWithDerivative(xyMatchingFunction, 50, this._newtonTolerance); // seen: 47
+        const newtonSearcher = new Newton_1.Newton2dUnboundedWithDerivative(xyMatchingFunction, this._maxIterations, this._newtonTolerance);
         for (const seed of seeds) {
             const detailA = reversed ? seed.detailB : seed.detailA;
             const detailB = reversed ? seed.detailA : seed.detailB;
             (0, core_bentley_1.assert)(detailB.curve instanceof LineString3d_1.LineString3d, "Caller has discretized the curve");
-            newtonSearcher.setUV(detailA.fraction, detailB.fraction); // use the linestring fraction as initial curveB fraction (ASSUME it's close enough)
+            // when the curve is stroked, project the discrete seed to compute a fraction in the original curve's parameter space
+            const u = curveAIsStroked ? curveA.closestPointXY(detailA.point)?.fraction ?? detailA.fraction : detailA.fraction;
+            const v = curveBIsStroked ? curveB.closestPointXY(detailB.point)?.fraction ?? detailB.fraction : detailB.fraction;
+            newtonSearcher.setUV(u, v);
             if (newtonSearcher.runIterations()) {
                 const fractionA = newtonSearcher.getU();
                 const fractionB = newtonSearcher.getV();
@@ -651,7 +661,7 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
     /**
      * Compute the XY close approach of a curve and another curve to be stroked.
      * @param curveA curve to find its XY close approach with curveB.
-     * @param curveB the other curve to be stroked.
+     * @param curveB the other curve, to be stroked.
      * @param reversed whether `curveB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
      */
     dispatchCurveStrokedCurve(curveA, curveB, reversed) {
@@ -660,12 +670,11 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         for (const intersection of intersections)
             this.testAndRecordPair(intersection, reversed);
         // append seeds computed by solving the discretized spiral close approach problem, then refine the seeds via Newton
-        let cpA = curveA;
-        if (this.needsStroking(curveA))
-            cpA = this.strokeCurve(curveA);
+        const curveAIsStroked = this.needsStroking(curveA);
+        const cpA = curveAIsStroked ? this.strokeCurve(curveA) : curveA;
         const cpB = this.strokeCurve(curveB);
         const seeds = this.computeDiscreteCloseApproachResults(cpA, cpB, reversed);
-        this.refineStrokedResultsByNewton(seeds, curveA, curveB, reversed);
+        this.refineStrokedResultsByNewton(seeds, curveA, curveAIsStroked, curveB, true, reversed);
         if (curveA instanceof LineString3d_1.LineString3d) { // explicitly test corners (where Newton converges too slowly)
             const fStep = Geometry_1.Geometry.safeDivideFraction(1.0, curveA.numEdges(), 0);
             const v0 = CurveCurveCloseApproachXY._workPointBB0;