@itwin/core-geometry 3.4.0-dev.8 → 3.5.0-dev.11

package/lib/cjs/topology/Merging.js

@@ -226,7 +226,8 @@ exports.HalfEdgeGraphOps = HalfEdgeGraphOps;
  * @internal
  */
 class HalfEdgeGraphMerge {
-    // return kC <= kB such that stored angles (at extra data index 0 !) kA<=k<kC match.
+    // return kC such that all angles k are equal, with kA <= k < kC <= kB.
+    // * Assume: angles k are stored at extra data index 0.
     // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC
     static getCommonThetaEndIndex(clusters, order, kA, kB) {
         let kC = kA + 1;
@@ -259,7 +260,7 @@ class HalfEdgeGraphMerge {
         }
     }
     // assumptions about cluster array:
-    //   * data order is: x,y,theta, nodeIndex
+    //   * data order is: x,y,theta,nodeIndex
     //   * theta and nodeIndex are the "extra" data.
     //   * only want to do anything here when curves are present.
     //   * k0<=k<k1 are around a vertex
@@ -284,9 +285,10 @@ class HalfEdgeGraphMerge {
             k = kB;
         }
     }
-    // Return the sort key for sorting by curvature.
-    // This is the signed distance from the curve to center of curvature.
-    // This should need to be upgraded to account for higher derivatives in the case of higher-than-tangent match.
+    /** Return the sort key for sorting by curvature.
+     * * This is the signed distance from the curve at the edge start, to center of curvature.
+     * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.
+     */
     static curvatureSortKey(node) {
         const cld = node.edgeTag;
         if (cld !== undefined) {
@@ -313,7 +315,7 @@ class HalfEdgeGraphMerge {
         const allNodes = graph.allHalfEdges;
         const numNodes = allNodes.length;
         graph.clearMask(Graph_1.HalfEdgeMask.NULL_FACE);
-        const clusters = new ClusterableArray_1.ClusterableArray(2, 2, numNodes); // data order: x,y,theta, nodeIndex.  But theta is not set in first round.
+        const clusters = new ClusterableArray_1.ClusterableArray(2, 2, numNodes); // data order: x,y,theta,nodeIndex.  But theta is not set in first round.
         for (let i = 0; i < numNodes; i++) {
             const nodeA = allNodes[i];
             const xA = nodeA.x;
@@ -321,12 +323,13 @@ class HalfEdgeGraphMerge {
             Graph_1.HalfEdge.pinch(nodeA, nodeA.vertexSuccessor); // pull it out of its current vertex loop.
             clusters.addDirect(xA, yA, 0.0, i);
         }
-        const order = clusters.clusterIndicesLexical();
+        const clusterTol = Geometry_1.Geometry.smallMetricDistance;
+        const order = clusters.clusterIndicesLexical(clusterTol);
         let k0 = 0;
         const numK = order.length;
         for (let k1 = 0; k1 < numK; k1++) {
             if (order[k1] === ClusterableArray_1.ClusterableArray.clusterTerminator) {
-                // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.
+                // nodes identified in order[k0]..order[k1-1] are at a vertex cluster; equate their xy
                 if (k1 > k0) {
                     const iA = clusters.getExtraData(order[k0], 1);
                     const nodeA0 = allNodes[iA];
@@ -363,7 +366,7 @@ class HalfEdgeGraphMerge {
         // now pinch each neighboring pair together
         for (let k1 = 0; k1 < numK; k1++) {
             if (order[k1] === ClusterableArray_1.ClusterableArray.clusterTerminator) {
-                // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.
+                // nodes identified in order[k0]..order[k1-1] are properly sorted around a vertex.
                 if (k1 > k0) {
                     // const xy = clusters.getPoint2d(order[k0]);
                     // eslint-disable-next-line no-console
@@ -399,15 +402,24 @@ class HalfEdgeGraphMerge {
                         }
                         else {
                             Graph_1.HalfEdge.pinch(nodeA, nodeB);
+                            // Detect null face using the heuristic:
+                            //  * near vertex angles are same (periodic, toleranced)
+                            //  * far vertex is clustered (exactly equal)
+                            //  * near vertex curvatures are same (toleranced)
+                            // Note that near vertex is already clustered.
                             if (Angle_1.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {
                                 const nodeA1 = nodeA.faceSuccessor;
                                 const nodeB1 = nodeB.edgeMate;
-                                // WE TRUST -- nodeA1 and node B1 must have identical xy.
-                                // pinch them together and mark the face loop as null ..
-                                Graph_1.HalfEdge.pinch(nodeA1, nodeB1);
-                                nodeA.setMask(Graph_1.HalfEdgeMask.NULL_FACE);
-                                nodeB1.setMask(Graph_1.HalfEdgeMask.NULL_FACE);
-                                unmatchedNullFaceNodes.push(nodeB1);
+                                if (nodeA1.isEqualXY(nodeB1)) {
+                                    const cA = this.curvatureSortKey(nodeA);
+                                    const cB = this.curvatureSortKey(nodeB);
+                                    if (Geometry_1.Geometry.isSameCoordinate(cA, cB, clusterTol)) { // rule out banana
+                                        Graph_1.HalfEdge.pinch(nodeA1, nodeB1);
+                                        nodeA.setMask(Graph_1.HalfEdgeMask.NULL_FACE);
+                                        nodeB1.setMask(Graph_1.HalfEdgeMask.NULL_FACE);
+                                        unmatchedNullFaceNodes.push(nodeB1);
+                                    }
+                                }
                             }
                             nodeA = nodeB;
                             thetaA = thetaB;

package/lib/cjs/topology/Merging.js.map

@@ -1 +1 @@
-{"version":3,"file":"Merging.js","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,0CAAuC;AACvC,+CAA4C;AAC5C,mEAAkE;AAClE,+CAA8C;AAC9C,mEAAgE;AAChE,yDAAsD;AACtD,mCAAgE;AAChE,mEAAgF;AAChF,qDAAyD;AACzD,mDAA2E;AAE3E,MAAa,cAAc;IAOzB;QANO,cAAS,GAAG,CAAC,CAAC;QACd,wBAAmB,GAAG,CAAC,CAAC;QACxB,aAAQ,GAAG,CAAC,CAAC;QACb,cAAS,GAAG,CAAC,CAAC;QACd,YAAO,GAAG,CAAC,CAAC;QACZ,YAAO,GAAG,CAAC,CAAC;IAEnB,CAAC;CACF;AATD,wCASC;AACD;;GAEG;AACH,MAAa,0BAA0B;IAKrC,YAAmB,KAAa,EAAE,GAAW,EAAE,IAAc,EAAE,OAAgB;QAC7E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,GAAG,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAXD,gEAWC;AAID;;;GAGG;AACH,MAAa,gBAAgB;IAE3B,iFAAiF;IAC1E,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QACrD,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mIAAmI;IAC5H,MAAM,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACvC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAc,EAAE,OAAiB,EAAE,OAAiB;QACtF,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,wHAAwH;IACxH,yHAAyH;IAElH,MAAM,CAAC,UAAU,CAAC,KAAoB;QAC3C,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;SACzC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gFAAgF;IACzE,MAAM,CAAC,wBAAwB,CAAC,QAAyB,EAAE,WAA0B,EAAE,IAAkB;QAC9G,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,kFAAkF;QAClF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAE9B,MAAM,KAAK,GAAG,WAAW,CAAC,gBAAgB,CACxC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,EACV,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,GAAG,CAAC,CAAC,CAAC;YAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC7B,UAAU,IAAI,CAAC,CAAC;YAEhB,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAG,sDAAsD;YACvF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACpB;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE;YACtC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SAC9B;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,MAAoB,EAAE,OAAqB;QACvG,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,EAAE,8DAA8D;YACjE,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC;SACzB,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,EAAE,2DAA2D;YAC9D,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,iBAAiB,CAAC;SAC3B,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,OAAO,gBAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC;IACtE,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QAC9I,IAAI,oBAAY,CAAC,SAAS,KAAK,IAAI;YACjC,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;gBAC1B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE;oBACjE,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE;wBACjI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBAC7B,EAAE,SAAS,CAAC;qBACb;iBACF;aACF;YACH,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,wCAAwC,CAAC,KAAoB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QAC7H,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE;YACxE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;gBACrC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE;oBACpD,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBACtB;aACF;YACD,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;SACzB;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QACtG,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACzF,IAAI,eAAe,GAAG,CAAC;YACrB,KAAK,CAAC,kBAAkB,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QACnE,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,QAAsB,oBAAY,CAAC,QAAQ;QAC/F,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAChC,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACtB,OAAO,KAAK,CAAC;SACd;QACH,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAtMD,4CAsMC;AAED;;GAEG;AACH,MAAa,kBAAkB;IAC7B,oFAAoF;IACpF,+EAA+E;IACxE,MAAM,CAAC,sBAAsB,CAAC,QAA0B,EAAE,KAAkB,EAAE,EAAU,EAAE,EAAU;QACzG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,EAAE;YACd,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;gBAC/D,OAAO,EAAE,CAAC;aACX;YACF,EAAE,EAAE,CAAC;SACL;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAEH;;OAEG;IACM,MAAM,KAAK,kCAAkC,CAAC,IAAoD,IAAI,IAAI,CAAC,mCAAmC,GAAG,IAAI,CAAC,CAAC,CAAC;IACvJ,MAAM,CAAC,4BAA4B,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACtI,IAAI,IAAI,CAAC,mCAAmC,EAAE;YAC5C,MAAM,QAAQ,GAAiC,EAAE,CAAC;YAClD,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAC;gBAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;aACpF;YACD,IAAI,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;SACpD;IAEH,CAAC;IACD,mCAAmC;IACnC,0CAA0C;IAC1C,gDAAgD;IAChD,6DAA6D;IAC7D,mCAAmC;IACnC,iCAAiC;IACzB,MAAM,CAAC,yBAAyB,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACnI,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAElD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE;gBACd,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE;oBAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;oBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC;iBAChF;gBACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAA6B,EAAE,CAA6B,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;gBAC7H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAC;oBACvC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;iBAClC;aACF;YACD,CAAC,GAAG,EAAE,CAAC;SACR;IACH,CAAC;IACD,gDAAgD;IAChD,qEAAqE;IACrE,8GAA8G;IACtG,MAAM,CAAC,gBAAgB,CAAC,IAAc;QAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,OAA8B,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS,EAAE;YACrB,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,IAAI,KAAK,EAAE;gBACT,IAAI,MAAM,GAAG,KAAK,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;gBACjE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;oBAClD,MAAM,GAAG,CAAC,MAAM,CAAC;gBACnB,OAAO,MAAM,CAAC;aACf;SACF;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB,EAAE,uBAAkD;QAC3G,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,mCAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,0EAA0E;QAClI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAE,0CAA0C;YACzF,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;SACpC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,qBAAqB,EAAE,CAAC;QAC/C,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;YAChC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBACpD,gFAAgF;gBAChF,IAAI,EAAE,GAAG,EAAE,EAAE;oBACX,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACnB,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;qBACpB;iBACF;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACb;SACF;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE;YACrC,IAAI,iBAAiB,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,OAAO,GAAG,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1H,IAAI,aAAK,CAAC,oCAAoC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/D,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;aACtD;SACF;QACD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,sBAAsB,GAAe,EAAE,CAAC;QAC9C,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,MAAM,EAAE,MAAM,CAAC;QACjB,sCAAsC;QACtC,qCAAqC;QAEvC,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;YAChC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBACpD,gFAAgF;gBAChF,IAAI,EAAE,GAAG,EAAE,EAAE;oBACX,6CAA6C;oBAC7C,sCAAsC;oBACtC,6CAA6C;oBAC7C,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;wBACb,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrE,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,MAAM,CAAC;oBACnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE;4BAC3C,8DAA8D;4BAC9D,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE;gCACV,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;6BAC9B;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;yBACjB;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE;4BAClD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE;gCACV,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;6BAC9B;4BACD,6FAA6F;yBAC9F;6BAAM;4BACL,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAC7B,IAAI,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;gCAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,yDAAyD;gCACzD,wDAAwD;gCACxD,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gCAC/B,KAAK,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;gCACtC,MAAM,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;gCACvC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;6BACrC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;yBACjB;qBACF;iBACF;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACb;SACF;IACH,CAAC;IAEO,MAAM,CAAC,+BAA+B,CAAC,KAAoB;QACjE,MAAM,SAAS,GAAG,IAAI,6DAAqC,EAAE,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE;YAElC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE;gBAC7D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACjC;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACO,MAAM,CAAC,kBAAkB,CAAC,EAAW,EAAE,QAAgB,EAAE,IAAc,EAAE,YAAoB;QACnG,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YACpF,OAAO,YAAY,CAAC;QACtB,OAAO,QAAQ,CAAC;IACpB,CAAC;IACS,MAAM,CAAC,mCAAmC,CAAC,MAAgB,EAAE,MAAgB,EAAE,SAAmB,EAAE,MAAe,EAAE,MAAe;QAC1I,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,6DAA6D;QAC7D,IAAI,yBAAW,CAAC,8CAA8C,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAC7E,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE;YAC9B,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,OAAO,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SACrE;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB;QACvD,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,aAAa,GAAG,MAAM,CAAC;QAC7B,MAAM,aAAa,GAAG,GAAG,GAAG,aAAa,CAAC;QAC1C,IAAI,CAAC,CAAC;QACN,MAAM,SAAS,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC;QACX,MAAM,YAAY,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAClD,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE;YAC7D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,SAAS,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;YACjE,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjD,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;gBAC9B,uCAAuC;gBACvC,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;oBACvE,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChB;qBAAM,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;oBAC9E,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChB;qBAAM;oBACL,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,IAAI,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE;wBACvF,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE;4BAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;4BAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,2DAA2D;4BAClG,IAAI,CAAC,QAAQ,EAAE,CAAC;yBACjB;wBACD,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE;4BAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;4BAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,2DAA2D;4BAClG,IAAI,CAAC,QAAQ,EAAE,CAAC;yBACjB;wBACD,0EAA0E;qBAC3E;iBACF;aACF;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SACpC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qBAAqB,CAAC,YAA6B;QAC/D,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,gBAAgB,CAAC,wBAAwB,CAAC,YAAY,EAAE,KAAK,EAAE,oBAAY,CAAC,aAAa,CAAC,CAAC;QAC3F,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAEnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAkC,EAAE,aAAsB,IAAI,EAAE,OAAqB,oBAAY,CAAC,YAAY;QAC9I,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,4BAAY,CAAC,iCAAiC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,KAAK,MAAM,IAAI,IAAI,UAAU;YAC3B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,EAAE;YACd,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF;AA3UD,gDA2UC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\r\nimport { SmallSystem } from \"../numerics/Polynomials\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { HalfEdgePriorityQueueWithPartnerArray } from \"./HalfEdgePriorityQueue\";\r\nimport { RegularizationContext } from \"./RegularizeFace\";\r\nimport { MultiLineStringDataVariant, Triangulator } from \"./Triangulation\";\r\n\r\nexport class GraphSplitData {\r\n  public numUpEdge = 0;\r\n  public numIntersectionTest = 0;\r\n  public numSplit = 0;\r\n  public numPopOut = 0;\r\n  public numA0B0 = 0;\r\n  public numA0B1 = 0;\r\n  public constructor() {\r\n  }\r\n}\r\n/**\r\n * Structure for data used when sorting outbound edges \"around a node\"\r\n */\r\nexport class VertexNeighborhoodSortData {\r\n  public index: number;\r\n  public radiusOfCurvature: number;\r\n  public node: HalfEdge;\r\n  public radians?: number;\r\n  public constructor(index: number, key: number, node: HalfEdge, radians?: number) {\r\n    this.index = index;\r\n    this.radiusOfCurvature = key;\r\n    this.node = node;\r\n    this.radians = radians;\r\n  }\r\n}\r\n\r\n/** Function signature for announcing a vertex neighborhood during sorting. */\r\nexport type AnnounceVertexNeighborhoodSortData = (data: VertexNeighborhoodSortData[]) => any;\r\n/**\r\n * * Assorted methods used in algorithms on HalfEdgeGraph.\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphOps {\r\n\r\n  /** Compare function for sorting with primary y compare, secondary  x compare. */\r\n  public static compareNodesYXUp(a: HalfEdge, b: HalfEdge) {\r\n    // Check y's\r\n    // if (!Geometry.isSameCoordinate(a.y, b.y))\r\n    if (a.y < b.y)\r\n      return -1;\r\n    else if (a.y > b.y)\r\n      return 1;\r\n    // Check x's\r\n    // if (!Geometry.isSameCoordinate(a.x, b.x))\r\n    if (a.x < b.x)\r\n      return -1;\r\n    else if (a.x > b.x)\r\n      return 1;\r\n    return 0;\r\n  }\r\n\r\n  /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */\r\n  public static isDownPeak(nodeB: HalfEdge) {\r\n    const nodeA = nodeB.facePredecessor;\r\n    const nodeC = nodeB.faceSuccessor;\r\n    return this.compareNodesYXUp(nodeB, nodeA) < 0\r\n      && this.compareNodesYXUp(nodeB, nodeC) < 0\r\n      && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;\r\n  }\r\n\r\n  /** return the cross product of vectors from base to targetA and base to targetB\r\n   * @param base base vertex of both vectors.\r\n   * @param targetA target vertex of first vector\r\n   * @param targetB target vertex of second vector\r\n   */\r\n  public static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number {\r\n    return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);\r\n  }\r\n\r\n  // ---------------------------------------------------------------------------------------------------------------------\r\n  // ----------------------------------------------------------------------------------------------------------------------\r\n\r\n  public static graphRange(graph: HalfEdgeGraph): Range3d {\r\n    const range = Range3d.create();\r\n    for (const node of graph.allHalfEdges) {\r\n      range.extendXYZ(node.x, node.y, node.z);\r\n    }\r\n    return range;\r\n  }\r\n  /** Returns an array of all nodes (both ends) of edges created from segments. */\r\n  public static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[] {\r\n    const result = [];\r\n    let idxCounter = 0;\r\n\r\n    // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}\r\n    for (const segment of segments) {\r\n\r\n      const node0 = returnGraph.createEdgeXYZXYZ(\r\n        segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z,\r\n        idxCounter,\r\n        segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z,\r\n        idxCounter + 1);\r\n\r\n      const node1 = node0.edgeMate;\r\n      idxCounter += 2;\r\n\r\n      node0.setMaskAroundFace(mask);   // Original given coordinates must be part of boundary\r\n      result.push(node0);\r\n      result.push(node1);\r\n    }\r\n\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * Visit all nodes in `graph`.\r\n   * * invoke `pinch(node, vertexPredecessor)`\r\n   * * this leaves the graph as isolated edges.\r\n   * @param graph graph to modify\r\n   */\r\n  public static isolateAllEdges(graph: HalfEdgeGraph) {\r\n    for (const nodeA of graph.allHalfEdges) {\r\n      const nodeB = nodeA.vertexPredecessor;\r\n      HalfEdge.pinch(nodeA, nodeB);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Compute convexity of a sector of a super-face.\r\n   * @param base node whose edge is to be tested for removal\r\n   * @param ignore edges with this mask (on either side) are ignored for the purposes of computing convexity\r\n   * @param barrier edges with this mask (on either side) will not be removed\r\n   * @return whether removing the edge at base would create a convex sector in the super-face\r\n   */\r\n  private static isSectorConvexAfterEdgeRemoval(base: HalfEdge, ignore: HalfEdgeMask, barrier: HalfEdgeMask): boolean {\r\n    let vs = base;\r\n    do { // loop ccw around vertex looking for a super-face predecessor\r\n      if (vs.isMaskSet(barrier) || vs.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vs = vs.vertexSuccessor;\r\n    } while (vs !== base && vs.isMaskSet(ignore));\r\n    if (vs === base)\r\n      return false;\r\n    let vp = base;\r\n    do { // loop cw around vertex looking for a super-face successor\r\n      if (vp.isMaskSet(barrier) || vp.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vp = vp.vertexPredecessor;\r\n    } while (vp !== base && vp.isMaskSet(ignore));\r\n    if (vp === base)\r\n      return false;\r\n    return HalfEdge.isSectorConvex(vs.edgeMate, base, vp.faceSuccessor);\r\n  }\r\n\r\n  /**\r\n   * Mask edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine and mark\r\n   * @param mark the mask used to mark (both sides of) removable edges\r\n   * @param barrier edges with this mask (on either side) will not be marked. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges masked (half the number of HalfEdges masked)\r\n   */\r\n  public static markRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, mark: HalfEdgeMask, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    if (HalfEdgeMask.NULL_MASK === mark)\r\n      return 0;\r\n    const visit = graph.grabMask(true);\r\n    let numMarked = 0;\r\n    for (const node of graph.allHalfEdges) {\r\n      if (!node.isMaskSet(visit)) {\r\n        if (!node.isMaskSet(barrier) && !node.edgeMate.isMaskSet(barrier)) {\r\n          if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier)) {\r\n            node.setMaskAroundEdge(mark);\r\n            ++numMarked;\r\n          }\r\n        }\r\n      }\r\n    node.setMaskAroundEdge(visit);\r\n    }\r\n    return numMarked;\r\n  }\r\n\r\n  /**\r\n   * Collect edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine\r\n   * @param barrier edges with this mask (on either side) will not be collected. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return one HalfEdge per removable edge\r\n   */\r\n  public static collectRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): HalfEdge[] | undefined {\r\n    const removable: HalfEdge[] = [];\r\n    const mark = graph.grabMask(true);\r\n    if (0 < this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier)) {\r\n      const visited = graph.grabMask(true);\r\n      for (const node of graph.allHalfEdges) {\r\n        if (node.isMaskSet(mark) && !node.isMaskSet(visited)) {\r\n          node.setMaskAroundEdge(visited);\r\n          removable.push(node);\r\n        }\r\n      }\r\n      graph.dropMask(visited);\r\n    }\r\n    graph.dropMask(mark);\r\n    return removable;\r\n  }\r\n\r\n  /**\r\n   * Remove edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to modify\r\n   * @param barrier edges with this mask (on either side) will not be removed. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges deleted\r\n   */\r\n  public static expandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    const mark = graph.grabMask(true);\r\n    const numRemovedEdges = this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier);\r\n    if (numRemovedEdges > 0)\r\n      graph.yankAndDeleteEdges((node: HalfEdge) => node.getMask(mark));\r\n    graph.dropMask(mark);\r\n    return numRemovedEdges;\r\n  }\r\n\r\n  /**\r\n   * Test desired faces for convexity.\r\n   * @param graph graph to examine\r\n   * @param avoid faces with this mask will not be examined. Defaults to HalfEdgeMask.EXTERIOR.\r\n   * @return whether every face in the graph is convex\r\n   */\r\n  public static isEveryFaceConvex(graph: HalfEdgeGraph, avoid: HalfEdgeMask = HalfEdgeMask.EXTERIOR): boolean {\r\n    const allFaces = graph.collectFaceLoops();\r\n    for (const node of allFaces) {\r\n      if (node.isMaskedAroundFace(avoid))\r\n        continue;\r\n      if (!node.isFaceConvex())\r\n        return false;\r\n      }\r\n    return true;\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphMerge {\r\n  // return kC <= kB such that stored angles (at extra data index 0 !) kA<=k<kC match.\r\n  // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC\r\n  public static getCommonThetaEndIndex(clusters: ClusterableArray, order: Uint32Array, kA: number, kB: number): number{\r\n    let kC = kA + 1;\r\n    const thetaA = clusters.getExtraData(order[kA], 0);\r\n    while (kC < kB) {\r\n      const thetaB = clusters.getExtraData(order[kC], 0);\r\n      if (!Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\r\n        return kC;\r\n      }\r\n     kC++;\r\n    }\r\n    return kC;\r\n  }\r\n  private static _announceVertexNeighborhoodFunction?: AnnounceVertexNeighborhoodSortData;\r\n/**\r\n * public property setter for a function to be called with sorted edge data around a vertex.\r\n */\r\n  public static set announceVertexNeighborhoodFunction(func: AnnounceVertexNeighborhoodSortData | undefined) { this._announceVertexNeighborhoodFunction = func; }\r\n  private static doAnnounceVertexNeighborhood(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    if (this._announceVertexNeighborhoodFunction) {\r\n      const sortData: VertexNeighborhoodSortData[] = [];\r\n      // build and share the entire vertex order\r\n      for (let k = k0; k < k1; k++){\r\n      const index = clusters.getExtraData(order[k], 1);\r\n      const theta = clusters.getExtraData(order[k], 0);\r\n      const node = allNodes[index];\r\n      const signedDistance = this.curvatureSortKey(node);\r\n      sortData.push(new VertexNeighborhoodSortData(order[k], signedDistance, node, theta));\r\n      }\r\n      this._announceVertexNeighborhoodFunction(sortData);\r\n    }\r\n\r\n  }\r\n  // assumptions about cluster array:\r\n  //   * data order is: x,y,theta, nodeIndex\r\n  //   * theta and nodeIndex are the \"extra\" data.\r\n  //   * only want to do anything here when curves are present.\r\n  //   * k0<=k<k1 are around a vertex\r\n  //   * These are sorted by theta.\r\n  private static secondarySortAroundVertex(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    const sortData: VertexNeighborhoodSortData[] = [];\r\n\r\n    for (let k = k0; k < k1;) {\r\n      const kB = this.getCommonThetaEndIndex(clusters, order,k, k1);\r\n      if (k + 1 < kB) {\r\n        sortData.length = 0;\r\n        for (let kA = k; kA < kB; kA++) {\r\n          const index = clusters.getExtraData(order[kA], 1);\r\n          const node = allNodes[index];\r\n          const signedDistance = this.curvatureSortKey(node);\r\n          sortData.push(new VertexNeighborhoodSortData(order[kA], signedDistance, node));\r\n        }\r\n        sortData.sort((a: VertexNeighborhoodSortData, b: VertexNeighborhoodSortData) => (a.radiusOfCurvature - b.radiusOfCurvature));\r\n        for (let i = 0; i < sortData.length; i++){\r\n          order[k + i] = sortData[i].index;\r\n        }\r\n      }\r\n      k = kB;\r\n    }\r\n  }\r\n  // Return the sort key for sorting by curvature.\r\n  // This is the signed distance from the curve to center of curvature.\r\n  // This should need to be upgraded to account for higher derivatives in the case of higher-than-tangent match.\r\n  private static curvatureSortKey(node: HalfEdge): number {\r\n    const cld = node.edgeTag as CurveLocationDetail;\r\n    if (cld !== undefined) {\r\n      const fraction = cld.fraction;\r\n      const curve = cld.curve;\r\n      if (curve) {\r\n        let radius = curve.fractionToSignedXYRadiusOfCurvature(fraction);\r\n        if (node.sortData !== undefined && node.sortData < 0)\r\n          radius = -radius;\r\n        return radius;\r\n      }\r\n    }\r\n    return 0.0;\r\n  }\r\n  /** Simplest merge algorithm:\r\n   * * collect array of (x,y,theta) at all nodes\r\n   * * lexical sort of the array.\r\n   * * twist all vertices together.\r\n   * * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.\r\n   * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.\r\n   * * Mask.NULL_FACE is cleared throughout and applied within null faces.\r\n   */\r\n  public static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number) {\r\n    const allNodes = graph.allHalfEdges;\r\n    const numNodes = allNodes.length;\r\n    graph.clearMask(HalfEdgeMask.NULL_FACE);\r\n    const clusters = new ClusterableArray(2, 2, numNodes);  // data order: x,y,theta, nodeIndex.  But theta is not set in first round.\r\n    for (let i = 0; i < numNodes; i++) {\r\n      const nodeA = allNodes[i];\r\n      const xA = nodeA.x;\r\n      const yA = nodeA.y;\r\n      HalfEdge.pinch(nodeA, nodeA.vertexSuccessor);  // pull it out of its current vertex loop.\r\n      clusters.addDirect(xA, yA, 0.0, i);\r\n    }\r\n    const order = clusters.clusterIndicesLexical();\r\n    let k0 = 0;\r\n    const numK = order.length;\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.\r\n        if (k1 > k0) {\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          const nodeA0 = allNodes[iA];\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            const nodeB = allNodes[iB];\r\n            nodeB.x = nodeA0.x;\r\n            nodeB.y = nodeA0.y;\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n    // NOW\r\n    //  1) There are identical coordinates at all nodes around each vertex loop.\r\n    //  2) Hence ready do sort (at each vertex) by theta.\r\n\r\n    // insert theta as extra data in the sort table . . .\r\n    for (const clusterTableIndex of order) {\r\n      if (clusterTableIndex !== ClusterableArray.clusterTerminator) {\r\n        const nodeA = allNodes[clusterTableIndex];\r\n        const nodeB = nodeA.faceSuccessor;\r\n        let radians = outboundRadiansFunction ? outboundRadiansFunction(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);\r\n        if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))\r\n          radians = Math.PI;\r\n        clusters.setExtraData(clusterTableIndex, 0, radians);\r\n      }\r\n    }\r\n    clusters.sortSubsetsBySingleKey(order, 2);\r\n    const unmatchedNullFaceNodes: HalfEdge[] = [];\r\n    k0 = 0;\r\n    let thetaA, thetaB;\r\n      // eslint-disable-next-line no-console\r\n      // console.log(\"START VERTEX LINKS\");\r\n\r\n    // now pinch each neighboring pair together\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.\r\n        if (k1 > k0) {\r\n          // const xy = clusters.getPoint2d(order[k0]);\r\n          // eslint-disable-next-line no-console\r\n          // console.log({ k0, k1, x: xy.x, y: xy.y });\r\n          if (k1 > k0 + 1)\r\n            this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1);\r\n          this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          thetaA = clusters.getExtraData(order[k0], 0);\r\n          const nodeA0 = allNodes[iA];\r\n          let nodeA = nodeA0;\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            thetaB = clusters.getExtraData(order[k], 0);\r\n            const nodeB = allNodes[iB];\r\n            if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              // nope, this edge was flagged and pinched from the other end.\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            } else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeB === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.\r\n            } else {\r\n              HalfEdge.pinch(nodeA, nodeB);\r\n              if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\r\n                const nodeA1 = nodeA.faceSuccessor;\r\n                const nodeB1 = nodeB.edgeMate;\r\n                // WE TRUST -- nodeA1 and node B1 must have identical xy.\r\n                // pinch them together and mark the face loop as null ..\r\n                HalfEdge.pinch(nodeA1, nodeB1);\r\n                nodeA.setMask(HalfEdgeMask.NULL_FACE);\r\n                nodeB1.setMask(HalfEdgeMask.NULL_FACE);\r\n                unmatchedNullFaceNodes.push(nodeB1);\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            }\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n  }\r\n\r\n  private static buildVerticalSweepPriorityQueue(graph: HalfEdgeGraph): HalfEdgePriorityQueueWithPartnerArray {\r\n    const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();\r\n    for (const p of graph.allHalfEdges) {\r\n\r\n      if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {\r\n        sweepHeap.priorityQueue.push(p);\r\n      }\r\n    }\r\n    return sweepHeap;\r\n  }\r\n  private static snapFractionToNode(xy: Point2d, fraction: number, node: HalfEdge, nodeFraction: number): number{\r\n    if (Geometry.isSameCoordinate(xy.x, node.x) && Geometry.isSameCoordinate(xy.y, node.y))\r\n      return nodeFraction;\r\n    return fraction;\r\n}\r\n  private static computeIntersectionFractionsOnEdges(nodeA0: HalfEdge, nodeB0: HalfEdge, fractions: Vector2d, pointA: Point2d, pointB: Point2d): boolean {\r\n    const nodeA1 = nodeA0.faceSuccessor;\r\n    const ax0 = nodeA0.x;\r\n    const ay0 = nodeA0.y;\r\n    const ux = nodeA1.x - ax0;\r\n    const uy = nodeA1.y - ay0;\r\n    const nodeB1 = nodeB0.faceSuccessor;\r\n    const bx0 = nodeB0.x;\r\n    const by0 = nodeB0.y;\r\n    const vx = nodeB1.x - bx0;\r\n    const vy = nodeB1.y - by0;\r\n    // cspell:word lineSegmentXYUVTransverseIntersectionUnbounded\r\n    if (SmallSystem.lineSegmentXYUVTransverseIntersectionUnbounded(ax0, ay0, ux, uy,\r\n      bx0, by0, vx, vy, fractions)) {\r\n      pointA.x = ax0 + fractions.x * ux;\r\n      pointA.y = ay0 + fractions.x * uy;\r\n      pointB.x = bx0 + fractions.y * vx;\r\n      pointB.y = by0 + fractions.y * vy;\r\n      fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA0, 0.0);\r\n      fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA1, 1.0);\r\n      fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB0, 0.0);\r\n      fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB1, 1.0);\r\n      return Geometry.isIn01(fractions.x) && Geometry.isIn01(fractions.y);\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Split edges at intersections.\r\n   * * This is a large operation.\r\n   * @param graph\r\n   */\r\n  public static splitIntersectingEdges(graph: HalfEdgeGraph): GraphSplitData {\r\n    const data = new GraphSplitData();\r\n    const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);\r\n    let nodeA0, nodeB1;\r\n    const smallFraction = 1.0e-8;\r\n    const largeFraction = 1.0 - smallFraction;\r\n    let i;\r\n    const fractions = Vector2d.create();\r\n    const pointA = Point2d.create();\r\n    const pointB = Point2d.create();\r\n    let nodeB0;\r\n    const popTolerance = Geometry.smallMetricDistance;\r\n    while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {\r\n      data.numUpEdge++;\r\n      const n0 = sweepHeap.activeEdges.length;\r\n      sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - popTolerance);\r\n      data.numPopOut += n0 - sweepHeap.activeEdges.length;\r\n      for (i = 0; i < sweepHeap.activeEdges.length; i++) {\r\n        nodeB0 = sweepHeap.activeEdges[i];\r\n        nodeB1 = nodeB0.faceSuccessor;\r\n        // const nodeB1 = nodeB0.faceSuccessor;\r\n        if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y)) {\r\n          data.numA0B0++;\r\n        } else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y)) {\r\n          data.numA0B1++;\r\n        } else {\r\n          data.numIntersectionTest++;\r\n          if (this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, fractions, pointA, pointB)) {\r\n            if (fractions.x > smallFraction && fractions.x < largeFraction) {\r\n              const nodeC0 = graph.splitEdgeAtFraction(nodeA0, fractions.x);\r\n              sweepHeap.priorityQueue.push(nodeC0);  // The upper portion will be reviewed as a nodeA0 later !!!\r\n              data.numSplit++;\r\n            }\r\n            if (fractions.y > smallFraction && fractions.y < largeFraction) {\r\n              const nodeD0 = graph.splitEdgeAtFraction(nodeB0, fractions.y);\r\n              sweepHeap.priorityQueue.push(nodeD0);  // The upper portion will be reviewed as a nodeA0 later !!!\r\n              data.numSplit++;\r\n            }\r\n            // existing nodeA0 and its shortened edge remain for further intersections\r\n          }\r\n        }\r\n      }\r\n      sweepHeap.activeEdges.push(nodeA0);\r\n    }\r\n    return data;\r\n  }\r\n\r\n  /**\r\n   * Returns a graph structure formed from the given LineSegment array\r\n   *\r\n   * *  Find all intersections among segments, and split them if necessary\r\n   * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up\r\n   *      vertices.\r\n   * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face\r\n   *      loops\r\n   */\r\n  public static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph {\r\n    // Structure of an index of the array: { xyTheta: Point3d, node: Node }\r\n    const graph = new HalfEdgeGraph();\r\n    HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * * Input is random linestrings, not necessarily loops\r\n   * * Graph gets full splitEdges, regularize, and triangulate.\r\n   * @returns triangulated graph, or undefined if bad data.\r\n   */\r\n  public static formGraphFromChains(chains: MultiLineStringDataVariant, regularize: boolean = true, mask: HalfEdgeMask = HalfEdgeMask.PRIMARY_EDGE): HalfEdgeGraph | undefined {\r\n    if (chains.length < 1)\r\n      return undefined;\r\n    const graph = new HalfEdgeGraph();\r\n    const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);\r\n    for (const seed of chainSeeds)\r\n      seed.setMaskAroundFace(mask);\r\n\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n    if (regularize) {\r\n      const context = new RegularizationContext(graph);\r\n      context.regularizeGraph(true, true);\r\n    }\r\n    return graph;\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"Merging.js","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,0CAAuC;AACvC,+CAA4C;AAC5C,mEAAkE;AAClE,+CAA8C;AAC9C,mEAAgE;AAChE,yDAAsD;AACtD,mCAAgE;AAChE,mEAAgF;AAChF,qDAAyD;AACzD,mDAA2E;AAE3E,MAAa,cAAc;IAOzB;QANO,cAAS,GAAG,CAAC,CAAC;QACd,wBAAmB,GAAG,CAAC,CAAC;QACxB,aAAQ,GAAG,CAAC,CAAC;QACb,cAAS,GAAG,CAAC,CAAC;QACd,YAAO,GAAG,CAAC,CAAC;QACZ,YAAO,GAAG,CAAC,CAAC;IAEnB,CAAC;CACF;AATD,wCASC;AACD;;GAEG;AACH,MAAa,0BAA0B;IAKrC,YAAmB,KAAa,EAAE,GAAW,EAAE,IAAc,EAAE,OAAgB;QAC7E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,GAAG,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAXD,gEAWC;AAID;;;GAGG;AACH,MAAa,gBAAgB;IAE3B,iFAAiF;IAC1E,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QACrD,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mIAAmI;IAC5H,MAAM,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACvC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAc,EAAE,OAAiB,EAAE,OAAiB;QACtF,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,wHAAwH;IACxH,yHAAyH;IAElH,MAAM,CAAC,UAAU,CAAC,KAAoB;QAC3C,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;SACzC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gFAAgF;IACzE,MAAM,CAAC,wBAAwB,CAAC,QAAyB,EAAE,WAA0B,EAAE,IAAkB;QAC9G,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,kFAAkF;QAClF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAE9B,MAAM,KAAK,GAAG,WAAW,CAAC,gBAAgB,CACxC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,EACV,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,GAAG,CAAC,CAAC,CAAC;YAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC7B,UAAU,IAAI,CAAC,CAAC;YAEhB,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAG,sDAAsD;YACvF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACpB;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE;YACtC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SAC9B;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,MAAoB,EAAE,OAAqB;QACvG,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,EAAE,8DAA8D;YACjE,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC;SACzB,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,EAAE,2DAA2D;YAC9D,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,iBAAiB,CAAC;SAC3B,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,OAAO,gBAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC;IACtE,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QAC9I,IAAI,oBAAY,CAAC,SAAS,KAAK,IAAI;YACjC,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;gBAC1B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE;oBACjE,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE;wBACjI,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBAC7B,EAAE,SAAS,CAAC;qBACb;iBACF;aACF;YACH,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,wCAAwC,CAAC,KAAoB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QAC7H,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE;YACxE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;gBACrC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE;oBACpD,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBACtB;aACF;YACD,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;SACzB;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QACtG,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACzF,IAAI,eAAe,GAAG,CAAC;YACrB,KAAK,CAAC,kBAAkB,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;QACnE,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,QAAsB,oBAAY,CAAC,QAAQ;QAC/F,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAChC,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACtB,OAAO,KAAK,CAAC;SACd;QACH,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAtMD,4CAsMC;AAED;;GAEG;AACH,MAAa,kBAAkB;IAC7B,uEAAuE;IACvE,uDAAuD;IACvD,+EAA+E;IACxE,MAAM,CAAC,sBAAsB,CAAC,QAA0B,EAAE,KAAkB,EAAE,EAAU,EAAE,EAAU;QACzG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,EAAE;YACd,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;gBAC/D,OAAO,EAAE,CAAC;aACX;YACF,EAAE,EAAE,CAAC;SACL;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAEH;;OAEG;IACM,MAAM,KAAK,kCAAkC,CAAC,IAAoD,IAAI,IAAI,CAAC,mCAAmC,GAAG,IAAI,CAAC,CAAC,CAAC;IACvJ,MAAM,CAAC,4BAA4B,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACtI,IAAI,IAAI,CAAC,mCAAmC,EAAE;YAC5C,MAAM,QAAQ,GAAiC,EAAE,CAAC;YAClD,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAC;gBAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;aACpF;YACD,IAAI,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;SACpD;IAEH,CAAC;IACD,mCAAmC;IACnC,yCAAyC;IACzC,gDAAgD;IAChD,6DAA6D;IAC7D,mCAAmC;IACnC,iCAAiC;IACzB,MAAM,CAAC,yBAAyB,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACnI,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAElD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE;gBACd,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE;oBAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;oBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC;iBAChF;gBACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAA6B,EAAE,CAA6B,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;gBAC7H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAC;oBACvC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;iBAClC;aACF;YACD,CAAC,GAAG,EAAE,CAAC;SACR;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAAc;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,OAA8B,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS,EAAE;YACrB,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,IAAI,KAAK,EAAE;gBACT,IAAI,MAAM,GAAG,KAAK,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;gBACjE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;oBAClD,MAAM,GAAG,CAAC,MAAM,CAAC;gBACnB,OAAO,MAAM,CAAC;aACf;SACF;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB,EAAE,uBAAkD;QAC3G,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,mCAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,yEAAyE;QACjI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAE,0CAA0C;YACzF,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;SACpC;QACD,MAAM,UAAU,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAChD,MAAM,KAAK,GAAG,QAAQ,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACzD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;YAChC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBACpD,sFAAsF;gBACtF,IAAI,EAAE,GAAG,EAAE,EAAE;oBACX,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACnB,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;qBACpB;iBACF;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACb;SACF;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE;YACrC,IAAI,iBAAiB,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,OAAO,GAAG,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1H,IAAI,aAAK,CAAC,oCAAoC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/D,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;aACtD;SACF;QACD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,sBAAsB,GAAe,EAAE,CAAC;QAC9C,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,MAAM,EAAE,MAAM,CAAC;QACjB,sCAAsC;QACtC,qCAAqC;QAEvC,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;YAChC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBACpD,kFAAkF;gBAClF,IAAI,EAAE,GAAG,EAAE,EAAE;oBACX,6CAA6C;oBAC7C,sCAAsC;oBACtC,6CAA6C;oBAC7C,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;wBACb,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrE,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,MAAM,CAAC;oBACnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE;4BAC3C,8DAA8D;4BAC9D,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE;gCACV,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;6BAC9B;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;yBACjB;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE;4BAClD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE;gCACV,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;6BAC9B;4BACD,6FAA6F;yBAC9F;6BAAM;4BACL,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAE7B,wCAAwC;4BACxC,wDAAwD;4BACxD,6CAA6C;4BAC7C,kDAAkD;4BAClD,8CAA8C;4BAC9C,IAAI,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;gCAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;oCAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,EAAG,kBAAkB;wCACtE,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;wCAC/B,KAAK,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;wCACtC,MAAM,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;wCACvC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qCACrC;iCACF;6BACF;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;yBACjB;qBACF;iBACF;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACb;SACF;IACH,CAAC;IAEO,MAAM,CAAC,+BAA+B,CAAC,KAAoB;QACjE,MAAM,SAAS,GAAG,IAAI,6DAAqC,EAAE,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE;YAElC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE;gBAC7D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACjC;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACO,MAAM,CAAC,kBAAkB,CAAC,EAAW,EAAE,QAAgB,EAAE,IAAc,EAAE,YAAoB;QACnG,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YACpF,OAAO,YAAY,CAAC;QACtB,OAAO,QAAQ,CAAC;IACpB,CAAC;IACS,MAAM,CAAC,mCAAmC,CAAC,MAAgB,EAAE,MAAgB,EAAE,SAAmB,EAAE,MAAe,EAAE,MAAe;QAC1I,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,6DAA6D;QAC7D,IAAI,yBAAW,CAAC,8CAA8C,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAC7E,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE;YAC9B,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,OAAO,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SACrE;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB;QACvD,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,aAAa,GAAG,MAAM,CAAC;QAC7B,MAAM,aAAa,GAAG,GAAG,GAAG,aAAa,CAAC;QAC1C,IAAI,CAAC,CAAC;QACN,MAAM,SAAS,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC;QACX,MAAM,YAAY,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAClD,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE;YAC7D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,SAAS,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;YACjE,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjD,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;gBAC9B,uCAAuC;gBACvC,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;oBACvE,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChB;qBAAM,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;oBAC9E,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChB;qBAAM;oBACL,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,IAAI,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE;wBACvF,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE;4BAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;4BAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,2DAA2D;4BAClG,IAAI,CAAC,QAAQ,EAAE,CAAC;yBACjB;wBACD,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE;4BAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;4BAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,2DAA2D;4BAClG,IAAI,CAAC,QAAQ,EAAE,CAAC;yBACjB;wBACD,0EAA0E;qBAC3E;iBACF;aACF;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SACpC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qBAAqB,CAAC,YAA6B;QAC/D,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,gBAAgB,CAAC,wBAAwB,CAAC,YAAY,EAAE,KAAK,EAAE,oBAAY,CAAC,aAAa,CAAC,CAAC;QAC3F,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAEnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAkC,EAAE,aAAsB,IAAI,EAAE,OAAqB,oBAAY,CAAC,YAAY;QAC9I,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,4BAAY,CAAC,iCAAiC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,KAAK,MAAM,IAAI,IAAI,UAAU;YAC3B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,EAAE;YACd,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF;AAxVD,gDAwVC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\r\nimport { SmallSystem } from \"../numerics/Polynomials\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { HalfEdgePriorityQueueWithPartnerArray } from \"./HalfEdgePriorityQueue\";\r\nimport { RegularizationContext } from \"./RegularizeFace\";\r\nimport { MultiLineStringDataVariant, Triangulator } from \"./Triangulation\";\r\n\r\nexport class GraphSplitData {\r\n  public numUpEdge = 0;\r\n  public numIntersectionTest = 0;\r\n  public numSplit = 0;\r\n  public numPopOut = 0;\r\n  public numA0B0 = 0;\r\n  public numA0B1 = 0;\r\n  public constructor() {\r\n  }\r\n}\r\n/**\r\n * Structure for data used when sorting outbound edges \"around a node\"\r\n */\r\nexport class VertexNeighborhoodSortData {\r\n  public index: number;\r\n  public radiusOfCurvature: number;\r\n  public node: HalfEdge;\r\n  public radians?: number;\r\n  public constructor(index: number, key: number, node: HalfEdge, radians?: number) {\r\n    this.index = index;\r\n    this.radiusOfCurvature = key;\r\n    this.node = node;\r\n    this.radians = radians;\r\n  }\r\n}\r\n\r\n/** Function signature for announcing a vertex neighborhood during sorting. */\r\nexport type AnnounceVertexNeighborhoodSortData = (data: VertexNeighborhoodSortData[]) => any;\r\n/**\r\n * * Assorted methods used in algorithms on HalfEdgeGraph.\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphOps {\r\n\r\n  /** Compare function for sorting with primary y compare, secondary  x compare. */\r\n  public static compareNodesYXUp(a: HalfEdge, b: HalfEdge) {\r\n    // Check y's\r\n    // if (!Geometry.isSameCoordinate(a.y, b.y))\r\n    if (a.y < b.y)\r\n      return -1;\r\n    else if (a.y > b.y)\r\n      return 1;\r\n    // Check x's\r\n    // if (!Geometry.isSameCoordinate(a.x, b.x))\r\n    if (a.x < b.x)\r\n      return -1;\r\n    else if (a.x > b.x)\r\n      return 1;\r\n    return 0;\r\n  }\r\n\r\n  /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */\r\n  public static isDownPeak(nodeB: HalfEdge) {\r\n    const nodeA = nodeB.facePredecessor;\r\n    const nodeC = nodeB.faceSuccessor;\r\n    return this.compareNodesYXUp(nodeB, nodeA) < 0\r\n      && this.compareNodesYXUp(nodeB, nodeC) < 0\r\n      && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;\r\n  }\r\n\r\n  /** return the cross product of vectors from base to targetA and base to targetB\r\n   * @param base base vertex of both vectors.\r\n   * @param targetA target vertex of first vector\r\n   * @param targetB target vertex of second vector\r\n   */\r\n  public static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number {\r\n    return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);\r\n  }\r\n\r\n  // ---------------------------------------------------------------------------------------------------------------------\r\n  // ----------------------------------------------------------------------------------------------------------------------\r\n\r\n  public static graphRange(graph: HalfEdgeGraph): Range3d {\r\n    const range = Range3d.create();\r\n    for (const node of graph.allHalfEdges) {\r\n      range.extendXYZ(node.x, node.y, node.z);\r\n    }\r\n    return range;\r\n  }\r\n  /** Returns an array of all nodes (both ends) of edges created from segments. */\r\n  public static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[] {\r\n    const result = [];\r\n    let idxCounter = 0;\r\n\r\n    // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}\r\n    for (const segment of segments) {\r\n\r\n      const node0 = returnGraph.createEdgeXYZXYZ(\r\n        segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z,\r\n        idxCounter,\r\n        segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z,\r\n        idxCounter + 1);\r\n\r\n      const node1 = node0.edgeMate;\r\n      idxCounter += 2;\r\n\r\n      node0.setMaskAroundFace(mask);   // Original given coordinates must be part of boundary\r\n      result.push(node0);\r\n      result.push(node1);\r\n    }\r\n\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * Visit all nodes in `graph`.\r\n   * * invoke `pinch(node, vertexPredecessor)`\r\n   * * this leaves the graph as isolated edges.\r\n   * @param graph graph to modify\r\n   */\r\n  public static isolateAllEdges(graph: HalfEdgeGraph) {\r\n    for (const nodeA of graph.allHalfEdges) {\r\n      const nodeB = nodeA.vertexPredecessor;\r\n      HalfEdge.pinch(nodeA, nodeB);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Compute convexity of a sector of a super-face.\r\n   * @param base node whose edge is to be tested for removal\r\n   * @param ignore edges with this mask (on either side) are ignored for the purposes of computing convexity\r\n   * @param barrier edges with this mask (on either side) will not be removed\r\n   * @return whether removing the edge at base would create a convex sector in the super-face\r\n   */\r\n  private static isSectorConvexAfterEdgeRemoval(base: HalfEdge, ignore: HalfEdgeMask, barrier: HalfEdgeMask): boolean {\r\n    let vs = base;\r\n    do { // loop ccw around vertex looking for a super-face predecessor\r\n      if (vs.isMaskSet(barrier) || vs.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vs = vs.vertexSuccessor;\r\n    } while (vs !== base && vs.isMaskSet(ignore));\r\n    if (vs === base)\r\n      return false;\r\n    let vp = base;\r\n    do { // loop cw around vertex looking for a super-face successor\r\n      if (vp.isMaskSet(barrier) || vp.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vp = vp.vertexPredecessor;\r\n    } while (vp !== base && vp.isMaskSet(ignore));\r\n    if (vp === base)\r\n      return false;\r\n    return HalfEdge.isSectorConvex(vs.edgeMate, base, vp.faceSuccessor);\r\n  }\r\n\r\n  /**\r\n   * Mask edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine and mark\r\n   * @param mark the mask used to mark (both sides of) removable edges\r\n   * @param barrier edges with this mask (on either side) will not be marked. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges masked (half the number of HalfEdges masked)\r\n   */\r\n  public static markRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, mark: HalfEdgeMask, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    if (HalfEdgeMask.NULL_MASK === mark)\r\n      return 0;\r\n    const visit = graph.grabMask(true);\r\n    let numMarked = 0;\r\n    for (const node of graph.allHalfEdges) {\r\n      if (!node.isMaskSet(visit)) {\r\n        if (!node.isMaskSet(barrier) && !node.edgeMate.isMaskSet(barrier)) {\r\n          if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier)) {\r\n            node.setMaskAroundEdge(mark);\r\n            ++numMarked;\r\n          }\r\n        }\r\n      }\r\n    node.setMaskAroundEdge(visit);\r\n    }\r\n    return numMarked;\r\n  }\r\n\r\n  /**\r\n   * Collect edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine\r\n   * @param barrier edges with this mask (on either side) will not be collected. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return one HalfEdge per removable edge\r\n   */\r\n  public static collectRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): HalfEdge[] | undefined {\r\n    const removable: HalfEdge[] = [];\r\n    const mark = graph.grabMask(true);\r\n    if (0 < this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier)) {\r\n      const visited = graph.grabMask(true);\r\n      for (const node of graph.allHalfEdges) {\r\n        if (node.isMaskSet(mark) && !node.isMaskSet(visited)) {\r\n          node.setMaskAroundEdge(visited);\r\n          removable.push(node);\r\n        }\r\n      }\r\n      graph.dropMask(visited);\r\n    }\r\n    graph.dropMask(mark);\r\n    return removable;\r\n  }\r\n\r\n  /**\r\n   * Remove edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to modify\r\n   * @param barrier edges with this mask (on either side) will not be removed. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges deleted\r\n   */\r\n  public static expandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    const mark = graph.grabMask(true);\r\n    const numRemovedEdges = this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier);\r\n    if (numRemovedEdges > 0)\r\n      graph.yankAndDeleteEdges((node: HalfEdge) => node.getMask(mark));\r\n    graph.dropMask(mark);\r\n    return numRemovedEdges;\r\n  }\r\n\r\n  /**\r\n   * Test desired faces for convexity.\r\n   * @param graph graph to examine\r\n   * @param avoid faces with this mask will not be examined. Defaults to HalfEdgeMask.EXTERIOR.\r\n   * @return whether every face in the graph is convex\r\n   */\r\n  public static isEveryFaceConvex(graph: HalfEdgeGraph, avoid: HalfEdgeMask = HalfEdgeMask.EXTERIOR): boolean {\r\n    const allFaces = graph.collectFaceLoops();\r\n    for (const node of allFaces) {\r\n      if (node.isMaskedAroundFace(avoid))\r\n        continue;\r\n      if (!node.isFaceConvex())\r\n        return false;\r\n      }\r\n    return true;\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphMerge {\r\n  // return kC such that all angles k are equal, with kA <= k < kC <= kB.\r\n  // * Assume: angles k are stored at extra data index 0.\r\n  // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC\r\n  public static getCommonThetaEndIndex(clusters: ClusterableArray, order: Uint32Array, kA: number, kB: number): number{\r\n    let kC = kA + 1;\r\n    const thetaA = clusters.getExtraData(order[kA], 0);\r\n    while (kC < kB) {\r\n      const thetaB = clusters.getExtraData(order[kC], 0);\r\n      if (!Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\r\n        return kC;\r\n      }\r\n     kC++;\r\n    }\r\n    return kC;\r\n  }\r\n  private static _announceVertexNeighborhoodFunction?: AnnounceVertexNeighborhoodSortData;\r\n/**\r\n * public property setter for a function to be called with sorted edge data around a vertex.\r\n */\r\n  public static set announceVertexNeighborhoodFunction(func: AnnounceVertexNeighborhoodSortData | undefined) { this._announceVertexNeighborhoodFunction = func; }\r\n  private static doAnnounceVertexNeighborhood(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    if (this._announceVertexNeighborhoodFunction) {\r\n      const sortData: VertexNeighborhoodSortData[] = [];\r\n      // build and share the entire vertex order\r\n      for (let k = k0; k < k1; k++){\r\n      const index = clusters.getExtraData(order[k], 1);\r\n      const theta = clusters.getExtraData(order[k], 0);\r\n      const node = allNodes[index];\r\n      const signedDistance = this.curvatureSortKey(node);\r\n      sortData.push(new VertexNeighborhoodSortData(order[k], signedDistance, node, theta));\r\n      }\r\n      this._announceVertexNeighborhoodFunction(sortData);\r\n    }\r\n\r\n  }\r\n  // assumptions about cluster array:\r\n  //   * data order is: x,y,theta,nodeIndex\r\n  //   * theta and nodeIndex are the \"extra\" data.\r\n  //   * only want to do anything here when curves are present.\r\n  //   * k0<=k<k1 are around a vertex\r\n  //   * These are sorted by theta.\r\n  private static secondarySortAroundVertex(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    const sortData: VertexNeighborhoodSortData[] = [];\r\n\r\n    for (let k = k0; k < k1;) {\r\n      const kB = this.getCommonThetaEndIndex(clusters, order,k, k1);\r\n      if (k + 1 < kB) {\r\n        sortData.length = 0;\r\n        for (let kA = k; kA < kB; kA++) {\r\n          const index = clusters.getExtraData(order[kA], 1);\r\n          const node = allNodes[index];\r\n          const signedDistance = this.curvatureSortKey(node);\r\n          sortData.push(new VertexNeighborhoodSortData(order[kA], signedDistance, node));\r\n        }\r\n        sortData.sort((a: VertexNeighborhoodSortData, b: VertexNeighborhoodSortData) => (a.radiusOfCurvature - b.radiusOfCurvature));\r\n        for (let i = 0; i < sortData.length; i++){\r\n          order[k + i] = sortData[i].index;\r\n        }\r\n      }\r\n      k = kB;\r\n    }\r\n  }\r\n  /** Return the sort key for sorting by curvature.\r\n   * * This is the signed distance from the curve at the edge start, to center of curvature.\r\n   * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.\r\n   */\r\n  public static curvatureSortKey(node: HalfEdge): number {\r\n    const cld = node.edgeTag as CurveLocationDetail;\r\n    if (cld !== undefined) {\r\n      const fraction = cld.fraction;\r\n      const curve = cld.curve;\r\n      if (curve) {\r\n        let radius = curve.fractionToSignedXYRadiusOfCurvature(fraction);\r\n        if (node.sortData !== undefined && node.sortData < 0)\r\n          radius = -radius;\r\n        return radius;\r\n      }\r\n    }\r\n    return 0.0;\r\n  }\r\n  /** Simplest merge algorithm:\r\n   * * collect array of (x,y,theta) at all nodes\r\n   * * lexical sort of the array.\r\n   * * twist all vertices together.\r\n   * * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.\r\n   * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.\r\n   * * Mask.NULL_FACE is cleared throughout and applied within null faces.\r\n   */\r\n  public static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number) {\r\n    const allNodes = graph.allHalfEdges;\r\n    const numNodes = allNodes.length;\r\n    graph.clearMask(HalfEdgeMask.NULL_FACE);\r\n    const clusters = new ClusterableArray(2, 2, numNodes);  // data order: x,y,theta,nodeIndex.  But theta is not set in first round.\r\n    for (let i = 0; i < numNodes; i++) {\r\n      const nodeA = allNodes[i];\r\n      const xA = nodeA.x;\r\n      const yA = nodeA.y;\r\n      HalfEdge.pinch(nodeA, nodeA.vertexSuccessor);  // pull it out of its current vertex loop.\r\n      clusters.addDirect(xA, yA, 0.0, i);\r\n    }\r\n    const clusterTol = Geometry.smallMetricDistance;\r\n    const order = clusters.clusterIndicesLexical(clusterTol);\r\n    let k0 = 0;\r\n    const numK = order.length;\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1-1] are at a vertex cluster; equate their xy\r\n        if (k1 > k0) {\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          const nodeA0 = allNodes[iA];\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            const nodeB = allNodes[iB];\r\n            nodeB.x = nodeA0.x;\r\n            nodeB.y = nodeA0.y;\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n    // NOW\r\n    //  1) There are identical coordinates at all nodes around each vertex loop.\r\n    //  2) Hence ready do sort (at each vertex) by theta.\r\n\r\n    // insert theta as extra data in the sort table . . .\r\n    for (const clusterTableIndex of order) {\r\n      if (clusterTableIndex !== ClusterableArray.clusterTerminator) {\r\n        const nodeA = allNodes[clusterTableIndex];\r\n        const nodeB = nodeA.faceSuccessor;\r\n        let radians = outboundRadiansFunction ? outboundRadiansFunction(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);\r\n        if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))\r\n          radians = Math.PI;\r\n        clusters.setExtraData(clusterTableIndex, 0, radians);\r\n      }\r\n    }\r\n    clusters.sortSubsetsBySingleKey(order, 2);\r\n    const unmatchedNullFaceNodes: HalfEdge[] = [];\r\n    k0 = 0;\r\n    let thetaA, thetaB;\r\n      // eslint-disable-next-line no-console\r\n      // console.log(\"START VERTEX LINKS\");\r\n\r\n    // now pinch each neighboring pair together\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1-1] are properly sorted around a vertex.\r\n        if (k1 > k0) {\r\n          // const xy = clusters.getPoint2d(order[k0]);\r\n          // eslint-disable-next-line no-console\r\n          // console.log({ k0, k1, x: xy.x, y: xy.y });\r\n          if (k1 > k0 + 1)\r\n            this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1);\r\n          this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          thetaA = clusters.getExtraData(order[k0], 0);\r\n          const nodeA0 = allNodes[iA];\r\n          let nodeA = nodeA0;\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            thetaB = clusters.getExtraData(order[k], 0);\r\n            const nodeB = allNodes[iB];\r\n            if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              // nope, this edge was flagged and pinched from the other end.\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            } else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeB === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.\r\n            } else {\r\n              HalfEdge.pinch(nodeA, nodeB);\r\n\r\n              // Detect null face using the heuristic:\r\n              //  * near vertex angles are same (periodic, toleranced)\r\n              //  * far vertex is clustered (exactly equal)\r\n              //  * near vertex curvatures are same (toleranced)\r\n              // Note that near vertex is already clustered.\r\n              if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\r\n                const nodeA1 = nodeA.faceSuccessor;\r\n                const nodeB1 = nodeB.edgeMate;\r\n                if (nodeA1.isEqualXY(nodeB1)) {\r\n                  const cA = this.curvatureSortKey(nodeA);\r\n                  const cB = this.curvatureSortKey(nodeB);\r\n                  if (Geometry.isSameCoordinate(cA, cB, clusterTol)) {  // rule out banana\r\n                    HalfEdge.pinch(nodeA1, nodeB1);\r\n                    nodeA.setMask(HalfEdgeMask.NULL_FACE);\r\n                    nodeB1.setMask(HalfEdgeMask.NULL_FACE);\r\n                    unmatchedNullFaceNodes.push(nodeB1);\r\n                  }\r\n                }\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            }\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n  }\r\n\r\n  private static buildVerticalSweepPriorityQueue(graph: HalfEdgeGraph): HalfEdgePriorityQueueWithPartnerArray {\r\n    const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();\r\n    for (const p of graph.allHalfEdges) {\r\n\r\n      if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {\r\n        sweepHeap.priorityQueue.push(p);\r\n      }\r\n    }\r\n    return sweepHeap;\r\n  }\r\n  private static snapFractionToNode(xy: Point2d, fraction: number, node: HalfEdge, nodeFraction: number): number{\r\n    if (Geometry.isSameCoordinate(xy.x, node.x) && Geometry.isSameCoordinate(xy.y, node.y))\r\n      return nodeFraction;\r\n    return fraction;\r\n}\r\n  private static computeIntersectionFractionsOnEdges(nodeA0: HalfEdge, nodeB0: HalfEdge, fractions: Vector2d, pointA: Point2d, pointB: Point2d): boolean {\r\n    const nodeA1 = nodeA0.faceSuccessor;\r\n    const ax0 = nodeA0.x;\r\n    const ay0 = nodeA0.y;\r\n    const ux = nodeA1.x - ax0;\r\n    const uy = nodeA1.y - ay0;\r\n    const nodeB1 = nodeB0.faceSuccessor;\r\n    const bx0 = nodeB0.x;\r\n    const by0 = nodeB0.y;\r\n    const vx = nodeB1.x - bx0;\r\n    const vy = nodeB1.y - by0;\r\n    // cspell:word lineSegmentXYUVTransverseIntersectionUnbounded\r\n    if (SmallSystem.lineSegmentXYUVTransverseIntersectionUnbounded(ax0, ay0, ux, uy,\r\n      bx0, by0, vx, vy, fractions)) {\r\n      pointA.x = ax0 + fractions.x * ux;\r\n      pointA.y = ay0 + fractions.x * uy;\r\n      pointB.x = bx0 + fractions.y * vx;\r\n      pointB.y = by0 + fractions.y * vy;\r\n      fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA0, 0.0);\r\n      fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA1, 1.0);\r\n      fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB0, 0.0);\r\n      fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB1, 1.0);\r\n      return Geometry.isIn01(fractions.x) && Geometry.isIn01(fractions.y);\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Split edges at intersections.\r\n   * * This is a large operation.\r\n   * @param graph\r\n   */\r\n  public static splitIntersectingEdges(graph: HalfEdgeGraph): GraphSplitData {\r\n    const data = new GraphSplitData();\r\n    const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);\r\n    let nodeA0, nodeB1;\r\n    const smallFraction = 1.0e-8;\r\n    const largeFraction = 1.0 - smallFraction;\r\n    let i;\r\n    const fractions = Vector2d.create();\r\n    const pointA = Point2d.create();\r\n    const pointB = Point2d.create();\r\n    let nodeB0;\r\n    const popTolerance = Geometry.smallMetricDistance;\r\n    while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {\r\n      data.numUpEdge++;\r\n      const n0 = sweepHeap.activeEdges.length;\r\n      sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - popTolerance);\r\n      data.numPopOut += n0 - sweepHeap.activeEdges.length;\r\n      for (i = 0; i < sweepHeap.activeEdges.length; i++) {\r\n        nodeB0 = sweepHeap.activeEdges[i];\r\n        nodeB1 = nodeB0.faceSuccessor;\r\n        // const nodeB1 = nodeB0.faceSuccessor;\r\n        if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y)) {\r\n          data.numA0B0++;\r\n        } else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y)) {\r\n          data.numA0B1++;\r\n        } else {\r\n          data.numIntersectionTest++;\r\n          if (this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, fractions, pointA, pointB)) {\r\n            if (fractions.x > smallFraction && fractions.x < largeFraction) {\r\n              const nodeC0 = graph.splitEdgeAtFraction(nodeA0, fractions.x);\r\n              sweepHeap.priorityQueue.push(nodeC0);  // The upper portion will be reviewed as a nodeA0 later !!!\r\n              data.numSplit++;\r\n            }\r\n            if (fractions.y > smallFraction && fractions.y < largeFraction) {\r\n              const nodeD0 = graph.splitEdgeAtFraction(nodeB0, fractions.y);\r\n              sweepHeap.priorityQueue.push(nodeD0);  // The upper portion will be reviewed as a nodeA0 later !!!\r\n              data.numSplit++;\r\n            }\r\n            // existing nodeA0 and its shortened edge remain for further intersections\r\n          }\r\n        }\r\n      }\r\n      sweepHeap.activeEdges.push(nodeA0);\r\n    }\r\n    return data;\r\n  }\r\n\r\n  /**\r\n   * Returns a graph structure formed from the given LineSegment array\r\n   *\r\n   * *  Find all intersections among segments, and split them if necessary\r\n   * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up\r\n   *      vertices.\r\n   * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face\r\n   *      loops\r\n   */\r\n  public static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph {\r\n    // Structure of an index of the array: { xyTheta: Point3d, node: Node }\r\n    const graph = new HalfEdgeGraph();\r\n    HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * * Input is random linestrings, not necessarily loops\r\n   * * Graph gets full splitEdges, regularize, and triangulate.\r\n   * @returns triangulated graph, or undefined if bad data.\r\n   */\r\n  public static formGraphFromChains(chains: MultiLineStringDataVariant, regularize: boolean = true, mask: HalfEdgeMask = HalfEdgeMask.PRIMARY_EDGE): HalfEdgeGraph | undefined {\r\n    if (chains.length < 1)\r\n      return undefined;\r\n    const graph = new HalfEdgeGraph();\r\n    const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);\r\n    for (const seed of chainSeeds)\r\n      seed.setMaskAroundFace(mask);\r\n\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n    if (regularize) {\r\n      const context = new RegularizationContext(graph);\r\n      context.regularizeGraph(true, true);\r\n    }\r\n    return graph;\r\n  }\r\n\r\n}\r\n"]}

package/lib/cjs/topology/SpaceTriangulation.d.ts

@@ -0,0 +1,47 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+import { LineString3d } from "../curve/LineString3d";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+declare type AnnounceLoopAndTrianglesFunction = (loop: Point3d[], triangles: Point3d[][]) => void;
+/**
+ * Class with static methods to triangulate various forms of possibly non-planar polygons.
+ * @public
+ */
+export declare class SpacePolygonTriangulation {
+    /**
+     * * Return a number which is:
+     *   * 0 for collapsed (zero area) triangle
+     *   * positive for non-zero area
+     *   * larger is "better"
+     * * Specifically, return (if well defined) the area divided by summed squares of edge lengths.
+     * @param point0
+     * @param point1
+     * @param point2
+     */
+    static spaceTriangleAspectRatio(point0: Point3d, point1: Point3d, point2: Point3d): number;
+    /**
+     * * Treat a space quad as two triangles with interior diagonal from point0 to point2
+     * * Return the smaller of the aspect ratios of the two triangles.
+     * * The quad edges proceed in the order [point0, point1, point2, point3]
+     * @param point0 first point of quad
+     * @param point1 second point of quad (diagonally opposite of point3)
+     * @param point2 third point (diagonally opposite point0)
+     * @param point3 fourth point
+     */
+    static spaceQuadDiagonalAspectRatio(point0: Point3d, point1: Point3d, point2: Point3d, point3: Point3d): number;
+    /** "Triangulate" by cutting of the ear with best aspect ratio.  Reject if successive normals have negative dot product with PolygonOps.AreaNormal */
+    static triangulateGreedyEarCut(points: Point3d[], announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction): boolean;
+    private static triangulateSimplestSpaceLoopGo;
+    /**
+     * * Emit triangles for a (possibly non-planar) loop for various simple cases:
+     *    * only 3 points: just emit that triangle.
+     *    * only 4 points: split across a diagonal, choosing the one with better aspect ratios of its two triangles.
+     * * BUT
+     *    * do not complete the triangulation if perimeter is larger than maxPerimeter (i.e. only consider small areas)
+     * * Hence it is expected that the caller will use this as the first attempt, possibly followed by calls to other more adventurous methods.
+     */
+    static triangulateSimplestSpaceLoop(loop: Point3d[] | LineString3d, announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction, maxPerimeter?: number): boolean;
+}
+export {};
+//# sourceMappingURL=SpaceTriangulation.d.ts.map

package/lib/cjs/topology/SpaceTriangulation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SpaceTriangulation.d.ts","sourceRoot":"","sources":["../../../src/topology/SpaceTriangulation.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAErD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAIxD,aAAK,gCAAgC,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,KAAK,IAAI,CAAC;AAE1F;;;GAGG;AACH,qBAAa,yBAAyB;IAEpC;;;;;;;;;OASG;WACW,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM;IAMjG;;;;;;;;OAQG;WACW,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM;IAKtH,qJAAqJ;WACvI,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,wBAAwB,EAAE,gCAAgC,GAAG,OAAO;IAsC7H,OAAO,CAAC,MAAM,CAAC,8BAA8B;IA8B7C;;;;;;;OAOG;WACW,4BAA4B,CAAC,IAAI,EAAE,OAAO,EAAG,GAAG,YAAY,EACxE,wBAAwB,EAAE,gCAAgC,EAC1D,YAAY,CAAC,EAAE,MAAM,GAAG,OAAO;CAOlC"}

package/lib/cjs/topology/SpaceTriangulation.js

@@ -0,0 +1,135 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SpacePolygonTriangulation = void 0;
+/** @packageDocumentation
+ * @module Topology
+ */
+const LineString3d_1 = require("../curve/LineString3d");
+const Geometry_1 = require("../Geometry");
+const PointHelpers_1 = require("../geometry3d/PointHelpers");
+const PolygonOps_1 = require("../geometry3d/PolygonOps");
+const PolylineOps_1 = require("../geometry3d/PolylineOps");
+/**
+ * Class with static methods to triangulate various forms of possibly non-planar polygons.
+ * @public
+ */
+class SpacePolygonTriangulation {
+    /**
+     * * Return a number which is:
+     *   * 0 for collapsed (zero area) triangle
+     *   * positive for non-zero area
+     *   * larger is "better"
+     * * Specifically, return (if well defined) the area divided by summed squares of edge lengths.
+     * @param point0
+     * @param point1
+     * @param point2
+     */
+    static spaceTriangleAspectRatio(point0, point1, point2) {
+        const crossProduct = point0.crossProductToPoints(point1, point2);
+        const area = 0.5 * crossProduct.magnitude();
+        const summedEdgeSquares = point0.distanceSquared(point1) + point1.distanceSquared(point2) + point2.distanceSquared(point0);
+        return Geometry_1.Geometry.safeDivideFraction(area, summedEdgeSquares, 0.0);
+    }
+    /**
+     * * Treat a space quad as two triangles with interior diagonal from point0 to point2
+     * * Return the smaller of the aspect ratios of the two triangles.
+     * * The quad edges proceed in the order [point0, point1, point2, point3]
+     * @param point0 first point of quad
+     * @param point1 second point of quad (diagonally opposite of point3)
+     * @param point2 third point (diagonally opposite point0)
+     * @param point3 fourth point
+     */
+    static spaceQuadDiagonalAspectRatio(point0, point1, point2, point3) {
+        const q012 = this.spaceTriangleAspectRatio(point0, point1, point2);
+        const q023 = this.spaceTriangleAspectRatio(point0, point2, point3);
+        return Math.max(q012, q023);
+    }
+    /** "Triangulate" by cutting of the ear with best aspect ratio.  Reject if successive normals have negative dot product with PolygonOps.AreaNormal */
+    static triangulateGreedyEarCut(points, announceLoopAndTriangles) {
+        const normalA = PolygonOps_1.PolygonOps.areaNormal(points);
+        const triangles = [];
+        const myPoints = points.slice();
+        PolylineOps_1.PolylineOps.removeClosurePoint(myPoints);
+        // first pass deals with entire array.
+        // each pass lops off one point.
+        for (; myPoints.length > 2;) {
+            // Find the ear candidate whose cross product vector has largest dot product (large area, best alignment with overall).
+            let bestRatio = -1.0;
+            let bestRatioIndex0 = 0;
+            let i0 = myPoints.length - 2;
+            let i1 = myPoints.length - 1;
+            let i2;
+            for (i2 = 0; i2 < myPoints.length; i0 = i1, i1 = i2, i2++) {
+                const ratio = this.spaceTriangleAspectRatio(myPoints[i0], myPoints[i1], myPoints[i2]);
+                const normalB = myPoints[i0].crossProductToPoints(myPoints[i1], myPoints[i2]);
+                if (normalB.dotProduct(normalA) > 0 && ratio > bestRatio) {
+                    bestRatio = ratio;
+                    bestRatioIndex0 = i0;
+                }
+            }
+            if (bestRatio <= 0.0)
+                return false;
+            // add the ear to the result
+            i0 = bestRatioIndex0;
+            i1 = (i0 + 1) % myPoints.length;
+            i2 = (i1 + 1) % myPoints.length;
+            const t = [];
+            t.push(myPoints[i0], myPoints[i1], myPoints[i2]);
+            // remove the middle point
+            myPoints.splice(i1, 1);
+            triangles.push(t);
+        }
+        announceLoopAndTriangles(points, triangles);
+        return true;
+    }
+    static triangulateSimplestSpaceLoopGo(points, announceLoopAndTriangles, maxPerimeter) {
+        const n = PointHelpers_1.Point3dArray.countNonDuplicates(points);
+        if (maxPerimeter !== undefined && PointHelpers_1.Point3dArray.sumEdgeLengths(points, true, n) > maxPerimeter)
+            return false;
+        if (n < 3)
+            return false;
+        if (n === 3) {
+            if (this.spaceTriangleAspectRatio(points[0], points[1], points[2]) === 0)
+                return false;
+            // already a triangle . . .
+            announceLoopAndTriangles(points, [points.slice()]);
+            return true;
+        }
+        if (n === 4) {
+            const d02 = this.spaceQuadDiagonalAspectRatio(points[0], points[1], points[2], points[3]);
+            const d13 = this.spaceQuadDiagonalAspectRatio(points[1], points[2], points[3], points[0]);
+            if (d02 === 0.0 && d13 === 0.0)
+                return false;
+            // announce the two triangles with better aspect ratios ....
+            if (d02 > d13) {
+                announceLoopAndTriangles(points, [[points[0], points[1], points[2]], [points[2], points[3], points[0]]]);
+                return true;
+            }
+            else {
+                announceLoopAndTriangles(points, [[points[0], points[1], points[3]], [points[3], points[1], points[2]]]);
+                return true;
+            }
+        }
+        return this.triangulateGreedyEarCut(points, announceLoopAndTriangles);
+    }
+    /**
+     * * Emit triangles for a (possibly non-planar) loop for various simple cases:
+     *    * only 3 points: just emit that triangle.
+     *    * only 4 points: split across a diagonal, choosing the one with better aspect ratios of its two triangles.
+     * * BUT
+     *    * do not complete the triangulation if perimeter is larger than maxPerimeter (i.e. only consider small areas)
+     * * Hence it is expected that the caller will use this as the first attempt, possibly followed by calls to other more adventurous methods.
+     */
+    static triangulateSimplestSpaceLoop(loop, announceLoopAndTriangles, maxPerimeter) {
+        if (loop instanceof LineString3d_1.LineString3d)
+            return this.triangulateSimplestSpaceLoopGo(loop.points, announceLoopAndTriangles, maxPerimeter);
+        // (array case by exhaustion)
+        return this.triangulateSimplestSpaceLoopGo(loop, announceLoopAndTriangles, maxPerimeter);
+    }
+}
+exports.SpacePolygonTriangulation = SpacePolygonTriangulation;
+//# sourceMappingURL=SpaceTriangulation.js.map

package/lib/cjs/topology/SpaceTriangulation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SpaceTriangulation.js","sourceRoot":"","sources":["../../../src/topology/SpaceTriangulation.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,wDAAqD;AACrD,0CAAuC;AAEvC,6DAA0D;AAC1D,yDAAoD;AACpD,2DAAsD;AAGtD;;;GAGG;AACH,MAAa,yBAAyB;IAEpC;;;;;;;;;OASG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe;QACpF,MAAM,YAAY,GAAG,MAAM,CAAC,oBAAoB,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,GAAG,GAAG,YAAY,CAAC,SAAS,EAAG,CAAC;QAC7C,MAAM,iBAAiB,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,CAAC;QAC9H,OAAO,mBAAQ,CAAC,kBAAkB,CAAE,IAAI,EAAE,iBAAiB,EAAE,GAAG,CAAC,CAAC;IACtE,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,4BAA4B,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe,EAAE,MAAe;QAC3G,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpE,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC,GAAG,CAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD,qJAAqJ;IAC9I,MAAM,CAAC,uBAAuB,CAAC,MAAiB,EAAE,wBAA0D;QACjH,MAAM,OAAO,GAAG,uBAAU,CAAC,UAAU,CAAE,MAAM,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QACjC,yBAAW,CAAC,kBAAkB,CAAE,QAAQ,CAAC,CAAC;QAC1C,sCAAsC;QACtC,gCAAgC;QAChC,OAAM,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAE;YACzB,uHAAuH;YACvH,IAAI,SAAS,GAAG,CAAC,GAAG,CAAC;YACrB,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,IAAI,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,IAAI,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAC;gBACxD,MAAM,KAAK,GAAG,IAAI,CAAC,wBAAwB,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvF,MAAM,OAAO,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,oBAAoB,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/E,IAAI,OAAO,CAAC,UAAU,CAAE,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,SAAS,EAAC;oBACxD,SAAS,GAAG,KAAK,CAAC;oBAClB,eAAe,GAAG,EAAE,CAAC;iBACtB;aACF;YACD,IAAI,SAAS,IAAI,GAAG;gBAClB,OAAO,KAAK,CAAC;YACf,4BAA4B;YAC5B,EAAE,GAAG,eAAe,CAAC;YACrB,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAChC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAChC,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,CAAC,CAAC,IAAI,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,0BAA0B;YAC1B,QAAQ,CAAC,MAAM,CAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACxB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACnB;QACD,wBAAwB,CAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,MAAM,CAAC,8BAA8B,CAAC,MAAiB,EAAE,wBAA0D,EACzH,YAAgC;QAChC,MAAM,CAAC,GAAG,2BAAY,CAAC,kBAAkB,CAAE,MAAM,CAAC,CAAC;QACrD,IAAI,YAAY,KAAK,SAAS,IAAI,2BAAY,CAAC,cAAc,CAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,YAAY;YAC1F,OAAO,KAAK,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,EAAC;YACV,IAAI,IAAI,CAAC,wBAAwB,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvE,OAAO,KAAK,CAAC;YACf,2BAA2B;YAC3B,wBAAwB,CAAE,MAAM,EAAE,CAAC,MAAM,CAAC,KAAK,EAAG,CAAC,CAAC,CAAC;YACrD,OAAO,IAAI,CAAC;SACb;QACD,IAAI,CAAC,KAAK,CAAC,EAAC;YACV,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG;gBAC5B,OAAO,KAAK,CAAC;YACf,4DAA4D;YAC5D,IAAI,GAAG,GAAG,GAAG,EAAC;gBACZ,wBAAwB,CAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1G,OAAO,IAAI,CAAC;aACb;iBAAM;gBACL,wBAAwB,CAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1G,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,IAAI,CAAC,uBAAuB,CAAE,MAAM,EAAE,wBAAwB,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,4BAA4B,CAAC,IAA+B,EACxE,wBAA0D,EAC1D,YAAqB;QACrB,IAAI,IAAI,YAAY,2BAAY;YAC9B,OAAO,IAAI,CAAC,8BAA8B,CAAE,IAAI,CAAC,MAAM,EAAE,wBAAwB,EAAE,YAAY,CAAC,CAAC;QACjG,6BAA6B;QAC/B,OAAO,IAAI,CAAC,8BAA8B,CAAE,IAAI,EAAE,wBAAwB,EAAE,YAAY,CAAC,CAAC;IAC5F,CAAC;CAEF;AAtHD,8DAsHC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Point3dArray } from \"../geometry3d/PointHelpers\";\r\nimport {PolygonOps} from \"../geometry3d/PolygonOps\";\r\nimport {PolylineOps} from \"../geometry3d/PolylineOps\";\r\ntype AnnounceLoopAndTrianglesFunction = (loop: Point3d[], triangles: Point3d[][]) => void;\r\n\r\n/**\r\n * Class with static methods to triangulate various forms of possibly non-planar polygons.\r\n * @public\r\n */\r\nexport class SpacePolygonTriangulation {\r\n\r\n  /**\r\n   * * Return a number which is:\r\n   *   * 0 for collapsed (zero area) triangle\r\n   *   * positive for non-zero area\r\n   *   * larger is \"better\"\r\n   * * Specifically, return (if well defined) the area divided by summed squares of edge lengths.\r\n   * @param point0\r\n   * @param point1\r\n   * @param point2\r\n   */\r\n  public static spaceTriangleAspectRatio(point0: Point3d, point1: Point3d, point2: Point3d): number {\r\n      const crossProduct = point0.crossProductToPoints (point1, point2);\r\n      const area = 0.5 * crossProduct.magnitude ();\r\n      const summedEdgeSquares = point0.distanceSquared (point1) + point1.distanceSquared (point2) + point2.distanceSquared (point0);\r\n      return Geometry.safeDivideFraction (area, summedEdgeSquares, 0.0);\r\n  }\r\n  /**\r\n   * * Treat a space quad as two triangles with interior diagonal from point0 to point2\r\n   * * Return the smaller of the aspect ratios of the two triangles.\r\n   * * The quad edges proceed in the order [point0, point1, point2, point3]\r\n   * @param point0 first point of quad\r\n   * @param point1 second point of quad (diagonally opposite of point3)\r\n   * @param point2 third point (diagonally opposite point0)\r\n   * @param point3 fourth point\r\n   */\r\n  public static spaceQuadDiagonalAspectRatio(point0: Point3d, point1: Point3d, point2: Point3d, point3: Point3d): number{\r\n    const q012 = this.spaceTriangleAspectRatio (point0, point1, point2);\r\n    const q023 = this.spaceTriangleAspectRatio (point0, point2, point3);\r\n    return Math.max (q012, q023);\r\n  }\r\n  /** \"Triangulate\" by cutting of the ear with best aspect ratio.  Reject if successive normals have negative dot product with PolygonOps.AreaNormal */\r\n  public static triangulateGreedyEarCut(points: Point3d[], announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction): boolean{\r\n    const normalA = PolygonOps.areaNormal (points);\r\n    const triangles: Point3d[][] = [];\r\n    const myPoints = points.slice ();\r\n    PolylineOps.removeClosurePoint (myPoints);\r\n    // first pass deals with entire array.\r\n    // each pass lops off one point.\r\n    for (;myPoints.length > 2;){\r\n      // Find the ear candidate whose cross product vector has largest dot product (large area, best alignment with overall).\r\n      let bestRatio = -1.0;\r\n      let bestRatioIndex0 = 0;\r\n      let i0 = myPoints.length - 2;\r\n      let i1 = myPoints.length - 1;\r\n      let i2;\r\n      for (i2 = 0; i2 < myPoints.length; i0 = i1, i1 = i2, i2++){\r\n        const ratio = this.spaceTriangleAspectRatio (myPoints[i0], myPoints[i1], myPoints[i2]);\r\n        const normalB = myPoints[i0].crossProductToPoints (myPoints[i1], myPoints[i2]);\r\n        if (normalB.dotProduct (normalA) > 0 && ratio > bestRatio){\r\n          bestRatio = ratio;\r\n          bestRatioIndex0 = i0;\r\n        }\r\n      }\r\n      if (bestRatio <= 0.0)\r\n        return false;\r\n      // add the ear to the result\r\n      i0 = bestRatioIndex0;\r\n      i1 = (i0 + 1) % myPoints.length;\r\n      i2 = (i1 + 1) % myPoints.length;\r\n      const t = [];\r\n      t.push (myPoints[i0], myPoints[i1], myPoints[i2]);\r\n      // remove the middle point\r\n      myPoints.splice (i1, 1);\r\n      triangles.push(t);\r\n    }\r\n    announceLoopAndTriangles (points, triangles);\r\n    return true;\r\n  }\r\n\r\n  private static triangulateSimplestSpaceLoopGo(points: Point3d[], announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction,\r\n    maxPerimeter: number | undefined): boolean{\r\n    const n = Point3dArray.countNonDuplicates (points);\r\n  if (maxPerimeter !== undefined && Point3dArray.sumEdgeLengths (points, true, n) > maxPerimeter)\r\n      return false;\r\n  if (n < 3)\r\n    return false;\r\n  if (n === 3){\r\n    if (this.spaceTriangleAspectRatio (points[0], points[1], points[2]) === 0)\r\n      return false;\r\n    // already a triangle . . .\r\n    announceLoopAndTriangles (points, [points.slice ()]);\r\n    return true;\r\n  }\r\n  if (n === 4){\r\n    const d02 = this.spaceQuadDiagonalAspectRatio (points[0], points[1], points[2], points[3]);\r\n    const d13 = this.spaceQuadDiagonalAspectRatio (points[1], points[2], points[3], points[0]);\r\n    if (d02 === 0.0 && d13 === 0.0)\r\n      return false;\r\n    // announce the two triangles with better aspect ratios ....\r\n    if (d02 > d13){\r\n      announceLoopAndTriangles (points, [[points[0], points[1], points[2]], [points[2], points[3], points[0]]]);\r\n      return true;\r\n    } else {\r\n      announceLoopAndTriangles (points, [[points[0], points[1], points[3]], [points[3], points[1], points[2]]]);\r\n      return true;\r\n    }\r\n  }\r\n  return this.triangulateGreedyEarCut (points, announceLoopAndTriangles);\r\n  }\r\n  /**\r\n   * * Emit triangles for a (possibly non-planar) loop for various simple cases:\r\n   *    * only 3 points: just emit that triangle.\r\n   *    * only 4 points: split across a diagonal, choosing the one with better aspect ratios of its two triangles.\r\n   * * BUT\r\n   *    * do not complete the triangulation if perimeter is larger than maxPerimeter (i.e. only consider small areas)\r\n   * * Hence it is expected that the caller will use this as the first attempt, possibly followed by calls to other more adventurous methods.\r\n   */\r\n  public static triangulateSimplestSpaceLoop(loop: Point3d [] | LineString3d,\r\n    announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction,\r\n    maxPerimeter?: number): boolean{\r\n    if (loop instanceof LineString3d)\r\n      return this.triangulateSimplestSpaceLoopGo (loop.points, announceLoopAndTriangles, maxPerimeter);\r\n      // (array case by exhaustion)\r\n    return this.triangulateSimplestSpaceLoopGo (loop, announceLoopAndTriangles, maxPerimeter);\r\n  }\r\n\r\n}\r\n"]}

package/lib/esm/clipping/ClipPrimitive.d.ts

@@ -83,8 +83,8 @@ export declare type ClipPrimitiveProps = ClipPrimitivePlanesProps | ClipPrimitiv
  *       * isMask === true means the plane sets should cover the outside of its polygon.
  *  * Note that the ClipShape's `isMask` property and the ClipPrimitive's `isInvisible` property are distinct controls.
  *     * In normal usage, callers get "outside" clip behavior using ONLY the ClipShape isMask property.
- *     * The ClipShape happens to pass the _invisible bit down to ClipPlane's that it creates.
- *         * At that level, it controls whether the cut edges are produce on the plane
+ *     * The ClipShape happens to pass the _invisible bit down to ClipPlanes that it creates.
+ *         * At that level, the flag controls whether the cut edges are produced on the plane
  *         * This seems like an confused overloading of the meaning.
  * @public
  */
@@ -104,7 +104,7 @@ export declare class ClipPrimitive implements Clipper {
     /**
      * Create a ClipPrimitive, capturing the supplied plane set as the clip planes.
      * @param planes clipper
-     * @param isInvisible true to invert sense of the test
+     * @param isInvisible set the invisible flag on the ClipPrimitive
      */
     static createCapture(planes: UnionOfConvexClipPlaneSets | ConvexClipPlaneSet | undefined, isInvisible?: boolean): ClipPrimitive;
     /** Emit json form of the clip planes */

package/lib/esm/clipping/ClipPrimitive.js

@@ -60,8 +60,8 @@ export var ClipMaskXYZRangePlanes;
  *       * isMask === true means the plane sets should cover the outside of its polygon.
  *  * Note that the ClipShape's `isMask` property and the ClipPrimitive's `isInvisible` property are distinct controls.
  *     * In normal usage, callers get "outside" clip behavior using ONLY the ClipShape isMask property.
- *     * The ClipShape happens to pass the _invisible bit down to ClipPlane's that it creates.
- *         * At that level, it controls whether the cut edges are produce on the plane
+ *     * The ClipShape happens to pass the _invisible bit down to ClipPlanes that it creates.
+ *         * At that level, the flag controls whether the cut edges are produced on the plane
  *         * This seems like an confused overloading of the meaning.
  * @public
  */
@@ -80,7 +80,7 @@ export class ClipPrimitive {
     /**
      * Create a ClipPrimitive, capturing the supplied plane set as the clip planes.
      * @param planes clipper
-     * @param isInvisible true to invert sense of the test
+     * @param isInvisible set the invisible flag on the ClipPrimitive
      */
     static createCapture(planes, isInvisible = false) {
         let planeData;