@itwin/core-geometry 5.12.0-dev.9 → 5.13.0-dev.1

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

@@ -38,8 +38,6 @@ class MultiChainCollector {
     _chains;
     /** Largest gap distance to close. */
     _gapTolerance;
-    /** End point snap tolerance. Internally, this is an upper bound on gapTolerance. */
-    _snapTolerance;
     /** Planarity tolerance, used to determine whether to return a Path or Loop in `grabResult(true)`. If undefined, always Path. */
     _planeTolerance;
     static _staticPointA;
@@ -48,30 +46,28 @@ class MultiChainCollector {
     _xyzWork1;
     /** Initialize with an empty array of chains.
      * @param gapTolerance distance tolerance for calling endpoints identical
-     * @param planeTolerance distance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
+     * @param planeTolerance distance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within this tolerance of a plane.
      */
     constructor(gapTolerance = Geometry_1.Geometry.smallMetricDistance, planeTolerance) {
         this._chains = [];
         this._gapTolerance = gapTolerance;
-        this._snapTolerance = Geometry_1.Geometry.smallMetricDistance;
         this._planeTolerance = planeTolerance;
     }
     /**
      * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz
      * @param xyz endpoint to check
-     * @param distanceTol absolute distance tolerance for equating endpoints
      * @param exceptChainIndex index of chain to ignore. Send -1 to consider all chains.
      */
-    findAnyChainToConnect(xyz, distanceTol, exceptChainIndex = -1) {
+    findAnyChainToConnect(xyz, exceptChainIndex = -1) {
         for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {
             if (exceptChainIndex === chainIndexA)
                 continue;
             const chain = this._chains[chainIndexA];
             this._xyzWork1 = chain[chain.length - 1].endPoint(this._xyzWork1);
-            if (this._xyzWork1.isAlmostEqual(xyz, distanceTol))
+            if (this._xyzWork1.isAlmostEqual(xyz, this._gapTolerance))
                 return { chainIndex: chainIndexA, atEnd: true };
             this._xyzWork1 = chain[0].startPoint(this._xyzWork1);
-            if (this._xyzWork1.isAlmostEqual(xyz, distanceTol))
+            if (this._xyzWork1.isAlmostEqual(xyz, this._gapTolerance))
                 return { chainIndex: chainIndexA, atEnd: false };
         }
         return undefined;
@@ -83,11 +79,7 @@ class MultiChainCollector {
      * @param candidate curve to add to the context
      */
     captureCurvePrimitive(candidate) {
-        if (this._snapTolerance < this._gapTolerance) {
-            if (this.attachPrimitiveToAnyChain(candidate, this._snapTolerance))
-                return;
-        }
-        if (this.attachPrimitiveToAnyChain(candidate, this._gapTolerance))
+        if (this.attachPrimitiveToAnyChain(candidate))
             return;
         this._chains.push([candidate]);
     }
@@ -106,7 +98,7 @@ class MultiChainCollector {
         }
     }
     /** If allowed by the geometry type, move an endpoint. */
-    static simpleEndPointMove(curve, atEnd, to) {
+    simpleEndPointMove(curve, atEnd, to) {
         if (curve instanceof (LineSegment3d_1.LineSegment3d)) {
             if (atEnd) {
                 curve.point1Ref.setFrom(to);
@@ -128,89 +120,92 @@ class MultiChainCollector {
      * * All z-coordinates are ignored.
      * @param curve0 first curve, assumed to end close to the start of curve1
      * @param curve1 second curve, assumed to start close to the end of curve0
-     * @param gapTolerance max distance to move a curve start/end point
      * @returns whether curve start/end point(s) moved
      */
-    static moveHeadOrTail(curve0, curve1, gapTolerance) {
+    moveHeadOrTail(curve0, curve1) {
         const xyz0 = curve0.endPoint();
         const xyz1 = curve1.startPoint();
         const minShift = Geometry_1.Geometry.smallMetricDistance * 0.001;
-        const d01 = xyz0.distanceXY(xyz1);
-        if (d01 < minShift)
+        let dist2 = xyz0.distanceSquaredXY(xyz1);
+        if (dist2 <= minShift * minShift)
+            return false; // if the move would be miniscule, don't bother
+        const gap2 = this._gapTolerance * this._gapTolerance;
+        if (dist2 > gap2)
             return false;
         // try lines and linestrings
-        if (d01 < gapTolerance) {
-            if (this.simpleEndPointMove(curve1, false, xyz0) || this.simpleEndPointMove(curve0, true, xyz1))
-                return true;
-        }
+        if (this.simpleEndPointMove(curve1, false, xyz0) || this.simpleEndPointMove(curve0, true, xyz1))
+            return true;
         // try other primitive types
+        if (!(curve0 instanceof Arc3d_1.Arc3d && curve1 instanceof Arc3d_1.Arc3d))
+            return false; // currently we only consider 2 arcs
         const intersections = CurveCurve_1.CurveCurve.intersectionXYPairs(curve0, true, curve1, true);
-        const shiftFactor = 5.0;
-        for (const pair of intersections) {
-            const detail0 = pair.detailA;
-            const detail1 = pair.detailB;
-            const distance0 = detail0.point.distanceXY(xyz0);
-            const distance1 = detail1.point.distanceXY(xyz1);
-            if (distance0 < shiftFactor * gapTolerance && distance1 < shiftFactor * gapTolerance) {
-                if (curve0 instanceof Arc3d_1.Arc3d && curve1 instanceof Arc3d_1.Arc3d) {
-                    const radians0End = curve0.sweep.fractionToRadians(detail0.fraction);
-                    curve0.sweep.setStartEndRadians(curve0.sweep.startRadians, radians0End);
-                    const radians1Start = curve1.sweep.fractionToRadians(detail1.fraction);
-                    curve1.sweep.setStartEndRadians(radians1Start, curve1.sweep.endRadians);
-                    return true;
-                }
-                // TODO: other combinations of types
+        let iClosest = -1;
+        let minDist2 = Infinity;
+        for (let i = 0; i < intersections.length; ++i) { // find intersection closest to the joint
+            const dist20 = intersections[i].detailA.point.distanceSquaredXY(xyz0);
+            const dist21 = intersections[i].detailB.point.distanceSquaredXY(xyz1);
+            dist2 = dist20 + dist21;
+            if (dist20 <= gap2 && dist21 <= gap2 && dist2 < minDist2) {
+                minDist2 = dist2;
+                iClosest = i;
             }
         }
+        if (iClosest >= 0) { // move arc ends to the intersection point
+            const radians0End = curve0.sweep.fractionToRadians(intersections[iClosest].detailA.fraction);
+            curve0.sweep.setStartEndRadians(curve0.sweep.startRadians, radians0End);
+            const radians1Start = curve1.sweep.fractionToRadians(intersections[iClosest].detailB.fraction);
+            curve1.sweep.setStartEndRadians(radians1Start, curve1.sweep.endRadians);
+            return true;
+        }
         return false;
     }
     /** Announce a curve primitive
      * * If a "nearby" connection is possible, insert the candidate in the chain and force endpoint match.
      * * Otherwise start a new chain.
      */
-    attachPrimitiveToAnyChain(candidate, distanceTol) {
-        if (candidate.curveLength() < distanceTol) {
+    attachPrimitiveToAnyChain(candidate) {
+        if (candidate.curveLength() < this._gapTolerance) {
             return true;
         }
         else {
             this._xyzWork0 = candidate.startPoint(this._xyzWork0);
-            let connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol);
+            let connect = this.findAnyChainToConnect(this._xyzWork0);
             if (connect) {
                 if (connect.atEnd) {
                     const chain = this._chains[connect.chainIndex];
                     const index0 = chain.length - 1;
                     this._chains[connect.chainIndex].push(candidate);
-                    MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);
-                    this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);
+                    this.moveHeadOrTail(chain[index0], chain[index0 + 1]);
+                    this.searchAndMergeChainIndex(connect.chainIndex);
                     return true;
                 }
                 else {
                     candidate.reverseInPlace();
                     const chain = this._chains[connect.chainIndex];
                     chain.splice(0, 0, candidate);
-                    MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);
-                    this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);
+                    this.moveHeadOrTail(chain[0], chain[1]);
+                    this.searchAndMergeChainIndex(connect.chainIndex);
                     return true;
                 }
             }
             else {
                 this._xyzWork0 = candidate.endPoint(this._xyzWork0);
-                connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol);
+                connect = this.findAnyChainToConnect(this._xyzWork0);
                 if (connect) {
                     if (connect.atEnd) {
                         candidate.reverseInPlace();
                         const chain = this._chains[connect.chainIndex];
                         const index0 = chain.length - 1;
                         this._chains[connect.chainIndex].push(candidate);
-                        MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);
-                        this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);
+                        this.moveHeadOrTail(chain[index0], chain[index0 + 1]);
+                        this.searchAndMergeChainIndex(connect.chainIndex);
                         return true;
                     }
                     else {
                         const chain = this._chains[connect.chainIndex];
                         chain.splice(0, 0, candidate);
-                        MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);
-                        this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);
+                        this.moveHeadOrTail(chain[0], chain[1]);
+                        this.searchAndMergeChainIndex(connect.chainIndex);
                         return true;
                     }
                 }
@@ -247,13 +242,13 @@ class MultiChainCollector {
             p.reverseInPlace();
     }
     /** See if the head or tail of chainIndex matches any existing chain. If so, merge the two chains. */
-    searchAndMergeChainIndex(chainIndex, distanceTol) {
+    searchAndMergeChainIndex(chainIndex) {
         // ASSUME valid index of non-empty chain
         const chain = this._chains[chainIndex];
         const lastIndexInChain = chain.length - 1;
         this._xyzWork0 = chain[0].startPoint(this._xyzWork0);
         // try start with any other chain
-        let connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol, chainIndex);
+        let connect = this.findAnyChainToConnect(this._xyzWork0, chainIndex);
         if (connect) {
             if (!connect.atEnd)
                 this.reverseChain(connect.chainIndex);
@@ -262,7 +257,7 @@ class MultiChainCollector {
         }
         // try end with any other chain
         this._xyzWork0 = chain[lastIndexInChain].endPoint(this._xyzWork0);
-        connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol, chainIndex);
+        connect = this.findAnyChainToConnect(this._xyzWork0, chainIndex);
         if (connect) {
             if (connect.atEnd)
                 this.reverseChain(connect.chainIndex);
@@ -284,7 +279,7 @@ class MultiChainCollector {
             const primitiveN = curves[curves.length - 1];
             MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);
             MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);
-            if (MultiChainCollector.moveHeadOrTail(primitiveN, primitive0, this._gapTolerance)) {
+            if (this.moveHeadOrTail(primitiveN, primitive0)) {
                 // get the corrected coordinates
                 MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);
                 MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);

package/lib/cjs/curve/internalContexts/MultiChainCollector.js.map

@@ -1 +1 @@
-{"version":3,"file":"MultiChainCollector.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,6CAA0C;AAC1C,gEAA6D;AAG7D,oCAAiC;AACjC,wDAAkE;AAClE,8CAA2C;AAC3C,sDAAmD;AAEnD,oDAAiD;AACjD,kDAA+C;AAC/C,kCAA+B;AAC/B,kCAA+B;AAC/B,4CAAyC;AAGzC;;;;;;;;;;;;;GAaG;AACH,MAAa,mBAAmB;IAC9B,0BAA0B;IAClB,OAAO,CAAqB;IACpC,qCAAqC;IAC7B,aAAa,CAAS;IAC9B,oFAAoF;IAC5E,cAAc,CAAS;IAC/B,gIAAgI;IACxH,eAAe,CAAqB;IAEpC,MAAM,CAAC,aAAa,CAAU;IAC9B,MAAM,CAAC,aAAa,CAAU;IAC9B,SAAS,CAAW;IACpB,SAAS,CAAW;IAE5B;;;OAGG;IACH,YAAmB,YAAY,GAAG,mBAAQ,CAAC,mBAAmB,EAAE,cAAuB;QACrF,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,cAAc,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QACnD,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;IACxC,CAAC;IACD;;;;;OAKG;IACK,qBAAqB,CAAC,GAAY,EAAE,WAAmB,EAAE,mBAA2B,CAAC,CAAC;QAC5F,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;YAC3E,IAAI,gBAAgB,KAAK,WAAW;gBAClC,SAAS;YACX,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACxC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAClE,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,WAAW,CAAC;gBAChD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrD,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,WAAW,CAAC;gBAChD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,qBAAqB,CAAC,SAAyB;QACpD,IAAI,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,cAAc,CAAC;gBAChE,OAAO;QACX,CAAC;QACD,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC;YAC/D,OAAO;QACT,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACjC,CAAC;IACD;;;;;OAKG;IACI,YAAY,CAAC,SAAmB;QACrC,IAAI,SAAS,YAAY,+BAAc;YACrC,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;aACnC,IAAI,SAAS,YAAY,iCAAe,EAAE,CAAC;YAC9C,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ;gBAChC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,yDAAyD;IACjD,MAAM,CAAC,kBAAkB,CAAC,KAAqB,EAAE,KAAc,EAAE,EAAU;QACjF,IAAI,KAAK,YAAY,CAAC,6BAAa,CAAC,EAAE,CAAC;YACrC,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,KAAK,YAAY,2BAAY,IAAI,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC;YAClE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,KAAK,CAAC,YAAY,CAAC,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,cAAc,CAAC,MAAsB,EAAE,MAAsB,EAAE,YAAoB;QAChG,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,mBAAmB,GAAG,KAAK,CAAC;QACtD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,QAAQ;YAChB,OAAO,KAAK,CAAC;QACf,4BAA4B;QAC5B,IAAI,GAAG,GAAG,YAAY,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;gBAC7F,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,4BAA4B;QAC5B,MAAM,aAAa,GAAG,uBAAU,CAAC,mBAAmB,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjF,MAAM,WAAW,GAAG,GAAG,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YAC7B,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,SAAS,GAAG,WAAW,GAAG,YAAY,IAAI,SAAS,GAAG,WAAW,GAAG,YAAY,EAAE,CAAC;gBACrF,IAAI,MAAM,YAAY,aAAK,IAAI,MAAM,YAAY,aAAK,EAAE,CAAC;oBACvD,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACrE,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;oBACxE,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACvE,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,aAAa,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBACxE,OAAO,IAAI,CAAC;gBACd,CAAC;gBACD,oCAAoC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,yBAAyB,CAAC,SAAyB,EAAE,WAAmB;QAC9E,IAAI,SAAS,CAAC,WAAW,EAAE,GAAG,WAAW,EAAE,CAAC;YAC1C,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACtD,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;YACtE,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;oBAClB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACjD,mBAAmB,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;oBACzF,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;oBAC/D,OAAO,IAAI,CAAC;gBACd,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,cAAc,EAAE,CAAC;oBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC9B,mBAAmB,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;oBAC3E,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;oBAC/D,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;gBAClE,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;wBAClB,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;wBAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACjD,mBAAmB,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;wBACzF,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;wBAC/D,OAAO,IAAI,CAAC;oBACd,CAAC;yBAAM,CAAC;wBACN,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;wBAC9B,mBAAmB,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;wBAC3E,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;wBAC/D,OAAO,IAAI,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;OAQG;IACK,yBAAyB,CAAC,WAAmB,EAAE,WAAmB;QACxE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,wBAAwB;QAC3C,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/C,IAAI,WAAW,KAAK,cAAc;YAChC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QAC3D,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;IACrB,CAAC;IACD,wCAAwC;IAChC,YAAY,CAAC,UAAkB;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvC,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,KAAK;YACnB,CAAC,CAAC,cAAc,EAAE,CAAC;IACvB,CAAC;IACD,qGAAqG;IAC7F,wBAAwB,CAAC,UAAkB,EAAE,WAAmB;QACtE,wCAAwC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvC,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrD,iCAAiC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QAClF,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,OAAO,CAAC,KAAK;gBAChB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC/D,OAAO;QACT,CAAC;QACD,+BAA+B;QAC/B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClE,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QAC9E,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,OAAO,CAAC,KAAK;gBACf,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,CAAC,yBAAyB,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;YAC/D,OAAO;QACT,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE,CAAC;YACrB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC7C,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC7F,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC3F,IAAI,mBAAmB,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;gBACnF,gCAAgC;gBAChC,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;gBAC7F,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC7F,CAAC;YACD,IAAI,mBAAmB,CAAC,aAAa,CAAC,aAAa,CAAC,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;gBAC3G,MAAM,YAAY,GAAG,2BAAY,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC;gBACxE,IAAI,YAAY,EAAE,CAAC;oBACjB,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;oBAC5C,IAAI,YAAY,EAAE,CAAC;wBACjB,MAAM,KAAK,GAAG,qBAAS,CAAC,eAAe,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;wBAC9D,IAAI,IAAI,CAAC,eAAe,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;4BAClF,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;wBAClC,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,wEAAwE;IAChE,mBAAmB,CAAC,KAAuB,EAAE,OAAuB;QAC1E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,KAAK;YACvB,KAAK,CAAC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QACzC,UAAU,CAAC,qBAAqB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrD,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,8EAA8E;IACvE,UAAU,CAAC,mBAA4B,KAAK;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;MAGE;IACK,4BAA4B,CAAC,aAAyC,EAAE,OAAuB;QACpG,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACxD,IAAI,EAAE;gBACJ,aAAa,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBACpD,IAAI,EAAE;oBACJ,aAAa,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAxTD,kDAwTC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { FrameBuilder } from \"../../geometry3d/FrameBuilder\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { XYAndZ } from \"../../geometry3d/XYZProps\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { BagOfCurves, CurveCollection } from \"../CurveCollection\";\r\nimport { CurveCurve } from \"../CurveCurve\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { AnyChain, AnyCurve } from \"../CurveTypes\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop } from \"../Loop\";\r\nimport { Path } from \"../Path\";\r\nimport { RegionOps } from \"../RegionOps\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\n\r\n/**\r\n * Manage a growing array of arrays of curve primitives that are to be joined \"head to tail\" in paths.\r\n * * The caller makes a sequence of calls to announce individual primitives.\r\n * * This collector (unlike the simpler [[ChainCollectorContext]]) expects to have inputs arriving in random order, leaving multiple open chains in play at any time.\r\n * * When all curves have been announced, the call to `grabResult` restructures the various active chains into Paths (and optionally, Loops).\r\n * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n * * Usage pattern is\r\n *   * initialization: `context = new MultiChainCollector(gapTol, planeTol)`\r\n *   * many times:\r\n *       * `context.captureCurve(anyCurve)`\r\n *       * `context.captureCurvePrimitive(primitive)`\r\n *   * end: `result = context.grabResult(makeLoopIfClosed)`\r\n * @internal\r\n */\r\nexport class MultiChainCollector {\r\n  /** Accumulated chains. */\r\n  private _chains: CurvePrimitive[][];\r\n  /** Largest gap distance to close. */\r\n  private _gapTolerance: number;\r\n  /** End point snap tolerance. Internally, this is an upper bound on gapTolerance. */\r\n  private _snapTolerance: number;\r\n  /** Planarity tolerance, used to determine whether to return a Path or Loop in `grabResult(true)`. If undefined, always Path. */\r\n  private _planeTolerance: number | undefined;\r\n\r\n  private static _staticPointA: Point3d;\r\n  private static _staticPointB: Point3d;\r\n  private _xyzWork0?: Point3d;\r\n  private _xyzWork1?: Point3d;\r\n\r\n  /** Initialize with an empty array of chains.\r\n   * @param gapTolerance distance tolerance for calling endpoints identical\r\n   * @param planeTolerance distance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.\r\n   */\r\n  public constructor(gapTolerance = Geometry.smallMetricDistance, planeTolerance?: number) {\r\n    this._chains = [];\r\n    this._gapTolerance = gapTolerance;\r\n    this._snapTolerance = Geometry.smallMetricDistance;\r\n    this._planeTolerance = planeTolerance;\r\n  }\r\n  /**\r\n   * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz\r\n   * @param xyz endpoint to check\r\n   * @param distanceTol absolute distance tolerance for equating endpoints\r\n   * @param exceptChainIndex index of chain to ignore. Send -1 to consider all chains.\r\n   */\r\n  private findAnyChainToConnect(xyz: Point3d, distanceTol: number, exceptChainIndex: number = -1): { chainIndex: number, atEnd: boolean } | undefined {\r\n    for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {\r\n      if (exceptChainIndex === chainIndexA)\r\n        continue;\r\n      const chain = this._chains[chainIndexA];\r\n      this._xyzWork1 = chain[chain.length - 1].endPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz, distanceTol))\r\n        return { chainIndex: chainIndexA, atEnd: true };\r\n      this._xyzWork1 = chain[0].startPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz, distanceTol))\r\n        return { chainIndex: chainIndexA, atEnd: false };\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Insert a single curve primitive into the active chains.\r\n   * * The primitive is captured (not cloned)\r\n   * * The primitive may be reversed in place\r\n   * @param candidate curve to add to the context\r\n   */\r\n  public captureCurvePrimitive(candidate: CurvePrimitive) {\r\n    if (this._snapTolerance < this._gapTolerance) {\r\n      if (this.attachPrimitiveToAnyChain(candidate, this._snapTolerance))\r\n        return;\r\n    }\r\n    if (this.attachPrimitiveToAnyChain(candidate, this._gapTolerance))\r\n      return;\r\n    this._chains.push([candidate]);\r\n  }\r\n  /**\r\n   * Insert any curve into the collection.\r\n   * * This recurses into Path, Loop, BagOfCurves etc\r\n   * * All primitives are captured, and may be reversed in place.\r\n   * @param candidate curve to add to the context\r\n   */\r\n  public captureCurve(candidate: AnyCurve) {\r\n    if (candidate instanceof CurvePrimitive)\r\n      this.captureCurvePrimitive(candidate);\r\n    else if (candidate instanceof CurveCollection) {\r\n      for (const c of candidate.children)\r\n        this.captureCurve(c);\r\n    }\r\n  }\r\n  /** If allowed by the geometry type, move an endpoint. */\r\n  private static simpleEndPointMove(curve: CurvePrimitive, atEnd: boolean, to: XYAndZ): boolean {\r\n    if (curve instanceof (LineSegment3d)) {\r\n      if (atEnd) {\r\n        curve.point1Ref.setFrom(to);\r\n      } else {\r\n        curve.point0Ref.setFrom(to);\r\n      }\r\n      return true;\r\n    } else if (curve instanceof LineString3d && curve.numPoints() > 0) {\r\n      const i = atEnd ? curve.numPoints() - 1 : 0;\r\n      curve.packedPoints.setAtCheckedPointIndex(i, to);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Try to move the end of curve0 and/or the start of curve1 to a common point.\r\n   * * All z-coordinates are ignored.\r\n   * @param curve0 first curve, assumed to end close to the start of curve1\r\n   * @param curve1 second curve, assumed to start close to the end of curve0\r\n   * @param gapTolerance max distance to move a curve start/end point\r\n   * @returns whether curve start/end point(s) moved\r\n   */\r\n  private static moveHeadOrTail(curve0: CurvePrimitive, curve1: CurvePrimitive, gapTolerance: number): boolean {\r\n    const xyz0 = curve0.endPoint();\r\n    const xyz1 = curve1.startPoint();\r\n    const minShift = Geometry.smallMetricDistance * 0.001;\r\n    const d01 = xyz0.distanceXY(xyz1);\r\n    if (d01 < minShift)\r\n      return false;\r\n    // try lines and linestrings\r\n    if (d01 < gapTolerance) {\r\n      if (this.simpleEndPointMove(curve1, false, xyz0) || this.simpleEndPointMove(curve0, true, xyz1))\r\n        return true;\r\n    }\r\n    // try other primitive types\r\n    const intersections = CurveCurve.intersectionXYPairs(curve0, true, curve1, true);\r\n    const shiftFactor = 5.0;\r\n    for (const pair of intersections) {\r\n      const detail0 = pair.detailA;\r\n      const detail1 = pair.detailB;\r\n      const distance0 = detail0.point.distanceXY(xyz0);\r\n      const distance1 = detail1.point.distanceXY(xyz1);\r\n      if (distance0 < shiftFactor * gapTolerance && distance1 < shiftFactor * gapTolerance) {\r\n        if (curve0 instanceof Arc3d && curve1 instanceof Arc3d) {\r\n          const radians0End = curve0.sweep.fractionToRadians(detail0.fraction);\r\n          curve0.sweep.setStartEndRadians(curve0.sweep.startRadians, radians0End);\r\n          const radians1Start = curve1.sweep.fractionToRadians(detail1.fraction);\r\n          curve1.sweep.setStartEndRadians(radians1Start, curve1.sweep.endRadians);\r\n          return true;\r\n        }\r\n        // TODO: other combinations of types\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Announce a curve primitive\r\n   * * If a \"nearby\" connection is possible, insert the candidate in the chain and force endpoint match.\r\n   * * Otherwise start a new chain.\r\n   */\r\n  private attachPrimitiveToAnyChain(candidate: CurvePrimitive, distanceTol: number): boolean {\r\n    if (candidate.curveLength() < distanceTol) {\r\n      return true;\r\n    } else {\r\n      this._xyzWork0 = candidate.startPoint(this._xyzWork0);\r\n      let connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol);\r\n      if (connect) {\r\n        if (connect.atEnd) {\r\n          const chain = this._chains[connect.chainIndex];\r\n          const index0 = chain.length - 1;\r\n          this._chains[connect.chainIndex].push(candidate);\r\n          MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);\r\n          this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);\r\n          return true;\r\n        } else {\r\n          candidate.reverseInPlace();\r\n          const chain = this._chains[connect.chainIndex];\r\n          chain.splice(0, 0, candidate);\r\n          MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);\r\n          this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);\r\n          return true;\r\n        }\r\n      } else {\r\n        this._xyzWork0 = candidate.endPoint(this._xyzWork0);\r\n        connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol);\r\n        if (connect) {\r\n          if (connect.atEnd) {\r\n            candidate.reverseInPlace();\r\n            const chain = this._chains[connect.chainIndex];\r\n            const index0 = chain.length - 1;\r\n            this._chains[connect.chainIndex].push(candidate);\r\n            MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);\r\n            this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);\r\n            return true;\r\n          } else {\r\n            const chain = this._chains[connect.chainIndex];\r\n            chain.splice(0, 0, candidate);\r\n            MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);\r\n            this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);\r\n            return true;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Merge two entries in the chain array.\r\n   * * Move each primitive from chainB to the end of chainA.\r\n   * * Clear chainB.\r\n   * * Move the final chain to chainB index.\r\n   * * Decrement the array length.\r\n   * @param chainIndexA index of chainA\r\n   * @param chainIndexB index of chainB\r\n   */\r\n  private mergeChainsForwardForward(chainIndexA: number, chainIndexB: number) {\r\n    const chainA = this._chains[chainIndexA];\r\n    const chainB = this._chains[chainIndexB];\r\n    for (const p of chainB) {\r\n      chainA.push(p);\r\n    }\r\n    chainB.length = 0; // chainIndexB is unused\r\n    const lastChainIndex = this._chains.length - 1;\r\n    if (chainIndexB !== lastChainIndex)\r\n      this._chains[chainIndexB] = this._chains[lastChainIndex];\r\n    this._chains.pop();\r\n  }\r\n  /** Reverse the curve chain in place. */\r\n  private reverseChain(chainIndex: number) {\r\n    const chain = this._chains[chainIndex];\r\n    chain.reverse();\r\n    for (const p of chain)\r\n      p.reverseInPlace();\r\n  }\r\n  /** See if the head or tail of chainIndex matches any existing chain. If so, merge the two chains. */\r\n  private searchAndMergeChainIndex(chainIndex: number, distanceTol: number): void {\r\n    // ASSUME valid index of non-empty chain\r\n    const chain = this._chains[chainIndex];\r\n    const lastIndexInChain = chain.length - 1;\r\n    this._xyzWork0 = chain[0].startPoint(this._xyzWork0);\r\n    // try start with any other chain\r\n    let connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol, chainIndex);\r\n    if (connect) {\r\n      if (!connect.atEnd)\r\n        this.reverseChain(connect.chainIndex);\r\n      this.mergeChainsForwardForward(connect.chainIndex, chainIndex);\r\n      return;\r\n    }\r\n    // try end with any other chain\r\n    this._xyzWork0 = chain[lastIndexInChain].endPoint(this._xyzWork0);\r\n    connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol, chainIndex);\r\n    if (connect) {\r\n      if (connect.atEnd)\r\n        this.reverseChain(connect.chainIndex);\r\n      this.mergeChainsForwardForward(chainIndex, connect.chainIndex);\r\n      return;\r\n    }\r\n  }\r\n  /**\r\n   * Convert an array of curve primitives into the simplest possible strongly typed curve structure.\r\n   * @param curves input array, assembled correctly into a single contiguous path, captured by returned object\r\n   * @param makeLoopIfClosed whether to return a Loop from physically closed coplanar curves, otherwise Path\r\n   * @return Loop or Path if multiple curves; the primitive if only one curve; undefined if no curves\r\n   */\r\n  private promoteArrayToCurves(curves: CurvePrimitive[], makeLoopIfClosed: boolean): CurvePrimitive | Path | Loop | undefined {\r\n    if (curves.length === 0)\r\n      return undefined;\r\n    if (makeLoopIfClosed) {\r\n      const primitive0 = curves[0];\r\n      const primitiveN = curves[curves.length - 1];\r\n      MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);\r\n      MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);\r\n      if (MultiChainCollector.moveHeadOrTail(primitiveN, primitive0, this._gapTolerance)) {\r\n        // get the corrected coordinates\r\n        MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);\r\n        MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);\r\n      }\r\n      if (MultiChainCollector._staticPointA.isAlmostEqual(MultiChainCollector._staticPointB, this._gapTolerance)) {\r\n        const localToWorld = FrameBuilder.createRightHandedLocalToWorld(curves);\r\n        if (localToWorld) {\r\n          const worldToLocal = localToWorld.inverse();\r\n          if (worldToLocal) {\r\n            const range = RegionOps.curveArrayRange(curves, worldToLocal);\r\n            if (this._planeTolerance !== undefined && range.zLength() <= this._planeTolerance) {\r\n              return Loop.createArray(curves);\r\n            }\r\n          }\r\n        }\r\n        return Path.createArray(curves);\r\n      }\r\n    }\r\n    if (curves.length === 1)\r\n      return curves[0];\r\n    return Path.createArray(curves);\r\n  }\r\n  /** Stroke the curve chain to a line string, de-duplicate the points. */\r\n  private chainToLineString3d(chain: CurvePrimitive[], options?: StrokeOptions): LineString3d | undefined {\r\n    if (chain.length === 0)\r\n      return undefined;\r\n    const linestring = LineString3d.create();\r\n    for (const curve of chain)\r\n      curve.emitStrokes(linestring, options);\r\n    linestring.removeDuplicatePoints(this._gapTolerance);\r\n    return linestring;\r\n  }\r\n  /** Return the collected results, structured as the simplest possible type. */\r\n  public grabResult(makeLoopIfClosed: boolean = false): AnyChain | undefined {\r\n    const chains = this._chains;\r\n    if (chains.length === 0)\r\n      return undefined;\r\n    if (chains.length === 1)\r\n      return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);\r\n    const bag = BagOfCurves.create();\r\n    for (const chain of chains) {\r\n      const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);\r\n      bag.tryAddChild(q);\r\n    }\r\n    return bag;\r\n  }\r\n  /**\r\n   * Return chains as individual calls to announceChain.\r\n   * * Does not use planeTolerance.\r\n  */\r\n  public announceChainsAsLineString3d(announceChain: (ls: LineString3d) => void, options?: StrokeOptions): void {\r\n    const chains = this._chains;\r\n    if (chains.length === 1) {\r\n      const ls = this.chainToLineString3d(chains[0], options);\r\n      if (ls)\r\n        announceChain(ls);\r\n    } else if (chains.length > 1) {\r\n      for (const chain of chains) {\r\n        const ls = this.chainToLineString3d(chain, options);\r\n        if (ls)\r\n          announceChain(ls);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"MultiChainCollector.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,6CAA0C;AAC1C,gEAA6D;AAG7D,oCAAiC;AACjC,wDAAkE;AAClE,8CAA2C;AAC3C,sDAAmD;AAEnD,oDAAiD;AACjD,kDAA+C;AAC/C,kCAA+B;AAC/B,kCAA+B;AAC/B,4CAAyC;AAGzC;;;;;;;;;;;;;GAaG;AACH,MAAa,mBAAmB;IAC9B,0BAA0B;IAClB,OAAO,CAAqB;IACpC,qCAAqC;IAC7B,aAAa,CAAS;IAC9B,gIAAgI;IACxH,eAAe,CAAqB;IAEpC,MAAM,CAAC,aAAa,CAAU;IAC9B,MAAM,CAAC,aAAa,CAAU;IAC9B,SAAS,CAAW;IACpB,SAAS,CAAW;IAE5B;;;OAGG;IACH,YAAmB,YAAY,GAAG,mBAAQ,CAAC,mBAAmB,EAAE,cAAuB;QACrF,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;IACxC,CAAC;IACD;;;;OAIG;IACK,qBAAqB,CAAC,GAAY,EAAE,mBAA2B,CAAC,CAAC;QACvE,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;YAC3E,IAAI,gBAAgB,KAAK,WAAW;gBAClC,SAAS;YACX,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACxC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAClE,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,aAAa,CAAC;gBACvD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrD,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,aAAa,CAAC;gBACvD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,qBAAqB,CAAC,SAAyB;QACpD,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,CAAC;YAC3C,OAAO;QACT,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACjC,CAAC;IACD;;;;;OAKG;IACI,YAAY,CAAC,SAAmB;QACrC,IAAI,SAAS,YAAY,+BAAc;YACrC,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;aACnC,IAAI,SAAS,YAAY,iCAAe,EAAE,CAAC;YAC9C,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ;gBAChC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,yDAAyD;IACjD,kBAAkB,CAAC,KAAqB,EAAE,KAAc,EAAE,EAAU;QAC1E,IAAI,KAAK,YAAY,CAAC,6BAAa,CAAC,EAAE,CAAC;YACrC,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,KAAK,YAAY,2BAAY,IAAI,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC;YAClE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,KAAK,CAAC,YAAY,CAAC,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACK,cAAc,CAAC,MAAsB,EAAE,MAAsB;QACnE,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,mBAAmB,GAAG,KAAK,CAAC;QACtD,IAAI,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,KAAK,IAAI,QAAQ,GAAG,QAAQ;YAC9B,OAAO,KAAK,CAAC,CAAC,+CAA+C;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QACrD,IAAI,KAAK,GAAG,IAAI;YACd,OAAO,KAAK,CAAC;QACf,4BAA4B;QAC5B,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;YAC7F,OAAO,IAAI,CAAC;QAEd,4BAA4B;QAC5B,IAAI,CAAC,CAAC,MAAM,YAAY,aAAK,IAAI,MAAM,YAAY,aAAK,CAAC;YACvD,OAAO,KAAK,CAAC,CAAC,oCAAoC;QAEpD,MAAM,aAAa,GAAG,uBAAU,CAAC,mBAAmB,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjF,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;QAClB,IAAI,QAAQ,GAAG,QAAQ,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,yCAAyC;YACxF,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;YACtE,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;YACtE,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;YACxB,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACzD,QAAQ,GAAG,KAAK,CAAC;gBACjB,QAAQ,GAAG,CAAC,CAAC;YACf,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC,CAAC,0CAA0C;YAC7D,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC7F,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;YACxE,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC/F,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,aAAa,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACxE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,yBAAyB,CAAC,SAAyB;QACzD,IAAI,SAAS,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACtD,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACzD,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;oBAClB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACjD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;oBACtD,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAClD,OAAO,IAAI,CAAC;gBACd,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,cAAc,EAAE,CAAC;oBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC9B,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAClD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACrD,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;wBAClB,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;wBAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACjD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;wBACtD,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAClD,OAAO,IAAI,CAAC;oBACd,CAAC;yBAAM,CAAC;wBACN,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;wBAC9B,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxC,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAClD,OAAO,IAAI,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;OAQG;IACK,yBAAyB,CAAC,WAAmB,EAAE,WAAmB;QACxE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QACD,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,wBAAwB;QAC3C,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/C,IAAI,WAAW,KAAK,cAAc;YAChC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QAC3D,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;IACrB,CAAC;IACD,wCAAwC;IAChC,YAAY,CAAC,UAAkB;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvC,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,KAAK;YACnB,CAAC,CAAC,cAAc,EAAE,CAAC;IACvB,CAAC;IACD,qGAAqG;IAC7F,wBAAwB,CAAC,UAAkB;QACjD,wCAAwC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvC,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrD,iCAAiC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QACrE,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,OAAO,CAAC,KAAK;gBAChB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC/D,OAAO;QACT,CAAC;QACD,+BAA+B;QAC/B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClE,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QACjE,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,OAAO,CAAC,KAAK;gBACf,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,CAAC,yBAAyB,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;YAC/D,OAAO;QACT,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE,CAAC;YACrB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC7C,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC7F,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC3F,IAAI,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC;gBAChD,gCAAgC;gBAChC,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;gBAC7F,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC7F,CAAC;YACD,IAAI,mBAAmB,CAAC,aAAa,CAAC,aAAa,CAAC,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;gBAC3G,MAAM,YAAY,GAAG,2BAAY,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC;gBACxE,IAAI,YAAY,EAAE,CAAC;oBACjB,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;oBAC5C,IAAI,YAAY,EAAE,CAAC;wBACjB,MAAM,KAAK,GAAG,qBAAS,CAAC,eAAe,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;wBAC9D,IAAI,IAAI,CAAC,eAAe,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;4BAClF,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;wBAClC,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,wEAAwE;IAChE,mBAAmB,CAAC,KAAuB,EAAE,OAAuB;QAC1E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,KAAK;YACvB,KAAK,CAAC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QACzC,UAAU,CAAC,qBAAqB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrD,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,8EAA8E;IACvE,UAAU,CAAC,mBAA4B,KAAK;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;MAGE;IACK,4BAA4B,CAAC,aAAyC,EAAE,OAAuB;QACpG,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACxD,IAAI,EAAE;gBACJ,aAAa,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBACpD,IAAI,EAAE;oBACJ,aAAa,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;CACF;AArTD,kDAqTC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../../Geometry\";\nimport { FrameBuilder } from \"../../geometry3d/FrameBuilder\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { XYAndZ } from \"../../geometry3d/XYZProps\";\nimport { Arc3d } from \"../Arc3d\";\nimport { BagOfCurves, CurveCollection } from \"../CurveCollection\";\nimport { CurveCurve } from \"../CurveCurve\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { AnyChain, AnyCurve } from \"../CurveTypes\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop } from \"../Loop\";\nimport { Path } from \"../Path\";\nimport { RegionOps } from \"../RegionOps\";\nimport { StrokeOptions } from \"../StrokeOptions\";\n\n/**\n * Manage a growing array of arrays of curve primitives that are to be joined \"head to tail\" in paths.\n * * The caller makes a sequence of calls to announce individual primitives.\n * * This collector (unlike the simpler [[ChainCollectorContext]]) expects to have inputs arriving in random order, leaving multiple open chains in play at any time.\n * * When all curves have been announced, the call to `grabResult` restructures the various active chains into Paths (and optionally, Loops).\n * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\n * * Usage pattern is\n *   * initialization: `context = new MultiChainCollector(gapTol, planeTol)`\n *   * many times:\n *       * `context.captureCurve(anyCurve)`\n *       * `context.captureCurvePrimitive(primitive)`\n *   * end: `result = context.grabResult(makeLoopIfClosed)`\n * @internal\n */\nexport class MultiChainCollector {\n  /** Accumulated chains. */\n  private _chains: CurvePrimitive[][];\n  /** Largest gap distance to close. */\n  private _gapTolerance: number;\n  /** Planarity tolerance, used to determine whether to return a Path or Loop in `grabResult(true)`. If undefined, always Path. */\n  private _planeTolerance: number | undefined;\n\n  private static _staticPointA: Point3d;\n  private static _staticPointB: Point3d;\n  private _xyzWork0?: Point3d;\n  private _xyzWork1?: Point3d;\n\n  /** Initialize with an empty array of chains.\n   * @param gapTolerance distance tolerance for calling endpoints identical\n   * @param planeTolerance distance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within this tolerance of a plane.\n   */\n  public constructor(gapTolerance = Geometry.smallMetricDistance, planeTolerance?: number) {\n    this._chains = [];\n    this._gapTolerance = gapTolerance;\n    this._planeTolerance = planeTolerance;\n  }\n  /**\n   * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz\n   * @param xyz endpoint to check\n   * @param exceptChainIndex index of chain to ignore. Send -1 to consider all chains.\n   */\n  private findAnyChainToConnect(xyz: Point3d, exceptChainIndex: number = -1): { chainIndex: number, atEnd: boolean } | undefined {\n    for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {\n      if (exceptChainIndex === chainIndexA)\n        continue;\n      const chain = this._chains[chainIndexA];\n      this._xyzWork1 = chain[chain.length - 1].endPoint(this._xyzWork1);\n      if (this._xyzWork1.isAlmostEqual(xyz, this._gapTolerance))\n        return { chainIndex: chainIndexA, atEnd: true };\n      this._xyzWork1 = chain[0].startPoint(this._xyzWork1);\n      if (this._xyzWork1.isAlmostEqual(xyz, this._gapTolerance))\n        return { chainIndex: chainIndexA, atEnd: false };\n    }\n    return undefined;\n  }\n  /**\n   * Insert a single curve primitive into the active chains.\n   * * The primitive is captured (not cloned)\n   * * The primitive may be reversed in place\n   * @param candidate curve to add to the context\n   */\n  public captureCurvePrimitive(candidate: CurvePrimitive) {\n    if (this.attachPrimitiveToAnyChain(candidate))\n      return;\n    this._chains.push([candidate]);\n  }\n  /**\n   * Insert any curve into the collection.\n   * * This recurses into Path, Loop, BagOfCurves etc\n   * * All primitives are captured, and may be reversed in place.\n   * @param candidate curve to add to the context\n   */\n  public captureCurve(candidate: AnyCurve) {\n    if (candidate instanceof CurvePrimitive)\n      this.captureCurvePrimitive(candidate);\n    else if (candidate instanceof CurveCollection) {\n      for (const c of candidate.children)\n        this.captureCurve(c);\n    }\n  }\n  /** If allowed by the geometry type, move an endpoint. */\n  private simpleEndPointMove(curve: CurvePrimitive, atEnd: boolean, to: XYAndZ): boolean {\n    if (curve instanceof (LineSegment3d)) {\n      if (atEnd) {\n        curve.point1Ref.setFrom(to);\n      } else {\n        curve.point0Ref.setFrom(to);\n      }\n      return true;\n    } else if (curve instanceof LineString3d && curve.numPoints() > 0) {\n      const i = atEnd ? curve.numPoints() - 1 : 0;\n      curve.packedPoints.setAtCheckedPointIndex(i, to);\n      return true;\n    }\n    return false;\n  }\n  /**\n   * Try to move the end of curve0 and/or the start of curve1 to a common point.\n   * * All z-coordinates are ignored.\n   * @param curve0 first curve, assumed to end close to the start of curve1\n   * @param curve1 second curve, assumed to start close to the end of curve0\n   * @returns whether curve start/end point(s) moved\n   */\n  private moveHeadOrTail(curve0: CurvePrimitive, curve1: CurvePrimitive): boolean {\n    const xyz0 = curve0.endPoint();\n    const xyz1 = curve1.startPoint();\n    const minShift = Geometry.smallMetricDistance * 0.001;\n    let dist2 = xyz0.distanceSquaredXY(xyz1);\n    if (dist2 <= minShift * minShift)\n      return false; // if the move would be miniscule, don't bother\n    const gap2 = this._gapTolerance * this._gapTolerance;\n    if (dist2 > gap2)\n      return false;\n    // try lines and linestrings\n    if (this.simpleEndPointMove(curve1, false, xyz0) || this.simpleEndPointMove(curve0, true, xyz1))\n      return true;\n\n    // try other primitive types\n    if (!(curve0 instanceof Arc3d && curve1 instanceof Arc3d))\n      return false; // currently we only consider 2 arcs\n\n    const intersections = CurveCurve.intersectionXYPairs(curve0, true, curve1, true);\n    let iClosest = -1;\n    let minDist2 = Infinity;\n    for (let i = 0; i < intersections.length; ++i) { // find intersection closest to the joint\n      const dist20 = intersections[i].detailA.point.distanceSquaredXY(xyz0);\n      const dist21 = intersections[i].detailB.point.distanceSquaredXY(xyz1);\n      dist2 = dist20 + dist21;\n      if (dist20 <= gap2 && dist21 <= gap2 && dist2 < minDist2) {\n        minDist2 = dist2;\n        iClosest = i;\n      }\n    }\n    if (iClosest >= 0) { // move arc ends to the intersection point\n      const radians0End = curve0.sweep.fractionToRadians(intersections[iClosest].detailA.fraction);\n      curve0.sweep.setStartEndRadians(curve0.sweep.startRadians, radians0End);\n      const radians1Start = curve1.sweep.fractionToRadians(intersections[iClosest].detailB.fraction);\n      curve1.sweep.setStartEndRadians(radians1Start, curve1.sweep.endRadians);\n      return true;\n    }\n    return false;\n  }\n  /** Announce a curve primitive\n   * * If a \"nearby\" connection is possible, insert the candidate in the chain and force endpoint match.\n   * * Otherwise start a new chain.\n   */\n  private attachPrimitiveToAnyChain(candidate: CurvePrimitive): boolean {\n    if (candidate.curveLength() < this._gapTolerance) {\n      return true;\n    } else {\n      this._xyzWork0 = candidate.startPoint(this._xyzWork0);\n      let connect = this.findAnyChainToConnect(this._xyzWork0);\n      if (connect) {\n        if (connect.atEnd) {\n          const chain = this._chains[connect.chainIndex];\n          const index0 = chain.length - 1;\n          this._chains[connect.chainIndex].push(candidate);\n          this.moveHeadOrTail(chain[index0], chain[index0 + 1]);\n          this.searchAndMergeChainIndex(connect.chainIndex);\n          return true;\n        } else {\n          candidate.reverseInPlace();\n          const chain = this._chains[connect.chainIndex];\n          chain.splice(0, 0, candidate);\n          this.moveHeadOrTail(chain[0], chain[1]);\n          this.searchAndMergeChainIndex(connect.chainIndex);\n          return true;\n        }\n      } else {\n        this._xyzWork0 = candidate.endPoint(this._xyzWork0);\n        connect = this.findAnyChainToConnect(this._xyzWork0);\n        if (connect) {\n          if (connect.atEnd) {\n            candidate.reverseInPlace();\n            const chain = this._chains[connect.chainIndex];\n            const index0 = chain.length - 1;\n            this._chains[connect.chainIndex].push(candidate);\n            this.moveHeadOrTail(chain[index0], chain[index0 + 1]);\n            this.searchAndMergeChainIndex(connect.chainIndex);\n            return true;\n          } else {\n            const chain = this._chains[connect.chainIndex];\n            chain.splice(0, 0, candidate);\n            this.moveHeadOrTail(chain[0], chain[1]);\n            this.searchAndMergeChainIndex(connect.chainIndex);\n            return true;\n          }\n        }\n      }\n    }\n    return false;\n  }\n  /**\n   * Merge two entries in the chain array.\n   * * Move each primitive from chainB to the end of chainA.\n   * * Clear chainB.\n   * * Move the final chain to chainB index.\n   * * Decrement the array length.\n   * @param chainIndexA index of chainA\n   * @param chainIndexB index of chainB\n   */\n  private mergeChainsForwardForward(chainIndexA: number, chainIndexB: number) {\n    const chainA = this._chains[chainIndexA];\n    const chainB = this._chains[chainIndexB];\n    for (const p of chainB) {\n      chainA.push(p);\n    }\n    chainB.length = 0; // chainIndexB is unused\n    const lastChainIndex = this._chains.length - 1;\n    if (chainIndexB !== lastChainIndex)\n      this._chains[chainIndexB] = this._chains[lastChainIndex];\n    this._chains.pop();\n  }\n  /** Reverse the curve chain in place. */\n  private reverseChain(chainIndex: number) {\n    const chain = this._chains[chainIndex];\n    chain.reverse();\n    for (const p of chain)\n      p.reverseInPlace();\n  }\n  /** See if the head or tail of chainIndex matches any existing chain. If so, merge the two chains. */\n  private searchAndMergeChainIndex(chainIndex: number): void {\n    // ASSUME valid index of non-empty chain\n    const chain = this._chains[chainIndex];\n    const lastIndexInChain = chain.length - 1;\n    this._xyzWork0 = chain[0].startPoint(this._xyzWork0);\n    // try start with any other chain\n    let connect = this.findAnyChainToConnect(this._xyzWork0, chainIndex);\n    if (connect) {\n      if (!connect.atEnd)\n        this.reverseChain(connect.chainIndex);\n      this.mergeChainsForwardForward(connect.chainIndex, chainIndex);\n      return;\n    }\n    // try end with any other chain\n    this._xyzWork0 = chain[lastIndexInChain].endPoint(this._xyzWork0);\n    connect = this.findAnyChainToConnect(this._xyzWork0, chainIndex);\n    if (connect) {\n      if (connect.atEnd)\n        this.reverseChain(connect.chainIndex);\n      this.mergeChainsForwardForward(chainIndex, connect.chainIndex);\n      return;\n    }\n  }\n  /**\n   * Convert an array of curve primitives into the simplest possible strongly typed curve structure.\n   * @param curves input array, assembled correctly into a single contiguous path, captured by returned object\n   * @param makeLoopIfClosed whether to return a Loop from physically closed coplanar curves, otherwise Path\n   * @return Loop or Path if multiple curves; the primitive if only one curve; undefined if no curves\n   */\n  private promoteArrayToCurves(curves: CurvePrimitive[], makeLoopIfClosed: boolean): CurvePrimitive | Path | Loop | undefined {\n    if (curves.length === 0)\n      return undefined;\n    if (makeLoopIfClosed) {\n      const primitive0 = curves[0];\n      const primitiveN = curves[curves.length - 1];\n      MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);\n      MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);\n      if (this.moveHeadOrTail(primitiveN, primitive0)) {\n        // get the corrected coordinates\n        MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);\n        MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);\n      }\n      if (MultiChainCollector._staticPointA.isAlmostEqual(MultiChainCollector._staticPointB, this._gapTolerance)) {\n        const localToWorld = FrameBuilder.createRightHandedLocalToWorld(curves);\n        if (localToWorld) {\n          const worldToLocal = localToWorld.inverse();\n          if (worldToLocal) {\n            const range = RegionOps.curveArrayRange(curves, worldToLocal);\n            if (this._planeTolerance !== undefined && range.zLength() <= this._planeTolerance) {\n              return Loop.createArray(curves);\n            }\n          }\n        }\n        return Path.createArray(curves);\n      }\n    }\n    if (curves.length === 1)\n      return curves[0];\n    return Path.createArray(curves);\n  }\n  /** Stroke the curve chain to a line string, de-duplicate the points. */\n  private chainToLineString3d(chain: CurvePrimitive[], options?: StrokeOptions): LineString3d | undefined {\n    if (chain.length === 0)\n      return undefined;\n    const linestring = LineString3d.create();\n    for (const curve of chain)\n      curve.emitStrokes(linestring, options);\n    linestring.removeDuplicatePoints(this._gapTolerance);\n    return linestring;\n  }\n  /** Return the collected results, structured as the simplest possible type. */\n  public grabResult(makeLoopIfClosed: boolean = false): AnyChain | undefined {\n    const chains = this._chains;\n    if (chains.length === 0)\n      return undefined;\n    if (chains.length === 1)\n      return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);\n    const bag = BagOfCurves.create();\n    for (const chain of chains) {\n      const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);\n      bag.tryAddChild(q);\n    }\n    return bag;\n  }\n  /**\n   * Return chains as individual calls to announceChain.\n   * * Does not use planeTolerance.\n  */\n  public announceChainsAsLineString3d(announceChain: (ls: LineString3d) => void, options?: StrokeOptions): void {\n    const chains = this._chains;\n    if (chains.length === 1) {\n      const ls = this.chainToLineString3d(chains[0], options);\n      if (ls)\n        announceChain(ls);\n    } else if (chains.length > 1) {\n      for (const chain of chains) {\n        const ls = this.chainToLineString3d(chain, options);\n        if (ls)\n          announceChain(ls);\n      }\n    }\n  }\n}\n"]}

package/lib/cjs/curve/internalContexts/PlaneAltitudeRangeContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"PlaneAltitudeRangeContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/PlaneAltitudeRangeContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,6CAAkE;AAClE,kDAA+C;AAC/C,sEAAkF;AAClF,wEAAqE;AACrE,gGAA6F;AAC7F,sEAAqE;AACrE,kDAAiD;AACjD,kDAA+C;AAG/C,oDAAiD;AACjD,oDAAiD;AACjD,kDAA+C;AAC/C,oDAAiD;AAEjD;;;GAGG;AACH,MAAa,yBAA0B,SAAQ,gDAA8B;IACpE,KAAK,CAAyB;IAC9B,KAAK,CAAU;IACf,QAAQ,CAAsB;IAC9B,SAAS,CAAsB;IACtC,YAAoB,KAA6B;QAC/C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAEM,UAAU;QACf,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAEM,aAAa,CAAC,KAAc;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjD,CAAC;IAEM,cAAc,CAAC,MAAwB;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,MAAM,CAAC,mCAAmC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACpE,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3E,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IAEM,MAAM,CAAC,aAAa,CAAC,KAA6B;QACvD,MAAM,OAAO,GAAG,IAAI,yBAAyB,CAAC,KAAK,CAAC,CAAC;QACrD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEe,mBAAmB,CAAC,OAAsB;QACxD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAEe,kBAAkB,CAAC,UAAwB;QACzD,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;IAC/C,CAAC;IAEO,cAAc,CAAiB;IAE/B,iBAAiB;QACvB,kEAAkE;QAClE,IAAI,SAAS,KAAK,IAAI,CAAC,cAAc,EAAE,CAAC;YACtC,IAAI,CAAC,cAAc,GAAG,IAAI,6BAAa,EAAE,CAAC;YAC1C,IAAI,CAAC,cAAc,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAEe,oBAAoB,CAAC,MAAsB;QACzD,kFAAkF;QAClF,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAC5C,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAEe,qBAAqB,CAAC,MAAuB;QAC3D,kFAAkF;QAClF,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAC5C,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAEO,qBAAqB,CAAwB;IAE7C,UAAU,CAAW;IAEb,WAAW,CAAC,CAAQ;QAClC,IAAI,CAAC,qBAAqB,GAAG,CAAC,CAAC,oCAAoC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC5G,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,CAAC;QAClE,IAAI,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC;YACnC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrF,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC;YACnC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrF,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IAEO,MAAM,CAAC,uBAAuB,CACpC,QAAsD,EAAE,SAA2B;QAEnF,MAAM,MAAM,GAAG,SAAS,YAAY,aAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,yBAAO,CAAC,UAAU,EAAE,CAAC;QACpF,MAAM,MAAM,GAAG,SAAS,YAAY,aAAK,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;QAC5E,MAAM,KAAK,GAAG,2DAA4B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAE,mDAAmD;QACvH,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,OAAO,GAAG,IAAI,yBAAyB,CAAC,KAAK,CAAC,CAAC;YACrD,IAAI,QAAQ,YAAY,6BAAa,EAAE,CAAC;gBACtC,QAAQ,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC9C,CAAC;iBAAM,IAAI,QAAQ,YAAY,mCAAgB,EAAE,CAAC;gBAChD,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,EAAE,IAAI,QAAQ;oBACvB,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;MAOE;IACK,MAAM,CAAC,4BAA4B,CACxC,QAAsD,EAAE,SAA2B,EAAE,OAAuB;QAE5G,MAAM,OAAO,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAClE,IAAI,OAAO,IAAI,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,QAAQ;YAClD,OAAO,6BAAa,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC5E,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;MAOE;IACK,MAAM,CAAC,+BAA+B,CAC3C,QAAsD,EAAE,SAA2B,EAAE,OAAiB;QAEtG,MAAM,OAAO,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAClE,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM;YAClC,OAAO,eAAO,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,kCAAkC,CAC9C,QAAsD,EAAE,SAA2B,EAAE,OAAiB;QAEtG,MAAM,KAAK,GAAG,IAAI,CAAC,+BAA+B,CAAC,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACjF,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,CAAC,SAAS,YAAY,0BAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;YACtG,MAAM,eAAe,GAAG,mBAAQ,CAAC,2BAA2B,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACvE,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;gBAClC,KAAK,CAAC,GAAG,IAAI,eAAe,CAAC;gBAC7B,KAAK,CAAC,IAAI,IAAI,eAAe,CAAC;gBAC9B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAtKD,8DAsKC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { BSplineCurve3d } from \"../../bspline/BSplineCurve\";\r\nimport { BSplineCurve3dH } from \"../../bspline/BSplineCurve3dH\";\r\nimport { Geometry, PlaneAltitudeEvaluator } from \"../../Geometry\";\r\nimport { Angle } from \"../../geometry3d/Angle\";\r\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Range1d } from \"../../geometry3d/Range\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { SineCosinePolynomial } from \"../../numerics/Polynomials\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { GeometryQuery } from \"../GeometryQuery\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\n\r\n/**\r\n * Accumulator context for searching for extrema of geometry along a plane.\r\n * @internal\r\n */\r\nexport class PlaneAltitudeRangeContext extends RecurseToCurvesGeometryHandler {\r\n  public plane: PlaneAltitudeEvaluator;\r\n  public range: Range1d;\r\n  public lowPoint: Point3d | undefined;\r\n  public highPoint: Point3d | undefined;\r\n  private constructor(plane: PlaneAltitudeEvaluator) {\r\n    super();\r\n    this.plane = plane;\r\n    this.range = Range1d.createNull();\r\n    this.resetRange();\r\n  }\r\n\r\n  public resetRange() {\r\n    this.range.setNull();\r\n  }\r\n\r\n  public announcePoint(point: Point3d) {\r\n    const h = this.plane.altitude(point);\r\n    if (this.range.extendLow(h))\r\n      this.lowPoint = point.clone(this.lowPoint);\r\n    if (this.range.extendHigh(h))\r\n      this.highPoint = point.clone(this.highPoint);\r\n  }\r\n\r\n  public announcePoints(points: GrowableXYZArray) {\r\n    for (let i = 0; i < points.length; i++) {\r\n      const h = points.evaluateUncheckedIndexPlaneAltitude(i, this.plane);\r\n      if (this.range.extendLow(h))\r\n        this.lowPoint = points.getPoint3dAtUncheckedPointIndex(i, this.lowPoint);\r\n      if (this.range.extendHigh(h))\r\n        this.highPoint = points.getPoint3dAtUncheckedPointIndex(i, this.highPoint);\r\n    }\r\n  }\r\n\r\n  public static createCapture(plane: PlaneAltitudeEvaluator): PlaneAltitudeRangeContext {\r\n    const context = new PlaneAltitudeRangeContext(plane);\r\n    return context;\r\n  }\r\n\r\n  public override handleLineSegment3d(segment: LineSegment3d) {\r\n    this.announcePoint(segment.point0Ref);\r\n    this.announcePoint(segment.point1Ref);\r\n  }\r\n\r\n  public override handleLineString3d(lineString: LineString3d) {\r\n    this.announcePoints(lineString.packedPoints);\r\n  }\r\n\r\n  private _strokeOptions?: StrokeOptions;\r\n\r\n  private initStrokeOptions() {\r\n    // TODO: compute the exact extrema; until then stroke aggressively\r\n    if (undefined === this._strokeOptions) {\r\n      this._strokeOptions = new StrokeOptions();\r\n      this._strokeOptions.angleTol = Angle.createDegrees(1);\r\n    }\r\n  }\r\n\r\n  public override handleBSplineCurve3d(bcurve: BSplineCurve3d) {\r\n    // ugh.   The point MUST be on the curve -- usual excess-range of poles is not ok.\r\n    this.initStrokeOptions();\r\n    const ls = LineString3d.create();\r\n    bcurve.emitStrokes(ls, this._strokeOptions);\r\n    this.handleLineString3d(ls);\r\n  }\r\n\r\n  public override handleBSplineCurve3dH(bcurve: BSplineCurve3dH) {\r\n    // ugh.   The point MUST be on the curve -- usual excess-range of poles is not ok.\r\n    this.initStrokeOptions();\r\n    const ls = LineString3d.create();\r\n    bcurve.emitStrokes(ls, this._strokeOptions);\r\n    this.handleLineString3d(ls);\r\n  }\r\n\r\n  private _sineCosinePolynomial?: SineCosinePolynomial;\r\n\r\n  private _workPoint?: Point3d;\r\n\r\n  public override handleArc3d(g: Arc3d) {\r\n    this._sineCosinePolynomial = g.getPlaneAltitudeSineCosinePolynomial(this.plane, this._sineCosinePolynomial);\r\n    let radians = this._sineCosinePolynomial.referenceMinMaxRadians();\r\n    if (g.sweep.isRadiansInSweep(radians))\r\n      this.announcePoint((this._workPoint = g.radiansToPoint(radians, this._workPoint)));\r\n    radians += Math.PI;\r\n    if (g.sweep.isRadiansInSweep(radians))\r\n      this.announcePoint((this._workPoint = g.radiansToPoint(radians, this._workPoint)));\r\n    this.announcePoint((this._workPoint = g.startPoint(this._workPoint)));\r\n    this.announcePoint((this._workPoint = g.endPoint(this._workPoint)));\r\n  }\r\n\r\n  private static findExtremesInDirection(\r\n    geometry: GeometryQuery | GrowableXYZArray | Point3d[], direction: Vector3d | Ray3d,\r\n  ): PlaneAltitudeRangeContext | undefined {\r\n    const origin = direction instanceof Ray3d ? direction.origin : Point3d.createZero();\r\n    const vector = direction instanceof Ray3d ? direction.direction : direction;\r\n    const plane = Plane3dByOriginAndUnitNormal.create(origin, vector);  // vector is normalized, so altitudes are distances\r\n    if (plane) {\r\n      const context = new PlaneAltitudeRangeContext(plane);\r\n      if (geometry instanceof GeometryQuery) {\r\n        geometry.dispatchToGeometryHandler(context);\r\n      } else if (geometry instanceof GrowableXYZArray) {\r\n        context.announcePoints(geometry);\r\n      } else {\r\n        for (const pt of geometry)\r\n          context.announcePoint(pt);\r\n      }\r\n      return context;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Compute altitudes for the geometry (via dispatch) over the plane defined by the given direction, and\r\n   * return points at min and max altitude, packed into a `LineSegment3d`.\r\n   * @param geometry geometry to project\r\n   * @param direction vector or ray on which to project the instance. A `Vector3d` is treated as a `Ray3d` with\r\n   * zero origin.\r\n   * @param lowHigh optional receiver for output\r\n  */\r\n  public static findExtremePointsInDirection(\r\n    geometry: GeometryQuery | GrowableXYZArray | Point3d[], direction: Vector3d | Ray3d, lowHigh?: LineSegment3d,\r\n  ): LineSegment3d | undefined {\r\n    const context = this.findExtremesInDirection(geometry, direction);\r\n    if (context && context.highPoint && context.lowPoint)\r\n      return LineSegment3d.create(context.lowPoint, context.highPoint, lowHigh);\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Compute altitudes for the geometry (via dispatch) over the plane defined by the given direction, and return\r\n   * the min and max altitudes, packed into a Range1d.\r\n   * @param geometry geometry to project\r\n   * @param direction vector or ray on which to project the instance. A `Vector3d` is treated as a `Ray3d` with\r\n   * zero origin.\r\n   * @param lowHigh optional receiver for output\r\n  */\r\n  public static findExtremeAltitudesInDirection(\r\n    geometry: GeometryQuery | GrowableXYZArray | Point3d[], direction: Vector3d | Ray3d, lowHigh?: Range1d,\r\n  ): Range1d | undefined {\r\n    const context = this.findExtremesInDirection(geometry, direction);\r\n    if (context && !context.range.isNull)\r\n      return Range1d.createFrom(context.range, lowHigh);\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Project geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.\r\n   * @param geometry geometry to project\r\n   * @param direction vector or ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with\r\n   * zero origin.\r\n   * @param lowHigh optional receiver for output\r\n   */\r\n  public static findExtremeFractionsAlongDirection(\r\n    geometry: GeometryQuery | GrowableXYZArray | Point3d[], direction: Vector3d | Ray3d, lowHigh?: Range1d,\r\n  ): Range1d | undefined {\r\n    const range = this.findExtremeAltitudesInDirection(geometry, direction, lowHigh);\r\n    if (undefined !== range) {\r\n      const mag = (direction instanceof Vector3d) ? direction.magnitude() : direction.direction.magnitude();\r\n      const scaleToFraction = Geometry.conditionalDivideCoordinate(1.0, mag);\r\n      if (undefined !== scaleToFraction) {\r\n        range.low *= scaleToFraction;\r\n        range.high *= scaleToFraction;\r\n        return range;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"PlaneAltitudeRangeContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/PlaneAltitudeRangeContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,6CAAkE;AAClE,kDAA+C;AAC/C,sEAAkF;AAClF,wEAAqE;AACrE,gGAA6F;AAC7F,sEAAqE;AACrE,kDAAiD;AACjD,kDAA+C;AAG/C,oDAAiD;AACjD,oDAAiD;AACjD,kDAA+C;AAC/C,oDAAiD;AAEjD;;;GAGG;AACH,MAAa,yBAA0B,SAAQ,gDAA8B;IACpE,KAAK,CAAyB;IAC9B,KAAK,CAAU;IACf,QAAQ,CAAsB;IAC9B,SAAS,CAAsB;IACtC,YAAoB,KAA6B;QAC/C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAEM,UAAU;QACf,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAEM,aAAa,CAAC,KAAc;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjD,CAAC;IAEM,cAAc,CAAC,MAAwB;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,MAAM,CAAC,mCAAmC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACpE,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3E,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;gBAC1B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IAEM,MAAM,CAAC,aAAa,CAAC,KAA6B;QACvD,MAAM,OAAO,GAAG,IAAI,yBAAyB,CAAC,KAAK,CAAC,CAAC;QACrD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEe,mBAAmB,CAAC,OAAsB;QACxD,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAEe,kBAAkB,CAAC,UAAwB;QACzD,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;IAC/C,CAAC;IAEO,cAAc,CAAiB;IAE/B,iBAAiB;QACvB,kEAAkE;QAClE,IAAI,SAAS,KAAK,IAAI,CAAC,cAAc,EAAE,CAAC;YACtC,IAAI,CAAC,cAAc,GAAG,IAAI,6BAAa,EAAE,CAAC;YAC1C,IAAI,CAAC,cAAc,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAEe,oBAAoB,CAAC,MAAsB;QACzD,kFAAkF;QAClF,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAC5C,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAEe,qBAAqB,CAAC,MAAuB;QAC3D,kFAAkF;QAClF,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAC5C,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAEO,qBAAqB,CAAwB;IAE7C,UAAU,CAAW;IAEb,WAAW,CAAC,CAAQ;QAClC,IAAI,CAAC,qBAAqB,GAAG,CAAC,CAAC,oCAAoC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC5G,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,sBAAsB,EAAE,CAAC;QAClE,IAAI,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC;YACnC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrF,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC;YACnC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrF,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IAEO,MAAM,CAAC,uBAAuB,CACpC,QAAsD,EAAE,SAA2B;QAEnF,MAAM,MAAM,GAAG,SAAS,YAAY,aAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,yBAAO,CAAC,UAAU,EAAE,CAAC;QACpF,MAAM,MAAM,GAAG,SAAS,YAAY,aAAK,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;QAC5E,MAAM,KAAK,GAAG,2DAA4B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAE,mDAAmD;QACvH,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,OAAO,GAAG,IAAI,yBAAyB,CAAC,KAAK,CAAC,CAAC;YACrD,IAAI,QAAQ,YAAY,6BAAa,EAAE,CAAC;gBACtC,QAAQ,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC9C,CAAC;iBAAM,IAAI,QAAQ,YAAY,mCAAgB,EAAE,CAAC;gBAChD,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,EAAE,IAAI,QAAQ;oBACvB,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;MAOE;IACK,MAAM,CAAC,4BAA4B,CACxC,QAAsD,EAAE,SAA2B,EAAE,OAAuB;QAE5G,MAAM,OAAO,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAClE,IAAI,OAAO,IAAI,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,QAAQ;YAClD,OAAO,6BAAa,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC5E,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;MAOE;IACK,MAAM,CAAC,+BAA+B,CAC3C,QAAsD,EAAE,SAA2B,EAAE,OAAiB;QAEtG,MAAM,OAAO,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAClE,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM;YAClC,OAAO,eAAO,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,kCAAkC,CAC9C,QAAsD,EAAE,SAA2B,EAAE,OAAiB;QAEtG,MAAM,KAAK,GAAG,IAAI,CAAC,+BAA+B,CAAC,QAAQ,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACjF,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,CAAC,SAAS,YAAY,0BAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;YACtG,MAAM,eAAe,GAAG,mBAAQ,CAAC,2BAA2B,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACvE,IAAI,SAAS,KAAK,eAAe,EAAE,CAAC;gBAClC,KAAK,CAAC,GAAG,IAAI,eAAe,CAAC;gBAC7B,KAAK,CAAC,IAAI,IAAI,eAAe,CAAC;gBAC9B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAtKD,8DAsKC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { BSplineCurve3d } from \"../../bspline/BSplineCurve\";\nimport { BSplineCurve3dH } from \"../../bspline/BSplineCurve3dH\";\nimport { Geometry, PlaneAltitudeEvaluator } from \"../../Geometry\";\nimport { Angle } from \"../../geometry3d/Angle\";\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\nimport { Plane3dByOriginAndUnitNormal } from \"../../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range1d } from \"../../geometry3d/Range\";\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\nimport { SineCosinePolynomial } from \"../../numerics/Polynomials\";\nimport { Arc3d } from \"../Arc3d\";\nimport { GeometryQuery } from \"../GeometryQuery\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { StrokeOptions } from \"../StrokeOptions\";\n\n/**\n * Accumulator context for searching for extrema of geometry along a plane.\n * @internal\n */\nexport class PlaneAltitudeRangeContext extends RecurseToCurvesGeometryHandler {\n  public plane: PlaneAltitudeEvaluator;\n  public range: Range1d;\n  public lowPoint: Point3d | undefined;\n  public highPoint: Point3d | undefined;\n  private constructor(plane: PlaneAltitudeEvaluator) {\n    super();\n    this.plane = plane;\n    this.range = Range1d.createNull();\n    this.resetRange();\n  }\n\n  public resetRange() {\n    this.range.setNull();\n  }\n\n  public announcePoint(point: Point3d) {\n    const h = this.plane.altitude(point);\n    if (this.range.extendLow(h))\n      this.lowPoint = point.clone(this.lowPoint);\n    if (this.range.extendHigh(h))\n      this.highPoint = point.clone(this.highPoint);\n  }\n\n  public announcePoints(points: GrowableXYZArray) {\n    for (let i = 0; i < points.length; i++) {\n      const h = points.evaluateUncheckedIndexPlaneAltitude(i, this.plane);\n      if (this.range.extendLow(h))\n        this.lowPoint = points.getPoint3dAtUncheckedPointIndex(i, this.lowPoint);\n      if (this.range.extendHigh(h))\n        this.highPoint = points.getPoint3dAtUncheckedPointIndex(i, this.highPoint);\n    }\n  }\n\n  public static createCapture(plane: PlaneAltitudeEvaluator): PlaneAltitudeRangeContext {\n    const context = new PlaneAltitudeRangeContext(plane);\n    return context;\n  }\n\n  public override handleLineSegment3d(segment: LineSegment3d) {\n    this.announcePoint(segment.point0Ref);\n    this.announcePoint(segment.point1Ref);\n  }\n\n  public override handleLineString3d(lineString: LineString3d) {\n    this.announcePoints(lineString.packedPoints);\n  }\n\n  private _strokeOptions?: StrokeOptions;\n\n  private initStrokeOptions() {\n    // TODO: compute the exact extrema; until then stroke aggressively\n    if (undefined === this._strokeOptions) {\n      this._strokeOptions = new StrokeOptions();\n      this._strokeOptions.angleTol = Angle.createDegrees(1);\n    }\n  }\n\n  public override handleBSplineCurve3d(bcurve: BSplineCurve3d) {\n    // ugh.   The point MUST be on the curve -- usual excess-range of poles is not ok.\n    this.initStrokeOptions();\n    const ls = LineString3d.create();\n    bcurve.emitStrokes(ls, this._strokeOptions);\n    this.handleLineString3d(ls);\n  }\n\n  public override handleBSplineCurve3dH(bcurve: BSplineCurve3dH) {\n    // ugh.   The point MUST be on the curve -- usual excess-range of poles is not ok.\n    this.initStrokeOptions();\n    const ls = LineString3d.create();\n    bcurve.emitStrokes(ls, this._strokeOptions);\n    this.handleLineString3d(ls);\n  }\n\n  private _sineCosinePolynomial?: SineCosinePolynomial;\n\n  private _workPoint?: Point3d;\n\n  public override handleArc3d(g: Arc3d) {\n    this._sineCosinePolynomial = g.getPlaneAltitudeSineCosinePolynomial(this.plane, this._sineCosinePolynomial);\n    let radians = this._sineCosinePolynomial.referenceMinMaxRadians();\n    if (g.sweep.isRadiansInSweep(radians))\n      this.announcePoint((this._workPoint = g.radiansToPoint(radians, this._workPoint)));\n    radians += Math.PI;\n    if (g.sweep.isRadiansInSweep(radians))\n      this.announcePoint((this._workPoint = g.radiansToPoint(radians, this._workPoint)));\n    this.announcePoint((this._workPoint = g.startPoint(this._workPoint)));\n    this.announcePoint((this._workPoint = g.endPoint(this._workPoint)));\n  }\n\n  private static findExtremesInDirection(\n    geometry: GeometryQuery | GrowableXYZArray | Point3d[], direction: Vector3d | Ray3d,\n  ): PlaneAltitudeRangeContext | undefined {\n    const origin = direction instanceof Ray3d ? direction.origin : Point3d.createZero();\n    const vector = direction instanceof Ray3d ? direction.direction : direction;\n    const plane = Plane3dByOriginAndUnitNormal.create(origin, vector);  // vector is normalized, so altitudes are distances\n    if (plane) {\n      const context = new PlaneAltitudeRangeContext(plane);\n      if (geometry instanceof GeometryQuery) {\n        geometry.dispatchToGeometryHandler(context);\n      } else if (geometry instanceof GrowableXYZArray) {\n        context.announcePoints(geometry);\n      } else {\n        for (const pt of geometry)\n          context.announcePoint(pt);\n      }\n      return context;\n    }\n    return undefined;\n  }\n  /**\n   * Compute altitudes for the geometry (via dispatch) over the plane defined by the given direction, and\n   * return points at min and max altitude, packed into a `LineSegment3d`.\n   * @param geometry geometry to project\n   * @param direction vector or ray on which to project the instance. A `Vector3d` is treated as a `Ray3d` with\n   * zero origin.\n   * @param lowHigh optional receiver for output\n  */\n  public static findExtremePointsInDirection(\n    geometry: GeometryQuery | GrowableXYZArray | Point3d[], direction: Vector3d | Ray3d, lowHigh?: LineSegment3d,\n  ): LineSegment3d | undefined {\n    const context = this.findExtremesInDirection(geometry, direction);\n    if (context && context.highPoint && context.lowPoint)\n      return LineSegment3d.create(context.lowPoint, context.highPoint, lowHigh);\n    return undefined;\n  }\n\n  /**\n   * Compute altitudes for the geometry (via dispatch) over the plane defined by the given direction, and return\n   * the min and max altitudes, packed into a Range1d.\n   * @param geometry geometry to project\n   * @param direction vector or ray on which to project the instance. A `Vector3d` is treated as a `Ray3d` with\n   * zero origin.\n   * @param lowHigh optional receiver for output\n  */\n  public static findExtremeAltitudesInDirection(\n    geometry: GeometryQuery | GrowableXYZArray | Point3d[], direction: Vector3d | Ray3d, lowHigh?: Range1d,\n  ): Range1d | undefined {\n    const context = this.findExtremesInDirection(geometry, direction);\n    if (context && !context.range.isNull)\n      return Range1d.createFrom(context.range, lowHigh);\n    return undefined;\n  }\n\n  /**\n   * Project geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.\n   * @param geometry geometry to project\n   * @param direction vector or ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with\n   * zero origin.\n   * @param lowHigh optional receiver for output\n   */\n  public static findExtremeFractionsAlongDirection(\n    geometry: GeometryQuery | GrowableXYZArray | Point3d[], direction: Vector3d | Ray3d, lowHigh?: Range1d,\n  ): Range1d | undefined {\n    const range = this.findExtremeAltitudesInDirection(geometry, direction, lowHigh);\n    if (undefined !== range) {\n      const mag = (direction instanceof Vector3d) ? direction.magnitude() : direction.direction.magnitude();\n      const scaleToFraction = Geometry.conditionalDivideCoordinate(1.0, mag);\n      if (undefined !== scaleToFraction) {\n        range.low *= scaleToFraction;\n        range.high *= scaleToFraction;\n        return range;\n      }\n    }\n    return undefined;\n  }\n}\n"]}

package/lib/cjs/curve/internalContexts/PointToCurveTangentHandler.js.map

@@ -1 +1 @@
-{"version":3,"file":"PointToCurveTangentHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/PointToCurveTangentHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sEAAkF;AAClF,wDAAqD;AACrD,sEAAqE;AAKrE;;;;;;GAMG;AACH,MAAa,0BAA2B,SAAQ,gDAA8B;IACrE,UAAU,CAAU;IACpB,SAAS,CAAyB;IAClC,UAAU,CAAU;IAC3B,mGAAmG;IAC5F,WAAW,CAAuB;IACzC,YACE,UAAmB,EAAE,SAAiC,EAAE,aAAsB,KAAK,EAAE,UAAgC;QAErH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IAEe,WAAW,CAAC,CAAQ;QAClC,MAAM,aAAa,GAAG,0BAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5E,IAAI,kBAAwC,CAAC;QAC7C,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,uEAAuE;YACvE,wBAAwB;YACxB,uBAAuB;YACvB,gCAAgC;YAChC,MAAM,SAAS,GAAG,mBAAQ,CAAC,aAAa,CACtC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAC/E,CAAC;YACF,kBAAkB,GAAG,SAAS,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QAChE,CAAC;aAAM,CAAC;YACN,uEAAuE;YACvE,wBAAwB;YACxB,uBAAuB;YACvB,4DAA4D;YAC5D,kBAAkB,GAAG,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QAClE,CAAC;QACD,IAAI,kBAAkB,KAAK,SAAS;YAClC,OAAO;QACT,2FAA2F;QAC3F,2DAA2D;QAC3D,8DAA8D;QAC9D,kDAAkD;QAClD,6EAA6E;QAC7E,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;YACrC,MAAM,wBAAwB,GAAG,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;YACzE,IAAI,wBAAwB,IAAI,GAAG,EAAE,CAAC;gBACpC,kCAAkC;YACpC,CAAC;iBAAM,CAAC;gBACN,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,wBAAwB,GAAG,GAAG,CAAC,CAAA;gBACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC;gBACrE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;gBAC/C,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC;oBACjD,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,iCAAiC,CAAC,KAAK,CAAC,CAAC;oBAClE,IAAI,IAAI,CAAC,UAAU,IAAI,QAAQ,IAAI,GAAG;wBACpC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA1DD,gEA0DC","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 { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Matrix3d } from \"../../geometry3d/Matrix3d\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\n\r\ntype TangencyPointCollector = (spacePoint: Point3d, curve: CurvePrimitive, fraction: number) => any;\r\n/**\r\n * Accumulator context for searching for lines tangent to curved geometry.\r\n * LIMITED IMPLEMENTATION 3/2025\r\n * * Only Arc3d implements its handler\r\n * * Arc3d calculation works with the projection of the space point into the plane of the arc.\r\n * @internal\r\n */\r\nexport class PointToCurveTangentHandler extends RecurseToCurvesGeometryHandler {\r\n  public spacePoint: Point3d;\r\n  public collector: TangencyPointCollector;\r\n  public extendArcs: boolean;\r\n  // if available, do the tangency as viewed in the xy plane AFTER multiplying vectors by this matrix\r\n  public worldToView: Matrix3d | undefined;\r\n  public constructor(\r\n    spacePoint: Point3d, collector: TangencyPointCollector, extendArcs: boolean = false, viewMatrix: Matrix3d | undefined,\r\n  ) {\r\n    super();\r\n    this.spacePoint = spacePoint;\r\n    this.collector = collector;\r\n    this.extendArcs = extendArcs;\r\n    this.worldToView = viewMatrix;\r\n  }\r\n\r\n  public override handleArc3d(g: Arc3d) {\r\n    const centerToPoint = Vector3d.createStartEnd(g.centerRef, this.spacePoint);\r\n    let localCenterToPoint: Vector3d | undefined;\r\n    if (this.worldToView) {\r\n      // Convert the vector spacePoint into the arc's default system in which\r\n      // U vector is column  0\r\n      // V vector is column 1\r\n      // worldToView row 2 is column 2\r\n      const arcToView = Matrix3d.createColumns(\r\n        g.matrixRef.getColumn(0), g.matrixRef.getColumn(1), this.worldToView.getRow(2),\r\n      );\r\n      localCenterToPoint = arcToView.multiplyInverse(centerToPoint);\r\n    } else {\r\n      // Convert the vector spacePoint into the arc's default system in which\r\n      // U vector is column  0\r\n      // V vector is column 1\r\n      // their cross product (or maybe a scale of it) is column 2.\r\n      localCenterToPoint = g.matrixRef.multiplyInverse(centerToPoint);\r\n    }\r\n    if (localCenterToPoint === undefined)\r\n      return;\r\n    // localCenterToPoint is measured in the (de-skewed and descaled!) coordinate system of the\r\n    // arc U and V axes. That is, the arc is now a unit circle.\r\n    // Angle alpha is from the local x axis to localCenterToPoint.\r\n    // Angle beta is from that to the tangency points.\r\n    // The inverse transformation preserves parameter angle in the ellipse sweep.\r\n    if (localCenterToPoint !== undefined) {\r\n      const distanceSquaredXYToPoint = localCenterToPoint.magnitudeSquaredXY();\r\n      if (distanceSquaredXYToPoint <= 1.0) {\r\n        // the point is inside the ellipse\r\n      } else {\r\n        const distanceToTangency = Math.sqrt(distanceSquaredXYToPoint - 1.0)\r\n        const alpha = Math.atan2(localCenterToPoint.y, localCenterToPoint.x);\r\n        const beta = Math.atan2(distanceToTangency, 1);\r\n        for (const theta of [alpha + beta, alpha - beta]) {\r\n          const fraction = g.sweep.radiansToPositivePeriodicFraction(theta);\r\n          if (this.extendArcs || fraction <= 1.0)\r\n            this.collector(this.spacePoint, g, fraction);\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"PointToCurveTangentHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/PointToCurveTangentHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sEAAkF;AAClF,wDAAqD;AACrD,sEAAqE;AAKrE;;;;;;GAMG;AACH,MAAa,0BAA2B,SAAQ,gDAA8B;IACrE,UAAU,CAAU;IACpB,SAAS,CAAyB;IAClC,UAAU,CAAU;IAC3B,mGAAmG;IAC5F,WAAW,CAAuB;IACzC,YACE,UAAmB,EAAE,SAAiC,EAAE,aAAsB,KAAK,EAAE,UAAgC;QAErH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IAEe,WAAW,CAAC,CAAQ;QAClC,MAAM,aAAa,GAAG,0BAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5E,IAAI,kBAAwC,CAAC;QAC7C,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,uEAAuE;YACvE,wBAAwB;YACxB,uBAAuB;YACvB,gCAAgC;YAChC,MAAM,SAAS,GAAG,mBAAQ,CAAC,aAAa,CACtC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAC/E,CAAC;YACF,kBAAkB,GAAG,SAAS,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QAChE,CAAC;aAAM,CAAC;YACN,uEAAuE;YACvE,wBAAwB;YACxB,uBAAuB;YACvB,4DAA4D;YAC5D,kBAAkB,GAAG,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;QAClE,CAAC;QACD,IAAI,kBAAkB,KAAK,SAAS;YAClC,OAAO;QACT,2FAA2F;QAC3F,2DAA2D;QAC3D,8DAA8D;QAC9D,kDAAkD;QAClD,6EAA6E;QAC7E,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;YACrC,MAAM,wBAAwB,GAAG,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;YACzE,IAAI,wBAAwB,IAAI,GAAG,EAAE,CAAC;gBACpC,kCAAkC;YACpC,CAAC;iBAAM,CAAC;gBACN,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,wBAAwB,GAAG,GAAG,CAAC,CAAA;gBACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC;gBACrE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;gBAC/C,KAAK,MAAM,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC;oBACjD,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,iCAAiC,CAAC,KAAK,CAAC,CAAC;oBAClE,IAAI,IAAI,CAAC,UAAU,IAAI,QAAQ,IAAI,GAAG;wBACpC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA1DD,gEA0DC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\nimport { Matrix3d } from \"../../geometry3d/Matrix3d\";\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Arc3d } from \"../Arc3d\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\n\ntype TangencyPointCollector = (spacePoint: Point3d, curve: CurvePrimitive, fraction: number) => any;\n/**\n * Accumulator context for searching for lines tangent to curved geometry.\n * LIMITED IMPLEMENTATION 3/2025\n * * Only Arc3d implements its handler\n * * Arc3d calculation works with the projection of the space point into the plane of the arc.\n * @internal\n */\nexport class PointToCurveTangentHandler extends RecurseToCurvesGeometryHandler {\n  public spacePoint: Point3d;\n  public collector: TangencyPointCollector;\n  public extendArcs: boolean;\n  // if available, do the tangency as viewed in the xy plane AFTER multiplying vectors by this matrix\n  public worldToView: Matrix3d | undefined;\n  public constructor(\n    spacePoint: Point3d, collector: TangencyPointCollector, extendArcs: boolean = false, viewMatrix: Matrix3d | undefined,\n  ) {\n    super();\n    this.spacePoint = spacePoint;\n    this.collector = collector;\n    this.extendArcs = extendArcs;\n    this.worldToView = viewMatrix;\n  }\n\n  public override handleArc3d(g: Arc3d) {\n    const centerToPoint = Vector3d.createStartEnd(g.centerRef, this.spacePoint);\n    let localCenterToPoint: Vector3d | undefined;\n    if (this.worldToView) {\n      // Convert the vector spacePoint into the arc's default system in which\n      // U vector is column  0\n      // V vector is column 1\n      // worldToView row 2 is column 2\n      const arcToView = Matrix3d.createColumns(\n        g.matrixRef.getColumn(0), g.matrixRef.getColumn(1), this.worldToView.getRow(2),\n      );\n      localCenterToPoint = arcToView.multiplyInverse(centerToPoint);\n    } else {\n      // Convert the vector spacePoint into the arc's default system in which\n      // U vector is column  0\n      // V vector is column 1\n      // their cross product (or maybe a scale of it) is column 2.\n      localCenterToPoint = g.matrixRef.multiplyInverse(centerToPoint);\n    }\n    if (localCenterToPoint === undefined)\n      return;\n    // localCenterToPoint is measured in the (de-skewed and descaled!) coordinate system of the\n    // arc U and V axes. That is, the arc is now a unit circle.\n    // Angle alpha is from the local x axis to localCenterToPoint.\n    // Angle beta is from that to the tangency points.\n    // The inverse transformation preserves parameter angle in the ellipse sweep.\n    if (localCenterToPoint !== undefined) {\n      const distanceSquaredXYToPoint = localCenterToPoint.magnitudeSquaredXY();\n      if (distanceSquaredXYToPoint <= 1.0) {\n        // the point is inside the ellipse\n      } else {\n        const distanceToTangency = Math.sqrt(distanceSquaredXYToPoint - 1.0)\n        const alpha = Math.atan2(localCenterToPoint.y, localCenterToPoint.x);\n        const beta = Math.atan2(distanceToTangency, 1);\n        for (const theta of [alpha + beta, alpha - beta]) {\n          const fraction = g.sweep.radiansToPositivePeriodicFraction(theta);\n          if (this.extendArcs || fraction <= 1.0)\n            this.collector(this.spacePoint, g, fraction);\n        }\n      }\n    }\n  }\n}\n"]}