npm - @itwin/core-geometry - Versions diffs - 3.0.0-dev.76 → 3.0.0-dev.80 - Mend

@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1999) hide show

package/lib/esm/clipping/ClipUtils.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"ClipUtils.js","sourceRoot":"","sources":["../../../src/clipping/ClipUtils.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAKH,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAW,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAG1E,OAAO,EAAE,8BAA8B,EAAE,MAAM,mDAAmD,CAAC;AACnG,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AAIxE;;GAEG;AACH,MAAM,CAAN,IAAY,oBAOX;AAPD,WAAY,oBAAoB;IAC9B,wBAAwB;IACxB,mFAAkB,CAAA;IAClB,oCAAoC;IACpC,yEAAa,CAAA;IACb,yBAAyB;IACzB,qFAAmB,CAAA;AACrB,CAAC,EAPW,oBAAoB,KAApB,oBAAoB,QAO/B;AAED;;GAEG;AACH,MAAM,CAAN,IAAY,UAOX;AAPD,WAAY,UAAU;IACpB,kDAAkD;IAClD,2DAAY,CAAA;IACZ,kCAAkC;IAClC,6DAAa,CAAA;IACb,iCAAiC;IACjC,6DAAa,CAAA;AACf,CAAC,EAPW,UAAU,KAAV,UAAU,QAOrB;AAiDD;;GAEG;AACH,MAAM,OAAO,aAAa;IAExB;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAqB,EAAE,iBAAuC,EAAE,OAAgB,EAAE,QAA6C;QAC7J,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,EAAE,CAAC;QACP,IAAI,IAAI,CAAC;QACT,MAAM,SAAS,GAAG,aAAa,CAAC,2BAA2B,CAAC;QAC5D,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC,aAAa,EAAE;gBACpC,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACvB,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE;oBAC9B,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;oBACvC,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE;wBACxC,IAAI,QAAQ;4BACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;;4BAExB,OAAO,IAAI,CAAC;qBACf;iBACF;gBACD,EAAE,GAAG,EAAE,CAAC;aACT;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CAAC,SAAoB,EAAE,EAAkB,EAAE,QAA6C;QAC/G,IAAI,QAAQ,EAAE;YACZ,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE;gBAC1B,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;aAC/B;SACF;QACD,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,oBAAoB,CAAC,KAAqB,EAAE,OAAgB;QACxE,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,CAAC,qBAAqB,CAAC,OAAO,EACjC,CAAC,SAAiB,EAAE,SAAiB,EAAE,MAAsB,EAAE,EAAE;YAC/D,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACpE,IAAI,YAAY;oBACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aAC7B;QACH,CAAC,CAAC,CAAC;QACL,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,sBAAsB,CAAC,OAAkB,EAAE,SAAwB;QAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,6CAA6C,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,OAAO;YACrB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,6CAA6C,CAAC,OAAkB,EAAE,SAAwB;QACtG,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,SAAS,CAAC,kBAAkB,EAAE,CAAC;QAC/C,0CAA0C;QAC1C,IAAI,OAAO,EAAE;YACX,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;SACtC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAwB,EAAE,QAAoC,EAAE,SAAiB;QACtH,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAClC,OAAO,UAAU,CAAC,aAAa,CAAC;QAElC,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,UAAU,EAAE;YAC3C,IAAI,qBAAqB,GAAG,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC;YAEtD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;gBACpC,IAAI,SAAS,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;gBAClC,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAEjD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACtC,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;oBAClD,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBACxB,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;iBACxF;gBAED,UAAU,GAAG,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;gBACpD,IAAI,SAAS,KAAK,CAAC,EAAE;oBACnB,qBAAqB,GAAG,IAAI,CAAC;oBAC7B,MAAM;iBACP;aACF;YAED,IAAI,CAAC,UAAU,EAAG,6CAA6C;gBAC7D,OAAO,UAAU,CAAC,aAAa,CAAC;YAClC,IAAI,CAAC,qBAAqB;gBACxB,OAAO,UAAU,CAAC,YAAY,CAAC;SAClC;QACD,OAAO,UAAU,CAAC,aAAa,CAAC;IAClC,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,+CAA+C,CAAC,SAAyC,EAAE,KAAc,EAAE,YAAoD,EAC3K,wBAAiC,IAAI,EAAE,oBAA6B,IAAI,EAAE,qBAAqB,GAAG,KAAK;QACvG,MAAM,IAAI,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE;YACzB,0EAA0E;YAC1E,IAAI,SAAS,YAAY,kBAAkB,EAAE;gBAC3C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;oBACpC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;wBAC1C,SAAS;oBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;oBAC3C,IAAI,oBAAoB,EAAE;wBACxB,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;wBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;4BACxB,YAAY,CAAC,WAAW,CAAC,CAAC;qBAC7B;iBACF;aACF;iBAAM,EAAG,oCAAoC;gBAC5C,IAAI,qBAAqB,IAAI,SAAS,CAAC,SAAS,EAAE;oBAChD,YAAY;iBACb;qBAAM;oBACL,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBACnE,IAAI,oBAAoB;wBACtB,YAAY,CAAC,oBAAoB,CAAC,CAAC;iBACtC;aACF;SACF;QAED,IAAI,iBAAiB,EAAE;YACrB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,IAAI,SAAS,YAAY,kBAAkB,EAAE;oBAC3C,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,YAAY,CAAC,WAAW,CAAC,CAAC;iBAC7B;qBAAM;oBACL,SAAS,CAAC,wBAAwB,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,UAAU,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;wBACpC,YAAY,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;iBACzC;aACF;SACF;IACH,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,2CAA2C,CAAC,WAAwE,EAAE,KAAc,EAChJ,wBAAiC,IAAI,EAAE,oBAA6B,IAAI,EAAE,qBAAqB,GAAG,KAAK;QACvG,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,WAAW,YAAY,0BAA0B,EAAE;YACrD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,UAAU,EAAE;gBAC5C,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,KAAK,EACjE,CAAC,MAAwB,EAAE,EAAE;oBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;wBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;aACpE;SACF;aAAM,IAAI,WAAW,YAAY,kBAAkB,IAAI,WAAW,YAAY,SAAS,EAAE;YACxF,IAAI,CAAC,+CAA+C,CAAC,WAAW,EAAE,KAAK,EACrE,CAAC,MAAwB,EAAE,EAAE;gBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;SACpE;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8CAA8C,CAAC,SAA6B,EAAE,KAAc;QACxG,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,+CAA+C,CAAC,SAAS,EAAE,KAAK,EACnE,CAAC,MAAwB,EAAE,EAAE;YAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpD,CAAC,EACD,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,mCAAmC,CAAC,OAAiG,EAAE,KAAc,EAAE,uBAAgC,IAAI;QACvM,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,OAAO,YAAY,kBAAkB;YACvC,OAAO,IAAI,CAAC,8CAA8C,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7E,IAAI,OAAO,YAAY,0BAA0B,EAAE;YACjD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE;gBAClC,MAAM,MAAM,GAAG,IAAI,CAAC,8CAA8C,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC7E,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;aAChC;YACD,OAAO,UAAU,CAAC;SACnB;QACD,IAAI,OAAO,YAAY,aAAa,EAAE;YACpC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS;gBAC3C,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,mCAAmC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;SACtF;QACD,IAAI,OAAO,YAAY,UAAU,EAAE;YACjC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE;gBAC7B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE;oBACvC,sFAAsF;iBACvF;qBAAM;oBACL,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;iBACxD;aACF;YACD,OAAO,iBAAiB,CAAC;SAE1B;QACD,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,yBAAyB,CAAC,OAAiG,EAAE,KAAc,EAAE,uBAAgC,IAAI;QAC7L,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,IAAI,CAAC;QAEd,IAAI,OAAO,YAAY,kBAAkB;YACvC,OAAO,IAAI,CAAC,oCAAoC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEnE,IAAI,OAAO,YAAY,0BAA0B,EAAE;YACjD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE;gBAClC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC,EAAE,KAAK,CAAC;oBACrD,OAAO,IAAI,CAAC;aACf;YACD,OAAO,KAAK,CAAC;SACd;QAED,IAAI,OAAO,YAAY,aAAa,EAAE;YACpC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS,EAAK,6DAA6D;gBAC7G,OAAO,IAAI,CAAC;YACd,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;SAC5E;QAED,IAAI,OAAO,YAAY,UAAU,EAAE;YACjC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE;gBAC7B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE;oBACvC,sFAAsF;iBACvF;qBAAM;oBACL,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;iBACxD;aACF;YACD,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC;SAClC;QACD,6FAA6F;QAC7F,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,oCAAoC,CAAC,SAA6B,EAAE,KAAc,EAC9F,wBAAiC,IAAI,EAAE,oBAA6B,IAAI,EAAE,qBAAqB,GAAG,KAAK;QACvG,MAAM,IAAI,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE;YACzB,0EAA0E;YAC1E,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;gBACpC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;oBAC1C,SAAS;gBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/D,IAAI,oBAAoB,EAAE;oBACxB,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;oBAC3C,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;oBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,OAAO,IAAI,CAAC;iBACf;aACF;SACF;QAED,IAAI,iBAAiB,EAAE;YACrB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;gBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;oBACxB,OAAO,IAAI,CAAC;aACf;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC9B,IAAI,GAAG,EAAE;YACP,IAAI,GAAG,CAAC,iBAAiB;mBACpB,GAAG,CAAC,+BAA+B;mBACnC,GAAG,CAAC,2BAA2B;gBAClC,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,uCAAuC,CAAC,SAA6B,EAAE,SAAiB,EAAE,SAA2B,EAAE,UAAiC;QACpK,IAAI,SAAS,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,EAAE;YACpC,OAAO,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBAC1B,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;aAC3B;YACD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC;SACnD;IACH,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAAC,MAAwC,EACrF,UAAkB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU;QAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACzB,OAAO,8BAA8B,CAAC,wBAAwB,CAC5D,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;SACrE;QACD,OAAO,8BAA8B,CAAC,wBAAwB,CAAC,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1G,CAAC;IACD;OACG;IACI,MAAM,CAAC,aAAa,CAAC,IAAsB,EAAE,SAAiB,EAAE,WAA+B,EAAE,KAA4B;QAClI,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;YAC1B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACH;;;;;;;;;;;;;OAaG;IACM,MAAM,CAAC,0BAA0B,CAAC,UAAiB,EAAE,UAAiB,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAC5I,oBAA4B,OAAO;QACnC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,qCAAqC;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE;YACpD,iCAAiC;YACjC,OAAO;SACN;QACL,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACjB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAG,CAAC;SACvB;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YAC1B,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAC;gBACX,OAAO,QAAQ,CAAC,uBAAuB,CAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;aACvD;iBAAK;gBACJ,OAAO,QAAQ,CAAC,uBAAuB,CAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;aACzD;SACF;aAAM;YACL,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE;gBACnB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;SACF;IACH,CAAC;IACC;;;;;;;;;;OAUG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAa,EAAE,MAAa,EAAE,MAAa,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EACrI,oBAA4B,OAAO;QACrC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;YACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;gBACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;oBACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;iBAClG;aACF;SACF;IACH,CAAC;IAEH;;;;;;;;;;;;;OAaG;IACM,MAAM,CAAC,uBAAuB,CAAC,KAAmC,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EACxI,oBAA4B,OAAO;QACnC,qCAAqC;QACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAE,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE;YAClD,6DAA6D;YAC7D,OAAO;SACN;QACL,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACjB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;SACtB;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YAC1B,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAC;gBACX,OAAO,QAAQ,CAAC,uBAAuB,CAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;aACvD;iBAAK;gBACJ,OAAO,QAAQ,CAAC,uBAAuB,CAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;aACzD;SACF;aAAM;YACL,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE;gBACnB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;SACF;IACH,CAAC;IACC;;;;;;;;;;OAUG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAsC,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAChI,iBAAyB,OAAO;QAChC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YACxD,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;SACvF;IACH,CAAC;;AAjjBc,yCAA2B,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module CartesianGeometry\r\n */\r\n\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive, CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Loop } from \"../curve/Loop\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { ClipPlane } from \"./ClipPlane\";\r\nimport { ClipPrimitive } from \"./ClipPrimitive\";\r\nimport { ClipVector } from \"./ClipVector\";\r\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\r\nimport { UnionOfConvexClipPlaneSets } from \"./UnionOfConvexClipPlaneSets\";\r\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { LineStringOffsetClipperContext } from \"./internalContexts/LineStringOffsetClipperContext\";\r\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\r\nimport { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\n\r\n/** Enumerated type for describing where geometry lies with respect to clipping planes.\r\n * @public\r\n */\r\nexport enum ClipPlaneContainment {\r\n /** All points inside */\r\n StronglyInside = 1,\r\n /** Inside/outside state unknown. */\r\n Ambiguous = 2,\r\n /** All points outside */\r\n StronglyOutside = 3,\r\n}\r\n\r\n/** Enumerated type for describing what must yet be done to clip a piece of geometry.\r\n * @public\r\n */\r\nexport enum ClipStatus {\r\n /** some geometry may cross the clip boundaries */\r\n ClipRequired,\r\n /** geometry is clearly outside */\r\n TrivialReject,\r\n /** geometry is clearly inside */\r\n TrivialAccept,\r\n}\r\n\r\n/** An object containing clipping planes that can be used to clip geometry.\r\n * @public\r\n */\r\nexport interface Clipper {\r\n /** test if `point` is on or inside the Clipper's volume. */\r\n isPointOnOrInside(point: Point3d, tolerance?: number): boolean;\r\n /** Find the parts of the line segment (if any) that is within the convex clip volume.\r\n * * The input fractional interval from fraction0 to fraction1 (increasing!!) is the active part to consider.\r\n * * To clip to the usual bounded line segment, start with fractions (0,1).\r\n * If the clip volume is unbounded, the line interval may also be unbounded.\r\n * * An unbounded line portion will have fraction coordinates positive or negative Number.MAX_VALUE.\r\n * @param f0 fraction that is the initial lower fraction of the active interval. (e.g. 0.0 for bounded segment)\r\n * @param f1 fraction that is the initial upper fraction of the active interval. (e.g. 1.0 for bounded segment)\r\n * @param pointA segment start (fraction 0)\r\n * @param pointB segment end (fraction 1)\r\n * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\r\n * @returns true if a segment was announced, false if entirely outside.\r\n */\r\n announceClippedSegmentIntervals(f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber): boolean;\r\n /** Find the portion (or portions) of the arc (if any) that are within the convex clip volume.\r\n * * The input fractional interval from fraction0 to fraction1 (increasing!!) is the active part to consider.\r\n * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\r\n * @returns true if one or more arcs portions were announced, false if entirely outside.\r\n */\r\n announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean;\r\n}\r\n/**\r\n * Interface for clipping polygons.\r\n * Supported by:\r\n * * AlternatingCCTreeNode\r\n * * ConvexClipPlaneSet\r\n * @public\r\n */\r\nexport interface PolygonClipper {\r\n /**\r\n *\r\n * @param xyz input polygon. This is not changed.\r\n * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from the cache. This is NOT cleared.\r\n * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed from the cache. This is NOT cleared.\r\n * @param arrayCache cache for reusable GrowableXYZArray.\r\n */\r\n appendPolygonClip(\r\n xyz: GrowableXYZArray,\r\n insideFragments: GrowableXYZArray[],\r\n outsideFragments: GrowableXYZArray[],\r\n arrayCache: GrowableXYZArrayCache): void;\r\n}\r\n/** Static class whose various methods are functions for clipping geometry\r\n * @public\r\n */\r\nexport class ClipUtilities {\r\n private static _selectIntervals01TestPoint = Point3d.create();\r\n /**\r\n * * Augment the unsortedFractionsArray with 0 and 1\r\n * * sort\r\n * * test the midpoint of each interval with `clipper.isPointOnOrInside`\r\n * * pass accepted intervals to `announce(f0,f1,curve)`\r\n */\r\n public static selectIntervals01(curve: CurvePrimitive, unsortedFractions: GrowableFloat64Array, clipper: Clipper, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\r\n unsortedFractions.push(0);\r\n unsortedFractions.push(1);\r\n unsortedFractions.sort();\r\n let f0 = unsortedFractions.atUncheckedIndex(0);\r\n let f1;\r\n let fMid;\r\n const testPoint = ClipUtilities._selectIntervals01TestPoint;\r\n const n = unsortedFractions.length;\r\n for (let i = 1; i < n; i++) {\r\n f1 = unsortedFractions.atUncheckedIndex(i);\r\n if (f1 > f0 + Geometry.smallFraction) {\r\n fMid = 0.5 * (f0 + f1);\r\n if (fMid >= 0.0 && fMid <= 1.0) {\r\n curve.fractionToPoint(fMid, testPoint);\r\n if (clipper.isPointOnOrInside(testPoint)) {\r\n if (announce)\r\n announce(f0, f1, curve);\r\n else\r\n return true;\r\n }\r\n }\r\n f0 = f1;\r\n }\r\n }\r\n return false;\r\n }\r\n /**\r\n * Announce triples of (low, high, cp) for each entry in intervals\r\n * @param intervals source array\r\n * @param cp CurvePrimitive for announcement\r\n * @param announce function to receive data\r\n */\r\n public static announceNNC(intervals: Range1d[], cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\r\n if (announce) {\r\n for (const ab of intervals) {\r\n announce(ab.low, ab.high, cp);\r\n }\r\n }\r\n return intervals.length > 0;\r\n }\r\n\r\n /** Find portions of the curve that are within the clipper.\r\n * Collect them into an array of curve primitives.\r\n */\r\n public static collectClippedCurves(curve: CurvePrimitive, clipper: Clipper): CurvePrimitive[] {\r\n const result: CurvePrimitive[] = [];\r\n curve.announceClipIntervals(clipper,\r\n (fraction0: number, fraction1: number, curveA: CurvePrimitive) => {\r\n if (fraction1 !== fraction0) {\r\n const partialCurve = curveA.clonePartialCurve(fraction0, fraction1);\r\n if (partialCurve)\r\n result.push(partialCurve);\r\n }\r\n });\r\n return result;\r\n }\r\n\r\n /**\r\n * Clip a polygon down to regions defined by each shape of a ClipShape.\r\n * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\r\n */\r\n public static clipPolygonToClipShape(polygon: Point3d[], clipShape: ClipPrimitive): Point3d[][] {\r\n const outputA = this.clipPolygonToClipShapeReturnGrowableXYZArrays(polygon, clipShape);\r\n const output = [];\r\n for (const g of outputA)\r\n output.push(g.getPoint3dArray());\r\n return output;\r\n }\r\n\r\n /**\r\n * Clip a polygon down to regions defined by each shape of a ClipShape.\r\n * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\r\n */\r\n public static clipPolygonToClipShapeReturnGrowableXYZArrays(polygon: Point3d[], clipShape: ClipPrimitive): GrowableXYZArray[] {\r\n const output: GrowableXYZArray[] = [];\r\n const clipper = clipShape.fetchClipPlanesRef();\r\n // NEEDS WORK -- what if it is a mask !!!!\r\n if (clipper) {\r\n clipper.polygonClip(polygon, output);\r\n }\r\n return output;\r\n }\r\n\r\n /** Given an array of points, test for trivial containment conditions.\r\n * * ClipStatus.TrivialAccept if all points are in any one of the convexSet's.\r\n * * ClipStatus.ClipRequired if (in any single convexSet) there were points on both sides of any single plane.\r\n * * ClipStatus.TrivialReject if neither of those occurred.\r\n */\r\n public static pointSetSingleClipStatus(points: GrowableXYZArray, planeSet: UnionOfConvexClipPlaneSets, tolerance: number): ClipStatus {\r\n if (planeSet.convexSets.length === 0)\r\n return ClipStatus.TrivialAccept;\r\n\r\n for (const convexSet of planeSet.convexSets) {\r\n let allOutsideSinglePlane = false, anyOutside = false;\r\n\r\n for (const plane of convexSet.planes) {\r\n let numInside = 0, numOutside = 0;\r\n const planeDistance = plane.distance - tolerance;\r\n\r\n const currPt = Point3d.create();\r\n const currVec = Vector3d.create();\r\n for (let i = 0; i < points.length; i++) {\r\n points.getPoint3dAtUncheckedPointIndex(i, currPt);\r\n currVec.setFrom(currPt);\r\n currVec.dotProduct(plane.inwardNormalRef) > planeDistance ? numInside++ : numOutside++;\r\n }\r\n\r\n anyOutside = (numOutside !== 0) ? true : anyOutside;\r\n if (numInside === 0) {\r\n allOutsideSinglePlane = true;\r\n break;\r\n }\r\n }\r\n\r\n if (!anyOutside) // totally inside this set - no clip required\r\n return ClipStatus.TrivialAccept;\r\n if (!allOutsideSinglePlane)\r\n return ClipStatus.ClipRequired;\r\n }\r\n return ClipStatus.TrivialReject;\r\n }\r\n\r\n /**\r\n * Emit point loops for intersection of a convex set with a range.\r\n * * return zero length array for (a) null range or (b) no intersections\r\n * @param range range to intersect\r\n * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\r\n * @param includeRangeFaces if false, do not compute facets originating as range faces\r\n * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\r\n */\r\n public static announceLoopsOfConvexClipPlaneSetIntersectRange(convexSet: ConvexClipPlaneSet | ClipPlane, range: Range3d, loopFunction: (loopPoints: GrowableXYZArray) => void,\r\n includeConvexSetFaces: boolean = true, includeRangeFaces: boolean = true, ignoreInvisiblePlanes = false) {\r\n const work = new GrowableXYZArray();\r\n if (includeConvexSetFaces) {\r\n // Clip convexSet planes to the range and to the rest of the convexSet . .\r\n if (convexSet instanceof ConvexClipPlaneSet) {\r\n for (const plane of convexSet.planes) {\r\n if (ignoreInvisiblePlanes && plane.invisible)\r\n continue;\r\n const pointsClippedToRange = plane.intersectRange(range, true);\r\n const finalPoints = new GrowableXYZArray();\r\n if (pointsClippedToRange) {\r\n convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\r\n if (finalPoints.length > 0)\r\n loopFunction(finalPoints);\r\n }\r\n }\r\n } else { // `convexSet` is just one plane ...\r\n if (ignoreInvisiblePlanes && convexSet.invisible) {\r\n // skip it !\r\n } else {\r\n const pointsClippedToRange = convexSet.intersectRange(range, true);\r\n if (pointsClippedToRange)\r\n loopFunction(pointsClippedToRange);\r\n }\r\n }\r\n }\r\n\r\n if (includeRangeFaces) {\r\n // clip range faces to the convex set . . .\r\n const corners = range.corners();\r\n for (let i = 0; i < 6; i++) {\r\n const indices = Range3d.faceCornerIndices(i);\r\n const finalPoints = new GrowableXYZArray();\r\n const lineString = LineString3d.createIndexedPoints(corners, indices);\r\n if (convexSet instanceof ConvexClipPlaneSet) {\r\n convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\r\n if (finalPoints.length > 0)\r\n loopFunction(finalPoints);\r\n } else {\r\n convexSet.clipConvexPolygonInPlace(lineString.packedPoints, work);\r\n if (lineString.packedPoints.length > 0)\r\n loopFunction(lineString.packedPoints);\r\n }\r\n }\r\n }\r\n }\r\n\r\n /**\r\n * Return a (possibly empty) array of geometry (Loops !!) which are facets of the intersection of the convex set intersecting a range.\r\n * * return zero length array for (a) null range or (b) no intersections\r\n * @param allClippers convex or union clipper\r\n * @param range range to intersect\r\n * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\r\n * @param includeRangeFaces if false, do not compute facets originating as range faces\r\n * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\r\n */\r\n public static loopsOfConvexClipPlaneIntersectionWithRange(allClippers: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPlane, range: Range3d,\r\n includeConvexSetFaces: boolean = true, includeRangeFaces: boolean = true, ignoreInvisiblePlanes = false): GeometryQuery[] {\r\n const result: GeometryQuery[] = [];\r\n if (allClippers instanceof UnionOfConvexClipPlaneSets) {\r\n for (const clipper of allClippers.convexSets) {\r\n this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range,\r\n (points: GrowableXYZArray) => {\r\n if (points.length > 0) result.push(Loop.createPolygon(points));\r\n },\r\n includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\r\n }\r\n } else if (allClippers instanceof ConvexClipPlaneSet || allClippers instanceof ClipPlane) {\r\n this.announceLoopsOfConvexClipPlaneSetIntersectRange(allClippers, range,\r\n (points: GrowableXYZArray) => {\r\n if (points.length > 0) result.push(Loop.createPolygon(points));\r\n },\r\n includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\r\n }\r\n return result;\r\n }\r\n /**\r\n * Return the (possibly null) range of the intersection of the convex set with a range.\r\n * * The convex set is permitted to be unbounded (e.g. a single plane). The range parameter provides bounds.\r\n * @param convexSet convex set for intersection.\r\n * @param range range to intersect\r\n */\r\n public static rangeOfConvexClipPlaneSetIntersectionWithRange(convexSet: ConvexClipPlaneSet, range: Range3d): Range3d {\r\n const result = Range3d.createNull();\r\n this.announceLoopsOfConvexClipPlaneSetIntersectRange(convexSet, range,\r\n (points: GrowableXYZArray) => {\r\n if (points.length > 0) result.extendArray(points);\r\n },\r\n true, true, false);\r\n return result;\r\n }\r\n /**\r\n * Return the range of various types of clippers\r\n * * `ConvexClipPlaneSet` -- dispatch to `rangeOfConvexClipPlaneSetIntersectionWithRange`\r\n * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\r\n * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\r\n * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\r\n * * `undefined` -- entire input range.\r\n * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and this effectively returns the range of the edge work of the members\r\n * * If `observeInvisibleFlag` is false, the \"invisible\" properties are observed, and \"invisible\" parts do not restrict the range.\r\n * @param clipper\r\n * @param range non-null range.\r\n * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\r\n */\r\n public static rangeOfClipperIntersectionWithRange(clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined, range: Range3d, observeInvisibleFlag: boolean = true): Range3d {\r\n if (clipper === undefined)\r\n return range.clone();\r\n if (clipper instanceof ConvexClipPlaneSet)\r\n return this.rangeOfConvexClipPlaneSetIntersectionWithRange(clipper, range);\r\n if (clipper instanceof UnionOfConvexClipPlaneSets) {\r\n const rangeUnion = Range3d.createNull();\r\n for (const c of clipper.convexSets) {\r\n const rangeC = this.rangeOfConvexClipPlaneSetIntersectionWithRange(c, range);\r\n rangeUnion.extendRange(rangeC);\r\n }\r\n return rangeUnion;\r\n }\r\n if (clipper instanceof ClipPrimitive) {\r\n if (observeInvisibleFlag && clipper.invisible)\r\n return range.clone();\r\n return this.rangeOfClipperIntersectionWithRange(clipper.fetchClipPlanesRef(), range);\r\n }\r\n if (clipper instanceof ClipVector) {\r\n const rangeIntersection = range.clone();\r\n for (const c of clipper.clips) {\r\n if (observeInvisibleFlag && c.invisible) {\r\n // trivial range tests do not expose the effects. Assume the hole allows everything.\r\n } else {\r\n const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\r\n rangeIntersection.intersect(rangeC, rangeIntersection);\r\n }\r\n }\r\n return rangeIntersection;\r\n\r\n }\r\n return range.clone();\r\n }\r\n /**\r\n * Test if various types of clippers have any intersection with a range.\r\n * * This follows the same logic as `rangeOfClipperIntersectionWithRange` but attempts to exit at earliest point of confirmed intersection\r\n * * `ConvexClipPlaneSet` -- dispatch to `doesConvexClipPlaneSetIntersectRange`\r\n * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\r\n * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\r\n * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\r\n * * `undefined` -- entire input range.\r\n * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and holes do not affect the result.\r\n * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and may affect the result.\r\n * @param clipper\r\n * @param range non-null range.\r\n * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\r\n */\r\n public static doesClipperIntersectRange(clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined, range: Range3d, observeInvisibleFlag: boolean = true): boolean {\r\n if (clipper === undefined)\r\n return true;\r\n\r\n if (clipper instanceof ConvexClipPlaneSet)\r\n return this.doesConvexClipPlaneSetIntersectRange(clipper, range);\r\n\r\n if (clipper instanceof UnionOfConvexClipPlaneSets) {\r\n for (const c of clipper.convexSets) {\r\n if (this.doesConvexClipPlaneSetIntersectRange(c, range))\r\n return true;\r\n }\r\n return false;\r\n }\r\n\r\n if (clipper instanceof ClipPrimitive) {\r\n if (observeInvisibleFlag && clipper.invisible) // um is there an easy way to detect range-completely-inside?\r\n return true;\r\n return this.doesClipperIntersectRange(clipper.fetchClipPlanesRef(), range);\r\n }\r\n\r\n if (clipper instanceof ClipVector) {\r\n const rangeIntersection = range.clone();\r\n for (const c of clipper.clips) {\r\n if (observeInvisibleFlag && c.invisible) {\r\n // trivial range tests do not expose the effects. Assume the hole allows everything.\r\n } else {\r\n const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\r\n rangeIntersection.intersect(rangeC, rangeIntersection);\r\n }\r\n }\r\n return !rangeIntersection.isNull;\r\n }\r\n /** If the case statement above is complete for the variant inputs, this is unreachable .. */\r\n return false;\r\n }\r\n /**\r\n * Emit point loops for intersection of a convex set with a range.\r\n * * return zero length array for (a) null range or (b) no intersections\r\n * @param range range to intersect\r\n * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\r\n * @param includeRangeFaces if false, do not compute facets originating as range faces\r\n * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\r\n */\r\n public static doesConvexClipPlaneSetIntersectRange(convexSet: ConvexClipPlaneSet, range: Range3d,\r\n includeConvexSetFaces: boolean = true, includeRangeFaces: boolean = true, ignoreInvisiblePlanes = false): boolean {\r\n const work = new GrowableXYZArray();\r\n if (includeConvexSetFaces) {\r\n // Clip convexSet planes to the range and to the rest of the convexSet . .\r\n for (const plane of convexSet.planes) {\r\n if (ignoreInvisiblePlanes && plane.invisible)\r\n continue;\r\n const pointsClippedToRange = plane.intersectRange(range, true);\r\n if (pointsClippedToRange) {\r\n const finalPoints = new GrowableXYZArray();\r\n convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\r\n if (finalPoints.length > 0)\r\n return true;\r\n }\r\n }\r\n }\r\n\r\n if (includeRangeFaces) {\r\n // clip range faces to the convex set . . .\r\n const corners = range.corners();\r\n for (let i = 0; i < 6; i++) {\r\n const indices = Range3d.faceCornerIndices(i);\r\n const finalPoints = new GrowableXYZArray();\r\n const lineString = LineString3d.createIndexedPoints(corners, indices);\r\n convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\r\n if (finalPoints.length > 0)\r\n return true;\r\n }\r\n }\r\n return false;\r\n }\r\n /**\r\n * Test if `obj` is a `Clipper` object.\r\n * * This is implemented by testing for each of the methods in the `Clipper` interface.\r\n */\r\n public static isClipper(obj: any): boolean {\r\n if (obj) {\r\n if (obj.isPointOnOrInside\r\n && obj.announceClippedSegmentIntervals\r\n && obj.announceClippedArcIntervals)\r\n return true;\r\n }\r\n return false;\r\n }\r\n /**\r\n * Specialized logic for replacing clip fragments by an equivalent singleton.\r\n * * If there are baseCount + 1 or fewer fragments, do nothing.\r\n * * If there are more than baseCount+1 fragments:\r\n * * drop them all to the cache\r\n * * push a copy of the singleton.\r\n * * The use case for this is that a multi-step clipper (e.g. UnionOfConvexClipPlaneSets) may produce many fragments, and then be able to determine\r\n * that they really are the original pre-clip polygon unchanged.\r\n * * The baseCount+1 case is the case where the entire original singleton is still a singleton and can be left alone.\r\n * * Calling this replacer shuffles the original back into the fragment array, and drops the fragments.\r\n * * This determination is solely within the logic of the caller.\r\n * @param shards array of fragments\r\n * @param baseCount original count\r\n * @param singleton single array which may be a replacement for multiple fragments\r\n * @param cache cache for array management\r\n */\r\n public static restoreSingletonInPlaceOfMultipleShards(fragments: GrowableXYZArray[], baseCount: number, singleton: GrowableXYZArray, arrayCache: GrowableXYZArrayCache) {\r\n if (fragments.length > baseCount + 1) {\r\n while (fragments.length > baseCount) {\r\n const f = fragments.pop();\r\n arrayCache.dropToCache(f);\r\n }\r\n fragments.push(arrayCache.grabAndFill(singleton));\r\n }\r\n }\r\n\r\n /**\r\n * Create a UnionOfConvexClipPlaneSets for a volume defined by a path and offsets.\r\n * @param points points along the path.\r\n * @param positiveOffsetLeft offset to left. 0 is clip on the path.\r\n * @param positiveOffsetRight offset to the right. 0 is clip on the path.\r\n * @param z0 z for lower clipping plane. If undefined, unbounded in positive z\r\n * @param z1 z for upper clipping plane. If undefined, unbounded in negative z.\r\n * @alpha\r\n */\r\n public static createXYOffsetClipFromLineString(points: Point3d[] | IndexedXYZCollection,\r\n leftOffset: number, rightOffset: number, z0: number, z1: number): UnionOfConvexClipPlaneSets {\r\n if (Array.isArray(points)) {\r\n return LineStringOffsetClipperContext.createClipBetweenOffsets(\r\n new Point3dArrayCarrier(points), leftOffset, rightOffset, z0, z1);\r\n }\r\n return LineStringOffsetClipperContext.createClipBetweenOffsets(points, leftOffset, rightOffset, z0, z1);\r\n }\r\n /** if data.length >= minLength threshold, push it to destination; if smaller drop it back to the cache.\r\n */\r\n public static captureOrDrop(data: GrowableXYZArray, minLength: number, destination: GrowableXYZArray[], cache: GrowableXYZArrayCache) {\r\n if (data.length >= minLength)\r\n destination.push(data);\r\n else\r\n cache.dropToCache(data);\r\n }\r\n/**\r\n * Find the portion of a line within a half-plane clip.\r\n * * The half-plane clip is to the left of the line from clipA to clipB.\r\n * * The original clipped segment has fractions 0 and 1 at respective segment points.\r\n * * Caller initializes the interval\r\n * * This method reduces the interval size.\r\n * * See clipSegmentToCCWTriangleXY for typical use.\r\n * @param linePointA First point of clip line\r\n * @param linePointB Second point of clip line\r\n * @param segmentPoint0 First point of clipped segment\r\n * @param segmentPoint1 Second point of clipped segment\r\n * @param interval Live interval.\r\n * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\r\n */\r\n public static clipSegmentToLLeftOfLineXY(linePointA: XAndY, linePointB: XAndY, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d,\r\n absoluteTolerance: number = 1.0e-14) {\r\n const ux = linePointB.x - linePointA.x;\r\n const uy = linePointB.y - linePointA.y;\r\n // negative is in positive is out ...\r\n const h0 = -(ux * (segmentPoint0.y - linePointA.y) - uy * (segmentPoint0.x - linePointA.x));\r\n const h1 = -(ux * (segmentPoint1.y - linePointA.y) - uy * (segmentPoint1.x - linePointA.x));\r\n if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\r\n // The entire segment is in .....\r\n return;\r\n }\r\n if (h0 * h1 > 0.0) {\r\n if (h0 > 0.0)\r\n interval.setNull ();\r\n } else if (h0 * h1 < 0.0) {\r\n // strict crossing with safe fraction . . .\r\n const fraction = -h0 / (h1 - h0);\r\n if (h0 < 0.0){\r\n return interval.intersectRangeXXInPlace (0.0, fraction);\r\n }else {\r\n return interval.intersectRangeXXInPlace (fraction, 1.0);\r\n }\r\n } else {\r\n // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\r\n // A zero and a zero or negative is entirely in, which does not alter the prior clip.\r\n if (h0 > 0.0) {\r\n interval.intersectRangeXXInPlace(1.0, 1.0);\r\n } else if (h1 > 0.0) {\r\n interval.intersectRangeXXInPlace(0.0, 0.0);\r\n }\r\n }\r\n}\r\n /**\r\n * Clip an interval of a line segment to a triangle.\r\n * * Triangle is assumed CCW\r\n * @param pointA point of triangle.\r\n * @param pointB point of triangle.\r\n * @param pointC point of triangle.\r\n * @param segment0 start of segment\r\n * @param segment1 end of segment\r\n * @param interval Pre-initialized interval of live part of segment\r\n * @param absoluteTolerance absolute tolerance for begin \"on a line\"\r\n */\r\n public static clipSegmentToCCWTriangleXY(pointA: XAndY, pointB: XAndY, pointC: XAndY, segment0: XAndY, segment1: XAndY, interval: Range1d,\r\n absoluteTolerance: number = 1.0e-14) {\r\n if (!interval.isNull) {\r\n this.clipSegmentToLLeftOfLineXY(pointA, pointB, segment0, segment1, interval, absoluteTolerance);\r\n if (!interval.isNull) {\r\n this.clipSegmentToLLeftOfLineXY(pointB, pointC, segment0, segment1, interval, absoluteTolerance);\r\n if (!interval.isNull) {\r\n this.clipSegmentToLLeftOfLineXY(pointC, pointA, segment0, segment1, interval, absoluteTolerance);\r\n }\r\n }\r\n }\r\n }\r\n\r\n/**\r\n * Find the portion of a line within a half-plane clip.\r\n * * The half-plane clip is to the left of the line from clipA to clipB.\r\n * * The original clipped segment has fractions 0 and 1 at respective segment points.\r\n * * Caller initializes the interval\r\n * * This method reduces the interval size.\r\n * * See clipSegmentToCCWTriangleXY for typical use.\r\n * @param linePointA First point of clip line\r\n * @param linePointB Second point of clip line\r\n * @param segmentPoint0 First point of clipped segment\r\n * @param segmentPoint1 Second point of clipped segment\r\n * @param interval Live interval.\r\n * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\r\n */\r\n public static clipSegmentBelowPlaneXY(plane: Plane3dByOriginAndUnitNormal, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d,\r\n absoluteTolerance: number = 1.0e-14) {\r\n // negative is in positive is out ...\r\n const h0 = plane.altitudeXY (segmentPoint0.x, segmentPoint0.y);\r\n const h1 = plane.altitudeXY(segmentPoint1.x, segmentPoint1.y);\r\n if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\r\n // The entire segment is in ..... the interval is unaffected.\r\n return;\r\n }\r\n if (h0 * h1 > 0.0) {\r\n if (h0 > 0.0)\r\n interval.setNull();\r\n } else if (h0 * h1 < 0.0) {\r\n // strict crossing with safe fraction . . .\r\n const fraction = -h0 / (h1 - h0);\r\n if (h0 < 0.0){\r\n return interval.intersectRangeXXInPlace (0.0, fraction);\r\n }else {\r\n return interval.intersectRangeXXInPlace (fraction, 1.0);\r\n }\r\n } else {\r\n // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\r\n // A zero and a zero or negative is entirely in, which does not alter the prior clip.\r\n if (h0 > 0.0) {\r\n interval.intersectRangeXXInPlace(1.0, 1.0);\r\n } else if (h1 > 0.0) {\r\n interval.intersectRangeXXInPlace(0.0, 0.0);\r\n }\r\n }\r\n}\r\n /**\r\n * Clip an interval of a line segment to an array of planes\r\n * * plane normals assumed OUTWARD\r\n * * planeAltitude is typically a tolerance a tolerance distance.\r\n * * positive altitude makes tha plane move in the direction of the unit normal.\r\n * @param planes array of planes\r\n * @param segment0 start of segment\r\n * @param segment1 end of segment\r\n * @param interval Pre-initialized interval of live part of segment\r\n * @param absoluteTolerance absolute tolerance for begin \"on a line\"\r\n */\r\n public static clipSegmentBelowPlanesXY(planes: Plane3dByOriginAndUnitNormal[], segment0: XAndY, segment1: XAndY, interval: Range1d,\r\n signedAltitude: number = 1.0e-14) {\r\n const numPlanes = planes.length;\r\n for (let i = 0; (!interval.isNull) && i < numPlanes; i++) {\r\n this.clipSegmentBelowPlaneXY(planes[i], segment0, segment1, interval, signedAltitude);\r\n }\r\n }\r\n}\r\n"]}

package/lib/esm/clipping/ClipVector.d.ts ADDED Viewed

@@ -0,0 +1,154 @@
+import { Point3d } from "../geometry3d/Point3dVector3d";
+import { Range3d } from "../geometry3d/Range";
+import { Segment1d } from "../geometry3d/Segment1d";
+import { Transform } from "../geometry3d/Transform";
+import { Matrix4d } from "../geometry4d/Matrix4d";
+import { ClipPrimitive, ClipPrimitiveProps } from "./ClipPrimitive";
+import { ClipPlaneContainment } from "./ClipUtils";
+/** Wire format describing a [[ClipVector]].
+ * @public
+ */
+export declare type ClipVectorProps = ClipPrimitiveProps[];
+/** Class holding an array structure of shapes defined by `ClipPrimitive`
+ * * The `ClipVector` defines an intersection of the member `ClipPrimitive` regions.
+ * * In the most common usage, one of the `ClipPrimitive` will be an outer region, and all others are holes with marker flag indicating that they outside of each hole is live.
+ * @public
+ */
+export declare class ClipVector {
+    private _clips;
+    /** range acting as first filter.
+     * * This is understood as overall range limit, not as precise planes.
+     * * applying any rotation to the whole ClipVector generally expands this range, rather than exactly transforming its planes.
+     */
+    boundingRange: Range3d;
+    /** Returns a reference to the array of ClipShapes. */
+    get clips(): ClipPrimitive[];
+    private constructor();
+    /** Returns true if this ClipVector contains a ClipPrimitive. */
+    get isValid(): boolean;
+    /** Create a ClipVector with an empty set of ClipShapes. */
+    static createEmpty(result?: ClipVector): ClipVector;
+    /** Create a ClipVector from an array of ClipPrimitives (or derived classes) (capture the pointers) */
+    static createCapture(clips: ClipPrimitive[], result?: ClipVector): ClipVector;
+    /** Create a ClipVector from (clones of) an array of ClipPrimitives */
+    static create(clips: ClipPrimitive[], result?: ClipVector): ClipVector;
+    /** Create a deep copy of another ClipVector */
+    clone(result?: ClipVector): ClipVector;
+    /** Parse this ClipVector into a JSON object. */
+    toJSON(): ClipVectorProps;
+    /** Parse a JSON object into a new ClipVector. */
+    static fromJSON(json: ClipVectorProps | undefined, result?: ClipVector): ClipVector;
+    /** Empties out the array of ClipShapes. */
+    clear(): void;
+    /** Append a deep copy of the given ClipPrimitive to this ClipVector. */
+    appendClone(clip: ClipPrimitive): void;
+    /** Append a reference of the given ClipPrimitive to this ClipVector. */
+    appendReference(clip: ClipPrimitive): void;
+    /** Create and append a new ClipPrimitive to the array given a shape as an array of points. Returns true if successful. */
+    appendShape(shape: Point3d[], zLow?: number, zHigh?: number, transform?: Transform, isMask?: boolean, invisible?: boolean): boolean;
+    /** Returns true if the given point lies inside all of this ClipVector's ClipShapes (by rule of intersection). */
+    pointInside(point: Point3d, onTolerance?: number): boolean;
+    /** Transforms this ClipVector to a new coordinate-system.
+     * Note that if the transform has rotate and scale the boundingRange member expands.
+     * Returns true if successful.
+     */
+    transformInPlace(transform: Transform): boolean;
+    /**
+     * A simple way of packaging this ClipVector's ClipShape points into a multidimensional array, while also
+     * taking into account each ClipPrimitive's individual transforms.
+     *
+     * ClipPrimitives OTHER THAN ClipShape are ignored.
+     *
+     * Information out:
+     *  - All of the loop points are stored in the multidimensional Point3d array given (will return unchanged upon failure)
+     *  - If given a transform, will be set from the transformFromClip of the first ClipPrimitive
+     *  - The ClipMask of the final ClipPrimitive is stored in the returned array at index 0
+     *  - The last valid zLow found is stored in the returned array at index 1
+     *  - The last valid zHigh found is stored in the returned array at index 2
+     */
+    extractBoundaryLoops(loopPoints: Point3d[][], transform?: Transform): number[];
+    /** Sets this ClipVector and all of its members to the visibility specified. */
+    setInvisible(invisible: boolean): void;
+    /** For every clip, parse the member point array into the member clip plane object (only for clipPlanes member, not the mask) */
+    parseClipPlanes(): void;
+    /**
+     * Multiply all ClipPlanes DPoint4d by matrix.
+     * @param matrix matrix to apply.
+     * @param invert if true, use in verse of the matrix.
+     * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
+     * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
+     * * Both params default to true to get the full effect of transforming space.
+     * @param matrix matrix to apply
+     * @returns false if matrix inversion fails.
+     */
+    multiplyPlanesByMatrix4d(matrix: Matrix4d, invert?: boolean, transpose?: boolean): boolean;
+    /**
+     * Determines whether the given points fall inside or outside this set of ClipShapes. If any set is defined by masking planes,
+     * checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the _clipplanes member.
+     */
+    classifyPointContainment(points: Point3d[], ignoreMasks?: boolean): ClipPlaneContainment;
+    /**
+     * Determines whether a 3D range lies inside or outside this set of ClipShapes. If any set is defined by masking planes,
+     * checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the clip planes member.
+     */
+    classifyRangeContainment(range: Range3d, ignoreMasks: boolean): ClipPlaneContainment;
+    /**
+     * For an array of points (making up a LineString), tests whether the segment between each point lies inside the ClipVector.
+     * If true, returns true immediately.
+     */
+    isAnyLineStringPointInside(points: Point3d[]): boolean;
+    /** Note: Line segments are used to represent 1 dimensional intervals here, rather than segments. */
+    sumSizes(intervals: Segment1d[], begin: number, end: number): number;
+    private static readonly _TARGET_FRACTION_SUM;
+    /**
+     * For an array of points that make up a LineString, develops a line segment between each point pair,
+     * and returns true if all segments lie inside this ClipVector.
+     */
+    isLineStringCompletelyContained(points: Point3d[]): boolean;
+    /** Serializes this ClipVector to a compact string representation appropriate for transmission as part of a URL.
+     * Chiefly used for requesting [Tile]($frontend)s with section cut facets.
+     * UnionOfConvexClipPlaneSets is obtained for each ClipPrimitive. The encoding is as follows:
+     *  ClipVector:
+     *    ClipPrimitive[]
+     *    _
+     *  ClipPrimitive:
+     *    invisible: 0|1
+     *    ConvexClipPlaneSet[]
+     *    _
+     *  ConvexClipPlaneSet:
+     *    ClipPlane[]
+     *    _
+     *  ClipPlane:
+     *    flags: 0|1|2|3, where 1=invisible and 2=interior
+     *    inwardNormal: Number[3]
+     *    distance: Number
+     *  Number:
+     *    number
+     *    _
+     * @alpha
+     */
+    toCompactString(): string;
+}
+/** Bundles a [[ClipVector]] with its compact string representation.
+ * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.
+ * @see [[StringifiedClipVector.fromClipVector]] to create from a ClipVector.
+ * @see [[ClipVector.toCompactString]] for a description of the string representation.
+ * @alpha
+ */
+export declare type StringifiedClipVector = ClipVector & {
+    readonly clipString: string;
+};
+/** Bundles a ClipVector with its compact string representation.
+ * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.
+ * @alpha
+ */
+export declare namespace StringifiedClipVector {
+    /** Create from a ClipVector.
+     * @param clip The ClipVector to stringify.
+     * @returns The input ClipVector with its compact string representation, or undefined if the input is undefined or empty.
+     * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.
+     */
+    function fromClipVector(clip?: ClipVector): StringifiedClipVector | undefined;
+}
+//# sourceMappingURL=ClipVector.d.ts.map

package/lib/esm/clipping/ClipVector.d.ts.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"ClipVector.d.ts","sourceRoot":"","sources":["../../../src/clipping/ClipVector.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD,OAAO,EAA0B,aAAa,EAAE,kBAAkB,EAAa,MAAM,iBAAiB,CAAC;AACvG,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAGnD;;GAEG;AACH,oBAAY,eAAe,GAAG,kBAAkB,EAAE,CAAC;AAEnD;;;;GAIG;AACH,qBAAa,UAAU;IACrB,OAAO,CAAC,MAAM,CAAkB;IAChC;;;OAGG;IACI,aAAa,EAAE,OAAO,CAAwB;IAErD,sDAAsD;IACtD,IAAW,KAAK,oBAA0B;IAE1C,OAAO;IAIP,gEAAgE;IAChE,IAAW,OAAO,IAAI,OAAO,CAAmC;IAEhE,2DAA2D;WAC7C,WAAW,CAAC,MAAM,CAAC,EAAE,UAAU,GAAG,UAAU;IAQ1D,sGAAsG;WACxF,aAAa,CAAC,KAAK,EAAE,aAAa,EAAE,EAAE,MAAM,CAAC,EAAE,UAAU,GAAG,UAAU;IAQpF,sEAAsE;WACxD,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,EAAE,MAAM,CAAC,EAAE,UAAU,GAAG,UAAU;IAO7E,+CAA+C;IACxC,KAAK,CAAC,MAAM,CAAC,EAAE,UAAU,GAAG,UAAU;IAU7C,gDAAgD;IACzC,MAAM,IAAI,eAAe;IAOhC,iDAAiD;WACnC,QAAQ,CAAC,IAAI,EAAE,eAAe,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,UAAU,GAAG,UAAU;IAmB1F,2CAA2C;IACpC,KAAK;IAIZ,wEAAwE;IACjE,WAAW,CAAC,IAAI,EAAE,aAAa;IAItC,wEAAwE;IACjE,eAAe,CAAC,IAAI,EAAE,aAAa;IAI1C,0HAA0H;IACnH,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,EAChE,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,GAAE,OAAe,EAAE,SAAS,GAAE,OAAe,GAAG,OAAO;IAQtF,iHAAiH;IAC1G,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,GAAE,MAA4C,GAAG,OAAO;IAWtG;;;OAGG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAWtD;;;;;;;;;;;;OAYG;IACI,oBAAoB,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,MAAM,EAAE;IA0DrF,+EAA+E;IACxE,YAAY,CAAC,SAAS,EAAE,OAAO;IAKtC,gIAAgI;IACzH,eAAe;IAKtB;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAa7G;;;OAGG;IACI,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,GAAE,OAAe,GAAG,oBAAoB;IAiBtG;;;OAGG;IACI,wBAAwB,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,GAAG,oBAAoB;IAK3F;;;OAGG;IACI,0BAA0B,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO;IAc7D,oGAAoG;IAC7F,QAAQ,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAO3E,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,oBAAoB,CAAc;IAC1D;;;OAGG;IACI,+BAA+B,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO;IA0BlE;;;;;;;;;;;;;;;;;;;;;OAqBG;IACI,eAAe,IAAI,MAAM;CAiDjC;AAED;;;;;GAKG;AACH,oBAAY,qBAAqB,GAAG,UAAU,GAAG;IAAE,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC;AAEjF;;;GAGG;AACH,yBAAiB,qBAAqB,CAAC;IACrC;;;;OAIG;IACH,SAAgB,cAAc,CAAC,IAAI,CAAC,EAAE,UAAU,GAAG,qBAAqB,GAAG,SAAS,CAWnF;CACF"}

package/lib/esm/clipping/ClipVector.js ADDED Viewed

@@ -0,0 +1,388 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { assert } from "@itwin/core-bentley";
+import { LineSegment3d } from "../curve/LineSegment3d";
+import { Geometry } from "../Geometry";
+import { Range3d } from "../geometry3d/Range";
+import { Transform } from "../geometry3d/Transform";
+import { ClipMaskXYZRangePlanes, ClipPrimitive, ClipShape } from "./ClipPrimitive";
+import { ClipPlaneContainment } from "./ClipUtils";
+/** Class holding an array structure of shapes defined by `ClipPrimitive`
+ * * The `ClipVector` defines an intersection of the member `ClipPrimitive` regions.
+ * * In the most common usage, one of the `ClipPrimitive` will be an outer region, and all others are holes with marker flag indicating that they outside of each hole is live.
+ * @public
+ */
+export class ClipVector {
+    constructor(clips) {
+        /** range acting as first filter.
+         * * This is understood as overall range limit, not as precise planes.
+         * * applying any rotation to the whole ClipVector generally expands this range, rather than exactly transforming its planes.
+         */
+        this.boundingRange = Range3d.createNull();
+        this._clips = clips ? clips : [];
+    }
+    /** Returns a reference to the array of ClipShapes. */
+    get clips() { return this._clips; }
+    /** Returns true if this ClipVector contains a ClipPrimitive. */
+    get isValid() { return this._clips.length > 0; }
+    /** Create a ClipVector with an empty set of ClipShapes. */
+    static createEmpty(result) {
+        if (result) {
+            result._clips.length = 0;
+            return result;
+        }
+        return new ClipVector();
+    }
+    /** Create a ClipVector from an array of ClipPrimitives (or derived classes) (capture the pointers) */
+    static createCapture(clips, result) {
+        if (result) {
+            result._clips = clips;
+            return result;
+        }
+        return new ClipVector(clips);
+    }
+    /** Create a ClipVector from (clones of) an array of ClipPrimitives */
+    static create(clips, result) {
+        const clipClones = [];
+        for (const clip of clips)
+            clipClones.push(clip.clone());
+        return ClipVector.createCapture(clipClones, result);
+    }
+    /** Create a deep copy of another ClipVector */
+    clone(result) {
+        const retVal = result ? result : new ClipVector();
+        retVal._clips.length = 0;
+        for (const clip of this._clips) {
+            retVal._clips.push(clip.clone());
+        }
+        retVal.boundingRange.setFrom(this.boundingRange);
+        return retVal;
+    }
+    /** Parse this ClipVector into a JSON object. */
+    toJSON() {
+        if (!this.isValid)
+            return [];
+        return this.clips.map((clip) => clip.toJSON());
+    }
+    /** Parse a JSON object into a new ClipVector. */
+    static fromJSON(json, result) {
+        result = result ? result : new ClipVector();
+        result.clear();
+        if (!Array.isArray(json))
+            return result;
+        try {
+            for (const clip of json) {
+                const clipPrim = ClipPrimitive.fromJSON(clip);
+                if (clipPrim)
+                    result._clips.push(clipPrim);
+            }
+        }
+        catch (e) {
+            result.clear();
+        }
+        return result;
+    }
+    /** Empties out the array of ClipShapes. */
+    clear() {
+        this._clips.length = 0;
+    }
+    /** Append a deep copy of the given ClipPrimitive to this ClipVector. */
+    appendClone(clip) {
+        this._clips.push(clip.clone());
+    }
+    /** Append a reference of the given ClipPrimitive to this ClipVector. */
+    appendReference(clip) {
+        this._clips.push(clip);
+    }
+    /** Create and append a new ClipPrimitive to the array given a shape as an array of points. Returns true if successful. */
+    appendShape(shape, zLow, zHigh, transform, isMask = false, invisible = false) {
+        const clip = ClipShape.createShape(shape, zLow, zHigh, transform, isMask, invisible);
+        if (!clip)
+            return false;
+        this._clips.push(clip);
+        return true;
+    }
+    /** Returns true if the given point lies inside all of this ClipVector's ClipShapes (by rule of intersection). */
+    pointInside(point, onTolerance = Geometry.smallMetricDistanceSquared) {
+        if (!this.boundingRange.isNull && !this.boundingRange.containsPoint(point))
+            return false;
+        for (const clip of this._clips) {
+            if (!clip.pointInside(point, onTolerance))
+                return false;
+        }
+        return true;
+    }
+    /** Transforms this ClipVector to a new coordinate-system.
+     * Note that if the transform has rotate and scale the boundingRange member expands.
+     * Returns true if successful.
+     */
+    transformInPlace(transform) {
+        for (const clip of this._clips)
+            if (clip.transformInPlace(transform) === false)
+                return false;
+        if (!this.boundingRange.isNull)
+            transform.multiplyRange(this.boundingRange, this.boundingRange);
+        return true;
+    }
+    /**
+     * A simple way of packaging this ClipVector's ClipShape points into a multidimensional array, while also
+     * taking into account each ClipPrimitive's individual transforms.
+     *
+     * ClipPrimitives OTHER THAN ClipShape are ignored.
+     *
+     * Information out:
+     *  - All of the loop points are stored in the multidimensional Point3d array given (will return unchanged upon failure)
+     *  - If given a transform, will be set from the transformFromClip of the first ClipPrimitive
+     *  - The ClipMask of the final ClipPrimitive is stored in the returned array at index 0
+     *  - The last valid zLow found is stored in the returned array at index 1
+     *  - The last valid zHigh found is stored in the returned array at index 2
+     */
+    extractBoundaryLoops(loopPoints, transform) {
+        let clipM = ClipMaskXYZRangePlanes.None;
+        let zBack = -Number.MAX_VALUE;
+        let zFront = Number.MAX_VALUE;
+        const retVal = [];
+        let nLoops = 0;
+        if (this._clips.length === 0)
+            return retVal;
+        let firstClipShape;
+        const deltaTrans = Transform.createIdentity();
+        for (const clip of this._clips) {
+            if (clip instanceof ClipShape) {
+                if (firstClipShape !== undefined && clip !== firstClipShape) { // Is not the first iteration
+                    let fwdTrans = Transform.createIdentity();
+                    let invTrans = Transform.createIdentity();
+                    if (firstClipShape.transformValid && clip.transformValid) {
+                        fwdTrans = clip.transformFromClip.clone();
+                        invTrans = firstClipShape.transformToClip.clone();
+                    }
+                    deltaTrans.setFrom(invTrans.multiplyTransformTransform(fwdTrans));
+                }
+                if (!firstClipShape)
+                    firstClipShape = clip;
+                loopPoints[nLoops] = [];
+                if (clip.polygon !== undefined) {
+                    clipM = ClipMaskXYZRangePlanes.XAndY;
+                    if (clip.zHighValid) {
+                        clipM = clipM | ClipMaskXYZRangePlanes.ZHigh;
+                        zFront = clip.zHigh;
+                    }
+                    if (clip.zLowValid) {
+                        clipM = clipM | ClipMaskXYZRangePlanes.ZLow;
+                        zBack = clip.zLow;
+                    }
+                    for (const point of clip.polygon)
+                        loopPoints[nLoops].push(point.clone());
+                    deltaTrans.multiplyPoint3dArray(loopPoints[nLoops], loopPoints[nLoops]);
+                    nLoops++;
+                }
+            }
+        }
+        retVal.push(clipM);
+        retVal.push(zBack);
+        retVal.push(zFront);
+        if (transform && firstClipShape)
+            transform.setFrom(firstClipShape.transformFromClip);
+        return retVal;
+    }
+    /** Sets this ClipVector and all of its members to the visibility specified. */
+    setInvisible(invisible) {
+        for (const clip of this._clips)
+            clip.setInvisible(invisible);
+    }
+    /** For every clip, parse the member point array into the member clip plane object (only for clipPlanes member, not the mask) */
+    parseClipPlanes() {
+        for (const clip of this._clips)
+            clip.fetchClipPlanesRef();
+    }
+    /**
+     * Multiply all ClipPlanes DPoint4d by matrix.
+     * @param matrix matrix to apply.
+     * @param invert if true, use in verse of the matrix.
+     * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
+     * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
+     * * Both params default to true to get the full effect of transforming space.
+     * @param matrix matrix to apply
+     * @returns false if matrix inversion fails.
+     */
+    multiplyPlanesByMatrix4d(matrix, invert = true, transpose = true) {
+        if (invert) { // form inverse once here, reuse for all planes
+            const inverse = matrix.createInverse();
+            if (!inverse)
+                return false;
+            return this.multiplyPlanesByMatrix4d(inverse, false, transpose);
+        }
+        // no inverse necessary -- lower level cannot fail.
+        for (const clip of this._clips)
+            clip.multiplyPlanesByMatrix4d(matrix, false, transpose);
+        return true;
+    }
+    /**
+     * Determines whether the given points fall inside or outside this set of ClipShapes. If any set is defined by masking planes,
+     * checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the _clipplanes member.
+     */
+    classifyPointContainment(points, ignoreMasks = false) {
+        let currentContainment = ClipPlaneContainment.Ambiguous;
+        for (const primitive of this._clips) {
+            const thisContainment = primitive.classifyPointContainment(points, ignoreMasks);
+            if (ClipPlaneContainment.Ambiguous === thisContainment)
+                return ClipPlaneContainment.Ambiguous;
+            if (ClipPlaneContainment.Ambiguous === currentContainment)
+                currentContainment = thisContainment;
+            else if (currentContainment !== thisContainment)
+                return ClipPlaneContainment.Ambiguous;
+        }
+        return currentContainment;
+    }
+    /**
+     * Determines whether a 3D range lies inside or outside this set of ClipShapes. If any set is defined by masking planes,
+     * checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the clip planes member.
+     */
+    classifyRangeContainment(range, ignoreMasks) {
+        const corners = range.corners();
+        return this.classifyPointContainment(corners, ignoreMasks);
+    }
+    /**
+     * For an array of points (making up a LineString), tests whether the segment between each point lies inside the ClipVector.
+     * If true, returns true immediately.
+     */
+    isAnyLineStringPointInside(points) {
+        for (const clip of this._clips) {
+            const clipPlaneSet = clip.fetchClipPlanesRef();
+            if (clipPlaneSet !== undefined) {
+                for (let i = 0; i + 1 < points.length; i++) {
+                    const segment = LineSegment3d.create(points[i], points[i + 1]);
+                    if (clipPlaneSet.isAnyPointInOrOnFromSegment(segment))
+                        return true;
+                }
+            }
+        }
+        return false;
+    }
+    /** Note: Line segments are used to represent 1 dimensional intervals here, rather than segments. */
+    sumSizes(intervals, begin, end) {
+        let s = 0.0;
+        for (let i = begin; i < end; i++)
+            s += (intervals[i].x1 - intervals[i].x0);
+        return s;
+    }
+    /**
+     * For an array of points that make up a LineString, develops a line segment between each point pair,
+     * and returns true if all segments lie inside this ClipVector.
+     */
+    isLineStringCompletelyContained(points) {
+        const clipIntervals = [];
+        for (let i = 0; i + 1 < points.length; i++) {
+            const segment = LineSegment3d.create(points[i], points[i + 1]);
+            let fractionSum = 0.0;
+            let index0 = 0;
+            for (const clip of this._clips) {
+                const clipPlaneSet = clip.fetchClipPlanesRef();
+                if (clipPlaneSet !== undefined) {
+                    clipPlaneSet.appendIntervalsFromSegment(segment, clipIntervals);
+                    const index1 = clipIntervals.length;
+                    fractionSum += this.sumSizes(clipIntervals, index0, index1);
+                    index0 = index1;
+                    // ASSUME primitives are non-overlapping...
+                    if (fractionSum >= ClipVector._TARGET_FRACTION_SUM)
+                        break;
+                }
+            }
+            if (fractionSum < ClipVector._TARGET_FRACTION_SUM)
+                return false;
+        }
+        return true;
+    }
+    /** Serializes this ClipVector to a compact string representation appropriate for transmission as part of a URL.
+     * Chiefly used for requesting [Tile]($frontend)s with section cut facets.
+     * UnionOfConvexClipPlaneSets is obtained for each ClipPrimitive. The encoding is as follows:
+     *  ClipVector:
+     *    ClipPrimitive[]
+     *    _
+     *  ClipPrimitive:
+     *    invisible: 0|1
+     *    ConvexClipPlaneSet[]
+     *    _
+     *  ConvexClipPlaneSet:
+     *    ClipPlane[]
+     *    _
+     *  ClipPlane:
+     *    flags: 0|1|2|3, where 1=invisible and 2=interior
+     *    inwardNormal: Number[3]
+     *    distance: Number
+     *  Number:
+     *    number
+     *    _
+     * @alpha
+     */
+    toCompactString() {
+        function formatNumber(num) {
+            return `${num.toString()}_`;
+        }
+        function formatVector3d(vec) {
+            return `${formatNumber(vec.x)}${formatNumber(vec.y)}${formatNumber(vec.z)}`;
+        }
+        function formatFlags(flags) {
+            const f = flags.toString();
+            assert(1 === f.length);
+            return f;
+        }
+        function formatPlane(plane) {
+            let flags = plane.invisible ? 1 : 0;
+            flags |= (plane.interior ? 2 : 0);
+            return `${formatFlags(flags)}${formatVector3d(plane.inwardNormalRef)}${formatNumber(plane.distance)}`;
+        }
+        function formatPlaneSet(set) {
+            let planes = "";
+            for (const plane of set.planes)
+                planes = `${planes}${formatPlane(plane)}`;
+            return `${planes}_`;
+        }
+        function formatPrimitive(prim) {
+            const flags = prim.invisible ? 1 : 0;
+            let str = flags.toString();
+            assert(1 === str.length);
+            const union = prim.fetchClipPlanesRef();
+            if (union) {
+                for (const s of union.convexSets)
+                    str = `${str}${formatPlaneSet(s)}`;
+            }
+            return `${str}_`;
+        }
+        let result = "";
+        for (const primitive of this.clips)
+            result = `${result}${formatPrimitive(primitive)}`;
+        return `${result}_`;
+    }
+}
+ClipVector._TARGET_FRACTION_SUM = 0.99999999;
+/** Bundles a ClipVector with its compact string representation.
+ * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.
+ * @alpha
+ */
+export var StringifiedClipVector;
+(function (StringifiedClipVector) {
+    /** Create from a ClipVector.
+     * @param clip The ClipVector to stringify.
+     * @returns The input ClipVector with its compact string representation, or undefined if the input is undefined or empty.
+     * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.
+     */
+    function fromClipVector(clip) {
+        if (!clip || !clip.isValid)
+            return undefined;
+        const ret = clip;
+        if (undefined === ret.clipString)
+            ret.clipString = clip.toCompactString();
+        const stringified = ret;
+        assert(undefined !== stringified.clipString);
+        return stringified;
+    }
+    StringifiedClipVector.fromClipVector = fromClipVector;
+})(StringifiedClipVector || (StringifiedClipVector = {}));
+//# sourceMappingURL=ClipVector.js.map