@itwin/core-geometry 5.3.0-dev.5 → 5.3.0-dev.7

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

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

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

@@ -24,7 +24,29 @@ import { StrokeOptions } from "./StrokeOptions";
  */
 export type GraphCheckPointFunction = (name: string, graph: HalfEdgeGraph, properties: string, extraData?: any) => any;
 /**
- * Enumeration of the binary operation types for a booleans among regions
+ * * Options to control method [[RegionOps.consolidateAdjacentPrimitives]].
+ * @public
+ */
+export declare class ConsolidateAdjacentCurvePrimitivesOptions {
+    /** True to consolidate adjacent linear geometry into a single LineString3d. */
+    consolidateLinearGeometry: boolean;
+    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
+    consolidateCompatibleArcs: boolean;
+    /**
+     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
+     * allowing location of the seam to change.
+     */
+    consolidateLoopSeam?: boolean;
+    /** Disable LineSegment3d and LineString3d point compression. */
+    disableLinearCompression?: boolean;
+    /** Tolerance for detecting identical points. */
+    duplicatePointTolerance: number;
+    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
+    colinearPointTolerance: number;
+}
+/**
+ * Enumeration of the binary operation types for Boolean operations.
+ * @see [[RegionOps.regionBooleanXY]], [[RegionOps.polygonBooleanXYToLoops]], [[RegionOps.polygonBooleanXYToPolyface]].
  * @public
  */
 export declare enum RegionBinaryOpType {
@@ -34,6 +56,19 @@ export declare enum RegionBinaryOpType {
     AMinusB = 3,
     BMinusA = 4
 }
+/**
+ * Options bundle for use in [[RegionOps.regionBooleanXY]].
+ * @public
+ */
+export interface RegionBooleanXYOptions {
+    /** Absolute distance tolerance for merging loops. Default is [[Geometry.smallMetricDistance]]. */
+    mergeTolerance?: number;
+    /**
+     * Whether to post-process a Boolean Union result to return only the outer [[Loop]]s.
+     * Default value is `false`, to return the raw [[UnionRegion]] of disjoint constituent [[Loop]]s.
+     */
+    simplifyUnion?: boolean;
+}
 /**
  * Class `RegionOps` has static members for calculations on regions (areas).
  * * Regions are represented by these [[CurveCollection]] subclasses:
@@ -156,10 +191,15 @@ export declare class RegionOps {
      * * Regions without children are removed.
      * * No Boolean operations are performed.
      * @param region region to simplify in place
-     * @returns reference to the updated input region
+     * @returns reference to the updated input region, or `undefined` if no children.
      * @see [[simplifyRegionType]]
      */
     static simplifyRegion(region: AnyRegion): AnyRegion | undefined;
+    /**
+     * Helper method to sample a z-coordinate from the input region(s).
+     * * The assumption is that the input is horizontal.
+     */
+    private static getZCoordinate;
     /**
      * Return areas defined by a boolean operation.
      * @note For best results, input regions should have correctly oriented loops. See [[sortOuterAndHoleLoopsXY]].
@@ -170,10 +210,10 @@ export declare class RegionOps {
      * @param loopsA first set of loops (treated as a union)
      * @param loopsB second set of loops (treated as a union)
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
-     * @param mergeTolerance absolute distance tolerance for merging loops
+     * @param mergeToleranceOrOptions absolute distance tolerance for merging loops, or multiple options settings. Default value is [[Geometry.smallMetricDistance]].
      * @returns a region resulting from merging input loops and the boolean operation.
      */
-    static regionBooleanXY(loopsA: AnyRegion | AnyRegion[] | undefined, loopsB: AnyRegion | AnyRegion[] | undefined, operation: RegionBinaryOpType, mergeTolerance?: number): AnyRegion | undefined;
+    static regionBooleanXY(loopsA: AnyRegion | AnyRegion[] | undefined, loopsB: AnyRegion | AnyRegion[] | undefined, operation: RegionBinaryOpType, mergeToleranceOrOptions?: number | RegionBooleanXYOptions): AnyRegion | undefined;
     /**
      * Return a polyface whose facets are a boolean operation between the input regions.
      * * Each of the two inputs is an array of multiple loops or parity regions.
@@ -426,25 +466,4 @@ export declare class RegionOps {
     */
     static convexDecomposePolygonXY(polygon: MultiLineStringDataVariant, maximize?: boolean): GrowableXYZArray[] | undefined;
 }
-/**
- * * Options to control method `RegionOps.consolidateAdjacentPrimitives`.
- * @public
- */
-export declare class ConsolidateAdjacentCurvePrimitivesOptions {
-    /** True to consolidate adjacent linear geometry into a single LineString3d. */
-    consolidateLinearGeometry: boolean;
-    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
-    consolidateCompatibleArcs: boolean;
-    /**
-     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
-     * allowing location of the seam to change.
-     */
-    consolidateLoopSeam?: boolean;
-    /** Disable LineSegment3d and LineString3d point compression. */
-    disableLinearCompression?: boolean;
-    /** Tolerance for detecting identical points. */
-    duplicatePointTolerance: number;
-    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
-    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":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAC0B,oBAAoB,EAAyB,0BAA0B,EACvG,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,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;AAI1E,OAAO,EAAe,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAQ7D,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;;;;;;;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;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;;;;;;;;OAQG;WACW,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS7E;;;;MAIE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAKtH;;;;;;OAMG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQlE;;;;;;;;OAQG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO/E;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IA6BtF;;;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,kBAAkB,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS;IAU9D;;;;;;;;OAQG;WACW,cAAc,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAqBtE;;;;;;;;;;;;OAYG;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;IA2BxB;;;;;;;;;;;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,QAAQ,GAAG,SAAS;IAahH;;;;;;;;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,CAAC,EAAE,QAAQ,CAAA;KAAE;IAG/E;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;;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,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC,GAAG,IAAI;IAI/H;;;;;;;;;;;;OAYG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;MAIE;IACF,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAiBhD;;;;;;;;;;;;;;;;;;;;;OAqBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACvC,SAAS,GAAE,MAAqC,EAChD,UAAU,GAAE,OAAc,GACzB,WAAW,EAAE;IAoBhB;;;;;;;;;;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;;;;;;;;;OASG;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,+EAA+E;IACxE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0EAA0E;IACnE,yBAAyB,EAAE,OAAO,CAAQ;IACjD;;;OAGG;IACI,mBAAmB,CAAC,EAAE,OAAO,CAAS;IAC7C,gEAAgE;IACzD,wBAAwB,CAAC,EAAE,OAAO,CAAS;IAClD,gDAAgD;IACzC,uBAAuB,EAAE,MAAM,CAAgC;IACtE,wFAAwF;IACjF,sBAAsB,EAAE,MAAM,CAAgC;CACtE"}
+{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAC0B,oBAAoB,EAAyB,0BAA0B,EACvG,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,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;AAI1E,OAAO,EAAe,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAQ7D,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;;;;;;;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,qBAAa,yCAAyC;IACpD,+EAA+E;IACxE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0EAA0E;IACnE,yBAAyB,EAAE,OAAO,CAAQ;IACjD;;;OAGG;IACI,mBAAmB,CAAC,EAAE,OAAO,CAAS;IAC7C,gEAAgE;IACzD,wBAAwB,CAAC,EAAE,OAAO,CAAS;IAClD,gDAAgD;IACzC,uBAAuB,EAAE,MAAM,CAAgC;IACtE,wFAAwF;IACjF,sBAAsB,EAAE,MAAM,CAAgC;CACtE;AAED;;;;GAIG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB;IACrC,kGAAkG;IAClG,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;;;;;;;;OAQG;WACW,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS7E;;;;MAIE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAStH;;;;;;OAMG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQlE;;;;;;;;OAQG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO/E;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IA6BtF;;;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,kBAAkB,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS;IAU9D;;;;;;;;OAQG;WACW,cAAc,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAqBtE;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAI7B;;;;;;;;;;;;OAYG;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,uBAAuB,GAAE,MAAM,GAAG,sBAAqD,GACtF,SAAS,GAAG,SAAS;IA8CxB;;;;;;;;;;;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,QAAQ,GAAG,SAAS;IAahH;;;;;;;;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,CAAC,EAAE,QAAQ,CAAA;KAAE;IAG/E;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;;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,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC,GAAG,IAAI;IAI/H;;;;;;;;;;;;OAYG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;MAIE;IACF,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAiBhD;;;;;;;;;;;;;;;;;;;;;OAqBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACvC,SAAS,GAAE,MAAqC,EAChD,UAAU,GAAE,OAAc,GACzB,WAAW,EAAE;IAsBhB;;;;;;;;;;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;;;;;;;;;OASG;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"}

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.ConsolidateAdjacentCurvePrimitivesOptions = exports.RegionOps = exports.RegionBinaryOpType = void 0;
+exports.RegionOps = exports.RegionBinaryOpType = exports.ConsolidateAdjacentCurvePrimitivesOptions = void 0;
 /** @packageDocumentation
  * @module Curve
  */
@@ -50,7 +50,30 @@ const RegionMomentsXY_1 = require("./RegionMomentsXY");
 const RegionOpsClassificationSweeps_1 = require("./RegionOpsClassificationSweeps");
 const UnionRegion_1 = require("./UnionRegion");
 /**
- * Enumeration of the binary operation types for a booleans among regions
+ * * Options to control method [[RegionOps.consolidateAdjacentPrimitives]].
+ * @public
+ */
+class ConsolidateAdjacentCurvePrimitivesOptions {
+    /** True to consolidate adjacent linear geometry into a single LineString3d. */
+    consolidateLinearGeometry = true;
+    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
+    consolidateCompatibleArcs = true;
+    /**
+     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
+     * allowing location of the seam to change.
+     */
+    consolidateLoopSeam = false;
+    /** Disable LineSegment3d and LineString3d point compression. */
+    disableLinearCompression = false;
+    /** Tolerance for detecting identical points. */
+    duplicatePointTolerance = Geometry_1.Geometry.smallMetricDistance;
+    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
+    colinearPointTolerance = Geometry_1.Geometry.smallMetricDistance;
+}
+exports.ConsolidateAdjacentCurvePrimitivesOptions = ConsolidateAdjacentCurvePrimitivesOptions;
+/**
+ * Enumeration of the binary operation types for Boolean operations.
+ * @see [[RegionOps.regionBooleanXY]], [[RegionOps.polygonBooleanXYToLoops]], [[RegionOps.polygonBooleanXYToPolyface]].
  * @public
  */
 var RegionBinaryOpType;
@@ -98,8 +121,12 @@ class RegionOps {
      * @param distanceTolerance optional absolute distance tolerance.
     */
     static computeXYAreaTolerance(range, distanceTolerance = Geometry_1.Geometry.smallMetricDistance) {
-        // if A = bh and e is distance tolerance, then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), so A'-A = e/2(b+h+e/2).
-        const halfDistTol = 0.5 * distanceTolerance;
+        // ensure the result is nonzero: we never want to report a zero-area loop as a signed-area loop
+        if (distanceTolerance === 0)
+            return Geometry_1.Geometry.smallFloatingPoint * 10; // observed area 2e-15 computed for a zero-area loop
+        // If A = bh and e is distance tolerance, let A' be the region with b and h extended by half the tolerance.
+        // Then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), which motivates our area tol = A'-A = e/2(b+h+e/2).
+        const halfDistTol = 0.5 * Math.abs(distanceTolerance);
         return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);
     }
     /**
@@ -314,7 +341,7 @@ class RegionOps {
      * * Regions without children are removed.
      * * No Boolean operations are performed.
      * @param region region to simplify in place
-     * @returns reference to the updated input region
+     * @returns reference to the updated input region, or `undefined` if no children.
      * @see [[simplifyRegionType]]
      */
     static simplifyRegion(region) {
@@ -339,6 +366,14 @@ class RegionOps {
             return region.children.splice(0, 1)[0];
         return region;
     }
+    /**
+     * Helper method to sample a z-coordinate from the input region(s).
+     * * The assumption is that the input is horizontal.
+     */
+    static getZCoordinate(xyRegion) {
+        const localToWorld = FrameBuilder_1.FrameBuilder.createRightHandedFrame(undefined, xyRegion);
+        return localToWorld ? localToWorld.origin.z : 0;
+    }
     /**
      * Return areas defined by a boolean operation.
      * @note For best results, input regions should have correctly oriented loops. See [[sortOuterAndHoleLoopsXY]].
@@ -349,18 +384,30 @@ class RegionOps {
      * @param loopsA first set of loops (treated as a union)
      * @param loopsB second set of loops (treated as a union)
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
-     * @param mergeTolerance absolute distance tolerance for merging loops
+     * @param mergeToleranceOrOptions absolute distance tolerance for merging loops, or multiple options settings. Default value is [[Geometry.smallMetricDistance]].
      * @returns a region resulting from merging input loops and the boolean operation.
      */
-    static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
-        const result = UnionRegion_1.UnionRegion.create();
+    static regionBooleanXY(loopsA, loopsB, operation, mergeToleranceOrOptions = Geometry_1.Geometry.smallMetricDistance) {
+        let mergeTolerance;
+        let simplifyUnion;
+        if (typeof mergeToleranceOrOptions === "number") {
+            mergeTolerance = mergeToleranceOrOptions;
+            simplifyUnion = false;
+        }
+        else {
+            mergeTolerance = mergeToleranceOrOptions.mergeTolerance ?? Geometry_1.Geometry.smallMetricDistance;
+            simplifyUnion = mergeToleranceOrOptions.simplifyUnion ?? false;
+        }
+        let result = UnionRegion_1.UnionRegion.create();
         const context = RegionOpsClassificationSweeps_1.RegionBooleanContext.create(RegionOpsClassificationSweeps_1.RegionGroupOpType.Union, RegionOpsClassificationSweeps_1.RegionGroupOpType.Union);
         context.addMembers(loopsA, loopsB);
         context.annotateAndMergeCurvesInGraph(mergeTolerance);
+        const bridgeMask = Graph_1.HalfEdgeMask.BRIDGE_EDGE;
         const visitMask = context.graph.grabMask(false);
         const range = context.groupA.range().union(context.groupB.range());
         const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);
-        const bridgeMask = Graph_1.HalfEdgeMask.BRIDGE_EDGE;
+        const z = RegionOps.getZCoordinate(operation === RegionBinaryOpType.BMinusA ? loopsB : loopsA);
+        const options = { compress: true, closureTol: mergeTolerance, bridgeMask, visitMask, z };
         context.runClassificationSweep(operation, (_graph, face, faceType, area) => {
             // ignore danglers and null faces, but not 2-edge "banana" faces with nonzero area
             if (face.countEdgesAroundFace() < 2)
@@ -368,12 +415,20 @@ class RegionOps {
             if (Math.abs(area) < areaTol)
                 return;
             if (faceType === 1) {
-                const loopOrParityRegion = PlanarSubdivision_1.PlanarSubdivision.createLoopOrParityRegionInFace(face, bridgeMask, visitMask, mergeTolerance);
+                const loopOrParityRegion = PlanarSubdivision_1.PlanarSubdivision.createLoopOrParityRegionInFace(face, options);
                 if (loopOrParityRegion)
                     result.tryAddChild(loopOrParityRegion);
             }
         });
         context.graph.dropMask(visitMask);
+        if (simplifyUnion && operation === RegionBinaryOpType.Union) {
+            const signedLoops = RegionOps.constructAllXYRegionLoops(result);
+            if (signedLoops) {
+                const outerLoops = signedLoops.map((component) => component.negativeAreaLoops).flat();
+                if (outerLoops.length > 0)
+                    result = UnionRegion_1.UnionRegion.create(...outerLoops);
+            }
+        }
         return this.simplifyRegion(result);
     }
     /**
@@ -743,13 +798,15 @@ class RegionOps {
         if (addBridges) { // generate a temp graph to extract its bridge edges
             const context = RegionOpsClassificationSweeps_1.RegionBooleanContext.create(RegionOpsClassificationSweeps_1.RegionGroupOpType.Union, RegionOpsClassificationSweeps_1.RegionGroupOpType.Union);
             const regions = this.collectRegionsAndClosedPrimitives(curvesAndRegions, tolerance);
-            context.addMembers(regions, undefined);
-            context.annotateAndMergeCurvesInGraph(tolerance);
-            context.graph.announceEdges((_graph, edge) => {
-                if (edge.isMaskSet(Graph_1.HalfEdgeMask.BRIDGE_EDGE))
-                    primitives.push(LineSegment3d_1.LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));
-                return true;
-            });
+            if (regions.length > 0) {
+                context.addMembers(regions, undefined);
+                context.annotateAndMergeCurvesInGraph(tolerance);
+                context.graph.announceEdges((_graph, edge) => {
+                    if (edge.isMaskSet(Graph_1.HalfEdgeMask.BRIDGE_EDGE))
+                        primitives.push(LineSegment3d_1.LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));
+                    return true;
+                });
+            }
         }
         const intersections = CurveCurve_1.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
         const graph = PlanarSubdivision_1.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
@@ -967,26 +1024,4 @@ function pushToInOnOutArrays(curve, select, arrayNegative, array0, arrayPositive
     else
         array0.push(curve);
 }
-/**
- * * Options to control method `RegionOps.consolidateAdjacentPrimitives`.
- * @public
- */
-class ConsolidateAdjacentCurvePrimitivesOptions {
-    /** True to consolidate adjacent linear geometry into a single LineString3d. */
-    consolidateLinearGeometry = true;
-    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
-    consolidateCompatibleArcs = true;
-    /**
-     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
-     * allowing location of the seam to change.
-     */
-    consolidateLoopSeam = false;
-    /** Disable LineSegment3d and LineString3d point compression. */
-    disableLinearCompression = false;
-    /** Tolerance for detecting identical points. */
-    duplicatePointTolerance = Geometry_1.Geometry.smallMetricDistance;
-    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
-    colinearPointTolerance = Geometry_1.Geometry.smallMetricDistance;
-}
-exports.ConsolidateAdjacentCurvePrimitivesOptions = ConsolidateAdjacentCurvePrimitivesOptions;
 //# sourceMappingURL=RegionOps.js.map