@itwin/core-geometry 5.1.0-dev.52 → 5.1.0-dev.53

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

@@ -34,7 +34,7 @@ class ConsolidateAdjacentCurvePrimitivesContext extends GeometryHandler_1.NullGe
         const numOriginal = children.length;
         const points = [];
         let numAccept = 0;
-        // i0 <=i < i1 is a range of child indices.
+        // 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];
@@ -92,7 +92,7 @@ class ConsolidateAdjacentCurvePrimitivesContext extends GeometryHandler_1.NullGe
                     const nextPrimitive = g.children[i0];
                     if (!(nextPrimitive instanceof Arc3d_1.Arc3d))
                         break;
-                    if (!CurveFactory_1.CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive)) // TODO: use this._options.duplicatePointTolerance
+                    if (!CurveFactory_1.CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive, false, this._options.duplicatePointTolerance))
                         break;
                 }
                 // i0 has already advanced
@@ -105,8 +105,32 @@ class ConsolidateAdjacentCurvePrimitivesContext extends GeometryHandler_1.NullGe
         }
         g.children.length = numAccept;
     }
-    handlePath(g) { return this.handleCurveChain(g); }
-    handleLoop(g) { return this.handleCurveChain(g); }
+    handlePath(g) {
+        return this.handleCurveChain(g);
+    }
+    handleLoop(g) {
+        this.handleCurveChain(g);
+        if (g.children.length > 1 && this._options.consolidateLoopSeam) {
+            const lastChild = g.children[g.children.length - 1];
+            const firstChild = g.children[0];
+            if ((lastChild instanceof LineSegment3d_1.LineSegment3d || lastChild instanceof LineString3d_1.LineString3d) && (firstChild instanceof LineSegment3d_1.LineSegment3d || firstChild instanceof LineString3d_1.LineString3d)) {
+                if (this._options.consolidateLinearGeometry && !this._options.disableLinearCompression) {
+                    const lastPoints = lastChild.points;
+                    lastPoints.pop(); // the original start point survives as an interior point in the new first primitive
+                    g.children[0] = LineString3d_1.LineString3d.createPoints([...lastPoints, ...firstChild.points]);
+                    g.children.pop();
+                }
+            }
+            else if (lastChild instanceof Arc3d_1.Arc3d && firstChild instanceof Arc3d_1.Arc3d) {
+                if (this._options.consolidateCompatibleArcs) {
+                    if (CurveFactory_1.CurveFactory.appendToArcInPlace(lastChild, firstChild, false, this._options.duplicatePointTolerance)) {
+                        g.children[0] = lastChild;
+                        g.children.pop();
+                    }
+                }
+            }
+        }
+    }
     handleParityRegion(g) {
         for (const child of g.children)
             child.dispatchToGeometryHandler(this);

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

@@ -1 +1 @@
-{"version":3,"file":"ConsolidateAdjacentPrimitivesContext.js","sourceRoot":"","sources":["../../../../src/curve/Query/ConsolidateAdjacentPrimitivesContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAC1C,sEAAuE;AAEvE,sGAA8F;AAC9F,8DAA2D;AAC3D,oCAAiC;AAEjC,kDAA+C;AAC/C,oDAAiD;AACjD,kDAA+C;AAI/C,4CAAyE;AAGzE;;;;GAIG;AACH,MAAa,yCAA0C,SAAQ,qCAAmB;IACxE,QAAQ,CAA4C;IAC5D,YAAmB,OAAmD;QACpE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,qDAAyC,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,CAAC;YACnC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,CAAC,aAAa,YAAY,6BAAa,IAAI,aAAa,YAAY,2BAAY,CAAC,EAAE,CAAC;gBACjI,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,CAAC;oBACpC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,aAAa,YAAY,6BAAa,EAAE,CAAC;wBAC3C,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC;wBACxC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACxC,CAAC;yBAAM,IAAI,aAAa,YAAY,2BAAY,EAAE,CAAC;wBACjD,MAAM,MAAM,GAAG,aAAa,CAAC,YAAY,CAAC;wBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BACvC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,CAAC;wBACzD,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBACvB,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;gBAC1C,CAAC;qBAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,wBAAwB,EAAE,CAAC;oBAClD,MAAM,aAAa,GAAG,yBAAW,CAAC,kBAAkB,CAAC,MAAM,EAAE,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,8CAA8C;oBACzI,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,2BAAY,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC,CAAC,kBAAkB;oBACzB,MAAM,iBAAiB,GAAG,yBAAW,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC;oBACxG,MAAM,iBAAiB,GAAG,yBAAW,CAAC,+BAA+B,CAAC,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;oBAC/H,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,WAAW,EAAE,CAAC;wBACnC,yGAAyG;wBACzG,4DAA0B,CAAC,2BAA2B,CAAC,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,EAAE,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;oBACzJ,CAAC;oBACD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACjC,wDAAwD;wBACxD,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,2BAAY,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtE,CAAC;yBAAM,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBAC1C,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,6BAAa,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7F,CAAC;yBAAM,CAAC;wBACN,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,2BAAY,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC;oBACzE,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,CAAC;YACV,CAAC;iBAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,aAAa,YAAY,aAAK,EAAE,CAAC;gBACrF,8CAA8C;gBAC9C,gCAAgC;gBAChC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;oBACjC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,CAAC,aAAa,YAAY,aAAK,CAAC;wBACnC,MAAM;oBACR,IAAI,CAAC,2BAAY,CAAC,kBAAkB,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,kDAAkD;wBACpH,MAAM;gBACV,CAAC;gBACD,0BAA0B;gBAC1B,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,2CAA2C;YACtF,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;gBACxC,EAAE,EAAE,CAAC;YACP,CAAC;QACH,CAAC;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;AAtFD,8FAsFC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../../Geometry\";\nimport { NullGeometryHandler } from \"../../geometry3d/GeometryHandler\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { PolylineCompressionContext } from \"../../geometry3d/PolylineCompressionByEdgeOffset\";\nimport { PolylineOps } from \"../../geometry3d/PolylineOps\";\nimport { Arc3d } from \"../Arc3d\";\nimport { CurveChain } from \"../CurveCollection\";\nimport { CurveFactory } from \"../CurveFactory\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop } from \"../Loop\";\nimport { ParityRegion } from \"../ParityRegion\";\nimport { Path } from \"../Path\";\nimport { ConsolidateAdjacentCurvePrimitivesOptions } from \"../RegionOps\";\nimport { UnionRegion } from \"../UnionRegion\";\n\n/**\n * * Implementation class for ConsolidateAdjacentCurvePrimitives.\n *\n * @internal\n */\nexport class ConsolidateAdjacentCurvePrimitivesContext extends NullGeometryHandler {\n  private _options: ConsolidateAdjacentCurvePrimitivesOptions;\n  public constructor(options?: ConsolidateAdjacentCurvePrimitivesOptions) {\n    super();\n    this._options = options ? options : new ConsolidateAdjacentCurvePrimitivesOptions();\n  }\n  /** look for adjacent compatible primitives in a path or loop. */\n  public handleCurveChain(g: CurveChain) {\n    const children = g.children;\n    const numOriginal = children.length;\n    const points: Point3d[] = [];\n    let numAccept = 0;\n    // i0 <=i < i1 is a range of child indices.\n    // numAccept is the number of children accepted (contiguously at front of children)\n    for (let i0 = 0; i0 < numOriginal;) {\n      const basePrimitive = g.children[i0];\n      if (this._options.consolidateLinearGeometry && (basePrimitive instanceof LineSegment3d || basePrimitive instanceof LineString3d)) {\n        points.length = 0;\n        let i1 = i0;\n        // on exit, i1 is beyond the block of linear primitives  . ..\n        for (; i1 < g.children.length; i1++) {\n          const nextPrimitive = g.children[i1];\n          if (nextPrimitive instanceof LineSegment3d) {\n            points.push(nextPrimitive.startPoint());\n            points.push(nextPrimitive.endPoint());\n          } else if (nextPrimitive instanceof LineString3d) {\n            const source = nextPrimitive.packedPoints;\n            for (let k = 0; k < source.length; k++) {\n              points.push(source.getPoint3dAtUncheckedPointIndex(k));\n            }\n          } else {\n            break;\n          }\n        }\n        if (points.length <= 1) {\n          g.children[numAccept++] = basePrimitive;\n        } else if (this._options.disableLinearCompression) {\n          const pointsDeduped = PolylineOps.compressShortEdges(points, Geometry.smallFloatingPoint); // remove only exact duplicate interior points\n          g.children[numAccept++] = LineString3d.createPoints(pointsDeduped);\n        } else { // compress points\n          const compressedPointsA = PolylineOps.compressShortEdges(points, this._options.duplicatePointTolerance);\n          const compressedPointsB = PolylineOps.compressByPerpendicularDistance(compressedPointsA, this._options.colinearPointTolerance);\n          if (i0 === 0 && i1 === numOriginal) {\n            // points is the entire curve, and the curve is closed.   Maybe the first and last segments are colinear.\n            PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, this._options.duplicatePointTolerance, this._options.colinearPointTolerance);\n          }\n          if (compressedPointsB.length < 2) {\n            // Collapsed to a point?  Make a single point linestring\n            g.children[numAccept++] = LineString3d.create(compressedPointsB[0]);\n          } else if (compressedPointsB.length === 2) {\n            g.children[numAccept++] = LineSegment3d.create(compressedPointsB[0], compressedPointsB[1]);\n          } else {\n            g.children[numAccept++] = LineString3d.createPoints(compressedPointsB);\n          }\n        }\n        i0 = i1;\n      } else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof Arc3d) {\n        // subsume subsequent arcs into basePrimitive.\n        // always accept base primitive.\n        for (; ++i0 < g.children.length;) {\n          const nextPrimitive = g.children[i0];\n          if (!(nextPrimitive instanceof Arc3d))\n            break;\n          if (!CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive)) // TODO: use this._options.duplicatePointTolerance\n            break;\n        }\n        // i0 has already advanced\n        g.children[numAccept++] = basePrimitive; // which has been extended 0 or more times.\n      } else {\n        g.children[numAccept++] = basePrimitive;\n        i0++;\n      }\n    }\n    g.children.length = numAccept;\n  }\n\n  public override handlePath(g: Path): any { return this.handleCurveChain(g); }\n  public override handleLoop(g: Loop): any { return this.handleCurveChain(g); }\n  public override handleParityRegion(g: ParityRegion): any {\n    for (const child of g.children)\n      child.dispatchToGeometryHandler(this);\n  }\n  public override handleUnionRegion(g: UnionRegion): any {\n    for (const child of g.children)\n      child.dispatchToGeometryHandler(this);\n  }\n}\n"]}
+{"version":3,"file":"ConsolidateAdjacentPrimitivesContext.js","sourceRoot":"","sources":["../../../../src/curve/Query/ConsolidateAdjacentPrimitivesContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAC1C,sEAAuE;AAEvE,sGAA8F;AAC9F,8DAA2D;AAC3D,oCAAiC;AAEjC,kDAA+C;AAC/C,oDAAiD;AACjD,kDAA+C;AAI/C,4CAAyE;AAGzE;;;;GAIG;AACH,MAAa,yCAA0C,SAAQ,qCAAmB;IACxE,QAAQ,CAA4C;IAC5D,YAAmB,OAAmD;QACpE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,qDAAyC,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,4CAA4C;QAC5C,mFAAmF;QACnF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,WAAW,GAAG,CAAC;YACnC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,CAAC,aAAa,YAAY,6BAAa,IAAI,aAAa,YAAY,2BAAY,CAAC,EAAE,CAAC;gBACjI,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,CAAC;oBACpC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,aAAa,YAAY,6BAAa,EAAE,CAAC;wBAC3C,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC;wBACxC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACxC,CAAC;yBAAM,IAAI,aAAa,YAAY,2BAAY,EAAE,CAAC;wBACjD,MAAM,MAAM,GAAG,aAAa,CAAC,YAAY,CAAC;wBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BACvC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,CAAC;wBACzD,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBACvB,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;gBAC1C,CAAC;qBAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,wBAAwB,EAAE,CAAC;oBAClD,MAAM,aAAa,GAAG,yBAAW,CAAC,kBAAkB,CAAC,MAAM,EAAE,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,8CAA8C;oBACzI,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,2BAAY,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC,CAAC,kBAAkB;oBACzB,MAAM,iBAAiB,GAAG,yBAAW,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CAAC,CAAC;oBACxG,MAAM,iBAAiB,GAAG,yBAAW,CAAC,+BAA+B,CAAC,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;oBAC/H,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,WAAW,EAAE,CAAC;wBACnC,yGAAyG;wBACzG,4DAA0B,CAAC,2BAA2B,CAAC,iBAAiB,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,EAAE,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;oBACzJ,CAAC;oBACD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACjC,wDAAwD;wBACxD,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,2BAAY,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtE,CAAC;yBAAM,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBAC1C,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,6BAAa,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7F,CAAC;yBAAM,CAAC;wBACN,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,2BAAY,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC;oBACzE,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,CAAC;YACV,CAAC;iBAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,aAAa,YAAY,aAAK,EAAE,CAAC;gBACrF,8CAA8C;gBAC9C,gCAAgC;gBAChC,OAAO,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;oBACjC,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACrC,IAAI,CAAC,CAAC,aAAa,YAAY,aAAK,CAAC;wBACnC,MAAM;oBACR,IAAI,CAAC,2BAAY,CAAC,kBAAkB,CAAC,aAAa,EAAE,aAAa,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CAAC;wBAC9G,MAAM;gBACV,CAAC;gBACD,0BAA0B;gBAC1B,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,2CAA2C;YACtF,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC;gBACxC,EAAE,EAAE,CAAC;YACP,CAAC;QACH,CAAC;QACD,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,SAAS,CAAC;IAChC,CAAC;IAEe,UAAU,CAAC,CAAO;QAChC,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACe,UAAU,CAAC,CAAO;QAChC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,mBAAmB,EAAE,CAAC;YAC/D,MAAM,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpD,MAAM,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,CAAC,SAAS,YAAY,6BAAa,IAAI,SAAS,YAAY,2BAAY,CAAC,IAAI,CAAC,UAAU,YAAY,6BAAa,IAAI,UAAU,YAAY,2BAAY,CAAC,EAAE,CAAC;gBAC7J,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,wBAAwB,EAAE,CAAC;oBACvF,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC;oBACpC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,oFAAoF;oBACtG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,2BAAY,CAAC,YAAY,CAAC,CAAC,GAAG,UAAU,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;oBACjF,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;gBACnB,CAAC;YACH,CAAC;iBAAM,IAAI,SAAS,YAAY,aAAK,IAAI,UAAU,YAAY,aAAK,EAAE,CAAC;gBACrE,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,EAAE,CAAC;oBAC5C,IAAI,2BAAY,CAAC,kBAAkB,CAAC,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,uBAAuB,CAAC,EAAE,CAAC;wBACzG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;wBAC1B,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;oBACnB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACe,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;AA7GD,8FA6GC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../../Geometry\";\nimport { NullGeometryHandler } from \"../../geometry3d/GeometryHandler\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { PolylineCompressionContext } from \"../../geometry3d/PolylineCompressionByEdgeOffset\";\nimport { PolylineOps } from \"../../geometry3d/PolylineOps\";\nimport { Arc3d } from \"../Arc3d\";\nimport { CurveChain } from \"../CurveCollection\";\nimport { CurveFactory } from \"../CurveFactory\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop } from \"../Loop\";\nimport { ParityRegion } from \"../ParityRegion\";\nimport { Path } from \"../Path\";\nimport { ConsolidateAdjacentCurvePrimitivesOptions } from \"../RegionOps\";\nimport { UnionRegion } from \"../UnionRegion\";\n\n/**\n * * Implementation class for ConsolidateAdjacentCurvePrimitives.\n *\n * @internal\n */\nexport class ConsolidateAdjacentCurvePrimitivesContext extends NullGeometryHandler {\n  private _options: ConsolidateAdjacentCurvePrimitivesOptions;\n  public constructor(options?: ConsolidateAdjacentCurvePrimitivesOptions) {\n    super();\n    this._options = options ? options : new ConsolidateAdjacentCurvePrimitivesOptions();\n  }\n  /** look for adjacent compatible primitives in a path or loop. */\n  public handleCurveChain(g: CurveChain): void {\n    const children = g.children;\n    const numOriginal = children.length;\n    const points: Point3d[] = [];\n    let numAccept = 0;\n    // i0 <= i < i1 is a range of child indices.\n    // numAccept is the number of children accepted (contiguously at front of children)\n    for (let i0 = 0; i0 < numOriginal;) {\n      const basePrimitive = g.children[i0];\n      if (this._options.consolidateLinearGeometry && (basePrimitive instanceof LineSegment3d || basePrimitive instanceof LineString3d)) {\n        points.length = 0;\n        let i1 = i0;\n        // on exit, i1 is beyond the block of linear primitives  . ..\n        for (; i1 < g.children.length; i1++) {\n          const nextPrimitive = g.children[i1];\n          if (nextPrimitive instanceof LineSegment3d) {\n            points.push(nextPrimitive.startPoint());\n            points.push(nextPrimitive.endPoint());\n          } else if (nextPrimitive instanceof LineString3d) {\n            const source = nextPrimitive.packedPoints;\n            for (let k = 0; k < source.length; k++) {\n              points.push(source.getPoint3dAtUncheckedPointIndex(k));\n            }\n          } else {\n            break;\n          }\n        }\n        if (points.length <= 1) {\n          g.children[numAccept++] = basePrimitive;\n        } else if (this._options.disableLinearCompression) {\n          const pointsDeduped = PolylineOps.compressShortEdges(points, Geometry.smallFloatingPoint); // remove only exact duplicate interior points\n          g.children[numAccept++] = LineString3d.createPoints(pointsDeduped);\n        } else { // compress points\n          const compressedPointsA = PolylineOps.compressShortEdges(points, this._options.duplicatePointTolerance);\n          const compressedPointsB = PolylineOps.compressByPerpendicularDistance(compressedPointsA, this._options.colinearPointTolerance);\n          if (i0 === 0 && i1 === numOriginal) {\n            // points is the entire curve, and the curve is closed.   Maybe the first and last segments are colinear.\n            PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, this._options.duplicatePointTolerance, this._options.colinearPointTolerance);\n          }\n          if (compressedPointsB.length < 2) {\n            // Collapsed to a point?  Make a single point linestring\n            g.children[numAccept++] = LineString3d.create(compressedPointsB[0]);\n          } else if (compressedPointsB.length === 2) {\n            g.children[numAccept++] = LineSegment3d.create(compressedPointsB[0], compressedPointsB[1]);\n          } else {\n            g.children[numAccept++] = LineString3d.createPoints(compressedPointsB);\n          }\n        }\n        i0 = i1;\n      } else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof Arc3d) {\n        // subsume subsequent arcs into basePrimitive.\n        // always accept base primitive.\n        for (; ++i0 < g.children.length;) {\n          const nextPrimitive = g.children[i0];\n          if (!(nextPrimitive instanceof Arc3d))\n            break;\n          if (!CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive, false, this._options.duplicatePointTolerance))\n            break;\n        }\n        // i0 has already advanced\n        g.children[numAccept++] = basePrimitive; // which has been extended 0 or more times.\n      } else {\n        g.children[numAccept++] = basePrimitive;\n        i0++;\n      }\n    }\n    g.children.length = numAccept;\n  }\n\n  public override handlePath(g: Path): any {\n    return this.handleCurveChain(g);\n  }\n  public override handleLoop(g: Loop): any {\n    this.handleCurveChain(g);\n    if (g.children.length > 1 && this._options.consolidateLoopSeam) {\n      const lastChild = g.children[g.children.length - 1];\n      const firstChild = g.children[0];\n      if ((lastChild instanceof LineSegment3d || lastChild instanceof LineString3d) && (firstChild instanceof LineSegment3d || firstChild instanceof LineString3d)) {\n        if (this._options.consolidateLinearGeometry && !this._options.disableLinearCompression) {\n          const lastPoints = lastChild.points;\n          lastPoints.pop(); // the original start point survives as an interior point in the new first primitive\n          g.children[0] = LineString3d.createPoints([...lastPoints, ...firstChild.points]);\n          g.children.pop();\n        }\n      } else if (lastChild instanceof Arc3d && firstChild instanceof Arc3d) {\n        if (this._options.consolidateCompatibleArcs) {\n          if (CurveFactory.appendToArcInPlace(lastChild, firstChild, false, this._options.duplicatePointTolerance)) {\n            g.children[0] = lastChild;\n            g.children.pop();\n          }\n        }\n      }\n    }\n  }\n  public override handleParityRegion(g: ParityRegion): any {\n    for (const child of g.children)\n      child.dispatchToGeometryHandler(this);\n  }\n  public override handleUnionRegion(g: UnionRegion): any {\n    for (const child of g.children)\n      child.dispatchToGeometryHandler(this);\n  }\n}\n"]}

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts

@@ -1,7 +1,8 @@
-import { HalfEdge, HalfEdgeGraph } from "../../topology/Graph";
+import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "../../topology/Graph";
 import { CurveLocationDetailPair } from "../CurveLocationDetail";
 import { CurvePrimitive } from "../CurvePrimitive";
 import { Loop, SignedLoops } from "../Loop";
+import { ParityRegion } from "../ParityRegion";
 /**
  * @internal
  */
@@ -31,9 +32,30 @@ export declare class PlanarSubdivision {
      * @returns the area (forced to zero if within tolerance)
      */
     static collectSignedLoop(loop: Loop, outLoops: SignedLoops, zeroAreaTolerance?: number, isSliverFace?: boolean): number;
-    static createLoopInFace(faceSeed: HalfEdge, announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void): Loop;
+    /** Extract geometric info from a topological edge. */
+    private static extractGeometryFromEdge;
+    /** Create the geometry for a topological edge. */
+    private static createCurveInEdge;
+    /**
+     * Create a [[Loop]] for the given face or super face.
+     * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).
+     * @param announce optional callback invoked on each edge/curve of the face/Loop.
+     * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).
+     * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
+     */
+    static createLoopInFace(face: HalfEdge | HalfEdge[], announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void, compress?: boolean): Loop | undefined;
+    /**
+     * Create a [[Loop]] or [[ParityRegion]] for the given face.
+     * * A ParityRegion is created for a split-washer type face by removing bridge edges.
+     * @param face a node in the face loop.
+     * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).
+     * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).
+     */
+    static createLoopOrParityRegionInFace(face: HalfEdge, bridgeMask?: HalfEdgeMask, visitMask?: HalfEdgeMask): Loop | ParityRegion | undefined;
+    /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */
     private static isNullFace;
-    private static nonNullEdgeMate;
+    /** Look across edge mates (possibly several) for a non-null mate face. */
+    private static getNonNullEdgeMate;
     static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance?: number): SignedLoops[];
 }
 //# sourceMappingURL=PlanarSubdivision.d.ts.map

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAI/D,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAGnD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAwEhE;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;OAGG;WACW,qBAAqB,CACjC,UAAU,EAAE,cAAc,EAAE,EAC5B,QAAQ,EAAE,uBAAuB,EAAE,EACnC,cAAc,GAAE,MAAqC,GACpD,aAAa;IA0ChB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IAsB1B;;;;;;OAMG;WACW,iBAAiB,CAC7B,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,GAAE,MAAgB,EAAE,YAAY,CAAC,EAAE,OAAO,GAC7F,MAAM;WAeK,gBAAgB,CAC5B,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,GACvF,IAAI;IAsBP,OAAO,CAAC,MAAM,CAAC,UAAU;IAYzB,OAAO,CAAC,MAAM,CAAC,eAAe;WAWhB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,iBAAiB,GAAE,MAAgB,GAAG,WAAW,EAAE;CAkC7H"}
+{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAI7E,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAInD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAyE/C;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;OAGG;WACW,qBAAqB,CACjC,UAAU,EAAE,cAAc,EAAE,EAC5B,QAAQ,EAAE,uBAAuB,EAAE,EACnC,cAAc,GAAE,MAAqC,GACpD,aAAa;IA0ChB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IAwB1B;;;;;;OAMG;WACW,iBAAiB,CAC7B,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,GAAE,MAAgB,EAAE,YAAY,CAAC,EAAE,OAAO,GAC7F,MAAM;IAeT,sDAAsD;IACtD,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAUtC,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAShC;;;;;;OAMG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,QAAQ,GAAE,OAAe,GAAG,IAAI,GAAG,SAAS;IAyB9K;;;;;;OAMG;WACW,8BAA8B,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,GAAE,YAAuC,EAAE,SAAS,GAAE,YAAmC,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAiClM,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,UAAU;IAWzB,0EAA0E;IAC1E,OAAO,CAAC,MAAM,CAAC,kBAAkB;WAWnB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,iBAAiB,GAAE,MAAgB,GAAG,WAAW,EAAE;CAmC7H"}

package/lib/cjs/curve/Query/PlanarSubdivision.js

@@ -5,6 +5,7 @@ exports.PlanarSubdivision = void 0;
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
+const core_bentley_1 = require("@itwin/core-bentley");
 const Geometry_1 = require("../../Geometry");
 const Graph_1 = require("../../topology/Graph");
 const HalfEdgeGraphSearch_1 = require("../../topology/HalfEdgeGraphSearch");
@@ -14,7 +15,9 @@ const CurveLocationDetail_1 = require("../CurveLocationDetail");
 const LineSegment3d_1 = require("../LineSegment3d");
 const LineString3d_1 = require("../LineString3d");
 const Loop_1 = require("../Loop");
+const ParityRegion_1 = require("../ParityRegion");
 const RegionOps_1 = require("../RegionOps");
+const RegionOpsClassificationSweeps_1 = require("../RegionOpsClassificationSweeps");
 /** @packageDocumentation
  * @module Curve
  */
@@ -140,6 +143,8 @@ class PlanarSubdivision {
         if (point0.isAlmostEqualXY(point1, mergeTolerance))
             return { point: point0, fraction: fraction0 };
         const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
+        if (p.parent && p.parent instanceof RegionOpsClassificationSweeps_1.RegionGroupMember && p.parent.parentGroup.groupOpType === RegionOpsClassificationSweeps_1.RegionGroupOpType.NonBounding)
+            halfEdge.setMaskAroundEdge(Graph_1.HalfEdgeMask.BRIDGE_EDGE);
         const detail01 = CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
         const mate = halfEdge.edgeMate;
         halfEdge.edgeTag = detail01;
@@ -172,28 +177,102 @@ class PlanarSubdivision {
             outLoops.slivers.push(loop);
         return area;
     }
-    static createLoopInFace(faceSeed, announce) {
-        let he = faceSeed;
+    /** Extract geometric info from a topological edge. */
+    static extractGeometryFromEdge(edge) {
+        if (edge.sortData !== undefined && edge.edgeTag && edge.edgeTag instanceof CurveLocationDetail_1.CurveLocationDetail) {
+            const detail = edge.edgeTag;
+            if (detail.curve && detail.fraction1 !== undefined) {
+                const reversed = edge.sortData < 0;
+                return { detail, reversed };
+            }
+        }
+        return undefined;
+    }
+    /** Create the geometry for a topological edge. */
+    static createCurveInEdge(edge) {
+        const info = this.extractGeometryFromEdge(edge);
+        if (info) {
+            if (info.reversed)
+                return info.detail.curve.clonePartialCurve(info.detail.fraction1, info.detail.fraction);
+            return info.detail.curve.clonePartialCurve(info.detail.fraction, info.detail.fraction1);
+        }
+        return undefined;
+    }
+    /**
+     * Create a [[Loop]] for the given face or super face.
+     * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).
+     * @param announce optional callback invoked on each edge/curve of the face/Loop.
+     * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).
+     * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
+     */
+    static createLoopInFace(face, announce, compress = false) {
+        if (announce)
+            compress = false;
         const loop = Loop_1.Loop.create();
-        do {
-            const detail = he.edgeTag;
-            if (detail) {
-                let curve;
-                if (he.sortData > 0)
-                    curve = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1);
-                else
-                    curve = detail.curve.clonePartialCurve(detail.fraction1, detail.fraction);
-                if (curve) {
-                    if (announce !== undefined)
-                        announce(he, curve, loop);
-                    loop.tryAddChild(curve);
+        const addEdgeCurve = (he) => {
+            const curve = this.createCurveInEdge(he);
+            if (curve) {
+                announce?.(he, curve, loop);
+                loop.tryAddChild(curve);
+            }
+        };
+        if (Array.isArray(face))
+            face.forEach(addEdgeCurve);
+        else
+            face.announceEdgesInFace(addEdgeCurve);
+        if (compress) {
+            const options = new RegionOps_1.ConsolidateAdjacentCurvePrimitivesOptions();
+            options.consolidateLoopSeam = true;
+            RegionOps_1.RegionOps.consolidateAdjacentPrimitives(loop, options);
+        }
+        if (loop.isPhysicallyClosedCurve(undefined, true))
+            return loop;
+        (0, core_bentley_1.assert)(false, "createLoopInFace: face is not physically closed");
+        return undefined;
+    }
+    /**
+     * Create a [[Loop]] or [[ParityRegion]] for the given face.
+     * * A ParityRegion is created for a split-washer type face by removing bridge edges.
+     * @param face a node in the face loop.
+     * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).
+     * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).
+     */
+    static createLoopOrParityRegionInFace(face, bridgeMask = Graph_1.HalfEdgeMask.BRIDGE_EDGE, visitMask = Graph_1.HalfEdgeMask.VISITED) {
+        let region;
+        if (face.isSplitWasherFace(bridgeMask)) {
+            const loops = [];
+            const loopEdges = [];
+            const bridgeStack = [face.findMaskAroundFace(bridgeMask, true)];
+            const announceEdge = (he) => { he.setMask(visitMask); loopEdges.push(he); };
+            const announceBridge = (he) => { if (!he.isMaskSet(visitMask))
+                bridgeStack.push(he); };
+            face.clearMaskAroundFace(visitMask);
+            let bridge;
+            while (undefined !== (bridge = bridgeStack.pop())) {
+                bridge.setMask(visitMask);
+                const loopSeed = bridge.findMaskAroundFace(bridgeMask, false); // advance to next loop
+                if (loopSeed) {
+                    if (loopSeed.isMaskSet(visitMask))
+                        continue;
+                    loopEdges.length = 0;
+                    if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {
+                        const loop = this.createLoopInFace(loopEdges, undefined, true);
+                        if (loop) {
+                            loops.push(loop);
+                            continue;
+                        }
+                    }
                 }
             }
-            he = he.faceSuccessor;
-        } while (he !== faceSeed);
-        return loop;
+            region = RegionOps_1.RegionOps.sortOuterAndHoleLoopsXY(loops);
+            region = RegionOps_1.RegionOps.simplifyRegion(region);
+        }
+        else {
+            region = this.createLoopInFace(face, undefined, true);
+        }
+        return (region && (region instanceof Loop_1.Loop || region instanceof ParityRegion_1.ParityRegion)) ? region : undefined;
     }
-    // Return true if there are only two edges in the face loop, and their start curvatures are the same.
+    /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */
     static isNullFace(he) {
         const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);
         let faceIsBanana = false;
@@ -205,8 +284,8 @@ class PlanarSubdivision {
         }
         return faceHasTwoEdges && !faceIsBanana;
     }
-    // Look across edge mates (possibly several) for a nonnull mate face.
-    static nonNullEdgeMate(_graph, e) {
+    /** Look across edge mates (possibly several) for a non-null mate face. */
+    static getNonNullEdgeMate(_graph, e) {
         if (this.isNullFace(e))
             return undefined;
         let e1 = e.edgeMate;
@@ -228,7 +307,7 @@ class PlanarSubdivision {
                 const isNullFace = this.isNullFace(faceSeed);
                 const loop = this.createLoopInFace(faceSeed, (he, curveC, loopC) => {
                     if (!isNullFace) {
-                        const mate = this.nonNullEdgeMate(graph, he);
+                        const mate = this.getNonNullEdgeMate(graph, he);
                         if (mate !== undefined) {
                             const e = edgeMap.get(mate);
                             if (e === undefined) {
@@ -244,7 +323,8 @@ class PlanarSubdivision {
                         }
                     }
                 });
-                this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);
+                if (loop)
+                    this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);
             }
             componentAreas.edges = edges;
             result.push(componentAreas);

package/lib/cjs/curve/Query/PlanarSubdivision.js.map

@@ -1 +1 @@
-{"version":3,"file":"PlanarSubdivision.js","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,6CAA0C;AAE1C,gDAA+D;AAC/D,4EAAyE;AACzE,oDAA4D;AAC5D,oCAAiC;AACjC,gEAAsF;AAEtF,oDAAiD;AACjD,kDAA+C;AAC/C,kCAAgE;AAChE,4CAAyC;AAEzC;;GAEG;AAEH,MAAM,+CAA+C;IAC5C,eAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;IAC9E,mDAAmD;IAC5C,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,qBAAqB,GAAW,CAAC,CAAC;IACnC,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACM,UAAU,CAAC,IAA6B;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IACD;;;;;OAKG;IACI,qCAAqC,CAC1C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,yBAAyB,GAAG,KAAK,CAAC;YACtC,IAAI,CAAC,YAAY,aAAK;gBACpB,yBAAyB,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;iBAC9C,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,2BAAY,CAAC,EAAE,6FAA6F;gBACnK,yBAAyB,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC;YACtF,IAAI,yBAAyB,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;oBACb,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;oBACH,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAa,iBAAiB;IAC5B;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CACjC,UAA4B,EAC5B,QAAmC,EACnC,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,yDAAyD;QACzD,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC;QAChF,KAAK,MAAM,IAAI,IAAI,QAAQ;YACzB,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,UAAU,CAAC,MAAM,GAAG,iBAAiB,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YAC/D,qEAAqE;YACrE,iBAAiB,CAAC,qCAAqC,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QACtF,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YAChE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,qEAAqE;YACrE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAsC,EAAE,UAAU,EAAE,EAAE;gBACrF,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,YAAY;oBAClC,OAAO,CAAC,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC;gBACtC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC/F,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,SAAU,EAAE,MAAM,CAAC,MAAO,CAAC,CAAC;gBACnG,OAAO;oBACL,GAAG,WAAW;oBACd,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;oBACvD,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;iBACxD,CAAC;YACJ,CAAC,EAAE,EAAE,CAAC,CAAC;YACP,0CAA0C;YAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE;gBAC9E,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAE,CAAC;gBAChD,OAAO,SAAS,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;YACpD,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,cAAc,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,oEAAoE;gBAC/I,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;YAC7G,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC;QAC3F,CAAC;QACD,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAU,CAAC,CAAC;QAClF,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,MAAM,CAAC,WAAW,CACxB,KAAoB,EACpB,CAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,CAAC;YAChD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,yCAAmB,CAAC,oCAAoC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACnG,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;QAC/B,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC;QAC5B,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;QACxB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC;QACrB,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAC/C,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;IAChD,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAC7B,IAAU,EAAE,QAAqB,EAAE,oBAA4B,OAAO,EAAE,YAAsB;QAE9F,IAAI,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,qBAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,iBAAiB;YACpC,IAAI,GAAG,GAAG,CAAC;QACZ,IAAY,CAAC,+BAA+B,GAAG,IAAI,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC;YACV,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACnC,IAAI,IAAI,GAAG,CAAC;YACf,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEtC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACM,MAAM,CAAC,gBAAgB,CAC5B,QAAkB,EAAE,QAAoE;QAExF,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,GAAG,CAAC;YACF,MAAM,MAAM,GAAG,EAAE,CAAC,OAA8B,CAAC;YACjD,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,KAAK,CAAC;gBACV,IAAI,EAAE,CAAC,QAAS,GAAG,CAAC;oBAClB,KAAK,GAAG,MAAM,CAAC,KAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;;oBAE5E,KAAK,GAAG,MAAM,CAAC,KAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,SAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC9E,IAAI,KAAK,EAAE,CAAC;oBACV,IAAI,QAAQ,KAAK,SAAS;wBACxB,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC5B,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;YACD,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;QACxB,CAAC,QAAQ,EAAE,KAAK,QAAQ,EAAE;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qGAAqG;IAC7F,MAAM,CAAC,UAAU,CAAC,EAAY;QACpC,MAAM,eAAe,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,aAAa,KAAK,EAAE,CAAC,CAAC;QAChE,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1E,IAAI,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,eAAe;gBACrD,YAAY,GAAG,IAAI,CAAC,CAAE,8EAA8E;QACxG,CAAC;QACD,OAAO,eAAe,IAAI,CAAC,YAAY,CAAC;IAC1C,CAAC;IACD,qEAAqE;IAC7D,MAAM,CAAC,eAAe,CAAC,MAAqB,EAAE,CAAW;QAC/D,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,oCAAoC,CAAC,KAAoB,EAAE,oBAA4B,OAAO;QAC1G,MAAM,CAAC,GAAG,yCAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAClG,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;QACxD,KAAK,MAAM,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,cAAc,GAAgB,EAAE,iBAAiB,EAAE,EAAE,EAAE,iBAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAClG,MAAM,KAAK,GAAyB,EAAE,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC,EAAY,EAAE,MAAsB,EAAE,KAAW,EAAE,EAAE;oBACjG,IAAI,CAAC,UAAU,EAAE,CAAC;wBAChB,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;wBAC7C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;4BACvB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;4BAC5B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gCACpB,oGAAoG;gCACpG,MAAM,EAAE,GAAG,IAAI,yBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;gCACvE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;4BACtB,CAAC;iCAAM,IAAI,CAAC,YAAY,yBAAkB,EAAE,CAAC;gCAC3C,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gCACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gCACd,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;4BACvB,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC,CAAC,CAAC;gBACH,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,iBAAiB,EAAE,UAAU,CAAC,CAAC;YAC9E,CAAC;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA7LD,8CA6LC;AAED,SAAS,SAAS,CAAC,KAAqB,EAAE,QAAgB,EAAE,OAAgB;IAC1E,MAAM,GAAG,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACzD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,kBAAkB,CAAC,IAA6B,EAAE,KAAqB;IAC9E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,OAAO,SAAS,CAAC;AACnB,CAAC;AACD,SAAS,gBAAgB,CAAC,IAA6B,EAAE,KAAqB;IAC5E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { HalfEdge, HalfEdgeGraph } from \"../../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\nimport { Arc3d } from \"../Arc3d\";\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\nimport { RegionOps } from \"../RegionOps\";\n\n/** @packageDocumentation\n * @module Curve\n */\n\nclass MapCurvePrimitiveToCurveLocationDetailPairArray {\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\n  // index assigned to this primitive (for debugging)\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\n  private _numIndexedPrimitives: number = 0;\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\n    if (primitive !== undefined) {\n      const index = this.primitiveToIndex.get(primitive);\n      if (index === undefined) {\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\n      }\n    }\n  }\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\n    if (primitive) {\n      const priorPairs = this.primitiveToPair.get(primitive);\n      this.assignPrimitiveIndex(primitive);\n      if (!priorPairs) {\n        this.primitiveToPair.set(primitive, [pair]);\n      } else {\n        priorPairs.push(pair);\n      }\n    }\n  }\n  public insertPair(pair: CurveLocationDetailPair) {\n    const primitiveA = pair.detailA.curve;\n    if (primitiveA)\n      this.insertPrimitiveToPair(primitiveA, pair);\n    const primitiveB = pair.detailB.curve;\n    if (primitiveB)\n      this.insertPrimitiveToPair(primitiveB, pair);\n  }\n  /**\n   * Split closed missing primitives in half and add new intersection pairs.\n   * * When bridge edges aren't included in the primitives array, a closed primitive with no intersections will not be\n   * added to the graph because it isn't in the `primitiveToPair` map. By splitting such a missing primitive in two, we\n   * introduce two intersections for each half, which allows the primitive to be represented in the map.\n   */\n  public splitAndAppendMissingClosedPrimitives(\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\n  ): void {\n    for (const p of primitives) {\n      let closedCurveSplitCandidate = false;\n      if (p instanceof Arc3d)\n        closedCurveSplitCandidate = p.sweep.isFullCircle;\n      else if (!(p instanceof LineSegment3d) && !(p instanceof LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.\n        closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);\n      if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {\n        const p0 = p.clonePartialCurve(0.0, 0.5);\n        const p1 = p.clonePartialCurve(0.5, 1.0);\n        if (p0 && p1) {\n          this.insertPair(CurveLocationDetailPair.createCapture(\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0),\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0),\n          ));\n          this.insertPair(CurveLocationDetailPair.createCapture(\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0),\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0),\n          ));\n        }\n      }\n    }\n  }\n}\n\n/**\n * @internal\n */\nexport class PlanarSubdivision {\n  /**\n   * Create a graph from an array of curves, and an array of the curves' precomputed intersections.\n   * Z-coordinates are ignored.\n   */\n  public static assembleHalfEdgeGraph(\n    primitives: CurvePrimitive[],\n    allPairs: CurveLocationDetailPair[],\n    mergeTolerance: number = Geometry.smallMetricDistance,\n  ): HalfEdgeGraph {\n    // map from key CurvePrimitive to CurveLocationDetailPair\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();\n    for (const pair of allPairs)\n      detailByPrimitive.insertPair(pair);\n    if (primitives.length > detailByPrimitive.primitiveToPair.size) {\n      // otherwise, these single-primitive loops are missing from the graph\n      detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance);\n    }\n    const graph = new HalfEdgeGraph();\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\n      const p = entry[0];\n      // convert each interval intersection into two isolated intersections\n      const details = entry[1].reduce((accumulator: CurveLocationDetailPair[], detailPair) => {\n        if (!detailPair.detailA.hasFraction1)\n          return [...accumulator, detailPair];\n        const detail = getDetailOnCurve(detailPair, p)!;\n        const detail0 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);\n        const detail1 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1!, detail.point1!);\n        return [\n          ...accumulator,\n          CurveLocationDetailPair.createCapture(detail0, detail0),\n          CurveLocationDetailPair.createCapture(detail1, detail1),\n        ];\n      }, []);\n      // lexical sort on p intersection fraction\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\n        const fractionA = getFractionOnCurve(pairA, p)!;\n        const fractionB = getFractionOnCurve(pairB, p)!;\n        return fractionA - fractionB;\n      });\n      let last = { point: p.startPoint(), fraction: 0.0 };\n      for (const detailPair of details) {\n        const detail = getDetailOnCurve(detailPair, p)!;\n        const detailFraction = Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later\n        last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);\n      }\n      this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);\n    }\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle!);\n    return graph;\n  }\n  /**\n   * Create a pair of mated half edges referencing an interval of a primitive.\n   * * no action if start and end points are identical.\n   * @param graph containing graph\n   * @param p the curve\n   * @param point0 start point\n   * @param fraction0 starting fraction\n   * @param point1 end point\n   * @param fraction1 end fraction\n   * @returns end point and fraction, or start point and fraction if no action\n   */\n  private static addHalfEdge(\n    graph: HalfEdgeGraph,\n    p: CurvePrimitive,\n    point0: Point3d,\n    fraction0: number,\n    point1: Point3d,\n    fraction1: number,\n    mergeTolerance: number = Geometry.smallMetricDistance,\n  ): { point: Point3d, fraction: number } {\n    if (point0.isAlmostEqualXY(point1, mergeTolerance))\n      return { point: point0, fraction: fraction0 };\n    const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);\n    const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);\n    const mate = halfEdge.edgeMate;\n    halfEdge.edgeTag = detail01;\n    halfEdge.sortData = 1.0;\n    mate.edgeTag = detail01;\n    mate.sortData = -1.0;\n    halfEdge.sortAngle = sortAngle(p, fraction0, false);\n    mate.sortAngle = sortAngle(p, fraction1, true);\n    return { point: point1, fraction: fraction1 };\n  }\n  /**\n   * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,\n   * or sliver loops.\n   * @param zeroAreaTolerance absolute area tolerance for sliver face detection\n   * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area\n   * @returns the area (forced to zero if within tolerance)\n   */\n  public static collectSignedLoop(\n    loop: Loop, outLoops: SignedLoops, zeroAreaTolerance: number = 1.0e-10, isSliverFace?: boolean,\n  ): number {\n    let area = isSliverFace ? 0.0 : RegionOps.computeXYArea(loop);\n    if (area === undefined)\n      area = 0;\n    if (Math.abs(area) < zeroAreaTolerance)\n      area = 0.0;\n    (loop as any).computedAreaInPlanarSubdivision = area;\n    if (area > 0)\n      outLoops.positiveAreaLoops.push(loop);\n    else if (area < 0)\n      outLoops.negativeAreaLoops.push(loop);\n    else\n      outLoops.slivers.push(loop);\n    return area;\n  }\n  public static createLoopInFace(\n    faceSeed: HalfEdge, announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void,\n  ): Loop {\n    let he = faceSeed;\n    const loop = Loop.create();\n    do {\n      const detail = he.edgeTag as CurveLocationDetail;\n      if (detail) {\n        let curve;\n        if (he.sortData! > 0)\n          curve = detail.curve!.clonePartialCurve(detail.fraction, detail.fraction1!);\n        else\n          curve = detail.curve!.clonePartialCurve(detail.fraction1!, detail.fraction);\n        if (curve) {\n          if (announce !== undefined)\n            announce(he, curve, loop);\n          loop.tryAddChild(curve);\n        }\n      }\n      he = he.faceSuccessor;\n    } while (he !== faceSeed);\n    return loop;\n  }\n  // Return true if there are only two edges in the face loop, and their start curvatures are the same.\n  private static isNullFace(he: HalfEdge): boolean {\n    const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);\n    let faceIsBanana = false;\n    if (faceHasTwoEdges) {\n      const c0 = HalfEdgeGraphMerge.curvatureSortKey(he);\n      const c1 = HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);\n      if (!Geometry.isSameCoordinate(c0, c1)) // default tol!\n        faceIsBanana = true;  // heuristic: we could also check end curvatures, and/or higher derivatives...\n    }\n    return faceHasTwoEdges && !faceIsBanana;\n  }\n  // Look across edge mates (possibly several) for a nonnull mate face.\n  private static nonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\n    if (this.isNullFace(e))\n      return undefined;\n    let e1 = e.edgeMate;\n    while (this.isNullFace(e1)) {\n      e1 = e1.faceSuccessor.edgeMate;\n      if (e1 === e)\n        return undefined;\n    }\n    return e1;\n  }\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance: number = 1.0e-10): SignedLoops[] {\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\n    const result: SignedLoops[] = [];\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\n    for (const faceSeeds of q) {\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\n      const edges: LoopCurveLoopCurve[] = [];\n      for (const faceSeed of faceSeeds) {\n        const isNullFace = this.isNullFace(faceSeed);\n        const loop = this.createLoopInFace(faceSeed, (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\n          if (!isNullFace) {\n            const mate = this.nonNullEdgeMate(graph, he);\n            if (mate !== undefined) {\n              const e = edgeMap.get(mate);\n              if (e === undefined) {\n                // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\n                const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\n                edgeMap.set(he, e1);\n              } else if (e instanceof LoopCurveLoopCurve) {\n                e.setB(loopC, curveC);\n                edges.push(e);\n                edgeMap.delete(mate);\n              }\n            }\n          }\n        });\n        this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);\n      }\n      componentAreas.edges = edges;\n      result.push(componentAreas);\n      edgeMap.clear();\n    }\n    return result;\n  }\n}\n\nfunction sortAngle(curve: CurvePrimitive, fraction: number, reverse: boolean): number {\n  const ray = curve.fractionToPointAndDerivative(fraction);\n  const s = reverse ? -1.0 : 1.0;\n  return Math.atan2(s * ray.direction.y, s * ray.direction.x);\n}\n\nfunction getFractionOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): number | undefined {\n  if (pair.detailA.curve === curve)\n    return pair.detailA.fraction;\n  if (pair.detailB.curve === curve)\n    return pair.detailB.fraction;\n  return undefined;\n}\nfunction getDetailOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail | undefined {\n  if (pair.detailA.curve === curve)\n    return pair.detailA;\n  if (pair.detailB.curve === curve)\n    return pair.detailB;\n  return undefined;\n}\n"]}
+{"version":3,"file":"PlanarSubdivision.js","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,sDAA6C;AAC7C,6CAA0C;AAE1C,gDAA6E;AAC7E,4EAAyE;AACzE,oDAA4D;AAC5D,oCAAiC;AACjC,gEAAsF;AAGtF,oDAAiD;AACjD,kDAA+C;AAC/C,kCAAgE;AAChE,kDAA+C;AAC/C,4CAAoF;AACpF,oFAAwF;AAExF;;GAEG;AAEH,MAAM,+CAA+C;IAC5C,eAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;IAC9E,mDAAmD;IAC5C,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,qBAAqB,GAAW,CAAC,CAAC;IACnC,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACM,UAAU,CAAC,IAA6B;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IACD;;;;;OAKG;IACI,qCAAqC,CAC1C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,yBAAyB,GAAG,KAAK,CAAC;YACtC,IAAI,CAAC,YAAY,aAAK;gBACpB,yBAAyB,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;iBAC9C,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,2BAAY,CAAC,EAAE,6FAA6F;gBACnK,yBAAyB,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC;YACtF,IAAI,yBAAyB,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;oBACb,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;oBACH,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAa,iBAAiB;IAC5B;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CACjC,UAA4B,EAC5B,QAAmC,EACnC,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,yDAAyD;QACzD,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC;QAChF,KAAK,MAAM,IAAI,IAAI,QAAQ;YACzB,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,UAAU,CAAC,MAAM,GAAG,iBAAiB,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YAC/D,qEAAqE;YACrE,iBAAiB,CAAC,qCAAqC,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QACtF,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YAChE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,qEAAqE;YACrE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAsC,EAAE,UAAU,EAAE,EAAE;gBACrF,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,YAAY;oBAClC,OAAO,CAAC,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC;gBACtC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC/F,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,SAAU,EAAE,MAAM,CAAC,MAAO,CAAC,CAAC;gBACnG,OAAO;oBACL,GAAG,WAAW;oBACd,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;oBACvD,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;iBACxD,CAAC;YACJ,CAAC,EAAE,EAAE,CAAC,CAAC;YACP,0CAA0C;YAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE;gBAC9E,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAE,CAAC;gBAChD,OAAO,SAAS,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;YACpD,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,cAAc,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,oEAAoE;gBAC/I,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;YAC7G,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC;QAC3F,CAAC;QACD,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAU,CAAC,CAAC;QAClF,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,MAAM,CAAC,WAAW,CACxB,KAAoB,EACpB,CAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,CAAC;YAChD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,YAAY,iDAAiB,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iDAAiB,CAAC,WAAW;YACzH,QAAQ,CAAC,iBAAiB,CAAC,oBAAY,CAAC,WAAW,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,yCAAmB,CAAC,oCAAoC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACnG,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;QAC/B,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC;QAC5B,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;QACxB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC;QACrB,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAC/C,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;IAChD,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAC7B,IAAU,EAAE,QAAqB,EAAE,oBAA4B,OAAO,EAAE,YAAsB;QAE9F,IAAI,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,qBAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,iBAAiB;YACpC,IAAI,GAAG,GAAG,CAAC;QACZ,IAAY,CAAC,+BAA+B,GAAG,IAAI,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC;YACV,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACnC,IAAI,IAAI,GAAG,CAAC;YACf,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEtC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sDAAsD;IAC9C,MAAM,CAAC,uBAAuB,CAAC,IAAc;QACnD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,YAAY,yCAAmB,EAAE,CAAC;YAC/F,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;YAC5B,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;gBACnC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kDAAkD;IAC1C,MAAM,CAAC,iBAAiB,CAAC,IAAc;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,IAAI,CAAC,QAAQ;gBACf,OAAO,IAAI,CAAC,MAAM,CAAC,KAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,SAAU,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC5F,OAAO,IAAI,CAAC,MAAM,CAAC,KAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,SAAU,CAAC,CAAC;QAC5F,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAA2B,EAAE,QAAoE,EAAE,WAAoB,KAAK;QACzJ,IAAI,QAAQ;YACV,QAAQ,GAAG,KAAK,CAAC;QACnB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,CAAC,EAAY,EAAQ,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;YACzC,IAAI,KAAK,EAAE,CAAC;gBACV,QAAQ,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC5B,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC,CAAC;QACF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;;YAE3B,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,IAAI,qDAAyC,EAAE,CAAC;YAChE,OAAO,CAAC,mBAAmB,GAAG,IAAI,CAAC;YACnC,qBAAS,CAAC,6BAA6B,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAC;YAC/C,OAAO,IAAI,CAAC;QACd,IAAA,qBAAM,EAAC,KAAK,EAAE,iDAAiD,CAAC,CAAC;QACjE,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,aAA2B,oBAAY,CAAC,WAAW,EAAE,YAA0B,oBAAY,CAAC,OAAO;QAC9J,IAAI,MAA6B,CAAC;QAClC,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,CAAC;YACvC,MAAM,KAAK,GAAW,EAAE,CAAC;YACzB,MAAM,SAAS,GAAe,EAAE,CAAC;YACjC,MAAM,WAAW,GAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,IAAI,CAAE,CAAC,CAAC;YAC7E,MAAM,YAAY,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,cAAc,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC;gBAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,MAA4B,CAAC;YACjC,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,QAAQ,GAAG,MAAM,CAAC,kBAAkB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,uBAAuB;gBACtF,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;wBAC/B,SAAS;oBACX,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;oBACrB,IAAI,QAAQ,CAAC,wBAAwB,CAAC,UAAU,EAAE,YAAY,EAAE,cAAc,CAAC,EAAE,CAAC;wBAChF,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;wBAC/D,IAAI,IAAI,EAAE,CAAC;4BACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACjB,SAAS;wBACX,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM,GAAG,qBAAS,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,qBAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,CAAC,MAAM,IAAI,CAAC,MAAM,YAAY,WAAI,IAAI,MAAM,YAAY,2BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD,yGAAyG;IACjG,MAAM,CAAC,UAAU,CAAC,EAAY;QACpC,MAAM,eAAe,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,aAAa,KAAK,EAAE,CAAC,CAAC;QAChE,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1E,IAAI,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,eAAe;gBACrD,YAAY,GAAG,IAAI,CAAC,CAAE,8EAA8E;QACxG,CAAC;QACD,OAAO,eAAe,IAAI,CAAC,YAAY,CAAC;IAC1C,CAAC;IACD,0EAA0E;IAClE,MAAM,CAAC,kBAAkB,CAAC,MAAqB,EAAE,CAAW;QAClE,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,oCAAoC,CAAC,KAAoB,EAAE,oBAA4B,OAAO;QAC1G,MAAM,CAAC,GAAG,yCAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAClG,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;QACxD,KAAK,MAAM,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,cAAc,GAAgB,EAAE,iBAAiB,EAAE,EAAE,EAAE,iBAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAClG,MAAM,KAAK,GAAyB,EAAE,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC,EAAY,EAAE,MAAsB,EAAE,KAAW,EAAE,EAAE;oBACjG,IAAI,CAAC,UAAU,EAAE,CAAC;wBAChB,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;wBAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;4BACvB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;4BAC5B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gCACpB,oGAAoG;gCACpG,MAAM,EAAE,GAAG,IAAI,yBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;gCACvE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;4BACtB,CAAC;iCAAM,IAAI,CAAC,YAAY,yBAAkB,EAAE,CAAC;gCAC3C,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gCACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gCACd,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;4BACvB,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC,CAAC,CAAC;gBACH,IAAI,IAAI;oBACN,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,iBAAiB,EAAE,UAAU,CAAC,CAAC;YAChF,CAAC;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAtQD,8CAsQC;AAED,SAAS,SAAS,CAAC,KAAqB,EAAE,QAAgB,EAAE,OAAgB;IAC1E,MAAM,GAAG,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACzD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,kBAAkB,CAAC,IAA6B,EAAE,KAAqB;IAC9E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,OAAO,SAAS,CAAC;AACnB,CAAC;AACD,SAAS,gBAAgB,CAAC,IAA6B,EAAE,KAAqB;IAC5E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\nimport { assert } from \"@itwin/core-bentley\";\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\nimport { Arc3d } from \"../Arc3d\";\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { AnyRegion } from \"../CurveTypes\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\nimport { ParityRegion } from \"../ParityRegion\";\nimport { ConsolidateAdjacentCurvePrimitivesOptions, RegionOps } from \"../RegionOps\";\nimport { RegionGroupMember, RegionGroupOpType } from \"../RegionOpsClassificationSweeps\";\n\n/** @packageDocumentation\n * @module Curve\n */\n\nclass MapCurvePrimitiveToCurveLocationDetailPairArray {\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\n  // index assigned to this primitive (for debugging)\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\n  private _numIndexedPrimitives: number = 0;\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\n    if (primitive !== undefined) {\n      const index = this.primitiveToIndex.get(primitive);\n      if (index === undefined) {\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\n      }\n    }\n  }\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\n    if (primitive) {\n      const priorPairs = this.primitiveToPair.get(primitive);\n      this.assignPrimitiveIndex(primitive);\n      if (!priorPairs) {\n        this.primitiveToPair.set(primitive, [pair]);\n      } else {\n        priorPairs.push(pair);\n      }\n    }\n  }\n  public insertPair(pair: CurveLocationDetailPair) {\n    const primitiveA = pair.detailA.curve;\n    if (primitiveA)\n      this.insertPrimitiveToPair(primitiveA, pair);\n    const primitiveB = pair.detailB.curve;\n    if (primitiveB)\n      this.insertPrimitiveToPair(primitiveB, pair);\n  }\n  /**\n   * Split closed missing primitives in half and add new intersection pairs.\n   * * When bridge edges aren't included in the primitives array, a closed primitive with no intersections will not be\n   * added to the graph because it isn't in the `primitiveToPair` map. By splitting such a missing primitive in two, we\n   * introduce two intersections for each half, which allows the primitive to be represented in the map.\n   */\n  public splitAndAppendMissingClosedPrimitives(\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\n  ): void {\n    for (const p of primitives) {\n      let closedCurveSplitCandidate = false;\n      if (p instanceof Arc3d)\n        closedCurveSplitCandidate = p.sweep.isFullCircle;\n      else if (!(p instanceof LineSegment3d) && !(p instanceof LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.\n        closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);\n      if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {\n        const p0 = p.clonePartialCurve(0.0, 0.5);\n        const p1 = p.clonePartialCurve(0.5, 1.0);\n        if (p0 && p1) {\n          this.insertPair(CurveLocationDetailPair.createCapture(\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0),\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0),\n          ));\n          this.insertPair(CurveLocationDetailPair.createCapture(\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0),\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0),\n          ));\n        }\n      }\n    }\n  }\n}\n\n/**\n * @internal\n */\nexport class PlanarSubdivision {\n  /**\n   * Create a graph from an array of curves, and an array of the curves' precomputed intersections.\n   * Z-coordinates are ignored.\n   */\n  public static assembleHalfEdgeGraph(\n    primitives: CurvePrimitive[],\n    allPairs: CurveLocationDetailPair[],\n    mergeTolerance: number = Geometry.smallMetricDistance,\n  ): HalfEdgeGraph {\n    // map from key CurvePrimitive to CurveLocationDetailPair\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();\n    for (const pair of allPairs)\n      detailByPrimitive.insertPair(pair);\n    if (primitives.length > detailByPrimitive.primitiveToPair.size) {\n      // otherwise, these single-primitive loops are missing from the graph\n      detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance);\n    }\n    const graph = new HalfEdgeGraph();\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\n      const p = entry[0];\n      // convert each interval intersection into two isolated intersections\n      const details = entry[1].reduce((accumulator: CurveLocationDetailPair[], detailPair) => {\n        if (!detailPair.detailA.hasFraction1)\n          return [...accumulator, detailPair];\n        const detail = getDetailOnCurve(detailPair, p)!;\n        const detail0 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);\n        const detail1 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1!, detail.point1!);\n        return [\n          ...accumulator,\n          CurveLocationDetailPair.createCapture(detail0, detail0),\n          CurveLocationDetailPair.createCapture(detail1, detail1),\n        ];\n      }, []);\n      // lexical sort on p intersection fraction\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\n        const fractionA = getFractionOnCurve(pairA, p)!;\n        const fractionB = getFractionOnCurve(pairB, p)!;\n        return fractionA - fractionB;\n      });\n      let last = { point: p.startPoint(), fraction: 0.0 };\n      for (const detailPair of details) {\n        const detail = getDetailOnCurve(detailPair, p)!;\n        const detailFraction = Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later\n        last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);\n      }\n      this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);\n    }\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle!);\n    return graph;\n  }\n  /**\n   * Create a pair of mated half edges referencing an interval of a primitive.\n   * * no action if start and end points are identical.\n   * @param graph containing graph\n   * @param p the curve\n   * @param point0 start point\n   * @param fraction0 starting fraction\n   * @param point1 end point\n   * @param fraction1 end fraction\n   * @returns end point and fraction, or start point and fraction if no action\n   */\n  private static addHalfEdge(\n    graph: HalfEdgeGraph,\n    p: CurvePrimitive,\n    point0: Point3d,\n    fraction0: number,\n    point1: Point3d,\n    fraction1: number,\n    mergeTolerance: number = Geometry.smallMetricDistance,\n  ): { point: Point3d, fraction: number } {\n    if (point0.isAlmostEqualXY(point1, mergeTolerance))\n      return { point: point0, fraction: fraction0 };\n    const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);\n    if (p.parent && p.parent instanceof RegionGroupMember && p.parent.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\n      halfEdge.setMaskAroundEdge(HalfEdgeMask.BRIDGE_EDGE);\n    const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);\n    const mate = halfEdge.edgeMate;\n    halfEdge.edgeTag = detail01;\n    halfEdge.sortData = 1.0;\n    mate.edgeTag = detail01;\n    mate.sortData = -1.0;\n    halfEdge.sortAngle = sortAngle(p, fraction0, false);\n    mate.sortAngle = sortAngle(p, fraction1, true);\n    return { point: point1, fraction: fraction1 };\n  }\n  /**\n   * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,\n   * or sliver loops.\n   * @param zeroAreaTolerance absolute area tolerance for sliver face detection\n   * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area\n   * @returns the area (forced to zero if within tolerance)\n   */\n  public static collectSignedLoop(\n    loop: Loop, outLoops: SignedLoops, zeroAreaTolerance: number = 1.0e-10, isSliverFace?: boolean,\n  ): number {\n    let area = isSliverFace ? 0.0 : RegionOps.computeXYArea(loop);\n    if (area === undefined)\n      area = 0;\n    if (Math.abs(area) < zeroAreaTolerance)\n      area = 0.0;\n    (loop as any).computedAreaInPlanarSubdivision = area;\n    if (area > 0)\n      outLoops.positiveAreaLoops.push(loop);\n    else if (area < 0)\n      outLoops.negativeAreaLoops.push(loop);\n    else\n      outLoops.slivers.push(loop);\n    return area;\n  }\n  /** Extract geometric info from a topological edge. */\n  private static extractGeometryFromEdge(edge: HalfEdge): { detail: CurveLocationDetail, reversed: boolean } | undefined {\n    if (edge.sortData !== undefined && edge.edgeTag && edge.edgeTag instanceof CurveLocationDetail) {\n      const detail = edge.edgeTag;\n      if (detail.curve && detail.fraction1 !== undefined) {\n        const reversed = edge.sortData < 0;\n        return { detail, reversed };\n      }\n    }\n    return undefined;\n  }\n  /** Create the geometry for a topological edge. */\n  private static createCurveInEdge(edge: HalfEdge): CurvePrimitive | undefined {\n    const info = this.extractGeometryFromEdge(edge);\n    if (info) {\n      if (info.reversed)\n        return info.detail.curve!.clonePartialCurve(info.detail.fraction1!, info.detail.fraction);\n      return info.detail.curve!.clonePartialCurve(info.detail.fraction, info.detail.fraction1!);\n    }\n    return undefined;\n  }\n  /**\n   * Create a [[Loop]] for the given face or super face.\n   * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).\n   * @param announce optional callback invoked on each edge/curve of the face/Loop.\n   * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).\n   * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.\n   */\n  public static createLoopInFace(face: HalfEdge | HalfEdge[], announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void, compress: boolean = false): Loop | undefined {\n    if (announce)\n      compress = false;\n    const loop = Loop.create();\n    const addEdgeCurve = (he: HalfEdge): void => {\n      const curve = this.createCurveInEdge(he);\n      if (curve) {\n        announce?.(he, curve, loop);\n        loop.tryAddChild(curve);\n      }\n    };\n    if (Array.isArray(face))\n      face.forEach(addEdgeCurve);\n    else\n      face.announceEdgesInFace(addEdgeCurve);\n    if (compress) {\n      const options = new ConsolidateAdjacentCurvePrimitivesOptions();\n      options.consolidateLoopSeam = true;\n      RegionOps.consolidateAdjacentPrimitives(loop, options);\n    }\n    if (loop.isPhysicallyClosedCurve(undefined, true))\n      return loop;\n    assert(false, \"createLoopInFace: face is not physically closed\");\n    return undefined;\n  }\n  /**\n   * Create a [[Loop]] or [[ParityRegion]] for the given face.\n   * * A ParityRegion is created for a split-washer type face by removing bridge edges.\n   * @param face a node in the face loop.\n   * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).\n   * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).\n   */\n  public static createLoopOrParityRegionInFace(face: HalfEdge, bridgeMask: HalfEdgeMask = HalfEdgeMask.BRIDGE_EDGE, visitMask: HalfEdgeMask = HalfEdgeMask.VISITED): Loop | ParityRegion | undefined {\n    let region: AnyRegion | undefined;\n    if (face.isSplitWasherFace(bridgeMask)) {\n      const loops: Loop[] = [];\n      const loopEdges: HalfEdge[] = [];\n      const bridgeStack: HalfEdge[] = [face.findMaskAroundFace(bridgeMask, true)!];\n      const announceEdge = (he: HalfEdge) => { he.setMask(visitMask); loopEdges.push(he); };\n      const announceBridge = (he: HalfEdge) => { if (!he.isMaskSet(visitMask)) bridgeStack.push(he); };\n      face.clearMaskAroundFace(visitMask);\n      let bridge: HalfEdge | undefined;\n      while (undefined !== (bridge = bridgeStack.pop())) {\n        bridge.setMask(visitMask);\n        const loopSeed = bridge.findMaskAroundFace(bridgeMask, false); // advance to next loop\n        if (loopSeed) {\n          if (loopSeed.isMaskSet(visitMask))\n            continue;\n          loopEdges.length = 0;\n          if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {\n            const loop = this.createLoopInFace(loopEdges, undefined, true);\n            if (loop) {\n              loops.push(loop);\n              continue;\n            }\n          }\n        }\n      }\n      region = RegionOps.sortOuterAndHoleLoopsXY(loops);\n      region = RegionOps.simplifyRegion(region);\n    } else {\n      region = this.createLoopInFace(face, undefined, true);\n    }\n    return (region && (region instanceof Loop || region instanceof ParityRegion)) ? region : undefined;\n  }\n  /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */\n  private static isNullFace(he: HalfEdge): boolean {\n    const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);\n    let faceIsBanana = false;\n    if (faceHasTwoEdges) {\n      const c0 = HalfEdgeGraphMerge.curvatureSortKey(he);\n      const c1 = HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);\n      if (!Geometry.isSameCoordinate(c0, c1)) // default tol!\n        faceIsBanana = true;  // heuristic: we could also check end curvatures, and/or higher derivatives...\n    }\n    return faceHasTwoEdges && !faceIsBanana;\n  }\n  /** Look across edge mates (possibly several) for a non-null mate face. */\n  private static getNonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\n    if (this.isNullFace(e))\n      return undefined;\n    let e1 = e.edgeMate;\n    while (this.isNullFace(e1)) {\n      e1 = e1.faceSuccessor.edgeMate;\n      if (e1 === e)\n        return undefined;\n    }\n    return e1;\n  }\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance: number = 1.0e-10): SignedLoops[] {\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\n    const result: SignedLoops[] = [];\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\n    for (const faceSeeds of q) {\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\n      const edges: LoopCurveLoopCurve[] = [];\n      for (const faceSeed of faceSeeds) {\n        const isNullFace = this.isNullFace(faceSeed);\n        const loop = this.createLoopInFace(faceSeed, (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\n          if (!isNullFace) {\n            const mate = this.getNonNullEdgeMate(graph, he);\n            if (mate !== undefined) {\n              const e = edgeMap.get(mate);\n              if (e === undefined) {\n                // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\n                const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\n                edgeMap.set(he, e1);\n              } else if (e instanceof LoopCurveLoopCurve) {\n                e.setB(loopC, curveC);\n                edges.push(e);\n                edgeMap.delete(mate);\n              }\n            }\n          }\n        });\n        if (loop)\n          this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);\n      }\n      componentAreas.edges = edges;\n      result.push(componentAreas);\n      edgeMap.clear();\n    }\n    return result;\n  }\n}\n\nfunction sortAngle(curve: CurvePrimitive, fraction: number, reverse: boolean): number {\n  const ray = curve.fractionToPointAndDerivative(fraction);\n  const s = reverse ? -1.0 : 1.0;\n  return Math.atan2(s * ray.direction.y, s * ray.direction.x);\n}\n\nfunction getFractionOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): number | undefined {\n  if (pair.detailA.curve === curve)\n    return pair.detailA.fraction;\n  if (pair.detailB.curve === curve)\n    return pair.detailB.fraction;\n  return undefined;\n}\nfunction getDetailOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail | undefined {\n  if (pair.detailA.curve === curve)\n    return pair.detailA;\n  if (pair.detailB.curve === curve)\n    return pair.detailB;\n  return undefined;\n}\n"]}

package/lib/cjs/curve/Query/StrokeCountChain.d.ts

@@ -2,8 +2,8 @@
  * @module Curve
  */
 import { Range1d } from "../../geometry3d/Range";
-import { AnyCurve } from "../CurveTypes";
 import { CurveChain, CurveCollection } from "../CurveCollection";
+import { AnyCurve } from "../CurveTypes";
 import { LineString3d } from "../LineString3d";
 import { StrokeOptions } from "../StrokeOptions";
 import { StrokeCountMap } from "./StrokeCountMap";
@@ -95,6 +95,7 @@ export declare class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCoun
  * * `parent` = parent CurveCollection.
  *
  * An instance is normally created with either a `Path` or `Loop` as the parent.
+ * @internal
  */
 export declare class StrokeCountChain {
     maps: StrokeCountMap[];
@@ -106,7 +107,7 @@ export declare class StrokeCountChain {
      */
     options?: StrokeOptions;
     private constructor();
-    static createForCurveChain(chain: CurveChain, options?: StrokeOptions): StrokeCountChain;
+    static create(chain: CurveChain, options?: StrokeOptions): StrokeCountChain;
     getStrokes(): LineString3d;
     /** internal form of  */
     private static applySummed01LimitsWithinArray;
@@ -138,7 +139,7 @@ export declare class StrokeCountSection {
      * construct array of arrays of `StrokeCountMap`s
      * @param parent
      */
-    static createForParityRegionOrChain(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection;
+    static create(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection;
     /** test if all sections have the same structure. */
     static areSectionsCompatible(sections: StrokeCountSection[], enforceCounts: boolean): boolean;
     /** Within each section, sweep accumulate curveLength field, recording entry and exit sum in each map.

package/lib/cjs/curve/Query/StrokeCountChain.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"StrokeCountChain.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,8BAAsB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,OAAO;IACnG;;;;OAIG;aACa,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;aAChC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IACjE;;;;OAIG;aAEa,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAC9C;;;OAGG;IACI,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,OAAO;CAElG;AACD;;;;GAIG;AACH,qBAAa,kCAAmC,SAAQ,8BAA8B;IAC7E,KAAK,EAAE,cAAc,CAAC;;IAK7B,oDAAoD;IAC7C,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAWvC,kDAAkD;IAC3C,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IAcjD,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CACvC;AACD;;;;GAIG;AACH,qBAAa,wCAAyC,SAAQ,8BAA8B;IACnF,cAAc,EAAE,MAAM,CAAC;;IAK9B,oDAAoD;IAC7C,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAWvC,kDAAkD;IAC3C,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IAcjD,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CACvC;AACD;;;;;;GAMG;AACH,qBAAa,gBAAgB;IACpB,IAAI,EAAE,cAAc,EAAE,CAAC;IACvB,MAAM,CAAC,EAAE,eAAe,CAAC;IAChC;;;;OAIG;IACI,OAAO,CAAC,EAAE,aAAa,CAAC;IAE/B,OAAO;WAKO,mBAAmB,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,gBAAgB;IAWxF,UAAU,IAAI,YAAY;IAgBjC,wBAAwB;IACxB,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAa7C;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM;CAGxD;AAED;;;;;GAKG;AACH,qBAAa,kBAAkB;IACtB,MAAM,EAAE,gBAAgB,EAAE,CAAC;IAC3B,MAAM,CAAC,EAAE,eAAe,CAAC;IAChC,OAAO;IACP;;;OAGG;WACW,4BAA4B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,kBAAkB;IAYhH,oDAAoD;WACtC,qBAAqB,CAAC,QAAQ,EAAE,kBAAkB,EAAE,EAAE,aAAa,EAAE,OAAO,GAAG,OAAO;IAuBpG;;OAEG;WACW,wBAAwB,CAAC,QAAQ,EAAE,kBAAkB,EAAE;IAQrE,OAAO,CAAC,MAAM,CAAC,yCAAyC;IAiCxD;;;;OAIG;WACW,4CAA4C,CAAC,QAAQ,EAAE,kBAAkB,EAAE,EAAE,QAAQ,EAAE,8BAA8B,GAAG,OAAO;IAoB7I;;;;OAIG;WACW,+BAA+B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,GAAG,OAAO;IAWtF;;;;;OAKG;WACW,6BAA6B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,GAAG,OAAO;IAapF;;OAEG;IACI,UAAU,IAAI,QAAQ;IAa7B;;;;;;;;;;;OAWG;WACW,iCAAiC,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,OAAO,GAAG,OAAO;CA+CvH"}
+{"version":3,"file":"StrokeCountChain.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,8BAAsB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,OAAO;IACnG;;;;OAIG;aACa,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;aAChC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IACjE;;;;OAIG;aAEa,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAC9C;;;OAGG;IACI,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,OAAO;CAElG;AACD;;;;GAIG;AACH,qBAAa,kCAAmC,SAAQ,8BAA8B;IAC7E,KAAK,EAAE,cAAc,CAAC;;IAK7B,oDAAoD;IAC7C,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAWvC,kDAAkD;IAC3C,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IAcjD,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CACvC;AACD;;;;GAIG;AACH,qBAAa,wCAAyC,SAAQ,8BAA8B;IACnF,cAAc,EAAE,MAAM,CAAC;;IAK9B,oDAAoD;IAC7C,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAWvC,kDAAkD;IAC3C,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IAcjD,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CACvC;AACD;;;;;;;GAOG;AACH,qBAAa,gBAAgB;IACpB,IAAI,EAAE,cAAc,EAAE,CAAC;IACvB,MAAM,CAAC,EAAE,eAAe,CAAC;IAChC;;;;OAIG;IACI,OAAO,CAAC,EAAE,aAAa,CAAC;IAE/B,OAAO;WAKO,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,gBAAgB;IAW3E,UAAU,IAAI,YAAY;IAgBjC,wBAAwB;IACxB,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAa7C;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM;CAGxD;AAED;;;;;GAKG;AACH,qBAAa,kBAAkB;IACtB,MAAM,EAAE,gBAAgB,EAAE,CAAC;IAC3B,MAAM,CAAC,EAAE,eAAe,CAAC;IAChC,OAAO;IACP;;;OAGG;WACW,MAAM,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,kBAAkB;IAkB1F,oDAAoD;WACtC,qBAAqB,CAAC,QAAQ,EAAE,kBAAkB,EAAE,EAAE,aAAa,EAAE,OAAO,GAAG,OAAO;IAuBpG;;OAEG;WACW,wBAAwB,CAAC,QAAQ,EAAE,kBAAkB,EAAE;IAQrE,OAAO,CAAC,MAAM,CAAC,yCAAyC;IAiCxD;;;;OAIG;WACW,4CAA4C,CAAC,QAAQ,EAAE,kBAAkB,EAAE,EAAE,QAAQ,EAAE,8BAA8B,GAAG,OAAO;IAoB7I;;;;OAIG;WACW,+BAA+B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,GAAG,OAAO;IAWtF;;;;;OAKG;WACW,6BAA6B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,GAAG,OAAO;IAapF;;OAEG;IACI,UAAU,IAAI,QAAQ;IAa7B;;;;;;;;;;;OAWG;WACW,iCAAiC,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,OAAO,GAAG,OAAO;CA+CvH"}

package/lib/cjs/curve/Query/StrokeCountChain.js

@@ -14,6 +14,7 @@ const CurveCollection_1 = require("../CurveCollection");
 const LineString3d_1 = require("../LineString3d");
 const Loop_1 = require("../Loop");
 const ParityRegion_1 = require("../ParityRegion");
+const UnionRegion_1 = require("../UnionRegion");
 const StrokeCountMap_1 = require("./StrokeCountMap");
 // cspell:word remapa
 /**
@@ -148,6 +149,7 @@ exports.StrokeCountMapVisitorApplyMaxCurveLength = StrokeCountMapVisitorApplyMax
  * * `parent` = parent CurveCollection.
  *
  * An instance is normally created with either a `Path` or `Loop` as the parent.
+ * @internal
  */
 class StrokeCountChain {
     maps;
@@ -163,7 +165,7 @@ class StrokeCountChain {
         this.maps = [];
         this.options = options;
     }
-    static createForCurveChain(chain, options) {
+    static create(chain, options) {
         const result = new StrokeCountChain(chain, options);
         result.parent = chain;
         // A chain can only contain primitives !!!!
@@ -235,16 +237,24 @@ class StrokeCountSection {
      * construct array of arrays of `StrokeCountMap`s
      * @param parent
      */
-    static createForParityRegionOrChain(parent, options) {
+    static create(parent, options) {
         const result = new StrokeCountSection(parent);
-        if (parent instanceof ParityRegion_1.ParityRegion) {
+        const appendCurveChain = (chain) => result.chains.push(StrokeCountChain.create(chain, options));
+        const appendParityRegion = (region) => { for (const child of region.children)
+            appendCurveChain(child); };
+        if (parent instanceof UnionRegion_1.UnionRegion) {
             for (const child of parent.children) {
-                const p = StrokeCountChain.createForCurveChain(child, options);
-                result.chains.push(p);
+                if (child instanceof ParityRegion_1.ParityRegion)
+                    appendParityRegion(child);
+                else
+                    appendCurveChain(child);
             }
         }
+        else if (parent instanceof ParityRegion_1.ParityRegion) {
+            appendParityRegion(parent);
+        }
         else if (parent instanceof CurveCollection_1.CurveChain) {
-            result.chains.push(StrokeCountChain.createForCurveChain(parent, options));
+            appendCurveChain(parent);
         }
         return result;
     }
@@ -323,11 +333,12 @@ class StrokeCountSection {
         for (let chainIndex = 0; chainIndex < numChainPerSection; chainIndex++) {
             const numPrimitive = sections[0].chains[chainIndex].maps.length;
             for (let primitiveIndex = 0; primitiveIndex < numPrimitive; primitiveIndex++) {
-                if (sections[0].chains[chainIndex].maps[primitiveIndex].componentData) {
-                    const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex].componentData.length;
-                    for (let i = 0; i < numComponent; i++)
+                const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex].componentData?.length ?? 0;
+                if (numComponent > 0) {
+                    for (let i = 0; i < numComponent; i++) {
                         if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, i, callback))
                             return false;
+                    }
                 }
                 else {
                     if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, undefined, callback))