@itwin/core-geometry 4.2.0-dev.3 → 4.2.0-dev.31

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

@@ -1 +1 @@
-{"version":3,"file":"StrokeCountChain.js","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAC1C,sEAA2D;AAG3D,wDAAiE;AACjE,kDAA+C;AAC/C,kCAA+B;AAC/B,kDAA+C;AAE/C,qDAAkD;AAElD,qBAAqB;AACrB;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAsB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAepH;;;OAGG;IACI,SAAS,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAEnH;AA7BD,wEA6BC;AACD;;;;GAIG;AACH,MAAa,kCAAmC,SAAQ,8BAA8B;IAEpF;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,+BAAc,CAAC,wBAAwB,EAAE,CAAC;IACzD,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE;YACrB,oEAAoE;YACpE,OAAO,IAAI,CAAC;SACb;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,IAAI,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS;gBACtC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;YACvC,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE;YACrB,gCAAgC;YAChC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACrC,OAAO,IAAI,CAAC;SACb;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AAlCD,gFAkCC;AACD;;;;GAIG;AACH,MAAa,wCAAyC,SAAQ,8BAA8B;IAE1F;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;IAC5B,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE;YACrB,oEAAoE;YACpE,OAAO,IAAI,CAAC;SACb;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,IAAI,CAAC,cAAc,GAAG,mBAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3E,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE;YACrB,gCAAgC;YAChC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;YACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;YAC7B,OAAO,IAAI,CAAC;SACb;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AAlCD,4FAkCC;AACD;;;;;;GAMG;AACH,MAAa,gBAAgB;IAU3B,YAAoB,MAAwB,EAAE,OAAuB;QACnE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IACM,MAAM,CAAC,mBAAmB,CAAC,KAAiB,EAAE,OAAuB;QAC1E,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,2CAA2C;QAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE;YAC9B,CAAC,CAAC,qCAAqC,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,CAAC,CAAC,UAAU;gBACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;SAClC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,UAAU;QACf,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,OAAO,EAAE;YAChB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE;gBACvD,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,EAAE,CAAC,sBAAsB,EAAE,CAAC;gBAC5B,EAAE,CAAC,mBAAmB,EAAE,CAAC;aAC1B;SACF;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;YACzB,IAAI,CAAC,CAAC,SAAS;gBACb,CAAC,CAAC,SAAS,CAAC,8BAA8B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;SACrD;QACD,OAAO,EAAE,CAAC;IAEZ,CAAC;IACD,wBAAwB;IAChB,MAAM,CAAC,8BAA8B,CAAC,IAAsB,EAAE,WAAmB;QACvF,IAAI,SAAS,GAAG,WAAW,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;YACpB,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YAClB,IAAI,CAAC,CAAC,aAAa,EAAE;gBACnB,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,8BAA8B,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;aACnE;iBAAM;gBACL,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;aACnB;YACD,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;SAClB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAmB;QAC5C,OAAO,gBAAgB,CAAC,8BAA8B,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACjF,CAAC;CACF;AAvED,4CAuEC;AAED;;;;;GAKG;AACH,MAAa,kBAAkB;IAG7B,YAAoB,MAAwB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;IACzF;;;OAGG;IACI,MAAM,CAAC,4BAA4B,CAAC,MAAuB,EAAE,OAAuB;QACzF,MAAM,MAAM,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,MAAM,YAAY,2BAAY,EAAE;YAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACnC,MAAM,CAAC,GAAG,gBAAgB,CAAC,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACvB;SACF;aAAM,IAAI,MAAM,YAAY,4BAAU,EAAE;YACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;SAC3E;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,qBAAqB,CAAC,QAA8B,EAAE,aAAsB;QACxF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC,CAAE,gEAAgE;QAChF,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACxC,mDAAmD;YACnD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS;gBACzC,OAAO,KAAK,CAAC;YACf,yEAAyE;YACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAClD,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACvD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY;oBACpD,OAAO,KAAK,CAAC;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;oBACrC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;wBAC7G,OAAO,KAAK,CAAC;iBAChB;aACF;SAEF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,wBAAwB,CAAC,QAA8B;QACnE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAC9B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE;gBAClC,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;aAChC;SACF;IACH,CAAC;IAEO,MAAM,CAAC,yCAAyC,CAAC,QAA8B,EAAE,UAAkB,EAAE,cAAsB,EACjI,cAAkC,EAAE,QAAwC;QAC5E,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QACpF,IAAI,cAAc,KAAK,SAAS,EAAE;YAChC,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE;gBAC3B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;wBACvF,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;aAChB;SACF;aAAM;YACL,qFAAqF;YACrF,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE;gBAC3B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAc,CAAC,cAAc,CAAC,CAAC;wBACtH,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;aAChB;SAEF;QACD,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,4CAA4C,CAAC,QAA8B,EAAE,QAAwC;QACjI,MAAM,kBAAkB,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,kBAAkB,EAAE,UAAU,EAAE,EAAE;YACtE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAChE,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,YAAY,EAAE,cAAc,EAAE,EAAE;gBAC5E,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAa,EAAE;oBACrE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,aAAc,CAAC,MAAM,CAAC;oBAChG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE;wBACnC,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,CAAC;4BACpG,OAAO,KAAK,CAAC;iBAElB;qBAAM;oBACL,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,SAAS,EAAE,QAAQ,CAAC;wBAC5G,OAAO,KAAK,CAAC;iBAChB;aACF;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,+BAA+B,CAAC,QAA8B;QAE1E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,kCAAkC,EAAE,CAAC;QACzD,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IAEd,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA8B;QAExE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,wCAAwC,EAAE,CAAC;QAC/D,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAEd,CAAC;IAED;;OAEG;IACI,UAAU;QACf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;SACpC;aAAM;YACL,MAAM,MAAM,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;gBAC3B,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;gBAC/B,IAAI,OAAO,YAAY,2BAAY;oBACjC,MAAM,CAAC,WAAW,CAAC,WAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;aAC5C;YACD,OAAO,MAAM,CAAC;SACf;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,iCAAiC,CAAC,OAAiB,EAAE,OAAiB,EAAE,aAAsB;QAC1G,IAAI,OAAO,YAAY,2BAAY,EAAE;YACnC,IAAI,OAAO,YAAY,2BAAY,EAAE;gBACnC,IAAI,OAAO,CAAC,SAAS,EAAE,KAAK,OAAO,CAAC,SAAS,EAAE,EAAE;oBAC/C,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;oBAC9B,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBACvC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;wBAC1B,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;qBAChD;oBACD,OAAO,IAAI,CAAC;iBACb;aACF;SACF;aAAM,IAAI,OAAO,YAAY,2BAAY,EAAE;YAC1C,IAAI,OAAO,YAAY,2BAAY,EAAE;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE;oBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;wBAC1B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;qBAChB;oBACD,OAAO,IAAI,CAAC;iBACb;aACF;SACF;aAAM,IAAI,OAAO,YAAY,4BAAU,EAAE;YACxC,IAAI,OAAO,YAAY,4BAAU,EAAE;gBACjC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE;oBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;wBAC1B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;qBAChB;oBACD,OAAO,IAAI,CAAC;iBACb;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA/ND,gDA+NC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Range1d } from \"../../geometry3d/Range\";\r\nimport { AnyCurve } from \"../CurveChain\";\r\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\nimport { StrokeCountMap } from \"./StrokeCountMap\";\r\n\r\n// cspell:word remapa\r\n/**\r\n * abstract methods for callbacks during sweeps of collections of StrokeCount Structures.\r\n * * A set of StrokeCountMaps are to be visited multiple times.\r\n * * The logic that controls the sweep is as below.\r\n * * The callback object controls the number of sweeps and can adapt its action to the respective sweeps.\r\n * * Note that a \"false\" from cb.startPass() terminates passes for this chainIndex and primitiveIndex, but all others exit the whole sequence.\r\n * * This logic occurs 2 or three levels deep\r\n *   * outer level is \"chains\".   Simple swept path or loops have only one outer; parity regions have one outer per loop of the parity region\r\n *   * second level is primitive within chain.\r\n *     * If the primitives in a set are \"single component\", second level is lowest.\r\n *        * startSweep() and endSweep() calls are two parameters, with undefined componentIndex\r\n *     * If the primitives in a set are multi-component, there is a third level looping through corresponding components.\r\n * `\r\n *    if (!cb.startSweeps (chainIndex, primitiveIndex, componentIndex))\r\n *      return false;\r\n *    for (let pass = 0;cb.startPass (pass); pass++){\r\n *      for (each map in working set)\r\n *            if (!cb.visit (pass, map)) return false;\r\n *       if (!cb.endPass ()) return false;\r\n *        }\r\n *      }\r\n * if (!cb.endSweeps (chainIndex, primitiveIndex, componentIndex)) return false;\r\n * return true;\r\n * `\r\n * @internal\r\n */\r\nexport abstract class StrokeCountMapMultipassVisitor {\r\n  /**\r\n   * called to announce the beginning of one or more sweeps through related StrokeCountMap's\r\n   * @param chainIndex index of loop or path within the various contours.\r\n   * @param primitiveIndex index of primitive within the loop or path.\r\n   * @param componentIndex optional component index.\r\n   * @returns the number of sweeps to perform.\r\n   */\r\n  public startSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\r\n  /**\r\n   * announce the beginning of a sweep pass.\r\n   * @param pass the index (0,1...) for this sweep pass.\r\n   * @return true to execute this pass.  false to break from the pass loop (next method called is endSweeps)\r\n   */\r\n  public abstract startPass(pass: number): boolean;\r\n  public abstract visit(pass: number, map: StrokeCountMap): boolean;\r\n  /**\r\n   * announce the end of a pass\r\n   * @param pass the index (0,1...) for this sweep pass.\r\n   * @return true to continue the sweeps.\r\n   */\r\n\r\n  public abstract endPass(pass: number): boolean;\r\n  /**\r\n   * announce the end of handling for particular chainIndex and primitiveIndex;\r\n   * @return true to continue outer loops.\r\n   */\r\n  public endSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\r\n\r\n}\r\n/**\r\n * * pass 1: determine max numStroke\r\n * * pass 2: impose max numStroke\r\n * @internal\r\n */\r\nexport class StrokeCountMapVisitorApplyMaxCount extends StrokeCountMapMultipassVisitor {\r\n  public myMap: StrokeCountMap;\r\n  public constructor() {\r\n    super();\r\n    this.myMap = StrokeCountMap.createWithComponentIndex();\r\n  }\r\n  /** set up for a pass through corresponding maps. */\r\n  public startPass(pass: number): boolean {\r\n    if (pass === 0) {\r\n      this.myMap.numStroke = 0;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // nothing to change == numStroke will be applied to each primitive.\r\n      return true;\r\n    }\r\n    // all other pass numbers are rejected ...\r\n    return false;\r\n  }\r\n  /** visit one of the set of corresponding maps. */\r\n  public visit(pass: number, map: StrokeCountMap): boolean {\r\n    if (pass === 0) {\r\n      if (map.numStroke > this.myMap.numStroke)\r\n        this.myMap.numStroke = map.numStroke;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // apply the max from prior pass\r\n      map.numStroke = this.myMap.numStroke;\r\n      return true;\r\n    }\r\n    // no other pass values should happen -- canceled by startPass.\r\n    return false;\r\n  }\r\n\r\n  public endPass(_pass: number): boolean { return true; }\r\n}\r\n/**\r\n * * pass 1: determine max curveLength among maps presented.\r\n * * pass 2: set the a0 and a1 values to 0 and that max distance\r\n * @internal\r\n */\r\nexport class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCountMapMultipassVisitor {\r\n  public maxCurveLength: number;\r\n  public constructor() {\r\n    super();\r\n    this.maxCurveLength = 0.0;\r\n  }\r\n  /** set up for a pass through corresponding maps. */\r\n  public startPass(pass: number): boolean {\r\n    if (pass === 0) {\r\n      this.maxCurveLength = 0;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // nothing to change == numStroke will be applied to each primitive.\r\n      return true;\r\n    }\r\n    // all other pass numbers are rejected ...\r\n    return false;\r\n  }\r\n  /** visit one of the set of corresponding maps. */\r\n  public visit(pass: number, map: StrokeCountMap): boolean {\r\n    if (pass === 0) {\r\n      this.maxCurveLength = Geometry.maxXY(map.curveLength, this.maxCurveLength);\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // apply the max from prior pass\r\n      map.a0 = 0.0;\r\n      map.a1 = this.maxCurveLength;\r\n      return true;\r\n    }\r\n    // no other pass values should happen -- canceled by startPass.\r\n    return false;\r\n  }\r\n\r\n  public endPass(_pass: number): boolean { return true; }\r\n}\r\n/**\r\n * class `StrokeCountChain` contains:\r\n * * `maps` = an array of `StrokeCountMap`\r\n * * `parent` = parent CurveCollection.\r\n *\r\n * An instance is normally created with either a `Path` or `Loop` as the parent.\r\n */\r\nexport class StrokeCountChain {\r\n  public maps: StrokeCountMap[];\r\n  public parent?: CurveCollection;\r\n  /**\r\n   * options are used (with different purposes) at two times:\r\n   * * When the StrokeCountChain is created, the options affect the stroke counts.  This is just creating markup, not actual strokes.\r\n   * * When actual stroking happens, the options control creation of parameters and tangents.\r\n   */\r\n  public options?: StrokeOptions;\r\n\r\n  private constructor(parent?: CurveCollection, options?: StrokeOptions) {\r\n    this.parent = parent;\r\n    this.maps = [];\r\n    this.options = options;\r\n  }\r\n  public static createForCurveChain(chain: CurveChain, options?: StrokeOptions): StrokeCountChain {\r\n    const result = new StrokeCountChain(chain, options);\r\n    result.parent = chain;\r\n    // A chain can only contain primitives !!!!\r\n    for (const p of chain.children) {\r\n      p.computeAndAttachRecursiveStrokeCounts(options);\r\n      if (p.strokeData)\r\n        result.maps.push(p.strokeData);\r\n    }\r\n    return result;\r\n  }\r\n  public getStrokes(): LineString3d {\r\n    const ls = LineString3d.create();\r\n    if (this.options) {\r\n      if (this.options.needNormals || this.options.needParams) {\r\n        ls.ensureEmptyFractions();\r\n        ls.ensureEmptyDerivatives();\r\n        ls.ensureEmptyUVParams();\r\n      }\r\n    }\r\n    for (const m of this.maps) {\r\n      if (m.primitive)\r\n        m.primitive.addMappedStrokesToLineString3D(m, ls);\r\n    }\r\n    return ls;\r\n\r\n  }\r\n  /** internal form of  */\r\n  private static applySummed01LimitsWithinArray(maps: StrokeCountMap[], incomingSum: number): number {\r\n    let movingSum = incomingSum;\r\n    for (const m of maps) {\r\n      m.a0 += movingSum;\r\n      if (m.componentData) {\r\n        m.a1 = this.applySummed01LimitsWithinArray(m.componentData, m.a0);\r\n      } else {\r\n        m.a1 += movingSum;\r\n      }\r\n      movingSum = m.a1;\r\n    }\r\n    return movingSum;\r\n  }\r\n  /**\r\n   * walk the maps in the array.\r\n   * * in maps with no component data\r\n   *   * increment map.a0 and map.a1 by the incoming distance a0\r\n   * * in maps with component data:\r\n   *   * recurse through the component array.\r\n   *   * increment map.a0 by the incoming a0.\r\n   *   * returned a1 from the componentData array becomes a1\r\n   * @returns upper value of a1 in final map.\r\n   * @param maps\r\n   * @param incomingSum lower value to add to a0 for first map.\r\n   */\r\n  public applySummed01Limits(incomingSum: number): number {\r\n    return StrokeCountChain.applySummed01LimitsWithinArray(this.maps, incomingSum);\r\n  }\r\n}\r\n\r\n/**\r\n * class `StrokeCountSection`\\\r\n * * contains an array of `StrokeCountChain`.\r\n * * Hence it is the internal node level of a (1-level-deep) tree of `StrokeCountChain`\r\n * @internal\r\n */\r\nexport class StrokeCountSection {\r\n  public chains: StrokeCountChain[];\r\n  public parent?: CurveCollection;\r\n  private constructor(parent?: CurveCollection) { this.parent = parent; this.chains = []; }\r\n  /**\r\n   * construct array of arrays of `StrokeCountMap`s\r\n   * @param parent\r\n   */\r\n  public static createForParityRegionOrChain(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection {\r\n    const result = new StrokeCountSection(parent);\r\n    if (parent instanceof ParityRegion) {\r\n      for (const child of parent.children) {\r\n        const p = StrokeCountChain.createForCurveChain(child, options);\r\n        result.chains.push(p);\r\n      }\r\n    } else if (parent instanceof CurveChain) {\r\n      result.chains.push(StrokeCountChain.createForCurveChain(parent, options));\r\n    }\r\n    return result;\r\n  }\r\n  /** test if all sections have the same structure. */\r\n  public static areSectionsCompatible(sections: StrokeCountSection[], enforceCounts: boolean): boolean {\r\n    if (sections.length < 2)\r\n      return true;  // hm.. don't know if that is useful, but nothing to check here.\r\n    const numChains = sections[0].chains.length;\r\n    for (let i = 1; i < sections.length; i++) {\r\n      // first level: must match number of paths or loops\r\n      if (sections[i].chains.length !== numChains)\r\n        return false;\r\n      // second level: must have same number of primitives in each path or loop\r\n      for (let j = 0; j < sections[0].chains.length; j++) {\r\n        const numPrimitive = sections[0].chains[j].maps.length;\r\n        if (sections[i].chains[j].maps.length !== numPrimitive)\r\n          return false;\r\n        for (let k = 0; k < numPrimitive; k++) {\r\n          if (!sections[0].chains[j].maps[k].isCompatibleComponentStructure(sections[i].chains[j].maps[k], enforceCounts))\r\n            return false;\r\n        }\r\n      }\r\n\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** Within each section, sweep accumulate curveLength field, recording entry and exit sum in each map.\r\n   * * In expected use, (a0,a1) are (0,a) where a is the (previously computed) max length among corresponding maps up and down the section arrays.\r\n   */\r\n  public static remapa0a1WithinEachChain(sections: StrokeCountSection[]) {\r\n    for (const section of sections) {\r\n      for (const chain of section.chains) {\r\n        chain.applySummed01Limits(0.0);\r\n      }\r\n    }\r\n  }\r\n\r\n  private static applyMultipassVisitorCallbackNoComponents(sections: StrokeCountSection[], chainIndex: number, primitiveIndex: number,\r\n    componentIndex: number | undefined, callback: StrokeCountMapMultipassVisitor) {\r\n    const numSection = sections.length;\r\n    if (!callback.startSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\r\n    if (componentIndex === undefined) {\r\n      // there are corresponding primitives directly at the section, chain, primitive index:\r\n      for (let pass = 0; ; pass++) {\r\n        if (!callback.startPass(pass))\r\n          break;\r\n        for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\r\n          if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex]))\r\n            return false;\r\n        if (!callback.endPass(pass))\r\n          return false;\r\n      }\r\n    } else {\r\n      // there are corresponding primitives at the section, chain, primitive,componentIndex\r\n      // there are corresponding primitives directly at the section, chain, primitive index:\r\n      for (let pass = 0; ; pass++) {\r\n        if (!callback.startPass(pass))\r\n          break;\r\n        for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\r\n          if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex].componentData![componentIndex]))\r\n            return false;\r\n        if (!callback.endPass(pass))\r\n          return false;\r\n      }\r\n\r\n    }\r\n    if (!callback.endSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Walk through the sections, emitting callbacks delimiting groups of corresponding primitives.\r\n   * @param sections array of sections (possibly a single path or loop at each section, or possibly a set of parity loops.)\r\n   * @param callback object to be notified during the traversal\r\n   */\r\n  public static runMultiPassVisitorAtCorrespondingPrimitives(sections: StrokeCountSection[], callback: StrokeCountMapMultipassVisitor): boolean {\r\n    const numChainPerSection = sections[0].chains.length;\r\n    for (let chainIndex = 0; chainIndex < numChainPerSection; chainIndex++) {\r\n      const numPrimitive = sections[0].chains[chainIndex].maps.length;\r\n      for (let primitiveIndex = 0; primitiveIndex < numPrimitive; primitiveIndex++) {\r\n        if (sections[0].chains[chainIndex].maps[primitiveIndex].componentData) {\r\n          const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex]!.componentData!.length;\r\n          for (let i = 0; i < numComponent; i++)\r\n            if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, i, callback))\r\n              return false;\r\n\r\n        } else {\r\n          if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, undefined, callback))\r\n            return false;\r\n        }\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * * Confirm that all sections in the array have the same structure.\r\n   * * Within each corresponding set of entries, apply the max count to all.\r\n   * @param sections array of per-section stroke count entries\r\n   */\r\n  public static enforceStrokeCountCompatibility(sections: StrokeCountSection[]): boolean {\r\n\r\n    if (sections.length < 2)\r\n      return true;\r\n    if (!StrokeCountSection.areSectionsCompatible(sections, false))\r\n      return false;\r\n    const visitor = new StrokeCountMapVisitorApplyMaxCount();\r\n    this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\r\n    return true;\r\n\r\n  }\r\n  /**\r\n   * * Confirm that all sections in the array have the same structure.\r\n   * * Within each corresponding set of entries up and down the sections, set curveLength as the maximum of the respective curve lengths.\r\n   * * Along each section, sum curveLengths (which were just reset) to get consistent along-chain parameters\r\n   * @param sections array of per-section stroke count entries\r\n   */\r\n  public static enforceCompatibleDistanceSums(sections: StrokeCountSection[]): boolean {\r\n\r\n    if (sections.length < 2)\r\n      return true;\r\n    if (!StrokeCountSection.areSectionsCompatible(sections, false))\r\n      return false;\r\n    const visitor = new StrokeCountMapVisitorApplyMaxCurveLength();\r\n    this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\r\n    this.remapa0a1WithinEachChain(sections);\r\n    return true;\r\n\r\n  }\r\n\r\n  /**\r\n   * Return stroked form of the section.\r\n   */\r\n  public getStrokes(): AnyCurve {\r\n    if (this.chains.length === 1) {\r\n      return this.chains[0].getStrokes();\r\n    } else {\r\n      const region = ParityRegion.create();\r\n      for (const c of this.chains) {\r\n        const strokes = c.getStrokes();\r\n        if (strokes instanceof LineString3d)\r\n          region.tryAddChild(Loop.create(strokes));\r\n      }\r\n      return region;\r\n    }\r\n  }\r\n  /**\r\n   * Given two compatible stroke sets (as returned by getStrokes) extend a range\r\n   * with the distances between corresponding points.\r\n   * * Each set of strokes may be:\r\n   *   * linestring\r\n   *   * ParityRegion\r\n   *   * CurveChain (Loop or Path)\r\n   * @param strokeA first set of strokes\r\n   * @param strokeB second set of strokes\r\n   * @param rangeToExtend caller-allocated range to be extended.\r\n   * @returns true if structures are compatible.\r\n   */\r\n  public static extendDistanceRangeBetweenStrokes(strokeA: AnyCurve, strokeB: AnyCurve, rangeToExtend: Range1d): boolean {\r\n    if (strokeA instanceof LineString3d) {\r\n      if (strokeB instanceof LineString3d) {\r\n        if (strokeA.numPoints() === strokeB.numPoints()) {\r\n          const n = strokeA.numPoints();\r\n          const pointA = Point3d.create();\r\n          const pointB = Point3d.create();\r\n          const allPointA = strokeA.packedPoints;\r\n          const allPointB = strokeB.packedPoints;\r\n\r\n          for (let i = 0; i < n; i++) {\r\n            allPointA.getPoint3dAtCheckedPointIndex(i, pointA);\r\n            allPointB.getPoint3dAtCheckedPointIndex(i, pointB);\r\n            rangeToExtend.extendX(pointA.distance(pointB));\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    } else if (strokeA instanceof ParityRegion) {\r\n      if (strokeB instanceof ParityRegion) {\r\n        const childrenA = strokeA.children;\r\n        const childrenB = strokeB.children;\r\n        const n = childrenA.length;\r\n        if (n === childrenB.length) {\r\n          for (let i = 0; i < n; i++) {\r\n            if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\r\n              return false;\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    } else if (strokeA instanceof CurveChain) {\r\n      if (strokeB instanceof CurveChain) {\r\n        const childrenA = strokeA.children;\r\n        const childrenB = strokeB.children;\r\n        const n = childrenA.length;\r\n        if (n === childrenB.length) {\r\n          for (let i = 0; i < n; i++) {\r\n            if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\r\n              return false;\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"StrokeCountChain.js","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAC1C,sEAA2D;AAG3D,wDAAiE;AACjE,kDAA+C;AAC/C,kCAA+B;AAC/B,kDAA+C;AAE/C,qDAAkD;AAElD,qBAAqB;AACrB;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAsB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAepH;;;OAGG;IACI,SAAS,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAEnH;AA7BD,wEA6BC;AACD;;;;GAIG;AACH,MAAa,kCAAmC,SAAQ,8BAA8B;IAEpF;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,+BAAc,CAAC,wBAAwB,EAAE,CAAC;IACzD,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE;YACrB,oEAAoE;YACpE,OAAO,IAAI,CAAC;SACb;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,IAAI,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS;gBACtC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;YACvC,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE;YACrB,gCAAgC;YAChC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACrC,OAAO,IAAI,CAAC;SACb;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AAlCD,gFAkCC;AACD;;;;GAIG;AACH,MAAa,wCAAyC,SAAQ,8BAA8B;IAE1F;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;IAC5B,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE;YACrB,oEAAoE;YACpE,OAAO,IAAI,CAAC;SACb;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE;YACd,IAAI,CAAC,cAAc,GAAG,mBAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3E,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE;YACrB,gCAAgC;YAChC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;YACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;YAC7B,OAAO,IAAI,CAAC;SACb;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AAlCD,4FAkCC;AACD;;;;;;GAMG;AACH,MAAa,gBAAgB;IAU3B,YAAoB,MAAwB,EAAE,OAAuB;QACnE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IACM,MAAM,CAAC,mBAAmB,CAAC,KAAiB,EAAE,OAAuB;QAC1E,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,2CAA2C;QAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE;YAC9B,CAAC,CAAC,qCAAqC,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,CAAC,CAAC,UAAU;gBACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;SAClC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,UAAU;QACf,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,OAAO,EAAE;YAChB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE;gBACvD,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,EAAE,CAAC,sBAAsB,EAAE,CAAC;gBAC5B,EAAE,CAAC,mBAAmB,EAAE,CAAC;aAC1B;SACF;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;YACzB,IAAI,CAAC,CAAC,SAAS;gBACb,CAAC,CAAC,SAAS,CAAC,8BAA8B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;SACrD;QACD,OAAO,EAAE,CAAC;IAEZ,CAAC;IACD,wBAAwB;IAChB,MAAM,CAAC,8BAA8B,CAAC,IAAsB,EAAE,WAAmB;QACvF,IAAI,SAAS,GAAG,WAAW,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;YACpB,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YAClB,IAAI,CAAC,CAAC,aAAa,EAAE;gBACnB,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,8BAA8B,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;aACnE;iBAAM;gBACL,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;aACnB;YACD,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;SAClB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAmB;QAC5C,OAAO,gBAAgB,CAAC,8BAA8B,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACjF,CAAC;CACF;AAvED,4CAuEC;AAED;;;;;GAKG;AACH,MAAa,kBAAkB;IAG7B,YAAoB,MAAwB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;IACzF;;;OAGG;IACI,MAAM,CAAC,4BAA4B,CAAC,MAAuB,EAAE,OAAuB;QACzF,MAAM,MAAM,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,MAAM,YAAY,2BAAY,EAAE;YAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACnC,MAAM,CAAC,GAAG,gBAAgB,CAAC,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACvB;SACF;aAAM,IAAI,MAAM,YAAY,4BAAU,EAAE;YACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;SAC3E;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,qBAAqB,CAAC,QAA8B,EAAE,aAAsB;QACxF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC,CAAE,gEAAgE;QAChF,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACxC,mDAAmD;YACnD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS;gBACzC,OAAO,KAAK,CAAC;YACf,yEAAyE;YACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAClD,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACvD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY;oBACpD,OAAO,KAAK,CAAC;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;oBACrC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;wBAC7G,OAAO,KAAK,CAAC;iBAChB;aACF;SAEF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,wBAAwB,CAAC,QAA8B;QACnE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAC9B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE;gBAClC,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;aAChC;SACF;IACH,CAAC;IAEO,MAAM,CAAC,yCAAyC,CAAC,QAA8B,EAAE,UAAkB,EAAE,cAAsB,EACjI,cAAkC,EAAE,QAAwC;QAC5E,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QACpF,IAAI,cAAc,KAAK,SAAS,EAAE;YAChC,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE;gBAC3B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;wBACvF,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;aAChB;SACF;aAAM;YACL,qFAAqF;YACrF,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE;gBAC3B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAc,CAAC,cAAc,CAAC,CAAC;wBACtH,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;aAChB;SAEF;QACD,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,4CAA4C,CAAC,QAA8B,EAAE,QAAwC;QACjI,MAAM,kBAAkB,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,kBAAkB,EAAE,UAAU,EAAE,EAAE;YACtE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAChE,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,YAAY,EAAE,cAAc,EAAE,EAAE;gBAC5E,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAa,EAAE;oBACrE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,aAAc,CAAC,MAAM,CAAC;oBAChG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE;wBACnC,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,CAAC;4BACpG,OAAO,KAAK,CAAC;iBAElB;qBAAM;oBACL,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,SAAS,EAAE,QAAQ,CAAC;wBAC5G,OAAO,KAAK,CAAC;iBAChB;aACF;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,+BAA+B,CAAC,QAA8B;QAE1E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,kCAAkC,EAAE,CAAC;QACzD,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IAEd,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA8B;QAExE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,wCAAwC,EAAE,CAAC;QAC/D,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAEd,CAAC;IAED;;OAEG;IACI,UAAU;QACf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;SACpC;aAAM;YACL,MAAM,MAAM,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;gBAC3B,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;gBAC/B,IAAI,OAAO,YAAY,2BAAY;oBACjC,MAAM,CAAC,WAAW,CAAC,WAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;aAC5C;YACD,OAAO,MAAM,CAAC;SACf;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,iCAAiC,CAAC,OAAiB,EAAE,OAAiB,EAAE,aAAsB;QAC1G,IAAI,OAAO,YAAY,2BAAY,EAAE;YACnC,IAAI,OAAO,YAAY,2BAAY,EAAE;gBACnC,IAAI,OAAO,CAAC,SAAS,EAAE,KAAK,OAAO,CAAC,SAAS,EAAE,EAAE;oBAC/C,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;oBAC9B,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBACvC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;wBAC1B,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;qBAChD;oBACD,OAAO,IAAI,CAAC;iBACb;aACF;SACF;aAAM,IAAI,OAAO,YAAY,2BAAY,EAAE;YAC1C,IAAI,OAAO,YAAY,2BAAY,EAAE;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE;oBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;wBAC1B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;qBAChB;oBACD,OAAO,IAAI,CAAC;iBACb;aACF;SACF;aAAM,IAAI,OAAO,YAAY,4BAAU,EAAE;YACxC,IAAI,OAAO,YAAY,4BAAU,EAAE;gBACjC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE;oBAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;wBAC1B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;qBAChB;oBACD,OAAO,IAAI,CAAC;iBACb;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA/ND,gDA+NC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Range1d } from \"../../geometry3d/Range\";\r\nimport { AnyCurve } from \"../CurveTypes\";\r\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\nimport { StrokeCountMap } from \"./StrokeCountMap\";\r\n\r\n// cspell:word remapa\r\n/**\r\n * abstract methods for callbacks during sweeps of collections of StrokeCount Structures.\r\n * * A set of StrokeCountMaps are to be visited multiple times.\r\n * * The logic that controls the sweep is as below.\r\n * * The callback object controls the number of sweeps and can adapt its action to the respective sweeps.\r\n * * Note that a \"false\" from cb.startPass() terminates passes for this chainIndex and primitiveIndex, but all others exit the whole sequence.\r\n * * This logic occurs 2 or three levels deep\r\n *   * outer level is \"chains\".   Simple swept path or loops have only one outer; parity regions have one outer per loop of the parity region\r\n *   * second level is primitive within chain.\r\n *     * If the primitives in a set are \"single component\", second level is lowest.\r\n *        * startSweep() and endSweep() calls are two parameters, with undefined componentIndex\r\n *     * If the primitives in a set are multi-component, there is a third level looping through corresponding components.\r\n * `\r\n *    if (!cb.startSweeps (chainIndex, primitiveIndex, componentIndex))\r\n *      return false;\r\n *    for (let pass = 0;cb.startPass (pass); pass++){\r\n *      for (each map in working set)\r\n *            if (!cb.visit (pass, map)) return false;\r\n *       if (!cb.endPass ()) return false;\r\n *        }\r\n *      }\r\n * if (!cb.endSweeps (chainIndex, primitiveIndex, componentIndex)) return false;\r\n * return true;\r\n * `\r\n * @internal\r\n */\r\nexport abstract class StrokeCountMapMultipassVisitor {\r\n  /**\r\n   * called to announce the beginning of one or more sweeps through related StrokeCountMap's\r\n   * @param chainIndex index of loop or path within the various contours.\r\n   * @param primitiveIndex index of primitive within the loop or path.\r\n   * @param componentIndex optional component index.\r\n   * @returns the number of sweeps to perform.\r\n   */\r\n  public startSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\r\n  /**\r\n   * announce the beginning of a sweep pass.\r\n   * @param pass the index (0,1...) for this sweep pass.\r\n   * @return true to execute this pass.  false to break from the pass loop (next method called is endSweeps)\r\n   */\r\n  public abstract startPass(pass: number): boolean;\r\n  public abstract visit(pass: number, map: StrokeCountMap): boolean;\r\n  /**\r\n   * announce the end of a pass\r\n   * @param pass the index (0,1...) for this sweep pass.\r\n   * @return true to continue the sweeps.\r\n   */\r\n\r\n  public abstract endPass(pass: number): boolean;\r\n  /**\r\n   * announce the end of handling for particular chainIndex and primitiveIndex;\r\n   * @return true to continue outer loops.\r\n   */\r\n  public endSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\r\n\r\n}\r\n/**\r\n * * pass 1: determine max numStroke\r\n * * pass 2: impose max numStroke\r\n * @internal\r\n */\r\nexport class StrokeCountMapVisitorApplyMaxCount extends StrokeCountMapMultipassVisitor {\r\n  public myMap: StrokeCountMap;\r\n  public constructor() {\r\n    super();\r\n    this.myMap = StrokeCountMap.createWithComponentIndex();\r\n  }\r\n  /** set up for a pass through corresponding maps. */\r\n  public startPass(pass: number): boolean {\r\n    if (pass === 0) {\r\n      this.myMap.numStroke = 0;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // nothing to change == numStroke will be applied to each primitive.\r\n      return true;\r\n    }\r\n    // all other pass numbers are rejected ...\r\n    return false;\r\n  }\r\n  /** visit one of the set of corresponding maps. */\r\n  public visit(pass: number, map: StrokeCountMap): boolean {\r\n    if (pass === 0) {\r\n      if (map.numStroke > this.myMap.numStroke)\r\n        this.myMap.numStroke = map.numStroke;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // apply the max from prior pass\r\n      map.numStroke = this.myMap.numStroke;\r\n      return true;\r\n    }\r\n    // no other pass values should happen -- canceled by startPass.\r\n    return false;\r\n  }\r\n\r\n  public endPass(_pass: number): boolean { return true; }\r\n}\r\n/**\r\n * * pass 1: determine max curveLength among maps presented.\r\n * * pass 2: set the a0 and a1 values to 0 and that max distance\r\n * @internal\r\n */\r\nexport class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCountMapMultipassVisitor {\r\n  public maxCurveLength: number;\r\n  public constructor() {\r\n    super();\r\n    this.maxCurveLength = 0.0;\r\n  }\r\n  /** set up for a pass through corresponding maps. */\r\n  public startPass(pass: number): boolean {\r\n    if (pass === 0) {\r\n      this.maxCurveLength = 0;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // nothing to change == numStroke will be applied to each primitive.\r\n      return true;\r\n    }\r\n    // all other pass numbers are rejected ...\r\n    return false;\r\n  }\r\n  /** visit one of the set of corresponding maps. */\r\n  public visit(pass: number, map: StrokeCountMap): boolean {\r\n    if (pass === 0) {\r\n      this.maxCurveLength = Geometry.maxXY(map.curveLength, this.maxCurveLength);\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // apply the max from prior pass\r\n      map.a0 = 0.0;\r\n      map.a1 = this.maxCurveLength;\r\n      return true;\r\n    }\r\n    // no other pass values should happen -- canceled by startPass.\r\n    return false;\r\n  }\r\n\r\n  public endPass(_pass: number): boolean { return true; }\r\n}\r\n/**\r\n * class `StrokeCountChain` contains:\r\n * * `maps` = an array of `StrokeCountMap`\r\n * * `parent` = parent CurveCollection.\r\n *\r\n * An instance is normally created with either a `Path` or `Loop` as the parent.\r\n */\r\nexport class StrokeCountChain {\r\n  public maps: StrokeCountMap[];\r\n  public parent?: CurveCollection;\r\n  /**\r\n   * options are used (with different purposes) at two times:\r\n   * * When the StrokeCountChain is created, the options affect the stroke counts.  This is just creating markup, not actual strokes.\r\n   * * When actual stroking happens, the options control creation of parameters and tangents.\r\n   */\r\n  public options?: StrokeOptions;\r\n\r\n  private constructor(parent?: CurveCollection, options?: StrokeOptions) {\r\n    this.parent = parent;\r\n    this.maps = [];\r\n    this.options = options;\r\n  }\r\n  public static createForCurveChain(chain: CurveChain, options?: StrokeOptions): StrokeCountChain {\r\n    const result = new StrokeCountChain(chain, options);\r\n    result.parent = chain;\r\n    // A chain can only contain primitives !!!!\r\n    for (const p of chain.children) {\r\n      p.computeAndAttachRecursiveStrokeCounts(options);\r\n      if (p.strokeData)\r\n        result.maps.push(p.strokeData);\r\n    }\r\n    return result;\r\n  }\r\n  public getStrokes(): LineString3d {\r\n    const ls = LineString3d.create();\r\n    if (this.options) {\r\n      if (this.options.needNormals || this.options.needParams) {\r\n        ls.ensureEmptyFractions();\r\n        ls.ensureEmptyDerivatives();\r\n        ls.ensureEmptyUVParams();\r\n      }\r\n    }\r\n    for (const m of this.maps) {\r\n      if (m.primitive)\r\n        m.primitive.addMappedStrokesToLineString3D(m, ls);\r\n    }\r\n    return ls;\r\n\r\n  }\r\n  /** internal form of  */\r\n  private static applySummed01LimitsWithinArray(maps: StrokeCountMap[], incomingSum: number): number {\r\n    let movingSum = incomingSum;\r\n    for (const m of maps) {\r\n      m.a0 += movingSum;\r\n      if (m.componentData) {\r\n        m.a1 = this.applySummed01LimitsWithinArray(m.componentData, m.a0);\r\n      } else {\r\n        m.a1 += movingSum;\r\n      }\r\n      movingSum = m.a1;\r\n    }\r\n    return movingSum;\r\n  }\r\n  /**\r\n   * walk the maps in the array.\r\n   * * in maps with no component data\r\n   *   * increment map.a0 and map.a1 by the incoming distance a0\r\n   * * in maps with component data:\r\n   *   * recurse through the component array.\r\n   *   * increment map.a0 by the incoming a0.\r\n   *   * returned a1 from the componentData array becomes a1\r\n   * @returns upper value of a1 in final map.\r\n   * @param maps\r\n   * @param incomingSum lower value to add to a0 for first map.\r\n   */\r\n  public applySummed01Limits(incomingSum: number): number {\r\n    return StrokeCountChain.applySummed01LimitsWithinArray(this.maps, incomingSum);\r\n  }\r\n}\r\n\r\n/**\r\n * class `StrokeCountSection`\\\r\n * * contains an array of `StrokeCountChain`.\r\n * * Hence it is the internal node level of a (1-level-deep) tree of `StrokeCountChain`\r\n * @internal\r\n */\r\nexport class StrokeCountSection {\r\n  public chains: StrokeCountChain[];\r\n  public parent?: CurveCollection;\r\n  private constructor(parent?: CurveCollection) { this.parent = parent; this.chains = []; }\r\n  /**\r\n   * construct array of arrays of `StrokeCountMap`s\r\n   * @param parent\r\n   */\r\n  public static createForParityRegionOrChain(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection {\r\n    const result = new StrokeCountSection(parent);\r\n    if (parent instanceof ParityRegion) {\r\n      for (const child of parent.children) {\r\n        const p = StrokeCountChain.createForCurveChain(child, options);\r\n        result.chains.push(p);\r\n      }\r\n    } else if (parent instanceof CurveChain) {\r\n      result.chains.push(StrokeCountChain.createForCurveChain(parent, options));\r\n    }\r\n    return result;\r\n  }\r\n  /** test if all sections have the same structure. */\r\n  public static areSectionsCompatible(sections: StrokeCountSection[], enforceCounts: boolean): boolean {\r\n    if (sections.length < 2)\r\n      return true;  // hm.. don't know if that is useful, but nothing to check here.\r\n    const numChains = sections[0].chains.length;\r\n    for (let i = 1; i < sections.length; i++) {\r\n      // first level: must match number of paths or loops\r\n      if (sections[i].chains.length !== numChains)\r\n        return false;\r\n      // second level: must have same number of primitives in each path or loop\r\n      for (let j = 0; j < sections[0].chains.length; j++) {\r\n        const numPrimitive = sections[0].chains[j].maps.length;\r\n        if (sections[i].chains[j].maps.length !== numPrimitive)\r\n          return false;\r\n        for (let k = 0; k < numPrimitive; k++) {\r\n          if (!sections[0].chains[j].maps[k].isCompatibleComponentStructure(sections[i].chains[j].maps[k], enforceCounts))\r\n            return false;\r\n        }\r\n      }\r\n\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** Within each section, sweep accumulate curveLength field, recording entry and exit sum in each map.\r\n   * * In expected use, (a0,a1) are (0,a) where a is the (previously computed) max length among corresponding maps up and down the section arrays.\r\n   */\r\n  public static remapa0a1WithinEachChain(sections: StrokeCountSection[]) {\r\n    for (const section of sections) {\r\n      for (const chain of section.chains) {\r\n        chain.applySummed01Limits(0.0);\r\n      }\r\n    }\r\n  }\r\n\r\n  private static applyMultipassVisitorCallbackNoComponents(sections: StrokeCountSection[], chainIndex: number, primitiveIndex: number,\r\n    componentIndex: number | undefined, callback: StrokeCountMapMultipassVisitor) {\r\n    const numSection = sections.length;\r\n    if (!callback.startSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\r\n    if (componentIndex === undefined) {\r\n      // there are corresponding primitives directly at the section, chain, primitive index:\r\n      for (let pass = 0; ; pass++) {\r\n        if (!callback.startPass(pass))\r\n          break;\r\n        for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\r\n          if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex]))\r\n            return false;\r\n        if (!callback.endPass(pass))\r\n          return false;\r\n      }\r\n    } else {\r\n      // there are corresponding primitives at the section, chain, primitive,componentIndex\r\n      // there are corresponding primitives directly at the section, chain, primitive index:\r\n      for (let pass = 0; ; pass++) {\r\n        if (!callback.startPass(pass))\r\n          break;\r\n        for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\r\n          if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex].componentData![componentIndex]))\r\n            return false;\r\n        if (!callback.endPass(pass))\r\n          return false;\r\n      }\r\n\r\n    }\r\n    if (!callback.endSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Walk through the sections, emitting callbacks delimiting groups of corresponding primitives.\r\n   * @param sections array of sections (possibly a single path or loop at each section, or possibly a set of parity loops.)\r\n   * @param callback object to be notified during the traversal\r\n   */\r\n  public static runMultiPassVisitorAtCorrespondingPrimitives(sections: StrokeCountSection[], callback: StrokeCountMapMultipassVisitor): boolean {\r\n    const numChainPerSection = sections[0].chains.length;\r\n    for (let chainIndex = 0; chainIndex < numChainPerSection; chainIndex++) {\r\n      const numPrimitive = sections[0].chains[chainIndex].maps.length;\r\n      for (let primitiveIndex = 0; primitiveIndex < numPrimitive; primitiveIndex++) {\r\n        if (sections[0].chains[chainIndex].maps[primitiveIndex].componentData) {\r\n          const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex]!.componentData!.length;\r\n          for (let i = 0; i < numComponent; i++)\r\n            if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, i, callback))\r\n              return false;\r\n\r\n        } else {\r\n          if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, undefined, callback))\r\n            return false;\r\n        }\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * * Confirm that all sections in the array have the same structure.\r\n   * * Within each corresponding set of entries, apply the max count to all.\r\n   * @param sections array of per-section stroke count entries\r\n   */\r\n  public static enforceStrokeCountCompatibility(sections: StrokeCountSection[]): boolean {\r\n\r\n    if (sections.length < 2)\r\n      return true;\r\n    if (!StrokeCountSection.areSectionsCompatible(sections, false))\r\n      return false;\r\n    const visitor = new StrokeCountMapVisitorApplyMaxCount();\r\n    this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\r\n    return true;\r\n\r\n  }\r\n  /**\r\n   * * Confirm that all sections in the array have the same structure.\r\n   * * Within each corresponding set of entries up and down the sections, set curveLength as the maximum of the respective curve lengths.\r\n   * * Along each section, sum curveLengths (which were just reset) to get consistent along-chain parameters\r\n   * @param sections array of per-section stroke count entries\r\n   */\r\n  public static enforceCompatibleDistanceSums(sections: StrokeCountSection[]): boolean {\r\n\r\n    if (sections.length < 2)\r\n      return true;\r\n    if (!StrokeCountSection.areSectionsCompatible(sections, false))\r\n      return false;\r\n    const visitor = new StrokeCountMapVisitorApplyMaxCurveLength();\r\n    this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\r\n    this.remapa0a1WithinEachChain(sections);\r\n    return true;\r\n\r\n  }\r\n\r\n  /**\r\n   * Return stroked form of the section.\r\n   */\r\n  public getStrokes(): AnyCurve {\r\n    if (this.chains.length === 1) {\r\n      return this.chains[0].getStrokes();\r\n    } else {\r\n      const region = ParityRegion.create();\r\n      for (const c of this.chains) {\r\n        const strokes = c.getStrokes();\r\n        if (strokes instanceof LineString3d)\r\n          region.tryAddChild(Loop.create(strokes));\r\n      }\r\n      return region;\r\n    }\r\n  }\r\n  /**\r\n   * Given two compatible stroke sets (as returned by getStrokes) extend a range\r\n   * with the distances between corresponding points.\r\n   * * Each set of strokes may be:\r\n   *   * linestring\r\n   *   * ParityRegion\r\n   *   * CurveChain (Loop or Path)\r\n   * @param strokeA first set of strokes\r\n   * @param strokeB second set of strokes\r\n   * @param rangeToExtend caller-allocated range to be extended.\r\n   * @returns true if structures are compatible.\r\n   */\r\n  public static extendDistanceRangeBetweenStrokes(strokeA: AnyCurve, strokeB: AnyCurve, rangeToExtend: Range1d): boolean {\r\n    if (strokeA instanceof LineString3d) {\r\n      if (strokeB instanceof LineString3d) {\r\n        if (strokeA.numPoints() === strokeB.numPoints()) {\r\n          const n = strokeA.numPoints();\r\n          const pointA = Point3d.create();\r\n          const pointB = Point3d.create();\r\n          const allPointA = strokeA.packedPoints;\r\n          const allPointB = strokeB.packedPoints;\r\n\r\n          for (let i = 0; i < n; i++) {\r\n            allPointA.getPoint3dAtCheckedPointIndex(i, pointA);\r\n            allPointB.getPoint3dAtCheckedPointIndex(i, pointB);\r\n            rangeToExtend.extendX(pointA.distance(pointB));\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    } else if (strokeA instanceof ParityRegion) {\r\n      if (strokeB instanceof ParityRegion) {\r\n        const childrenA = strokeA.children;\r\n        const childrenB = strokeB.children;\r\n        const n = childrenA.length;\r\n        if (n === childrenB.length) {\r\n          for (let i = 0; i < n; i++) {\r\n            if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\r\n              return false;\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    } else if (strokeA instanceof CurveChain) {\r\n      if (strokeB instanceof CurveChain) {\r\n        const childrenA = strokeA.children;\r\n        const childrenB = strokeB.children;\r\n        const n = childrenA.length;\r\n        if (n === childrenB.length) {\r\n          for (let i = 0; i < n; i++) {\r\n            if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\r\n              return false;\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n}\r\n"]}

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

@@ -1,17 +1,19 @@
+import { GrowableXYZArray } from "../geometry3d/GrowableXYZArray";
 import { IndexedXYZCollection } from "../geometry3d/IndexedXYZCollection";
 import { Point3d } from "../geometry3d/Point3dVector3d";
 import { Range3d } from "../geometry3d/Range";
 import { Transform } from "../geometry3d/Transform";
 import { MomentData } from "../geometry4d/MomentData";
-import { Polyface } from "../polyface/Polyface";
+import { IndexedPolyface, Polyface } from "../polyface/Polyface";
 import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "../topology/Graph";
 import { MultiLineStringDataVariant } from "../topology/Triangulation";
-import { AnyCurve, AnyRegion } from "./CurveChain";
-import { BagOfCurves, ConsolidateAdjacentCurvePrimitivesOptions, CurveChain, CurveCollection } from "./CurveCollection";
+import { AnyCurve, AnyRegion } from "./CurveTypes";
+import { BagOfCurves, CurveChain, CurveCollection } from "./CurveCollection";
 import { CurvePrimitive } from "./CurvePrimitive";
 import { Loop, SignedLoops } from "./Loop";
 import { JointOptions, OffsetOptions } from "./OffsetOptions";
 import { Path } from "./Path";
+import { StrokeOptions } from "./StrokeOptions";
 /**
  * Possible return types from [[splitToPathsBetweenBreaks]], [[collectInsideAndOutsideOffsets]] and
  * [[collectChains]].
@@ -65,8 +67,6 @@ export declare class RegionOps {
     static computeXYAreaTolerance(range: Range3d, distanceTolerance?: number): number;
     /**
      * Return an xy area for a loop, parity region, or union region.
-     * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with
-     *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`
      * @param root any Loop, ParityRegion, or UnionRegion.
      */
     static computeXYArea(root: AnyRegion): number | undefined;
@@ -345,5 +345,54 @@ export declare class RegionOps {
      * @param worldToLocal transform to apply to data before computing its range
      */
     static curveArrayRange(data: any, worldToLocal?: Transform): Range3d;
+    /**
+     * Triangulate a stroked Loop or ParityRegion and return the graph.
+     * @param polygons polygons obtained by stroking a Loop or ParityRegion, z-coordinates ignored.
+     * @returns triangulated graph
+     */
+    private static triangulateStrokedRegionComponent;
+    /** Stroke a Loop or ParityRegion */
+    private static strokeRegionComponent;
+    /**
+     * Triangulate a Loop or ParityRegion and return the graph.
+     * @param component region, z-coordinates ignored
+     * @param options how to stroke loops
+     * @returns triangulated graph
+     */
+    private static triangulateRegionComponent;
+    /**
+     * Facet the region according to stroke options.
+     * @param region a closed xy-planar region, possibly with holes.
+     * * The z-coordinates of the region are ignored. Caller is responsible for rotating the region into plane local coordinates beforehand, and reversing the rotation afterwards.
+     * * For best results, `UnionRegion` input should consist of non-overlapping children.
+     * Caller can ensure this by passing in `region = RegionOps.regionBooleanXY(unionRegion, undefined, RegionBinaryOpType.Union)`.
+     * * For best results, `ParityRegion` input should be correctly oriented (holes have opposite orientation to their containing loop).
+     * Caller can ensure this for non-intersecting loops by passing in `region = RegionOps.sortOuterAndHoleLoopsXY(loops)`.
+     * @param options primarily how to stroke the region boundary, but also how to facet the region interior.
+     * * By default, a triangulation is returned, but if `options.maximizeConvexFacets === true`, edges between coplanar triangles are removed to return maximally convex facets.
+     * @returns facets for the region, or undefined if facetting failed
+     */
+    static facetRegionXY(region: AnyRegion, options?: StrokeOptions): IndexedPolyface | undefined;
+    /**
+     * Decompose a polygon with optional holes into an array of convex polygons.
+     * @param polygon polygon and hole loops, e.g., as returned by [[CurveCollection.cloneStroked]] on a Loop or ParityRegion. All z-coordinates are ignored.
+     * @param maximize whether to return maximally convex polygons. If false, triangles are returned.
+     * @returns array of convex polygons, or undefined if triangulation failed
+    */
+    static convexDecomposePolygonXY(polygon: MultiLineStringDataVariant, maximize?: boolean): GrowableXYZArray[] | undefined;
+}
+/**
+ * * Options to control method `RegionOps.consolidateAdjacentPrimitives`
+ * @public
+ */
+export declare class ConsolidateAdjacentCurvePrimitivesOptions {
+    /** True to consolidated linear geometry   (e.g. separate LineSegment3d and LineString3d) into LineString3d */
+    consolidateLinearGeometry: boolean;
+    /** True to consolidate contiguous arcs */
+    consolidateCompatibleArcs: boolean;
+    /** Tolerance for collapsing identical points */
+    duplicatePointTolerance: number;
+    /** Tolerance for removing interior colinear points. */
+    colinearPointTolerance: number;
 }
 //# sourceMappingURL=RegionOps.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEhD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAE1E,OAAO,EAAyB,0BAA0B,EAAgB,MAAM,2BAA2B,CAAC;AAC5G,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,yCAAyC,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAGxH,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAMlD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAS9B;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAAG,cAAc,GAAG,IAAI,GAAG,WAAW,GAAG,IAAI,GAAG,SAAS,CAAC;AAEhF;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AAEvH;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;;;;;;;;GAUG;AACH,qBAAa,SAAS;IACpB;;;;;OAKG;WACW,oBAAoB,CAAC,IAAI,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS3E;;;;MAIE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAKtH;;;;;OAKG;WACW,aAAa,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQhE;;;;;OAKG;WACW,wBAAwB,CAAC,IAAI,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO9E;;;OAGG;WACW,eAAe,CAC3B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,0BAA0B,EAChC,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GACnE,IAAI;IAqCP;;;;OAIG;WACW,0BAA0B,CACtC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GACvF,QAAQ,EAAE,GAAG,SAAS;IAYzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CACjD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,sCAAsC,CAClD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,kBAAkB,EAC7B,cAAc,GAAE,MAAqC,GACpD,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,0BAA0B,CACtC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,EACpC,WAAW,GAAE,OAAe,GAC3B,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GACnC,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,4BAA4B,CACxC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAC/E,UAAU,GAAG,SAAS;IAIzB;;;;;;;OAOG;WACW,sBAAsB,CAClC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAClF,eAAe,GAAG,SAAS;IAI9B;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;;OASG;WACW,2BAA2B,CACvC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAC7F,eAAe,GAAG,SAAS;IAuB9B,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAG/D;;;;;;;;OAQG;WACW,uBAAuB,CACnC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAC/D,QAAQ,GAAG,SAAS;IAGvB;;;;;OAKG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,UAAU;IAatG;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAClE;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,EAAE,UAAU,CAAA;KAAE;IAGhF;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,UAAU;IAGnH;;;;;OAKG;WACW,2BAA2B,CACvC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GACnD;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBrF;;;;;;;;;;;;;;OAcG;WACW,sBAAsB,CAClC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GACrF,SAAS,GAAG,SAAS;IA+CxB;;;;;;;;;;;OAWG;WACW,6BAA6B,CACzC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC,GAC3E,IAAI;IAIP;;;;;;;;;;;OAWG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;;;;;;;;;;;;;;;OAkBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,SAAS,GAAE,MAAqC,GACxF,WAAW,EAAE;IAQhB;;;;;;;;;;OAUG;WACW,sBAAsB,CAClC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACjC,cAAc,CAAC,EAAE,cAAc,EAAE,EACjC,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAClC,cAAc,EAAE;IAanB;;;;;OAKG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;CAkB5E"}
+{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAiC,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAEzG,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAGxD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAG1E,OAAO,EAAyB,0BAA0B,EAAgB,MAAM,2BAA2B,CAAC;AAC5G,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAMlD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAO9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAAG,cAAc,GAAG,IAAI,GAAG,WAAW,GAAG,IAAI,GAAG,SAAS,CAAC;AAEhF;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AAEvH;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;;;;;;;;GAUG;AACH,qBAAa,SAAS;IACpB;;;;;OAKG;WACW,oBAAoB,CAAC,IAAI,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS3E;;;;MAIE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAKtH;;;OAGG;WACW,aAAa,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQhE;;;;;OAKG;WACW,wBAAwB,CAAC,IAAI,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO9E;;;OAGG;WACW,eAAe,CAC3B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,0BAA0B,EAChC,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GACnE,IAAI;IAqCP;;;;OAIG;WACW,0BAA0B,CACtC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GACvF,QAAQ,EAAE,GAAG,SAAS;IAYzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CACjD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,sCAAsC,CAClD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,kBAAkB,EAC7B,cAAc,GAAE,MAAqC,GACpD,SAAS,GAAG,SAAS;IA0BxB;;;;;;;;;;;OAWG;WACW,0BAA0B,CACtC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,EACpC,WAAW,GAAE,OAAe,GAC3B,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GACnC,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,4BAA4B,CACxC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAC/E,UAAU,GAAG,SAAS;IAIzB;;;;;;;OAOG;WACW,sBAAsB,CAClC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAClF,eAAe,GAAG,SAAS;IAI9B;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;;OASG;WACW,2BAA2B,CACvC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAC7F,eAAe,GAAG,SAAS;IAuB9B,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAG/D;;;;;;;;OAQG;WACW,uBAAuB,CACnC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAC/D,QAAQ,GAAG,SAAS;IAGvB;;;;;OAKG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,UAAU;IAatG;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAClE;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,EAAE,UAAU,CAAA;KAAE;IAGhF;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,UAAU;IAGnH;;;;;OAKG;WACW,2BAA2B,CACvC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GACnD;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBrF;;;;;;;;;;;;;;OAcG;WACW,sBAAsB,CAClC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GACrF,SAAS,GAAG,SAAS;IA+CxB;;;;;;;;;;;OAWG;WACW,6BAA6B,CACzC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC,GAC3E,IAAI;IAIP;;;;;;;;;;;OAWG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;;;;;;;;;;;;;;;OAkBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,SAAS,GAAE,MAAqC,GACxF,WAAW,EAAE;IAQhB;;;;;;;;;;OAUG;WACW,sBAAsB,CAClC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACjC,cAAc,CAAC,EAAE,cAAc,EAAE,EACjC,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAClC,cAAc,EAAE;IAanB;;;;;OAKG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAkB3E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAqChD,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAepC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAIzC;;;;;;;;;;;OAWG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAyBpG;;;;;MAKE;WACY,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,QAAQ,GAAE,OAAc,GAAG,gBAAgB,EAAE,GAAG,SAAS;CActI;AAaD;;;GAGG;AACH,qBAAa,yCAAyC;IACpD,8GAA8G;IACvG,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0CAA0C;IACnC,yBAAyB,EAAE,OAAO,CAAQ;IACjD,gDAAgD;IACzC,uBAAuB,SAAgC;IAC9D,uDAAuD;IAChD,sBAAsB,SAAgC;CAC9D"}

package/lib/cjs/curve/RegionOps.js

@@ -4,7 +4,7 @@
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.RegionOps = exports.RegionBinaryOpType = void 0;
+exports.ConsolidateAdjacentCurvePrimitivesOptions = exports.RegionOps = exports.RegionBinaryOpType = void 0;
 /** @packageDocumentation
  * @module Curve
  */
@@ -13,6 +13,7 @@ const GrowableXYZArray_1 = require("../geometry3d/GrowableXYZArray");
 const IndexedXYZCollection_1 = require("../geometry3d/IndexedXYZCollection");
 const Point3dArrayCarrier_1 = require("../geometry3d/Point3dArrayCarrier");
 const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
+const PolygonOps_1 = require("../geometry3d/PolygonOps");
 const PolylineCompressionByEdgeOffset_1 = require("../geometry3d/PolylineCompressionByEdgeOffset");
 const Range_1 = require("../geometry3d/Range");
 const SortablePolygon_1 = require("../geometry3d/SortablePolygon");
@@ -21,6 +22,7 @@ const MomentData_1 = require("../geometry4d/MomentData");
 const PolyfaceBuilder_1 = require("../polyface/PolyfaceBuilder");
 const Graph_1 = require("../topology/Graph");
 const HalfEdgeGraphSearch_1 = require("../topology/HalfEdgeGraphSearch");
+const Merging_1 = require("../topology/Merging");
 const Triangulation_1 = require("../topology/Triangulation");
 const CurveCollection_1 = require("./CurveCollection");
 const CurveCurve_1 = require("./CurveCurve");
@@ -93,8 +95,6 @@ class RegionOps {
     }
     /**
      * Return an xy area for a loop, parity region, or union region.
-     * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with
-     *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`
      * @param root any Loop, ParityRegion, or UnionRegion.
      */
     static computeXYArea(root) {
@@ -247,6 +247,8 @@ class RegionOps {
      * to connect interior loops to exterior loops.
      */
     static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
+        // Always return UnionRegion for now. But keep return type as AnyRegion:
+        // in the future, we might return the *simplest* region type.
         const result = UnionRegion_1.UnionRegion.create();
         const context = RegionOpsClassificationSweeps_1.RegionBooleanContext.create(RegionOpsClassificationSweeps_1.RegionGroupOpType.Union, RegionOpsClassificationSweeps_1.RegionGroupOpType.Union);
         context.addMembers(loopsA, loopsB);
@@ -676,6 +678,138 @@ class RegionOps {
         }
         return range;
     }
+    /**
+     * Triangulate a stroked Loop or ParityRegion and return the graph.
+     * @param polygons polygons obtained by stroking a Loop or ParityRegion, z-coordinates ignored.
+     * @returns triangulated graph
+     */
+    static triangulateStrokedRegionComponent(polygons) {
+        let graph;
+        if (Array.isArray(polygons)) {
+            if (polygons.length === 0)
+                return undefined;
+            const firstEntry = polygons[0];
+            if (Point3dVector3d_1.Point3d.isAnyImmediatePointType(firstEntry)) {
+                graph = Triangulation_1.Triangulator.createTriangulatedGraphFromSingleLoop(polygons);
+            }
+            else if (polygons.length > 1) {
+                let writablePolygons;
+                if (firstEntry instanceof IndexedXYZCollection_1.IndexedReadWriteXYZCollection) {
+                    writablePolygons = polygons;
+                }
+                else {
+                    writablePolygons = [];
+                    for (const polygon of polygons)
+                        writablePolygons.push(GrowableXYZArray_1.GrowableXYZArray.create(polygon));
+                }
+                const sortedPolygons = PolygonOps_1.PolygonOps.sortOuterAndHoleLoopsXY(writablePolygons);
+                if (sortedPolygons.length === 1) { // below requires exactly one outer loop!
+                    if (graph = Triangulation_1.Triangulator.createTriangulatedGraphFromLoops(sortedPolygons[0]))
+                        Triangulation_1.Triangulator.flipTriangles(graph);
+                }
+            }
+            else {
+                graph = Triangulation_1.Triangulator.createTriangulatedGraphFromSingleLoop(firstEntry);
+            }
+        }
+        else {
+            graph = Triangulation_1.Triangulator.createTriangulatedGraphFromSingleLoop(polygons);
+        }
+        if (!graph) {
+            // Last resort: try full merge. Conveniently, multiple polygons are processed with parity logic.
+            if (graph = RegionOpsClassificationSweeps_1.RegionOpsFaceToFaceSearch.doPolygonBoolean(polygons, [], (inA, _inB) => inA)) {
+                if (Triangulation_1.Triangulator.triangulateAllPositiveAreaFaces(graph))
+                    Triangulation_1.Triangulator.flipTriangles(graph);
+            }
+        }
+        return graph;
+    }
+    /** Stroke a Loop or ParityRegion */
+    static strokeRegionComponent(component, options) {
+        const strokedComponent = component.cloneStroked(options);
+        // package the stroked region as polygons
+        const polygons = [];
+        if (strokedComponent instanceof Loop_1.Loop) {
+            if (strokedComponent.children.length > 0 && strokedComponent.children[0] instanceof LineString3d_1.LineString3d)
+                polygons.push(strokedComponent.children[0].packedPoints); // expect only 1
+        }
+        else if (strokedComponent instanceof ParityRegion_1.ParityRegion) {
+            for (const strokedLoop of strokedComponent.children) {
+                if (strokedLoop.children.length > 0 && strokedLoop.children[0] instanceof LineString3d_1.LineString3d)
+                    polygons.push(strokedLoop.children[0].packedPoints); // expect only 1
+            }
+        }
+        return polygons;
+    }
+    /**
+     * Triangulate a Loop or ParityRegion and return the graph.
+     * @param component region, z-coordinates ignored
+     * @param options how to stroke loops
+     * @returns triangulated graph
+     */
+    static triangulateRegionComponent(component, options) {
+        const polygons = this.strokeRegionComponent(component, options);
+        return this.triangulateStrokedRegionComponent(polygons);
+    }
+    /**
+     * Facet the region according to stroke options.
+     * @param region a closed xy-planar region, possibly with holes.
+     * * The z-coordinates of the region are ignored. Caller is responsible for rotating the region into plane local coordinates beforehand, and reversing the rotation afterwards.
+     * * For best results, `UnionRegion` input should consist of non-overlapping children.
+     * Caller can ensure this by passing in `region = RegionOps.regionBooleanXY(unionRegion, undefined, RegionBinaryOpType.Union)`.
+     * * For best results, `ParityRegion` input should be correctly oriented (holes have opposite orientation to their containing loop).
+     * Caller can ensure this for non-intersecting loops by passing in `region = RegionOps.sortOuterAndHoleLoopsXY(loops)`.
+     * @param options primarily how to stroke the region boundary, but also how to facet the region interior.
+     * * By default, a triangulation is returned, but if `options.maximizeConvexFacets === true`, edges between coplanar triangles are removed to return maximally convex facets.
+     * @returns facets for the region, or undefined if facetting failed
+     */
+    static facetRegionXY(region, options) {
+        let graph;
+        if (region instanceof UnionRegion_1.UnionRegion) {
+            for (const child of region.children) {
+                const childGraph = RegionOps.triangulateRegionComponent(child, options);
+                if (childGraph) {
+                    if (!graph) {
+                        graph = childGraph;
+                    }
+                    else {
+                        // Graph concatenation without edge splits, clustering, and merge. We assume disjoint children so that at worst,
+                        // components will have unshared adjacent exterior edges that remain after expandConvexFaces. Note that calling
+                        // clusterAndMergeXYTheta here can create non-manifold topology!
+                        graph.allHalfEdges.push(...childGraph.allHalfEdges);
+                    }
+                }
+            }
+        }
+        else {
+            graph = this.triangulateRegionComponent(region, options);
+        }
+        if (!graph)
+            return undefined;
+        if (options?.maximizeConvexFacets)
+            Merging_1.HalfEdgeGraphOps.expandConvexFaces(graph);
+        return PolyfaceBuilder_1.PolyfaceBuilder.graphToPolyface(graph, options);
+    }
+    /**
+     * Decompose a polygon with optional holes into an array of convex polygons.
+     * @param polygon polygon and hole loops, e.g., as returned by [[CurveCollection.cloneStroked]] on a Loop or ParityRegion. All z-coordinates are ignored.
+     * @param maximize whether to return maximally convex polygons. If false, triangles are returned.
+     * @returns array of convex polygons, or undefined if triangulation failed
+    */
+    static convexDecomposePolygonXY(polygon, maximize = true) {
+        const graph = RegionOps.triangulateStrokedRegionComponent(polygon);
+        if (!graph)
+            return undefined;
+        if (maximize)
+            Merging_1.HalfEdgeGraphOps.expandConvexFaces(graph);
+        const convexPolygons = [];
+        graph.announceFaceLoops((_graph, seed) => {
+            if (!seed.isMaskSet(Graph_1.HalfEdgeMask.EXTERIOR))
+                convexPolygons.push(GrowableXYZArray_1.GrowableXYZArray.create(seed.collectAroundFace((node) => { return node.getPoint3d(); })));
+            return true;
+        });
+        return convexPolygons;
+    }
 }
 exports.RegionOps = RegionOps;
 /** @internal */
@@ -687,4 +821,21 @@ function pushToInOnOutArrays(curve, select, arrayNegative, array0, arrayPositive
     else
         array0.push(curve);
 }
+/**
+ * * Options to control method `RegionOps.consolidateAdjacentPrimitives`
+ * @public
+ */
+class ConsolidateAdjacentCurvePrimitivesOptions {
+    constructor() {
+        /** True to consolidated linear geometry   (e.g. separate LineSegment3d and LineString3d) into LineString3d */
+        this.consolidateLinearGeometry = true;
+        /** True to consolidate contiguous arcs */
+        this.consolidateCompatibleArcs = true;
+        /** Tolerance for collapsing identical points */
+        this.duplicatePointTolerance = Geometry_1.Geometry.smallMetricDistance;
+        /** Tolerance for removing interior colinear points. */
+        this.colinearPointTolerance = Geometry_1.Geometry.smallMetricDistance;
+    }
+}
+exports.ConsolidateAdjacentCurvePrimitivesOptions = ConsolidateAdjacentCurvePrimitivesOptions;
 //# sourceMappingURL=RegionOps.js.map