@itwin/core-geometry 4.0.0-dev.98 → 4.0.0

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

@@ -9,7 +9,10 @@ const Geometry_1 = require("../../Geometry");
 const Graph_1 = require("../../topology/Graph");
 const HalfEdgeGraphSearch_1 = require("../../topology/HalfEdgeGraphSearch");
 const Merging_1 = require("../../topology/Merging");
+const Arc3d_1 = require("../Arc3d");
 const CurveLocationDetail_1 = require("../CurveLocationDetail");
+const LineSegment3d_1 = require("../LineSegment3d");
+const LineString3d_1 = require("../LineString3d");
 const Loop_1 = require("../Loop");
 const RegionOps_1 = require("../RegionOps");
 /** @packageDocumentation
@@ -18,7 +21,7 @@ const RegionOps_1 = require("../RegionOps");
 class MapCurvePrimitiveToCurveLocationDetailPairArray {
     constructor() {
         this.primitiveToPair = new Map();
-        // index assigned to this primitive for this calculation.
+        // index assigned to this primitive (for debugging)
         this.primitiveToIndex = new Map();
         this._numIndexedPrimitives = 0;
     }
@@ -50,52 +53,61 @@ class MapCurvePrimitiveToCurveLocationDetailPairArray {
         if (primitiveB)
             this.insertPrimitiveToPair(primitiveB, pair);
     }
+    /** Split closed missing primitives in half and add new intersection pairs */
+    splitAndAppendMissingClosedPrimitives(primitives, tolerance = Geometry_1.Geometry.smallMetricDistance) {
+        for (const p of primitives) {
+            let closedCurveSplitCandidate = false;
+            if (p instanceof Arc3d_1.Arc3d)
+                closedCurveSplitCandidate = p.sweep.isFullCircle;
+            else if (!(p instanceof LineSegment3d_1.LineSegment3d) && !(p instanceof LineString3d_1.LineString3d))
+                closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);
+            if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {
+                const p0 = p.clonePartialCurve(0.0, 0.5);
+                const p1 = p.clonePartialCurve(0.5, 1.0);
+                if (p0 && p1) {
+                    this.insertPair(CurveLocationDetail_1.CurveLocationDetailPair.createCapture(CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0), CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0)));
+                    this.insertPair(CurveLocationDetail_1.CurveLocationDetailPair.createCapture(CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0), CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0)));
+                }
+            }
+        }
+    }
 }
-/*
-  function getDetailString(detail: CurveLocationDetail | undefined): string {
-    if (!detail)
-      return "{}";
-    else return tagString("primitive", this.primitiveToIndex.get(detail.curve!)) + tagString("f0", detail.fraction) + tagString("f1", detail.fraction1);
-  }
-}
-function tagString(name: string, value: number | undefined): string {
-  if (value !== undefined)
-    return "(" + name + " " + value + ")";
-  return "";
-}
-*/
 /**
  * @internal
  */
 class PlanarSubdivision {
-    /** Create a graph from an array of curves, and an array of the curves' precomputed intersections. */
-    static assembleHalfEdgeGraph(primitives, allPairs) {
+    /** Create a graph from an array of curves, and an array of the curves' precomputed intersections. Z-coordinates are ignored. */
+    static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
         const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray(); // map from key CurvePrimitive to CurveLocationDetailPair.
-        for (const p of primitives)
-            detailByPrimitive.assignPrimitiveIndex(p);
-        for (const pair of allPairs) {
+        for (const pair of allPairs)
             detailByPrimitive.insertPair(pair);
-        }
+        if (primitives.length > detailByPrimitive.primitiveToPair.size)
+            detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance); // otherwise, these single-primitive loops are missing from the graph
         const graph = new Graph_1.HalfEdgeGraph();
         for (const entry of detailByPrimitive.primitiveToPair.entries()) {
             const p = entry[0];
-            const details = entry[1];
+            // convert each interval intersection into two isolated intersections
+            const details = entry[1].reduce((accumulator, detailPair) => {
+                if (!detailPair.detailA.hasFraction1)
+                    return [...accumulator, detailPair];
+                const detail = getDetailOnCurve(detailPair, p);
+                const detail0 = CurveLocationDetail_1.CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);
+                const detail1 = CurveLocationDetail_1.CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1, detail.point1);
+                return [...accumulator, CurveLocationDetail_1.CurveLocationDetailPair.createCapture(detail0, detail0), CurveLocationDetail_1.CurveLocationDetailPair.createCapture(detail1, detail1)];
+            }, []);
+            // lexical sort on p intersection fraction
             details.sort((pairA, pairB) => {
                 const fractionA = getFractionOnCurve(pairA, p);
                 const fractionB = getFractionOnCurve(pairB, p);
-                if (fractionA === undefined || fractionB === undefined)
-                    return -1000.0;
                 return fractionA - fractionB;
             });
-            let detail0 = getDetailOnCurve(details[0], p);
-            this.addHalfEdge(graph, p, p.startPoint(), 0.0, detail0.point, detail0.fraction);
-            for (let i = 1; i < details.length; i++) {
-                // create (both sides of) a graph edge . . .
-                const detail1 = getDetailOnCurve(details[i], p);
-                this.addHalfEdge(graph, p, detail0.point, detail0.fraction, detail1.point, detail1.fraction);
-                detail0 = detail1;
+            let last = { point: p.startPoint(), fraction: 0.0 };
+            for (const detailPair of details) {
+                const detail = getDetailOnCurve(detailPair, p);
+                const detailFraction = Geometry_1.Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later
+                last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);
             }
-            this.addHalfEdge(graph, p, detail0.point, detail0.fraction, p.endPoint(), 1.0);
+            this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);
         }
         Merging_1.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle);
         return graph;
@@ -109,19 +121,21 @@ class PlanarSubdivision {
      * @param point0 start point
      * @param fraction1 end fraction
      * @param point1 end point
+     * @returns end point and fraction, or start point and fraction if no action
      */
-    static addHalfEdge(graph, p, point0, fraction0, point1, fraction1) {
-        if (!point0.isAlmostEqual(point1)) {
-            const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
-            const detail01 = CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
-            const mate = halfEdge.edgeMate;
-            halfEdge.edgeTag = detail01;
-            halfEdge.sortData = 1.0;
-            mate.edgeTag = detail01;
-            mate.sortData = -1.0;
-            halfEdge.sortAngle = sortAngle(detail01.curve, detail01.fraction, false);
-            mate.sortAngle = sortAngle(detail01.curve, detail01.fraction1, true);
-        }
+    static addHalfEdge(graph, p, point0, fraction0, point1, fraction1, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
+        if (point0.isAlmostEqualXY(point1, mergeTolerance))
+            return { point: point0, fraction: fraction0 };
+        const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
+        const detail01 = CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
+        const mate = halfEdge.edgeMate;
+        halfEdge.edgeTag = detail01;
+        halfEdge.sortData = 1.0;
+        mate.edgeTag = detail01;
+        mate.sortData = -1.0;
+        halfEdge.sortAngle = sortAngle(p, fraction0, false);
+        mate.sortAngle = sortAngle(p, fraction1, true);
+        return { point: point1, fraction: fraction1 };
     }
     /**
      * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative, or sliver loops.

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,gEAAsF;AAEtF,kCAAgE;AAChE,4CAAyC;AAEzC;;GAEG;AAEH,MAAM,+CAA+C;IAArD;QACS,oBAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;QAC9E,yDAAyD;QAClD,qBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;QACpD,0BAAqB,GAAW,CAAC,CAAC;IA4B5C,CAAC;IA3BQ,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;aACpE;SACF;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE;YACb,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;gBACf,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;aAC7C;iBAAM;gBACL,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACvB;SACF;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;CACF;AACD;;;;;;;;;;;;EAYE;AACF;;GAEG;AACH,MAAa,iBAAiB;IAC5B,qGAAqG;IAC9F,MAAM,CAAC,qBAAqB,CAAC,UAA4B,EAAE,QAAmC;QACnG,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC,CAAG,0DAA0D;QAC7I,KAAK,MAAM,CAAC,IAAI,UAAU;YACxB,iBAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACpC;QACD,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE;YAC/D,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE;gBAC9E,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC/C,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC/C,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS;oBACpD,OAAO,CAAC,MAAM,CAAC;gBACjB,OAAO,SAAS,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;YACH,IAAI,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YAC/C,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,UAAU,EAAG,EAAE,GAAG,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;YAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACvC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;gBACjD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC7F,OAAO,GAAG,OAAO,CAAC;aACnB;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC;SAChF;QACD,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAU,CAAC,CAAC;QAClF,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;OASG;IACK,MAAM,CAAC,WAAW,CAAC,KAAoB,EAAE,CAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,MAAe,EAAE,SAAiB;QACxI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAE,MAAM,CAAC,EAAC;YACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9D,MAAM,QAAQ,GAAG,yCAAmB,CAAC,oCAAoC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACnG,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;YAC/B,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC;YAC5B,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;YACxB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;YACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC;YACrB,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAM,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC1E,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAM,EAAE,QAAQ,CAAC,SAAU,EAAE,IAAI,CAAC,CAAC;SACtE;IACH,CAAC;IACH;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,IAAU,EAAE,QAAqB,EAAE,oBAA4B,OAAO,EAAE,YAAsB;QAC5H,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,CAAC,QAAkB,EAC/C,QAAoE;QACpE,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,GAAG;YACD,MAAM,MAAM,GAAG,EAAE,CAAC,OAA8B,CAAC;YACjD,IAAI,MAAM,EAAE;gBACV,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;oBACT,IAAI,QAAQ,KAAK,SAAS;wBACxB,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC5B,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB;aACF;YACD,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;SACvB,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;YACnB,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;SACvG;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,CAAE,CAAC,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAC;YACzB,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;SACpB;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;YACzB,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;gBAChC,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;wBACf,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;wBAC7C,IAAI,IAAI,KAAK,SAAS,EAAE;4BACtB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;4BAC5B,IAAI,CAAC,KAAK,SAAS,EAAE;gCACnB,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;6BACrB;iCAAM,IAAI,CAAC,YAAY,yBAAkB,EAAE;gCAC1C,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;6BACtB;yBACF;qBACF;gBACH,CAAC,CAAC,CAAC;gBACH,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,iBAAiB,EAAE,UAAU,CAAC,CAAC;aAC7E;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;SACjB;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA7JD,8CA6JC;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":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { HalfEdge, HalfEdgeGraph } from \"../../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\r\nimport { RegionOps } from \"../RegionOps\";\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nclass MapCurvePrimitiveToCurveLocationDetailPairArray {\r\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\r\n  // index assigned to this primitive for this calculation.\r\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\r\n  private _numIndexedPrimitives: number = 0;\r\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\r\n    if (primitive !== undefined) {\r\n      const index = this.primitiveToIndex.get(primitive);\r\n      if (index === undefined) {\r\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\r\n      }\r\n    }\r\n  }\r\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\r\n    if (primitive) {\r\n      const priorPairs = this.primitiveToPair.get(primitive);\r\n      this.assignPrimitiveIndex(primitive);\r\n      if (!priorPairs) {\r\n        this.primitiveToPair.set(primitive, [pair]);\r\n      } else {\r\n        priorPairs.push(pair);\r\n      }\r\n    }\r\n  }\r\n  public insertPair(pair: CurveLocationDetailPair) {\r\n    const primitiveA = pair.detailA.curve;\r\n    if (primitiveA)\r\n      this.insertPrimitiveToPair(primitiveA, pair);\r\n    const primitiveB = pair.detailB.curve;\r\n    if (primitiveB)\r\n      this.insertPrimitiveToPair(primitiveB, pair);\r\n  }\r\n}\r\n/*\r\n  function getDetailString(detail: CurveLocationDetail | undefined): string {\r\n    if (!detail)\r\n      return \"{}\";\r\n    else return tagString(\"primitive\", this.primitiveToIndex.get(detail.curve!)) + tagString(\"f0\", detail.fraction) + tagString(\"f1\", detail.fraction1);\r\n  }\r\n}\r\nfunction tagString(name: string, value: number | undefined): string {\r\n  if (value !== undefined)\r\n    return \"(\" + name + \" \" + value + \")\";\r\n  return \"\";\r\n}\r\n*/\r\n/**\r\n * @internal\r\n */\r\nexport class PlanarSubdivision {\r\n  /** Create a graph from an array of curves, and an array of the curves' precomputed intersections. */\r\n  public static assembleHalfEdgeGraph(primitives: CurvePrimitive[], allPairs: CurveLocationDetailPair[]): HalfEdgeGraph {\r\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();   // map from key CurvePrimitive to CurveLocationDetailPair.\r\n    for (const p of primitives)\r\n      detailByPrimitive.assignPrimitiveIndex(p);\r\n    for (const pair of allPairs) {\r\n      detailByPrimitive.insertPair(pair);\r\n    }\r\n    const graph = new HalfEdgeGraph();\r\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\r\n      const p = entry[0];\r\n      const details = entry[1];\r\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\r\n        const fractionA = getFractionOnCurve(pairA, p);\r\n        const fractionB = getFractionOnCurve(pairB, p);\r\n        if (fractionA === undefined || fractionB === undefined)\r\n          return -1000.0;\r\n        return fractionA - fractionB;\r\n      });\r\n      let detail0 = getDetailOnCurve(details[0], p)!;\r\n      this.addHalfEdge(graph, p, p.startPoint (), 0.0, detail0.point, detail0.fraction);\r\n      for (let i = 1; i < details.length; i++) {\r\n        // create (both sides of) a graph edge . . .\r\n        const detail1 = getDetailOnCurve(details[i], p)!;\r\n        this.addHalfEdge(graph, p, detail0.point, detail0.fraction, detail1.point, detail1.fraction);\r\n        detail0 = detail1;\r\n      }\r\n      this.addHalfEdge(graph, p, detail0.point, detail0.fraction, p.endPoint(), 1.0);\r\n    }\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle!);\r\n    return graph;\r\n  }\r\n  /**\r\n   * Create a pair of mated half edges referencing an interval of a primitive\r\n   *   * no action if start and end points are identical.\r\n   * @param graph containing graph.\r\n   * @param p the curve\r\n   * @param fraction0 starting fraction\r\n   * @param point0 start point\r\n   * @param fraction1 end fraction\r\n   * @param point1 end point\r\n   */\r\n  private static addHalfEdge(graph: HalfEdgeGraph, p: CurvePrimitive, point0: Point3d, fraction0: number, point1: Point3d, fraction1: number) {\r\n    if (!point0.isAlmostEqual (point1)){\r\n      const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);\r\n      const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);\r\n      const mate = halfEdge.edgeMate;\r\n      halfEdge.edgeTag = detail01;\r\n      halfEdge.sortData = 1.0;\r\n      mate.edgeTag = detail01;\r\n      mate.sortData = -1.0;\r\n      halfEdge.sortAngle = sortAngle(detail01.curve!, detail01.fraction, false);\r\n      mate.sortAngle = sortAngle(detail01.curve!, detail01.fraction1!, true);\r\n      }\r\n    }\r\n  /**\r\n   * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative, or sliver loops.\r\n   * @param zeroAreaTolerance absolute area tolerance for sliver face detection\r\n   * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area\r\n   * @returns the area (forced to zero if within tolerance)\r\n   */\r\n  public static collectSignedLoop(loop: Loop, outLoops: SignedLoops, zeroAreaTolerance: number = 1.0e-10, isSliverFace?: boolean): number{\r\n    let area = isSliverFace ? 0.0 : RegionOps.computeXYArea(loop);\r\n    if (area === undefined)\r\n      area = 0;\r\n    if (Math.abs(area) < zeroAreaTolerance)\r\n      area = 0.0;\r\n    (loop as any).computedAreaInPlanarSubdivision = area;\r\n    if (area > 0)\r\n      outLoops.positiveAreaLoops.push(loop);\r\n    else if (area < 0)\r\n      outLoops.negativeAreaLoops.push(loop);\r\n    else\r\n      outLoops.slivers.push(loop);\r\n    return area;\r\n  }\r\n  public static createLoopInFace(faceSeed: HalfEdge,\r\n    announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void): Loop {\r\n    let he = faceSeed;\r\n    const loop = Loop.create();\r\n    do {\r\n      const detail = he.edgeTag as CurveLocationDetail;\r\n      if (detail) {\r\n        let curve;\r\n        if (he.sortData! > 0)\r\n          curve = detail.curve!.clonePartialCurve(detail.fraction, detail.fraction1!);\r\n        else\r\n          curve = detail.curve!.clonePartialCurve(detail.fraction1!, detail.fraction);\r\n        if (curve) {\r\n          if (announce !== undefined)\r\n            announce(he, curve, loop);\r\n          loop.tryAddChild(curve);\r\n        }\r\n      }\r\n      he = he.faceSuccessor;\r\n    } while (he !== faceSeed);\r\n    return loop;\r\n  }\r\n  // Return true if there are only two edges in the face loop, and their start curvatures are the same.\r\n  private static isNullFace(he: HalfEdge): boolean {\r\n    const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);\r\n    let faceIsBanana = false;\r\n    if (faceHasTwoEdges) {\r\n      const c0 = HalfEdgeGraphMerge.curvatureSortKey(he);\r\n      const c1 = HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);\r\n      if (!Geometry.isSameCoordinate(c0, c1)) // default tol!\r\n        faceIsBanana = true;  // heuristic: we could also check end curvatures, and/or higher derivatives...\r\n    }\r\n    return faceHasTwoEdges && !faceIsBanana;\r\n  }\r\n  // Look across edge mates (possibly several) for a nonnull mate face.\r\n  private static nonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\r\n    if (this.isNullFace (e))\r\n      return undefined;\r\n    let e1 = e.edgeMate;\r\n    while (this.isNullFace(e1)){\r\n      e1 = e1.faceSuccessor.edgeMate;\r\n      if (e1 === e)\r\n        return undefined;\r\n    }\r\n    return e1;\r\n  }\r\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance: number = 1.0e-10): SignedLoops[] {\r\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    const result: SignedLoops[] = [];\r\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\r\n    for (const faceSeeds of q) {\r\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\r\n      const edges: LoopCurveLoopCurve[] = [];\r\n      for (const faceSeed of faceSeeds) {\r\n        const isNullFace = this.isNullFace(faceSeed);\r\n        const loop = this.createLoopInFace(faceSeed, (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\r\n          if (!isNullFace) {\r\n            const mate = this.nonNullEdgeMate(graph, he);\r\n            if (mate !== undefined) {\r\n              const e = edgeMap.get(mate);\r\n              if (e === undefined) {\r\n                // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\r\n                const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\r\n                edgeMap.set(he, e1);\r\n              } else if (e instanceof LoopCurveLoopCurve) {\r\n                e.setB(loopC, curveC);\r\n                edges.push(e);\r\n                edgeMap.delete(mate);\r\n              }\r\n            }\r\n          }\r\n        });\r\n        this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);\r\n      }\r\n      componentAreas.edges = edges;\r\n      result.push(componentAreas);\r\n      edgeMap.clear();\r\n    }\r\n    return result;\r\n  }\r\n}\r\n\r\nfunction sortAngle(curve: CurvePrimitive, fraction: number, reverse: boolean): number {\r\n  const ray = curve.fractionToPointAndDerivative(fraction);\r\n  const s = reverse ? -1.0 : 1.0;\r\n  return Math.atan2(s * ray.direction.y, s * ray.direction.x);\r\n}\r\n\r\nfunction getFractionOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): number | undefined {\r\n  if (pair.detailA.curve === curve)\r\n    return pair.detailA.fraction;\r\n  if (pair.detailB.curve === curve)\r\n    return pair.detailB.fraction;\r\n  return undefined;\r\n}\r\nfunction getDetailOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail | undefined {\r\n  if (pair.detailA.curve === curve)\r\n    return pair.detailA;\r\n  if (pair.detailB.curve === curve)\r\n    return pair.detailB;\r\n  return undefined;\r\n}\r\n"]}
+{"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;IAArD;QACS,oBAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;QAC9E,mDAAmD;QAC5C,qBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;QACpD,0BAAqB,GAAW,CAAC,CAAC;IA8C5C,CAAC;IA7CQ,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;aACpE;SACF;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE;YACb,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;gBACf,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;aAC7C;iBAAM;gBACL,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACvB;SACF;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,6EAA6E;IACtE,qCAAqC,CAAC,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACzH,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;YAC1B,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;gBACpE,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;gBAC7D,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;oBACZ,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CAAC,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7K,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CAAC,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;iBAC9K;aACF;SACF;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAa,iBAAiB;IAC5B,gIAAgI;IACzH,MAAM,CAAC,qBAAqB,CAAC,UAA4B,EAAE,QAAmC,EAAE,iBAAyB,mBAAQ,CAAC,mBAAmB;QAC1J,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC,CAAG,0DAA0D;QAC7I,KAAK,MAAM,IAAI,IAAI,QAAQ;YACzB,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,UAAU,CAAC,MAAM,GAAG,iBAAiB,CAAC,eAAe,CAAC,IAAI;YAC5D,iBAAiB,CAAC,qCAAqC,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC,CAAE,qEAAqE;QAC7J,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE;YAC/D,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,CAAC,GAAG,WAAW,EAAE,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;YAC5I,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,EAAC,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAC,CAAC;YAClD,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE;gBAChC,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;aAC5G;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;SAC1F;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,CAAC,KAAoB,EAAE,CAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,iBAAyB,mBAAQ,CAAC,mBAAmB;QAC/L,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,CAAC;YAChD,OAAO,EAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAC,CAAC;QAC9C,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,EAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAC,CAAC;IAC5C,CAAC;IACH;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,IAAU,EAAE,QAAqB,EAAE,oBAA4B,OAAO,EAAE,YAAsB;QAC5H,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,CAAC,QAAkB,EAC/C,QAAoE;QACpE,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,GAAG;YACD,MAAM,MAAM,GAAG,EAAE,CAAC,OAA8B,CAAC;YACjD,IAAI,MAAM,EAAE;gBACV,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;oBACT,IAAI,QAAQ,KAAK,SAAS;wBACxB,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC5B,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB;aACF;YACD,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;SACvB,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;YACnB,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;SACvG;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,CAAE,CAAC,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAC;YACzB,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;SACpB;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;YACzB,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;gBAChC,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;wBACf,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;wBAC7C,IAAI,IAAI,KAAK,SAAS,EAAE;4BACtB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;4BAC5B,IAAI,CAAC,KAAK,SAAS,EAAE;gCACnB,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;6BACrB;iCAAM,IAAI,CAAC,YAAY,yBAAkB,EAAE;gCAC1C,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;6BACtB;yBACF;qBACF;gBACH,CAAC,CAAC,CAAC;gBACH,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,iBAAiB,EAAE,UAAU,CAAC,CAAC;aAC7E;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;SACjB;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAnKD,8CAmKC;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":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { HalfEdge, HalfEdgeGraph } from \"../../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\r\nimport { RegionOps } from \"../RegionOps\";\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nclass MapCurvePrimitiveToCurveLocationDetailPairArray {\r\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\r\n  // index assigned to this primitive (for debugging)\r\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\r\n  private _numIndexedPrimitives: number = 0;\r\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\r\n    if (primitive !== undefined) {\r\n      const index = this.primitiveToIndex.get(primitive);\r\n      if (index === undefined) {\r\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\r\n      }\r\n    }\r\n  }\r\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\r\n    if (primitive) {\r\n      const priorPairs = this.primitiveToPair.get(primitive);\r\n      this.assignPrimitiveIndex(primitive);\r\n      if (!priorPairs) {\r\n        this.primitiveToPair.set(primitive, [pair]);\r\n      } else {\r\n        priorPairs.push(pair);\r\n      }\r\n    }\r\n  }\r\n  public insertPair(pair: CurveLocationDetailPair) {\r\n    const primitiveA = pair.detailA.curve;\r\n    if (primitiveA)\r\n      this.insertPrimitiveToPair(primitiveA, pair);\r\n    const primitiveB = pair.detailB.curve;\r\n    if (primitiveB)\r\n      this.insertPrimitiveToPair(primitiveB, pair);\r\n  }\r\n  /** Split closed missing primitives in half and add new intersection pairs */\r\n  public splitAndAppendMissingClosedPrimitives(primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance) {\r\n    for (const p of primitives) {\r\n      let closedCurveSplitCandidate = false;\r\n      if (p instanceof Arc3d)\r\n        closedCurveSplitCandidate = p.sweep.isFullCircle;\r\n      else if (!(p instanceof LineSegment3d) && !(p instanceof LineString3d))\r\n        closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);\r\n      if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {\r\n        const p0 = p.clonePartialCurve(0.0, 0.5);\r\n        const p1 = p.clonePartialCurve(0.5, 1.0);\r\n        if (p0 && p1) {\r\n          this.insertPair(CurveLocationDetailPair.createCapture(CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0), CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0)));\r\n          this.insertPair(CurveLocationDetailPair.createCapture(CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0), CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0)));\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport class PlanarSubdivision {\r\n  /** Create a graph from an array of curves, and an array of the curves' precomputed intersections. Z-coordinates are ignored. */\r\n  public static assembleHalfEdgeGraph(primitives: CurvePrimitive[], allPairs: CurveLocationDetailPair[], mergeTolerance: number = Geometry.smallMetricDistance): HalfEdgeGraph {\r\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();   // map from key CurvePrimitive to CurveLocationDetailPair.\r\n    for (const pair of allPairs)\r\n      detailByPrimitive.insertPair(pair);\r\n    if (primitives.length > detailByPrimitive.primitiveToPair.size)\r\n      detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance);  // otherwise, these single-primitive loops are missing from the graph\r\n    const graph = new HalfEdgeGraph();\r\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\r\n      const p = entry[0];\r\n      // convert each interval intersection into two isolated intersections\r\n      const details = entry[1].reduce((accumulator: CurveLocationDetailPair[], detailPair) => {\r\n        if (!detailPair.detailA.hasFraction1)\r\n          return [...accumulator, detailPair];\r\n        const detail = getDetailOnCurve(detailPair, p)!;\r\n        const detail0 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);\r\n        const detail1 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1!, detail.point1!);\r\n        return [...accumulator, CurveLocationDetailPair.createCapture(detail0, detail0), CurveLocationDetailPair.createCapture(detail1, detail1)];\r\n      }, []);\r\n      // lexical sort on p intersection fraction\r\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\r\n        const fractionA = getFractionOnCurve(pairA, p)!;\r\n        const fractionB = getFractionOnCurve(pairB, p)!;\r\n        return fractionA - fractionB;\r\n      });\r\n      let last = {point: p.startPoint(), fraction: 0.0};\r\n      for (const detailPair of details) {\r\n        const detail = getDetailOnCurve(detailPair, p)!;\r\n        const detailFraction = Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later\r\n        last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);\r\n      }\r\n      this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);\r\n    }\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle!);\r\n    return graph;\r\n  }\r\n  /**\r\n   * Create a pair of mated half edges referencing an interval of a primitive\r\n   *   * no action if start and end points are identical.\r\n   * @param graph containing graph.\r\n   * @param p the curve\r\n   * @param fraction0 starting fraction\r\n   * @param point0 start point\r\n   * @param fraction1 end fraction\r\n   * @param point1 end point\r\n   * @returns end point and fraction, or start point and fraction if no action\r\n   */\r\n  private static addHalfEdge(graph: HalfEdgeGraph, p: CurvePrimitive, point0: Point3d, fraction0: number, point1: Point3d, fraction1: number, mergeTolerance: number = Geometry.smallMetricDistance): {point: Point3d, fraction: number} {\r\n    if (point0.isAlmostEqualXY(point1, mergeTolerance))\r\n      return {point: point0, fraction: fraction0};\r\n    const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);\r\n    const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);\r\n    const mate = halfEdge.edgeMate;\r\n    halfEdge.edgeTag = detail01;\r\n    halfEdge.sortData = 1.0;\r\n    mate.edgeTag = detail01;\r\n    mate.sortData = -1.0;\r\n    halfEdge.sortAngle = sortAngle(p, fraction0, false);\r\n    mate.sortAngle = sortAngle(p, fraction1, true);\r\n    return {point: point1, fraction: fraction1};\r\n    }\r\n  /**\r\n   * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative, or sliver loops.\r\n   * @param zeroAreaTolerance absolute area tolerance for sliver face detection\r\n   * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area\r\n   * @returns the area (forced to zero if within tolerance)\r\n   */\r\n  public static collectSignedLoop(loop: Loop, outLoops: SignedLoops, zeroAreaTolerance: number = 1.0e-10, isSliverFace?: boolean): number{\r\n    let area = isSliverFace ? 0.0 : RegionOps.computeXYArea(loop);\r\n    if (area === undefined)\r\n      area = 0;\r\n    if (Math.abs(area) < zeroAreaTolerance)\r\n      area = 0.0;\r\n    (loop as any).computedAreaInPlanarSubdivision = area;\r\n    if (area > 0)\r\n      outLoops.positiveAreaLoops.push(loop);\r\n    else if (area < 0)\r\n      outLoops.negativeAreaLoops.push(loop);\r\n    else\r\n      outLoops.slivers.push(loop);\r\n    return area;\r\n  }\r\n  public static createLoopInFace(faceSeed: HalfEdge,\r\n    announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void): Loop {\r\n    let he = faceSeed;\r\n    const loop = Loop.create();\r\n    do {\r\n      const detail = he.edgeTag as CurveLocationDetail;\r\n      if (detail) {\r\n        let curve;\r\n        if (he.sortData! > 0)\r\n          curve = detail.curve!.clonePartialCurve(detail.fraction, detail.fraction1!);\r\n        else\r\n          curve = detail.curve!.clonePartialCurve(detail.fraction1!, detail.fraction);\r\n        if (curve) {\r\n          if (announce !== undefined)\r\n            announce(he, curve, loop);\r\n          loop.tryAddChild(curve);\r\n        }\r\n      }\r\n      he = he.faceSuccessor;\r\n    } while (he !== faceSeed);\r\n    return loop;\r\n  }\r\n  // Return true if there are only two edges in the face loop, and their start curvatures are the same.\r\n  private static isNullFace(he: HalfEdge): boolean {\r\n    const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);\r\n    let faceIsBanana = false;\r\n    if (faceHasTwoEdges) {\r\n      const c0 = HalfEdgeGraphMerge.curvatureSortKey(he);\r\n      const c1 = HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);\r\n      if (!Geometry.isSameCoordinate(c0, c1)) // default tol!\r\n        faceIsBanana = true;  // heuristic: we could also check end curvatures, and/or higher derivatives...\r\n    }\r\n    return faceHasTwoEdges && !faceIsBanana;\r\n  }\r\n  // Look across edge mates (possibly several) for a nonnull mate face.\r\n  private static nonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\r\n    if (this.isNullFace (e))\r\n      return undefined;\r\n    let e1 = e.edgeMate;\r\n    while (this.isNullFace(e1)){\r\n      e1 = e1.faceSuccessor.edgeMate;\r\n      if (e1 === e)\r\n        return undefined;\r\n    }\r\n    return e1;\r\n  }\r\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance: number = 1.0e-10): SignedLoops[] {\r\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    const result: SignedLoops[] = [];\r\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\r\n    for (const faceSeeds of q) {\r\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\r\n      const edges: LoopCurveLoopCurve[] = [];\r\n      for (const faceSeed of faceSeeds) {\r\n        const isNullFace = this.isNullFace(faceSeed);\r\n        const loop = this.createLoopInFace(faceSeed, (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\r\n          if (!isNullFace) {\r\n            const mate = this.nonNullEdgeMate(graph, he);\r\n            if (mate !== undefined) {\r\n              const e = edgeMap.get(mate);\r\n              if (e === undefined) {\r\n                // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\r\n                const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\r\n                edgeMap.set(he, e1);\r\n              } else if (e instanceof LoopCurveLoopCurve) {\r\n                e.setB(loopC, curveC);\r\n                edges.push(e);\r\n                edgeMap.delete(mate);\r\n              }\r\n            }\r\n          }\r\n        });\r\n        this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);\r\n      }\r\n      componentAreas.edges = edges;\r\n      result.push(componentAreas);\r\n      edgeMap.clear();\r\n    }\r\n    return result;\r\n  }\r\n}\r\n\r\nfunction sortAngle(curve: CurvePrimitive, fraction: number, reverse: boolean): number {\r\n  const ray = curve.fractionToPointAndDerivative(fraction);\r\n  const s = reverse ? -1.0 : 1.0;\r\n  return Math.atan2(s * ray.direction.y, s * ray.direction.x);\r\n}\r\n\r\nfunction getFractionOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): number | undefined {\r\n  if (pair.detailA.curve === curve)\r\n    return pair.detailA.fraction;\r\n  if (pair.detailB.curve === curve)\r\n    return pair.detailB.fraction;\r\n  return undefined;\r\n}\r\nfunction getDetailOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail | undefined {\r\n  if (pair.detailA.curve === curve)\r\n    return pair.detailA;\r\n  if (pair.detailB.curve === curve)\r\n    return pair.detailB;\r\n  return undefined;\r\n}\r\n"]}

package/lib/cjs/curve/RegionOps.d.ts

@@ -129,7 +129,7 @@ export declare class RegionOps {
      * @param loopsB second set of loops
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
      * @param mergeTolerance absolute distance tolerance for merging loops
-     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges connecting interior loops to exterior loops.
+     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added to connect interior loops to exterior loops.
      */
     static regionBooleanXY(loopsA: AnyRegion | AnyRegion[] | undefined, loopsB: AnyRegion | AnyRegion[] | undefined, operation: RegionBinaryOpType, mergeTolerance?: number): AnyRegion | undefined;
     /**
@@ -290,17 +290,19 @@ export declare class RegionOps {
     static sortOuterAndHoleLoopsXY(loops: Array<Loop | IndexedXYZCollection>): AnyRegion;
     /**
      * Find all areas bounded by the unstructured, possibly intersecting curves.
-     * * This method performs no merging of nearly coincident edges and vertices, which can lead to unexpected results
-     * given sufficiently imprecise input. Input geometry consisting of regions can be merged for better results by pre-processing with
-     * [[regionBooleanXY]].
+     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the input curves.
+     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop, regardless
+     * of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]] to add bridge edges so that
+     * [[constructAllXYRegionLoops]] will return outer and inner loops in the same SignedLoops object.
      * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve primitives.
+     * @param tolerance optional distance tolerance for coincidence
      * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:
      *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have positive area and counterclockwise orientation.
      *    * `negativeAreaLoops` contains (probably just one) "exterior" loop which is ordered clockwise.
      *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.
      *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent to the edge and a constituent curve in each.
      */
-    static constructAllXYRegionLoops(curvesAndRegions: AnyCurve | AnyCurve[]): SignedLoops[];
+    static constructAllXYRegionLoops(curvesAndRegions: AnyCurve | AnyCurve[], tolerance?: number): SignedLoops[];
     /**
      * Collect all `CurvePrimitives` in loosely typed input.
      * * Always recurses into primitives within explicit collections (Path, Loop, ParityRegion, UnionRegion).

package/lib/cjs/curve/RegionOps.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEhD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC1E,OAAO,EAAyB,0BAA0B,EAAgB,MAAM,2BAA2B,CAAC;AAE5G,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,yCAAyC,EAAc,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAExH,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAA+B,YAAY,EAAE,aAAa,EAA4B,MAAM,yCAAyC,CAAC;AAE7I,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAY9B;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,cAAc,GAAG,IAAI,GAAG,WAAW,GAAG,IAAI,GAAG,SAAS,CAAC;AAEhF;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AACvH;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;;;;;;;GASG;AACH,qBAAa,SAAS;IACpB;;;;;OAKG;WACW,oBAAoB,CAAC,IAAI,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS3E;;;MAGE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAKtH;;;;;OAKG;WACW,aAAa,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQhE;;;;OAIG;WACW,wBAAwB,CAAC,IAAI,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAQ9E;;;OAGG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI;IAqC1J;;;OAGG;WACW,0BAA0B,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GAAG,QAAQ,EAAE,GAAG,SAAS;IAY1J;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CAAC,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAO/K;;;;;;;;OAQG;WACW,iCAAiC,CAAC,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAM3K;;;;;;;;OAQG;WACW,sCAAsC,CAAC,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAOhL;;;;;;;;;OASG;WACW,eAAe,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAAE,SAAS,EAAE,kBAAkB,EAAE,cAAc,GAAE,MAAqC,GAAG,SAAS,GAAG,SAAS;IAsBpO;;;;;;;;;;;OAWG;WACW,0BAA0B,CAAC,MAAM,EAAE,0BAA0B,EAAE,EAAE,SAAS,EAAE,kBAAkB,EAC1G,MAAM,EAAE,0BAA0B,EAAE,EAAE,WAAW,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAO3F;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GAAG,SAAS,GAAG,SAAS;IAqB9D;;;;;;;OAOG;WACW,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS;IAIjI;;;;;;;;;;;;;KAaC;WACa,sBAAsB,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAAG,eAAe,GAAG,SAAS;IAGtJ;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;OAQG;WACW,2BAA2B,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAAG,eAAe,GAAG,SAAS;IAwBtK,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAC/D;;;;;;;;OAQG;WACW,uBAAuB,CAAC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;OAIG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,UAAU;IAatG;;;;;;;OAOG;WACW,8BAA8B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,EAAE,UAAU,CAAA;KAAE;IAGhM;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,UAAU;IAInH;;;;OAIG;WACW,2BAA2B,CAAC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBnL;;;;;;;;;;;;OAYG;WACW,sBAAsB,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GAAG,SAAS,GAAG,SAAS;IA6CnJ;;;;;;;;;;OAUG;WACW,6BAA6B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC;IAIxH;;;;;;;;;OASG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;;;;;;;;OAWG;WACW,yBAAyB,CAAC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,WAAW,EAAE;IAU/F;;;;;;;;OAQG;WACW,sBAAsB,CAAC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,cAAc,CAAC,EAAE,cAAc,EAAE,EACvG,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAAG,cAAc,EAAE;IAaxD;;;;OAIG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;CAkB5E"}
+{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEhD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAE1E,OAAO,EAAyB,0BAA0B,EAAgB,MAAM,2BAA2B,CAAC;AAE5G,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,yCAAyC,EAAc,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAExH,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAIlD,OAAO,EAA+B,YAAY,EAAE,aAAa,EAA4B,MAAM,yCAAyC,CAAC;AAE7I,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAE3C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAS9B;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG,cAAc,GAAG,IAAI,GAAG,WAAW,GAAG,IAAI,GAAG,SAAS,CAAC;AAEhF;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AACvH;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;;;;;;;GASG;AACH,qBAAa,SAAS;IACpB;;;;;OAKG;WACW,oBAAoB,CAAC,IAAI,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS3E;;;MAGE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAKtH;;;;;OAKG;WACW,aAAa,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQhE;;;;OAIG;WACW,wBAAwB,CAAC,IAAI,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAQ9E;;;OAGG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI;IAqC1J;;;OAGG;WACW,0BAA0B,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GAAG,QAAQ,EAAE,GAAG,SAAS;IAY1J;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CAAC,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAO/K;;;;;;;;OAQG;WACW,iCAAiC,CAAC,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAM3K;;;;;;;;OAQG;WACW,sCAAsC,CAAC,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAOhL;;;;;;;;;OASG;WACW,eAAe,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAAE,SAAS,EAAE,kBAAkB,EAAE,cAAc,GAAE,MAAqC,GAAG,SAAS,GAAG,SAAS;IAsBpO;;;;;;;;;;;OAWG;WACW,0BAA0B,CAAC,MAAM,EAAE,0BAA0B,EAAE,EAAE,SAAS,EAAE,kBAAkB,EAC1G,MAAM,EAAE,0BAA0B,EAAE,EAAE,WAAW,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAO3F;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GAAG,SAAS,GAAG,SAAS;IAqB9D;;;;;;;OAOG;WACW,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS;IAIjI;;;;;;;;;;;;;KAaC;WACa,sBAAsB,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAAG,eAAe,GAAG,SAAS;IAGtJ;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;OAQG;WACW,2BAA2B,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAAG,eAAe,GAAG,SAAS;IAwBtK,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAC/D;;;;;;;;OAQG;WACW,uBAAuB,CAAC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;OAIG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,UAAU;IAatG;;;;;;;OAOG;WACW,8BAA8B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,EAAE,UAAU,CAAA;KAAE;IAGhM;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,UAAU;IAInH;;;;OAIG;WACW,2BAA2B,CAAC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBnL;;;;;;;;;;;;OAYG;WACW,sBAAsB,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GAAG,SAAS,GAAG,SAAS;IA6CnJ;;;;;;;;;;OAUG;WACW,6BAA6B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC;IAIxH;;;;;;;;;OASG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;;;;;;;;;;OAaG;WACW,yBAAyB,CAAC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,SAAS,GAAE,MAAqC,GAAG,WAAW,EAAE;IASjJ;;;;;;;;OAQG;WACW,sBAAsB,CAAC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,cAAc,CAAC,EAAE,cAAc,EAAE,EACvG,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAAG,cAAc,EAAE;IAaxD;;;;OAIG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;CAkB5E"}

package/lib/cjs/curve/RegionOps.js

@@ -20,27 +20,27 @@ const Transform_1 = require("../geometry3d/Transform");
 const MomentData_1 = require("../geometry4d/MomentData");
 const PolyfaceBuilder_1 = require("../polyface/PolyfaceBuilder");
 const Graph_1 = require("../topology/Graph");
+const HalfEdgeGraphSearch_1 = require("../topology/HalfEdgeGraphSearch");
 const Triangulation_1 = require("../topology/Triangulation");
 const ChainCollectorContext_1 = require("./ChainCollectorContext");
 const CurveCollection_1 = require("./CurveCollection");
 const CurveCurve_1 = require("./CurveCurve");
 const CurvePrimitive_1 = require("./CurvePrimitive");
 const CurveWireMomentsXYZ_1 = require("./CurveWireMomentsXYZ");
+const GeometryQuery_1 = require("./GeometryQuery");
+const MultiChainCollector_1 = require("./internalContexts/MultiChainCollector");
 const PolygonOffsetContext_1 = require("./internalContexts/PolygonOffsetContext");
 const LineString3d_1 = require("./LineString3d");
 const Loop_1 = require("./Loop");
+const ParityRegion_1 = require("./ParityRegion");
 const Path_1 = require("./Path");
 const ConsolidateAdjacentPrimitivesContext_1 = require("./Query/ConsolidateAdjacentPrimitivesContext");
 const CurveSplitContext_1 = require("./Query/CurveSplitContext");
 const InOutTests_1 = require("./Query/InOutTests");
 const PlanarSubdivision_1 = require("./Query/PlanarSubdivision");
 const RegionMomentsXY_1 = require("./RegionMomentsXY");
-const MultiChainCollector_1 = require("./internalContexts/MultiChainCollector");
-const GeometryQuery_1 = require("./GeometryQuery");
 const RegionOpsClassificationSweeps_1 = require("./RegionOpsClassificationSweeps");
 const UnionRegion_1 = require("./UnionRegion");
-const HalfEdgeGraphSearch_1 = require("../topology/HalfEdgeGraphSearch");
-const ParityRegion_1 = require("./ParityRegion");
 /**
  * Enumeration of the binary operation types for a booleans among regions
  * @public
@@ -239,7 +239,7 @@ class RegionOps {
      * @param loopsB second set of loops
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
      * @param mergeTolerance absolute distance tolerance for merging loops
-     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges connecting interior loops to exterior loops.
+     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added to connect interior loops to exterior loops.
      */
     static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
         const result = UnionRegion_1.UnionRegion.create();
@@ -247,7 +247,7 @@ class RegionOps {
         context.addMembers(loopsA, loopsB);
         context.annotateAndMergeCurvesInGraph(mergeTolerance);
         const range = context.groupA.range().union(context.groupB.range());
-        const areaTol = this.computeXYAreaTolerance(range);
+        const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);
         context.runClassificationSweep(operation, (_graph, face, faceType, area) => {
             // ignore danglers and null faces, but not 2-edge "banana" faces with nonzero area
             if (face.countEdgesAroundFace() < 2)
@@ -565,23 +565,24 @@ class RegionOps {
     }
     /**
      * Find all areas bounded by the unstructured, possibly intersecting curves.
-     * * This method performs no merging of nearly coincident edges and vertices, which can lead to unexpected results
-     * given sufficiently imprecise input. Input geometry consisting of regions can be merged for better results by pre-processing with
-     * [[regionBooleanXY]].
+     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the input curves.
+     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop, regardless
+     * of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]] to add bridge edges so that
+     * [[constructAllXYRegionLoops]] will return outer and inner loops in the same SignedLoops object.
      * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve primitives.
+     * @param tolerance optional distance tolerance for coincidence
      * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:
      *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have positive area and counterclockwise orientation.
      *    * `negativeAreaLoops` contains (probably just one) "exterior" loop which is ordered clockwise.
      *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.
      *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent to the edge and a constituent curve in each.
      */
-    static constructAllXYRegionLoops(curvesAndRegions) {
-        const primitivesA = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true);
-        const primitivesB = this.expandLineStrings(primitivesA);
-        const range = this.curveArrayRange(primitivesB);
-        const areaTol = this.computeXYAreaTolerance(range);
-        const intersections = CurveCurve_1.CurveCurve.allIntersectionsAmongPrimitivesXY(primitivesB);
-        const graph = PlanarSubdivision_1.PlanarSubdivision.assembleHalfEdgeGraph(primitivesB, intersections);
+    static constructAllXYRegionLoops(curvesAndRegions, tolerance = Geometry_1.Geometry.smallMetricDistance) {
+        const primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);
+        const range = this.curveArrayRange(primitives);
+        const areaTol = this.computeXYAreaTolerance(range, tolerance);
+        const intersections = CurveCurve_1.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
+        const graph = PlanarSubdivision_1.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
         return PlanarSubdivision_1.PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);
     }
     /**