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

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

@@ -0,0 +1,403 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
+import { Arc3d } from "../../curve/Arc3d";
+import { BagOfCurves, CurveCollection } from "../../curve/CurveCollection";
+import { CurvePrimitive } from "../../curve/CurvePrimitive";
+import { GeometryQuery } from "../../curve/GeometryQuery";
+import { LineSegment3d } from "../../curve/LineSegment3d";
+import { LineString3d } from "../../curve/LineString3d";
+import { Loop } from "../../curve/Loop";
+import { Path } from "../../curve/Path";
+import { RegionOps } from "../../curve/RegionOps";
+import { Geometry } from "../../Geometry";
+import { CurveCurve } from "../../curve/CurveCurve";
+import { CurveChainWireOffsetContext } from "./PolygonOffsetContext";
+import { FrameBuilder } from "../../geometry3d/FrameBuilder";
+/**
+ * Manage a growing array of arrays of curve primitives that are to be joined "head to tail" in paths.
+ * * The caller makes a sequence of calls to announce individual primitives.
+ * * This collector (unlike the simpler "ChainCollector") expects to have inputs arriving in random order, leaving multiple open chains in play at any time.
+ *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).
+ * * When all curves have been announced, the call to grab the paths option restructures the various active chains into Path and Loop objects.
+ * * Usage pattern is
+ *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`
+ *   * many times
+ *       * `   context.captureCurve (anyCurve, searchAllPaths)`
+ *       * `   context.captureCurvePrimitive (primitive, searchAllPaths)`
+ *   * end:        ` result = context.grabResults (formLoopsIfClosed)`
+ * @internal
+ */
+export class MultiChainCollector {
+    /** Initialize with an empty array of chains.
+     * @param endPointShiftTolerance tolerance for calling endpoints identical
+     * @param planeTolerance tolerance for considering a loop to be planar.  If undefined, only create Path.  If defined, create Loop curves are if within tolerance of a plane.
+     */
+    constructor(endPointShiftTolerance = Geometry.smallMetricDistance, planeTolerance = Geometry.smallMetricDistance) {
+        this._chains = [];
+        this._endPointShiftTolerance = endPointShiftTolerance;
+        this._endPointHitTolerance = Geometry.smallMetricDistance;
+        this._planarityTolerance = planeTolerance;
+    }
+    /**
+     * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz
+     * @param xyz
+     * @param tolerance
+     * @param exceptChainIndex index of chain to ignore.  Send -1 to consider all chains.
+     */
+    findAnyChainToConnect(xyz, tolerance, 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, tolerance))
+                return { chainIndex: chainIndexA, atEnd: true };
+            this._xyzWork1 = chain[0].startPoint(this._xyzWork1);
+            if (this._xyzWork1.isAlmostEqual(xyz, tolerance))
+                return { chainIndex: chainIndexA, atEnd: false };
+        }
+        return undefined;
+    }
+    /**
+     * Insert a single curve primitive into the active chains.
+     * * The primitive is captured (not cloned)
+     * * The primitive may be reversed in place
+     * @param candidate
+     */
+    captureCurvePrimitive(candidate) {
+        if (this.attachPrimitiveToAnyChain(candidate, this._endPointHitTolerance))
+            return;
+        if (this.attachPrimitiveToAnyChain(candidate, this._endPointShiftTolerance))
+            return;
+        this._chains.push([candidate]);
+        return;
+    }
+    /**
+     * Insert any curve into the collection.
+     * * This recurses into Path, Loop, BagOfCurves etc
+     * * The all primitives are captured, and may be reversed in place.
+     * @param candidate
+     */
+    captureCurve(candidate) {
+        if (candidate instanceof CurvePrimitive)
+            this.captureCurvePrimitive(candidate);
+        else if (candidate instanceof CurveCollection && candidate.children !== undefined) {
+            for (const c of candidate.children) {
+                this.captureCurve(c);
+            }
+        }
+    }
+    /** 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, tolerance) {
+        if (candidate) {
+            this._xyzWork0 = candidate.startPoint(this._xyzWork0);
+            let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);
+            if (connect) {
+                if (connect.atEnd) {
+                    const chain = this._chains[connect.chainIndex];
+                    const index0 = chain.length - 1;
+                    this._chains[connect.chainIndex].push(candidate);
+                    OffsetHelpers.moveHeadOrTail(chain[index0], chain[index0 + 1], this._endPointShiftTolerance);
+                    this.searchAndMergeChainIndex(connect.chainIndex, tolerance);
+                    return true;
+                }
+                else {
+                    candidate.reverseInPlace();
+                    const chain = this._chains[connect.chainIndex];
+                    chain.splice(0, 0, candidate);
+                    OffsetHelpers.moveHeadOrTail(chain[0], chain[1], this._endPointShiftTolerance);
+                    this.searchAndMergeChainIndex(connect.chainIndex, tolerance);
+                    return true;
+                }
+            }
+            else {
+                this._xyzWork0 = candidate.endPoint(this._xyzWork0);
+                connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);
+                if (connect) { // START of new primitive ..
+                    if (connect.atEnd) {
+                        candidate.reverseInPlace();
+                        const chain = this._chains[connect.chainIndex];
+                        const index0 = chain.length - 1;
+                        this._chains[connect.chainIndex].push(candidate);
+                        OffsetHelpers.moveHeadOrTail(chain[index0], chain[index0 + 1], this._endPointShiftTolerance);
+                        this.searchAndMergeChainIndex(connect.chainIndex, tolerance);
+                        return true;
+                    }
+                    else {
+                        const chain = this._chains[connect.chainIndex];
+                        chain.splice(0, 0, candidate);
+                        OffsetHelpers.moveHeadOrTail(chain[0], chain[1], this._endPointShiftTolerance);
+                        this.searchAndMergeChainIndex(connect.chainIndex, tolerance);
+                        return true;
+                    }
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * * Move each primitive from chainB to the end of  chainA.
+     * * clear chainB.
+     * * move the final chain to chainB index.
+     * * reduce the _chain.length by 1.
+     */
+    mergeChainsForwardForward(chainIndexA, chainIndexB) {
+        const chainA = this._chains[chainIndexA];
+        const chainB = this._chains[chainIndexB];
+        for (const p of chainB) {
+            chainA.push(p);
+        }
+        // chainIndexB is unused.
+        chainB.length = 0;
+        const lastChainIndex = this._chains.length - 1;
+        if (chainIndexB !== lastChainIndex) {
+            this._chains[chainIndexB] = this._chains[lastChainIndex];
+            this._chains.pop();
+        }
+        else {
+            this._chains.pop();
+        }
+    }
+    reverseChain(chainIndex) {
+        const chain = this._chains[chainIndex];
+        chain.reverse();
+        for (const p of chain)
+            p.reverseInPlace();
+    }
+    // see if the head or tail of chainIndex matches any existing chain.  If so, merge
+    searchAndMergeChainIndex(chainIndex, tolerance) {
+        // ASSUME valid index of non-empty chain
+        const chain = this._chains[chainIndex];
+        const lastIndexInChain = chain.length - 1;
+        this._xyzWork0 = chain[0].startPoint(this._xyzWork0);
+        // this start with any other chain ..
+        let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance, chainIndex);
+        if (connect) {
+            if (!connect.atEnd)
+                this.reverseChain(connect.chainIndex);
+            this.mergeChainsForwardForward(connect.chainIndex, chainIndex);
+            return;
+        }
+        // try end with any other chain
+        this._xyzWork0 = chain[lastIndexInChain].endPoint(this._xyzWork0);
+        connect = this.findAnyChainToConnect(this._xyzWork0, tolerance, chainIndex);
+        if (connect) {
+            if (connect.atEnd)
+                this.reverseChain(connect.chainIndex);
+            this.mergeChainsForwardForward(chainIndex, connect.chainIndex);
+            return;
+        }
+    }
+    /** turn an array of curve primitives into the simplest possible strongly typed curve structure.
+     * * The input array is assumed to be connected appropriately to act as the curves of a Path.
+     * * When a path is created the curves array is CAPTURED.
+     */
+    promoteArrayToCurves(curves, makeLoopIfClosed) {
+        if (curves.length === 0)
+            return undefined;
+        if (makeLoopIfClosed) {
+            const primitive0 = curves[0];
+            const primitiveN = curves[curves.length - 1];
+            MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);
+            MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);
+            const distanceAToB = MultiChainCollector._staticPointA.distance(MultiChainCollector._staticPointB);
+            if (distanceAToB < this._endPointShiftTolerance) {
+                // adjust for closure (and get the corrected coordinates)
+                OffsetHelpers.moveHeadOrTail(primitiveN, primitive0, this._endPointShiftTolerance);
+                MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);
+                MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);
+            }
+            if (MultiChainCollector._staticPointA.isAlmostEqual(MultiChainCollector._staticPointB)) {
+                const localToWorld = FrameBuilder.createRightHandedLocalToWorld(curves);
+                if (localToWorld) {
+                    const worldToLocal = localToWorld.inverse();
+                    if (worldToLocal) {
+                        const range = RegionOps.curveArrayRange(curves, worldToLocal);
+                        if (this._planarityTolerance !== undefined && range.zLength() <= this._planarityTolerance) {
+                            return Loop.createArray(curves);
+                        }
+                    }
+                }
+                return Path.createArray(curves);
+            }
+        }
+        if (curves.length === 1)
+            return curves[0];
+        return Path.createArray(curves);
+    }
+    /** Return the collected results, structured as the simplest possible type. */
+    grabResult(makeLoopIfClosed = false) {
+        const chains = this._chains;
+        if (chains.length === 0)
+            return undefined;
+        if (chains.length === 1)
+            return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);
+        const bag = BagOfCurves.create();
+        for (const chain of chains) {
+            const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);
+            bag.tryAddChild(q);
+        }
+        return bag;
+    }
+}
+// static methods to assist offset sequences ....
+export class OffsetHelpers {
+    // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.
+    static sumLengths(data) {
+        let mySum = 0;
+        if (data instanceof CurvePrimitive) {
+            mySum += data.curveLength();
+        }
+        else if (data instanceof CurveCollection) {
+            mySum += data.sumLengths();
+        }
+        else if (Array.isArray(data)) {
+            for (const data1 of data)
+                mySum += this.sumLengths(data1);
+        }
+        return mySum;
+    }
+    // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.
+    static extendRange(range, data) {
+        if (data instanceof GeometryQuery) {
+            data.extendRange(range);
+        }
+        else if (Array.isArray(data)) {
+            for (const data1 of data)
+                this.extendRange(range, data1);
+        }
+        return range;
+    }
+    // construct (separately) the offsets of each entry of data (Path, Loop, BagOfCurve, or Array of those)
+    // push all offset geometry into the result array
+    // return summed length
+    static appendOffsets(data, offset, result, skipOffsetOfLoop) {
+        let summedLengths = 0;
+        if (data instanceof CurvePrimitive) {
+            const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(Path.create(data), offset);
+            if (resultA) {
+                summedLengths += this.sumLengths(resultA);
+                result.push(resultA);
+            }
+        }
+        else if (data instanceof Loop || data instanceof Path) {
+            if (false && skipOffsetOfLoop && data instanceof Loop) {
+                // skip !!
+            }
+            else {
+                const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(data, offset);
+                if (resultA) {
+                    summedLengths += this.sumLengths(resultA);
+                    result.push(resultA);
+                }
+            }
+        }
+        else if (data instanceof BagOfCurves) {
+            for (const q of data.children)
+                summedLengths += this.appendOffsets(q, offset, result, true);
+        }
+        else if (Array.isArray(data)) {
+            for (const q of data)
+                summedLengths += this.appendOffsets(q, offset, result, true);
+        }
+        return summedLengths;
+    }
+    /**
+     * * Restructure curve fragments as chains and offsets
+     * * Return object with named chains, insideOffsets, outsideOffsets
+     * * BEWARE that if the input is not a loop the classification of outputs is suspect.
+     * @param fragments fragments to be chained
+     * @param offsetDistance offset distance.
+     */
+    static collectInsideAndOutsideOffsets(fragments, offsetDistance, gapTolerance) {
+        const collector = new MultiChainCollector(gapTolerance);
+        for (const s of fragments) {
+            collector.captureCurve(s);
+        }
+        const myChains = collector.grabResult(true);
+        const myOffsetA = [];
+        const myOffsetB = [];
+        const offsetLengthA = OffsetHelpers.appendOffsets(myChains, offsetDistance, myOffsetA, false);
+        const offsetLengthB = OffsetHelpers.appendOffsets(myChains, -offsetDistance, myOffsetB, true);
+        if (offsetLengthA > offsetLengthB) {
+            return { outsideOffsets: myOffsetA, insideOffsets: myOffsetB, chains: myChains };
+        }
+        else {
+            return { insideOffsets: myOffsetA, outsideOffsets: myOffsetB, chains: myChains };
+        }
+    }
+    /**
+     * * Restructure curve fragments as chains and offsets
+     * * Return object with named chains, insideOffsets, outsideOffsets
+     * * BEWARE that if the input is not a loop the classification of outputs is suspect.
+     * @param fragments fragments to be chained
+     * @param gapTolerance distance to be treated as "effectively zero" when joining head-to-tail.
+     */
+    static collectChains(fragments, gapTolerance, planarTolerance = Geometry.smallMetricDistance) {
+        const collector = new MultiChainCollector(gapTolerance, planarTolerance);
+        for (const s of fragments) {
+            collector.captureCurve(s);
+        }
+        return collector.grabResult(true);
+    }
+    /** If allowed by the geometry type, move an endpoint.
+     *
+     */
+    static simpleEndPointMove(g, atEnd, to) {
+        if (g instanceof (LineSegment3d)) {
+            if (atEnd) {
+                g.point1Ref.setFrom(to);
+            }
+            else {
+                g.point0Ref.setFrom(to);
+            }
+            return true;
+        }
+        else if (g instanceof LineString3d && g.numPoints() > 0) {
+            const i = atEnd ? g.numPoints() - 1 : 0;
+            g.packedPoints.setAtCheckedPointIndex(i, to);
+            return true;
+        }
+        return false;
+    }
+    // Try to move move head (end) of g0 and tail (beginning) of g1 together.
+    static moveHeadOrTail(g0, g1, maxShift) {
+        const xyz0 = g0.endPoint();
+        const xyz1 = g1.startPoint();
+        const minShift = Geometry.smallMetricDistance * 0.001;
+        const d01 = xyz0.distanceXY(xyz1);
+        if (d01 < minShift)
+            return true;
+        if (this.simpleEndPointMove(g1, false, xyz0) || this.simpleEndPointMove(g0, true, xyz1))
+            return true;
+        //    const detail1On0 = g0.closestPoint(xyz1);
+        //    const detail0On1 = g1.closestPoint(xyz0);
+        const intersections = CurveCurve.intersectionXYPairs(g0, true, g1, 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 * maxShift && distance1 < shiftFactor * maxShift) {
+                if (g0 instanceof Arc3d && g1 instanceof Arc3d) {
+                    const radians0End = g0.sweep.fractionToRadians(detail0.fraction);
+                    g0.sweep.setStartEndRadians(g0.sweep.startRadians, radians0End);
+                    const radians1Start = g1.sweep.fractionToRadians(detail1.fraction);
+                    g1.sweep.setStartEndRadians(radians1Start, g1.sweep.endRadians);
+                    return true;
+                }
+            }
+        }
+        return false;
+    }
+}
+//# sourceMappingURL=MultiChainCollector.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MultiChainCollector.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAE1C,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACxD,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAc,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,2BAA2B,EAAE,MAAM,wBAAwB,CAAC;AAIrE,OAAO,EAAE,YAAY,EAAE,MAAM,+BAA+B,CAAC;AAE7D;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,mBAAmB;IAY9B;;;OAGG;IACH,YAAmB,sBAAsB,GAAG,QAAQ,CAAC,mBAAmB,EAAE,iBAAqC,QAAQ,CAAC,mBAAmB;QACzI,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,uBAAuB,GAAG,sBAAsB,CAAC;QACtD,IAAI,CAAC,qBAAqB,GAAG,QAAQ,CAAC,mBAAmB,CAAC;QAC1D,IAAI,CAAC,mBAAmB,GAAG,cAAc,CAAC;IAC5C,CAAC;IAGD;;;;;OAKG;IACK,qBAAqB,CAAC,GAAY,EAAE,SAAiB,EAAE,mBAA2B,CAAC,CAAC;QAE1F,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE;YAC1E,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,SAAS,CAAC;gBAC9C,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,SAAS,CAAC;gBAC9C,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;SACpD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;;OAKG;IACI,qBAAqB,CAAC,SAAyB;QACpD,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,CAAC;YAAE,OAAO;QAClF,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,uBAAuB,CAAC;YAAE,OAAO;QACpF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/B,OAAO;IACT,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,SAAwB;QAC1C,IAAI,SAAS,YAAY,cAAc;YACrC,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;aACnC,IAAI,SAAS,YAAY,eAAe,IAAI,SAAS,CAAC,QAAQ,KAAK,SAAS,EAAE;YACjF,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE;gBAClC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;aACtB;SACF;IACH,CAAC;IAED;;;OAGG;IACK,yBAAyB,CAAC,SAAyB,EAAE,SAAiB;QAC5E,IAAI,SAAS,EAAE;YACb,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,SAAS,CAAC,CAAC;YACpE,IAAI,OAAO,EAAE;gBACX,IAAI,OAAO,CAAC,KAAK,EAAE;oBACjB,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,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;oBAC7F,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBAC7D,OAAO,IAAI,CAAC;iBACb;qBAAM;oBACL,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,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;oBAC/E,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBAC7D,OAAO,IAAI,CAAC;iBACb;aACF;iBAAM;gBACL,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAChE,IAAI,OAAO,EAAE,EAAG,4BAA4B;oBAC1C,IAAI,OAAO,CAAC,KAAK,EAAE;wBACjB,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,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;wBAC7F,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;wBAC7D,OAAO,IAAI,CAAC;qBACb;yBAAM;wBACL,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,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;wBAC/E,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;wBAC7D,OAAO,IAAI,CAAC;qBACb;iBACF;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;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;YACtB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAChB;QACD,yBAAyB;QACzB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/C,IAAI,WAAW,KAAK,cAAc,EAAE;YAClC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzD,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;SACpB;aAAM;YACL,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;SACpB;IACH,CAAC;IACO,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,kFAAkF;IAC1E,wBAAwB,CAAC,UAAkB,EAAE,SAAiB;QACpE,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,qCAAqC;QACrC,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QAChF,IAAI,OAAO,EAAE;YACX,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;SACR;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,SAAS,EAAE,UAAU,CAAC,CAAC;QAC5E,IAAI,OAAO,EAAE;YACX,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;SACR;IACH,CAAC;IACD;;;OAGG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE;YACpB,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,MAAM,YAAY,GAAG,mBAAmB,CAAC,aAAa,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YACnG,IAAI,YAAY,GAAG,IAAI,CAAC,uBAAuB,EAAE;gBAC/C,yDAAyD;gBACzD,aAAa,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;gBACnF,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;aAC5F;YACD,IAAI,mBAAmB,CAAC,aAAa,CAAC,aAAa,CAAC,mBAAmB,CAAC,aAAa,CAAC,EAAE;gBACtF,MAAM,YAAY,GAAG,YAAY,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC;gBACxE,IAAI,YAAY,EAAE;oBAChB,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;oBAC5C,IAAI,YAAY,EAAE;wBAChB,MAAM,KAAK,GAAG,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;wBAC9D,IAAI,IAAI,CAAC,mBAAmB,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,mBAAmB,EAAE;4BACzF,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;yBACjC;qBACF;iBACF;gBACD,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;aACjC;SACF;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,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,WAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SACpB;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AACD,iDAAiD;AACjD,MAAM,OAAO,aAAa;IACxB,oGAAoG;IAC7F,MAAM,CAAC,UAAU,CAAC,IAAS;QAChC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,YAAY,cAAc,EAAE;YAClC,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;SAC7B;aAAM,IAAI,IAAI,YAAY,eAAe,EAAE;YAC1C,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;SAC5B;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,MAAM,KAAK,IAAI,IAAI;gBACtB,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;SACnC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oGAAoG;IAC7F,MAAM,CAAC,WAAW,CAAC,KAAc,EAAE,IAAS;QACjD,IAAI,IAAI,YAAY,aAAa,EAAE;YACjC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;SACzB;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,MAAM,KAAK,IAAI,IAAI;gBACtB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SAClC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,uGAAuG;IACvG,iDAAiD;IACjD,uBAAuB;IAChB,MAAM,CAAC,aAAa,CAAC,IAAuC,EAAE,MAAc,EAAE,MAAuB,EAAE,gBAAyB;QACrI,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,IAAI,YAAY,cAAc,EAAE;YAClC,MAAM,OAAO,GAAG,2BAA2B,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;YAC9F,IAAI,OAAO,EAAE;gBACX,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACtB;SACF;aAAM,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,IAAI,EAAE;YACvD,IAAI,KAAK,IAAI,gBAAgB,IAAI,IAAI,YAAY,IAAI,EAAE;gBACrD,UAAU;aACX;iBAAM;gBACL,MAAM,OAAO,GAAG,2BAA2B,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBACjF,IAAI,OAAO,EAAE;oBACX,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;oBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;iBACtB;aACF;SACF;aAAM,IAAI,IAAI,YAAY,WAAW,EAAE;YACtC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;gBAC3B,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;SAChE;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI;gBAClB,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;SAChE;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAA0B,EAAE,cAAsB,EAAE,YAAoB;QACnH,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;SAC3B;QACD,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAoB,EAAE,CAAC;QACtC,MAAM,SAAS,GAAoB,EAAE,CAAC;QACtC,MAAM,aAAa,GAAG,aAAa,CAAC,aAAa,CAAC,QAAQ,EAAE,cAAc,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAC9F,MAAM,aAAa,GAAG,aAAa,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,cAAc,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAC9F,IAAI,aAAa,GAAG,aAAa,EAAE;YACjC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;SAClF;aAAM;YACL,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;SAClF;IACH,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,aAAa,CAAC,SAA0B,EAAE,YAAoB,EAAE,kBAA0B,QAAQ,CAAC,mBAAmB;QAClI,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC;QACzE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;SAC3B;QACD,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,kBAAkB,CAAC,CAAiB,EAAE,KAAc,EAAE,EAAU;QAC5E,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE;YAChC,IAAI,KAAK,EAAE;gBACT,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aACzB;iBAAM;gBACL,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aACzB;YACD,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,CAAC,YAAY,YAAY,IAAI,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE;YACzD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC,CAAC,YAAY,CAAC,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7C,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,yEAAyE;IAClE,MAAM,CAAC,cAAc,CAAC,EAAkB,EAAE,EAAkB,EAAE,QAAgB;QACnF,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,mBAAmB,GAAG,KAAK,CAAC;QACtD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,QAAQ;YAChB,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC;YACrF,OAAO,IAAI,CAAC;QACd,+CAA+C;QAC/C,+CAA+C;QAC/C,MAAM,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,GAAG,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE;YAChC,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,QAAQ,IAAI,SAAS,GAAG,WAAW,GAAG,QAAQ,EAAE;gBAC5E,IAAI,EAAE,YAAY,KAAK,IAAI,EAAE,YAAY,KAAK,EAAE;oBAC9C,MAAM,WAAW,GAAG,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjE,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;oBAChE,MAAM,aAAa,GAAG,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACnE,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,aAAa,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAChE,OAAO,IAAI,CAAC;iBACb;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { Arc3d } from \"../../curve/Arc3d\";\r\nimport { AnyCurve } from \"../../curve/CurveChain\";\r\nimport { BagOfCurves, CurveCollection } from \"../../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../../curve/CurvePrimitive\";\r\nimport { GeometryQuery } from \"../../curve/GeometryQuery\";\r\nimport { LineSegment3d } from \"../../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../../curve/LineString3d\";\r\nimport { Loop } from \"../../curve/Loop\";\r\nimport { Path } from \"../../curve/Path\";\r\nimport { ChainTypes, RegionOps } from \"../../curve/RegionOps\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { CurveCurve } from \"../../curve/CurveCurve\";\r\nimport { CurveChainWireOffsetContext } from \"./PolygonOffsetContext\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\nimport { XYAndZ } from \"../../geometry3d/XYZProps\";\r\nimport { FrameBuilder } from \"../../geometry3d/FrameBuilder\";\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 \"ChainCollector\") expects to have inputs arriving in random order, leaving multiple open chains in play at any time.\r\n *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).\r\n * * When all curves have been announced, the call to grab the paths option restructures the various active chains into Path and Loop objects.\r\n * * Usage pattern is\r\n *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`\r\n *   * many times\r\n *       * `   context.captureCurve (anyCurve, searchAllPaths)`\r\n *       * `   context.captureCurvePrimitive (primitive, searchAllPaths)`\r\n *   * end:        ` result = context.grabResults (formLoopsIfClosed)`\r\n * @internal\r\n */\r\nexport class MultiChainCollector {\r\n  private _chains: CurvePrimitive[][];\r\n\r\n  private static _staticPointA: Point3d;\r\n  private static _staticPointB: Point3d;\r\n\r\n  /** LOOSE tolerance for snap to end */\r\n  private _endPointShiftTolerance: number;\r\n  /** TIGHT tolerance for snap to end */\r\n  private _endPointHitTolerance: number;\r\n  /** tolerance for choosing Path or Loop.   If undefined, ALWAYS PATH */\r\n  private _planarityTolerance: number | undefined;\r\n  /** Initialize with an empty array of chains.\r\n   * @param endPointShiftTolerance tolerance for calling endpoints identical\r\n   * @param planeTolerance tolerance for considering a loop to be planar.  If undefined, only create Path.  If defined, create Loop curves are if within tolerance of a plane.\r\n   */\r\n  public constructor(endPointShiftTolerance = Geometry.smallMetricDistance, planeTolerance: number | undefined = Geometry.smallMetricDistance) {\r\n    this._chains = [];\r\n    this._endPointShiftTolerance = endPointShiftTolerance;\r\n    this._endPointHitTolerance = Geometry.smallMetricDistance;\r\n    this._planarityTolerance = planeTolerance;\r\n  }\r\n\r\n  private _xyzWork0?: Point3d;\r\n  /**\r\n   * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz\r\n   * @param xyz\r\n   * @param tolerance\r\n   * @param exceptChainIndex index of chain to ignore.  Send -1 to consider all chains.\r\n   */\r\n  private findAnyChainToConnect(xyz: Point3d, tolerance: number, exceptChainIndex: number = -1): { chainIndex: number, atEnd: boolean } | undefined {\r\n\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, tolerance))\r\n        return { chainIndex: chainIndexA, atEnd: true };\r\n      this._xyzWork1 = chain[0].startPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz, tolerance))\r\n        return { chainIndex: chainIndexA, atEnd: false };\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  private _xyzWork1?: Point3d;\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\r\n   */\r\n  public captureCurvePrimitive(candidate: CurvePrimitive) {\r\n    if (this.attachPrimitiveToAnyChain(candidate, this._endPointHitTolerance)) return;\r\n    if (this.attachPrimitiveToAnyChain(candidate, this._endPointShiftTolerance)) return;\r\n    this._chains.push([candidate]);\r\n    return;\r\n  }\r\n\r\n  /**\r\n   * Insert any curve into the collection.\r\n   * * This recurses into Path, Loop, BagOfCurves etc\r\n   * * The all primitives are captured, and may be reversed in place.\r\n   * @param candidate\r\n   */\r\n  public captureCurve(candidate: GeometryQuery) {\r\n    if (candidate instanceof CurvePrimitive)\r\n      this.captureCurvePrimitive(candidate);\r\n    else if (candidate instanceof CurveCollection && candidate.children !== undefined) {\r\n      for (const c of candidate.children) {\r\n        this.captureCurve(c);\r\n      }\r\n    }\r\n  }\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, tolerance: number): boolean {\r\n    if (candidate) {\r\n      this._xyzWork0 = candidate.startPoint(this._xyzWork0);\r\n      let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);\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          OffsetHelpers.moveHeadOrTail(chain[index0], chain[index0 + 1], this._endPointShiftTolerance);\r\n          this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\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          OffsetHelpers.moveHeadOrTail(chain[0], chain[1], this._endPointShiftTolerance);\r\n          this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\r\n          return true;\r\n        }\r\n      } else {\r\n        this._xyzWork0 = candidate.endPoint(this._xyzWork0);\r\n        connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);\r\n        if (connect) {  // START of new primitive ..\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            OffsetHelpers.moveHeadOrTail(chain[index0], chain[index0 + 1], this._endPointShiftTolerance);\r\n            this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\r\n            return true;\r\n          } else {\r\n            const chain = this._chains[connect.chainIndex];\r\n            chain.splice(0, 0, candidate);\r\n            OffsetHelpers.moveHeadOrTail(chain[0], chain[1], this._endPointShiftTolerance);\r\n            this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\r\n            return true;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /**\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   * * reduce the _chain.length by 1.\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    // chainIndexB is unused.\r\n    chainB.length = 0;\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    } else {\r\n      this._chains.pop();\r\n    }\r\n  }\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\r\n  private searchAndMergeChainIndex(chainIndex: number, tolerance: 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    // this start with any other chain ..\r\n    let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance, 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, tolerance, 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  /** turn an array of curve primitives into the simplest possible strongly typed curve structure.\r\n   * * The input array is assumed to be connected appropriately to act as the curves of a Path.\r\n   * * When a path is created the curves array is CAPTURED.\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      const distanceAToB = MultiChainCollector._staticPointA.distance(MultiChainCollector._staticPointB);\r\n      if (distanceAToB < this._endPointShiftTolerance) {\r\n        // adjust for closure (and get the corrected coordinates)\r\n        OffsetHelpers.moveHeadOrTail(primitiveN, primitive0, this._endPointShiftTolerance);\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)) {\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._planarityTolerance !== undefined && range.zLength() <= this._planarityTolerance) {\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  /** Return the collected results, structured as the simplest possible type. */\r\n  public grabResult(makeLoopIfClosed: boolean = false): CurvePrimitive | Path | BagOfCurves | Loop | 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// static methods to assist offset sequences ....\r\nexport class OffsetHelpers {\r\n  // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.\r\n  public static sumLengths(data: any): number {\r\n    let mySum = 0;\r\n    if (data instanceof CurvePrimitive) {\r\n      mySum += data.curveLength();\r\n    } else if (data instanceof CurveCollection) {\r\n      mySum += data.sumLengths();\r\n    } else if (Array.isArray(data)) {\r\n      for (const data1 of data)\r\n        mySum += this.sumLengths(data1);\r\n    }\r\n    return mySum;\r\n  }\r\n  // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.\r\n  public static extendRange(range: Range3d, data: any): Range3d {\r\n    if (data instanceof GeometryQuery) {\r\n      data.extendRange(range);\r\n    } else if (Array.isArray(data)) {\r\n      for (const data1 of data)\r\n        this.extendRange(range, data1);\r\n    }\r\n    return range;\r\n  }\r\n\r\n  // construct (separately) the offsets of each entry of data (Path, Loop, BagOfCurve, or Array of those)\r\n  // push all offset geometry into the result array\r\n  // return summed length\r\n  public static appendOffsets(data: AnyCurve | AnyCurve[] | undefined, offset: number, result: GeometryQuery[], skipOffsetOfLoop: boolean): number {\r\n    let summedLengths = 0;\r\n    if (data instanceof CurvePrimitive) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(Path.create(data), offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (data instanceof Loop || data instanceof Path) {\r\n      if (false && skipOffsetOfLoop && data instanceof Loop) {\r\n        // skip !!\r\n      } else {\r\n        const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(data, offset);\r\n        if (resultA) {\r\n          summedLengths += this.sumLengths(resultA);\r\n          result.push(resultA);\r\n        }\r\n      }\r\n    } else if (data instanceof BagOfCurves) {\r\n      for (const q of data.children)\r\n        summedLengths += this.appendOffsets(q, offset, result, true);\r\n    } else if (Array.isArray(data)) {\r\n      for (const q of data)\r\n        summedLengths += this.appendOffsets(q, offset, result, true);\r\n    }\r\n    return summedLengths;\r\n  }\r\n\r\n  /**\r\n   * * Restructure curve fragments as chains and offsets\r\n   * * Return object with named chains, insideOffsets, outsideOffsets\r\n   * * BEWARE that if the input is not a loop the classification of outputs is suspect.\r\n   * @param fragments fragments to be chained\r\n   * @param offsetDistance offset distance.\r\n   */\r\n  public static collectInsideAndOutsideOffsets(fragments: GeometryQuery[], offsetDistance: number, gapTolerance: number): { insideOffsets: GeometryQuery[], outsideOffsets: GeometryQuery[], chains: ChainTypes } {\r\n    const collector = new MultiChainCollector(gapTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    const myChains = collector.grabResult(true);\r\n    const myOffsetA: GeometryQuery[] = [];\r\n    const myOffsetB: GeometryQuery[] = [];\r\n    const offsetLengthA = OffsetHelpers.appendOffsets(myChains, offsetDistance, myOffsetA, false);\r\n    const offsetLengthB = OffsetHelpers.appendOffsets(myChains, -offsetDistance, myOffsetB, true);\r\n    if (offsetLengthA > offsetLengthB) {\r\n      return { outsideOffsets: myOffsetA, insideOffsets: myOffsetB, chains: myChains };\r\n    } else {\r\n      return { insideOffsets: myOffsetA, outsideOffsets: myOffsetB, chains: myChains };\r\n    }\r\n  }\r\n  /**\r\n   * * Restructure curve fragments as chains and offsets\r\n   * * Return object with named chains, insideOffsets, outsideOffsets\r\n   * * BEWARE that if the input is not a loop the classification of outputs is suspect.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when joining head-to-tail.\r\n   */\r\n  public static collectChains(fragments: GeometryQuery[], gapTolerance: number, planarTolerance: number = Geometry.smallMetricDistance): ChainTypes {\r\n    const collector = new MultiChainCollector(gapTolerance, planarTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    return collector.grabResult(true);\r\n  }\r\n\r\n  /** If allowed by the geometry type, move an endpoint.\r\n   *\r\n   */\r\n  public static simpleEndPointMove(g: CurvePrimitive, atEnd: boolean, to: XYAndZ): boolean {\r\n    if (g instanceof (LineSegment3d)) {\r\n      if (atEnd) {\r\n        g.point1Ref.setFrom(to);\r\n      } else {\r\n        g.point0Ref.setFrom(to);\r\n      }\r\n      return true;\r\n    } else if (g instanceof LineString3d && g.numPoints() > 0) {\r\n      const i = atEnd ? g.numPoints() - 1 : 0;\r\n      g.packedPoints.setAtCheckedPointIndex(i, to);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  // Try to move move head (end) of g0 and tail (beginning) of g1 together.\r\n  public static moveHeadOrTail(g0: CurvePrimitive, g1: CurvePrimitive, maxShift: number): boolean {\r\n    const xyz0 = g0.endPoint();\r\n    const xyz1 = g1.startPoint();\r\n    const minShift = Geometry.smallMetricDistance * 0.001;\r\n    const d01 = xyz0.distanceXY(xyz1);\r\n    if (d01 < minShift)\r\n      return true;\r\n    if (this.simpleEndPointMove(g1, false, xyz0) || this.simpleEndPointMove(g0, true, xyz1))\r\n      return true;\r\n    //    const detail1On0 = g0.closestPoint(xyz1);\r\n    //    const detail0On1 = g1.closestPoint(xyz0);\r\n    const intersections = CurveCurve.intersectionXYPairs(g0, true, g1, 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 * maxShift && distance1 < shiftFactor * maxShift) {\r\n        if (g0 instanceof Arc3d && g1 instanceof Arc3d) {\r\n          const radians0End = g0.sweep.fractionToRadians(detail0.fraction);\r\n          g0.sweep.setStartEndRadians(g0.sweep.startRadians, radians0End);\r\n          const radians1Start = g1.sweep.fractionToRadians(detail1.fraction);\r\n          g1.sweep.setStartEndRadians(radians1Start, g1.sweep.endRadians);\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.d.ts

@@ -0,0 +1,38 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { RecurseToCurvesGeometryHandler } from "../../geometry3d/GeometryHandler";
+import { PlaneAltitudeEvaluator } from "../../Geometry";
+import { Range1d } from "../../geometry3d/Range";
+import { Point3d, Vector3d } from "../../geometry3d/Point3dVector3d";
+import { LineSegment3d } from "../LineSegment3d";
+import { LineString3d } from "../LineString3d";
+import { GrowableXYZArray } from "../../geometry3d/GrowableXYZArray";
+import { Arc3d } from "../Arc3d";
+import { GeometryQuery } from "../GeometryQuery";
+import { BSplineCurve3d } from "../../bspline/BSplineCurve";
+import { BSplineCurve3dH } from "../../bspline/BSplineCurve3dH";
+/**
+ * Accumulator context for searching for extrema of geometry along a plane.
+ * @internal
+ */
+export declare class PlaneAltitudeRangeContext extends RecurseToCurvesGeometryHandler {
+    plane: PlaneAltitudeEvaluator;
+    range: Range1d;
+    lowPoint: Point3d | undefined;
+    highPoint: Point3d | undefined;
+    private constructor();
+    resetRange(): void;
+    announcePoint(point: Point3d): void;
+    announcePoints(points: GrowableXYZArray): void;
+    static createCapture(plane: PlaneAltitudeEvaluator): PlaneAltitudeRangeContext;
+    handleLineSegment3d(segment: LineSegment3d): void;
+    handleLineString3d(lineString: LineString3d): void;
+    handleBSplineCurve3d(bcurve: BSplineCurve3d): void;
+    handleBSplineCurve3dH(bcurve: BSplineCurve3dH): void;
+    private _sineCosinePolynomial?;
+    private _workPoint?;
+    handleArc3d(g: Arc3d): void;
+    static findExtremePointsInDirection(geometry: GeometryQuery, direction: Vector3d): Point3d[] | undefined;
+}
+//# sourceMappingURL=PlaneAltitudeRangeContext.d.ts.map

package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PlaneAltitudeRangeContext.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/PlaneAltitudeRangeContext.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAE,sBAAsB,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAEjC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAEhE;;;GAGG;AACH,qBAAa,yBAA0B,SAAQ,8BAA8B;IACpE,KAAK,EAAE,sBAAsB,CAAC;IAC9B,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,OAAO,GAAG,SAAS,CAAC;IAC9B,SAAS,EAAE,OAAO,GAAG,SAAS,CAAC;IACtC,OAAO;IAOA,UAAU;IAIV,aAAa,CAAC,KAAK,EAAE,OAAO;IAQ5B,cAAc,CAAC,MAAM,EAAE,gBAAgB;WAUhC,aAAa,CAAC,KAAK,EAAE,sBAAsB,GAAG,yBAAyB;IAKrE,mBAAmB,CAAC,OAAO,EAAE,aAAa;IAK1C,kBAAkB,CAAC,UAAU,EAAE,YAAY;IAI3C,oBAAoB,CAAC,MAAM,EAAE,cAAc;IAM3C,qBAAqB,CAAC,MAAM,EAAE,eAAe;IAO7D,OAAO,CAAC,qBAAqB,CAAC,CAAuB;IACrD,OAAO,CAAC,UAAU,CAAC,CAAU;IACb,WAAW,CAAC,CAAC,EAAE,KAAK;WAWtB,4BAA4B,CAAC,QAAQ,EAAE,aAAa,EAAE,SAAS,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,SAAS;CAUhH"}

package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js

@@ -0,0 +1,88 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
+import { RecurseToCurvesGeometryHandler } from "../../geometry3d/GeometryHandler";
+import { Range1d } from "../../geometry3d/Range";
+import { Point3d } from "../../geometry3d/Point3dVector3d";
+import { LineString3d } from "../LineString3d";
+import { Plane3dByOriginAndUnitNormal } from "../../geometry3d/Plane3dByOriginAndUnitNormal";
+/**
+ * Accumulator context for searching for extrema of geometry along a plane.
+ * @internal
+ */
+export class PlaneAltitudeRangeContext extends RecurseToCurvesGeometryHandler {
+    constructor(plane) {
+        super();
+        this.plane = plane;
+        this.range = Range1d.createNull();
+        this.resetRange();
+    }
+    resetRange() {
+        this.range.setNull();
+    }
+    announcePoint(point) {
+        const h = this.plane.altitude(point);
+        if (this.range.extendLow(h))
+            this.lowPoint = point.clone(this.lowPoint);
+        if (this.range.extendHigh(h))
+            this.highPoint = point.clone(this.highPoint);
+    }
+    announcePoints(points) {
+        for (let i = 0; i < points.length; i++) {
+            const h = points.evaluateUncheckedIndexPlaneAltitude(i, this.plane);
+            if (this.range.extendLow(h))
+                this.lowPoint = points.getPoint3dAtUncheckedPointIndex(i, this.lowPoint);
+            if (this.range.extendHigh(h))
+                this.highPoint = points.getPoint3dAtUncheckedPointIndex(i, this.highPoint);
+        }
+    }
+    static createCapture(plane) {
+        const context = new PlaneAltitudeRangeContext(plane);
+        return context;
+    }
+    handleLineSegment3d(segment) {
+        this.announcePoint(segment.point0Ref);
+        this.announcePoint(segment.point1Ref);
+    }
+    handleLineString3d(lineString) {
+        this.announcePoints(lineString.packedPoints);
+    }
+    handleBSplineCurve3d(bcurve) {
+        // ugh.   The point MUST be on the curve -- usual excess-range of poles is not ok.
+        const ls = LineString3d.create();
+        bcurve.emitStrokes(ls);
+        this.handleLineString3d(ls);
+    }
+    handleBSplineCurve3dH(bcurve) {
+        // ugh.   The point MUST be on the curve -- usual excess-range of poles is not ok.
+        const ls = LineString3d.create();
+        bcurve.emitStrokes(ls);
+        this.handleLineString3d(ls);
+    }
+    handleArc3d(g) {
+        this._sineCosinePolynomial = g.getPlaneAltitudeSineCosinePolynomial(this.plane, this._sineCosinePolynomial);
+        let radians = this._sineCosinePolynomial.referenceMinMaxRadians();
+        if (g.sweep.isRadiansInSweep(radians))
+            this.announcePoint((this._workPoint = g.radiansToPoint(radians, this._workPoint)));
+        radians += Math.PI;
+        if (g.sweep.isRadiansInSweep(radians))
+            this.announcePoint((this._workPoint = g.radiansToPoint(radians, this._workPoint)));
+        this.announcePoint((this._workPoint = g.startPoint(this._workPoint)));
+        this.announcePoint((this._workPoint = g.endPoint(this._workPoint)));
+    }
+    static findExtremePointsInDirection(geometry, direction) {
+        const plane = Plane3dByOriginAndUnitNormal.create(Point3d.create(0, 0, 0), direction);
+        if (plane) {
+            const context = new PlaneAltitudeRangeContext(plane);
+            geometry.dispatchToGeometryHandler(context);
+            if (context.highPoint && context.lowPoint)
+                return [context.lowPoint, context.highPoint];
+        }
+        return undefined;
+    }
+}
+//# sourceMappingURL=PlaneAltitudeRangeContext.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"PlaneAltitudeRangeContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/PlaneAltitudeRangeContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAElF,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,OAAO,EAAY,MAAM,kCAAkC,CAAC;AAErE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAK/C,OAAO,EAAE,4BAA4B,EAAE,MAAM,+CAA+C,CAAC;AAI7F;;;GAGG;AACH,MAAM,OAAO,yBAA0B,SAAQ,8BAA8B;IAK3E,YAAoB,KAA6B;QAC/C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,OAAO,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;YACtC,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;SAC9E;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;IAEe,oBAAoB,CAAC,MAAsB;QACzD,kFAAkF;QAClF,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IACe,qBAAqB,CAAC,MAAuB;QAC3D,kFAAkF;QAClF,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAIe,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;IACM,MAAM,CAAC,4BAA4B,CAAC,QAAuB,EAAE,SAAmB;QACrF,MAAM,KAAK,GAAG,4BAA4B,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QACtF,IAAI,KAAK,EAAE;YACT,MAAM,OAAO,GAAG,IAAI,yBAAyB,CAAC,KAAK,CAAC,CAAC;YACrD,QAAQ,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,QAAQ;gBACvC,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;SAChD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { PlaneAltitudeEvaluator } from \"../../Geometry\";\r\nimport { Range1d } from \"../../geometry3d/Range\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { SineCosinePolynomial } from \"../../numerics/Polynomials\";\r\nimport { GeometryQuery } from \"../GeometryQuery\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { BSplineCurve3d } from \"../../bspline/BSplineCurve\";\r\nimport { BSplineCurve3dH } from \"../../bspline/BSplineCurve3dH\";\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  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    const ls = LineString3d.create();\r\n    bcurve.emitStrokes(ls);\r\n    this.handleLineString3d(ls);\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    const ls = LineString3d.create();\r\n    bcurve.emitStrokes(ls);\r\n    this.handleLineString3d(ls);\r\n  }\r\n\r\n  private _sineCosinePolynomial?: SineCosinePolynomial;\r\n  private _workPoint?: Point3d;\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  public static findExtremePointsInDirection(geometry: GeometryQuery, direction: Vector3d): Point3d[] | undefined {\r\n    const plane = Plane3dByOriginAndUnitNormal.create(Point3d.create(0, 0, 0), direction);\r\n    if (plane) {\r\n      const context = new PlaneAltitudeRangeContext(plane);\r\n      geometry.dispatchToGeometryHandler(context);\r\n      if (context.highPoint && context.lowPoint)\r\n        return [context.lowPoint, context.highPoint];\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}