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

package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js

@@ -0,0 +1,111 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { NullGeometryHandler } from "../../geometry3d/GeometryHandler";
+import { PolylineCompressionContext } from "../../geometry3d/PolylineCompressionByEdgeOffset";
+import { PolylineOps } from "../../geometry3d/PolylineOps";
+import { Arc3d } from "../Arc3d";
+import { ConsolidateAdjacentCurvePrimitivesOptions } from "../CurveCollection";
+import { CurveFactory } from "../CurveFactory";
+import { LineSegment3d } from "../LineSegment3d";
+import { LineString3d } from "../LineString3d";
+/**
+ * * Implementation class for ConsolidateAdjacentCurvePrimitives.
+ *
+ * @internal
+ */
+export class ConsolidateAdjacentCurvePrimitivesContext extends NullGeometryHandler {
+    constructor(options) {
+        super();
+        this._options = options ? options : new ConsolidateAdjacentCurvePrimitivesOptions();
+    }
+    /** look for adjacent compatible primitives in a path or loop. */
+    handleCurveChain(g) {
+        const children = g.children;
+        const numOriginal = children.length;
+        const points = [];
+        let numAccept = 0;
+        // i0 <=i < i1 is a range of child indices.
+        // numAccept is the number of children accepted (contiguously at front of children)
+        for (let i0 = 0; i0 < numOriginal;) {
+            const basePrimitive = g.children[i0];
+            if (this._options.consolidateLinearGeometry && (basePrimitive instanceof LineSegment3d || basePrimitive instanceof LineString3d)) {
+                points.length = 0;
+                let i1 = i0;
+                // on exit, i1 is beyond the block of linear primitives  . ..
+                for (; i1 < g.children.length; i1++) {
+                    const nextPrimitive = g.children[i1];
+                    if (nextPrimitive instanceof LineSegment3d) {
+                        points.push(nextPrimitive.startPoint());
+                        points.push(nextPrimitive.endPoint());
+                    }
+                    else if (nextPrimitive instanceof LineString3d) {
+                        const source = nextPrimitive.packedPoints;
+                        for (let k = 0; k < source.length; k++) {
+                            points.push(source.getPoint3dAtUncheckedPointIndex(k));
+                        }
+                    }
+                    else {
+                        break;
+                    }
+                }
+                if (points.length > 1) {
+                    const tolerance = this._options.colinearPointTolerance;
+                    const compressedPointsA = PolylineOps.compressShortEdges(points, tolerance);
+                    const compressedPointsB = PolylineOps.compressByPerpendicularDistance(compressedPointsA, tolerance);
+                    if (i0 === 0 && i1 === numOriginal) {
+                        // points is the entire curve, and the curve is closed.   Maybe the first and last segments are colinear.
+                        PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, tolerance);
+                    }
+                    if (compressedPointsB.length < 2) {
+                        // Collapsed to a point?  Make a single point linestring
+                        g.children[numAccept++] = LineString3d.create(compressedPointsB[0]);
+                    }
+                    else if (compressedPointsB.length === 2) {
+                        g.children[numAccept++] = LineSegment3d.create(compressedPointsB[0], compressedPointsB[1]);
+                    }
+                    else {
+                        g.children[numAccept++] = LineString3d.createPoints(compressedPointsB);
+                    }
+                }
+                else {
+                    g.children[numAccept++] = basePrimitive;
+                }
+                i0 = i1;
+            }
+            else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof Arc3d) {
+                // subsume subsequent arcs into basePrimitive.
+                // always accept base primitive.
+                for (; ++i0 < g.children.length;) {
+                    const nextPrimitive = g.children[i0];
+                    if (!(nextPrimitive instanceof Arc3d))
+                        break;
+                    if (!CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive))
+                        break;
+                }
+                // i0 has already advanced
+                g.children[numAccept++] = basePrimitive; // which has been extended 0 or more times.
+            }
+            else {
+                g.children[numAccept++] = basePrimitive;
+                i0++;
+            }
+        }
+        g.children.length = numAccept;
+    }
+    handlePath(g) { return this.handleCurveChain(g); }
+    handleLoop(g) { return this.handleCurveChain(g); }
+    handleParityRegion(g) {
+        for (const child of g.children)
+            child.dispatchToGeometryHandler(this);
+    }
+    handleUnionRegion(g) {
+        for (const child of g.children)
+            child.dispatchToGeometryHandler(this);
+    }
+}
+//# sourceMappingURL=ConsolidateAdjacentPrimitivesContext.js.map

package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConsolidateAdjacentPrimitivesContext.js","sourceRoot":"","sources":["../../../../src/curve/Query/ConsolidateAdjacentPrimitivesContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AAEvE,OAAO,EAAE,0BAA0B,EAAE,MAAM,kDAAkD,CAAC;AAC9F,OAAO,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAC3D,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,yCAAyC,EAAc,MAAM,oBAAoB,CAAC;AAC3F,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAM/C;;;;GAIG;AACH,MAAM,OAAO,yCAA0C,SAAQ,mBAAmB;IAEhF,YAAmB,OAAmD;QACpE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,yCAAyC,EAAE,CAAC;IACtF,CAAC;IACD,iEAAiE;IAC1D,gBAAgB,CAAC,CAAa;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC5B,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC;QACpC,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,2CAA2C;QAC3C,mFAAmF;QACnF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,GAAG;YAClC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,CAAC,aAAa,YAAY,aAAa,IAAI,aAAa,YAAY,YAAY,CAAC,EAAE;gBAChI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAClB,IAAI,EAAE,GAAG,EAAE,CAAC;gBACZ,6DAA6D;gBAC7D,OAAO,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;oBACnC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,aAAa,YAAY,aAAa,EAAE;wBAC1C,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC;wBACxC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;qBACvC;yBAAM,IAAI,aAAa,YAAY,YAAY,EAAE;wBAChD,MAAM,MAAM,GAAG,aAAa,CAAC,YAAY,CAAC;wBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACtC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,CAAC;yBACxD;qBACF;yBAAM;wBACL,MAAM;qBACP;iBACF;gBACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;oBACrB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC;oBACvD,MAAM,iBAAiB,GAAG,WAAW,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;oBAC5E,MAAM,iBAAiB,GAAG,WAAW,CAAC,+BAA+B,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;oBACpG,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,WAAW,EAAE;wBAClC,yGAAyG;wBACzG,0BAA0B,CAAC,2BAA2B,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;qBACtF;oBACD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;wBAChC,wDAAwD;wBACxD,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;qBACrE;yBAAM,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE;wBACzC,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;qBAC5F;yBAAM;wBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC;qBACxE;iBACF;qBAAM;oBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;iBACzC;gBACD,EAAE,GAAG,EAAE,CAAC;aACT;iBAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,aAAa,YAAY,KAAK,EAAE;gBACpF,8CAA8C;gBAC9C,gCAAgC;gBAChC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG;oBAChC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,CAAC,aAAa,YAAY,KAAK,CAAC;wBACnC,MAAM;oBACR,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,aAAa,EAAE,aAAa,CAAC;wBAChE,MAAM;iBACT;gBACD,0BAA0B;gBAC1B,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,CAAI,2CAA2C;aACxF;iBAAM;gBACL,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;gBACxC,EAAE,EAAE,CAAC;aACN;SACF;QACD,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,SAAS,CAAC;IAChC,CAAC;IAEe,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,kBAAkB,CAAC,CAAe;QAChD,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;YAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IACe,iBAAiB,CAAC,CAAc;QAC9C,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;YAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC1C,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/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { NullGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"../../geometry3d/PolylineCompressionByEdgeOffset\";\r\nimport { PolylineOps } from \"../../geometry3d/PolylineOps\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { ConsolidateAdjacentCurvePrimitivesOptions, CurveChain } from \"../CurveCollection\";\r\nimport { CurveFactory } from \"../CurveFactory\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop } from \"../Loop\";\r\nimport { Path } from \"../Path\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { UnionRegion } from \"../UnionRegion\";\r\n\r\n/**\r\n * * Implementation class for ConsolidateAdjacentCurvePrimitives.\r\n *\r\n * @internal\r\n */\r\nexport class ConsolidateAdjacentCurvePrimitivesContext extends NullGeometryHandler {\r\n  private _options: ConsolidateAdjacentCurvePrimitivesOptions;\r\n  public constructor(options?: ConsolidateAdjacentCurvePrimitivesOptions) {\r\n    super();\r\n    this._options = options ? options : new ConsolidateAdjacentCurvePrimitivesOptions();\r\n  }\r\n  /** look for adjacent compatible primitives in a path or loop. */\r\n  public handleCurveChain(g: CurveChain) {\r\n    const children = g.children;\r\n    const numOriginal = children.length;\r\n    const points: Point3d[] = [];\r\n    let numAccept = 0;\r\n    // i0 <=i < i1 is a range of child indices.\r\n    // numAccept is the number of children accepted (contiguously at front of children)\r\n    for (let i0 = 0; i0 < numOriginal;) {\r\n      const basePrimitive = g.children[i0];\r\n      if (this._options.consolidateLinearGeometry && (basePrimitive instanceof LineSegment3d || basePrimitive instanceof LineString3d)) {\r\n        points.length = 0;\r\n        let i1 = i0;\r\n        // on exit, i1 is beyond the block of linear primitives  . ..\r\n        for (; i1 < g.children.length; i1++) {\r\n          const nextPrimitive = g.children[i1];\r\n          if (nextPrimitive instanceof LineSegment3d) {\r\n            points.push(nextPrimitive.startPoint());\r\n            points.push(nextPrimitive.endPoint());\r\n          } else if (nextPrimitive instanceof LineString3d) {\r\n            const source = nextPrimitive.packedPoints;\r\n            for (let k = 0; k < source.length; k++) {\r\n              points.push(source.getPoint3dAtUncheckedPointIndex(k));\r\n            }\r\n          } else {\r\n            break;\r\n          }\r\n        }\r\n        if (points.length > 1) {\r\n          const tolerance = this._options.colinearPointTolerance;\r\n          const compressedPointsA = PolylineOps.compressShortEdges(points, tolerance);\r\n          const compressedPointsB = PolylineOps.compressByPerpendicularDistance(compressedPointsA, tolerance);\r\n          if (i0 === 0 && i1 === numOriginal) {\r\n            // points is the entire curve, and the curve is closed.   Maybe the first and last segments are colinear.\r\n            PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, tolerance);\r\n          }\r\n          if (compressedPointsB.length < 2) {\r\n            // Collapsed to a point?  Make a single point linestring\r\n            g.children[numAccept++] = LineString3d.create(compressedPointsB[0]);\r\n          } else if (compressedPointsB.length === 2) {\r\n            g.children[numAccept++] = LineSegment3d.create(compressedPointsB[0], compressedPointsB[1]);\r\n          } else {\r\n            g.children[numAccept++] = LineString3d.createPoints(compressedPointsB);\r\n          }\r\n        } else {\r\n          g.children[numAccept++] = basePrimitive;\r\n        }\r\n        i0 = i1;\r\n      } else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof Arc3d) {\r\n        // subsume subsequent arcs into basePrimitive.\r\n        // always accept base primitive.\r\n        for (; ++i0 < g.children.length;) {\r\n          const nextPrimitive = g.children[i0];\r\n          if (!(nextPrimitive instanceof Arc3d))\r\n            break;\r\n          if (!CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive))\r\n            break;\r\n        }\r\n        // i0 has already advanced\r\n        g.children[numAccept++] = basePrimitive;    // which has been extended 0 or more times.\r\n      } else {\r\n        g.children[numAccept++] = basePrimitive;\r\n        i0++;\r\n      }\r\n    }\r\n    g.children.length = numAccept;\r\n  }\r\n\r\n  public override handlePath(g: Path): any { return this.handleCurveChain(g); }\r\n  public override handleLoop(g: Loop): any { return this.handleCurveChain(g); }\r\n  public override handleParityRegion(g: ParityRegion): any {\r\n    for (const child of g.children)\r\n      child.dispatchToGeometryHandler(this);\r\n  }\r\n  public override handleUnionRegion(g: UnionRegion): any {\r\n    for (const child of g.children)\r\n      child.dispatchToGeometryHandler(this);\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/Query/CurveSplitContext.d.ts

@@ -0,0 +1,16 @@
+import { CurveCollection } from "../CurveCollection";
+import { CurvePrimitive } from "../CurvePrimitive";
+/**
+ * Context for splitting curves.
+ * @internal
+ */
+export declare class CurveSplitContext {
+    private static hasInteriorDetailAIntersections;
+    private collectFragmentAndAdvanceCut;
+    /** Collect fragments from an intersections array, with the array detailA entries all referencing to curveToCut.
+     * * The `intersections` array is sorted on its detailA field.
+     */
+    private collectSinglePrimitiveFragments;
+    static cloneCurvesWithXYSplitFlags(curvesToCut: CurvePrimitive | CurveCollection | undefined, cutterCurves: CurveCollection): CurveCollection | CurvePrimitive | undefined;
+}
+//# sourceMappingURL=CurveSplitContext.d.ts.map

package/lib/esm/curve/Query/CurveSplitContext.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CurveSplitContext.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/CurveSplitContext.ts"],"names":[],"mappings":"AAUA,OAAO,EAAc,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAGjE,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAiCnD;;;GAGG;AACH,qBAAa,iBAAiB;IAE5B,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAS9C,OAAO,CAAC,4BAA4B;IAWpC;;OAEG;IACH,OAAO,CAAC,+BAA+B;WAkBzB,2BAA2B,CAAC,WAAW,EAAE,cAAc,GAAG,eAAe,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAAG,eAAe,GAAG,cAAc,GAAG,SAAS;CAoBlL"}

package/lib/esm/curve/Query/CurveSplitContext.js

@@ -0,0 +1,107 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Geometry } from "../../Geometry";
+import { CurveChain } from "../CurveCollection";
+import { CurveCurve } from "../CurveCurve";
+import { CurvePrimitive } from "../CurvePrimitive";
+import { Path } from "../Path";
+/**
+ * Data about a curve cut.
+ */
+class CutFractionDescriptor {
+    constructor(fraction, otherCurveDetail) {
+        this.fraction = fraction;
+        this.otherCurveDetail = otherCurveDetail;
+    }
+    /** Transfer data from other to this.
+     * * Optionally look at both to set `otherCurveDetail`
+     *   * `other.otherCurveDetail` wins over `this.otherCurveDetail`
+     */
+    setFrom(other, combineCutFlag) {
+        if (combineCutFlag && this.isSameFraction(other))
+            this.otherCurveDetail = other.otherCurveDetail ? other.otherCurveDetail : this.otherCurveDetail;
+        this.fraction = other.fraction;
+    }
+    /** Test if a the fractions are almost equal. */
+    isSameFraction(other) {
+        return Geometry.isSmallAngleRadians(this.fraction - other.fraction);
+    }
+    /** set from direct data */
+    set(fraction, otherCurveDetail) {
+        this.fraction = fraction;
+        this.otherCurveDetail = otherCurveDetail;
+    }
+}
+/**
+ * Context for splitting curves.
+ * @internal
+ */
+export class CurveSplitContext {
+    // return true if data has one or more non-endpoint intersections.
+    static hasInteriorDetailAIntersections(data, fractionTolerance = Geometry.smallAngleRadians) {
+        if (data.length === 0)
+            return false;
+        for (const pair of data) {
+            if (pair.detailA.fraction > fractionTolerance || pair.detailA.fraction < 1 - fractionTolerance)
+                return true;
+        }
+        return false;
+    }
+    collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, dest) {
+        if (!cutA.isSameFraction(cutB)) {
+            const fragment = curveToCut.clonePartialCurve(cutA.fraction, cutB.fraction);
+            if (fragment !== undefined) {
+                fragment.startCut = cutA.otherCurveDetail;
+                fragment.endCut = cutB.otherCurveDetail;
+                dest.push(fragment);
+            }
+        }
+        cutA.setFrom(cutB, true);
+    }
+    /** Collect fragments from an intersections array, with the array detailA entries all referencing to curveToCut.
+     * * The `intersections` array is sorted on its detailA field.
+     */
+    collectSinglePrimitiveFragments(curveToCut, intersections, fragments) {
+        if (intersections === undefined || !CurveSplitContext.hasInteriorDetailAIntersections(intersections)) {
+            const fragment = curveToCut.clone();
+            if (fragment)
+                fragments.push(fragment);
+            return;
+        }
+        intersections.sort((pairA, pairB) => (pairA.detailA.fraction - pairB.detailA.fraction));
+        const cutA = new CutFractionDescriptor(0.0, undefined);
+        const cutB = new CutFractionDescriptor(1.0, undefined); // but those values are immediately reset before use.
+        for (const pair of intersections) {
+            cutB.set(pair.detailA.fraction, pair.detailB);
+            this.collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, fragments);
+        }
+        cutB.set(1.0, undefined);
+        this.collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, fragments);
+    }
+    static cloneCurvesWithXYSplitFlags(curvesToCut, cutterCurves) {
+        const context = new CurveSplitContext();
+        if (curvesToCut instanceof CurvePrimitive) {
+            const result = [];
+            const intersections = CurveCurve.intersectionXYPairs(curvesToCut, false, cutterCurves, false);
+            context.collectSinglePrimitiveFragments(curvesToCut, intersections, result);
+            if (result.length === 1)
+                return result[0];
+            return Path.createArray(result);
+        }
+        else if (curvesToCut instanceof CurveChain) {
+            const result = [];
+            for (const primitive of curvesToCut.children) {
+                const intersections = CurveCurve.intersectionXYPairs(primitive, false, cutterCurves, false);
+                context.collectSinglePrimitiveFragments(primitive, intersections, result);
+            }
+            return Path.createArray(result);
+        }
+        return undefined;
+    }
+}
+//# sourceMappingURL=CurveSplitContext.js.map

package/lib/esm/curve/Query/CurveSplitContext.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CurveSplitContext.js","sourceRoot":"","sources":["../../../../src/curve/Query/CurveSplitContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAmB,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE3C,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAE/B;;GAEG;AACH,MAAM,qBAAqB;IAIzB,YAAmB,QAAgB,EAAE,gBAAsC;QACzE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;IACD;;;OAGG;IACI,OAAO,CAAC,KAA4B,EAAE,cAAuB;QAClE,IAAI,cAAc,IAAI,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;YAC9C,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC;QAClG,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;IACjC,CAAC;IACD,gDAAgD;IACzC,cAAc,CAAC,KAA4B;QAChD,OAAO,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD,2BAA2B;IACpB,GAAG,CAAC,QAAgB,EAAE,gBAAsC;QACjE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IAC5B,kEAAkE;IAC1D,MAAM,CAAC,+BAA+B,CAAC,IAA+B,EAAE,oBAA4B,QAAQ,CAAC,iBAAiB;QACpI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO,KAAK,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;YACvB,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,iBAAiB,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,GAAG,iBAAiB;gBAC5F,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACO,4BAA4B,CAAC,UAA0B,EAAE,IAA2B,EAAE,IAA2B,EAAE,IAAsB;QAC/I,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE;YAC9B,MAAM,QAAQ,GAAG,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5E,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC;gBAC1C,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACrB;SACF;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD;;OAEG;IACK,+BAA+B,CAAC,UAA0B,EAAE,aAAoD,EAAE,SAA2B;QAEnJ,IAAI,aAAa,KAAK,SAAS,IAAI,CAAC,iBAAiB,CAAC,+BAA+B,CAAC,aAAa,CAAC,EAAE;YACpG,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;YACpC,IAAI,QAAQ;gBACV,SAAS,CAAC,IAAI,CAAC,QAA0B,CAAC,CAAC;YAC7C,OAAO;SACR;QACD,aAAa,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC1I,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,qBAAqB,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,qDAAqD;QAC7G,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE;YAChC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YAC9C,IAAI,CAAC,4BAA4B,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;SACtE;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACzB,IAAI,CAAC,4BAA4B,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACvE,CAAC;IACM,MAAM,CAAC,2BAA2B,CAAC,WAAyD,EAAE,YAA6B;QAChI,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACxC,IAAI,WAAW,YAAY,cAAc,EAAE;YACzC,MAAM,MAAM,GAAqB,EAAE,CAAC;YACpC,MAAM,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAC,WAAW,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;YAC9F,OAAO,CAAC,+BAA+B,CAAC,WAAW,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;YAC5E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;SAEjC;aAAM,IAAI,WAAW,YAAY,UAAU,EAAE;YAC5C,MAAM,MAAM,GAAqB,EAAE,CAAC;YACpC,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC,QAAQ,EAAE;gBAC5C,MAAM,aAAa,GAAG,UAAU,CAAC,mBAAmB,CAAC,SAAS,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;gBAC5F,OAAO,CAAC,+BAA+B,CAAC,SAAS,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;aAC3E;YACD,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;SACjC;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\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurveCurve } from \"../CurveCurve\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Path } from \"../Path\";\r\n\r\n/**\r\n * Data about a curve cut.\r\n */\r\nclass CutFractionDescriptor {\r\n  /** Fractional position along the curve */\r\n  public fraction: number;\r\n  public otherCurveDetail?: CurveLocationDetail;\r\n  public constructor(fraction: number, otherCurveDetail?: CurveLocationDetail) {\r\n    this.fraction = fraction;\r\n    this.otherCurveDetail = otherCurveDetail;\r\n  }\r\n  /** Transfer data from other to this.\r\n   * * Optionally look at both to set `otherCurveDetail`\r\n   *   * `other.otherCurveDetail` wins over `this.otherCurveDetail`\r\n   */\r\n  public setFrom(other: CutFractionDescriptor, combineCutFlag: boolean) {\r\n    if (combineCutFlag && this.isSameFraction(other))\r\n      this.otherCurveDetail = other.otherCurveDetail ? other.otherCurveDetail : this.otherCurveDetail;\r\n    this.fraction = other.fraction;\r\n  }\r\n  /** Test if a the fractions are almost equal. */\r\n  public isSameFraction(other: CutFractionDescriptor): boolean {\r\n    return Geometry.isSmallAngleRadians(this.fraction - other.fraction);\r\n  }\r\n  /** set from direct data */\r\n  public set(fraction: number, otherCurveDetail?: CurveLocationDetail) {\r\n    this.fraction = fraction;\r\n    this.otherCurveDetail = otherCurveDetail;\r\n  }\r\n}\r\n/**\r\n * Context for splitting curves.\r\n * @internal\r\n */\r\nexport class CurveSplitContext {\r\n  // return true if data has one or more non-endpoint intersections.\r\n  private static hasInteriorDetailAIntersections(data: CurveLocationDetailPair[], fractionTolerance: number = Geometry.smallAngleRadians): boolean {\r\n    if (data.length === 0)\r\n      return false;\r\n    for (const pair of data) {\r\n      if (pair.detailA.fraction > fractionTolerance || pair.detailA.fraction < 1 - fractionTolerance)\r\n        return true;\r\n    }\r\n    return false;\r\n  }\r\n  private collectFragmentAndAdvanceCut(curveToCut: CurvePrimitive, cutA: CutFractionDescriptor, cutB: CutFractionDescriptor, dest: CurvePrimitive[]) {\r\n    if (!cutA.isSameFraction(cutB)) {\r\n      const fragment = curveToCut.clonePartialCurve(cutA.fraction, cutB.fraction);\r\n      if (fragment !== undefined) {\r\n        fragment.startCut = cutA.otherCurveDetail;\r\n        fragment.endCut = cutB.otherCurveDetail;\r\n        dest.push(fragment);\r\n      }\r\n    }\r\n    cutA.setFrom(cutB, true);\r\n  }\r\n  /** Collect fragments from an intersections array, with the array detailA entries all referencing to curveToCut.\r\n   * * The `intersections` array is sorted on its detailA field.\r\n   */\r\n  private collectSinglePrimitiveFragments(curveToCut: CurvePrimitive, intersections: CurveLocationDetailPair[] | undefined, fragments: CurvePrimitive[]) {\r\n\r\n    if (intersections === undefined || !CurveSplitContext.hasInteriorDetailAIntersections(intersections)) {\r\n      const fragment = curveToCut.clone();\r\n      if (fragment)\r\n        fragments.push(fragment as CurvePrimitive);\r\n      return;\r\n    }\r\n    intersections.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => (pairA.detailA.fraction - pairB.detailA.fraction));\r\n    const cutA = new CutFractionDescriptor(0.0, undefined);\r\n    const cutB = new CutFractionDescriptor(1.0, undefined); // but those values are immediately reset before use.\r\n    for (const pair of intersections) {\r\n      cutB.set(pair.detailA.fraction, pair.detailB);\r\n      this.collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, fragments);\r\n    }\r\n    cutB.set(1.0, undefined);\r\n    this.collectFragmentAndAdvanceCut(curveToCut, cutA, cutB, fragments);\r\n  }\r\n  public static cloneCurvesWithXYSplitFlags(curvesToCut: CurvePrimitive | CurveCollection | undefined, cutterCurves: CurveCollection): CurveCollection | CurvePrimitive | undefined {\r\n    const context = new CurveSplitContext();\r\n    if (curvesToCut instanceof CurvePrimitive) {\r\n      const result: CurvePrimitive[] = [];\r\n      const intersections = CurveCurve.intersectionXYPairs(curvesToCut, false, cutterCurves, false);\r\n      context.collectSinglePrimitiveFragments(curvesToCut, intersections, result);\r\n      if (result.length === 1)\r\n        return result[0];\r\n      return Path.createArray(result);\r\n\r\n    } else if (curvesToCut instanceof CurveChain) {\r\n      const result: CurvePrimitive[] = [];\r\n      for (const primitive of curvesToCut.children) {\r\n        const intersections = CurveCurve.intersectionXYPairs(primitive, false, cutterCurves, false);\r\n        context.collectSinglePrimitiveFragments(primitive, intersections, result);\r\n      }\r\n      return Path.createArray(result);\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/Query/CylindricalRange.d.ts

@@ -0,0 +1,46 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { RecurseToCurvesGeometryHandler } from "../../geometry3d/GeometryHandler";
+import { Vector3d } from "../../geometry3d/Point3dVector3d";
+import { Ray3d } from "../../geometry3d/Ray3d";
+import { Arc3d } from "../Arc3d";
+import { AnyCurve } from "../CurveChain";
+import { GeometryQuery } from "../GeometryQuery";
+import { LineSegment3d } from "../LineSegment3d";
+import { LineString3d } from "../LineString3d";
+/**
+ * Context for computing geometry range around an axis.
+ * * The publicly called method is `computeZRRange (ray, geometry)
+ */
+export declare class CylindricalRangeQuery extends RecurseToCurvesGeometryHandler {
+    private _perpVector;
+    private _maxDistance;
+    private _localToWorld;
+    /** capture ray and initialize evolving ranges. */
+    private constructor();
+    private _localPoint;
+    private _worldPoint;
+    private announcePoint;
+    handleLineSegment3d(segment0: LineSegment3d): void;
+    handleLineString3d(ls0: LineString3d): void;
+    handleArc3d(arc0: Arc3d): any;
+    /**
+     * Compute the largest vector perpendicular to a ray and ending on the geometry.
+     * @param geometry0 geometry to search
+     * @returns vector from ray to geometry.
+     */
+    static computeMaxVectorFromRay(ray: Ray3d, geometry: GeometryQuery): Vector3d;
+    /**
+     * Recurse through geometry.children to find linestrings.
+     * In each linestring, compute the surface normal annotation from
+     *  * the curve tangent stored in the linestring
+     *  * the axis of rotation
+     *  * a default V vector to be used when the linestring point is close to the axis.
+     * @param geometry
+     * @param axis
+     * @param defaultVectorV
+     */
+    static buildRotationalNormalsInLineStrings(geometry: AnyCurve, axis: Ray3d, defaultVectorFromAxis: Vector3d): void;
+}
+//# sourceMappingURL=CylindricalRange.d.ts.map

package/lib/esm/curve/Query/CylindricalRange.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CylindricalRange.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/CylindricalRange.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAW,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG/C;;;GAGG;AACH,qBAAa,qBAAsB,SAAQ,8BAA8B;IAEvE,OAAO,CAAC,WAAW,CAAW;IAC9B,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,aAAa,CAAY;IACjC,kDAAkD;IAClD,OAAO;IAMP,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,aAAa;IAWL,mBAAmB,CAAC,QAAQ,EAAE,aAAa;IAI3C,kBAAkB,CAAC,GAAG,EAAE,YAAY;IAOpC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAc7C;;;;OAIG;WACW,uBAAuB,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,GAAG,QAAQ;IAMpF;;;;;;;;;OASG;WACW,mCAAmC,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,qBAAqB,EAAE,QAAQ;CA8BnH"}

package/lib/esm/curve/Query/CylindricalRange.js

@@ -0,0 +1,111 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Point3d, Vector3d } from "../../geometry3d/Point3dVector3d";
+import { LineString3d } from "../LineString3d";
+import { StrokeOptions } from "../StrokeOptions";
+/**
+ * Context for computing geometry range around an axis.
+ * * The publicly called method is `computeZRRange (ray, geometry)
+ */
+export class CylindricalRangeQuery extends RecurseToCurvesGeometryHandler {
+    /** capture ray and initialize evolving ranges. */
+    constructor(ray) {
+        super();
+        this._localPoint = Point3d.create();
+        this._worldPoint = Point3d.create();
+        this._perpVector = Vector3d.createZero();
+        this._maxDistance = 0.0;
+        this._localToWorld = ray.toRigidZFrame();
+    }
+    announcePoint(xyz) {
+        this._localToWorld.multiplyInversePoint3d(xyz, this._localPoint);
+        const distance = this._localPoint.magnitudeXY();
+        if (distance >= this._maxDistance) {
+            this._maxDistance = distance;
+            this._perpVector.setFromPoint3d(this._localPoint);
+            this._perpVector.z = 0.0;
+            this._localToWorld.matrix.multiplyXY(this._localPoint.x, this._localPoint.y, this._perpVector);
+        }
+    }
+    handleLineSegment3d(segment0) {
+        this.announcePoint(segment0.startPoint(this._worldPoint));
+        this.announcePoint(segment0.endPoint(this._worldPoint));
+    }
+    handleLineString3d(ls0) {
+        for (let i = 0; i < ls0.numPoints(); i++) {
+            ls0.pointAt(i, this._worldPoint);
+            this.announcePoint(this._worldPoint);
+        }
+    }
+    handleArc3d(arc0) {
+        // humbug .. just stroke it ..
+        // exact solution is:
+        //   project the arc to the z=0 plane of the local system.
+        //   find max distance to origin.
+        const numStroke = StrokeOptions.applyAngleTol(undefined, 3, arc0.sweep.sweepRadians, 0.1);
+        const df = 1.0 / numStroke;
+        for (let i = 0; i <= numStroke; i++) {
+            arc0.fractionToPoint(i * df, this._worldPoint);
+            this.announcePoint(this._worldPoint);
+        }
+        return undefined;
+    }
+    /**
+     * Compute the largest vector perpendicular to a ray and ending on the geometry.
+     * @param geometry0 geometry to search
+     * @returns vector from ray to geometry.
+     */
+    static computeMaxVectorFromRay(ray, geometry) {
+        const accumulator = new CylindricalRangeQuery(ray);
+        geometry.dispatchToGeometryHandler(accumulator);
+        return accumulator._perpVector.clone();
+    }
+    /**
+     * Recurse through geometry.children to find linestrings.
+     * In each linestring, compute the surface normal annotation from
+     *  * the curve tangent stored in the linestring
+     *  * the axis of rotation
+     *  * a default V vector to be used when the linestring point is close to the axis.
+     * @param geometry
+     * @param axis
+     * @param defaultVectorV
+     */
+    static buildRotationalNormalsInLineStrings(geometry, axis, defaultVectorFromAxis) {
+        if (geometry instanceof LineString3d) {
+            const points = geometry.packedPoints;
+            const derivatives = geometry.packedDerivatives;
+            const normals = geometry.ensureEmptySurfaceNormals();
+            if (derivatives && normals) {
+                const vectorU = Vector3d.create();
+                const vectorV = Vector3d.create(); // v direction (forwward along sweep) for surface of rotation.
+                const xyz = Point3d.create();
+                const n = points.length;
+                for (let i = 0; i < n; i++) {
+                    points.getPoint3dAtUncheckedPointIndex(i, xyz);
+                    axis.perpendicularPartOfVectorToTarget(xyz, vectorU);
+                    if (vectorU.isAlmostZero)
+                        axis.direction.crossProduct(defaultVectorFromAxis, vectorV);
+                    else
+                        axis.direction.crossProduct(vectorU, vectorV);
+                    geometry.packedDerivatives.getVector3dAtCheckedVectorIndex(i, vectorU); // reuse vector U as curve derivative
+                    vectorU.crossProduct(vectorV, vectorV); // reuse vector V as normal!
+                    vectorV.normalizeInPlace();
+                    normals.push(vectorV);
+                }
+            }
+        }
+        else if (geometry.children) {
+            const children = geometry.children;
+            for (const child of children) {
+                this.buildRotationalNormalsInLineStrings(child, axis, defaultVectorFromAxis);
+            }
+        }
+    }
+}
+//# sourceMappingURL=CylindricalRange.js.map

package/lib/esm/curve/Query/CylindricalRange.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CylindricalRange.js","sourceRoot":"","sources":["../../../../src/curve/Query/CylindricalRange.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAClF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAOrE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD;;;GAGG;AACH,MAAM,OAAO,qBAAsB,SAAQ,8BAA8B;IAKvE,kDAAkD;IAClD,YAAoB,GAAU;QAC5B,KAAK,EAAE,CAAC;QAKF,gBAAW,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,gBAAW,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QALrC,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC;QACxB,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,aAAa,EAAG,CAAC;IAC5C,CAAC;IAGO,aAAa,CAAC,GAAY;QAChC,IAAI,CAAC,aAAa,CAAC,sBAAsB,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC;QAChD,IAAI,QAAQ,IAAI,IAAI,CAAC,YAAY,EAAE;YACjC,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClD,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC;YACzB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;SAChG;IACH,CAAC;IAEe,mBAAmB,CAAC,QAAuB;QACzD,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1D,CAAC;IACe,kBAAkB,CAAC,GAAiB;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE;YACxC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SACtC;IACH,CAAC;IAEe,WAAW,CAAC,IAAW;QACrC,8BAA8B;QAC9B,qBAAqB;QACrB,0DAA0D;QAC1D,iCAAiC;QACjC,MAAM,SAAS,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;QAC1F,MAAM,EAAE,GAAG,GAAG,GAAG,SAAS,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE;YACnC,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,uBAAuB,CAAC,GAAU,EAAE,QAAuB;QACvE,MAAM,WAAW,GAAG,IAAI,qBAAqB,CAAC,GAAG,CAAC,CAAC;QACnD,QAAQ,CAAC,yBAAyB,CAAC,WAAW,CAAC,CAAC;QAChD,OAAO,WAAW,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IACzC,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,mCAAmC,CAAC,QAAkB,EAAE,IAAW,EAAE,qBAA+B;QAChH,IAAI,QAAQ,YAAY,YAAY,EAAE;YACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC;YACrC,MAAM,WAAW,GAAG,QAAQ,CAAC,iBAAiB,CAAC;YAC/C,MAAM,OAAO,GAAG,QAAQ,CAAC,yBAAyB,EAAE,CAAC;YACrD,IAAI,WAAW,IAAI,OAAO,EAAE;gBAC1B,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAE,8DAA8D;gBAClG,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC/C,IAAI,CAAC,iCAAiC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;oBACrD,IAAI,OAAO,CAAC,YAAY;wBACtB,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,qBAAqB,EAAE,OAAO,CAAC,CAAC;;wBAE5D,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;oBAChD,QAAQ,CAAC,iBAAiB,CAAC,+BAA+B,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,qCAAqC;oBAC7G,OAAO,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAE,4BAA4B;oBACrE,OAAO,CAAC,gBAAgB,EAAE,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;iBACvB;aACF;SACF;aAAM,IAAI,QAAQ,CAAC,QAAQ,EAAE;YAC5B,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;gBAC5B,IAAI,CAAC,mCAAmC,CAAC,KAAiB,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;aAC1F;SACF;IACH,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\n\r\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { AnyCurve } from \"../CurveChain\";\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 * Context for computing geometry range around an axis.\r\n * * The publicly called method is `computeZRRange (ray, geometry)\r\n */\r\nexport class CylindricalRangeQuery extends RecurseToCurvesGeometryHandler {\r\n  // private geometry0: GeometryQuery;  <-- Never used\r\n  private _perpVector: Vector3d;\r\n  private _maxDistance: number;\r\n  private _localToWorld: Transform;\r\n  /** capture ray and initialize evolving ranges. */\r\n  private constructor(ray: Ray3d) {\r\n    super();\r\n    this._perpVector = Vector3d.createZero();\r\n    this._maxDistance = 0.0;\r\n    this._localToWorld = ray.toRigidZFrame()!;\r\n  }\r\n  private _localPoint = Point3d.create();\r\n  private _worldPoint = Point3d.create();\r\n  private announcePoint(xyz: Point3d) {\r\n    this._localToWorld.multiplyInversePoint3d(xyz, this._localPoint);\r\n    const distance = this._localPoint.magnitudeXY();\r\n    if (distance >= this._maxDistance) {\r\n      this._maxDistance = distance;\r\n      this._perpVector.setFromPoint3d(this._localPoint);\r\n      this._perpVector.z = 0.0;\r\n      this._localToWorld.matrix.multiplyXY(this._localPoint.x, this._localPoint.y, this._perpVector);\r\n    }\r\n  }\r\n\r\n  public override handleLineSegment3d(segment0: LineSegment3d) {\r\n    this.announcePoint(segment0.startPoint(this._worldPoint));\r\n    this.announcePoint(segment0.endPoint(this._worldPoint));\r\n  }\r\n  public override handleLineString3d(ls0: LineString3d) {\r\n    for (let i = 0; i < ls0.numPoints(); i++) {\r\n      ls0.pointAt(i, this._worldPoint);\r\n      this.announcePoint(this._worldPoint);\r\n    }\r\n  }\r\n\r\n  public override handleArc3d(arc0: Arc3d): any {\r\n    // humbug .. just stroke it ..\r\n    // exact solution is:\r\n    //   project the arc to the z=0 plane of the local system.\r\n    //   find max distance to origin.\r\n    const numStroke = StrokeOptions.applyAngleTol(undefined, 3, arc0.sweep.sweepRadians, 0.1);\r\n    const df = 1.0 / numStroke;\r\n    for (let i = 0; i <= numStroke; i++) {\r\n      arc0.fractionToPoint(i * df, this._worldPoint);\r\n      this.announcePoint(this._worldPoint);\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Compute the largest vector perpendicular to a ray and ending on the geometry.\r\n   * @param geometry0 geometry to search\r\n   * @returns vector from ray to geometry.\r\n   */\r\n  public static computeMaxVectorFromRay(ray: Ray3d, geometry: GeometryQuery): Vector3d {\r\n    const accumulator = new CylindricalRangeQuery(ray);\r\n    geometry.dispatchToGeometryHandler(accumulator);\r\n    return accumulator._perpVector.clone();\r\n  }\r\n\r\n  /**\r\n   * Recurse through geometry.children to find linestrings.\r\n   * In each linestring, compute the surface normal annotation from\r\n   *  * the curve tangent stored in the linestring\r\n   *  * the axis of rotation\r\n   *  * a default V vector to be used when the linestring point is close to the axis.\r\n   * @param geometry\r\n   * @param axis\r\n   * @param defaultVectorV\r\n   */\r\n  public static buildRotationalNormalsInLineStrings(geometry: AnyCurve, axis: Ray3d, defaultVectorFromAxis: Vector3d) {\r\n    if (geometry instanceof LineString3d) {\r\n      const points = geometry.packedPoints;\r\n      const derivatives = geometry.packedDerivatives;\r\n      const normals = geometry.ensureEmptySurfaceNormals();\r\n      if (derivatives && normals) {\r\n        const vectorU = Vector3d.create();\r\n        const vectorV = Vector3d.create();  // v direction (forwward along sweep) for surface of rotation.\r\n        const xyz = Point3d.create();\r\n        const n = points.length;\r\n        for (let i = 0; i < n; i++) {\r\n          points.getPoint3dAtUncheckedPointIndex(i, xyz);\r\n          axis.perpendicularPartOfVectorToTarget(xyz, vectorU);\r\n          if (vectorU.isAlmostZero)\r\n            axis.direction.crossProduct(defaultVectorFromAxis, vectorV);\r\n          else\r\n            axis.direction.crossProduct(vectorU, vectorV);\r\n          geometry.packedDerivatives.getVector3dAtCheckedVectorIndex(i, vectorU); // reuse vector U as curve derivative\r\n          vectorU.crossProduct(vectorV, vectorV);  // reuse vector V as normal!\r\n          vectorV.normalizeInPlace();\r\n          normals.push(vectorV);\r\n        }\r\n      }\r\n    } else if (geometry.children) {\r\n      const children = geometry.children;\r\n      for (const child of children) {\r\n        this.buildRotationalNormalsInLineStrings(child as AnyCurve, axis, defaultVectorFromAxis);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/Query/InOutTests.d.ts

@@ -0,0 +1,32 @@
+import { AnyRegion } from "../CurveChain";
+import { Loop } from "../Loop";
+import { ParityRegion } from "../ParityRegion";
+import { UnionRegion } from "../UnionRegion";
+/**
+ * Context for testing containment in Loop, ParityRegion and UnionRegion.
+ * @internal
+ */
+export declare class PointInOnOutContext {
+    /**
+     * In-out test for a single loop.
+     * * Test by finding intersections with an xy line (xyz plane) in "some" direction.
+     * * Test logic gets complicated if the plane has a vertex hit.
+     * * If that happens, don't try to figure out the cases.   Just move on to another plane.
+     * * Any "on" point triggers immediate 0 return.
+     *   * (Hence if there are overlapping lines their self-canceling effect might be wrong.)
+     * @param loop
+     * @param x tested x coordinate
+     * @param y tested y coordinate
+     */
+    static testPointInOnOutLoopXY(loop: Loop, x: number, y: number): number;
+    /**
+     * strongly-typed parity region handling: XOR of all loops. (But any ON is returned as edge hit.)
+     * @param parent
+     * @param x
+     * @param y
+     */
+    static testPointInOnOutParityRegionXY(parent: ParityRegion, x: number, y: number): number;
+    static testPointInOnOutUnionRegionXY(parent: UnionRegion, x: number, y: number): number;
+    static testPointInOnOutRegionXY(parent: AnyRegion, x: number, y: number): number;
+}
+//# sourceMappingURL=InOutTests.d.ts.map

package/lib/esm/curve/Query/InOutTests.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InOutTests.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/InOutTests.ts"],"names":[],"mappings":"AAaA,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAG1C,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C;;;GAGG;AACH,qBAAa,mBAAmB;IAC9B;;;;;;;;;;OAUG;WACW,sBAAsB,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IA8C9E;;;;;OAKG;WACW,8BAA8B,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;WAalF,6BAA6B,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;WAQhF,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;CAUxF"}

package/lib/esm/curve/Query/InOutTests.js

@@ -0,0 +1,116 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Geometry } from "../../Geometry";
+import { Angle } from "../../geometry3d/Angle";
+import { Plane3dByOriginAndUnitNormal } from "../../geometry3d/Plane3dByOriginAndUnitNormal";
+import { Point3d } from "../../geometry3d/Point3dVector3d";
+import { CurveIntervalRole } from "../CurveLocationDetail";
+import { CurvePrimitive } from "../CurvePrimitive";
+import { Loop } from "../Loop";
+import { ParityRegion } from "../ParityRegion";
+import { UnionRegion } from "../UnionRegion";
+/**
+ * Context for testing containment in Loop, ParityRegion and UnionRegion.
+ * @internal
+ */
+export class PointInOnOutContext {
+    /**
+     * In-out test for a single loop.
+     * * Test by finding intersections with an xy line (xyz plane) in "some" direction.
+     * * Test logic gets complicated if the plane has a vertex hit.
+     * * If that happens, don't try to figure out the cases.   Just move on to another plane.
+     * * Any "on" point triggers immediate 0 return.
+     *   * (Hence if there are overlapping lines their self-canceling effect might be wrong.)
+     * @param loop
+     * @param x tested x coordinate
+     * @param y tested y coordinate
+     */
+    static testPointInOnOutLoopXY(loop, x, y) {
+        let plane;
+        const xy = Point3d.create(x, y);
+        for (let radians = 0.0; Math.abs(radians) < 6.0; radians = -1.2313 * (radians + 0.3212897)) {
+            plane = Plane3dByOriginAndUnitNormal.createXYAngle(x, y, Angle.createRadians(radians));
+            const normal = plane.getNormalRef();
+            const intersections = [];
+            for (const cp of loop.children) {
+                if (cp instanceof CurvePrimitive)
+                    cp.appendPlaneIntersectionPoints(plane, intersections);
+            }
+            CurvePrimitive.snapAndRestrictDetails(intersections, false, true);
+            let numLeft = 0;
+            let numRight = 0;
+            let numTricky = 0;
+            let wx, wy;
+            // Count simple crossings to left and right.
+            // Also count tricky crossings (vertex hits, onEdge)
+            // If there are any tricky ones, go around with a different plane.
+            // A intently devious tester could make every plane hit tricky things.
+            for (const intersection of intersections) {
+                if (intersection.intervalRole !== CurveIntervalRole.isolated
+                    && intersection.intervalRole !== undefined) {
+                    numTricky++;
+                }
+                wx = intersection.point.x - x;
+                wy = intersection.point.y - y;
+                if (Geometry.isSameCoordinateXY(wx, wy, 0, 0))
+                    return 0;
+                const cross = Geometry.crossProductXYXY(normal.x, normal.y, wx, wy);
+                if (xy.isAlmostEqualXY(intersection.point))
+                    return 0;
+                if (cross < 0.0)
+                    numLeft++;
+                else if (cross > 0.0)
+                    numRight++;
+            }
+            if (numTricky !== 0) // try another angle !!
+                continue;
+            const leftParity = numLeft & (0x01);
+            const rightParity = numRight & (0x01);
+            if (leftParity === rightParity)
+                return leftParity === 1 ? 1 : -1;
+        }
+        return -1;
+    }
+    /**
+     * strongly-typed parity region handling: XOR of all loops. (But any ON is returned as edge hit.)
+     * @param parent
+     * @param x
+     * @param y
+     */
+    static testPointInOnOutParityRegionXY(parent, x, y) {
+        let result = -1;
+        for (const loop of parent.children) {
+            if (loop instanceof Loop) {
+                const q = this.testPointInOnOutLoopXY(loop, x, y);
+                if (q === 0)
+                    return 0;
+                if (q > 0)
+                    result = -result;
+            }
+        }
+        return result;
+    }
+    static testPointInOnOutUnionRegionXY(parent, x, y) {
+        for (const loop of parent.children) {
+            const classify = this.testPointInOnOutRegionXY(loop, x, y);
+            if (classify >= 0)
+                return classify;
+        }
+        return -1;
+    }
+    static testPointInOnOutRegionXY(parent, x, y) {
+        if (parent instanceof Loop)
+            return this.testPointInOnOutLoopXY(parent, x, y);
+        else if (parent instanceof ParityRegion)
+            return this.testPointInOnOutParityRegionXY(parent, x, y);
+        else if (parent instanceof UnionRegion)
+            return this.testPointInOnOutUnionRegionXY(parent, x, y);
+        return -1;
+    }
+}
+//# sourceMappingURL=InOutTests.js.map

package/lib/esm/curve/Query/InOutTests.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InOutTests.js","sourceRoot":"","sources":["../../../../src/curve/Query/InOutTests.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,4BAA4B,EAAE,MAAM,+CAA+C,CAAC;AAC7F,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,iBAAiB,EAAuB,MAAM,wBAAwB,CAAC;AAChF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IAC9B;;;;;;;;;;OAUG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAU,EAAE,CAAS,EAAE,CAAS;QACnE,IAAI,KAAmC,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,KAAK,IAAI,OAAO,GAAG,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,GAAG,EAAE,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,OAAO,GAAG,SAAS,CAAC,EAAE;YAC1F,KAAK,GAAG,4BAA4B,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAE,CAAC;YACxF,MAAM,MAAM,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;YACpC,MAAM,aAAa,GAA0B,EAAE,CAAC;YAChD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC9B,IAAI,EAAE,YAAY,cAAc;oBAC9B,EAAE,CAAC,6BAA6B,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;aAC1D;YACD,cAAc,CAAC,sBAAsB,CAAC,aAAa,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAClE,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,EAAE,EAAE,EAAE,CAAC;YACX,4CAA4C;YAC5C,oDAAoD;YACpD,kEAAkE;YAClE,sEAAsE;YACtE,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;gBACxC,IAAI,YAAY,CAAC,YAAY,KAAK,iBAAiB,CAAC,QAAQ;uBACvD,YAAY,CAAC,YAAY,KAAK,SAAS,EAAE;oBAC5C,SAAS,EAAE,CAAC;iBACb;gBACD,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9B,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,QAAQ,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;oBAC3C,OAAO,CAAC,CAAC;gBACX,MAAM,KAAK,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBACpE,IAAI,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,KAAK,CAAC;oBACxC,OAAO,CAAC,CAAC;gBACX,IAAI,KAAK,GAAG,GAAG;oBACb,OAAO,EAAE,CAAC;qBACP,IAAI,KAAK,GAAG,GAAG;oBAClB,QAAQ,EAAE,CAAC;aACd;YACD,IAAI,SAAS,KAAK,CAAC,EAAE,uBAAuB;gBAC1C,SAAS;YACX,MAAM,UAAU,GAAG,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,WAAW,GAAG,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,UAAU,KAAK,WAAW;gBAC5B,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACpC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8BAA8B,CAAC,MAAoB,EAAE,CAAS,EAAE,CAAS;QACrF,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE;YAClC,IAAI,IAAI,YAAY,IAAI,EAAE;gBACxB,MAAM,CAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAClD,IAAI,CAAC,KAAK,CAAC;oBACT,OAAO,CAAC,CAAC;gBACX,IAAI,CAAC,GAAG,CAAC;oBACP,MAAM,GAAG,CAAE,MAAM,CAAC;aACrB;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,MAAM,CAAC,6BAA6B,CAAC,MAAmB,EAAE,CAAS,EAAE,CAAS;QACnF,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,QAAQ,CAAC;SACnB;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,IAAI,MAAM,YAAY,IAAI;YACxB,OAAO,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aAC9C,IAAI,MAAM,YAAY,YAAY;YACrC,OAAO,IAAI,CAAC,8BAA8B,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;aACtD,IAAI,MAAM,YAAY,WAAW;YACpC,OAAO,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;CAEF","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 { Angle } from \"../../geometry3d/Angle\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { AnyRegion } from \"../CurveChain\";\r\nimport { CurveIntervalRole, CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Loop } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { UnionRegion } from \"../UnionRegion\";\r\n\r\n/**\r\n * Context for testing containment in Loop, ParityRegion and UnionRegion.\r\n * @internal\r\n */\r\nexport class PointInOnOutContext {\r\n  /**\r\n   * In-out test for a single loop.\r\n   * * Test by finding intersections with an xy line (xyz plane) in \"some\" direction.\r\n   * * Test logic gets complicated if the plane has a vertex hit.\r\n   * * If that happens, don't try to figure out the cases.   Just move on to another plane.\r\n   * * Any \"on\" point triggers immediate 0 return.\r\n   *   * (Hence if there are overlapping lines their self-canceling effect might be wrong.)\r\n   * @param loop\r\n   * @param x tested x coordinate\r\n   * @param y tested y coordinate\r\n   */\r\n  public static testPointInOnOutLoopXY(loop: Loop, x: number, y: number): number {\r\n    let plane: Plane3dByOriginAndUnitNormal;\r\n    const xy = Point3d.create(x, y);\r\n    for (let radians = 0.0; Math.abs(radians) < 6.0; radians = -1.2313 * (radians + 0.3212897)) {\r\n      plane = Plane3dByOriginAndUnitNormal.createXYAngle(x, y, Angle.createRadians(radians))!;\r\n      const normal = plane.getNormalRef();\r\n      const intersections: CurveLocationDetail[] = [];\r\n      for (const cp of loop.children) {\r\n        if (cp instanceof CurvePrimitive)\r\n          cp.appendPlaneIntersectionPoints(plane, intersections);\r\n      }\r\n      CurvePrimitive.snapAndRestrictDetails(intersections, false, true);\r\n      let numLeft = 0;\r\n      let numRight = 0;\r\n      let numTricky = 0;\r\n      let wx, wy;\r\n      // Count simple crossings to left and right.\r\n      // Also count tricky crossings (vertex hits, onEdge)\r\n      // If there are any tricky ones, go around with a different plane.\r\n      // A intently devious tester could make every plane hit tricky things.\r\n      for (const intersection of intersections) {\r\n        if (intersection.intervalRole !== CurveIntervalRole.isolated\r\n          && intersection.intervalRole !== undefined) {\r\n          numTricky++;\r\n        }\r\n        wx = intersection.point.x - x;\r\n        wy = intersection.point.y - y;\r\n        if (Geometry.isSameCoordinateXY(wx, wy, 0, 0))\r\n          return 0;\r\n        const cross = Geometry.crossProductXYXY(normal.x, normal.y, wx, wy);\r\n        if (xy.isAlmostEqualXY(intersection.point))\r\n          return 0;\r\n        if (cross < 0.0)\r\n          numLeft++;\r\n        else if (cross > 0.0)\r\n          numRight++;\r\n      }\r\n      if (numTricky !== 0) // try another angle !!\r\n        continue;\r\n      const leftParity = numLeft & (0x01);\r\n      const rightParity = numRight & (0x01);\r\n      if (leftParity === rightParity)\r\n        return leftParity === 1 ? 1 : -1;\r\n    }\r\n    return -1;\r\n  }\r\n  /**\r\n   * strongly-typed parity region handling: XOR of all loops. (But any ON is returned as edge hit.)\r\n   * @param parent\r\n   * @param x\r\n   * @param y\r\n   */\r\n  public static testPointInOnOutParityRegionXY(parent: ParityRegion, x: number, y: number): number {\r\n    let result = -1;\r\n    for (const loop of parent.children) {\r\n      if (loop instanceof Loop) {\r\n        const q = this.testPointInOnOutLoopXY(loop, x, y);\r\n        if (q === 0)\r\n          return 0;\r\n        if (q > 0)\r\n          result = - result;\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  public static testPointInOnOutUnionRegionXY(parent: UnionRegion, x: number, y: number): number {\r\n    for (const loop of parent.children) {\r\n      const classify = this.testPointInOnOutRegionXY(loop, x, y);\r\n      if (classify >= 0)\r\n        return classify;\r\n    }\r\n    return -1;\r\n  }\r\n  public static testPointInOnOutRegionXY(parent: AnyRegion, x: number, y: number): number {\r\n    if (parent instanceof Loop)\r\n      return this.testPointInOnOutLoopXY(parent, x, y);\r\n    else if (parent instanceof ParityRegion)\r\n      return this.testPointInOnOutParityRegionXY(parent, x, y);\r\n    else if (parent instanceof UnionRegion)\r\n      return this.testPointInOnOutUnionRegionXY(parent, x, y);\r\n    return -1;\r\n  }\r\n\r\n}\r\n"]}