@itwin/core-geometry 4.9.0-dev.19 → 4.9.0-dev.20

package/lib/cjs/solid/SweepContour.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SweepContour.d.ts","sourceRoot":"","sources":["../../../src/solid/SweepContour.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,0BAA0B,EAAE,MAAM,wCAAwC,CAAC;AACpF,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAE3D,OAAO,EAAE,QAAQ,EAAa,MAAM,qBAAqB,CAAC;AAM1D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAChF,OAAO,EAAW,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAE9D;;;;GAIG;AACH,qBAAa,YAAY;IACvB,0EAA0E;IACnE,MAAM,EAAE,eAAe,CAAC;IAC/B,yEAAyE;IAClE,YAAY,EAAE,SAAS,CAAC;IAC/B,yCAAyC;IAClC,IAAI,EAAE,KAAK,GAAG,SAAS,CAAC;IAE/B,aAAa;IACb,OAAO,CAAC,UAAU,CAAC,CAAkB;IACrC,OAAO,CAAC,OAAO,CAAC,CAAkB;IAElC,OAAO;IAaP;;;OAGG;WACW,oBAAoB,CAAC,OAAO,EAAE,QAAQ,EAAE,aAAa,CAAC,EAAE,QAAQ,GAAG,YAAY,GAAG,SAAS;IAOzG;;;;OAIG;WACW,gBAAgB,CAAC,MAAM,EAAE,0BAA0B,EAAE,aAAa,CAAC,EAAE,QAAQ,GAAG,YAAY,GAAG,SAAS;IAqBtH;;;OAGG;WACW,iBAAiB,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,GAAG,YAAY,GAAG,SAAS;IAQzF,uCAAuC;IAChC,SAAS,IAAI,eAAe;IACnC;;;OAGG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAgBzD,2BAA2B;IACpB,KAAK,IAAI,YAAY;IAG5B,kCAAkC;IAC3B,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,YAAY,GAAG,SAAS;IAMvE,yDAAyD;IAClD,aAAa,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAezC,yDAAyD;IAClD,gBAAgB,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAStD,oCAAoC;IACpC,IAAW,SAAS,IAAI,eAAe,GAAG,SAAS,CAElD;IAED;;;;OAIG;IACI,WAAW,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAcjD;;;OAGG;IACI,WAAW;IAGlB;;OAEG;IACI,UAAU,CAAC,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS;IAKnF;;;;OAIG;IACI,cAAc,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,eAAe,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAKjG;;;;;;;;;OASG;IACI,iCAAiC,CAAC,WAAW,CAAC,EAAE,QAAQ,EAAE,IAAI,GAAE,OAAe,EAAE,IAAI,GAAE,OAAe,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,0BAA0B,GAAG,SAAS;CA8ChL"}
+{"version":3,"file":"SweepContour.d.ts","sourceRoot":"","sources":["../../../src/solid/SweepContour.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,0BAA0B,EAAE,MAAM,wCAAwC,CAAC;AACpF,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAE3D,OAAO,EAAE,QAAQ,EAAa,MAAM,qBAAqB,CAAC;AAM1D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAChF,OAAO,EAAW,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAE9D;;;;GAIG;AACH,qBAAa,YAAY;IACvB,0EAA0E;IACnE,MAAM,EAAE,eAAe,CAAC;IAC/B,yEAAyE;IAClE,YAAY,EAAE,SAAS,CAAC;IAC/B,yCAAyC;IAClC,IAAI,EAAE,KAAK,GAAG,SAAS,CAAC;IAE/B,aAAa;IACb,OAAO,CAAC,UAAU,CAAC,CAAkB;IACrC,OAAO,CAAC,OAAO,CAAC,CAAkB;IAElC,OAAO;IAaP;;;OAGG;WACW,oBAAoB,CAAC,OAAO,EAAE,QAAQ,EAAE,aAAa,CAAC,EAAE,QAAQ,GAAG,YAAY,GAAG,SAAS;IAOzG;;;;OAIG;WACW,gBAAgB,CAAC,MAAM,EAAE,0BAA0B,EAAE,aAAa,CAAC,EAAE,QAAQ,GAAG,YAAY,GAAG,SAAS;IAiBtH;;;OAGG;WACW,iBAAiB,CAAC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,GAAG,YAAY,GAAG,SAAS;IAQzF,uCAAuC;IAChC,SAAS,IAAI,eAAe;IACnC;;;OAGG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAgBzD,2BAA2B;IACpB,KAAK,IAAI,YAAY;IAG5B,kCAAkC;IAC3B,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,YAAY,GAAG,SAAS;IAMvE,yDAAyD;IAClD,aAAa,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAezC,yDAAyD;IAClD,gBAAgB,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAStD,oCAAoC;IACpC,IAAW,SAAS,IAAI,eAAe,GAAG,SAAS,CAElD;IAED;;;;OAIG;IACI,WAAW,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAcjD;;;OAGG;IACI,WAAW;IAGlB;;OAEG;IACI,UAAU,CAAC,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS;IAKnF;;;;OAIG;IACI,cAAc,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,eAAe,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAKjG;;;;;;;;;OASG;IACI,iCAAiC,CAAC,WAAW,CAAC,EAAE,QAAQ,EAAE,IAAI,GAAE,OAAe,EAAE,IAAI,GAAE,OAAe,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,0BAA0B,GAAG,SAAS;CA8ChL"}

package/lib/cjs/solid/SweepContour.js

@@ -58,10 +58,6 @@ class SweepContour {
     static createForPolygon(points, defaultNormal) {
         const localToWorld = FrameBuilder_1.FrameBuilder.createRightHandedFrame(defaultNormal, points);
         if (localToWorld) {
-            if (defaultNormal !== undefined) {
-                if (localToWorld.matrix.dotColumnZ(defaultNormal))
-                    localToWorld.matrix.scaleColumnsInPlace(1.0, -1.0, -1.0);
-            }
             const linestrings = LineString3d_1.LineString3d.createArrayOfLineString3d(points);
             const loops = [];
             for (const ls of linestrings) {

package/lib/cjs/solid/SweepContour.js.map

@@ -1 +1 @@
-{"version":3,"file":"SweepContour.js","sourceRoot":"","sources":["../../../src/solid/SweepContour.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,qDAAkD;AAClD,uEAAoE;AACpE,uFAAoF;AAEpF,4DAAyD;AAEzD,wDAAqD;AACrD,wCAAqC;AACrC,wDAAqD;AACrD,wCAAqC;AACrC,kDAA+C;AAC/C,0DAAuD;AACvD,6DAA0D;AAE1D,mEAAkE;AAMlE;;;;GAIG;AACH,MAAa,YAAY;IAYvB,YAAoB,OAAiB,EAAE,GAAc,EAAE,IAAuB;QAC5E,IAAI,OAAO,YAAY,+BAAc,EAAE,CAAC;YACtC,2FAA2F;YAC3F,4FAA4F;YAC5F,wFAAwF;YACxF,MAAM,SAAS,GAAG,OAAO,CAAC;YAC1B,OAAO,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,WAAI,EAAE,CAAC,CAAC,CAAC,IAAI,WAAI,EAAE,CAAC;YAC3F,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC;QACtB,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC;QACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,oBAAoB,CAAC,OAAiB,EAAE,aAAwB;QAC5E,MAAM,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;QACjF,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,gBAAgB,CAAC,MAAkC,EAAE,aAAwB;QACzF,MAAM,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAChF,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBAChC,IAAI,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,aAAa,CAAC;oBAC/C,YAAY,CAAC,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAC7D,CAAC;YACD,MAAM,WAAW,GAAG,2BAAY,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACnE,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,EAAE,CAAC,eAAe,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,WAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;YAC7D,CAAC;iBAAM,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,OAAO,IAAI,YAAY,CAAC,2BAAY,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;YACpF,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,iBAAiB,CAAC,OAAiB,EAAE,IAAW;QAC5D,mFAAmF;QACnF,MAAM,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QACnF,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,uCAAuC;IAChC,SAAS,KAAsB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3D;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/C,IAAI,IAAI,CAAC,IAAI;gBACX,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YAExC,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS;gBAC1C,CAAC,CAAC,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC;gBACxE,CAAC,CAAC,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAChE,IAAI,YAAY,EAAE,CAAC;gBACjB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBACxC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC5B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrF,CAAC;IACD,kCAAkC;IAC3B,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,UAAU,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC3C,OAAO,UAAU,CAAC;QACpB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,yDAAyD;IAClD,aAAa,CAAC,KAAU;QAC7B,IAAI,CAAE,CAAC,KAAK,YAAY,YAAY,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC;YAC1C,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,YAAY,CAAC;YACtD,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;gBACtC,OAAO,KAAK,CAAC;QACjB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI;YAChC,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yDAAyD;IAClD,gBAAgB,CAAC,OAAuB;QAC7C,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;QACjD,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAClD,IAAI,OAAO,CAAC,mBAAmB,CAAC,YAAY,CAAC;gBAC3C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,oCAAoC;IACpC,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,OAAuB;QACxC,IAAI,IAAI,CAAC,OAAO;YACd,OAAO;QACT,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE;YAC5B,OAAO;QACT,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;QACjD,IAAI,CAAC,YAAY;YACf,OAAO;QACT,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAA0B,CAAC;QACxF,IAAI,CAAC,WAAW;YACd,OAAO;QACT,IAAI,IAAI,CAAC,OAAO,GAAG,qBAAS,CAAC,aAAa,CAAC,WAAW,EAAE,OAAO,CAAC;YAC9D,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACxD,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IAC3B,CAAC;IACD;;OAEG;IACI,UAAU,CAAC,OAAwB,EAAE,OAAgB,EAAE,SAAqB;QACjF,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,OAAO;YACd,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACjE,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,QAA2C,EAAE,OAAuB;QACxF,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1B,IAAI,IAAI,CAAC,OAAO;YACd,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IACD;;;;;;;;;OASG;IACI,iCAAiC,CAAC,WAAsB,EAAE,OAAgB,KAAK,EAAE,OAAgB,KAAK,EAAE,OAAuB;QACpI,IAAI,CAAC,OAAO;YACV,OAAO,GAAG,6BAAa,CAAC,eAAe,EAAE,CAAC;QAC5C,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC;YACpB,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACnD,CAAC;QACD,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,CAAE,oCAAoC;QAC1E,kFAAkF;QAClF,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,uDAA0B,CAAC,WAAW,EAAE,CAAC;YACxD,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACxC,KAAK,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC;gBACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC1C,MAAM,OAAO,GAAG,uCAAkB,CAAC,WAAW,EAAE,CAAC;gBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,OAAO,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;oBACzD,OAAO,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;oBAC7D,MAAM,KAAK,GAAG,qBAAS,CAAC,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBAC3E,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;oBACvC,KAAK,EAAE,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;oBACpC,OAAO,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;gBACrC,CAAC;gBACD,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;YACD,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACjB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACpD,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;gBACtC,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,uCAAkB,CAAC,WAAW,EAAE,CAAC;gBACjD,IAAI,IAAI;oBACN,OAAO,CAAC,mBAAmB,CAAC,qBAAS,CAAC,oBAAoB,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;gBAC3F,IAAI,IAAI;oBACN,OAAO,CAAC,mBAAmB,CAAC,qBAAS,CAAC,oBAAoB,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;gBAC3F,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AA9OD,oCA8OC","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 Solid\r\n */\r\n\r\nimport { ClipPlane } from \"../clipping/ClipPlane\";\r\nimport { ConvexClipPlaneSet } from \"../clipping/ConvexClipPlaneSet\";\r\nimport { UnionOfConvexClipPlaneSets } from \"../clipping/UnionOfConvexClipPlaneSets\";\r\nimport { CurveCollection } from \"../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { AnyCurve, AnyRegion } from \"../curve/CurveTypes\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Loop } from \"../curve/Loop\";\r\nimport { ParityRegion } from \"../curve/ParityRegion\";\r\nimport { Path } from \"../curve/Path\";\r\nimport { RegionOps } from \"../curve/RegionOps\";\r\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\r\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { IndexedPolyface } from \"../polyface/Polyface\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\n\r\n/**\r\n * Sweepable planar contour with Transform for local to world interaction.\r\n * * The surface/solid classes `LinearSweep`, `RotationalSweep`, `RuledSweep` use this for their swept contours.\r\n * @public\r\n */\r\nexport class SweepContour {\r\n  /** The underlying curve collection, in its world coordinates position. */\r\n  public curves: CurveCollection;\r\n  /** coordinate frame that in which the curves are all in the xy plane. */\r\n  public localToWorld: Transform;\r\n  /** Axis used only in rotational case. */\r\n  public axis: Ray3d | undefined;\r\n\r\n  /** caches */\r\n  private _xyStrokes?: CurveCollection;\r\n  private _facets?: IndexedPolyface;\r\n\r\n  private constructor(contour: AnyCurve, map: Transform, axis: Ray3d | undefined) {\r\n    if (contour instanceof CurvePrimitive) {\r\n      // this.curves is a CurveCollection (not AnyCurve) so that contour type determines closure.\r\n      // This is the only time we detect CurvePrimitive closure and wrap as a relevant CurveChain.\r\n      // Note that we are ASSUMING closure means planar here. This is potentially problematic.\r\n      const primitive = contour;\r\n      contour = contour.startPoint().isAlmostEqual(contour.endPoint()) ? new Loop() : new Path();\r\n      contour.tryAddChild(primitive);\r\n    }\r\n    this.curves = contour;\r\n    this.localToWorld = map;\r\n    this.axis = axis;\r\n  }\r\n  /** Create for linear sweep.\r\n   * @param contour curve to sweep, CAPTURED. For best results, contour should be planar.\r\n   * @param defaultNormal optional default normal for guiding coordinate frame setup.\r\n   */\r\n  public static createForLinearSweep(contour: AnyCurve, defaultNormal?: Vector3d): SweepContour | undefined {\r\n    const localToWorld = FrameBuilder.createRightHandedFrame(defaultNormal, contour);\r\n    if (localToWorld) {\r\n      return new SweepContour(contour, localToWorld, undefined);\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Create for linear sweep.\r\n   * @param points polygon to sweep, CAPTURED as a Loop. Closure point is optional. If multiple polygons are passed in, parity logic is employed.\r\n   * For best results, all points should be coplanar.\r\n   * @param defaultNormal optional default normal for guiding coordinate frame setup.\r\n   */\r\n  public static createForPolygon(points: MultiLineStringDataVariant, defaultNormal?: Vector3d): SweepContour | undefined {\r\n    const localToWorld = FrameBuilder.createRightHandedFrame(defaultNormal, points);\r\n    if (localToWorld) {\r\n      if (defaultNormal !== undefined) {\r\n        if (localToWorld.matrix.dotColumnZ(defaultNormal))\r\n          localToWorld.matrix.scaleColumnsInPlace(1.0, -1.0, -1.0);\r\n      }\r\n      const linestrings = LineString3d.createArrayOfLineString3d(points);\r\n      const loops = [];\r\n      for (const ls of linestrings) {\r\n        ls.addClosurePoint();\r\n        loops.push(Loop.create(ls));\r\n      }\r\n      if (loops.length === 1) {\r\n        return new SweepContour(loops[0], localToWorld, undefined);\r\n      } else if (loops.length > 1) {\r\n        return new SweepContour(ParityRegion.createLoops(loops), localToWorld, undefined);\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Create for rotational sweep.\r\n   * @param contour curve to sweep, CAPTURED. For best results, contour should be planar.\r\n   * @param axis rotation axis\r\n   */\r\n  public static createForRotation(contour: AnyCurve, axis: Ray3d): SweepContour | undefined {\r\n    // createRightHandedFrame -- the axis is a last-gasp resolver for in-plane vectors.\r\n    const localToWorld = FrameBuilder.createRightHandedFrame(undefined, contour, axis);\r\n    if (localToWorld) {\r\n      return new SweepContour(contour, localToWorld, axis.clone());\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return (Reference to) the curves */\r\n  public getCurves(): CurveCollection { return this.curves; }\r\n  /**\r\n   * Apply `transform` to the curves, axis.\r\n   * * The local to world frame is reconstructed for the transformed curves.\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    if (this.curves.tryTransformInPlace(transform)) {\r\n      if (this.axis)\r\n        this.axis.transformInPlace(transform);\r\n\r\n      const localToWorld = this.axis !== undefined\r\n        ? FrameBuilder.createRightHandedFrame(undefined, this.curves, this.axis)\r\n        : FrameBuilder.createRightHandedFrame(undefined, this.curves);\r\n      if (localToWorld) {\r\n        this.localToWorld.setFrom(localToWorld);\r\n        this._xyStrokes = undefined;\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a deep clone. */\r\n  public clone(): SweepContour {\r\n    return new SweepContour(this.curves.clone(), this.localToWorld.clone(), this.axis);\r\n  }\r\n  /** Return a transformed clone. */\r\n  public cloneTransformed(transform: Transform): SweepContour | undefined {\r\n    const newContour = this.clone();\r\n    if (newContour.tryTransformInPlace(transform))\r\n      return newContour;\r\n    return undefined;\r\n  }\r\n  /** Test for near equality of curves, frame, and axis. */\r\n  public isAlmostEqual(other: any): boolean {\r\n    if (! (other instanceof SweepContour))\r\n      return false;\r\n    if (!this.curves.isAlmostEqual(other.curves))\r\n      return false;\r\n    if (!this.localToWorld.isAlmostEqual(other.localToWorld))\r\n      return false;\r\n    if (this.axis && other.axis) {\r\n      if (!this.axis.isAlmostEqual(other.axis))\r\n        return false;\r\n    } else if (this.axis || other.axis)\r\n      return false;\r\n    return true;\r\n  }\r\n\r\n  /** Recompute the local strokes cache for this contour */\r\n  public computeXYStrokes(options?: StrokeOptions): void {\r\n    this._xyStrokes = undefined;\r\n    const worldToLocal = this.localToWorld.inverse();\r\n    if (worldToLocal) {\r\n      const strokes = this.curves.cloneStroked(options);\r\n      if (strokes.tryTransformInPlace(worldToLocal))\r\n        this._xyStrokes = strokes;\r\n    }\r\n  }\r\n  /** Return cached contour strokes */\r\n  public get xyStrokes(): CurveCollection | undefined {\r\n    return this._xyStrokes;\r\n  }\r\n\r\n  /**\r\n   * Build the (cached) internal facets for the contour.\r\n   * @param options primarily how to stroke the contour, but also how to facet it.\r\n   * * By default, a triangulation is computed, but if `options.maximizeConvexFacets === true`, edges between coplanar triangles are removed to return maximally convex facets.\r\n   */\r\n  public buildFacets(options?: StrokeOptions): void {\r\n    if (this._facets)\r\n      return;\r\n    if (!this.curves.isAnyRegion())\r\n      return;\r\n    const worldToLocal = this.localToWorld.inverse();\r\n    if (!worldToLocal)\r\n      return;\r\n    const localRegion = this.curves.cloneTransformed(worldToLocal) as AnyRegion | undefined;\r\n    if (!localRegion)\r\n      return;\r\n    if (this._facets = RegionOps.facetRegionXY(localRegion, options))\r\n      this._facets.tryTransformInPlace(this.localToWorld);\r\n  }\r\n  /**\r\n   * Delete facet cache.\r\n   * * This protects against PolyfaceBuilder reusing facets constructed with different options settings.\r\n   */\r\n  public purgeFacets() {\r\n    this._facets = undefined;\r\n  }\r\n  /** Emit facets to a builder.\r\n   * This method may cache and reuse facets over multiple calls.\r\n   */\r\n  public emitFacets(builder: PolyfaceBuilder, reverse: boolean, transform?: Transform) {\r\n    this.buildFacets(builder.options);\r\n    if (this._facets)\r\n      builder.addIndexedPolyface(this._facets, reverse, transform);\r\n  }\r\n  /** Emit facets to a function\r\n   * This method may cache and reuse facets over multiple calls.\r\n   * @param announce callback to receive the facet set\r\n   * @param options how to stroke the contour\r\n   */\r\n  public announceFacets(announce: (facets: IndexedPolyface) => void, options?: StrokeOptions): void {\r\n    this.buildFacets(options);\r\n    if (this._facets)\r\n      announce(this._facets);\r\n  }\r\n  /**\r\n   * Create a UnionOfConvexClipPlaneSets that clips to the swept faceted contour region.\r\n   * @param sweepVector the sweep direction and distance:\r\n   * * If undefined, the sweep direction is along the contour normal and no caps are constructed (the sweep is infinite in both directions).\r\n   * * If defined, the returned clipper is inverted if and only if sweepVector is in the opposite half-space as the computed contour normal.\r\n   * @param cap0 construct a clip plane equal to the contour plane. Note that `sweepVector` must be defined.\r\n   * @param cap1 construct a clip plane parallel to the contour plane at the end of `sweepVector`.\r\n   * @param options how to stroke the contour\r\n   * @returns clipper defined by faceting then sweeping the contour region\r\n   */\r\n  public sweepToUnionOfConvexClipPlaneSets(sweepVector?: Vector3d, cap0: boolean = false, cap1: boolean = false, options?: StrokeOptions): UnionOfConvexClipPlaneSets | undefined {\r\n    if (!options)\r\n      options = StrokeOptions.createForFacets();\r\n    if (!sweepVector) {\r\n      cap0 = cap1 = false;\r\n      sweepVector = this.localToWorld.matrix.columnZ();\r\n    }\r\n    options.maximizeConvexFacets = true;  // produce fewer ConvexClipPlaneSets\r\n    // It's a trip around the barn, but it's easy to make a polyface and scan it . . .\r\n    this.buildFacets(options);\r\n    const facets = this._facets;\r\n    if (facets) {\r\n      const point0 = Point3d.create();\r\n      const point1 = Point3d.create();\r\n      const result = UnionOfConvexClipPlaneSets.createEmpty();\r\n      const visitor = facets.createVisitor(1);\r\n      for (visitor.reset(); visitor.moveToNextFacet();) {\r\n        const numEdges = visitor.point.length - 1;\r\n        const clipper = ConvexClipPlaneSet.createEmpty();\r\n        for (let i = 0; i < numEdges; i++) {\r\n          visitor.point.getPoint3dAtUncheckedPointIndex(i, point0);\r\n          visitor.point.getPoint3dAtUncheckedPointIndex(i + 1, point1);\r\n          const plane = ClipPlane.createEdgeAndUpVector(point1, point0, sweepVector);\r\n          const visible = visitor.edgeVisible[i];\r\n          plane?.setFlags(!visible, !visible);\r\n          clipper.addPlaneToConvexSet(plane);\r\n        }\r\n        result.addConvexSet(clipper);\r\n      }\r\n      if (cap0 || cap1) {\r\n        const zVector = this.localToWorld.matrix.columnZ();\r\n        const plane0Origin = this.localToWorld.getOrigin();\r\n        const plane1Origin = plane0Origin.plus(sweepVector);\r\n        const inwardNormal0 = zVector.clone();\r\n        const inwardNormal1 = zVector.negate();\r\n        const clipper = ConvexClipPlaneSet.createEmpty();\r\n        if (cap0)\r\n          clipper.addPlaneToConvexSet(ClipPlane.createNormalAndPoint(inwardNormal0, plane0Origin));\r\n        if (cap1)\r\n          clipper.addPlaneToConvexSet(ClipPlane.createNormalAndPoint(inwardNormal1, plane1Origin));\r\n        result.addConvexSet(clipper);\r\n      }\r\n      return result;\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"SweepContour.js","sourceRoot":"","sources":["../../../src/solid/SweepContour.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,qDAAkD;AAClD,uEAAoE;AACpE,uFAAoF;AAEpF,4DAAyD;AAEzD,wDAAqD;AACrD,wCAAqC;AACrC,wDAAqD;AACrD,wCAAqC;AACrC,kDAA+C;AAC/C,0DAAuD;AACvD,6DAA0D;AAE1D,mEAAkE;AAMlE;;;;GAIG;AACH,MAAa,YAAY;IAYvB,YAAoB,OAAiB,EAAE,GAAc,EAAE,IAAuB;QAC5E,IAAI,OAAO,YAAY,+BAAc,EAAE,CAAC;YACtC,2FAA2F;YAC3F,4FAA4F;YAC5F,wFAAwF;YACxF,MAAM,SAAS,GAAG,OAAO,CAAC;YAC1B,OAAO,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,WAAI,EAAE,CAAC,CAAC,CAAC,IAAI,WAAI,EAAE,CAAC;YAC3F,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC;QACtB,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC;QACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,oBAAoB,CAAC,OAAiB,EAAE,aAAwB;QAC5E,MAAM,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;QACjF,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,gBAAgB,CAAC,MAAkC,EAAE,aAAwB;QACzF,MAAM,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAChF,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,WAAW,GAAG,2BAAY,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACnE,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,EAAE,CAAC,eAAe,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,WAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;YAC7D,CAAC;iBAAM,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,OAAO,IAAI,YAAY,CAAC,2BAAY,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;YACpF,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,iBAAiB,CAAC,OAAiB,EAAE,IAAW;QAC5D,mFAAmF;QACnF,MAAM,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QACnF,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,uCAAuC;IAChC,SAAS,KAAsB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3D;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/C,IAAI,IAAI,CAAC,IAAI;gBACX,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YAExC,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS;gBAC1C,CAAC,CAAC,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC;gBACxE,CAAC,CAAC,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAChE,IAAI,YAAY,EAAE,CAAC;gBACjB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBACxC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC5B,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrF,CAAC;IACD,kCAAkC;IAC3B,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,UAAU,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC3C,OAAO,UAAU,CAAC;QACpB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,yDAAyD;IAClD,aAAa,CAAC,KAAU;QAC7B,IAAI,CAAE,CAAC,KAAK,YAAY,YAAY,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC;YAC1C,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,YAAY,CAAC;YACtD,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;gBACtC,OAAO,KAAK,CAAC;QACjB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI;YAChC,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yDAAyD;IAClD,gBAAgB,CAAC,OAAuB;QAC7C,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;QACjD,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAClD,IAAI,OAAO,CAAC,mBAAmB,CAAC,YAAY,CAAC;gBAC3C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,oCAAoC;IACpC,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,OAAuB;QACxC,IAAI,IAAI,CAAC,OAAO;YACd,OAAO;QACT,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE;YAC5B,OAAO;QACT,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;QACjD,IAAI,CAAC,YAAY;YACf,OAAO;QACT,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAA0B,CAAC;QACxF,IAAI,CAAC,WAAW;YACd,OAAO;QACT,IAAI,IAAI,CAAC,OAAO,GAAG,qBAAS,CAAC,aAAa,CAAC,WAAW,EAAE,OAAO,CAAC;YAC9D,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACxD,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IAC3B,CAAC;IACD;;OAEG;IACI,UAAU,CAAC,OAAwB,EAAE,OAAgB,EAAE,SAAqB;QACjF,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,OAAO;YACd,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACjE,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,QAA2C,EAAE,OAAuB;QACxF,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1B,IAAI,IAAI,CAAC,OAAO;YACd,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IACD;;;;;;;;;OASG;IACI,iCAAiC,CAAC,WAAsB,EAAE,OAAgB,KAAK,EAAE,OAAgB,KAAK,EAAE,OAAuB;QACpI,IAAI,CAAC,OAAO;YACV,OAAO,GAAG,6BAAa,CAAC,eAAe,EAAE,CAAC;QAC5C,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC;YACpB,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACnD,CAAC;QACD,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,CAAE,oCAAoC;QAC1E,kFAAkF;QAClF,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,uDAA0B,CAAC,WAAW,EAAE,CAAC;YACxD,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACxC,KAAK,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC;gBACjD,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC1C,MAAM,OAAO,GAAG,uCAAkB,CAAC,WAAW,EAAE,CAAC;gBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,OAAO,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;oBACzD,OAAO,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;oBAC7D,MAAM,KAAK,GAAG,qBAAS,CAAC,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBAC3E,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;oBACvC,KAAK,EAAE,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;oBACpC,OAAO,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;gBACrC,CAAC;gBACD,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;YACD,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACjB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACpD,MAAM,aAAa,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;gBACtC,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,uCAAkB,CAAC,WAAW,EAAE,CAAC;gBACjD,IAAI,IAAI;oBACN,OAAO,CAAC,mBAAmB,CAAC,qBAAS,CAAC,oBAAoB,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;gBAC3F,IAAI,IAAI;oBACN,OAAO,CAAC,mBAAmB,CAAC,qBAAS,CAAC,oBAAoB,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;gBAC3F,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AA1OD,oCA0OC","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 Solid\r\n */\r\n\r\nimport { ClipPlane } from \"../clipping/ClipPlane\";\r\nimport { ConvexClipPlaneSet } from \"../clipping/ConvexClipPlaneSet\";\r\nimport { UnionOfConvexClipPlaneSets } from \"../clipping/UnionOfConvexClipPlaneSets\";\r\nimport { CurveCollection } from \"../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { AnyCurve, AnyRegion } from \"../curve/CurveTypes\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Loop } from \"../curve/Loop\";\r\nimport { ParityRegion } from \"../curve/ParityRegion\";\r\nimport { Path } from \"../curve/Path\";\r\nimport { RegionOps } from \"../curve/RegionOps\";\r\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\r\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { IndexedPolyface } from \"../polyface/Polyface\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\n\r\n/**\r\n * Sweepable planar contour with Transform for local to world interaction.\r\n * * The surface/solid classes `LinearSweep`, `RotationalSweep`, `RuledSweep` use this for their swept contours.\r\n * @public\r\n */\r\nexport class SweepContour {\r\n  /** The underlying curve collection, in its world coordinates position. */\r\n  public curves: CurveCollection;\r\n  /** coordinate frame that in which the curves are all in the xy plane. */\r\n  public localToWorld: Transform;\r\n  /** Axis used only in rotational case. */\r\n  public axis: Ray3d | undefined;\r\n\r\n  /** caches */\r\n  private _xyStrokes?: CurveCollection;\r\n  private _facets?: IndexedPolyface;\r\n\r\n  private constructor(contour: AnyCurve, map: Transform, axis: Ray3d | undefined) {\r\n    if (contour instanceof CurvePrimitive) {\r\n      // this.curves is a CurveCollection (not AnyCurve) so that contour type determines closure.\r\n      // This is the only time we detect CurvePrimitive closure and wrap as a relevant CurveChain.\r\n      // Note that we are ASSUMING closure means planar here. This is potentially problematic.\r\n      const primitive = contour;\r\n      contour = contour.startPoint().isAlmostEqual(contour.endPoint()) ? new Loop() : new Path();\r\n      contour.tryAddChild(primitive);\r\n    }\r\n    this.curves = contour;\r\n    this.localToWorld = map;\r\n    this.axis = axis;\r\n  }\r\n  /** Create for linear sweep.\r\n   * @param contour curve to sweep, CAPTURED. For best results, contour should be planar.\r\n   * @param defaultNormal optional default normal for guiding coordinate frame setup.\r\n   */\r\n  public static createForLinearSweep(contour: AnyCurve, defaultNormal?: Vector3d): SweepContour | undefined {\r\n    const localToWorld = FrameBuilder.createRightHandedFrame(defaultNormal, contour);\r\n    if (localToWorld) {\r\n      return new SweepContour(contour, localToWorld, undefined);\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Create for linear sweep.\r\n   * @param points polygon to sweep, CAPTURED as a Loop. Closure point is optional. If multiple polygons are passed in, parity logic is employed.\r\n   * For best results, all points should be coplanar.\r\n   * @param defaultNormal optional default normal for guiding coordinate frame setup.\r\n   */\r\n  public static createForPolygon(points: MultiLineStringDataVariant, defaultNormal?: Vector3d): SweepContour | undefined {\r\n    const localToWorld = FrameBuilder.createRightHandedFrame(defaultNormal, points);\r\n    if (localToWorld) {\r\n      const linestrings = LineString3d.createArrayOfLineString3d(points);\r\n      const loops = [];\r\n      for (const ls of linestrings) {\r\n        ls.addClosurePoint();\r\n        loops.push(Loop.create(ls));\r\n      }\r\n      if (loops.length === 1) {\r\n        return new SweepContour(loops[0], localToWorld, undefined);\r\n      } else if (loops.length > 1) {\r\n        return new SweepContour(ParityRegion.createLoops(loops), localToWorld, undefined);\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Create for rotational sweep.\r\n   * @param contour curve to sweep, CAPTURED. For best results, contour should be planar.\r\n   * @param axis rotation axis\r\n   */\r\n  public static createForRotation(contour: AnyCurve, axis: Ray3d): SweepContour | undefined {\r\n    // createRightHandedFrame -- the axis is a last-gasp resolver for in-plane vectors.\r\n    const localToWorld = FrameBuilder.createRightHandedFrame(undefined, contour, axis);\r\n    if (localToWorld) {\r\n      return new SweepContour(contour, localToWorld, axis.clone());\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return (Reference to) the curves */\r\n  public getCurves(): CurveCollection { return this.curves; }\r\n  /**\r\n   * Apply `transform` to the curves, axis.\r\n   * * The local to world frame is reconstructed for the transformed curves.\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    if (this.curves.tryTransformInPlace(transform)) {\r\n      if (this.axis)\r\n        this.axis.transformInPlace(transform);\r\n\r\n      const localToWorld = this.axis !== undefined\r\n        ? FrameBuilder.createRightHandedFrame(undefined, this.curves, this.axis)\r\n        : FrameBuilder.createRightHandedFrame(undefined, this.curves);\r\n      if (localToWorld) {\r\n        this.localToWorld.setFrom(localToWorld);\r\n        this._xyStrokes = undefined;\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a deep clone. */\r\n  public clone(): SweepContour {\r\n    return new SweepContour(this.curves.clone(), this.localToWorld.clone(), this.axis);\r\n  }\r\n  /** Return a transformed clone. */\r\n  public cloneTransformed(transform: Transform): SweepContour | undefined {\r\n    const newContour = this.clone();\r\n    if (newContour.tryTransformInPlace(transform))\r\n      return newContour;\r\n    return undefined;\r\n  }\r\n  /** Test for near equality of curves, frame, and axis. */\r\n  public isAlmostEqual(other: any): boolean {\r\n    if (! (other instanceof SweepContour))\r\n      return false;\r\n    if (!this.curves.isAlmostEqual(other.curves))\r\n      return false;\r\n    if (!this.localToWorld.isAlmostEqual(other.localToWorld))\r\n      return false;\r\n    if (this.axis && other.axis) {\r\n      if (!this.axis.isAlmostEqual(other.axis))\r\n        return false;\r\n    } else if (this.axis || other.axis)\r\n      return false;\r\n    return true;\r\n  }\r\n\r\n  /** Recompute the local strokes cache for this contour */\r\n  public computeXYStrokes(options?: StrokeOptions): void {\r\n    this._xyStrokes = undefined;\r\n    const worldToLocal = this.localToWorld.inverse();\r\n    if (worldToLocal) {\r\n      const strokes = this.curves.cloneStroked(options);\r\n      if (strokes.tryTransformInPlace(worldToLocal))\r\n        this._xyStrokes = strokes;\r\n    }\r\n  }\r\n  /** Return cached contour strokes */\r\n  public get xyStrokes(): CurveCollection | undefined {\r\n    return this._xyStrokes;\r\n  }\r\n\r\n  /**\r\n   * Build the (cached) internal facets for the contour.\r\n   * @param options primarily how to stroke the contour, but also how to facet it.\r\n   * * By default, a triangulation is computed, but if `options.maximizeConvexFacets === true`, edges between coplanar triangles are removed to return maximally convex facets.\r\n   */\r\n  public buildFacets(options?: StrokeOptions): void {\r\n    if (this._facets)\r\n      return;\r\n    if (!this.curves.isAnyRegion())\r\n      return;\r\n    const worldToLocal = this.localToWorld.inverse();\r\n    if (!worldToLocal)\r\n      return;\r\n    const localRegion = this.curves.cloneTransformed(worldToLocal) as AnyRegion | undefined;\r\n    if (!localRegion)\r\n      return;\r\n    if (this._facets = RegionOps.facetRegionXY(localRegion, options))\r\n      this._facets.tryTransformInPlace(this.localToWorld);\r\n  }\r\n  /**\r\n   * Delete facet cache.\r\n   * * This protects against PolyfaceBuilder reusing facets constructed with different options settings.\r\n   */\r\n  public purgeFacets() {\r\n    this._facets = undefined;\r\n  }\r\n  /** Emit facets to a builder.\r\n   * This method may cache and reuse facets over multiple calls.\r\n   */\r\n  public emitFacets(builder: PolyfaceBuilder, reverse: boolean, transform?: Transform) {\r\n    this.buildFacets(builder.options);\r\n    if (this._facets)\r\n      builder.addIndexedPolyface(this._facets, reverse, transform);\r\n  }\r\n  /** Emit facets to a function\r\n   * This method may cache and reuse facets over multiple calls.\r\n   * @param announce callback to receive the facet set\r\n   * @param options how to stroke the contour\r\n   */\r\n  public announceFacets(announce: (facets: IndexedPolyface) => void, options?: StrokeOptions): void {\r\n    this.buildFacets(options);\r\n    if (this._facets)\r\n      announce(this._facets);\r\n  }\r\n  /**\r\n   * Create a UnionOfConvexClipPlaneSets that clips to the swept faceted contour region.\r\n   * @param sweepVector the sweep direction and distance:\r\n   * * If undefined, the sweep direction is along the contour normal and no caps are constructed (the sweep is infinite in both directions).\r\n   * * If defined, the returned clipper is inverted if and only if sweepVector is in the opposite half-space as the computed contour normal.\r\n   * @param cap0 construct a clip plane equal to the contour plane. Note that `sweepVector` must be defined.\r\n   * @param cap1 construct a clip plane parallel to the contour plane at the end of `sweepVector`.\r\n   * @param options how to stroke the contour\r\n   * @returns clipper defined by faceting then sweeping the contour region\r\n   */\r\n  public sweepToUnionOfConvexClipPlaneSets(sweepVector?: Vector3d, cap0: boolean = false, cap1: boolean = false, options?: StrokeOptions): UnionOfConvexClipPlaneSets | undefined {\r\n    if (!options)\r\n      options = StrokeOptions.createForFacets();\r\n    if (!sweepVector) {\r\n      cap0 = cap1 = false;\r\n      sweepVector = this.localToWorld.matrix.columnZ();\r\n    }\r\n    options.maximizeConvexFacets = true;  // produce fewer ConvexClipPlaneSets\r\n    // It's a trip around the barn, but it's easy to make a polyface and scan it . . .\r\n    this.buildFacets(options);\r\n    const facets = this._facets;\r\n    if (facets) {\r\n      const point0 = Point3d.create();\r\n      const point1 = Point3d.create();\r\n      const result = UnionOfConvexClipPlaneSets.createEmpty();\r\n      const visitor = facets.createVisitor(1);\r\n      for (visitor.reset(); visitor.moveToNextFacet();) {\r\n        const numEdges = visitor.point.length - 1;\r\n        const clipper = ConvexClipPlaneSet.createEmpty();\r\n        for (let i = 0; i < numEdges; i++) {\r\n          visitor.point.getPoint3dAtUncheckedPointIndex(i, point0);\r\n          visitor.point.getPoint3dAtUncheckedPointIndex(i + 1, point1);\r\n          const plane = ClipPlane.createEdgeAndUpVector(point1, point0, sweepVector);\r\n          const visible = visitor.edgeVisible[i];\r\n          plane?.setFlags(!visible, !visible);\r\n          clipper.addPlaneToConvexSet(plane);\r\n        }\r\n        result.addConvexSet(clipper);\r\n      }\r\n      if (cap0 || cap1) {\r\n        const zVector = this.localToWorld.matrix.columnZ();\r\n        const plane0Origin = this.localToWorld.getOrigin();\r\n        const plane1Origin = plane0Origin.plus(sweepVector);\r\n        const inwardNormal0 = zVector.clone();\r\n        const inwardNormal1 = zVector.negate();\r\n        const clipper = ConvexClipPlaneSet.createEmpty();\r\n        if (cap0)\r\n          clipper.addPlaneToConvexSet(ClipPlane.createNormalAndPoint(inwardNormal0, plane0Origin));\r\n        if (cap1)\r\n          clipper.addPlaneToConvexSet(ClipPlane.createNormalAndPoint(inwardNormal1, plane1Origin));\r\n        result.addConvexSet(clipper);\r\n      }\r\n      return result;\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}

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

@@ -144,8 +144,8 @@ export declare class HalfEdgeGraphMerge {
     static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph;
     /**
      * * Input is random linestrings, not necessarily loops
-     * * Graph gets full splitEdges, regularize, and triangulate.
-     * @returns triangulated graph, or undefined if bad data.
+     * * Graph gets full splitEdges, regularize (optional), and triangulate.
+     * @returns graph, or undefined if bad data.
      */
     static formGraphFromChains(chains: MultiLineStringDataVariant, regularize?: boolean, mask?: HalfEdgeMask): HalfEdgeGraph | undefined;
 }

package/lib/cjs/topology/Merging.js

@@ -562,8 +562,8 @@ class HalfEdgeGraphMerge {
     }
     /**
      * * Input is random linestrings, not necessarily loops
-     * * Graph gets full splitEdges, regularize, and triangulate.
-     * @returns triangulated graph, or undefined if bad data.
+     * * Graph gets full splitEdges, regularize (optional), and triangulate.
+     * @returns graph, or undefined if bad data.
      */
     static formGraphFromChains(chains, regularize = true, mask = Graph_1.HalfEdgeMask.PRIMARY_EDGE) {
         if (chains.length < 1)

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;;;AAE/F;;GAEG;AAEH,sDAA6C;AAE7C,0DAAuD;AACvD,0CAAuC;AACvC,+CAA4C;AAC5C,mEAAkE;AAClE,+CAA8C;AAC9C,mEAAgE;AAChE,yDAAsD;AACtD,mCAAgE;AAChE,mEAAgF;AAChF,qDAAyD;AACzD,mDAA+C;AAG/C,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,CAAC;YACtC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;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,CAAC;YAE/B,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;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,MAAoB,EAAE,OAAqB,EAAE,gBAAwB,CAAC;QAClI,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,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;QAC1B,CAAC,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,CAAC,CAAC,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;QAC5B,CAAC,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,EAAE,aAAa,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;;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,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClE,gFAAgF;oBAChF,MAAM,aAAa,GAAG,mBAAQ,CAAC,0BAA0B,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;oBACrH,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;wBAChK,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBAC7B,EAAE,SAAS,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;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,CAAC;YACzE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;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,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,GAAG,GAAG,KAAK,CAAC,kBAAkB,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9F,IAAA,qBAAM,EAAC,cAAc,KAAK,eAAe,CAAC,CAAC;QAC7C,CAAC;QACD,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,CAAC;YAC5B,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAChC,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACtB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAzMD,4CAyMC;AAED;;;GAGG;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,CAAC;YACf,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,CAAC;gBAChE,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACI,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,CAAC;YAC7C,MAAM,QAAQ,GAAiC,EAAE,CAAC;YAClD,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;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;YACvF,CAAC;YACD,IAAI,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;QACrD,CAAC;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,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;gBACf,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC/B,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;gBACjF,CAAC;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,EAAE,CAAC;oBACzC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAAc;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,OAA8B,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,IAAI,KAAK,EAAE,CAAC;gBACV,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;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,4FAA4F;IACrF,MAAM,CAAC,UAAU,CAAC,IAAc;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC;IACrJ,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,CAAC;YAClC,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;QACrC,CAAC;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,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,sFAAsF;gBACtF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,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,CAAC;wBACjC,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;oBACrB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE,CAAC;YACtC,IAAI,iBAAiB,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBAC7D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,qBAAqB,GAAG,uBAAuB,CAAC;gBACpD,IAAI,qBAAqB,EAAE,CAAC;oBAC1B,4HAA4H;oBAC5H,MAAM,MAAM,GAAG,KAAK,CAAC,OAA8B,CAAC;oBACpD,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,YAAY,6BAAa;wBAC7F,qBAAqB,GAAG,SAAS,CAAC;gBACtC,CAAC;gBACD,IAAI,OAAO,GAAG,qBAAqB,CAAC,CAAC,CAAC,qBAAqB,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;gBACtH,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;YACvD,CAAC;QACH,CAAC;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;QACnB,uDAAuD;QAEvD,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,kFAAkF;gBAClF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,6CAA6C;oBAC7C,+DAA+D;oBAC/D,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,CAAC;wBACjC,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,CAAC;4BAC5C,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,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BACnD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,6FAA6F;wBAC/F,CAAC;6BAAM,CAAC;4BACN,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,CAAC;gCAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;oCAC7B,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,CAAC,CAAE,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;oCACtC,CAAC;gCACH,CAAC;4BACH,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;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,CAAC;YAEnC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;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;IAClB,CAAC;IACO,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,CAAC;YAC/B,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;QACtE,CAAC;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,CAAC;YAC9D,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,CAAC;gBAClD,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,CAAC;oBACxE,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/E,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,IAAI,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;wBACxF,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE,CAAC;4BAC/D,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;wBAClB,CAAC;wBACD,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE,CAAC;4BAC/D,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;wBAClB,CAAC;wBACD,0EAA0E;oBAC5E,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;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;QACnC,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,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF;AAhWD,gDAgWC","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 { assert } from \"@itwin/core-bentley\";\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 { Triangulator } from \"./Triangulation\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\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   * 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   * @param signedAreaTol optional signed area tolerance to use in test for parallel vectors\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, signedAreaTol: number = 0): 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, signedAreaTol);\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          // tol based on areas of *original* faces on each side of the edge to be removed\r\n          const signedAreaTol = Geometry.smallMetricDistanceSquared * (node.signedFaceArea() + node.edgeMate.signedFaceArea());\r\n          if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier, signedAreaTol) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier, signedAreaTol)) {\r\n            node.setMaskAroundEdge(mark);\r\n            ++numMarked;\r\n          }\r\n        }\r\n      }\r\n      node.setMaskAroundEdge(visit);\r\n    }\r\n    graph.dropMask(visit);\r\n    return numMarked;\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      const numYankedEdges = 0.5 * graph.yankAndDeleteEdges((node: HalfEdge) => node.getMask(mark));\r\n      assert(numYankedEdges === numRemovedEdges);\r\n    }\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 * Note: this class uses hardcoded micrometer coordinate/cluster tolerance throughout.\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  /** Whether the HalfEdge is part of a null face, as marked by [[clusterAndMergeXYTheta]]. */\r\n  public static isNullFace(node: HalfEdge): boolean {\r\n    return node.isMaskSet(HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;\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 getPrecomputedRadians = outboundRadiansFunction;\r\n        if (getPrecomputedRadians) {\r\n          // Recompute theta when edge geometry is completely determined by the vertices, which may have been perturbed by clustering.\r\n          const detail = nodeA.edgeTag as CurveLocationDetail;\r\n          if (undefined === detail || undefined === detail.curve || detail.curve instanceof LineSegment3d)\r\n            getPrecomputedRadians = undefined;\r\n        }\r\n        let radians = getPrecomputedRadians ? getPrecomputedRadians(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    // GeometryCoreTestIO.consoleLog(\"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          // GeometryCoreTestIO.consoleLog({ 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    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;;;AAE/F;;GAEG;AAEH,sDAA6C;AAE7C,0DAAuD;AACvD,0CAAuC;AACvC,+CAA4C;AAC5C,mEAAkE;AAClE,+CAA8C;AAC9C,mEAAgE;AAChE,yDAAsD;AACtD,mCAAgE;AAChE,mEAAgF;AAChF,qDAAyD;AACzD,mDAA+C;AAG/C,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,CAAC;YACtC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;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,CAAC;YAE/B,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;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,MAAoB,EAAE,OAAqB,EAAE,gBAAwB,CAAC;QAClI,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,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;QAC1B,CAAC,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,CAAC,CAAC,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;QAC5B,CAAC,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,EAAE,aAAa,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;;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,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClE,gFAAgF;oBAChF,MAAM,aAAa,GAAG,mBAAQ,CAAC,0BAA0B,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;oBACrH,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;wBAChK,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBAC7B,EAAE,SAAS,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;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,CAAC;YACzE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;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,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,GAAG,GAAG,KAAK,CAAC,kBAAkB,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9F,IAAA,qBAAM,EAAC,cAAc,KAAK,eAAe,CAAC,CAAC;QAC7C,CAAC;QACD,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,CAAC;YAC5B,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAChC,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACtB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAzMD,4CAyMC;AAED;;;GAGG;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,CAAC;YACf,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,CAAC;gBAChE,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACI,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,CAAC;YAC7C,MAAM,QAAQ,GAAiC,EAAE,CAAC;YAClD,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;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;YACvF,CAAC;YACD,IAAI,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;QACrD,CAAC;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,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;gBACf,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC/B,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;gBACjF,CAAC;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,EAAE,CAAC;oBACzC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAAc;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,OAA8B,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,IAAI,KAAK,EAAE,CAAC;gBACV,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;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,4FAA4F;IACrF,MAAM,CAAC,UAAU,CAAC,IAAc;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC;IACrJ,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,CAAC;YAClC,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;QACrC,CAAC;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,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,sFAAsF;gBACtF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,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,CAAC;wBACjC,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;oBACrB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE,CAAC;YACtC,IAAI,iBAAiB,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBAC7D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,qBAAqB,GAAG,uBAAuB,CAAC;gBACpD,IAAI,qBAAqB,EAAE,CAAC;oBAC1B,4HAA4H;oBAC5H,MAAM,MAAM,GAAG,KAAK,CAAC,OAA8B,CAAC;oBACpD,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,YAAY,6BAAa;wBAC7F,qBAAqB,GAAG,SAAS,CAAC;gBACtC,CAAC;gBACD,IAAI,OAAO,GAAG,qBAAqB,CAAC,CAAC,CAAC,qBAAqB,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;gBACtH,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;YACvD,CAAC;QACH,CAAC;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;QACnB,uDAAuD;QAEvD,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,kFAAkF;gBAClF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,6CAA6C;oBAC7C,+DAA+D;oBAC/D,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,CAAC;wBACjC,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,CAAC;4BAC5C,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,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BACnD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,6FAA6F;wBAC/F,CAAC;6BAAM,CAAC;4BACN,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,CAAC;gCAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;oCAC7B,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,CAAC,CAAE,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;oCACtC,CAAC;gCACH,CAAC;4BACH,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;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,CAAC;YAEnC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;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;IAClB,CAAC;IACO,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,CAAC;YAC/B,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;QACtE,CAAC;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,CAAC;YAC9D,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,CAAC;gBAClD,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,CAAC;oBACxE,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/E,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,IAAI,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;wBACxF,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE,CAAC;4BAC/D,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;wBAClB,CAAC;wBACD,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE,CAAC;4BAC/D,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;wBAClB,CAAC;wBACD,0EAA0E;oBAC5E,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;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;QACnC,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,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF;AAhWD,gDAgWC","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 { assert } from \"@itwin/core-bentley\";\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 { Triangulator } from \"./Triangulation\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\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   * 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   * @param signedAreaTol optional signed area tolerance to use in test for parallel vectors\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, signedAreaTol: number = 0): 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, signedAreaTol);\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          // tol based on areas of *original* faces on each side of the edge to be removed\r\n          const signedAreaTol = Geometry.smallMetricDistanceSquared * (node.signedFaceArea() + node.edgeMate.signedFaceArea());\r\n          if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier, signedAreaTol) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier, signedAreaTol)) {\r\n            node.setMaskAroundEdge(mark);\r\n            ++numMarked;\r\n          }\r\n        }\r\n      }\r\n      node.setMaskAroundEdge(visit);\r\n    }\r\n    graph.dropMask(visit);\r\n    return numMarked;\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      const numYankedEdges = 0.5 * graph.yankAndDeleteEdges((node: HalfEdge) => node.getMask(mark));\r\n      assert(numYankedEdges === numRemovedEdges);\r\n    }\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 * Note: this class uses hardcoded micrometer coordinate/cluster tolerance throughout.\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  /** Whether the HalfEdge is part of a null face, as marked by [[clusterAndMergeXYTheta]]. */\r\n  public static isNullFace(node: HalfEdge): boolean {\r\n    return node.isMaskSet(HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;\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 getPrecomputedRadians = outboundRadiansFunction;\r\n        if (getPrecomputedRadians) {\r\n          // Recompute theta when edge geometry is completely determined by the vertices, which may have been perturbed by clustering.\r\n          const detail = nodeA.edgeTag as CurveLocationDetail;\r\n          if (undefined === detail || undefined === detail.curve || detail.curve instanceof LineSegment3d)\r\n            getPrecomputedRadians = undefined;\r\n        }\r\n        let radians = getPrecomputedRadians ? getPrecomputedRadians(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    // GeometryCoreTestIO.consoleLog(\"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          // GeometryCoreTestIO.consoleLog({ 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    return graph;\r\n  }\r\n\r\n  /**\r\n   * * Input is random linestrings, not necessarily loops\r\n   * * Graph gets full splitEdges, regularize (optional), and triangulate.\r\n   * @returns 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/esm/curve/CurveOps.d.ts

@@ -61,16 +61,16 @@ export declare class CurveOps {
      * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
      * @returns chains, possibly wrapped in a [[BagOfCurves]].
      */
-    static collectChains(fragments: AnyCurve[], gapTolerance?: number, planeTolerance?: number | undefined): AnyChain | undefined;
+    static collectChains(fragments: AnyCurve[], gapTolerance?: number, planeTolerance?: number): AnyChain | undefined;
     /**
-     * Restructure curve fragments as Paths and Loops, to be stroked and passed into the callback.
+     * Restructure curve fragments, to be stroked and passed into the callback.
      * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.
      * @param fragments fragments to be chained and stroked
      * @param announceChain callback to process each stroked Path and Loop
      * @param strokeOptions options for stroking the chains
      * @param gapTolerance distance to be treated as "effectively zero" when assembling fragments head-to-tail. Also used for removing duplicate points in the stroked chains.
-     * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
+     * @param _planeTolerance unused, pass undefined
      */
-    static collectChainsAsLineString3d(fragments: AnyCurve[], announceChain: (chainPoints: LineString3d) => void, strokeOptions?: StrokeOptions, gapTolerance?: number, planeTolerance?: number | undefined): void;
+    static collectChainsAsLineString3d(fragments: AnyCurve[], announceChain: (chainPoints: LineString3d) => void, strokeOptions?: StrokeOptions, gapTolerance?: number, _planeTolerance?: number): void;
 }
 //# sourceMappingURL=CurveOps.d.ts.map

package/lib/esm/curve/CurveOps.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CurveOps.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveOps.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAe,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAGlD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;GAGG;AACH,qBAAa,QAAQ;IACnB,8GAA8G;WAChG,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,MAAM;IAY/D,mIAAmI;WACrH,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,OAAO;IASjF;;;;;;;OAOG;WACW,eAAe,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM;IAuBpH;;;;;;;;;OASG;WACW,gCAAgC,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAgBjM;;;;;OAKG;WACW,sBAAsB,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAAG,eAAe,GAAG,SAAS;IAGvI;;;;OAIG;WACW,6BAA6B,CAAC,KAAK,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAAG,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;IAGlK;;;;;;;OAOG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,EAAE,cAAc,GAAE,MAAM,GAAG,SAAwC,GAAG,QAAQ,GAAG,SAAS;IAOhM;;;;;;;;OAQG;WACW,2BAA2B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,aAAa,EAAE,CAAC,WAAW,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,CAAC,EAAE,aAAa,EAAE,YAAY,GAAE,MAAqC,EAAE,cAAc,GAAE,MAAM,GAAG,SAAwC;CAO3Q"}
+{"version":3,"file":"CurveOps.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveOps.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAe,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAGlD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;GAGG;AACH,qBAAa,QAAQ;IACnB,8GAA8G;WAChG,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,MAAM;IAY/D,mIAAmI;WACrH,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,OAAO;IASjF;;;;;;;OAOG;WACW,eAAe,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM;IAuBpH;;;;;;;;;OASG;WACW,gCAAgC,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAgBjM;;;;;OAKG;WACW,sBAAsB,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAAG,eAAe,GAAG,SAAS;IAGvI;;;;OAIG;WACW,6BAA6B,CAAC,KAAK,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAAG,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;IAGlK;;;;;;;OAOG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,EAAE,cAAc,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAOtJ;;;;;;;;OAQG;WACW,2BAA2B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,aAAa,EAAE,CAAC,WAAW,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,CAAC,EAAE,aAAa,EAAE,YAAY,GAAE,MAAqC,EAAE,eAAe,CAAC,EAAE,MAAM;CAOlO"}

package/lib/esm/curve/CurveOps.js

@@ -88,7 +88,7 @@ export class CurveOps {
      * @returns object with named chains, insideOffsets, outsideOffsets
      */
     static collectInsideAndOutsideXYOffsets(fragments, offsetDistance, gapTolerance) {
-        const collector = new MultiChainCollector(gapTolerance);
+        const collector = new MultiChainCollector(gapTolerance, gapTolerance);
         for (const s of fragments) {
             collector.captureCurve(s);
         }
@@ -129,7 +129,7 @@ export class CurveOps {
      * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
      * @returns chains, possibly wrapped in a [[BagOfCurves]].
      */
-    static collectChains(fragments, gapTolerance = Geometry.smallMetricDistance, planeTolerance = Geometry.smallMetricDistance) {
+    static collectChains(fragments, gapTolerance = Geometry.smallMetricDistance, planeTolerance) {
         const collector = new MultiChainCollector(gapTolerance, planeTolerance);
         for (const s of fragments) {
             collector.captureCurve(s);
@@ -137,16 +137,16 @@ export class CurveOps {
         return collector.grabResult(true);
     }
     /**
-     * Restructure curve fragments as Paths and Loops, to be stroked and passed into the callback.
+     * Restructure curve fragments, to be stroked and passed into the callback.
      * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.
      * @param fragments fragments to be chained and stroked
      * @param announceChain callback to process each stroked Path and Loop
      * @param strokeOptions options for stroking the chains
      * @param gapTolerance distance to be treated as "effectively zero" when assembling fragments head-to-tail. Also used for removing duplicate points in the stroked chains.
-     * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
+     * @param _planeTolerance unused, pass undefined
      */
-    static collectChainsAsLineString3d(fragments, announceChain, strokeOptions, gapTolerance = Geometry.smallMetricDistance, planeTolerance = Geometry.smallMetricDistance) {
-        const collector = new MultiChainCollector(gapTolerance, planeTolerance);
+    static collectChainsAsLineString3d(fragments, announceChain, strokeOptions, gapTolerance = Geometry.smallMetricDistance, _planeTolerance) {
+        const collector = new MultiChainCollector(gapTolerance); // no planarity tolerance needed
         for (const s of fragments) {
             collector.captureCurve(s);
         }

package/lib/esm/curve/CurveOps.js.map

@@ -1 +1 @@
-{"version":3,"file":"CurveOps.js","sourceRoot":"","sources":["../../../src/curve/CurveOps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAE,mBAAmB,EAAE,MAAM,wCAAwC,CAAC;AAC7E,OAAO,EAAE,2BAA2B,EAAE,MAAM,yCAAyC,CAAC;AAEtF,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAG9B;;;GAGG;AACH,MAAM,OAAO,QAAQ;IACnB,8GAA8G;IACvG,MAAM,CAAC,UAAU,CAAC,MAA6B;QACpD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,YAAY,cAAc,EAAE,CAAC;YACrC,KAAK,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;QAChC,CAAC;aAAM,IAAI,MAAM,YAAY,eAAe,EAAE,CAAC;YAC7C,KAAK,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QAC/B,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,KAAK,MAAM,KAAK,IAAI,MAAM;gBACxB,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mIAAmI;IAC5H,MAAM,CAAC,WAAW,CAAC,KAAc,EAAE,MAA6B;QACrE,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,KAAK,IAAI,MAAM;gBACxB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,eAAe,CAAC,MAAyC,EAAE,MAAc,EAAE,MAAkB;QACzG,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,MAAM,YAAY,cAAc,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,2BAA2B,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;YAChG,IAAI,OAAO,EAAE,CAAC;gBACZ,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,IAAI,IAAI,MAAM,YAAY,IAAI,EAAE,CAAC;YAC5D,MAAM,OAAO,GAAG,2BAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACnF,IAAI,OAAO,EAAE,CAAC;gBACZ,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,WAAW,EAAE,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ;gBAC7B,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,MAAM;gBACpB,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,gCAAgC,CAAC,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAChH,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,EAAE,SAAS,CAAC,CAAC;QAClF,MAAM,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;QACnF,IAAI,aAAa,GAAG,aAAa,EAAE,CAAC;YAClC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACzE,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAmB,EAAE,uBAA+C;QACvG,OAAO,2BAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IAC7F,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,KAAqB,EAAE,uBAA+C;QAChH,OAAO,2BAA2B,CAAC,6BAA6B,CAAC,KAAK,EAAE,uBAAuB,CAAC,CAAC;IACnG,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,QAAQ,CAAC,mBAAmB,EAAE,iBAAqC,QAAQ,CAAC,mBAAmB;QACvK,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,2BAA2B,CAAC,SAAqB,EAAE,aAAkD,EAAE,aAA6B,EAAE,eAAuB,QAAQ,CAAC,mBAAmB,EAAE,iBAAqC,QAAQ,CAAC,mBAAmB;QACxQ,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,SAAS,CAAC,4BAA4B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IACvE,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { BagOfCurves, CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyChain, AnyCurve } from \"./CurveTypes\";\r\nimport { MultiChainCollector } from \"./internalContexts/MultiChainCollector\";\r\nimport { CurveChainWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop } from \"./Loop\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Static methods for miscellaneous curve operations.\r\n * @public\r\n */\r\nexport class CurveOps {\r\n  /** Recursively sum curve lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level. */\r\n  public static sumLengths(curves: AnyCurve | AnyCurve[]): number {\r\n    let mySum = 0;\r\n    if (curves instanceof CurvePrimitive) {\r\n      mySum += curves.curveLength();\r\n    } else if (curves instanceof CurveCollection) {\r\n      mySum += curves.sumLengths();\r\n    } else if (Array.isArray(curves)) {\r\n      for (const data1 of curves)\r\n        mySum += this.sumLengths(data1);\r\n    }\r\n    return mySum;\r\n  }\r\n  /** Recursively extend the range by each curve's range, allowing CurvePrimitive, CurveCollection, or array of such at any level. */\r\n  public static extendRange(range: Range3d, curves: AnyCurve | AnyCurve[]): Range3d {\r\n    if (Array.isArray(curves)) {\r\n      for (const data1 of curves)\r\n        this.extendRange(range, data1);\r\n    } else {\r\n      curves.extendRange(range);\r\n    }\r\n    return range;\r\n  }\r\n  /**\r\n   * Construct a separate xy-offset for each input curve.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * @param curves input curve(s), z-coordinates ignored. Only curves of type [[AnyChain]] are handled.\r\n   * @param offset offset distance (positive to left of curve, negative to right)\r\n   * @param result array to collect offset curves\r\n   * @returns summed length of offset curves\r\n   */\r\n  public static appendXYOffsets(curves: AnyCurve | AnyCurve[] | undefined, offset: number, result: AnyCurve[]): number {\r\n    let summedLengths = 0;\r\n    if (curves instanceof CurvePrimitive) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(Path.create(curves), offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (curves instanceof Loop || curves instanceof Path) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(curves, offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (curves instanceof BagOfCurves) {\r\n      for (const q of curves.children)\r\n        summedLengths += this.appendXYOffsets(q, offset, result);\r\n    } else if (Array.isArray(curves)) {\r\n      for (const q of curves)\r\n        summedLengths += this.appendXYOffsets(q, offset, result);\r\n    }\r\n    return summedLengths;\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops, and construct xy-offsets of the chains.\r\n   * * If the inputs do not form Loop(s), the classification of offsets is suspect.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained and offset\r\n   * @param offsetDistance offset distance, applied to both sides of each fragment to produce inside and outside xy-offset curves.\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when joining head-to-tail\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideXYOffsets(fragments: AnyCurve[], offsetDistance: number, gapTolerance: number): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains?: AnyChain } {\r\n    const collector = new MultiChainCollector(gapTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    const chains = collector.grabResult(true);\r\n    const myOffsetA: CurveCollection[] = [];\r\n    const myOffsetB: CurveCollection[] = [];\r\n    const offsetLengthA = CurveOps.appendXYOffsets(chains, offsetDistance, myOffsetA);\r\n    const offsetLengthB = CurveOps.appendXYOffsets(chains, -offsetDistance, myOffsetB);\r\n    if (offsetLengthA > offsetLengthB) {\r\n      return { outsideOffsets: myOffsetA, insideOffsets: myOffsetB, chains };\r\n    } else {\r\n      return { insideOffsets: myOffsetA, outsideOffsets: myOffsetB, chains };\r\n    }\r\n  }\r\n  /**\r\n   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n   * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.\r\n   * @param curves base curves.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n   */\r\n  public static constructCurveXYOffset(curves: Path | Loop, offsetDistanceOrOptions: number | OffsetOptions): CurveCollection | undefined {\r\n    return CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Create the offset of a single curve primitive as viewed in the xy-plane (ignoring z).\r\n   * @param curve primitive to offset\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object\r\n   */\r\n  public static createSingleOffsetPrimitiveXY(curve: CurvePrimitive, offsetDistanceOrOptions: number | OffsetOptions): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    return CurveChainWireOffsetContext.createSingleOffsetPrimitiveXY(curve, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\r\n   * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.\r\n   * @returns chains, possibly wrapped in a [[BagOfCurves]].\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance, planeTolerance: number | undefined = Geometry.smallMetricDistance): AnyChain | undefined {\r\n    const collector = new MultiChainCollector(gapTolerance, planeTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    return collector.grabResult(true);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops, to be stroked and passed into the callback.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained and stroked\r\n   * @param announceChain callback to process each stroked Path and Loop\r\n   * @param strokeOptions options for stroking the chains\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail. Also used for removing duplicate points in the stroked chains.\r\n   * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.\r\n   */\r\n  public static collectChainsAsLineString3d(fragments: AnyCurve[], announceChain: (chainPoints: LineString3d) => void, strokeOptions?: StrokeOptions, gapTolerance: number = Geometry.smallMetricDistance, planeTolerance: number | undefined = Geometry.smallMetricDistance) {\r\n    const collector = new MultiChainCollector(gapTolerance, planeTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    collector.announceChainsAsLineString3d(announceChain, strokeOptions);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CurveOps.js","sourceRoot":"","sources":["../../../src/curve/CurveOps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAE,mBAAmB,EAAE,MAAM,wCAAwC,CAAC;AAC7E,OAAO,EAAE,2BAA2B,EAAE,MAAM,yCAAyC,CAAC;AAEtF,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAG9B;;;GAGG;AACH,MAAM,OAAO,QAAQ;IACnB,8GAA8G;IACvG,MAAM,CAAC,UAAU,CAAC,MAA6B;QACpD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,YAAY,cAAc,EAAE,CAAC;YACrC,KAAK,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;QAChC,CAAC;aAAM,IAAI,MAAM,YAAY,eAAe,EAAE,CAAC;YAC7C,KAAK,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QAC/B,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,KAAK,MAAM,KAAK,IAAI,MAAM;gBACxB,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mIAAmI;IAC5H,MAAM,CAAC,WAAW,CAAC,KAAc,EAAE,MAA6B;QACrE,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,KAAK,IAAI,MAAM;gBACxB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,eAAe,CAAC,MAAyC,EAAE,MAAc,EAAE,MAAkB;QACzG,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,MAAM,YAAY,cAAc,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,2BAA2B,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;YAChG,IAAI,OAAO,EAAE,CAAC;gBACZ,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,IAAI,IAAI,MAAM,YAAY,IAAI,EAAE,CAAC;YAC5D,MAAM,OAAO,GAAG,2BAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACnF,IAAI,OAAO,EAAE,CAAC;gBACZ,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,WAAW,EAAE,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ;gBAC7B,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,MAAM;gBACpB,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,gCAAgC,CAAC,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAChH,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;QACtE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,EAAE,SAAS,CAAC,CAAC;QAClF,MAAM,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;QACnF,IAAI,aAAa,GAAG,aAAa,EAAE,CAAC;YAClC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACzE,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAmB,EAAE,uBAA+C;QACvG,OAAO,2BAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IAC7F,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,KAAqB,EAAE,uBAA+C;QAChH,OAAO,2BAA2B,CAAC,6BAA6B,CAAC,KAAK,EAAE,uBAAuB,CAAC,CAAC;IACnG,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,QAAQ,CAAC,mBAAmB,EAAE,cAAuB;QAC7H,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,2BAA2B,CAAC,SAAqB,EAAE,aAAkD,EAAE,aAA6B,EAAE,eAAuB,QAAQ,CAAC,mBAAmB,EAAE,eAAwB;QAC/N,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,CAAC,CAAC,CAAC,gCAAgC;QACzF,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,SAAS,CAAC,4BAA4B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IACvE,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { BagOfCurves, CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyChain, AnyCurve } from \"./CurveTypes\";\r\nimport { MultiChainCollector } from \"./internalContexts/MultiChainCollector\";\r\nimport { CurveChainWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop } from \"./Loop\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Static methods for miscellaneous curve operations.\r\n * @public\r\n */\r\nexport class CurveOps {\r\n  /** Recursively sum curve lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level. */\r\n  public static sumLengths(curves: AnyCurve | AnyCurve[]): number {\r\n    let mySum = 0;\r\n    if (curves instanceof CurvePrimitive) {\r\n      mySum += curves.curveLength();\r\n    } else if (curves instanceof CurveCollection) {\r\n      mySum += curves.sumLengths();\r\n    } else if (Array.isArray(curves)) {\r\n      for (const data1 of curves)\r\n        mySum += this.sumLengths(data1);\r\n    }\r\n    return mySum;\r\n  }\r\n  /** Recursively extend the range by each curve's range, allowing CurvePrimitive, CurveCollection, or array of such at any level. */\r\n  public static extendRange(range: Range3d, curves: AnyCurve | AnyCurve[]): Range3d {\r\n    if (Array.isArray(curves)) {\r\n      for (const data1 of curves)\r\n        this.extendRange(range, data1);\r\n    } else {\r\n      curves.extendRange(range);\r\n    }\r\n    return range;\r\n  }\r\n  /**\r\n   * Construct a separate xy-offset for each input curve.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * @param curves input curve(s), z-coordinates ignored. Only curves of type [[AnyChain]] are handled.\r\n   * @param offset offset distance (positive to left of curve, negative to right)\r\n   * @param result array to collect offset curves\r\n   * @returns summed length of offset curves\r\n   */\r\n  public static appendXYOffsets(curves: AnyCurve | AnyCurve[] | undefined, offset: number, result: AnyCurve[]): number {\r\n    let summedLengths = 0;\r\n    if (curves instanceof CurvePrimitive) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(Path.create(curves), offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (curves instanceof Loop || curves instanceof Path) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(curves, offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (curves instanceof BagOfCurves) {\r\n      for (const q of curves.children)\r\n        summedLengths += this.appendXYOffsets(q, offset, result);\r\n    } else if (Array.isArray(curves)) {\r\n      for (const q of curves)\r\n        summedLengths += this.appendXYOffsets(q, offset, result);\r\n    }\r\n    return summedLengths;\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops, and construct xy-offsets of the chains.\r\n   * * If the inputs do not form Loop(s), the classification of offsets is suspect.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained and offset\r\n   * @param offsetDistance offset distance, applied to both sides of each fragment to produce inside and outside xy-offset curves.\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when joining head-to-tail\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideXYOffsets(fragments: AnyCurve[], offsetDistance: number, gapTolerance: number): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains?: AnyChain } {\r\n    const collector = new MultiChainCollector(gapTolerance, gapTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    const chains = collector.grabResult(true);\r\n    const myOffsetA: CurveCollection[] = [];\r\n    const myOffsetB: CurveCollection[] = [];\r\n    const offsetLengthA = CurveOps.appendXYOffsets(chains, offsetDistance, myOffsetA);\r\n    const offsetLengthB = CurveOps.appendXYOffsets(chains, -offsetDistance, myOffsetB);\r\n    if (offsetLengthA > offsetLengthB) {\r\n      return { outsideOffsets: myOffsetA, insideOffsets: myOffsetB, chains };\r\n    } else {\r\n      return { insideOffsets: myOffsetA, outsideOffsets: myOffsetB, chains };\r\n    }\r\n  }\r\n  /**\r\n   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n   * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.\r\n   * @param curves base curves.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n   */\r\n  public static constructCurveXYOffset(curves: Path | Loop, offsetDistanceOrOptions: number | OffsetOptions): CurveCollection | undefined {\r\n    return CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Create the offset of a single curve primitive as viewed in the xy-plane (ignoring z).\r\n   * @param curve primitive to offset\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object\r\n   */\r\n  public static createSingleOffsetPrimitiveXY(curve: CurvePrimitive, offsetDistanceOrOptions: number | OffsetOptions): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    return CurveChainWireOffsetContext.createSingleOffsetPrimitiveXY(curve, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\r\n   * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.\r\n   * @returns chains, possibly wrapped in a [[BagOfCurves]].\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance, planeTolerance?: number): AnyChain | undefined {\r\n    const collector = new MultiChainCollector(gapTolerance, planeTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    return collector.grabResult(true);\r\n  }\r\n  /**\r\n   * Restructure curve fragments, to be stroked and passed into the callback.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained and stroked\r\n   * @param announceChain callback to process each stroked Path and Loop\r\n   * @param strokeOptions options for stroking the chains\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail. Also used for removing duplicate points in the stroked chains.\r\n   * @param _planeTolerance unused, pass undefined\r\n   */\r\n  public static collectChainsAsLineString3d(fragments: AnyCurve[], announceChain: (chainPoints: LineString3d) => void, strokeOptions?: StrokeOptions, gapTolerance: number = Geometry.smallMetricDistance, _planeTolerance?: number) {\r\n    const collector = new MultiChainCollector(gapTolerance); // no planarity tolerance needed\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    collector.announceChainsAsLineString3d(announceChain, strokeOptions);\r\n  }\r\n}\r\n"]}

package/lib/esm/curve/CurvePrimitive.d.ts

@@ -440,7 +440,7 @@ export declare abstract class CurvePrimitive extends GeometryQuery {
     /**
      * Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).
      * * No attempt is made to join the offsets of smaller constituent primitives. To construct a fully joined offset
-     * for an aggregate instance (e.g., LineString3d, CurveChainWithDistanceIndex), use RegionOps.constructCurveXYOffset()
+     * for an aggregate instance (e.g., LineString3d, CurveChainWithDistanceIndex), use [[CurveOps.constructCurveXYOffset]]
      * instead.
      * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object
      */