@itwin/core-geometry 5.5.0-dev.4 → 5.5.0-dev.6

package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.d.ts

@@ -52,8 +52,18 @@ export declare class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandle
      * @param tolerance optional distance tolerance for coincidence.
      */
     constructor(worldToLocal: Matrix4d | undefined, extendA: boolean, geometryB: AnyCurve | undefined, extendB: boolean, tolerance?: number);
-    /** Reset the geometry, leaving all other parts unchanged (and preserving accumulated intersections). */
-    resetGeometry(geometryB: AnyCurve): void;
+    /**
+     * Reset geometryA extension flags.
+     * * Undefined inputs are ignored.
+     * * All other instance data is unchanged, including accumulated intersections.
+     */
+    resetGeometryA(extendA0?: boolean, extendA1?: boolean): void;
+    /**
+     * Reset geometryB and its extension flags.
+     * * Undefined inputs are ignored.
+     * * All other instance data is unchanged, including accumulated intersections.
+     */
+    resetGeometryB(geometryB?: AnyCurve, extendB0?: boolean, extendB1?: boolean): void;
     /** Accept the fraction if it falls inside (possibly extended) fraction range. */
     private acceptFraction;
     /** Test the fraction by strict parameter, but allow toleranced distance test at ends. */
@@ -75,6 +85,7 @@ export declare class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandle
      * @param fractionB1 end of the subcurve of cpB
      * @param reversed whether to reverse the details in the recorded intersection pair
      * @param intervalDetails optional data for a coincident segment intersection
+     * @param fractionTol relative tolerance for comparing fractions to avoid duplicating the last intersection. Defaults to [[Geometry.smallAngleRadians]].
      */
     private recordPointWithLocalFractions;
     /**
@@ -144,8 +155,8 @@ export declare class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandle
      */
     private dispatchCurveChainWithDistanceIndex;
     /**
-     * Invoke `child.dispatchToGeometryHandler(this)` for each child in the array returned by the query `g.children`.
-     * We take care of extend variables of geometry's children here if geometry is Path or Loop.
+     * Invoke dispatch on each child of `g` as "geometryA".
+     * * If `g` is a `Path` or `Loop`, adjust extension flags for geometryA accordingly.
      */
     handleChildren(g: GeometryQuery): any;
     /** Double dispatch handler for strongly typed segment. */
@@ -153,19 +164,50 @@ export declare class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandle
     /** Double dispatch handler for strongly typed linestring. */
     handleLineString3d(lsA: LineString3d): any;
     /** Double dispatch handler for strongly typed arc. */
-    handleArc3d(arc0: Arc3d): any;
+    handleArc3d(arcA: Arc3d): any;
     /** Double dispatch handler for strongly typed bspline curve. */
-    handleBSplineCurve3d(curve: BSplineCurve3d): any;
+    handleBSplineCurve3d(curveA: BSplineCurve3d): any;
     /**
-     * Assuming the tail of `this._results` holds the given number of approximate solutions to the curve-spiral
-     * xy-intersection problem, replace each with its Newton refinement, unless it doesn't converge, in which case
-     * it is removed.
-     * @param spiral The transition spiral.
-     * @param otherCurve The other curve primitive.
-     * @param numberOfNewResults The number of results in the tail of `this._results` to be refined.
-     * @param reversed Whether the spiral is geometryA (true) or geometryB (false).
+     * Process tail of `this._results` for xy-intersections between the curve and spiral.
+     * * If a result is not already an intersection, refine it via Newton iteration unless it doesn't converge, in which
+     * case remove it.
+     * @param curveA The other curve primitive. May also be a transition spiral.
+     * @param spiralB The transition spiral.
+     * @param index0 index of first entry in tail of `this._results` to refine.
+     * @param reversed Whether `spiralB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
      */
     private refineSpiralResultsByNewton;
+    /**
+     * Append stroke points and return the line string.
+     * * This is a convenient wrapper for [[CurvePrimitive.emitStrokes]] but the analogous instance method cannot be added
+     * to that class due to the ensuing recursion with subclass [[LineString3d]].
+     * @param options options for stroking the instance curve.
+     * @param result object to receive appended stroke points; if omitted, a new object is created, populated, and returned.
+     */
+    private strokeCurve;
+    /** Compute an approximation to the max chord height error of the stroked spiral, and another curve if a spiral. */
+    private computeMaxSpiralStrokeError;
+    /**
+     * Solve the intersection problem for stroked, unextended curveB.
+     * * @return the number of results appended.
+     */
+    private appendDiscreteIntersectionResults;
+    /**
+     * Solve the close approach problem for stroked, unextended curveB.
+     * * Sort the results shortest projection distance first.
+     * @return the number of results appended.
+     */
+    private appendDiscreteCloseApproachResults;
+    /**
+     * Compute the xy-intersection of a curve and a spiral.
+     * * When `curveA` is extended, duplicate solutions may be returned.
+     * @param curveA curve to intersect with spiralB. May also be a transition spiral.
+     * @param extendA0 whether to compute xy-intersections with curveA extended beyond its start.
+     * @param extendA1 whether to compute xy-intersections with curveA extended beyond its end.
+     * @param spiralB transition spiral to intersect with curveA.
+     * @param reversed whether `spiralB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
+     */
+    private dispatchCurveSpiral;
     /** Double dispatch handler for strongly typed spiral curve. */
     handleTransitionSpiral(spiral: TransitionSpiral3d): any;
     /** Double dispatch handler for strongly typed CurveChainWithDistanceIndex. */

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

@@ -1 +1 @@
-{"version":3,"file":"CurveCurveIntersectXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveIntersectXY.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAOlF,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAMrD,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,2BAA2B,EAAE,MAAM,gCAAgC,CAAC;AAE7E,OAAO,EAA0C,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACzG,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAI/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGlE;;;;;GAKG;AACH,qBAAa,qBAAsB,SAAQ,8BAA8B;IACvE,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,CAAC,wBAAwB,CAAuB;IACvD,OAAO,CAAC,mBAAmB,CAAwB;IACnD,OAAO,CAAC,0BAA0B,CAA0B;IAC5D,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,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,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,UAAU,CAAC,CAAU;IAC7B,OAAO,CAAC,MAAM,CAAC,CAAU;IACzB;;;;;;;OAOG;gBAED,YAAY,EAAE,QAAQ,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,QAAQ,GAAG,SAAS,EAC/B,OAAO,EAAE,OAAO,EAChB,SAAS,GAAE,MAAqC;IAkBlD,wGAAwG;IACjG,aAAa,CAAC,SAAS,EAAE,QAAQ,GAAG,IAAI;IAG/C,iFAAiF;IACjF,OAAO,CAAC,cAAc;IAQtB,yFAAyF;IACzF,OAAO,CAAC,oBAAoB;IAc5B;;;OAGG;IACI,iBAAiB,CAAC,YAAY,GAAE,OAAe,GAAG,uBAAuB,EAAE;IAMlF;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,6BAA6B;IA4DrC;;;;;;OAMG;IACI,WAAW,CAChB,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,cAAc,EAAE,KAAK,EAAE,uBAAuB,EAAE,GAAG,SAAS,EAAE,QAAQ,EAAE,OAAO,GACxG,IAAI;IASP,0GAA0G;IAC1G,OAAO,CAAC,uBAAuB;IAsC/B;;;OAGG;IACH,OAAO,CAAC,wBAAwB;IAyChC,OAAO,CAAC,sBAAsB;IA4C9B,OAAO,CAAC,kBAAkB;IAuG1B;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;IA4C/B;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc;IAkCtB,+DAA+D;IAC/D,OAAO,CAAC,yBAAyB;IAsEjC,8EAA8E;IAC9E,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,SAAS;IAQjB,OAAO,CAAC,+BAA+B;IA6FvC,OAAO,CAAC,oCAAoC;IAgC5C;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,2BAA2B;IAmCnC,0EAA0E;IACnE,8BAA8B,CACnC,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAC9E,GAAG;IAoBN,8DAA8D;IACvD,wBAAwB,CAC7B,GAAG,EAAE,aAAa,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACxD,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,QAAQ,EAAE,OAAO,GAChB,GAAG;IAwBN,0DAA0D;IACnD,oBAAoB,CACzB,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACjD,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,QAAQ,EAAE,OAAO,GAChB,GAAG;IAqBN,iEAAiE;IACjE,OAAO,CAAC,2BAA2B;IAqCnC,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAQvC;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IAyB/B;;;OAGG;IACH,OAAO,CAAC,mCAAmC;IAe3C;;;OAGG;IACa,cAAc,CAAC,CAAC,EAAE,aAAa,GAAG,GAAG;IAqBrD,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IAoCjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IA8B1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IA8B7C,gEAAgE;IAChD,oBAAoB,CAAC,KAAK,EAAE,cAAc,GAAG,GAAG;IA8BhE;;;;;;;;OAQG;IACH,OAAO,CAAC,2BAA2B;IAmBnC,+DAA+D;IAC/C,sBAAsB,CAAC,MAAM,EAAE,kBAAkB,GAAG,GAAG;IAavE,8EAA8E;IAC9D,iCAAiC,CAAC,KAAK,EAAE,2BAA2B,GAAG,GAAG;IAK1F,4EAA4E;IAC5D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAgBpE"}
+{"version":3,"file":"CurveCurveIntersectXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveIntersectXY.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAOlF,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAMrD,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,2BAA2B,EAAE,MAAM,gCAAgC,CAAC;AAG7E,OAAO,EAA0C,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACzG,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAI/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAIlE;;;;;GAKG;AACH,qBAAa,qBAAsB,SAAQ,8BAA8B;IACvE,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,CAAC,wBAAwB,CAAuB;IACvD,OAAO,CAAC,mBAAmB,CAAwB;IACnD,OAAO,CAAC,0BAA0B,CAA0B;IAC5D,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,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,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,UAAU,CAAC,CAAU;IAC7B,OAAO,CAAC,MAAM,CAAC,CAAU;IACzB;;;;;;;OAOG;gBAED,YAAY,EAAE,QAAQ,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,QAAQ,GAAG,SAAS,EAC/B,OAAO,EAAE,OAAO,EAChB,SAAS,GAAE,MAAqC;IAkBlD;;;;OAIG;IACI,cAAc,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,OAAO,GAAG,IAAI;IAMnE;;;;OAIG;IACI,cAAc,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,OAAO,GAAG,IAAI;IAQzF,iFAAiF;IACjF,OAAO,CAAC,cAAc;IAQtB,yFAAyF;IACzF,OAAO,CAAC,oBAAoB;IAc5B;;;OAGG;IACI,iBAAiB,CAAC,YAAY,GAAE,OAAe,GAAG,uBAAuB,EAAE;IAMlF;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,6BAA6B;IA4DrC;;;;;;OAMG;IACI,WAAW,CAChB,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,cAAc,EAAE,KAAK,EAAE,uBAAuB,EAAE,GAAG,SAAS,EAAE,QAAQ,EAAE,OAAO,GACxG,IAAI;IASP,0GAA0G;IAC1G,OAAO,CAAC,uBAAuB;IAsC/B;;;OAGG;IACH,OAAO,CAAC,wBAAwB;IA2ChC,OAAO,CAAC,sBAAsB;IA4C9B,OAAO,CAAC,kBAAkB;IAuG1B;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;IA4C/B;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc;IAkCtB,+DAA+D;IAC/D,OAAO,CAAC,yBAAyB;IAsEjC,8EAA8E;IAC9E,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,SAAS;IAQjB,OAAO,CAAC,+BAA+B;IA6FvC,OAAO,CAAC,oCAAoC;IAgC5C;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,2BAA2B;IAmCnC,0EAA0E;IACnE,8BAA8B,CACnC,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAC9E,GAAG;IAoBN,8DAA8D;IACvD,wBAAwB,CAC7B,GAAG,EAAE,aAAa,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACxD,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,QAAQ,EAAE,OAAO,GAChB,GAAG;IAwBN,0DAA0D;IACnD,oBAAoB,CACzB,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACjD,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,QAAQ,EAAE,OAAO,GAChB,GAAG;IAqBN,iEAAiE;IACjE,OAAO,CAAC,2BAA2B;IAqCnC,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAQvC;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IAyB/B;;;OAGG;IACH,OAAO,CAAC,mCAAmC;IAe3C;;;OAGG;IACa,cAAc,CAAC,CAAC,EAAE,aAAa,GAAG,GAAG;IAwBrD,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IA+BjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAyB1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAyB7C,gEAAgE;IAChD,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,GAAG;IAyBjE;;;;;;;;OAQG;IACH,OAAO,CAAC,2BAA2B;IAwDnC;;;;;;OAMG;IACH,OAAO,CAAC,WAAW;IAKnB,mHAAmH;IACnH,OAAO,CAAC,2BAA2B;IAuBnC;;;OAGG;IACH,OAAO,CAAC,iCAAiC;IAmBzC;;;;OAIG;IACH,OAAO,CAAC,kCAAkC;IAW1C;;;;;;;;OAQG;IACH,OAAO,CAAC,mBAAmB;IAgB3B,+DAA+D;IAC/C,sBAAsB,CAAC,MAAM,EAAE,kBAAkB,GAAG,GAAG;IAUvE,8EAA8E;IAC9D,iCAAiC,CAAC,KAAK,EAAE,2BAA2B,GAAG,GAAG;IAK1F,4EAA4E;IAC5D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAgBpE"}

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

@@ -24,6 +24,7 @@ const SmallSystem_1 = require("../../numerics/SmallSystem");
 const Arc3d_1 = require("../Arc3d");
 const CurveChainWithDistanceIndex_1 = require("../CurveChainWithDistanceIndex");
 const CurveCollection_1 = require("../CurveCollection");
+const CurveCurve_1 = require("../CurveCurve");
 const CurveLocationDetail_1 = require("../CurveLocationDetail");
 const CurvePrimitive_1 = require("../CurvePrimitive");
 const LineSegment3d_1 = require("../LineSegment3d");
@@ -90,9 +91,29 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
         this._coincidentGeometryContext = CoincidentGeometryOps_1.CoincidentGeometryQuery.create(tolerance);
         this._results = [];
     }
-    /** Reset the geometry, leaving all other parts unchanged (and preserving accumulated intersections). */
-    resetGeometry(geometryB) {
-        this._geometryB = geometryB;
+    /**
+     * Reset geometryA extension flags.
+     * * Undefined inputs are ignored.
+     * * All other instance data is unchanged, including accumulated intersections.
+     */
+    resetGeometryA(extendA0, extendA1) {
+        if (extendA0 !== undefined)
+            this._extendA0 = extendA0;
+        if (extendA1 !== undefined)
+            this._extendA1 = extendA1;
+    }
+    /**
+     * Reset geometryB and its extension flags.
+     * * Undefined inputs are ignored.
+     * * All other instance data is unchanged, including accumulated intersections.
+     */
+    resetGeometryB(geometryB, extendB0, extendB1) {
+        if (geometryB)
+            this._geometryB = geometryB;
+        if (extendB0 !== undefined)
+            this._extendB0 = extendB0;
+        if (extendB1 !== undefined)
+            this._extendB1 = extendB1;
     }
     /** Accept the fraction if it falls inside (possibly extended) fraction range. */
     acceptFraction(extend0, fraction, extend1, fractionTol = 1.0e-12) {
@@ -134,14 +155,14 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
      * @param fractionB1 end of the subcurve of cpB
      * @param reversed whether to reverse the details in the recorded intersection pair
      * @param intervalDetails optional data for a coincident segment intersection
+     * @param fractionTol relative tolerance for comparing fractions to avoid duplicating the last intersection. Defaults to [[Geometry.smallAngleRadians]].
      */
-    recordPointWithLocalFractions(localFractionA, cpA, fractionA0, fractionA1, localFractionB, cpB, fractionB0, fractionB1, reversed, intervalDetails) {
+    recordPointWithLocalFractions(localFractionA, cpA, fractionA0, fractionA1, localFractionB, cpB, fractionB0, fractionB1, reversed, intervalDetails, fractionTol) {
         let globalFractionA, globalFractionB;
         let globalFractionA1, globalFractionB1;
-        const isInterval = intervalDetails !== undefined &&
-            intervalDetails.detailA.hasFraction1 &&
-            intervalDetails.detailB.hasFraction1;
-        if (isInterval) {
+        let isInterval = false;
+        if (intervalDetails && intervalDetails.detailA.isInterval() && intervalDetails.detailB.isInterval()) {
+            isInterval = true;
             globalFractionA = Geometry_1.Geometry.interpolate(fractionA0, intervalDetails.detailA.fraction, fractionA1);
             globalFractionB = Geometry_1.Geometry.interpolate(fractionB0, intervalDetails.detailB.fraction, fractionB1);
             globalFractionA1 = Geometry_1.Geometry.interpolate(fractionA0, intervalDetails.detailA.fraction1, fractionA1);
@@ -157,13 +178,13 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
             const oldDetailA = this._results[numPrevious - 1].detailA;
             const oldDetailB = this._results[numPrevious - 1].detailB;
             if (reversed) {
-                if (oldDetailB.isSameCurveAndFraction({ curve: cpA, fraction: globalFractionA }) &&
-                    oldDetailA.isSameCurveAndFraction({ curve: cpB, fraction: globalFractionB }))
+                if (oldDetailB.isSameCurveAndFraction({ curve: cpA, fraction: globalFractionA }, fractionTol) &&
+                    oldDetailA.isSameCurveAndFraction({ curve: cpB, fraction: globalFractionB }, fractionTol))
                     return;
             }
             else {
-                if (oldDetailA.isSameCurveAndFraction({ curve: cpA, fraction: globalFractionA }) &&
-                    oldDetailB.isSameCurveAndFraction({ curve: cpB, fraction: globalFractionB }))
+                if (oldDetailA.isSameCurveAndFraction({ curve: cpA, fraction: globalFractionA }, fractionTol) &&
+                    oldDetailB.isSameCurveAndFraction({ curve: cpB, fraction: globalFractionB }, fractionTol))
                     return;
             }
         }
@@ -227,6 +248,8 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
      * fraction mapping. Assumes caller knows the _worldToLocal is present.
      */
     computeSegmentSegment3DH(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, cpB, extendB0, pointB0, fractionB0, pointB1, fractionB1, extendB1, reversed) {
+        if (undefined === this._worldToLocalPerspective)
+            return;
         const hA0 = CurveCurveIntersectXY._workPointA0H;
         const hA1 = CurveCurveIntersectXY._workPointA1H;
         const hB0 = CurveCurveIntersectXY._workPointB0H;
@@ -781,30 +804,30 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
      * We take care of extend variables of geometry's children here if geometry is Path or Loop.
      */
     dispatchCurveCollection(geomA, geomAHandler) {
-        const geomB = this._geometryB; // save
+        const geomB = this._geometryB;
         if (!geomB || !geomB.children || !(geomB instanceof CurveCollection_1.CurveCollection))
             return;
         const children = geomB.children;
-        const extendB0 = this._extendB0; // save
-        const extendB1 = this._extendB1; // save
+        const saveExtendB0 = this._extendB0;
+        const saveExtendB1 = this._extendB1;
         for (let i = 0; i < children.length; i++) {
-            this.resetGeometry(children[i]);
+            let extendB0 = saveExtendB0;
+            let extendB1 = saveExtendB1;
             if (geomB instanceof Path_1.Path && children.length > 1) {
                 if (i === 0)
-                    this._extendB1 = false; // first child can only extend from start
+                    extendB1 = false; // first child can only extend from start
                 else if (i === children.length - 1)
-                    this._extendB0 = false; // last child can only extend from end
+                    extendB0 = false; // last child can only extend from end
                 else
-                    this._extendB0 = this._extendB1 = false; // middle children cannot extend
+                    extendB0 = extendB1 = false; // middle children cannot extend
             }
             else if (geomB instanceof Loop_1.Loop) {
-                this._extendB0 = this._extendB1 = false; // Loops cannot extend
+                extendB0 = extendB1 = false; // Loops cannot extend
             }
+            this.resetGeometryB(children[i], extendB0, extendB1);
             geomAHandler(geomA);
-            this._extendB0 = extendB0; // restore
-            this._extendB1 = extendB1; // restore
         }
-        this.resetGeometry(geomB); // restore
+        this.resetGeometryB(geomB, saveExtendB0, saveExtendB1);
     }
     /**
      * Low level dispatch of CurveChainWithDistanceIndex.
@@ -818,36 +841,39 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
         }
         const index0 = this._results.length;
         const geomB = this._geometryB; // save
-        this.resetGeometry(geomB.path);
+        this.resetGeometryB(geomB.path);
         this.dispatchCurveCollection(geomA, geomAHandler);
-        this.resetGeometry(geomB); // restore
+        this.resetGeometryB(geomB); // restore
         this._results = CurveChainWithDistanceIndex_1.CurveChainWithDistanceIndex.convertChildDetailToChainDetail(this._results, index0, undefined, geomB, true);
     }
     /**
-     * Invoke `child.dispatchToGeometryHandler(this)` for each child in the array returned by the query `g.children`.
-     * We take care of extend variables of geometry's children here if geometry is Path or Loop.
+     * Invoke dispatch on each child of `g` as "geometryA".
+     * * If `g` is a `Path` or `Loop`, adjust extension flags for geometryA accordingly.
      */
     handleChildren(g) {
         const children = g.children;
-        const extendA0 = this._extendA0; // save
-        const extendA1 = this._extendA1; // save
-        if (children)
-            for (let i = 0; i < children.length; i++) {
-                if (g instanceof Path_1.Path && children.length > 1) {
-                    if (i === 0)
-                        this._extendA1 = false; // first child can only extend from start
-                    else if (i === children.length - 1)
-                        this._extendA0 = false; // last child can only extend from end
-                    else
-                        this._extendA0 = this._extendA1 = false; // middle children cannot extend
-                }
-                else if (g instanceof Loop_1.Loop) {
-                    this._extendA0 = this._extendA1 = false; // Loops cannot extend
-                }
-                children[i].dispatchToGeometryHandler(this);
-                this._extendA0 = extendA0; // restore
-                this._extendA1 = extendA1; // restore
+        if (!children)
+            return;
+        const saveExtendA0 = this._extendA0;
+        const saveExtendA1 = this._extendA1;
+        for (let i = 0; i < children.length; i++) {
+            let extendA0 = saveExtendA0;
+            let extendA1 = saveExtendA1;
+            if (g instanceof Path_1.Path && children.length > 1) {
+                if (i === 0)
+                    extendA1 = false; // first child can only extend from start
+                else if (i === children.length - 1)
+                    extendA0 = false; // last child can only extend from end
+                else
+                    extendA0 = extendA1 = false; // middle children cannot extend
+            }
+            else if (g instanceof Loop_1.Loop) {
+                extendA0 = extendA1 = false; // Loops cannot extend
             }
+            this.resetGeometryA(extendA0, extendA1);
+            children[i].dispatchToGeometryHandler(this);
+        }
+        this.resetGeometryA(saveExtendA0, saveExtendA1);
     }
     /** Double dispatch handler for strongly typed segment. */
     handleLineSegment3d(segmentA) {
@@ -865,12 +891,7 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
             this.dispatchSegmentBsplineCurve(segmentA, this._extendA0, segmentA.point0Ref, 0.0, segmentA.point1Ref, 1.0, this._extendA1, this._geometryB, this._extendB0, this._extendB1, false);
         }
         else if (this._geometryB instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
-            const spiralApproximation = LineString3d_1.LineString3d.create();
-            this._geometryB.emitStrokes(spiralApproximation);
-            const numPreviousResults = this._results.length;
-            this.computeSegmentLineString(segmentA, this._extendA0, this._extendA1, spiralApproximation, false, false, false);
-            const numberOfNewResults = this._results.length - numPreviousResults;
-            this.refineSpiralResultsByNewton(segmentA, this._geometryB, numberOfNewResults);
+            this.dispatchCurveSpiral(segmentA, this._extendA0, this._extendA1, this._geometryB, false);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
             this.dispatchCurveCollection(segmentA, this.handleLineSegment3d.bind(this));
@@ -896,12 +917,7 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
             this.dispatchLineStringBSplineCurve(lsA, this._extendA0, this._extendA1, this._geometryB, this._extendB0, this._extendB1, false);
         }
         else if (this._geometryB instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
-            const spiralApproximation = LineString3d_1.LineString3d.create();
-            this._geometryB.emitStrokes(spiralApproximation);
-            const numPreviousResults = this._results.length;
-            this.computeLineStringLineString(lsA, this._extendA0, this._extendA1, spiralApproximation, false, false, false);
-            const numberOfNewResults = this._results.length - numPreviousResults;
-            this.refineSpiralResultsByNewton(lsA, this._geometryB, numberOfNewResults);
+            this.dispatchCurveSpiral(lsA, this._extendA0, this._extendA1, this._geometryB, false);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
             this.dispatchCurveCollection(lsA, this.handleLineString3d.bind(this));
@@ -912,100 +928,212 @@ class CurveCurveIntersectXY extends GeometryHandler_1.RecurseToCurvesGeometryHan
         return undefined;
     }
     /** Double dispatch handler for strongly typed arc. */
-    handleArc3d(arc0) {
+    handleArc3d(arcA) {
         if (this._geometryB instanceof LineSegment3d_1.LineSegment3d) {
-            this.dispatchSegmentArc(this._geometryB, this._extendB0, this._geometryB.point0Ref, 0.0, this._geometryB.point1Ref, 1.0, this._extendB1, arc0, this._extendA0, this._extendA1, true);
+            this.dispatchSegmentArc(this._geometryB, this._extendB0, this._geometryB.point0Ref, 0.0, this._geometryB.point1Ref, 1.0, this._extendB1, arcA, this._extendA0, this._extendA1, true);
         }
         else if (this._geometryB instanceof LineString3d_1.LineString3d) {
-            this.computeArcLineString(arc0, this._extendA0, this._extendA1, this._geometryB, this._extendB0, this._extendB1, false);
+            this.computeArcLineString(arcA, this._extendA0, this._extendA1, this._geometryB, this._extendB0, this._extendB1, false);
         }
         else if (this._geometryB instanceof Arc3d_1.Arc3d) {
-            this.dispatchArcArc(arc0, this._extendA0, this._extendA1, this._geometryB, this._extendB0, this._extendB1, false);
+            this.dispatchArcArc(arcA, this._extendA0, this._extendA1, this._geometryB, this._extendB0, this._extendB1, false);
         }
         else if (this._geometryB instanceof BSplineCurve_1.BSplineCurve3d) {
-            this.dispatchArcBsplineCurve3d(arc0, this._extendA0, this._extendA1, this._geometryB, this._extendB0, this._extendB1, false);
+            this.dispatchArcBsplineCurve3d(arcA, this._extendA0, this._extendA1, this._geometryB, this._extendB0, this._extendB1, false);
         }
         else if (this._geometryB instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
-            const spiralApproximation = LineString3d_1.LineString3d.create();
-            this._geometryB.emitStrokes(spiralApproximation);
-            const numPreviousResults = this._results.length;
-            this.computeArcLineString(arc0, this._extendA0, this._extendA1, spiralApproximation, false, false, false);
-            const numberOfNewResults = this._results.length - numPreviousResults;
-            this.refineSpiralResultsByNewton(arc0, this._geometryB, numberOfNewResults);
+            this.dispatchCurveSpiral(arcA, this._extendA0, this._extendA1, this._geometryB, false);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
-            this.dispatchCurveCollection(arc0, this.handleArc3d.bind(this));
+            this.dispatchCurveCollection(arcA, this.handleArc3d.bind(this));
         }
         else if (this._geometryB instanceof CurveChainWithDistanceIndex_1.CurveChainWithDistanceIndex) {
-            this.dispatchCurveChainWithDistanceIndex(arc0, this.handleArc3d.bind(this));
+            this.dispatchCurveChainWithDistanceIndex(arcA, this.handleArc3d.bind(this));
         }
         return undefined;
     }
     /** Double dispatch handler for strongly typed bspline curve. */
-    handleBSplineCurve3d(curve) {
+    handleBSplineCurve3d(curveA) {
         if (this._geometryB instanceof LineSegment3d_1.LineSegment3d) {
-            this.dispatchSegmentBsplineCurve(this._geometryB, this._extendB0, this._geometryB.point0Ref, 0.0, this._geometryB.point1Ref, 1.0, this._extendB1, curve, this._extendA0, this._extendA1, true);
+            this.dispatchSegmentBsplineCurve(this._geometryB, this._extendB0, this._geometryB.point0Ref, 0.0, this._geometryB.point1Ref, 1.0, this._extendB1, curveA, this._extendA0, this._extendA1, true);
         }
         else if (this._geometryB instanceof LineString3d_1.LineString3d) {
-            this.dispatchLineStringBSplineCurve(this._geometryB, this._extendB0, this._extendB1, curve, this._extendA0, this._extendA1, true);
+            this.dispatchLineStringBSplineCurve(this._geometryB, this._extendB0, this._extendB1, curveA, this._extendA0, this._extendA1, true);
         }
         else if (this._geometryB instanceof Arc3d_1.Arc3d) {
-            this.dispatchArcBsplineCurve3d(this._geometryB, this._extendB0, this._extendB1, curve, this._extendA0, this._extendA1, true);
+            this.dispatchArcBsplineCurve3d(this._geometryB, this._extendB0, this._extendB1, curveA, this._extendA0, this._extendA1, true);
         }
         else if (this._geometryB instanceof BSplineCurve_1.BSplineCurve3dBase) {
-            this.dispatchBSplineCurve3dBSplineCurve3d(curve, this._geometryB, false);
+            this.dispatchBSplineCurve3dBSplineCurve3d(curveA, this._geometryB, false);
         }
         else if (this._geometryB instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
-            const spiralApproximation = LineString3d_1.LineString3d.create();
-            this._geometryB.emitStrokes(spiralApproximation);
-            const numPreviousResults = this._results.length;
-            this.dispatchLineStringBSplineCurve(spiralApproximation, false, false, curve, this._extendA0, this._extendA1, true);
-            const numberOfNewResults = this._results.length - numPreviousResults;
-            this.refineSpiralResultsByNewton(curve, this._geometryB, numberOfNewResults);
+            this.dispatchCurveSpiral(curveA, this._extendA0, this._extendA1, this._geometryB, false);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
-            this.dispatchCurveCollection(curve, this.handleBSplineCurve3d.bind(this));
+            this.dispatchCurveCollection(curveA, this.handleBSplineCurve3d.bind(this));
         }
         else if (this._geometryB instanceof CurveChainWithDistanceIndex_1.CurveChainWithDistanceIndex) {
-            this.dispatchCurveChainWithDistanceIndex(curve, this.handleBSplineCurve3d.bind(this));
+            this.dispatchCurveChainWithDistanceIndex(curveA, this.handleBSplineCurve3d.bind(this));
         }
         return undefined;
     }
     /**
-     * Assuming the tail of `this._results` holds the given number of approximate solutions to the curve-spiral
-     * xy-intersection problem, replace each with its Newton refinement, unless it doesn't converge, in which case
-     * it is removed.
-     * @param spiral The transition spiral.
-     * @param otherCurve The other curve primitive.
-     * @param numberOfNewResults The number of results in the tail of `this._results` to be refined.
-     * @param reversed Whether the spiral is geometryA (true) or geometryB (false).
+     * Process tail of `this._results` for xy-intersections between the curve and spiral.
+     * * If a result is not already an intersection, refine it via Newton iteration unless it doesn't converge, in which
+     * case remove it.
+     * @param curveA The other curve primitive. May also be a transition spiral.
+     * @param spiralB The transition spiral.
+     * @param index0 index of first entry in tail of `this._results` to refine.
+     * @param reversed Whether `spiralB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
      */
-    refineSpiralResultsByNewton(otherCurve, spiral, numberOfNewResults, reversed = false) {
-        const resultsToBeRefined = this._results.slice(this._results.length - numberOfNewResults);
-        this._results.length -= numberOfNewResults; // keep already refined results
-        for (const detail of resultsToBeRefined) {
-            let spiralFraction = reversed ? detail.detailA.fraction : detail.detailB.fraction;
-            let otherFraction = reversed ? detail.detailB.fraction : detail.detailA.fraction;
-            const xyMatchingFunction = new Newton_1.CurveCurveIntersectionXYRRToRRD(spiral, otherCurve);
-            const newtonSearcher = new Newton_1.Newton2dUnboundedWithDerivative(xyMatchingFunction);
-            newtonSearcher.setUV(spiralFraction, otherFraction);
+    refineSpiralResultsByNewton(curveA, spiralB, index0, reversed = false) {
+        if (index0 >= this._results.length)
+            return;
+        // ASSUME: seeds in results tail are ordered by most accurate first, as only the first convergence within tolerance is recorded.
+        const xyMatchingFunction = new Newton_1.CurveCurveIntersectionXYRRToRRD(curveA, spiralB);
+        const maxIterations = 100; // observed 73 iterations to convergence in tangent case
+        const newtonSearcher = new Newton_1.Newton2dUnboundedWithDerivative(xyMatchingFunction, maxIterations);
+        const fractionTol = 2 * newtonSearcher.stepSizeTolerance; // relative cluster diameter for Newton convergence
+        const comparePairs = (a, b) => {
+            (0, core_bentley_1.assert)(() => a.detailA.curve === b.detailA.curve && a.detailB.curve === b.detailB.curve, "pairs are compatible");
+            // sort on either fraction, then on the point, using appropriate tolerances for each
+            if (Geometry_1.Geometry.isAlmostEqualNumber(a.detailA.fraction, b.detailA.fraction, fractionTol))
+                return 0;
+            if (a.detailA.point.isAlmostEqualXY(b.detailA.point, this._coincidentGeometryContext.tolerance))
+                return 0;
+            return a.detailA.fraction - b.detailA.fraction;
+        };
+        const myResults = new core_bentley_1.SortedArray(comparePairs, core_bentley_1.DuplicatePolicy.Retain);
+        const pushToMyResults = (cpA, fA, cpB, fB) => {
+            const detailA = CurveLocationDetail_1.CurveLocationDetail.createCurveFractionPoint(cpA, fA, cpA.fractionToPoint(fA));
+            const detailB = CurveLocationDetail_1.CurveLocationDetail.createCurveFractionPoint(cpB, fB, cpB.fractionToPoint(fB));
+            detailA.setIntervalRole(CurveLocationDetail_1.CurveIntervalRole.isolated);
+            detailB.setIntervalRole(CurveLocationDetail_1.CurveIntervalRole.isolated);
+            let pushed = false;
+            myResults.insert(new CurveLocationDetail_1.CurveLocationDetailPair(reversed ? detailB : detailA, reversed ? detailA : detailB), () => pushed = true);
+            return pushed;
+        };
+        for (let i = index0; i < this._results.length; i++) {
+            const pair = this._results[i];
+            const detailA = reversed ? pair.detailB : pair.detailA;
+            const detailB = reversed ? pair.detailA : pair.detailB;
+            (0, core_bentley_1.assert)(detailB.curve instanceof LineString3d_1.LineString3d, "Caller has discretized the spiral");
+            const extendA0 = reversed ? this._extendB0 : this._extendA0;
+            const extendA1 = reversed ? this._extendB1 : this._extendA1;
+            newtonSearcher.setUV(detailA.fraction, detailB.fraction); // use linestring fraction as spiral param; it generally yields a closer point than fractional length!
             if (newtonSearcher.runIterations()) {
-                spiralFraction = newtonSearcher.getU();
-                otherFraction = newtonSearcher.getV();
-                if (this.acceptFraction(false, spiralFraction, false) && this.acceptFraction(false, otherFraction, false))
-                    this.recordPointWithLocalFractions(otherFraction, otherCurve, 0, 1, spiralFraction, spiral, 0, 1, reversed);
+                const fractionA = newtonSearcher.getU();
+                const fractionB = newtonSearcher.getV();
+                if (this.acceptFraction(extendA0, fractionA, extendA1) && this.acceptFraction(false, fractionB, false))
+                    pushToMyResults(curveA, fractionA, spiralB, fractionB);
+            }
+            else if (newtonSearcher.numIterations < 10) {
+                // if Newton failed early due to vanishing (partial) derivative, check for a root there
+                const fractionA = newtonSearcher.getU();
+                const fractionB = newtonSearcher.getV();
+                if (curveA.fractionToPoint(fractionA).isAlmostEqualXY(spiralB.fractionToPoint(fractionB), this._coincidentGeometryContext.tolerance))
+                    pushToMyResults(curveA, fractionA, spiralB, fractionB);
+            }
+        }
+        this._results.splice(index0, this._results.length - index0, ...myResults.extractArray());
+    }
+    /**
+     * Append stroke points and return the line string.
+     * * This is a convenient wrapper for [[CurvePrimitive.emitStrokes]] but the analogous instance method cannot be added
+     * to that class due to the ensuing recursion with subclass [[LineString3d]].
+     * @param options options for stroking the instance curve.
+     * @param result object to receive appended stroke points; if omitted, a new object is created, populated, and returned.
+     */
+    strokeCurve(curve, options, result) {
+        const ls = result ? result : LineString3d_1.LineString3d.create();
+        curve.emitStrokes(ls, options);
+        return ls;
+    }
+    /** Compute an approximation to the max chord height error of the stroked spiral, and another curve if a spiral. */
+    computeMaxSpiralStrokeError(spiral0, ls0, spiral1, ls1) {
+        let maxError = 0;
+        if (ls0.numEdges() > 0) {
+            // the max error occurs at the spiral end with higher curvature
+            const k0 = spiral0.fractionToCurvature(0);
+            const k1 = spiral0.fractionToCurvature(1);
+            const iChord = (k0 !== undefined && k1 !== undefined && Math.abs(k0) > Math.abs(k1)) ? 0 : ls0.numEdges() - 1;
+            const midPoint = Point3dVector3d_1.Point3d.create();
+            const detail = CurveLocationDetail_1.CurveLocationDetail.create();
+            if (ls0.packedPoints.interpolateIndexIndex(iChord, 0.5, iChord + 1, midPoint)) {
+                if (spiral0.closestPoint(midPoint, false, detail))
+                    maxError = detail.a;
+            }
+            if (spiral1 && spiral1 instanceof TransitionSpiral3d_1.TransitionSpiral3d && ls1 && ls1 instanceof LineString3d_1.LineString3d) {
+                const maxError1 = this.computeMaxSpiralStrokeError(spiral1, ls1);
+                if (maxError1 > maxError)
+                    maxError = maxError1;
             }
         }
+        return maxError;
+    }
+    /**
+     * Solve the intersection problem for stroked, unextended curveB.
+     * * @return the number of results appended.
+     */
+    appendDiscreteIntersectionResults(curveA, extendA0, extendA1, lsB, reversed) {
+        const i0 = this._results.length;
+        // handleLineString3d requires us to swap geometries:
+        const geomB = this._geometryB;
+        const extendB0 = this._extendB0;
+        const extendB1 = this._extendB1;
+        this.resetGeometryA(false, false); // lsB is never extended
+        this.resetGeometryB(curveA, extendA0, extendA1);
+        this.handleLineString3d(lsB); // this puts lsB data in detailA, as expected when reversed is true
+        if (!reversed) { // swap lsB data to detailB
+            for (let i = i0; i < this._results.length; i++)
+                this._results[i].swapDetails();
+        }
+        this.resetGeometryA(extendA0, extendA1);
+        this.resetGeometryB(geomB, extendB0, extendB1);
+        return this._results.length - i0;
+    }
+    /**
+     * Solve the close approach problem for stroked, unextended curveB.
+     * * Sort the results shortest projection distance first.
+     * @return the number of results appended.
+     */
+    appendDiscreteCloseApproachResults(curveA, lsB, maxDistance, reversed) {
+        const i0 = this._results.length;
+        const closeApproachPairs = CurveCurve_1.CurveCurve.closeApproachProjectedXYPairs(reversed ? lsB : curveA, reversed ? curveA : lsB, maxDistance);
+        closeApproachPairs.sort((p0, p1) => p0.detailA.a - p1.detailA.a);
+        this._results.push(...closeApproachPairs);
+        return this._results.length - i0;
+    }
+    /**
+     * Compute the xy-intersection of a curve and a spiral.
+     * * When `curveA` is extended, duplicate solutions may be returned.
+     * @param curveA curve to intersect with spiralB. May also be a transition spiral.
+     * @param extendA0 whether to compute xy-intersections with curveA extended beyond its start.
+     * @param extendA1 whether to compute xy-intersections with curveA extended beyond its end.
+     * @param spiralB transition spiral to intersect with curveA.
+     * @param reversed whether `spiralB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
+     */
+    dispatchCurveSpiral(curveA, extendA0, extendA1, spiralB, reversed) {
+        let cpA = curveA;
+        if (curveA instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
+            cpA = this.strokeCurve(curveA);
+            extendA0 = extendA1 = false;
+        }
+        const cpB = this.strokeCurve(spiralB);
+        const maxError = 1.01 * this.computeMaxSpiralStrokeError(spiralB, cpB, curveA, cpA);
+        const index0 = this._results.length;
+        // append seeds computed by solving discretized spiral problems, then refine the seeds via Newton
+        this.appendDiscreteIntersectionResults(cpA, extendA0, extendA1, cpB, reversed); // recorded first because more accurate
+        this.appendDiscreteCloseApproachResults(cpA, cpB, maxError, reversed); // seeds for finding tangent intersections
+        this.refineSpiralResultsByNewton(curveA, spiralB, index0, reversed);
     }
     /** Double dispatch handler for strongly typed spiral curve. */
     handleTransitionSpiral(spiral) {
-        if (this._geometryB instanceof CurvePrimitive_1.CurvePrimitive) { // this also handles CurveChainWithDistanceIndex
-            const spiralApproximation = LineString3d_1.LineString3d.create();
-            spiral.emitStrokes(spiralApproximation);
-            const numPreviousResults = this._results.length;
-            this.handleLineString3d(spiralApproximation);
-            const numberOfNewResults = this._results.length - numPreviousResults;
-            this.refineSpiralResultsByNewton(this._geometryB, spiral, numberOfNewResults, true);
+        if (this._geometryB instanceof CurveChainWithDistanceIndex_1.CurveChainWithDistanceIndex) {
+            this.dispatchCurveChainWithDistanceIndex(spiral, this.handleTransitionSpiral.bind(this));
+        }
+        else if (this._geometryB instanceof CurvePrimitive_1.CurvePrimitive) {
+            this.dispatchCurveSpiral(this._geometryB, this._extendB0, this._extendB1, spiral, true);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
             this.dispatchCurveCollection(spiral, this.handleTransitionSpiral.bind(this));